MAYBE * Step 1: ArgumentFilter MAYBE + Considered Problem: Rules: 0. f3(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,Z,A1,B1,C1,D1,E1,F1) -> f1(J1,2,K1,L1,K1,F,G,H,I,J,K,G1,M,G1,J1,P,Q,R,S,T,U,V,W,H1,I1,G1,A1,K1,M1,D1,E1,F1) [J1 >= 2] (1,1) 1. f3(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,Z,A1,B1,C1,D1,E1,F1) -> f4(J1,M1,L1,T1,S1,F,G,H,I,W1,K,X,V1,X,I1,X,U1,X1,Q1,T,U,V,W,G1,H1,K1,N1,R1,C1,D1,E1,F1) [0 >= O1 && 0 >= I1 && 0 >= P1] (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,Z,A1,B1,C1,D1,E1,F1) -> f10(H1,K1,J1,R1,Q1,F,G,H,I,C,T,N,N,N,G1,C,C,C,M1,T,U,V,W,X,Y,I1,L1,N1,C1,1 + T,I,S1) [-2 + B >= 0 (?,1) && -4 + B + O >= 0 && -2 + O >= 0 && B >= A && B >= 0 && T1 >= G1 && U1 >= 2 && K1 >= U1 && N >= 1 + C && K1 >= 0 && G1 >= 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,Z,A1,B1,C1,D1,E1,F1) -> f10(H1,K1,J1,R1,Q1,F,G,H,I,C,T,N,N,N,G1,C,C,C,M1,T,U,V,W,X,Y,I1,L1,N1,C1,1 + T,I,S1) [-2 + B >= 0 (?,1) && -4 + B + O >= 0 && -2 + O >= 0 && B >= A && B >= 0 && T1 >= G1 && U1 >= 2 && K1 >= U1 && C >= 1 + N && K1 >= 0 && G1 >= 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,Z,A1,B1,C1,D1,E1,F1) -> f1(A,1 + B,D,G1,D,H1,B,I,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1) [-2 + B >= 0 && -4 + B + O >= 0 && -2 + O >= 0 && A >= 1 + B && B >= 0] (?,1) 5. f10(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,Z,A1,B1,C1,D1,E1,F1) -> f10(A,B,C,D,E,F,G,H,I,J,K,M,M,M,G1,H1,H1,J,S,-1 + T,I1,I,-1 + T,X,Y,Z,A1,B1,C1,D1,E1,F1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && J >= 1 + J1 && T >= 0 && J1 >= 1 + H1 && G1 >= 2] 6. f10(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,Z,A1,B1,C1,D1,E1,F1) -> f10(A,B,C,D,E,F,G,H,I,J,K,M,M,M,G1,H1,H1,J,S,-1 + T,I1,I,-1 + T,X,Y,Z,A1,B1,C1,D1,E1,F1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && J >= 1 + J1 && T >= 0 && H1 >= 1 + J1 && G1 >= 2] 7. f10(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,Z,A1,B1,C1,D1,E1,F1) -> f10(A,B,C,D,E,F,G,H,I,J,K,M,M,M,G1,H1,H1,J,S,-1 + T,I1,I,-1 + T,X,Y,Z,A1,B1,C1,D1,E1,F1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && J1 >= 1 + J && T >= 0 && J1 >= 1 + H1 && G1 >= 2] 8. f10(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,Z,A1,B1,C1,D1,E1,F1) -> f10(A,B,C,D,E,F,G,H,I,J,K,M,M,M,G1,H1,H1,J,S,-1 + T,I1,I,-1 + T,X,Y,Z,A1,B1,C1,D1,E1,F1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && J1 >= 1 + J && T >= 0 && H1 >= 1 + J1 && G1 >= 2] 9. f10(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,Z,A1,B1,C1,D1,E1,F1) -> f4(A,B,C,D,E,F,G,H,I,K1,K,L,J1,N,G1,P,I1,L1,H1,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && G1 >= 2 && T >= 0 && M = J] Signature: {(f1,32);(f10,32);(f3,32);(f4,32)} 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,7,15,16,18,20,21,22,23,24,25,26,27,28,31] + Details: We remove following argument positions: [3,4,5,6,7,15,16,18,20,21,22,23,24,25,26,27,28,31]. * Step 2: TrivialSCCs MAYBE + Considered Problem: Rules: 0. f3(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f1(J1,2,K1,I,J,K,G1,M,G1,J1,R,T,D1,E1) [J1 >= 2] (1,1) 1. f3(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f4(J1,M1,L1,I,W1,K,X,V1,X,I1,X1,T,D1,E1) [0 >= O1 && 0 >= I1 && 0 >= P1] (1,1) 2. f1(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(H1,K1,J1,I,C,T,N,N,N,G1,C,T,1 + T,I) [-2 + B >= 0 (?,1) && -4 + B + O >= 0 && -2 + O >= 0 && B >= A && B >= 0 && T1 >= G1 && U1 >= 2 && K1 >= U1 && N >= 1 + C && K1 >= 0 && G1 >= 2] 3. f1(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(H1,K1,J1,I,C,T,N,N,N,G1,C,T,1 + T,I) [-2 + B >= 0 (?,1) && -4 + B + O >= 0 && -2 + O >= 0 && B >= A && B >= 0 && T1 >= G1 && U1 >= 2 && K1 >= U1 && C >= 1 + N && K1 >= 0 && G1 >= 2] 4. f1(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f1(A,1 + B,D,I,J,K,L,M,N,O,R,T,D1,E1) [-2 + B >= 0 && -4 + B + O >= 0 && -2 + O >= 0 && A >= 1 + B && B >= 0] (?,1) 5. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(A,B,C,I,J,K,M,M,M,G1,J,-1 + T,D1,E1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && J >= 1 + J1 && T >= 0 && J1 >= 1 + H1 && G1 >= 2] 6. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(A,B,C,I,J,K,M,M,M,G1,J,-1 + T,D1,E1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && J >= 1 + J1 && T >= 0 && H1 >= 1 + J1 && G1 >= 2] 7. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(A,B,C,I,J,K,M,M,M,G1,J,-1 + T,D1,E1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && J1 >= 1 + J && T >= 0 && J1 >= 1 + H1 && G1 >= 2] 8. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(A,B,C,I,J,K,M,M,M,G1,J,-1 + T,D1,E1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && J1 >= 1 + J && T >= 0 && H1 >= 1 + J1 && G1 >= 2] 9. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f4(A,B,C,I,K1,K,L,J1,N,G1,L1,T,D1,E1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && G1 >= 2 && T >= 0 && M = J] Signature: {(f1,32);(f10,32);(f3,32);(f4,32)} 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. f3(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f1(J1,2,K1,I,J,K,G1,M,G1,J1,R,T,D1,E1) [J1 >= 2] (1,1) 1. f3(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f4(J1,M1,L1,I,W1,K,X,V1,X,I1,X1,T,D1,E1) [0 >= O1 && 0 >= I1 && 0 >= P1] (1,1) 2. f1(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(H1,K1,J1,I,C,T,N,N,N,G1,C,T,1 + T,I) [-2 + B >= 0 (1,1) && -4 + B + O >= 0 && -2 + O >= 0 && B >= A && B >= 0 && T1 >= G1 && U1 >= 2 && K1 >= U1 && N >= 1 + C && K1 >= 0 && G1 >= 2] 3. f1(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(H1,K1,J1,I,C,T,N,N,N,G1,C,T,1 + T,I) [-2 + B >= 0 (1,1) && -4 + B + O >= 0 && -2 + O >= 0 && B >= A && B >= 0 && T1 >= G1 && U1 >= 2 && K1 >= U1 && C >= 1 + N && K1 >= 0 && G1 >= 2] 4. f1(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f1(A,1 + B,D,I,J,K,L,M,N,O,R,T,D1,E1) [-2 + B >= 0 && -4 + B + O >= 0 && -2 + O >= 0 && A >= 1 + B && B >= 0] (?,1) 5. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(A,B,C,I,J,K,M,M,M,G1,J,-1 + T,D1,E1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && J >= 1 + J1 && T >= 0 && J1 >= 1 + H1 && G1 >= 2] 6. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(A,B,C,I,J,K,M,M,M,G1,J,-1 + T,D1,E1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && J >= 1 + J1 && T >= 0 && H1 >= 1 + J1 && G1 >= 2] 7. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(A,B,C,I,J,K,M,M,M,G1,J,-1 + T,D1,E1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && J1 >= 1 + J && T >= 0 && J1 >= 1 + H1 && G1 >= 2] 8. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(A,B,C,I,J,K,M,M,M,G1,J,-1 + T,D1,E1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && J1 >= 1 + J && T >= 0 && H1 >= 1 + J1 && G1 >= 2] 9. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f4(A,B,C,I,K1,K,L,J1,N,G1,L1,T,D1,E1) [E1 + -1*I >= 0 (1,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && G1 >= 2 && T >= 0 && M = J] Signature: {(f1,32);(f10,32);(f3,32);(f4,32)} 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. f3(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f1(J1,2,K1,I,J,K,G1,M,G1,J1,R,T,D1,E1) [J1 >= 2] (1,1) 1. f3(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f4(J1,M1,L1,I,W1,K,X,V1,X,I1,X1,T,D1,E1) [0 >= O1 && 0 >= I1 && 0 >= P1] (1,1) 2. f1(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(H1,K1,J1,I,C,T,N,N,N,G1,C,T,1 + T,I) [-2 + B >= 0 (1,1) && -4 + B + O >= 0 && -2 + O >= 0 && B >= A && B >= 0 && T1 >= G1 && U1 >= 2 && K1 >= U1 && N >= 1 + C && K1 >= 0 && G1 >= 2] 3. f1(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(H1,K1,J1,I,C,T,N,N,N,G1,C,T,1 + T,I) [-2 + B >= 0 (1,1) && -4 + B + O >= 0 && -2 + O >= 0 && B >= A && B >= 0 && T1 >= G1 && U1 >= 2 && K1 >= U1 && C >= 1 + N && K1 >= 0 && G1 >= 2] 4. f1(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f1(A,1 + B,D,I,J,K,L,M,N,O,R,T,D1,E1) [-2 + B >= 0 && -4 + B + O >= 0 && -2 + O >= 0 && A >= 1 + B && B >= 0] (?,1) 5. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(A,B,C,I,J,K,M,M,M,G1,J,-1 + T,D1,E1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && J >= 1 + J1 && T >= 0 && J1 >= 1 + H1 && G1 >= 2] 6. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(A,B,C,I,J,K,M,M,M,G1,J,-1 + T,D1,E1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && J >= 1 + J1 && T >= 0 && H1 >= 1 + J1 && G1 >= 2] 7. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(A,B,C,I,J,K,M,M,M,G1,J,-1 + T,D1,E1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && J1 >= 1 + J && T >= 0 && J1 >= 1 + H1 && G1 >= 2] 8. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(A,B,C,I,J,K,M,M,M,G1,J,-1 + T,D1,E1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && J1 >= 1 + J && T >= 0 && H1 >= 1 + J1 && G1 >= 2] 9. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f4(A,B,C,I,K1,K,L,J1,N,G1,L1,T,D1,E1) [E1 + -1*I >= 0 (1,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && G1 >= 2 && T >= 0 && M = J] Signature: {(f1,32);(f10,32);(f3,32);(f4,32)} 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. f3(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f1(J1,2,K1,I,J,K,G1,M,G1,J1,R,T,D1,E1) [J1 >= 2] (1,1) 1. f3(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f4(J1,M1,L1,I,W1,K,X,V1,X,I1,X1,T,D1,E1) [0 >= O1 && 0 >= I1 && 0 >= P1] (1,1) 2. f1(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(H1,K1,J1,I,C,T,N,N,N,G1,C,T,1 + T,I) [-2 + B >= 0 (?,1) && -4 + B + O >= 0 && -2 + O >= 0 && B >= A && B >= 0 && T1 >= G1 && U1 >= 2 && K1 >= U1 && N >= 1 + C && K1 >= 0 && G1 >= 2] 3. f1(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(H1,K1,J1,I,C,T,N,N,N,G1,C,T,1 + T,I) [-2 + B >= 0 (?,1) && -4 + B + O >= 0 && -2 + O >= 0 && B >= A && B >= 0 && T1 >= G1 && U1 >= 2 && K1 >= U1 && C >= 1 + N && K1 >= 0 && G1 >= 2] 4. f1(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f1(A,1 + B,D,I,J,K,L,M,N,O,R,T,D1,E1) [-2 + B >= 0 && -4 + B + O >= 0 && -2 + O >= 0 && A >= 1 + B && B >= 0] (?,1) 5. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(A,B,C,I,J,K,M,M,M,G1,J,-1 + T,D1,E1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && J >= 1 + J1 && T >= 0 && J1 >= 1 + H1 && G1 >= 2] 6. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(A,B,C,I,J,K,M,M,M,G1,J,-1 + T,D1,E1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && J >= 1 + J1 && T >= 0 && H1 >= 1 + J1 && G1 >= 2] 7. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(A,B,C,I,J,K,M,M,M,G1,J,-1 + T,D1,E1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && J1 >= 1 + J && T >= 0 && J1 >= 1 + H1 && G1 >= 2] 8. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(A,B,C,I,J,K,M,M,M,G1,J,-1 + T,D1,E1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && J1 >= 1 + J && T >= 0 && H1 >= 1 + J1 && G1 >= 2] 9. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f4(A,B,C,I,K1,K,L,J1,N,G1,L1,T,D1,E1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && G1 >= 2 && T >= 0 && M = J] 10. f3(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> exitus616(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) True (1,1) 11. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> exitus616(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) True (?,1) Signature: {(exitus616,14);(f1,32);(f10,32);(f3,32);(f4,32)} 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. f3(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f1(J1,2,K1,I,J,K,G1,M,G1,J1,R,T,D1,E1) [J1 >= 2] (1,1) 1. f3(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f4(J1,M1,L1,I,W1,K,X,V1,X,I1,X1,T,D1,E1) [0 >= O1 && 0 >= I1 && 0 >= P1] (1,1) 2. f1(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(H1,K1,J1,I,C,T,N,N,N,G1,C,T,1 + T,I) [-2 + B >= 0 (?,1) && -4 + B + O >= 0 && -2 + O >= 0 && B >= A && B >= 0 && T1 >= G1 && U1 >= 2 && K1 >= U1 && N >= 1 + C && K1 >= 0 && G1 >= 2] 3. f1(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(H1,K1,J1,I,C,T,N,N,N,G1,C,T,1 + T,I) [-2 + B >= 0 (?,1) && -4 + B + O >= 0 && -2 + O >= 0 && B >= A && B >= 0 && T1 >= G1 && U1 >= 2 && K1 >= U1 && C >= 1 + N && K1 >= 0 && G1 >= 2] 4. f1(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f1(A,1 + B,D,I,J,K,L,M,N,O,R,T,D1,E1) [-2 + B >= 0 && -4 + B + O >= 0 && -2 + O >= 0 && A >= 1 + B && B >= 0] (?,1) 5. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(A,B,C,I,J,K,M,M,M,G1,J,-1 + T,D1,E1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && J >= 1 + J1 && T >= 0 && J1 >= 1 + H1 && G1 >= 2] 6. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(A,B,C,I,J,K,M,M,M,G1,J,-1 + T,D1,E1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && J >= 1 + J1 && T >= 0 && H1 >= 1 + J1 && G1 >= 2] 7. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(A,B,C,I,J,K,M,M,M,G1,J,-1 + T,D1,E1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && J1 >= 1 + J && T >= 0 && J1 >= 1 + H1 && G1 >= 2] 8. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(A,B,C,I,J,K,M,M,M,G1,J,-1 + T,D1,E1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && J1 >= 1 + J && T >= 0 && H1 >= 1 + J1 && G1 >= 2] 9. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f4(A,B,C,I,K1,K,L,J1,N,G1,L1,T,D1,E1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && G1 >= 2 && T >= 0 && M = J] 10. f3(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> exitus616(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) True (1,1) 11. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> exitus616(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) True (?,1) Signature: {(exitus616,14);(f1,32);(f10,32);(f3,32);(f4,32)} 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. f3(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f1(J1,2,K1,I,J,K,G1,M,G1,J1,R,T,D1,E1) [J1 >= 2] (1,1) 1. f3(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f4(J1,M1,L1,I,W1,K,X,V1,X,I1,X1,T,D1,E1) [0 >= O1 && 0 >= I1 && 0 >= P1] (1,1) 2. f1(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(H1,K1,J1,I,C,T,N,N,N,G1,C,T,1 + T,I) [-2 + B >= 0 (?,1) && -4 + B + O >= 0 && -2 + O >= 0 && B >= A && B >= 0 && T1 >= G1 && U1 >= 2 && K1 >= U1 && N >= 1 + C && K1 >= 0 && G1 >= 2] 3. f1(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(H1,K1,J1,I,C,T,N,N,N,G1,C,T,1 + T,I) [-2 + B >= 0 (?,1) && -4 + B + O >= 0 && -2 + O >= 0 && B >= A && B >= 0 && T1 >= G1 && U1 >= 2 && K1 >= U1 && C >= 1 + N && K1 >= 0 && G1 >= 2] 4. f1(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f1(A,1 + B,D,I,J,K,L,M,N,O,R,T,D1,E1) [-2 + B >= 0 && -4 + B + O >= 0 && -2 + O >= 0 && A >= 1 + B && B >= 0] (?,1) 5. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(A,B,C,I,J,K,M,M,M,G1,J,-1 + T,D1,E1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && J >= 1 + J1 && T >= 0 && J1 >= 1 + H1 && G1 >= 2] 6. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(A,B,C,I,J,K,M,M,M,G1,J,-1 + T,D1,E1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && J >= 1 + J1 && T >= 0 && H1 >= 1 + J1 && G1 >= 2] 7. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(A,B,C,I,J,K,M,M,M,G1,J,-1 + T,D1,E1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && J1 >= 1 + J && T >= 0 && J1 >= 1 + H1 && G1 >= 2] 8. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f10(A,B,C,I,J,K,M,M,M,G1,J,-1 + T,D1,E1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && J1 >= 1 + J && T >= 0 && H1 >= 1 + J1 && G1 >= 2] 9. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> f4(A,B,C,I,K1,K,L,J1,N,G1,L1,T,D1,E1) [E1 + -1*I >= 0 (?,1) && -1*E1 + I >= 0 && 1 + -1*D1 + K >= 0 && -1 + D1 + -1*T >= 0 && -1 + D1 + -1*K >= 0 && K + -1*T >= 0 && -2 + B >= 0 && -4 + B + O >= 0 && J + -1*R >= 0 && -1*J + R >= 0 && -2 + O >= 0 && M + -1*N >= 0 && L + -1*N >= 0 && -1*M + N >= 0 && -1*L + N >= 0 && L + -1*M >= 0 && -1*L + M >= 0 && G1 >= 2 && T >= 0 && M = J] 10. f3(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> exitus616(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) True (1,1) 11. f10(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) -> exitus616(A,B,C,I,J,K,L,M,N,O,R,T,D1,E1) True (?,1) Signature: {(exitus616,14);(f1,32);(f10,32);(f3,32);(f4,32)} 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,I,J,K,L,M,N,O,R,T,D1,E1,0.0,0.1,0.1.0,0.1.0.0,0.1.0.0.0] f3 ~> f1 [A <= unknown, B <= 2*K, C <= unknown, I <= I, J <= J, K <= K, L <= unknown, M <= M, N <= unknown, O <= unknown, R <= R, T <= T, D1 <= D1, E1 <= E1] f3 ~> f4 [A <= unknown, B <= unknown, C <= unknown, I <= I, J <= unknown, K <= K, L <= unknown, M <= unknown, N <= unknown, O <= unknown, R <= unknown, T <= T, D1 <= D1, E1 <= E1] f1 ~> f10 [A <= unknown, B <= unknown, C <= unknown, I <= I, J <= C, K <= T, L <= N, M <= N, N <= N, O <= unknown, R <= C, T <= T, D1 <= K + T, E1 <= I] f1 ~> f10 [A <= unknown, B <= unknown, C <= unknown, I <= I, J <= C, K <= T, L <= N, M <= N, N <= N, O <= unknown, R <= C, T <= T, D1 <= K + T, E1 <= I] f1 ~> f1 [A <= A, B <= A, C <= unknown, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, R <= R, T <= T, D1 <= D1, E1 <= E1] f10 ~> f10 [A <= A, B <= B, C <= C, I <= I, J <= J, K <= K, L <= M, M <= M, N <= M, O <= unknown, R <= J, T <= D1, D1 <= D1, E1 <= E1] f10 ~> f10 [A <= A, B <= B, C <= C, I <= I, J <= J, K <= K, L <= M, M <= M, N <= M, O <= unknown, R <= J, T <= D1, D1 <= D1, E1 <= E1] f10 ~> f10 [A <= A, B <= B, C <= C, I <= I, J <= J, K <= K, L <= M, M <= M, N <= M, O <= unknown, R <= J, T <= D1, D1 <= D1, E1 <= E1] f10 ~> f10 [A <= A, B <= B, C <= C, I <= I, J <= J, K <= K, L <= M, M <= M, N <= M, O <= unknown, R <= J, T <= D1, D1 <= D1, E1 <= E1] f10 ~> f4 [A <= A, B <= B, C <= C, I <= I, J <= unknown, K <= K, L <= L, M <= unknown, N <= N, O <= unknown, R <= unknown, T <= T, D1 <= D1, E1 <= E1] f3 ~> exitus616 [A <= A, B <= B, C <= C, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, R <= R, T <= T, D1 <= D1, E1 <= E1] f10 ~> exitus616 [A <= A, B <= B, C <= C, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, R <= R, T <= T, D1 <= D1, E1 <= E1] + Loop: [0.0 <= A + B] f1 ~> f1 [A <= A, B <= A, C <= unknown, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, R <= R, T <= T, D1 <= D1, E1 <= E1] + Loop: [0.1 <= K + T] f10 ~> f10 [A <= A, B <= B, C <= C, I <= I, J <= J, K <= K, L <= M, M <= M, N <= M, O <= unknown, R <= J, T <= D1, D1 <= D1, E1 <= E1] f10 ~> f10 [A <= A, B <= B, C <= C, I <= I, J <= J, K <= K, L <= M, M <= M, N <= M, O <= unknown, R <= J, T <= D1, D1 <= D1, E1 <= E1] f10 ~> f10 [A <= A, B <= B, C <= C, I <= I, J <= J, K <= K, L <= M, M <= M, N <= M, O <= unknown, R <= J, T <= D1, D1 <= D1, E1 <= E1] f10 ~> f10 [A <= A, B <= B, C <= C, I <= I, J <= J, K <= K, L <= M, M <= M, N <= M, O <= unknown, R <= J, T <= D1, D1 <= D1, E1 <= E1] + Loop: [0.1.0 <= K + T] f10 ~> f10 [A <= A, B <= B, C <= C, I <= I, J <= J, K <= K, L <= M, M <= M, N <= M, O <= unknown, R <= J, T <= D1, D1 <= D1, E1 <= E1] f10 ~> f10 [A <= A, B <= B, C <= C, I <= I, J <= J, K <= K, L <= M, M <= M, N <= M, O <= unknown, R <= J, T <= D1, D1 <= D1, E1 <= E1] f10 ~> f10 [A <= A, B <= B, C <= C, I <= I, J <= J, K <= K, L <= M, M <= M, N <= M, O <= unknown, R <= J, T <= D1, D1 <= D1, E1 <= E1] + Loop: [0.1.0.0 <= K + T] f10 ~> f10 [A <= A, B <= B, C <= C, I <= I, J <= J, K <= K, L <= M, M <= M, N <= M, O <= unknown, R <= J, T <= D1, D1 <= D1, E1 <= E1] f10 ~> f10 [A <= A, B <= B, C <= C, I <= I, J <= J, K <= K, L <= M, M <= M, N <= M, O <= unknown, R <= J, T <= D1, D1 <= D1, E1 <= E1] + Loop: [0.1.0.0.0 <= K + T] f10 ~> f10 [A <= A, B <= B, C <= C, I <= I, J <= J, K <= K, L <= M, M <= M, N <= M, O <= unknown, R <= J, T <= D1, D1 <= D1, E1 <= E1] + Applied Processor: FlowAbstraction + Details: () * Step 9: Failure MAYBE + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,I,J,K,L,M,N,O,R,T,D1,E1,0.0,0.1,0.1.0,0.1.0.0,0.1.0.0.0] f3 ~> f1 [K ~=> B,huge ~=> A,huge ~=> C,huge ~=> L,huge ~=> N,huge ~=> O] f3 ~> f4 [huge ~=> A ,huge ~=> B ,huge ~=> C ,huge ~=> J ,huge ~=> L ,huge ~=> M ,huge ~=> N ,huge ~=> O ,huge ~=> R] f1 ~> f10 [C ~=> J ,C ~=> R ,I ~=> E1 ,N ~=> L ,N ~=> M ,T ~=> K ,huge ~=> A ,huge ~=> B ,huge ~=> C ,huge ~=> O ,T ~+> D1 ,K ~+> D1] f1 ~> f10 [C ~=> J ,C ~=> R ,I ~=> E1 ,N ~=> L ,N ~=> M ,T ~=> K ,huge ~=> A ,huge ~=> B ,huge ~=> C ,huge ~=> O ,T ~+> D1 ,K ~+> D1] f1 ~> f1 [A ~=> B,huge ~=> C] f10 ~> f10 [D1 ~=> T,J ~=> R,M ~=> L,M ~=> N,huge ~=> O] f10 ~> f10 [D1 ~=> T,J ~=> R,M ~=> L,M ~=> N,huge ~=> O] f10 ~> f10 [D1 ~=> T,J ~=> R,M ~=> L,M ~=> N,huge ~=> O] f10 ~> f10 [D1 ~=> T,J ~=> R,M ~=> L,M ~=> N,huge ~=> O] f10 ~> f4 [huge ~=> J,huge ~=> M,huge ~=> O,huge ~=> R] f3 ~> exitus616 [] f10 ~> exitus616 [] + Loop: [A ~+> 0.0,B ~+> 0.0] f1 ~> f1 [A ~=> B,huge ~=> C] + Loop: [T ~+> 0.1,K ~+> 0.1] f10 ~> f10 [D1 ~=> T,J ~=> R,M ~=> L,M ~=> N,huge ~=> O] f10 ~> f10 [D1 ~=> T,J ~=> R,M ~=> L,M ~=> N,huge ~=> O] f10 ~> f10 [D1 ~=> T,J ~=> R,M ~=> L,M ~=> N,huge ~=> O] f10 ~> f10 [D1 ~=> T,J ~=> R,M ~=> L,M ~=> N,huge ~=> O] + Loop: [T ~+> 0.1.0,K ~+> 0.1.0] f10 ~> f10 [D1 ~=> T,J ~=> R,M ~=> L,M ~=> N,huge ~=> O] f10 ~> f10 [D1 ~=> T,J ~=> R,M ~=> L,M ~=> N,huge ~=> O] f10 ~> f10 [D1 ~=> T,J ~=> R,M ~=> L,M ~=> N,huge ~=> O] + Loop: [T ~+> 0.1.0.0,K ~+> 0.1.0.0] f10 ~> f10 [D1 ~=> T,J ~=> R,M ~=> L,M ~=> N,huge ~=> O] f10 ~> f10 [D1 ~=> T,J ~=> R,M ~=> L,M ~=> N,huge ~=> O] + Loop: [T ~+> 0.1.0.0.0,K ~+> 0.1.0.0.0] f10 ~> f10 [D1 ~=> T,J ~=> R,M ~=> L,M ~=> N,huge ~=> O] + Applied Processor: LareProcessor + Details: Unknown bound. MAYBE