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

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

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

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

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

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

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

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

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

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

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

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

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

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

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