MAYBE * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. 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) 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) -> 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) 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) -> 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) 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,O,P,A1,B1,C1,D1,Y,E1,W) [J >= 1 && F1 >= 0 && 1 + G1 >= 0] (?,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,A1,B1,Q,R,S,C1,D1,Y,W) [0 >= 2 + E1 && J >= 1] (?,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) -> 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) 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) -> 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) 7. 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) Signature: {(f1,23);(f2,23);(f300,23)} Flow Graph: [0->{},1->{},2->{},3->{0,1,2,3,4,5,6},4->{0,1,2,3,4,5,6},5->{0,1,2,3,4,5,6},6->{0,1,2,3,4,5,6},7->{0,1,2,3 ,4,5,6}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths MAYBE + Considered Problem: Rules: 0. 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,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) -> 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,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) -> 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,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,O,P,A1,B1,C1,D1,Y,E1,W) [J >= 1 && F1 >= 0 && 1 + G1 >= 0] (?,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,A1,B1,Q,R,S,C1,D1,Y,W) [0 >= 2 + E1 && J >= 1] (?,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) -> 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) 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) -> 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) 7. 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) Signature: {(f1,23);(f2,23);(f300,23)} Flow Graph: [0->{},1->{},2->{},3->{0,1,2,3,4,5,6},4->{0,1,2,3,4,5,6},5->{0,1,2,3,4,5,6},6->{0,1,2,3,4,5,6},7->{0,1,2,3 ,4,5,6}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(3,0) ,(3,2) ,(3,5) ,(3,6) ,(4,0) ,(4,2) ,(4,5) ,(4,6) ,(5,0) ,(5,1) ,(5,3) ,(5,4) ,(6,0) ,(6,1) ,(6,3) ,(6,4)] * Step 3: AddSinks MAYBE + Considered Problem: Rules: 0. 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,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) -> 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,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) -> 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,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,O,P,A1,B1,C1,D1,Y,E1,W) [J >= 1 && F1 >= 0 && 1 + G1 >= 0] (?,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,A1,B1,Q,R,S,C1,D1,Y,W) [0 >= 2 + E1 && J >= 1] (?,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) -> 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) 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) -> 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) 7. 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) Signature: {(f1,23);(f2,23);(f300,23)} Flow Graph: [0->{},1->{},2->{},3->{1,3,4},4->{1,3,4},5->{2,5,6},6->{2,5,6},7->{0,1,2,3,4,5,6}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths MAYBE + Considered Problem: Rules: 0. 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) 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) -> 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) 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) -> 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) 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,O,P,A1,B1,C1,D1,Y,E1,W) [J >= 1 && F1 >= 0 && 1 + G1 >= 0] (?,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,A1,B1,Q,R,S,C1,D1,Y,W) [0 >= 2 + E1 && J >= 1] (?,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) -> 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) 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) -> 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) 7. 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) 8. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W) True (?,1) Signature: {(exitus616,23);(f1,23);(f2,23);(f300,23)} Flow Graph: [0->{},1->{},2->{},3->{0,1,2,3,4,5,6,8},4->{0,1,2,3,4,5,6,8},5->{0,1,2,3,4,5,6,8},6->{0,1,2,3,4,5,6,8} ,7->{0,1,2,3,4,5,6,8},8->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(3,0) ,(3,2) ,(3,5) ,(3,6) ,(4,0) ,(4,2) ,(4,5) ,(4,6) ,(5,0) ,(5,1) ,(5,3) ,(5,4) ,(6,0) ,(6,1) ,(6,3) ,(6,4)] * Step 5: Failure MAYBE + Considered Problem: Rules: 0. 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) 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) -> 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) 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) -> 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) 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,O,P,A1,B1,C1,D1,Y,E1,W) [J >= 1 && F1 >= 0 && 1 + G1 >= 0] (?,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,A1,B1,Q,R,S,C1,D1,Y,W) [0 >= 2 + E1 && J >= 1] (?,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) -> 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) 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) -> 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) 7. 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) 8. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W) True (?,1) Signature: {(exitus616,23);(f1,23);(f2,23);(f300,23)} Flow Graph: [0->{},1->{},2->{},3->{1,3,4,8},4->{1,3,4,8},5->{2,5,6,8},6->{2,5,6,8},7->{0,1,2,3,4,5,6,8},8->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8] | +- p:[5,6] c: [] | `- p:[3,4] c: [] MAYBE