WARNING: Excluded non-linear constraints:[<=(B,0)] warning: Ignored call to loop_cont_l3/4 in equation loop_cont_l1/4 Inferred cost of l2(A,B,C,D,E,F,G,H,I): l2(A,B,C,D,E,F,G,H,I):[21]: 0 with precondition: [C=0,D=0,E=1,H=0,I=0,F=A,B=G,B>=1] l2(A,B,C,D,E,F,G,H,I):[[19],20]: 1+it1*(1) Such that:it1=<1*B+ -1*C,it1=<1*H+ -1*C with precondition: [E=0,B=G+1,B=H,A+I=F,B>=C+1] l2(A,B,C,D,E,F,G,H,I):[[19],21]: 0+it1*(1) Such that:it1=<1*B+ -1*C,it1=<1*G+ -1*C,it1=<1*H+ -1*C with precondition: [E=1,A=F,B=G,H>=C+1,B>=H+1] Inferred cost of l1(A,B,C,D,E,F,G,H,I): l1(A,B,C,D,E,F,G,H,I):[24]: 1 with precondition: [A=0,E=1,B>=1] l1(A,B,C,D,E,F,G,H,I):[25]: 1+it1*(1) Such that:it1=<1*B,it1=<1*B+ -1 with precondition: [A=0,E=1,B>=2] l1(A,B,C,D,E,F,G,H,I):[26]: 1 with precondition: [A=0,E=0,F=0,G=B,H=C,I=D] l1(A,B,C,D,E,F,G,H,I):[27]: 0 with precondition: [A=0,E=1,F=0,G=B,H=C,I=D] l1(A,B,C,D,E,F,G,H,I):[[23],24]: 1+it1*(2+it2*(1)) Such that:it1=<1*B,it1=<1*B+ -1 it2=<1*B with precondition: [E=1,B>=2] l1(A,B,C,D,E,F,G,H,I):[[23],25]: 1+it1*(1)+it2*(2+it3*(1)) Such that:it1+it2=<1*B,it1+it2=<1*B+ -1,it2=<1*B it3=<1*B with precondition: [E=1,B>=3] l1(A,B,C,D,E,F,G,H,I):[[23],26]: 1+it1*(2+it2*(1)) Such that:it1=<1*B,it1=<1*B+ -1*G it2=<1*B with precondition: [E=0,G+1=H,G>=0,B>=G+1] l1(A,B,C,D,E,F,G,H,I):[[23],27]: 0+it1*(2+it2*(1)) Such that:it1=<1*B,it1=<1*B+ -1*G it2=<1*B with precondition: [E=1,G+1=H,G>=0,B>=G+1] Inferred cost of l3(A,B,C,D,E,F,G,H,I): l3(A,B,C,D,E,F,G,H,I):[30]: 0 with precondition: [E=1,F=A,G=B,H=C,I=D] l3(A,B,C,D,E,F,G,H,I):[[29],30]: 0+it1*(1) Such that:it1=<1*A,it1=<1*A+ -1*F with precondition: [E=1,B=G,C=H,D=I,F>=0,A>=F+1] Inferred cost of loop_cont_l1(A,B,C,D): loop_cont_l1(A,B,C,D):[32]: 0 with precondition: [] loop_cont_l1(A,B,C,D):[33]: 0+it1*(1) Such that:it1=<1*A with precondition: [A>=1] Inferred cost of l0(A,B,C,D): l0(A,B,C,D):[35]: 2 with precondition: [] l0(A,B,C,D):[36]: 2+it1*(2+it2*(1)) Such that:it1=<1*B it2=<1*B with precondition: [B>=1] l0(A,B,C,D):[37]: inf with precondition: [B>=1] l0(A,B,C,D):[38]: 2 with precondition: [B>=1] l0(A,B,C,D):[39]: 2+it1*(1) Such that:it1=<1*B,it1=<1*B+ -1 with precondition: [B>=2] l0(A,B,C,D):[40]: 1 with precondition: [] l0(A,B,C,D):[41]: 2+it1*(2+it2*(1)) Such that:it1=<1*B,it1=<1*B+ -1 it2=<1*B with precondition: [B>=2] l0(A,B,C,D):[42]: 2+it1*(1)+it2*(2+it3*(1)) Such that:it1+it2=<1*B,it1+it2=<1*B+ -1,it2=<1*B it3=<1*B with precondition: [B>=3] l0(A,B,C,D):[43]: 1+it1*(2+it2*(1)) Such that:it1=<1*B it2=<1*B with precondition: [B>=1] Solved cost expressions of l0(A,B,C,D): l0(A,B,C,D):[35]: 2 with precondition: [] l0(A,B,C,D):[36]: (1*B+2)* (1*B)+2 with precondition: [B>=1] l0(A,B,C,D):[37]: inf with precondition: [B>=1] l0(A,B,C,D):[38]: 2 with precondition: [B>=1] l0(A,B,C,D):[39]: 1*B+1 with precondition: [B>=2] l0(A,B,C,D):[40]: 1 with precondition: [] l0(A,B,C,D):[41]: (1*B+2)* (1*B+ -1)+2 with precondition: [B>=2] l0(A,B,C,D):[42]: max([1*B+ -1, (1*B+2)* (1*B+ -1)])+2 with precondition: [B>=3] l0(A,B,C,D):[43]: (1*B+2)* (1*B)+1 with precondition: [B>=1] Maximum cost of l0(A,B,C,D): inf Asymptotic class: infinity Time statistics: Partial evaluation computed in 11 ms. Invariants computed in 49 ms. ----Backward Invariants 26 ms. ----Transitive Invariants 6 ms. Refinement performed in 41 ms. Termination proved in 10 ms. Upper bounds computed in 71 ms. ----Phase cost structures 26 ms. --------Equation cost structures 20 ms. --------Inductive compression(1) 0 ms. --------Inductive compression(2) 0 ms. --------Black Cost 0 ms. ----Chain cost structures 37 ms. ----Solving cost expressions 2 ms. Compressed phase information: 4 Compressed Chains: 0 Compressed invariants: 0 Total analysis performed in 207 ms.