warning: Ignored call to evalSequentialSinglestop/2 in equation evalSequentialSinglereturnin/2 
Inferred cost of evalSequentialSinglebb1in(A,B,C,D,E): 
evalSequentialSinglebb1in(A,B,C,D,E):[21]: 2
  with precondition: [A=0,C=0,D=0,B=E,B>=1] 

evalSequentialSinglebb1in(A,B,C,D,E):[22]: 1
  with precondition: [A=0,C=0,D=0,B=E,0>=B] 

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

evalSequentialSinglebb1in(A,B,C,D,E):[[20],22]: 1+it1*(3)
  Such that:it1=<1*B,it1=<1*D,it1=<1*E,it1=<1*E+ -1*A
  with precondition: [C=0,E=B,E=D,A>=0,E>=A+1] 

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

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

Inferred cost of evalSequentialSinglereturnin(A,B): 
evalSequentialSinglereturnin(A,B):[27]: 1
  with precondition: [] 

Inferred cost of loop_cont_evalSequentialSinglebb5in(A,B): 
loop_cont_evalSequentialSinglebb5in(A,B):[29]: 1
  with precondition: [] 

Inferred cost of loop_cont_evalSequentialSinglebb1in(A,B): 
loop_cont_evalSequentialSinglebb1in(A,B):[31]: 2
  with precondition: [A>=B] 

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

Inferred cost of evalSequentialSingleentryin(A,B): 
evalSequentialSingleentryin(A,B):[34]: 5+it1*(2)
  Such that:it1=<1*B
  with precondition: [B>=1] 

evalSequentialSingleentryin(A,B):[35]: 4
  with precondition: [0>=B] 

evalSequentialSingleentryin(A,B):[36]: 5+it1*(3)+it2*(2)
  Such that:it1=<1*B,it1=<1*B+ -1,it1+it2=<1*B
  with precondition: [B>=2] 

evalSequentialSingleentryin(A,B):[37]: 4+it1*(3)
  Such that:it1=<1*B
  with precondition: [B>=1] 

Inferred cost of evalSequentialSinglestart(A,B): 
evalSequentialSinglestart(A,B):[39]: 6+it1*(2)
  Such that:it1=<1*B
  with precondition: [B>=1] 

evalSequentialSinglestart(A,B):[40]: 5
  with precondition: [0>=B] 

evalSequentialSinglestart(A,B):[41]: 6+it1*(3)+it2*(2)
  Such that:it1=<1*B,it1=<1*B+ -1,it1+it2=<1*B
  with precondition: [B>=2] 

evalSequentialSinglestart(A,B):[42]: 5+it1*(3)
  Such that:it1=<1*B
  with precondition: [B>=1] 

Solved cost expressions of evalSequentialSinglestart(A,B): 
evalSequentialSinglestart(A,B):[39]: 2*B+6  with precondition: [B>=1] 
evalSequentialSinglestart(A,B):[40]: 5  with precondition: [0>=B] 
evalSequentialSinglestart(A,B):[41]: 3*B+6  with precondition: [B>=2] 
evalSequentialSinglestart(A,B):[42]: 3*B+5  with precondition: [B>=1] 
Maximum cost of evalSequentialSinglestart(A,B): max([3*B+6,2*B+6,5]) 
Asymptotic class: n 
Time statistics: 
Partial evaluation computed in 7 ms.
Invariants computed in 20 ms.
----Backward Invariants 11 ms.
----Transitive Invariants 2 ms.
Refinement performed in 17 ms.
Termination proved in 4 ms.
Upper bounds computed in 38 ms.
----Phase cost structures 17 ms.
--------Equation cost structures 14 ms.
--------Inductive compression(1) 0 ms.
--------Inductive compression(2) 0 ms.
--------Black Cost 0 ms.
----Chain cost structures 14 ms.
----Solving cost expressions 1 ms.

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