warning: Ignored call to loop_cont_f4/3 in equation f0/3 
Inferred cost of f4(A,B,C,D,E,F,G): 
f4(A,B,C,D,E,F,G):[10]: 0
  with precondition: [A=0,B=0,D=1,E=0,F=0,C=G,C>=1] 

f4(A,B,C,D,E,F,G):[[8,9],10]: 0+it1*(1)+it2*(1)
  Such that:it1=<nat(min([1*C+ -1,1*G+ -1,-1*B+1*C+ -1,1*C+ -1*A+ -1]))*min([1*C+ -1,1*G+ -1])+min([1*E,-1*B+1*E,1*A+ -1*B,1*C+ -1,1*G+ -1,1*C+1*F+ -2,1*E+1*F+ -1,1*F+1*G+ -2,-1*B+1*E+1*F+ -1]),it1=<nat(min([1*C+ -1,1*G+ -1,-1*B+1*C+ -1,1*C+ -1*A+ -1]))*min([1*C+ -1,1*G+ -1])+min([1*C+ -1,1*G+ -1,1*C+ -1*B+ -1]),it2=<1*E,it2=<-1*B+1*E,it2=<1*C+ -1,it2=<1*E+ -1*A,it2=<1*G+ -1,it2=<-1*B+1*C+ -1,it2=<1*C+ -1*A+ -1,it2=<nat(min([1*C+ -1,1*G+ -1,-1*B+1*C+ -1,1*C+ -1*A+ -1]))*min([1*C+ -1,1*G+ -1])+min([1*C+ -1,1*G+ -1,1*C+ -1*B+ -1])+min([1,1*B+ -1*A+1])
  with precondition: [D=1,C=G,B>=0,F>=0,E>=A,A>=B,E>=B+1,C>=E+1,E>=F,E+F>=A+1] 

Inferred cost of f0(A,B,C): 
f0(A,B,C):[12]: 1
  with precondition: [C>=1] 

f0(A,B,C):[13]: 1+it1*(1)+it2*(1)
  Such that:it1=<nat(min([1*C+ -1,1*C+ -1,1*C+ -1,1*C+ -1]))*min([1*C+ -1,1*C+ -1])+min([1*C+ -1,1*C+ -1,0,1*C+ -1,1*C+ -1,2*C+ -3,2*C+ -3,2*C+ -3,2*C+ -3]),it1=<nat(min([1*C+ -1,1*C+ -1,1*C+ -1,1*C+ -1]))*min([1*C+ -1,1*C+ -1])+min([1*C+ -1,1*C+ -1,1*C+ -1]),it2=<1*C+ -1,it2=<nat(min([1*C+ -1,1*C+ -1,1*C+ -1,1*C+ -1]))*min([1*C+ -1,1*C+ -1])+min([1*C+ -1,1*C+ -1,1*C+ -1])+min([1,1])
  with precondition: [C>=2] 

Solved cost expressions of f0(A,B,C): 
f0(A,B,C):[12]: 1  with precondition: [C>=1] 
f0(A,B,C):[13]: nat(min([1*C+ -1,1*C+ -1+ (1*C+ -1)* (1*C+ -1)+1]))+nat(min([ (1*C+ -1)* (1*C+ -1),1*C+ -1+ (1*C+ -1)* (1*C+ -1)]))+1  with precondition: [C>=2] 
Maximum cost of f0(A,B,C): max([1,nat(min([1*C+ -1,1*C+ -1+ (1*C+ -1)* (1*C+ -1)+1]))+nat(min([ (1*C+ -1)* (1*C+ -1),1*C+ -1+ (1*C+ -1)* (1*C+ -1)]))+1]) 
Asymptotic class: n^2 
Time statistics: 
Partial evaluation computed in 3 ms.
Invariants computed in 17 ms.
----Backward Invariants 8 ms.
----Transitive Invariants 2 ms.
Refinement performed in 13 ms.
Termination proved in 6 ms.
Upper bounds computed in 65 ms.
----Phase cost structures 22 ms.
--------Equation cost structures 19 ms.
--------Inductive compression(1) 0 ms.
--------Inductive compression(2) 0 ms.
--------Black Cost 0 ms.
----Chain cost structures 38 ms.
----Solving cost expressions 2 ms.

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