1  #define N 10000
       2  void foo (int);
       3  int test ()
       4  {
       5    int a[N+6];
       6    int i;
       7  
       8    for (i = 0; i < N; i++)
       9      a[i] += 32;
      10  
      11    for (i = 0; i < N; i++)
      12      {
      13        a[i] = i + 12;
      14  
      15        if (i == 40)
      16  	a[i] = i;
      17        else
      18  	a[i] = i+1;
      19  
      20  
      21        a[i] = i + 12;
      22        a[i] = a[i+1];
      23        a[i] += a[i+2];
      24        a[i] += a[i+3];
      25        a[i] += a[i+4];
      26        a[i] += a[i+5];
      27        a[i] += a[i+6];
      28  
      29      }
      30  
      31    return a[20];
      32  }
      33  /* { dg-final { scan-tree-dump-times "number of SCoPs: 1" 1 "graphite" } } */