warning: Ignored call to loop_cont_f6/4 in equation f0/4 Inferred cost of f6(A,B,C,D,E,F,G,H,I): f6(A,B,C,D,E,F,G,H,I):[12]: 1 with precondition: [A=0,B=0,E=1,F=0,G=0,C=D,C=H,C=I,C>=1] f6(A,B,C,D,E,F,G,H,I):[13]: 1 with precondition: [A=0,B=0,E=1,F=0,G=0,C=D,C=H,C=I,0>=C+1] f6(A,B,C,D,E,F,G,H,I):[14]: 1 with precondition: [A=0,B=0,C=0,D=0,E=1,F=0,G=0,H=0,I=0] f6(A,B,C,D,E,F,G,H,I):[[10],15]...: inf with precondition: [0>=A+1,1>=E,E>=0,B>=A,D>=C] f6(A,B,C,D,E,F,G,H,I):[[11],12]: 1+it1*(1) Such that:it1=<1*A,it1=<1*B,it1=<1*G,it1=<1*D+ -1,it1=<1*I+ -1 with precondition: [E=1,F=0,B=G,D=I,A+H=C,A>=1,B>=A,D>=B+1,D>=C] f6(A,B,C,D,E,F,G,H,I):[[11],13]: 1+it1*(1) Such that:it1=<1*A,it1=<1*B,it1=<1*G with precondition: [E=1,F=0,B=G,D=I,A+H=C,A>=1,B>=A,D>=C,B>=D+1] f6(A,B,C,D,E,F,G,H,I):[[11],14]: 1+it1*(1) Such that:it1=<1*A,it1=<1*B,it1=<1*D,it1=<1*G,it1=<1*I with precondition: [E=1,F=0,B=D,B=G,B=I,A+H=C,A>=1,B>=A,B>=C] Inferred cost of f0(A,B,C,D): f0(A,B,C,D):[16]: 2 with precondition: [B=0,D>=1] f0(A,B,C,D):[17]: 2 with precondition: [B=0,0>=D+1] f0(A,B,C,D):[18]: 2 with precondition: [B=0,D=0] f0(A,B,C,D):[19]: 2+it1*(1) Such that:it1=<1*B,it1=<1*D+ -1 with precondition: [B>=1,D>=B+1] f0(A,B,C,D):[20]: 2+it1*(1) Such that:it1=<1*B with precondition: [B>=1,B>=D+1] f0(A,B,C,D):[21]: 2+it1*(1) Such that:it1=<1*B,it1=<1*D with precondition: [B=D,B>=1] f0(A,B,C,D):[22]...: inf with precondition: [0>=B+1] f0(A,B,C,D):[23]...: inf with precondition: [0>=B+1] Solved cost expressions of f0(A,B,C,D): f0(A,B,C,D):[16]: 2 with precondition: [B=0,D>=1] f0(A,B,C,D):[17]: 2 with precondition: [B=0,0>=D+1] f0(A,B,C,D):[18]: 2 with precondition: [B=0,D=0] f0(A,B,C,D):[19]: 1*B+2 with precondition: [B>=1,D>=B+1] f0(A,B,C,D):[20]: 1*B+2 with precondition: [B>=1,B>=D+1] f0(A,B,C,D):[21]: 1*B+2 with precondition: [B=D,B>=1] f0(A,B,C,D):[22]...: inf with precondition: [0>=B+1] f0(A,B,C,D):[23]...: inf with precondition: [0>=B+1] Maximum cost of f0(A,B,C,D): inf Asymptotic class: infinity Time statistics: Partial evaluation computed in 5 ms. Invariants computed in 34 ms. ----Backward Invariants 18 ms. ----Transitive Invariants 4 ms. Refinement performed in 27 ms. Termination proved in 6 ms. Upper bounds computed in 50 ms. ----Phase cost structures 14 ms. --------Equation cost structures 14 ms. --------Inductive compression(1) 0 ms. --------Inductive compression(2) 0 ms. --------Black Cost 0 ms. ----Chain cost structures 31 ms. ----Solving cost expressions 1 ms. Compressed phase information: 2 Compressed Chains: 0 Compressed invariants: 0 Total analysis performed in 137 ms.