MAYBE * Step 1: ArgumentFilter MAYBE + Considered Problem: Rules: 0. f9(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y) -> f1(A1,2,B1,C1,B1,F,G,H,I,J,A1,L,M,N,O,P,Q,R,S,T,Z,V,B1,D1,Y) [A1 >= 2] (1,1) 1. f9(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y) -> f10(B1,D1,C1,K1,H1,F,G,P1,I,O1,A1,0,L1,M1,N1,Q1,F1,R,S,T,Z,E1,G1,X,Y) [0 >= I1 && 0 >= A1 && 0 >= J1] (1,1) 2. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y) -> f8(A1,C1,B1,H1,G1,F,G,C,R,0,Z,C,C,0,C,C,E1,R,S,T,U,D1,F1,X,1 + R) [-2 + B >= 0 (?,1) && -4 + B + K >= 0 && -2 + K >= 0 && K1 >= Z && L1 >= 2 && C1 >= L1 && B >= A && B >= 0 && 0 >= 1 + C && C1 >= 0 && Z >= 2] 3. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y) -> f8(A1,C1,B1,H1,G1,F,G,C,R,0,Z,C,C,0,C,C,E1,R,S,T,U,D1,F1,X,1 + R) [-2 + B >= 0 (?,1) && -4 + B + K >= 0 && -2 + K >= 0 && K1 >= Z && L1 >= 2 && C1 >= L1 && B >= A && B >= 0 && C >= 1 && C1 >= 0 && Z >= 2] 4. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y) -> f1(A,1 + B,D,Z,D,A1,B,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y) [-2 + B >= 0 && -4 + B + K >= 0 && -2 + K >= 0 && A >= 1 + B && B >= 0] (?,1) 5. f8(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y) -> f8(A,B,C,D,E,F,G,H,I,0,Z,A1,A1,0,A1,H,Q,-1 + R,B1,-1 + R,U,V,W,X,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && H >= 1 + C1 && R >= 0 && C1 >= 1 + A1 && Z >= 2 && J = 0] 6. f8(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y) -> f8(A,B,C,D,E,F,G,H,I,0,Z,A1,A1,0,A1,H,Q,-1 + R,B1,-1 + R,U,V,W,X,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && H >= 1 + C1 && R >= 0 && A1 >= 1 + C1 && Z >= 2 && J = 0] 7. f8(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y) -> f8(A,B,C,D,E,F,G,H,I,0,Z,A1,A1,0,A1,H,Q,-1 + R,B1,-1 + R,U,V,W,X,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && C1 >= 1 + H && R >= 0 && C1 >= 1 + A1 && Z >= 2 && J = 0] 8. f8(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y) -> f8(A,B,C,D,E,F,G,H,I,0,Z,A1,A1,0,A1,H,Q,-1 + R,B1,-1 + R,U,V,W,X,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && C1 >= 1 + H && R >= 0 && A1 >= 1 + C1 && Z >= 2 && J = 0] 9. f8(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y) -> f10(A,B,C,D,E,F,G,F1,I,E1,Z,L,B1,C1,D1,G1,A1,R,S,T,U,V,W,X,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && Z >= 2 && R >= 0 && J = H] Signature: {(f1,25);(f10,25);(f8,25);(f9,25)} Flow Graph: [0->{2,3,4},1->{},2->{5,6,7,8,9},3->{5,6,7,8,9},4->{2,3,4},5->{5,6,7,8,9},6->{5,6,7,8,9},7->{5,6,7,8,9} ,8->{5,6,7,8,9},9->{}] + Applied Processor: ArgumentFilter [3,4,5,6,11,12,14,16,18,19,20,21,22,23] + Details: We remove following argument positions: [3,4,5,6,11,12,14,16,18,19,20,21,22,23]. * Step 2: TrivialSCCs MAYBE + Considered Problem: Rules: 0. f9(A,B,C,H,I,J,K,N,P,R,Y) -> f1(A1,2,B1,H,I,J,A1,N,P,R,Y) [A1 >= 2] (1,1) 1. f9(A,B,C,H,I,J,K,N,P,R,Y) -> f10(B1,D1,C1,P1,I,O1,A1,M1,Q1,R,Y) [0 >= I1 && 0 >= A1 && 0 >= J1] (1,1) 2. f1(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A1,C1,B1,C,R,0,Z,0,C,R,1 + R) [-2 + B >= 0 (?,1) && -4 + B + K >= 0 && -2 + K >= 0 && K1 >= Z && L1 >= 2 && C1 >= L1 && B >= A && B >= 0 && 0 >= 1 + C && C1 >= 0 && Z >= 2] 3. f1(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A1,C1,B1,C,R,0,Z,0,C,R,1 + R) [-2 + B >= 0 (?,1) && -4 + B + K >= 0 && -2 + K >= 0 && K1 >= Z && L1 >= 2 && C1 >= L1 && B >= A && B >= 0 && C >= 1 && C1 >= 0 && Z >= 2] 4. f1(A,B,C,H,I,J,K,N,P,R,Y) -> f1(A,1 + B,D,H,I,J,K,N,P,R,Y) [-2 + B >= 0 && -4 + B + K >= 0 && -2 + K >= 0 && A >= 1 + B && B >= 0] (?,1) 5. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A,B,C,H,I,0,Z,0,H,-1 + R,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && H >= 1 + C1 && R >= 0 && C1 >= 1 + A1 && Z >= 2 && J = 0] 6. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A,B,C,H,I,0,Z,0,H,-1 + R,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && H >= 1 + C1 && R >= 0 && A1 >= 1 + C1 && Z >= 2 && J = 0] 7. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A,B,C,H,I,0,Z,0,H,-1 + R,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && C1 >= 1 + H && R >= 0 && C1 >= 1 + A1 && Z >= 2 && J = 0] 8. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A,B,C,H,I,0,Z,0,H,-1 + R,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && C1 >= 1 + H && R >= 0 && A1 >= 1 + C1 && Z >= 2 && J = 0] 9. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f10(A,B,C,F1,I,E1,Z,C1,G1,R,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && Z >= 2 && R >= 0 && J = H] Signature: {(f1,25);(f10,25);(f8,25);(f9,25)} Flow Graph: [0->{2,3,4},1->{},2->{5,6,7,8,9},3->{5,6,7,8,9},4->{2,3,4},5->{5,6,7,8,9},6->{5,6,7,8,9},7->{5,6,7,8,9} ,8->{5,6,7,8,9},9->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 3: UnsatPaths MAYBE + Considered Problem: Rules: 0. f9(A,B,C,H,I,J,K,N,P,R,Y) -> f1(A1,2,B1,H,I,J,A1,N,P,R,Y) [A1 >= 2] (1,1) 1. f9(A,B,C,H,I,J,K,N,P,R,Y) -> f10(B1,D1,C1,P1,I,O1,A1,M1,Q1,R,Y) [0 >= I1 && 0 >= A1 && 0 >= J1] (1,1) 2. f1(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A1,C1,B1,C,R,0,Z,0,C,R,1 + R) [-2 + B >= 0 (1,1) && -4 + B + K >= 0 && -2 + K >= 0 && K1 >= Z && L1 >= 2 && C1 >= L1 && B >= A && B >= 0 && 0 >= 1 + C && C1 >= 0 && Z >= 2] 3. f1(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A1,C1,B1,C,R,0,Z,0,C,R,1 + R) [-2 + B >= 0 (1,1) && -4 + B + K >= 0 && -2 + K >= 0 && K1 >= Z && L1 >= 2 && C1 >= L1 && B >= A && B >= 0 && C >= 1 && C1 >= 0 && Z >= 2] 4. f1(A,B,C,H,I,J,K,N,P,R,Y) -> f1(A,1 + B,D,H,I,J,K,N,P,R,Y) [-2 + B >= 0 && -4 + B + K >= 0 && -2 + K >= 0 && A >= 1 + B && B >= 0] (?,1) 5. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A,B,C,H,I,0,Z,0,H,-1 + R,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && H >= 1 + C1 && R >= 0 && C1 >= 1 + A1 && Z >= 2 && J = 0] 6. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A,B,C,H,I,0,Z,0,H,-1 + R,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && H >= 1 + C1 && R >= 0 && A1 >= 1 + C1 && Z >= 2 && J = 0] 7. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A,B,C,H,I,0,Z,0,H,-1 + R,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && C1 >= 1 + H && R >= 0 && C1 >= 1 + A1 && Z >= 2 && J = 0] 8. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A,B,C,H,I,0,Z,0,H,-1 + R,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && C1 >= 1 + H && R >= 0 && A1 >= 1 + C1 && Z >= 2 && J = 0] 9. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f10(A,B,C,F1,I,E1,Z,C1,G1,R,Y) [-1 + -1*I + Y >= 0 (1,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && Z >= 2 && R >= 0 && J = H] Signature: {(f1,25);(f10,25);(f8,25);(f9,25)} Flow Graph: [0->{2,3,4},1->{},2->{5,6,7,8,9},3->{5,6,7,8,9},4->{2,3,4},5->{5,6,7,8,9},6->{5,6,7,8,9},7->{5,6,7,8,9} ,8->{5,6,7,8,9},9->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(2,9),(3,9)] * Step 4: AddSinks MAYBE + Considered Problem: Rules: 0. f9(A,B,C,H,I,J,K,N,P,R,Y) -> f1(A1,2,B1,H,I,J,A1,N,P,R,Y) [A1 >= 2] (1,1) 1. f9(A,B,C,H,I,J,K,N,P,R,Y) -> f10(B1,D1,C1,P1,I,O1,A1,M1,Q1,R,Y) [0 >= I1 && 0 >= A1 && 0 >= J1] (1,1) 2. f1(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A1,C1,B1,C,R,0,Z,0,C,R,1 + R) [-2 + B >= 0 (1,1) && -4 + B + K >= 0 && -2 + K >= 0 && K1 >= Z && L1 >= 2 && C1 >= L1 && B >= A && B >= 0 && 0 >= 1 + C && C1 >= 0 && Z >= 2] 3. f1(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A1,C1,B1,C,R,0,Z,0,C,R,1 + R) [-2 + B >= 0 (1,1) && -4 + B + K >= 0 && -2 + K >= 0 && K1 >= Z && L1 >= 2 && C1 >= L1 && B >= A && B >= 0 && C >= 1 && C1 >= 0 && Z >= 2] 4. f1(A,B,C,H,I,J,K,N,P,R,Y) -> f1(A,1 + B,D,H,I,J,K,N,P,R,Y) [-2 + B >= 0 && -4 + B + K >= 0 && -2 + K >= 0 && A >= 1 + B && B >= 0] (?,1) 5. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A,B,C,H,I,0,Z,0,H,-1 + R,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && H >= 1 + C1 && R >= 0 && C1 >= 1 + A1 && Z >= 2 && J = 0] 6. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A,B,C,H,I,0,Z,0,H,-1 + R,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && H >= 1 + C1 && R >= 0 && A1 >= 1 + C1 && Z >= 2 && J = 0] 7. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A,B,C,H,I,0,Z,0,H,-1 + R,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && C1 >= 1 + H && R >= 0 && C1 >= 1 + A1 && Z >= 2 && J = 0] 8. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A,B,C,H,I,0,Z,0,H,-1 + R,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && C1 >= 1 + H && R >= 0 && A1 >= 1 + C1 && Z >= 2 && J = 0] 9. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f10(A,B,C,F1,I,E1,Z,C1,G1,R,Y) [-1 + -1*I + Y >= 0 (1,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && Z >= 2 && R >= 0 && J = H] Signature: {(f1,25);(f10,25);(f8,25);(f9,25)} Flow Graph: [0->{2,3,4},1->{},2->{5,6,7,8},3->{5,6,7,8},4->{2,3,4},5->{5,6,7,8,9},6->{5,6,7,8,9},7->{5,6,7,8,9},8->{5 ,6,7,8,9},9->{}] + Applied Processor: AddSinks + Details: () * Step 5: UnsatPaths MAYBE + Considered Problem: Rules: 0. f9(A,B,C,H,I,J,K,N,P,R,Y) -> f1(A1,2,B1,H,I,J,A1,N,P,R,Y) [A1 >= 2] (1,1) 1. f9(A,B,C,H,I,J,K,N,P,R,Y) -> f10(B1,D1,C1,P1,I,O1,A1,M1,Q1,R,Y) [0 >= I1 && 0 >= A1 && 0 >= J1] (1,1) 2. f1(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A1,C1,B1,C,R,0,Z,0,C,R,1 + R) [-2 + B >= 0 (?,1) && -4 + B + K >= 0 && -2 + K >= 0 && K1 >= Z && L1 >= 2 && C1 >= L1 && B >= A && B >= 0 && 0 >= 1 + C && C1 >= 0 && Z >= 2] 3. f1(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A1,C1,B1,C,R,0,Z,0,C,R,1 + R) [-2 + B >= 0 (?,1) && -4 + B + K >= 0 && -2 + K >= 0 && K1 >= Z && L1 >= 2 && C1 >= L1 && B >= A && B >= 0 && C >= 1 && C1 >= 0 && Z >= 2] 4. f1(A,B,C,H,I,J,K,N,P,R,Y) -> f1(A,1 + B,D,H,I,J,K,N,P,R,Y) [-2 + B >= 0 && -4 + B + K >= 0 && -2 + K >= 0 && A >= 1 + B && B >= 0] (?,1) 5. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A,B,C,H,I,0,Z,0,H,-1 + R,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && H >= 1 + C1 && R >= 0 && C1 >= 1 + A1 && Z >= 2 && J = 0] 6. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A,B,C,H,I,0,Z,0,H,-1 + R,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && H >= 1 + C1 && R >= 0 && A1 >= 1 + C1 && Z >= 2 && J = 0] 7. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A,B,C,H,I,0,Z,0,H,-1 + R,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && C1 >= 1 + H && R >= 0 && C1 >= 1 + A1 && Z >= 2 && J = 0] 8. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A,B,C,H,I,0,Z,0,H,-1 + R,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && C1 >= 1 + H && R >= 0 && A1 >= 1 + C1 && Z >= 2 && J = 0] 9. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f10(A,B,C,F1,I,E1,Z,C1,G1,R,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && Z >= 2 && R >= 0 && J = H] 10. f9(A,B,C,H,I,J,K,N,P,R,Y) -> exitus616(A,B,C,H,I,J,K,N,P,R,Y) True (1,1) 11. f8(A,B,C,H,I,J,K,N,P,R,Y) -> exitus616(A,B,C,H,I,J,K,N,P,R,Y) True (?,1) Signature: {(exitus616,11);(f1,25);(f10,25);(f8,25);(f9,25)} Flow Graph: [0->{2,3,4},1->{},2->{5,6,7,8,9,11},3->{5,6,7,8,9,11},4->{2,3,4},5->{5,6,7,8,9,11},6->{5,6,7,8,9,11},7->{5 ,6,7,8,9,11},8->{5,6,7,8,9,11},9->{},10->{},11->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(2,9),(3,9)] * Step 6: LooptreeTransformer MAYBE + Considered Problem: Rules: 0. f9(A,B,C,H,I,J,K,N,P,R,Y) -> f1(A1,2,B1,H,I,J,A1,N,P,R,Y) [A1 >= 2] (1,1) 1. f9(A,B,C,H,I,J,K,N,P,R,Y) -> f10(B1,D1,C1,P1,I,O1,A1,M1,Q1,R,Y) [0 >= I1 && 0 >= A1 && 0 >= J1] (1,1) 2. f1(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A1,C1,B1,C,R,0,Z,0,C,R,1 + R) [-2 + B >= 0 (?,1) && -4 + B + K >= 0 && -2 + K >= 0 && K1 >= Z && L1 >= 2 && C1 >= L1 && B >= A && B >= 0 && 0 >= 1 + C && C1 >= 0 && Z >= 2] 3. f1(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A1,C1,B1,C,R,0,Z,0,C,R,1 + R) [-2 + B >= 0 (?,1) && -4 + B + K >= 0 && -2 + K >= 0 && K1 >= Z && L1 >= 2 && C1 >= L1 && B >= A && B >= 0 && C >= 1 && C1 >= 0 && Z >= 2] 4. f1(A,B,C,H,I,J,K,N,P,R,Y) -> f1(A,1 + B,D,H,I,J,K,N,P,R,Y) [-2 + B >= 0 && -4 + B + K >= 0 && -2 + K >= 0 && A >= 1 + B && B >= 0] (?,1) 5. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A,B,C,H,I,0,Z,0,H,-1 + R,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && H >= 1 + C1 && R >= 0 && C1 >= 1 + A1 && Z >= 2 && J = 0] 6. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A,B,C,H,I,0,Z,0,H,-1 + R,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && H >= 1 + C1 && R >= 0 && A1 >= 1 + C1 && Z >= 2 && J = 0] 7. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A,B,C,H,I,0,Z,0,H,-1 + R,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && C1 >= 1 + H && R >= 0 && C1 >= 1 + A1 && Z >= 2 && J = 0] 8. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A,B,C,H,I,0,Z,0,H,-1 + R,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && C1 >= 1 + H && R >= 0 && A1 >= 1 + C1 && Z >= 2 && J = 0] 9. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f10(A,B,C,F1,I,E1,Z,C1,G1,R,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && Z >= 2 && R >= 0 && J = H] 10. f9(A,B,C,H,I,J,K,N,P,R,Y) -> exitus616(A,B,C,H,I,J,K,N,P,R,Y) True (1,1) 11. f8(A,B,C,H,I,J,K,N,P,R,Y) -> exitus616(A,B,C,H,I,J,K,N,P,R,Y) True (?,1) Signature: {(exitus616,11);(f1,25);(f10,25);(f8,25);(f9,25)} Flow Graph: [0->{2,3,4},1->{},2->{5,6,7,8,11},3->{5,6,7,8,11},4->{2,3,4},5->{5,6,7,8,9,11},6->{5,6,7,8,9,11},7->{5,6,7 ,8,9,11},8->{5,6,7,8,9,11},9->{},10->{},11->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11] | +- p:[4] c: [4] | `- p:[5,6,7,8] c: [8] | `- p:[5,6,7] c: [7] | `- p:[5,6] c: [6] | `- p:[5] c: [5] * Step 7: SizeAbstraction MAYBE + Considered Problem: (Rules: 0. f9(A,B,C,H,I,J,K,N,P,R,Y) -> f1(A1,2,B1,H,I,J,A1,N,P,R,Y) [A1 >= 2] (1,1) 1. f9(A,B,C,H,I,J,K,N,P,R,Y) -> f10(B1,D1,C1,P1,I,O1,A1,M1,Q1,R,Y) [0 >= I1 && 0 >= A1 && 0 >= J1] (1,1) 2. f1(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A1,C1,B1,C,R,0,Z,0,C,R,1 + R) [-2 + B >= 0 (?,1) && -4 + B + K >= 0 && -2 + K >= 0 && K1 >= Z && L1 >= 2 && C1 >= L1 && B >= A && B >= 0 && 0 >= 1 + C && C1 >= 0 && Z >= 2] 3. f1(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A1,C1,B1,C,R,0,Z,0,C,R,1 + R) [-2 + B >= 0 (?,1) && -4 + B + K >= 0 && -2 + K >= 0 && K1 >= Z && L1 >= 2 && C1 >= L1 && B >= A && B >= 0 && C >= 1 && C1 >= 0 && Z >= 2] 4. f1(A,B,C,H,I,J,K,N,P,R,Y) -> f1(A,1 + B,D,H,I,J,K,N,P,R,Y) [-2 + B >= 0 && -4 + B + K >= 0 && -2 + K >= 0 && A >= 1 + B && B >= 0] (?,1) 5. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A,B,C,H,I,0,Z,0,H,-1 + R,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && H >= 1 + C1 && R >= 0 && C1 >= 1 + A1 && Z >= 2 && J = 0] 6. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A,B,C,H,I,0,Z,0,H,-1 + R,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && H >= 1 + C1 && R >= 0 && A1 >= 1 + C1 && Z >= 2 && J = 0] 7. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A,B,C,H,I,0,Z,0,H,-1 + R,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && C1 >= 1 + H && R >= 0 && C1 >= 1 + A1 && Z >= 2 && J = 0] 8. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f8(A,B,C,H,I,0,Z,0,H,-1 + R,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && C1 >= 1 + H && R >= 0 && A1 >= 1 + C1 && Z >= 2 && J = 0] 9. f8(A,B,C,H,I,J,K,N,P,R,Y) -> f10(A,B,C,F1,I,E1,Z,C1,G1,R,Y) [-1 + -1*I + Y >= 0 (?,1) && 1 + I + -1*Y >= 0 && I + -1*R >= 0 && -1*H + P >= 0 && H + -1*P >= 0 && -1 + -1*R + Y >= 0 && -2 + B >= 0 && -2 + B + N >= 0 && -2 + B + -1*N >= 0 && -4 + B + K >= 0 && -2 + B + J >= 0 && -2 + B + -1*J >= 0 && -1*N >= 0 && -2 + K + -1*N >= 0 && J + -1*N >= 0 && -1*J + -1*N >= 0 && N >= 0 && -2 + K + N >= 0 && J + N >= 0 && -1*J + N >= 0 && -2 + K >= 0 && -2 + J + K >= 0 && -2 + -1*J + K >= 0 && -1*J >= 0 && J >= 0 && Z >= 2 && R >= 0 && J = H] 10. f9(A,B,C,H,I,J,K,N,P,R,Y) -> exitus616(A,B,C,H,I,J,K,N,P,R,Y) True (1,1) 11. f8(A,B,C,H,I,J,K,N,P,R,Y) -> exitus616(A,B,C,H,I,J,K,N,P,R,Y) True (?,1) Signature: {(exitus616,11);(f1,25);(f10,25);(f8,25);(f9,25)} Flow Graph: [0->{2,3,4},1->{},2->{5,6,7,8,11},3->{5,6,7,8,11},4->{2,3,4},5->{5,6,7,8,9,11},6->{5,6,7,8,9,11},7->{5,6,7 ,8,9,11},8->{5,6,7,8,9,11},9->{},10->{},11->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11] | +- p:[4] c: [4] | `- p:[5,6,7,8] c: [8] | `- p:[5,6,7] c: [7] | `- p:[5,6] c: [6] | `- p:[5] c: [5]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 8: FlowAbstraction MAYBE + Considered Problem: Program: Domain: [A,B,C,H,I,J,K,N,P,R,Y,0.0,0.1,0.1.0,0.1.0.0,0.1.0.0.0] f9 ~> f1 [A <= unknown, B <= 2*K, C <= unknown, H <= H, I <= I, J <= J, K <= unknown, N <= N, P <= P, R <= R, Y <= Y] f9 ~> f10 [A <= unknown, B <= unknown, C <= unknown, H <= unknown, I <= I, J <= unknown, K <= unknown, N <= unknown, P <= unknown, R <= R, Y <= Y] f1 ~> f8 [A <= unknown, B <= unknown, C <= unknown, H <= C, I <= R, J <= 0*K, K <= unknown, N <= 0*K, P <= C, R <= R, Y <= K + R] f1 ~> f8 [A <= unknown, B <= unknown, C <= unknown, H <= C, I <= R, J <= 0*K, K <= unknown, N <= 0*K, P <= C, R <= R, Y <= K + R] f1 ~> f1 [A <= A, B <= A, C <= unknown, H <= H, I <= I, J <= J, K <= K, N <= N, P <= P, R <= R, Y <= Y] f8 ~> f8 [A <= A, B <= B, C <= C, H <= H, I <= I, J <= 0*K, K <= unknown, N <= 0*K, P <= H, R <= Y, Y <= Y] f8 ~> f8 [A <= A, B <= B, C <= C, H <= H, I <= I, J <= 0*K, K <= unknown, N <= 0*K, P <= H, R <= Y, Y <= Y] f8 ~> f8 [A <= A, B <= B, C <= C, H <= H, I <= I, J <= 0*K, K <= unknown, N <= 0*K, P <= H, R <= Y, Y <= Y] f8 ~> f8 [A <= A, B <= B, C <= C, H <= H, I <= I, J <= 0*K, K <= unknown, N <= 0*K, P <= H, R <= Y, Y <= Y] f8 ~> f10 [A <= A, B <= B, C <= C, H <= unknown, I <= I, J <= unknown, K <= unknown, N <= unknown, P <= unknown, R <= R, Y <= Y] f9 ~> exitus616 [A <= A, B <= B, C <= C, H <= H, I <= I, J <= J, K <= K, N <= N, P <= P, R <= R, Y <= Y] f8 ~> exitus616 [A <= A, B <= B, C <= C, H <= H, I <= I, J <= J, K <= K, N <= N, P <= P, R <= R, Y <= Y] + Loop: [0.0 <= A + B] f1 ~> f1 [A <= A, B <= A, C <= unknown, H <= H, I <= I, J <= J, K <= K, N <= N, P <= P, R <= R, Y <= Y] + Loop: [0.1 <= I + R + Y] f8 ~> f8 [A <= A, B <= B, C <= C, H <= H, I <= I, J <= 0*K, K <= unknown, N <= 0*K, P <= H, R <= Y, Y <= Y] f8 ~> f8 [A <= A, B <= B, C <= C, H <= H, I <= I, J <= 0*K, K <= unknown, N <= 0*K, P <= H, R <= Y, Y <= Y] f8 ~> f8 [A <= A, B <= B, C <= C, H <= H, I <= I, J <= 0*K, K <= unknown, N <= 0*K, P <= H, R <= Y, Y <= Y] f8 ~> f8 [A <= A, B <= B, C <= C, H <= H, I <= I, J <= 0*K, K <= unknown, N <= 0*K, P <= H, R <= Y, Y <= Y] + Loop: [0.1.0 <= K + R] f8 ~> f8 [A <= A, B <= B, C <= C, H <= H, I <= I, J <= 0*K, K <= unknown, N <= 0*K, P <= H, R <= Y, Y <= Y] f8 ~> f8 [A <= A, B <= B, C <= C, H <= H, I <= I, J <= 0*K, K <= unknown, N <= 0*K, P <= H, R <= Y, Y <= Y] f8 ~> f8 [A <= A, B <= B, C <= C, H <= H, I <= I, J <= 0*K, K <= unknown, N <= 0*K, P <= H, R <= Y, Y <= Y] + Loop: [0.1.0.0 <= K + R] f8 ~> f8 [A <= A, B <= B, C <= C, H <= H, I <= I, J <= 0*K, K <= unknown, N <= 0*K, P <= H, R <= Y, Y <= Y] f8 ~> f8 [A <= A, B <= B, C <= C, H <= H, I <= I, J <= 0*K, K <= unknown, N <= 0*K, P <= H, R <= Y, Y <= Y] + Loop: [0.1.0.0.0 <= K + R] f8 ~> f8 [A <= A, B <= B, C <= C, H <= H, I <= I, J <= 0*K, K <= unknown, N <= 0*K, P <= H, R <= Y, Y <= Y] + Applied Processor: FlowAbstraction + Details: () * Step 9: Failure MAYBE + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,H,I,J,K,N,P,R,Y,0.0,0.1,0.1.0,0.1.0.0,0.1.0.0.0] f9 ~> f1 [K ~=> B,huge ~=> A,huge ~=> C,huge ~=> K] f9 ~> f10 [huge ~=> A ,huge ~=> B ,huge ~=> C ,huge ~=> H ,huge ~=> J ,huge ~=> K ,huge ~=> N ,huge ~=> P] f1 ~> f8 [C ~=> H ,C ~=> P ,R ~=> I ,K ~=> J ,K ~=> N ,huge ~=> A ,huge ~=> B ,huge ~=> C ,huge ~=> K ,R ~+> Y ,K ~+> Y] f1 ~> f8 [C ~=> H ,C ~=> P ,R ~=> I ,K ~=> J ,K ~=> N ,huge ~=> A ,huge ~=> B ,huge ~=> C ,huge ~=> K ,R ~+> Y ,K ~+> Y] f1 ~> f1 [A ~=> B,huge ~=> C] f8 ~> f8 [H ~=> P,Y ~=> R,K ~=> J,K ~=> N,huge ~=> K] f8 ~> f8 [H ~=> P,Y ~=> R,K ~=> J,K ~=> N,huge ~=> K] f8 ~> f8 [H ~=> P,Y ~=> R,K ~=> J,K ~=> N,huge ~=> K] f8 ~> f8 [H ~=> P,Y ~=> R,K ~=> J,K ~=> N,huge ~=> K] f8 ~> f10 [huge ~=> H,huge ~=> J,huge ~=> K,huge ~=> N,huge ~=> P] f9 ~> exitus616 [] f8 ~> exitus616 [] + Loop: [A ~+> 0.0,B ~+> 0.0] f1 ~> f1 [A ~=> B,huge ~=> C] + Loop: [I ~+> 0.1,R ~+> 0.1,Y ~+> 0.1] f8 ~> f8 [H ~=> P,Y ~=> R,K ~=> J,K ~=> N,huge ~=> K] f8 ~> f8 [H ~=> P,Y ~=> R,K ~=> J,K ~=> N,huge ~=> K] f8 ~> f8 [H ~=> P,Y ~=> R,K ~=> J,K ~=> N,huge ~=> K] f8 ~> f8 [H ~=> P,Y ~=> R,K ~=> J,K ~=> N,huge ~=> K] + Loop: [R ~+> 0.1.0,K ~+> 0.1.0] f8 ~> f8 [H ~=> P,Y ~=> R,K ~=> J,K ~=> N,huge ~=> K] f8 ~> f8 [H ~=> P,Y ~=> R,K ~=> J,K ~=> N,huge ~=> K] f8 ~> f8 [H ~=> P,Y ~=> R,K ~=> J,K ~=> N,huge ~=> K] + Loop: [R ~+> 0.1.0.0,K ~+> 0.1.0.0] f8 ~> f8 [H ~=> P,Y ~=> R,K ~=> J,K ~=> N,huge ~=> K] f8 ~> f8 [H ~=> P,Y ~=> R,K ~=> J,K ~=> N,huge ~=> K] + Loop: [R ~+> 0.1.0.0.0,K ~+> 0.1.0.0.0] f8 ~> f8 [H ~=> P,Y ~=> R,K ~=> J,K ~=> N,huge ~=> K] + Applied Processor: LareProcessor + Details: Unknown bound. MAYBE