warning: Ignored call to evalfstop/3 in equation evalfreturnin/3 
Inferred cost of evalfbb2in(A,B,C,D,E,F,G): 
evalfbb2in(A,B,C,D,E,F,G):[19]: 2
  with precondition: [D=0,A=C,A=E,B=F,A=G,B>=A+1] 

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

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

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

evalfbb5in(A,B,C,D,E,F,G):[26]: 1
  with precondition: [A=0,D=0,E=0,G=C,B=F,0>=B] 

evalfbb5in(A,B,C,D,E,F,G):[[22,23],24,26]: 5+it1*(3)+it2*(5)+it3*(3)
  Such that:it1=<1*B+ -1,it1=<1*B+ -1/2,it1=<1*E+ -2,it1=<1*E+ -3/2,it1=<1*F+ -1,it1=<1*F+ -1/2,it1=<1*G+ -1,it1=<1*G+ -1/2,it1=<-1*A+1*F+ -1/2,it1+it2=<1*B,it1+it2=<1*F,it1+it2=<1*G,it1+it2=<1*B+ -1*A,it1+it2=<1*E+ -1,it1+it3=<1*B+ -1,it1+it3=<1*E+ -2,it1+it3=<1*F+ -1,it1+it3=<1*G+ -1,it1+it3=<1*B+ -1*A+ -1,it2=<1*B,it2=<1*F,it2=<1*G,it2=<1*B+ -1*A,it2=<1*E+ -1,it3=<1*B+ -1,it3=<1*E+ -2,it3=<1*F+ -1,it3=<1*G+ -1,it3=<1*B+ -1*A+ -1
  with precondition: [D=0,B+1=E,B=F,B=G,A>=0,B>=A+2] 

evalfbb5in(A,B,C,D,E,F,G):[[22,23],25]: 2+it1*(5)+it2*(3)
  Such that:it1=<1*B,it1=<1*E,it1=<1*F,it1=<1*B+ -1,it1=<1*E+ -1*A,it1=<1*F+ -1,it1=<1*F+ -1*A,it1=<1*G+1,it2=<1*G,it2=<1*B+ -2,it2=<1*B+ -1,it2=<1*E+ -1,it2=<1*F+ -2,it2=<1*F+ -1,it2=<1*E+ -1*A+ -1,it2=<1*F+ -1*A+ -1
  with precondition: [D=0,G+1=E,B=F,A>=0,G>=A,B>=G+2] 

evalfbb5in(A,B,C,D,E,F,G):[[22,23],26]: 1+it1*(5)+it2*(3)
  Such that:it1=<1*B,it1=<1*E,it1=<1*F,it1=<1*F+ -1*A,it1=<1*G+1,it2=<1*G,it2=<1*B+ -1,it2=<1*E+ -1,it2=<1*F+ -1,it2=<1*G+ -1*A
  with precondition: [D=0,F=B,F=E,F=G+1,A>=0,F>=A+1] 

evalfbb5in(A,B,C,D,E,F,G):[24,26]: 5+it1*(3)
  Such that:it1=<1*B,it1=<1*F,it1=<1*G,it1=<1*E+ -1
  with precondition: [A=0,D=0,B+1=E,B=F,B=G,B>=1] 

Inferred cost of evalfreturnin(A,B,C): 
evalfreturnin(A,B,C):[28]: 1
  with precondition: [] 

Inferred cost of loop_cont_evalfbb5in(A,B,C): 
loop_cont_evalfbb5in(A,B,C):[30]: 1
  with precondition: [] 

Inferred cost of evalfentryin(A,B,C): 
evalfentryin(A,B,C):[32]: 4
  with precondition: [B>=1] 

evalfentryin(A,B,C):[33]: 3
  with precondition: [0>=B] 

evalfentryin(A,B,C):[34]: 7+it1*(3)+it2*(5)+it3*(3)
  Such that:it1=<1*B+ -1,it1=<1*B+ -1/2,it1+it2=<1*B,it1+it3=<1*B+ -1,it2=<1*B,it3=<1*B+ -1
  with precondition: [B>=2] 

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

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

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

Inferred cost of evalfstart(A,B,C): 
evalfstart(A,B,C):[39]: 5
  with precondition: [B>=1] 

evalfstart(A,B,C):[40]: 4
  with precondition: [0>=B] 

evalfstart(A,B,C):[41]: 8+it1*(3)+it2*(5)+it3*(3)
  Such that:it1=<1*B+ -1,it1=<1*B+ -1/2,it1+it2=<1*B,it1+it3=<1*B+ -1,it2=<1*B,it3=<1*B+ -1
  with precondition: [B>=2] 

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

evalfstart(A,B,C):[43]: 4+it1*(5)+it2*(3)
  Such that:it1=<1*B,it2=<1*B+ -1
  with precondition: [B>=1] 

evalfstart(A,B,C):[44]: 8+it1*(3)
  Such that:it1=<1*B
  with precondition: [B>=1] 

Solved cost expressions of evalfstart(A,B,C): 
evalfstart(A,B,C):[39]: 5  with precondition: [B>=1] 
evalfstart(A,B,C):[40]: 4  with precondition: [0>=B] 
evalfstart(A,B,C):[41]: 8*B+5  with precondition: [B>=2] 
evalfstart(A,B,C):[42]: 8*B+ -6  with precondition: [B>=2] 
evalfstart(A,B,C):[43]: 8*B+1  with precondition: [B>=1] 
evalfstart(A,B,C):[44]: 3*B+8  with precondition: [B>=1] 
Maximum cost of evalfstart(A,B,C): max([8*B+5,5,3*B+8]) 
Asymptotic class: n 
Time statistics: 
Partial evaluation computed in 11 ms.
Invariants computed in 42 ms.
----Backward Invariants 23 ms.
----Transitive Invariants 2 ms.
Refinement performed in 29 ms.
Termination proved in 7 ms.
Upper bounds computed in 307 ms.
----Phase cost structures 61 ms.
--------Equation cost structures 57 ms.
--------Inductive compression(1) 3 ms.
--------Inductive compression(2) 0 ms.
--------Black Cost 0 ms.
----Chain cost structures 239 ms.
----Solving cost expressions 2 ms.

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