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

evalfbb2in(A,B,C,D,E,F,G,H,I):[21]: 1
  with precondition: [C=0,E=0,H=0,B=A+1,B=D,B=F+1,B=G,B=I] 

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

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

Inferred cost of evalfbb6in(A,B,C,D,E,F,G,H,I): 
evalfbb6in(A,B,C,D,E,F,G,H,I):[27]: 1
  with precondition: [A=0,E=0,F=0,H=C,I=D,B=G,0>=B] 

evalfbb6in(A,B,C,D,E,F,G,H,I):[[23,25],24,26,27]: 9+it1*(3)+it2*(3)+it3*(5)
  Such that:it1=<1*B,it1=<1*F,it1=<1*G,it1=<1*I,it1=<-1*A+1*F,it1=<1*B+ -2,it1=<1*B+ -1,it1=<1*B+ -1*A,it1=<1*F+ -2,it1=<1*F+ -1,it1=<1*G+ -2,it1=<1*G+ -1,it1=<1*I+ -2,it1=<1*I+ -1,it1=<1*B+ -1*A+ -1,it1+it2=<1*B,it1+it2=<1*F,it1+it2=<1*G,it1+it2=<1*I,it1+it2=<-1*A+1*F,it1+it2=<1*B+ -1,it1+it2=<1*B+ -1*A,it1+it2=<1*F+ -1,it1+it2=<1*G+ -1,it1+it2=<1*I+ -1,it1+it2=<1*B+ -1*A+ -1,it1+it3=<1*B,it1+it3=<1*F,it1+it3=<1*G,it1+it3=<1*I,it1+it3=<-1*A+1*F,it1+it3=<1*B+ -1,it1+it3=<1*B+ -1*A,it1+it3=<1*F+ -1,it1+it3=<1*G+ -1,it1+it3=<1*I+ -1,it1+it3=<1*B+ -1*A+ -1,it2=<1*B+ -2,it2=<1*F+ -2,it2=<1*G+ -2,it2=<1*I+ -2,it2=<1*B+ -1*A+ -2,it3=<1*B+ -1,it3=<1*F+ -1,it3=<1*G+ -1,it3=<1*I+ -1,it3=<1*B+ -1*A+ -1
  with precondition: [E=0,H=0,B=F,B=G,B=I,A>=0,B>=A+3] 

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

evalfbb6in(A,B,C,D,E,F,G,H,I):[24,26,27]: 9+it1*(3)
  Such that:it1=<1*B+ -1,it1=<1*F+ -1,it1=<1*G+ -1,it1=<1*I+ -1
  with precondition: [A=0,E=0,H=0,B=F,B=G,B=I,B>=2] 

evalfbb6in(A,B,C,D,E,F,G,H,I):[26,27]: 5
  with precondition: [A=0,B=1,E=0,F=1,G=1,H=0,I=1] 

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

Inferred cost of loop_cont_evalfbb6in(A,B,C,D): 
loop_cont_evalfbb6in(A,B,C,D):[31]: 1
  with precondition: [] 

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

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

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

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

evalfentryin(A,B,C,D):[37]: 7
  with precondition: [B=1] 

Inferred cost of evalfstart(A,B,C,D): 
evalfstart(A,B,C,D):[39]: 4
  with precondition: [0>=B] 

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

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

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

evalfstart(A,B,C,D):[43]: 8
  with precondition: [B=1] 

Solved cost expressions of evalfstart(A,B,C,D): 
evalfstart(A,B,C,D):[39]: 4  with precondition: [0>=B] 
evalfstart(A,B,C,D):[40]: 8*B+1  with precondition: [B>=3] 
evalfstart(A,B,C,D):[41]: 8*B+ -3  with precondition: [B>=2] 
evalfstart(A,B,C,D):[42]: 3*B+9  with precondition: [B>=2] 
evalfstart(A,B,C,D):[43]: 8  with precondition: [B=1] 
Maximum cost of evalfstart(A,B,C,D): max([8*B+1,3*B+9,8]) 
Asymptotic class: n 
Time statistics: 
Partial evaluation computed in 18 ms.
Invariants computed in 65 ms.
----Backward Invariants 34 ms.
----Transitive Invariants 4 ms.
Refinement performed in 45 ms.
Termination proved in 9 ms.
Upper bounds computed in 377 ms.
----Phase cost structures 61 ms.
--------Equation cost structures 52 ms.
--------Inductive compression(1) 3 ms.
--------Inductive compression(2) 0 ms.
--------Black Cost 0 ms.
----Chain cost structures 307 ms.
----Solving cost expressions 2 ms.

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