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

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

f1(A,B,C,D,E,F,G):[[8,9],11]...: inf
  with precondition: [1>=D,A>=1,D>=0] 

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

f0(A,B,C):[13]: inf
  with precondition: [A>=1] 

f0(A,B,C):[14]...: inf
  with precondition: [A>=1] 

f0(A,B,C):[15]...: inf
  with precondition: [A>=1] 

Solved cost expressions of f0(A,B,C): 
f0(A,B,C):[12]: 1  with precondition: [] 
f0(A,B,C):[13]: inf  with precondition: [A>=1] 
f0(A,B,C):[14]...: inf  with precondition: [A>=1] 
f0(A,B,C):[15]...: inf  with precondition: [A>=1] 
Maximum cost of f0(A,B,C): inf 
Asymptotic class: infinity 
Time statistics: 
Partial evaluation computed in 3 ms.
Invariants computed in 13 ms.
----Backward Invariants 7 ms.
----Transitive Invariants 2 ms.
Refinement performed in 13 ms.
Termination proved in 3 ms.
Upper bounds computed in 11 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 6 ms.
----Solving cost expressions 0 ms.

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