warning: Ignored call to evalfstop/3 in equation evalfreturnin/3 
Inferred cost of evalfbb2in(A,B,C,D,E,F,G): 
evalfbb2in(A,B,C,D,E,F,G):[18]: 1
  with precondition: [C=1,D=0,G=1,A=E,B=F,0>=A,B>=1] 

evalfbb2in(A,B,C,D,E,F,G):[[17],18]: 1+it1*(2)
  Such that:it1=<1*E,it1=<1*G+ -1,it1=<1*A+ -1*C+1,it1=<1*E+ -1*C+1
  with precondition: [D=0,A=E,B=F,A+1=G,B>=1,C>=1,A>=C] 

Inferred cost of evalfbb4in(A,B,C,D,E,F,G): 
evalfbb4in(A,B,C,D,E,F,G):[22]: 1
  with precondition: [D=0,E=A,G=C,B=F,0>=B] 

evalfbb4in(A,B,C,D,E,F,G):[[20],22]: 1+it1*(3)
  Such that:it1=<1*B
  with precondition: [D=0,F=0,G=1,A=E,0>=A,B>=1] 

evalfbb4in(A,B,C,D,E,F,G):[[21],22]: 1+it1*(3+it2*(2))
  Such that:it1=<1*B
            it2=<1*A
  with precondition: [D=0,F=0,A=E,A+1=G,A>=1,B>=1] 

Inferred cost of evalfreturnin(A,B,C): 
evalfreturnin(A,B,C):[24]: 1
  with precondition: [] 

Inferred cost of loop_cont_evalfbb4in(A,B,C): 
loop_cont_evalfbb4in(A,B,C):[26]: 1
  with precondition: [] 

Inferred cost of evalfentryin(A,B,C): 
evalfentryin(A,B,C):[28]: 3
  with precondition: [0>=A] 

evalfentryin(A,B,C):[29]: 3+it1*(3)
  Such that:it1=<1*A
  with precondition: [0>=B,A>=1] 

evalfentryin(A,B,C):[30]: 3+it1*(3+it2*(2))
  Such that:it1=<1*A
            it2=<1*B
  with precondition: [A>=1,B>=1] 

Inferred cost of evalfstart(A,B,C): 
evalfstart(A,B,C):[32]: 4
  with precondition: [0>=A] 

evalfstart(A,B,C):[33]: 4+it1*(3)
  Such that:it1=<1*A
  with precondition: [0>=B,A>=1] 

evalfstart(A,B,C):[34]: 4+it1*(3+it2*(2))
  Such that:it1=<1*A
            it2=<1*B
  with precondition: [A>=1,B>=1] 

Solved cost expressions of evalfstart(A,B,C): 
evalfstart(A,B,C):[32]: 4  with precondition: [0>=A] 
evalfstart(A,B,C):[33]: 3*A+4  with precondition: [0>=B,A>=1] 
evalfstart(A,B,C):[34]: (2*B+3)* (1*A)+4  with precondition: [A>=1,B>=1] 
Maximum cost of evalfstart(A,B,C): max([3*A+4,4, (2*B+3)* (1*A)+4]) 
Asymptotic class: n^2 
Time statistics: 
Partial evaluation computed in 8 ms.
Invariants computed in 27 ms.
----Backward Invariants 13 ms.
----Transitive Invariants 3 ms.
Refinement performed in 21 ms.
Termination proved in 8 ms.
Upper bounds computed in 33 ms.
----Phase cost structures 14 ms.
--------Equation cost structures 10 ms.
--------Inductive compression(1) 0 ms.
--------Inductive compression(2) 0 ms.
--------Black Cost 0 ms.
----Chain cost structures 14 ms.
----Solving cost expressions 1 ms.

Compressed phase information: 0 
Compressed Chains: 0 
Compressed invariants: 0 
Total analysis performed in 114 ms.