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

eval(A,B,C,D,E,F,G):[[7],8]: 0+it1*(1)
  Such that:it1=<1*B+ -1*F,it1=<1*E+1*G+ -1*A+ -1*C,it1=<1*B+ -1/2*E+ -1/2*F+ -1/2*G+101/2,it1=<1/2*E+1/2*F+1/2*G+ -1*A+ -1*C+101/2
  with precondition: [D=1,A+B+C=E+F+G,100>=A,101>=G,B>=C,B>=F+1,G+2*F+1>=A+B+C] 

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

start(A,B,C):[11]: 1+it1*(1)
  Such that:it1=<-1/2*A+ -1/2*C+1/2*B+51,it1=<1/2*B+ -1/2*A+ -1/2*C+101/2
  with precondition: [100>=A,B>=C] 

Solved cost expressions of start(A,B,C): 
start(A,B,C):[10]: 1  with precondition: [] 
start(A,B,C):[11]: -1/2*A+1/2*B+ -1/2*C+103/2  with precondition: [100>=A,B>=C] 
Maximum cost of start(A,B,C): max([-1/2*A+1/2*B+ -1/2*C+103/2,1]) 
Asymptotic class: n 
Time statistics: 
Partial evaluation computed in 3 ms.
Invariants computed in 11 ms.
----Backward Invariants 5 ms.
----Transitive Invariants 1 ms.
Refinement performed in 7 ms.
Termination proved in 3 ms.
Upper bounds computed in 17 ms.
----Phase cost structures 5 ms.
--------Equation cost structures 4 ms.
--------Inductive compression(1) 0 ms.
--------Inductive compression(2) 0 ms.
--------Black Cost 0 ms.
----Chain cost structures 9 ms.
----Solving cost expressions 1 ms.

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