n>0 has 2 states: 6ms
 i>=1 has 2 states: 8ms
  (i>=1&endsIn2Zeros(i)) has 2 states: 1ms
   ((i>=1&endsIn2Zeros(i))&endsIn2Zeros(n)) has 2 states: 2ms
    k<n has 2 states: 0ms
     PF[f][(i+k)]=PF[f][((i+k)+n)] has 34 states: 143ms
      (k<n=>PF[f][(i+k)]=PF[f][((i+k)+n)]) has 59 states: 53ms
       (A k (k<n=>PF[f][(i+k)]=PF[f][((i+k)+n)])) has 36 states: 425ms
        (((i>=1&endsIn2Zeros(i))&endsIn2Zeros(n))&(A k (k<n=>PF[f][(i+k)]=PF[f][((i+k)+n)]))) has 37 states: 11ms
         (E f , i (((i>=1&endsIn2Zeros(i))&endsIn2Zeros(n))&(A k (k<n=>PF[f][(i+k)]=PF[f][((i+k)+n)])))) has 4 states: 5ms
          (n>0&(E f , i (((i>=1&endsIn2Zeros(i))&endsIn2Zeros(n))&(A k (k<n=>PF[f][(i+k)]=PF[f][((i+k)+n)]))))) has 4 states: 1ms
total computation time: 675ms