warning: Ignored call to evalperfectstop/4 in equation evalperfectreturnin/4 Inferred cost of evalperfectbb4in(A,B,C,D,E,F,G,H,I): evalperfectbb4in(A,B,C,D,E,F,G,H,I):[27]: 1 with precondition: [E=0,G=B,A=D,A=F,C=H,A=I,C>=1,C>=A+1] evalperfectbb4in(A,B,C,D,E,F,G,H,I):[[26],27]: 1+it1*(2) Such that:it1=<1*A,it1=<1*D,it1=<1*F,it1=<-1*I+1*A,it1=<-1*I+1*F,it1=<1*D+ -1*I,it1=<-1*H+1*A+1,it1=<-1*H+1*F+1,it1=<1*D+ -1*C+1,it1=<1*D+ -1*H+1 with precondition: [E=0,A=F,B=G,C=H,I>=0,A>=D,C>=I+1,D>=C+I] Inferred cost of evalperfectbb8in(A,B,C,D,E,F,G,H,I): evalperfectbb8in(A,B,C,D,E,F,G,H,I):[[30,33],34]: 1+it1*(3+it2*(2))+it3*(3+it4*(2)) Such that:it1+it3=<1*C,it1+it3=<1*A+ -1,it3=<1*C,it3=<1*A+ -2,it3=<1*A+ -1,it3=<1*C+ -1 it2=<1*A it4=<1*A+ -1,it4=<1*A with precondition: [E=0,H=0,I=0,F=G,C>=1,A>=B,A>=C+1,B>=F+1] Inferred cost of evalperfectreturnin(A,B,C,D): evalperfectreturnin(A,B,C,D):[36]: 1 with precondition: [] Inferred cost of evalperfectbb9in(A,B,C,D): evalperfectbb9in(A,B,C,D):[38]: 2 with precondition: [0>=A+1] evalperfectbb9in(A,B,C,D):[39]: 2 with precondition: [A>=1] evalperfectbb9in(A,B,C,D):[40]: 2 with precondition: [A=0] Inferred cost of loop_cont_evalperfectbb8in(A,B,C,D): loop_cont_evalperfectbb8in(A,B,C,D):[42]: 2 with precondition: [0>=A+1] loop_cont_evalperfectbb8in(A,B,C,D):[43]: 2 with precondition: [A>=1] loop_cont_evalperfectbb8in(A,B,C,D):[44]: 2 with precondition: [A=0] Inferred cost of evalperfectbb1in(A,B,C,D): evalperfectbb1in(A,B,C,D):[46]: 4+it1*(3+it2*(2))+it3*(3+it4*(2)) Such that:it1+it3=<1*A+ -1,it3=<1*A+ -2,it3=<1*A+ -1 it2=<1*A it4=<1*A+ -1,it4=<1*A with precondition: [A>=2] evalperfectbb1in(A,B,C,D):[47]: 4+it1*(3+it2*(2))+it3*(3+it4*(2)) Such that:it1+it3=<1*A+ -1,it3=<1*A+ -2,it3=<1*A+ -1 it2=<1*A it4=<1*A+ -1,it4=<1*A with precondition: [A>=2] evalperfectbb1in(A,B,C,D):[48]: 4+it1*(3+it2*(2))+it3*(3+it4*(2)) Such that:it1+it3=<1*A+ -1,it3=<1*A+ -2,it3=<1*A+ -1 it2=<1*A it4=<1*A+ -1,it4=<1*A with precondition: [A>=2] Inferred cost of evalperfectentryin(A,B,C,D): evalperfectentryin(A,B,C,D):[50]: 2 with precondition: [1>=A] evalperfectentryin(A,B,C,D):[51]: 5+it1*(3+it2*(2))+it3*(3+it4*(2)) Such that:it1+it3=<1*A+ -1,it3=<1*A+ -2,it3=<1*A+ -1 it2=<1*A it4=<1*A+ -1,it4=<1*A with precondition: [A>=2] evalperfectentryin(A,B,C,D):[52]: 5+it1*(3+it2*(2))+it3*(3+it4*(2)) Such that:it1+it3=<1*A+ -1,it3=<1*A+ -2,it3=<1*A+ -1 it2=<1*A it4=<1*A+ -1,it4=<1*A with precondition: [A>=2] evalperfectentryin(A,B,C,D):[53]: 5+it1*(3+it2*(2))+it3*(3+it4*(2)) Such that:it1+it3=<1*A+ -1,it3=<1*A+ -2,it3=<1*A+ -1 it2=<1*A it4=<1*A+ -1,it4=<1*A with precondition: [A>=2] Inferred cost of evalperfectstart(A,B,C,D): evalperfectstart(A,B,C,D):[55]: 3 with precondition: [1>=A] evalperfectstart(A,B,C,D):[56]: 6+it1*(3+it2*(2))+it3*(3+it4*(2)) Such that:it1+it3=<1*A+ -1,it3=<1*A+ -2,it3=<1*A+ -1 it2=<1*A it4=<1*A+ -1,it4=<1*A with precondition: [A>=2] evalperfectstart(A,B,C,D):[57]: 6+it1*(3+it2*(2))+it3*(3+it4*(2)) Such that:it1+it3=<1*A+ -1,it3=<1*A+ -2,it3=<1*A+ -1 it2=<1*A it4=<1*A+ -1,it4=<1*A with precondition: [A>=2] evalperfectstart(A,B,C,D):[58]: 6+it1*(3+it2*(2))+it3*(3+it4*(2)) Such that:it1+it3=<1*A+ -1,it3=<1*A+ -2,it3=<1*A+ -1 it2=<1*A it4=<1*A+ -1,it4=<1*A with precondition: [A>=2] Solved cost expressions of evalperfectstart(A,B,C,D): evalperfectstart(A,B,C,D):[55]: 3 with precondition: [1>=A] evalperfectstart(A,B,C,D):[56]: max([ (2*A+1)* (1*A+ -1), (2*A+3)* (1*A+ -1)])+6 with precondition: [A>=2] evalperfectstart(A,B,C,D):[57]: max([ (2*A+1)* (1*A+ -1), (2*A+3)* (1*A+ -1)])+6 with precondition: [A>=2] evalperfectstart(A,B,C,D):[58]: max([ (2*A+1)* (1*A+ -1), (2*A+3)* (1*A+ -1)])+6 with precondition: [A>=2] Maximum cost of evalperfectstart(A,B,C,D): max([3,max([ (2*A+1)* (1*A+ -1), (2*A+3)* (1*A+ -1)])+6]) Asymptotic class: n^2 Time statistics: Partial evaluation computed in 17 ms. Invariants computed in 44 ms. ----Backward Invariants 15 ms. ----Transitive Invariants 11 ms. Refinement performed in 46 ms. Termination proved in 22 ms. Upper bounds computed in 105 ms. ----Phase cost structures 73 ms. --------Equation cost structures 56 ms. --------Inductive compression(1) 3 ms. --------Inductive compression(2) 0 ms. --------Black Cost 0 ms. ----Chain cost structures 23 ms. ----Solving cost expressions 3 ms. Compressed phase information: 0 Compressed Chains: 0 Compressed invariants: 0 Total analysis performed in 264 ms.