1  void bar ();
       2  
       3  int toto (int i, int b)
       4  {
       5    int j;
       6    int a[100];
       7  
       8    for (j = 0; j <= 20; j++)
       9      a[j] = b + i;
      10  
      11    if (a[12] == 23)
      12      b = 3;
      13    else
      14      b = 1;
      15  
      16    for (j = 0; j <= 20; j++)
      17      a[j] = b + i;
      18  
      19    return a[b];
      20  }
      21  
      22  /* { dg-final { scan-tree-dump-times "number of SCoPs: 0" 1 "graphite"} } */