warning: Ignored call to f0/6 in equation f4/6 
warning: Ignored call to loop_cont_f2/6 in equation f4/6 
warning: Ignored call to loop_cont_f2/6 in equation f4/6 
warning: Ignored call to f0/6 in equation f3/6 
warning: Ignored call to loop_cont_f2/6 in equation f3/6 
warning: Ignored call to loop_cont_f2/6 in equation f3/6 
Warning: the following predicates are never called:[f3/6]
Inferred cost of f2(A,B,C,D,E,F,G,H,I,J,K,L,M): 
f2(A,B,C,D,E,F,G,H,I,J,K,L,M):[13]: 1
  with precondition: [G=1,I=0,J=0,C=B,A=E+1,A=F+1,A=H,A=L+1,A=M+1,A>=2] 

f2(A,B,C,D,E,F,G,H,I,J,K,L,M):[[11,12],13]: inf
  with precondition: [G=1,I=0,J=0,B=C,M=E,M=F,M=L,M>=1,H>=A+1,A>=M+1] 

f2(A,B,C,D,E,F,G,H,I,J,K,L,M):[[11,12],14]...: inf
  with precondition: [B=C,E=F,1>=G,E>=1,G>=0,A>=E+1] 

Inferred cost of f4(A,B,C,D,E,F): 
f4(A,B,C,D,E,F):[15]: 1
  with precondition: [] 

f4(A,B,C,D,E,F):[16]: 2
  with precondition: [] 

f4(A,B,C,D,E,F):[17]: inf
  with precondition: [] 

f4(A,B,C,D,E,F):[18]: 2
  with precondition: [] 

f4(A,B,C,D,E,F):[19]: inf
  with precondition: [] 

f4(A,B,C,D,E,F):[20]...: inf
  with precondition: [] 

f4(A,B,C,D,E,F):[21]...: inf
  with precondition: [] 

f4(A,B,C,D,E,F):[22]...: inf
  with precondition: [] 

f4(A,B,C,D,E,F):[23]...: inf
  with precondition: [] 

Solved cost expressions of f4(A,B,C,D,E,F): 
f4(A,B,C,D,E,F):[15]: 1  with precondition: [] 
f4(A,B,C,D,E,F):[16]: 2  with precondition: [] 
f4(A,B,C,D,E,F):[17]: inf  with precondition: [] 
f4(A,B,C,D,E,F):[18]: 2  with precondition: [] 
f4(A,B,C,D,E,F):[19]: inf  with precondition: [] 
f4(A,B,C,D,E,F):[20]...: inf  with precondition: [] 
f4(A,B,C,D,E,F):[21]...: inf  with precondition: [] 
f4(A,B,C,D,E,F):[22]...: inf  with precondition: [] 
f4(A,B,C,D,E,F):[23]...: inf  with precondition: [] 
Maximum cost of f4(A,B,C,D,E,F): inf 
Asymptotic class: infinity 
Time statistics: 
Partial evaluation computed in 7 ms.
Invariants computed in 25 ms.
----Backward Invariants 12 ms.
----Transitive Invariants 4 ms.
Refinement performed in 26 ms.
Termination proved in 7 ms.
Upper bounds computed in 19 ms.
----Phase cost structures 6 ms.
--------Equation cost structures 5 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 105 ms.