1  int toto()
       2  {
       3    int i,j, b;
       4    int a[100];
       5  
       6    if (i == 20)
       7      {
       8        for (j = 0; j <= 20; j++)
       9          a[j] = b + i;
      10        for (j = 2; j <= 23; j++)
      11          a[j] = b + i;
      12        b = 3;
      13      }
      14    else if (i == 12)
      15      {
      16        if (i == 30)
      17  	{
      18            for (j = 0; j <= 30; j++)
      19              a[j] = b + i;
      20  	  b = 5;
      21  	}
      22        else
      23  	{
      24            for (j = 0; j <= 40; j++)
      25              a[j] = b + i;
      26  	  b = 8;
      27  	}
      28      }
      29    else if (i == 10)
      30      {
      31        b = 8;
      32      }
      33  
      34    for (j = 0; j <= 40; j++)
      35      a[j] = b + i;
      36  
      37    return a[b];
      38  }
      39  
      40  /* { dg-final { scan-tree-dump-times "number of SCoPs: 1" 1 "graphite"} } */