warning: Ignored call to stop/6 in equation start/6 
warning: Ignored call to loop_cont_lbl101/6 in equation start/6 
warning: Ignored call to loop_cont_lbl101/6 in equation start/6 
Inferred cost of lbl101(A,B,C,D,E,F,G,H,I,J,K,L,M): 
lbl101(A,B,C,D,E,F,G,H,I,J,K,L,M):[15]: 1
  with precondition: [A=1,B=2,D=1,G=1,H=1,I=2,K=1,J=C,M=F,E=L,1>=E,E+1>=0] 

lbl101(A,B,C,D,E,F,G,H,I,J,K,L,M):[[13,14],15]: 1+it1*(1)
  Such that:it1=<-1*E+1*D,it1=<-1*E+1*H,it1=<1*D+ -1,it1=<1*D+1*E,it1=<1*E+1*H,it1=<1*H+ -1,it1=<1*A+ -1*B+1,it1=<1*D+ -1*B+1
  with precondition: [G=1,A=D,A=H,A+1=I,C=J,A=K,F=M,B>=2,A>=B,B>=E+1,B+E>=1,A+L+1>=B+E,A+E+1>=B+L] 

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

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

start(A,B,C,D,E,F):[19]: 2+it1*(1)
  Such that:it1=<1*A+ -1,it1=<1*A+1,it1=<1*D+ -1,it1=<1*D+1
  with precondition: [D=A,C=B,F=E,D>=2] 

start(A,B,C,D,E,F):[20]: 2
  with precondition: [A=1,D=1,C=B,F=E] 

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

Inferred cost of start0(A,B,C,D,E,F): 
start0(A,B,C,D,E,F):[23]: 2
  with precondition: [0>=A] 

start0(A,B,C,D,E,F):[24]: 3
  with precondition: [A=1] 

start0(A,B,C,D,E,F):[25]: 3+it1*(1)
  Such that:it1=<1*A+ -1,it1=<1*A+1
  with precondition: [A>=2] 

start0(A,B,C,D,E,F):[26]: 3
  with precondition: [A=1] 

start0(A,B,C,D,E,F):[27]: 3+it1*(1)
  Such that:it1=<1*A+ -1,it1=<1*A+1
  with precondition: [A>=2] 

Solved cost expressions of start0(A,B,C,D,E,F): 
start0(A,B,C,D,E,F):[23]: 2  with precondition: [0>=A] 
start0(A,B,C,D,E,F):[24]: 3  with precondition: [A=1] 
start0(A,B,C,D,E,F):[25]: 1*A+2  with precondition: [A>=2] 
start0(A,B,C,D,E,F):[26]: 3  with precondition: [A=1] 
start0(A,B,C,D,E,F):[27]: 1*A+2  with precondition: [A>=2] 
Maximum cost of start0(A,B,C,D,E,F): max([1*A+2,3]) 
Asymptotic class: n 
Time statistics: 
Partial evaluation computed in 9 ms.
Invariants computed in 30 ms.
----Backward Invariants 12 ms.
----Transitive Invariants 5 ms.
Refinement performed in 36 ms.
Termination proved in 16 ms.
Upper bounds computed in 52 ms.
----Phase cost structures 24 ms.
--------Equation cost structures 23 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: 0 
Compressed Chains: 0 
Compressed invariants: 0 
Total analysis performed in 168 ms.