warning: Ignored call to evalfstop/3 in equation evalfreturnin/3 Inferred cost of evalfbb3in(A,B,C,D,E,F,G): evalfbb3in(A,B,C,D,E,F,G):[20]: 0 with precondition: [D=1,E=A,B=F,C=G,C>=1,B>=C+1] evalfbb3in(A,B,C,D,E,F,G):[22]: 0 with precondition: [D=1,E=A,B=F,C=G,C>=1,B>=C+1] evalfbb3in(A,B,C,D,E,F,G):[[17],20]: 0+it1*(3) Such that:it1=<1*B+ -1,it1=<1*B+ -1*C,it1=<1*F+ -1,it1=<1*F+ -1*C,it1=<1*G+ -1,it1=<1*G+ -1*C with precondition: [D=1,A=E,B=F,A>=1,C>=1,G>=C+1,B>=G] evalfbb3in(A,B,C,D,E,F,G):[[17],21]: 1+it1*(3) Such that:it1=<1*B+ -1*C,it1=<1*F+ -1,it1=<1*F+ -1*C,it1=<1*G+ -1 with precondition: [D=0,A=E,B=F,B=G,A>=1,C>=1,B>=C+1] evalfbb3in(A,B,C,D,E,F,G):[[17],22]: 0+it1*(3) Such that:it1=<1*B+ -2,it1=<1*B+ -1*C,it1=<1*F+ -2,it1=<1*F+ -1,it1=<1*F+ -1*C,it1=<1*G+ -1,it1=<1*G+ -1*C with precondition: [D=1,A=E,B=F,A>=1,C>=1,G>=C+1,B>=G+1] evalfbb3in(A,B,C,D,E,F,G):[[18],19]: 1+it1*(3) Such that:it1=<1*C,it1=<1*B+ -1,it1=<1*F+ -1 with precondition: [D=0,G=0,A=E,B=F,0>=A,C>=1,B>=C+1] evalfbb3in(A,B,C,D,E,F,G):[[18],20]: 0+it1*(3) Such that:it1=<1*C,it1=<1*B+ -1,it1=<1*C+ -1*G,it1=<1*F+ -1,it1=<-1*G+1*B+ -1,it1=<-1*G+1*F+ -1 with precondition: [D=1,A=E,B=F,0>=A,G>=1,B>=C+1,C>=G+1] evalfbb3in(A,B,C,D,E,F,G):[[18],22]: 0+it1*(3) Such that:it1=<1*C,it1=<1*B+ -1,it1=<1*C+ -1*G,it1=<1*F+ -1,it1=<-1*G+1*B+ -1,it1=<-1*G+1*F+ -1 with precondition: [D=1,A=E,B=F,0>=A,G>=0,B>=C+1,C>=G+1] Inferred cost of evalfreturnin(A,B,C): evalfreturnin(A,B,C):[24]: 1 with precondition: [] Inferred cost of loop_cont_evalfbb3in(A,B,C): loop_cont_evalfbb3in(A,B,C):[26]: 1 with precondition: [] Inferred cost of evalfentryin(A,B,C): evalfentryin(A,B,C):[28]: 3+it1*(3) Such that:it1=<1*B+ -1,it1=<1*B+ -1*A with precondition: [A>=1,C>=1,B>=A+1] evalfentryin(A,B,C):[29]: 3+it1*(3) Such that:it1=<1*A,it1=<1*B+ -1 with precondition: [0>=C,A>=1,B>=A+1] evalfentryin(A,B,C):[30]: 1 with precondition: [A>=1,B>=A+1] evalfentryin(A,B,C):[31]: 1 with precondition: [A>=1,B>=A+1] evalfentryin(A,B,C):[32]: 1+it1*(3) Such that:it1=<-1*A+1*B,it1=<1*B+ -1,it1=<1*B+ -1*A with precondition: [A>=1,C>=1,B>=A+1] evalfentryin(A,B,C):[33]: 1+it1*(3) Such that:it1=<1*B+ -2,it1=<1*B+ -1,it1=<1*B+ -1*A,it1=<-1*A+1*B+ -1 with precondition: [A>=1,C>=1,B>=A+2] evalfentryin(A,B,C):[34]: 1+it1*(3) Such that:it1=<1*A,it1=<1*A+ -1,it1=<1*B+ -2,it1=<1*B+ -1 with precondition: [0>=C,A>=2,B>=A+1] evalfentryin(A,B,C):[35]: 1+it1*(3) Such that:it1=<1*A,it1=<1*B+ -1 with precondition: [0>=C,A>=1,B>=A+1] Inferred cost of evalfstart(A,B,C): evalfstart(A,B,C):[37]: 4+it1*(3) Such that:it1=<1*B+ -1,it1=<1*B+ -1*A with precondition: [A>=1,C>=1,B>=A+1] evalfstart(A,B,C):[38]: 4+it1*(3) Such that:it1=<1*A,it1=<1*B+ -1 with precondition: [0>=C,A>=1,B>=A+1] evalfstart(A,B,C):[39]: 2 with precondition: [A>=1,B>=A+1] evalfstart(A,B,C):[40]: 2 with precondition: [A>=1,B>=A+1] evalfstart(A,B,C):[41]: 2+it1*(3) Such that:it1=<1*B+ -1,it1=<1*B+ -1*A with precondition: [A>=1,C>=1,B>=A+1] evalfstart(A,B,C):[42]: 2+it1*(3) Such that:it1=<1*B+ -2,it1=<1*B+ -1,it1=<1*B+ -1*A,it1=<1*B+ -1*A+ -1 with precondition: [A>=1,C>=1,B>=A+2] evalfstart(A,B,C):[43]: 2+it1*(3) Such that:it1=<1*A,it1=<1*A+ -1,it1=<1*B+ -2,it1=<1*B+ -1 with precondition: [0>=C,A>=2,B>=A+1] evalfstart(A,B,C):[44]: 2+it1*(3) Such that:it1=<1*A,it1=<1*B+ -1 with precondition: [0>=C,A>=1,B>=A+1] Solved cost expressions of evalfstart(A,B,C): evalfstart(A,B,C):[37]: -3*A+3*B+4 with precondition: [A>=1,C>=1,B>=A+1] evalfstart(A,B,C):[38]: 3*A+4 with precondition: [0>=C,A>=1,B>=A+1] evalfstart(A,B,C):[39]: 2 with precondition: [A>=1,B>=A+1] evalfstart(A,B,C):[40]: 2 with precondition: [A>=1,B>=A+1] evalfstart(A,B,C):[41]: -3*A+3*B+2 with precondition: [A>=1,C>=1,B>=A+1] evalfstart(A,B,C):[42]: -3*A+3*B+ -1 with precondition: [A>=1,C>=1,B>=A+2] evalfstart(A,B,C):[43]: 3*A+ -1 with precondition: [0>=C,A>=2,B>=A+1] evalfstart(A,B,C):[44]: 3*A+2 with precondition: [0>=C,A>=1,B>=A+1] Maximum cost of evalfstart(A,B,C): max([-3*A+3*B+4,2,3*A+4]) Asymptotic class: n Time statistics: Partial evaluation computed in 9 ms. Invariants computed in 41 ms. ----Backward Invariants 26 ms. ----Transitive Invariants 3 ms. Refinement performed in 35 ms. Termination proved in 6 ms. Upper bounds computed in 84 ms. ----Phase cost structures 35 ms. --------Equation cost structures 34 ms. --------Inductive compression(1) 0 ms. --------Inductive compression(2) 0 ms. --------Black Cost 0 ms. ----Chain cost structures 36 ms. ----Solving cost expressions 2 ms. Compressed phase information: 4 Compressed Chains: 0 Compressed invariants: 0 Total analysis performed in 194 ms.