warning: Ignored call to loop_cont_f1/5 in equation f0/5 
Inferred cost of f1(A,B,C,D,E,F,G,H,I,J,K): 
f1(A,B,C,D,E,F,G,H,I,J,K):[[10,11,12,13],14]: inf
  with precondition: [F=1,I=1,1>=C,B>=1,C>=0,H>=0,J>=G,H>=K] 

f1(A,B,C,D,E,F,G,H,I,J,K):[[10,11,12,13],15]...: inf
  with precondition: [1>=C,1>=F,B>=1,C>=0,F>=0] 

Inferred cost of f0(A,B,C,D,E): 
f0(A,B,C,D,E):[16]: inf
  with precondition: [] 

f0(A,B,C,D,E):[17]...: inf
  with precondition: [] 

f0(A,B,C,D,E):[18]...: inf
  with precondition: [] 

Solved cost expressions of f0(A,B,C,D,E): 
f0(A,B,C,D,E):[16]: inf  with precondition: [] 
f0(A,B,C,D,E):[17]...: inf  with precondition: [] 
f0(A,B,C,D,E):[18]...: inf  with precondition: [] 
Maximum cost of f0(A,B,C,D,E): inf 
Asymptotic class: infinity 
Time statistics: 
Partial evaluation computed in 7 ms.
Invariants computed in 34 ms.
----Backward Invariants 16 ms.
----Transitive Invariants 5 ms.
Refinement performed in 31 ms.
Termination proved in 15 ms.
Upper bounds computed in 22 ms.
----Phase cost structures 7 ms.
--------Equation cost structures 2 ms.
--------Inductive compression(1) 0 ms.
--------Inductive compression(2) 0 ms.
--------Black Cost 0 ms.
----Chain cost structures 11 ms.
----Solving cost expressions 1 ms.

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