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

merge(A,B,C,D,E):[[8,9],10]: 0+it1*(1)+it2*(1)
  Such that:it1=<1*A,it1=<1*A+ -1*D,it1+it2=<1*A+1*B+ -1,it1+it2=<1*A+1*B+ -1*D+ -1*E,it2=<1*B,it2=<1*B+ -1*E
  with precondition: [C=1,A>=1,B>=1,D>=0,E>=0,A>=D,B>=E,D+E>=1,A+B>=D+E+1] 

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

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

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

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