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

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

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

Inferred cost of eval1(A,B,C,D,E): 
eval1(A,B,C,D,E):[17]: 1
  with precondition: [C=1,A>=0] 

eval1(A,B,C,D,E):[18]: 1+it1*(1)
  Such that:it1=<1*A+1
  with precondition: [C=1,A>=0] 

eval1(A,B,C,D,E):[19]: 0
  with precondition: [C=1,D=A,E=B] 

eval1(A,B,C,D,E):[[16],17]: 1+it1*(2+it2*(1))
  Such that:it1=<1*A,it1=<1*A+1
            it2=<1*A+1
  with precondition: [C=1,A>=1] 

eval1(A,B,C,D,E):[[16],18]: 1+it1*(1)+it2*(2+it3*(1))
  Such that:it1+it2=<1*A+1,it2=<1*A+1
            it3=<1*A+1
  with precondition: [C=1,A>=1] 

eval1(A,B,C,D,E):[[16],19]: 0+it1*(2+it2*(1))
  Such that:it1=<1*A+1,it1=<1*A+ -1*D
            it2=<1*A+1
  with precondition: [C=1,D+3=E,D+1>=0,A>=D+1] 

Inferred cost of start(A,B): 
start(A,B):[21]: 2
  with precondition: [A>=0] 

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

start(A,B):[23]: 1
  with precondition: [] 

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

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

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

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

Compressed phase information: 5 
Compressed Chains: 0 
Compressed invariants: 0 
Total analysis performed in 109 ms.