warning: Ignored call to loop_cont_f1/2 in equation f0/2 
Inferred cost of f1(A,B,C,D,E): 
f1(A,B,C,D,E):[8]: 0
  with precondition: [C=1,A=D,B=E,0>=B+1,A>=1] 

f1(A,B,C,D,E):[[7],8]: inf
  with precondition: [C=1,B=E,0>=B+1,A>=1,B+D>=A] 

f1(A,B,C,D,E):[[7],9]...: inf
  with precondition: [0>=B+1,1>=C,A>=1,C>=0] 

Inferred cost of f0(A,B): 
f0(A,B):[10]: 1
  with precondition: [0>=B+1,A>=1] 

f0(A,B):[11]: inf
  with precondition: [0>=B+1,A>=1] 

f0(A,B):[12]...: inf
  with precondition: [0>=B+1,A>=1] 

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

Solved cost expressions of f0(A,B): 
f0(A,B):[10]: 1  with precondition: [0>=B+1,A>=1] 
f0(A,B):[11]: inf  with precondition: [0>=B+1,A>=1] 
f0(A,B):[12]...: inf  with precondition: [0>=B+1,A>=1] 
f0(A,B):[13]...: inf  with precondition: [0>=B+1,A>=1] 
Maximum cost of f0(A,B): inf 
Asymptotic class: infinity 
Time statistics: 
Partial evaluation computed in 2 ms.
Invariants computed in 10 ms.
----Backward Invariants 4 ms.
----Transitive Invariants 1 ms.
Refinement performed in 7 ms.
Termination proved in 2 ms.
Upper bounds computed in 10 ms.
----Phase cost structures 2 ms.
--------Equation cost structures 0 ms.
--------Inductive compression(1) 0 ms.
--------Inductive compression(2) 0 ms.
--------Black Cost 0 ms.
----Chain cost structures 5 ms.
----Solving cost expressions 0 ms.

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