warning: Ignored call to loop_cont_f1/3 in equation f2/3 
Inferred cost of f1(A,B,C,D,E,F,G): 
f1(A,B,C,D,E,F,G):[10]: 1
  with precondition: [D=1,A=E,B=F,A>=B+1] 

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

f1(A,B,C,D,E,F,G):[9,10]: 2
  with precondition: [D=1,A=B,A+1=E,A=F] 

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

f2(A,B,C):[13]: 3+it1*(1)
  Such that:it1=<1*B+ -1*A
  with precondition: [B>=A+1] 

f2(A,B,C):[14]: 3
  with precondition: [B=A] 

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

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