MAYBE * Step 1: ArgumentFilter MAYBE + Considered Problem: Rules: 0. f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W) -> f1(X,X,X,X,X,X,X,X,X,J,K,L,M,N,O,P,Q,R,S,T,U,V,W) True (1,1) 1. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W) -> f1(A,B,C,D,E,F,G,H,I,J,X,Z,A1,B1,C1,D1,Q,R,S,T,U,V,W) [0 >= Y && 0 >= 1 + J] (?,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) -> f1(A,B,C,D,E,F,G,H,I,J,X,Z,A1,B1,O,P,C1,D1,Y,T,U,V,W) [0 >= 1 + J && E1 >= 1 && F1 >= 2] (?,1) 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) -> f1(A,B,C,D,E,F,G,H,I,J,X,L,M,Z,A1,B1,Q,R,S,C1,D1,Y,W) [0 >= 2 + E1 && J >= 1] (?,1) 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) -> f1(A,B,C,D,E,F,G,H,I,J,X,L,M,Z,O,P,A1,B1,C1,D1,Y,E1,W) [J >= 1 && F1 >= 0 && 1 + G1 >= 0] (?,1) 5. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W) -> f300(A,B,C,D,E,F,G,H,I,J,X,Z,A1,B1,O,P,C1,R,S,T,U,V,D1) [1 >= Y && 0 >= 1 + J && E1 >= 1] (?,1) 6. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W) -> f300(A,B,C,D,E,F,G,H,I,J,X,L,M,Z,O,P,A1,R,S,B1,C1,D1,Y) [0 >= 1 + E1 && J >= 1 && 1 + F1 >= 0] (?,1) 7. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W) -> f300(A,B,C,D,E,F,G,H,I,J,X,L,M,N,O,P,Q,R,S,Z,U,V,A1) [J = 0] (?,1) Signature: {(f1,23);(f2,23);(f300,23)} Flow Graph: [0->{1,2,3,4,5,6,7},1->{1,2,3,4,5,6,7},2->{1,2,3,4,5,6,7},3->{1,2,3,4,5,6,7},4->{1,2,3,4,5,6,7},5->{} ,6->{},7->{}] + Applied Processor: ArgumentFilter [0,1,2,3,4,5,6,7,8,10,11,12,13,14,15,16,17,18,19,20,21,22] + Details: We remove following argument positions: [0,1,2,3,4,5,6,7,8,10,11,12,13,14,15,16,17,18,19,20,21,22]. * Step 2: UnsatPaths MAYBE + Considered Problem: Rules: 0. f2(J) -> f1(J) True (1,1) 1. f1(J) -> f1(J) [0 >= Y && 0 >= 1 + J] (?,1) 2. f1(J) -> f1(J) [0 >= 1 + J && E1 >= 1 && F1 >= 2] (?,1) 3. f1(J) -> f1(J) [0 >= 2 + E1 && J >= 1] (?,1) 4. f1(J) -> f1(J) [J >= 1 && F1 >= 0 && 1 + G1 >= 0] (?,1) 5. f1(J) -> f300(J) [1 >= Y && 0 >= 1 + J && E1 >= 1] (?,1) 6. f1(J) -> f300(J) [0 >= 1 + E1 && J >= 1 && 1 + F1 >= 0] (?,1) 7. f1(J) -> f300(J) [J = 0] (?,1) Signature: {(f1,23);(f2,23);(f300,23)} Flow Graph: [0->{1,2,3,4,5,6,7},1->{1,2,3,4,5,6,7},2->{1,2,3,4,5,6,7},3->{1,2,3,4,5,6,7},4->{1,2,3,4,5,6,7},5->{} ,6->{},7->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,3) ,(1,4) ,(1,6) ,(1,7) ,(2,3) ,(2,4) ,(2,6) ,(2,7) ,(3,1) ,(3,2) ,(3,5) ,(3,7) ,(4,1) ,(4,2) ,(4,5) ,(4,7)] * Step 3: FromIts MAYBE + Considered Problem: Rules: 0. f2(J) -> f1(J) True (1,1) 1. f1(J) -> f1(J) [0 >= Y && 0 >= 1 + J] (?,1) 2. f1(J) -> f1(J) [0 >= 1 + J && E1 >= 1 && F1 >= 2] (?,1) 3. f1(J) -> f1(J) [0 >= 2 + E1 && J >= 1] (?,1) 4. f1(J) -> f1(J) [J >= 1 && F1 >= 0 && 1 + G1 >= 0] (?,1) 5. f1(J) -> f300(J) [1 >= Y && 0 >= 1 + J && E1 >= 1] (?,1) 6. f1(J) -> f300(J) [0 >= 1 + E1 && J >= 1 && 1 + F1 >= 0] (?,1) 7. f1(J) -> f300(J) [J = 0] (?,1) Signature: {(f1,23);(f2,23);(f300,23)} Flow Graph: [0->{1,2,3,4,5,6,7},1->{1,2,5},2->{1,2,5},3->{3,4,6},4->{3,4,6},5->{},6->{},7->{}] + Applied Processor: FromIts + Details: () * Step 4: Unfold MAYBE + Considered Problem: Rules: f2(J) -> f1(J) True f1(J) -> f1(J) [0 >= Y && 0 >= 1 + J] f1(J) -> f1(J) [0 >= 1 + J && E1 >= 1 && F1 >= 2] f1(J) -> f1(J) [0 >= 2 + E1 && J >= 1] f1(J) -> f1(J) [J >= 1 && F1 >= 0 && 1 + G1 >= 0] f1(J) -> f300(J) [1 >= Y && 0 >= 1 + J && E1 >= 1] f1(J) -> f300(J) [0 >= 1 + E1 && J >= 1 && 1 + F1 >= 0] f1(J) -> f300(J) [J = 0] Signature: {(f1,23);(f2,23);(f300,23)} Rule Graph: [0->{1,2,3,4,5,6,7},1->{1,2,5},2->{1,2,5},3->{3,4,6},4->{3,4,6},5->{},6->{},7->{}] + Applied Processor: Unfold + Details: () * Step 5: AddSinks MAYBE + Considered Problem: Rules: f2.0(J) -> f1.1(J) True f2.0(J) -> f1.2(J) True f2.0(J) -> f1.3(J) True f2.0(J) -> f1.4(J) True f2.0(J) -> f1.5(J) True f2.0(J) -> f1.6(J) True f2.0(J) -> f1.7(J) True f1.1(J) -> f1.1(J) [0 >= Y && 0 >= 1 + J] f1.1(J) -> f1.2(J) [0 >= Y && 0 >= 1 + J] f1.1(J) -> f1.5(J) [0 >= Y && 0 >= 1 + J] f1.2(J) -> f1.1(J) [0 >= 1 + J && E1 >= 1 && F1 >= 2] f1.2(J) -> f1.2(J) [0 >= 1 + J && E1 >= 1 && F1 >= 2] f1.2(J) -> f1.5(J) [0 >= 1 + J && E1 >= 1 && F1 >= 2] f1.3(J) -> f1.3(J) [0 >= 2 + E1 && J >= 1] f1.3(J) -> f1.4(J) [0 >= 2 + E1 && J >= 1] f1.3(J) -> f1.6(J) [0 >= 2 + E1 && J >= 1] f1.4(J) -> f1.3(J) [J >= 1 && F1 >= 0 && 1 + G1 >= 0] f1.4(J) -> f1.4(J) [J >= 1 && F1 >= 0 && 1 + G1 >= 0] f1.4(J) -> f1.6(J) [J >= 1 && F1 >= 0 && 1 + G1 >= 0] f1.5(J) -> f300.8(J) [1 >= Y && 0 >= 1 + J && E1 >= 1] f1.6(J) -> f300.8(J) [0 >= 1 + E1 && J >= 1 && 1 + F1 >= 0] f1.7(J) -> f300.8(J) [J = 0] Signature: {(f1.1,1);(f1.2,1);(f1.3,1);(f1.4,1);(f1.5,1);(f1.6,1);(f1.7,1);(f2.0,1);(f300.8,1)} Rule Graph: [0->{7,8,9},1->{10,11,12},2->{13,14,15},3->{16,17,18},4->{19},5->{20},6->{21},7->{7,8,9},8->{10,11,12} ,9->{19},10->{7,8,9},11->{10,11,12},12->{19},13->{13,14,15},14->{16,17,18},15->{20},16->{13,14,15},17->{16 ,17,18},18->{20},19->{},20->{},21->{}] + Applied Processor: AddSinks + Details: () * Step 6: Failure MAYBE + Considered Problem: Rules: f2.0(J) -> f1.1(J) True f2.0(J) -> f1.2(J) True f2.0(J) -> f1.3(J) True f2.0(J) -> f1.4(J) True f2.0(J) -> f1.5(J) True f2.0(J) -> f1.6(J) True f2.0(J) -> f1.7(J) True f1.1(J) -> f1.1(J) [0 >= Y && 0 >= 1 + J] f1.1(J) -> f1.2(J) [0 >= Y && 0 >= 1 + J] f1.1(J) -> f1.5(J) [0 >= Y && 0 >= 1 + J] f1.2(J) -> f1.1(J) [0 >= 1 + J && E1 >= 1 && F1 >= 2] f1.2(J) -> f1.2(J) [0 >= 1 + J && E1 >= 1 && F1 >= 2] f1.2(J) -> f1.5(J) [0 >= 1 + J && E1 >= 1 && F1 >= 2] f1.3(J) -> f1.3(J) [0 >= 2 + E1 && J >= 1] f1.3(J) -> f1.4(J) [0 >= 2 + E1 && J >= 1] f1.3(J) -> f1.6(J) [0 >= 2 + E1 && J >= 1] f1.4(J) -> f1.3(J) [J >= 1 && F1 >= 0 && 1 + G1 >= 0] f1.4(J) -> f1.4(J) [J >= 1 && F1 >= 0 && 1 + G1 >= 0] f1.4(J) -> f1.6(J) [J >= 1 && F1 >= 0 && 1 + G1 >= 0] f1.5(J) -> f300.8(J) [1 >= Y && 0 >= 1 + J && E1 >= 1] f1.6(J) -> f300.8(J) [0 >= 1 + E1 && J >= 1 && 1 + F1 >= 0] f1.7(J) -> f300.8(J) [J = 0] f300.8(J) -> exitus616(J) True f300.8(J) -> exitus616(J) True f300.8(J) -> exitus616(J) True f300.8(J) -> exitus616(J) True f300.8(J) -> exitus616(J) True f300.8(J) -> exitus616(J) True f300.8(J) -> exitus616(J) True f300.8(J) -> exitus616(J) True f300.8(J) -> exitus616(J) True f300.8(J) -> exitus616(J) True f300.8(J) -> exitus616(J) True Signature: {(exitus616,1);(f1.1,1);(f1.2,1);(f1.3,1);(f1.4,1);(f1.5,1);(f1.6,1);(f1.7,1);(f2.0,1);(f300.8,1)} Rule Graph: [0->{7,8,9},1->{10,11,12},2->{13,14,15},3->{16,17,18},4->{19},5->{20},6->{21},7->{7,8,9},8->{10,11,12} ,9->{19},10->{7,8,9},11->{10,11,12},12->{19},13->{13,14,15},14->{16,17,18},15->{20},16->{13,14,15},17->{16 ,17,18},18->{20},19->{24,29,30,31,32},20->{23,25,26,27,28},21->{22}] + Applied Processor: Decompose Greedy + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32] | +- p:[13,16,14,17] c: [] | `- p:[7,10,8,11] c: [] MAYBE