warning: Ignored call to loop_cont_eval/2 in equation start/2 
Inferred cost of eval(A,B,C,D,E): 
eval(A,B,C,D,E):[14]: 0
  with precondition: [C=1,D=A,E=B] 

eval(A,B,C,D,E):[[13],12,14]: 1+it1*(1)
  Such that:it1=<1*A,it1=<1*B,it1=<1*D,it1=<1*A+ -1,it1=<1*B+ -1,it1=<1*D+ -1
  with precondition: [C=1,E=0,A=D,B>=2,A>=B] 

eval(A,B,C,D,E):[[13],14]: 0+it1*(1)
  Such that:it1=<1*A,it1=<1*B,it1=<1*D,it1=<-1*E+1*A,it1=<-1*E+1*D,it1=<1*B+ -1*E
  with precondition: [C=1,A=D,E>=0,A>=B,B>=E+1] 

eval(A,B,C,D,E):[10,14]: 1
  with precondition: [B=1,C=1,A=D,A=E,0>=A] 

eval(A,B,C,D,E):[11,[13],12,14]: 2+it1*(1)
  Such that:it1=<1*A,it1=<1*D,it1=<1*A+ -1,it1=<1*B+ -2,it1=<1*B+ -1,it1=<1*D+ -1
  with precondition: [C=1,E=0,A=D,A>=2,B>=A+1] 

eval(A,B,C,D,E):[11,[13],14]: 1+it1*(1)
  Such that:it1=<1*A,it1=<1*D,it1=<1*A+ -1*E,it1=<1*B+ -1,it1=<1*D+ -1*E,it1=<-1*E+1*B+ -1
  with precondition: [C=1,A=D,E>=0,B>=A+1,A>=E+1] 

eval(A,B,C,D,E):[11,12,14]: 2
  with precondition: [A=1,C=1,D=1,E=0,B>=2] 

eval(A,B,C,D,E):[11,14]: 1
  with precondition: [C=1,A=D,A=E,B>=1,B>=A+1] 

eval(A,B,C,D,E):[12,14]: 1
  with precondition: [B=1,C=1,E=0,A=D,A>=1] 

Inferred cost of start(A,B): 
start(A,B):[16]: 1
  with precondition: [] 

start(A,B):[17]: 2+it1*(1)
  Such that:it1=<1*A,it1=<1*B,it1=<1*A+ -1,it1=<1*B+ -1
  with precondition: [B>=2,A>=B] 

start(A,B):[18]: 1+it1*(1)
  Such that:it1=<1*A,it1=<1*B
  with precondition: [B>=1,A>=B] 

start(A,B):[19]: 2
  with precondition: [B=1,0>=A] 

start(A,B):[20]: 3+it1*(1)
  Such that:it1=<1*A,it1=<1*A+ -1,it1=<1*B+ -2,it1=<1*B+ -1
  with precondition: [A>=2,B>=A+1] 

start(A,B):[21]: 2+it1*(1)
  Such that:it1=<1*A,it1=<1*B+ -1
  with precondition: [A>=1,B>=A+1] 

start(A,B):[22]: 3
  with precondition: [A=1,B>=2] 

start(A,B):[23]: 2
  with precondition: [B>=1,B>=A+1] 

start(A,B):[24]: 2
  with precondition: [B=1,A>=1] 

Solved cost expressions of start(A,B): 
start(A,B):[16]: 1  with precondition: [] 
start(A,B):[17]: 1*B+1  with precondition: [B>=2,A>=B] 
start(A,B):[18]: 1*B+1  with precondition: [B>=1,A>=B] 
start(A,B):[19]: 2  with precondition: [B=1,0>=A] 
start(A,B):[20]: 1*A+2  with precondition: [A>=2,B>=A+1] 
start(A,B):[21]: 1*A+2  with precondition: [A>=1,B>=A+1] 
start(A,B):[22]: 3  with precondition: [A=1,B>=2] 
start(A,B):[23]: 2  with precondition: [B>=1,B>=A+1] 
start(A,B):[24]: 2  with precondition: [B=1,A>=1] 
Maximum cost of start(A,B): max([1*B+1,3,1*A+2]) 
Asymptotic class: n 
Time statistics: 
Partial evaluation computed in 4 ms.
Invariants computed in 43 ms.
----Backward Invariants 23 ms.
----Transitive Invariants 1 ms.
Refinement performed in 23 ms.
Termination proved in 3 ms.
Upper bounds computed in 78 ms.
----Phase cost structures 21 ms.
--------Equation cost structures 21 ms.
--------Inductive compression(1) 0 ms.
--------Inductive compression(2) 0 ms.
--------Black Cost 0 ms.
----Chain cost structures 50 ms.
----Solving cost expressions 2 ms.

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