MAYBE * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f1(1,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [A = 1] (1,1) 1. f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f13(A,1,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [0 >= A] (1,1) 2. f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f13(A,1,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [A >= 2] (1,1) 3. f13(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f20(A,B,1 + B,S,T,1,G,H,I,J,K,L,M,N,O,P,Q,R) [A >= B] (?,1) 4. f20(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f20(A,B,C,S,T,1 + F,G,H,I,J,K,L,M,N,O,P,Q,R) [B >= F] (?,1) 5. f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f31(A,B,C,D,E,1 + F,G,H,I,J,K,L,M,N,O,P,Q,R) [B >= F] (?,1) 6. f45(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f45(A,B,C,D,E,1 + F,S,T,U,J,K,L,M,N,O,P,Q,R) [B >= F] (?,1) 7. f60(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f60(A,B,C,D,E,1 + F,G,H,I,J,-1 + K,S,T,U,V,K,Q,R) [J >= F] (?,1) 8. f60(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f13(A,1 + B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [F >= 1 + J] (?,1) 9. f45(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f60(A,B,C,D,E,1,G,H,I,S,B,L,M,N,O,P,T,U) [F >= 1 + B] (?,1) 10. f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f1(A,B,A,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [F >= 1 + B && A = C] (?,1) 11. f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f45(A,B,C,D,E,1,S,T,U,J,K,L,M,N,O,P,Q,R) [A >= 1 + C && F >= 1 + B] (?,1) 12. f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f45(A,B,C,D,E,1,S,T,U,J,K,L,M,N,O,P,Q,R) [C >= 1 + A && F >= 1 + B] (?,1) 13. f20(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f31(A,B,C,D,E,1,G,H,I,J,K,L,M,N,O,P,Q,R) [0 >= 1 + E && F >= 1 + B] (?,1) 14. f20(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f31(A,B,C,D,E,1,G,H,I,J,K,L,M,N,O,P,Q,R) [E >= 1 && F >= 1 + B] (?,1) 15. f20(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f31(A,B,C,D,0,1,G,H,I,J,K,L,M,N,O,P,Q,R) [F >= 1 + B && E = 0] (?,1) 16. f13(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [B >= 1 + A] (?,1) Signature: {(f1,18);(f13,18);(f2,18);(f20,18);(f31,18);(f45,18);(f60,18)} Flow Graph: [0->{},1->{3,16},2->{3,16},3->{4,13,14,15},4->{4,13,14,15},5->{5,10,11,12},6->{6,9},7->{7,8},8->{3,16} ,9->{7,8},10->{},11->{6,9},12->{6,9},13->{5,10,11,12},14->{5,10,11,12},15->{5,10,11,12},16->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths MAYBE + Considered Problem: Rules: 0. f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f1(1,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [A = 1] (1,1) 1. f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f13(A,1,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [0 >= A] (1,1) 2. f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f13(A,1,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [A >= 2] (1,1) 3. f13(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f20(A,B,1 + B,S,T,1,G,H,I,J,K,L,M,N,O,P,Q,R) [A >= B] (?,1) 4. f20(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f20(A,B,C,S,T,1 + F,G,H,I,J,K,L,M,N,O,P,Q,R) [B >= F] (?,1) 5. f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f31(A,B,C,D,E,1 + F,G,H,I,J,K,L,M,N,O,P,Q,R) [B >= F] (?,1) 6. f45(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f45(A,B,C,D,E,1 + F,S,T,U,J,K,L,M,N,O,P,Q,R) [B >= F] (?,1) 7. f60(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f60(A,B,C,D,E,1 + F,G,H,I,J,-1 + K,S,T,U,V,K,Q,R) [J >= F] (?,1) 8. f60(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f13(A,1 + B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [F >= 1 + J] (?,1) 9. f45(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f60(A,B,C,D,E,1,G,H,I,S,B,L,M,N,O,P,T,U) [F >= 1 + B] (?,1) 10. f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f1(A,B,A,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [F >= 1 + B && A = C] (1,1) 11. f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f45(A,B,C,D,E,1,S,T,U,J,K,L,M,N,O,P,Q,R) [A >= 1 + C && F >= 1 + B] (?,1) 12. f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f45(A,B,C,D,E,1,S,T,U,J,K,L,M,N,O,P,Q,R) [C >= 1 + A && F >= 1 + B] (?,1) 13. f20(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f31(A,B,C,D,E,1,G,H,I,J,K,L,M,N,O,P,Q,R) [0 >= 1 + E && F >= 1 + B] (?,1) 14. f20(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f31(A,B,C,D,E,1,G,H,I,J,K,L,M,N,O,P,Q,R) [E >= 1 && F >= 1 + B] (?,1) 15. f20(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f31(A,B,C,D,0,1,G,H,I,J,K,L,M,N,O,P,Q,R) [F >= 1 + B && E = 0] (?,1) 16. f13(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [B >= 1 + A] (1,1) Signature: {(f1,18);(f13,18);(f2,18);(f20,18);(f31,18);(f45,18);(f60,18)} Flow Graph: [0->{},1->{3,16},2->{3,16},3->{4,13,14,15},4->{4,13,14,15},5->{5,10,11,12},6->{6,9},7->{7,8},8->{3,16} ,9->{7,8},10->{},11->{6,9},12->{6,9},13->{5,10,11,12},14->{5,10,11,12},15->{5,10,11,12},16->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,3),(2,16)] * Step 3: AddSinks MAYBE + Considered Problem: Rules: 0. f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f1(1,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [A = 1] (1,1) 1. f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f13(A,1,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [0 >= A] (1,1) 2. f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f13(A,1,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [A >= 2] (1,1) 3. f13(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f20(A,B,1 + B,S,T,1,G,H,I,J,K,L,M,N,O,P,Q,R) [A >= B] (?,1) 4. f20(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f20(A,B,C,S,T,1 + F,G,H,I,J,K,L,M,N,O,P,Q,R) [B >= F] (?,1) 5. f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f31(A,B,C,D,E,1 + F,G,H,I,J,K,L,M,N,O,P,Q,R) [B >= F] (?,1) 6. f45(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f45(A,B,C,D,E,1 + F,S,T,U,J,K,L,M,N,O,P,Q,R) [B >= F] (?,1) 7. f60(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f60(A,B,C,D,E,1 + F,G,H,I,J,-1 + K,S,T,U,V,K,Q,R) [J >= F] (?,1) 8. f60(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f13(A,1 + B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [F >= 1 + J] (?,1) 9. f45(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f60(A,B,C,D,E,1,G,H,I,S,B,L,M,N,O,P,T,U) [F >= 1 + B] (?,1) 10. f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f1(A,B,A,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [F >= 1 + B && A = C] (1,1) 11. f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f45(A,B,C,D,E,1,S,T,U,J,K,L,M,N,O,P,Q,R) [A >= 1 + C && F >= 1 + B] (?,1) 12. f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f45(A,B,C,D,E,1,S,T,U,J,K,L,M,N,O,P,Q,R) [C >= 1 + A && F >= 1 + B] (?,1) 13. f20(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f31(A,B,C,D,E,1,G,H,I,J,K,L,M,N,O,P,Q,R) [0 >= 1 + E && F >= 1 + B] (?,1) 14. f20(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f31(A,B,C,D,E,1,G,H,I,J,K,L,M,N,O,P,Q,R) [E >= 1 && F >= 1 + B] (?,1) 15. f20(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f31(A,B,C,D,0,1,G,H,I,J,K,L,M,N,O,P,Q,R) [F >= 1 + B && E = 0] (?,1) 16. f13(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [B >= 1 + A] (1,1) Signature: {(f1,18);(f13,18);(f2,18);(f20,18);(f31,18);(f45,18);(f60,18)} Flow Graph: [0->{},1->{16},2->{3},3->{4,13,14,15},4->{4,13,14,15},5->{5,10,11,12},6->{6,9},7->{7,8},8->{3,16},9->{7,8} ,10->{},11->{6,9},12->{6,9},13->{5,10,11,12},14->{5,10,11,12},15->{5,10,11,12},16->{}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths MAYBE + Considered Problem: Rules: 0. f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f1(1,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [A = 1] (1,1) 1. f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f13(A,1,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [0 >= A] (1,1) 2. f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f13(A,1,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [A >= 2] (1,1) 3. f13(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f20(A,B,1 + B,S,T,1,G,H,I,J,K,L,M,N,O,P,Q,R) [A >= B] (?,1) 4. f20(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f20(A,B,C,S,T,1 + F,G,H,I,J,K,L,M,N,O,P,Q,R) [B >= F] (?,1) 5. f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f31(A,B,C,D,E,1 + F,G,H,I,J,K,L,M,N,O,P,Q,R) [B >= F] (?,1) 6. f45(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f45(A,B,C,D,E,1 + F,S,T,U,J,K,L,M,N,O,P,Q,R) [B >= F] (?,1) 7. f60(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f60(A,B,C,D,E,1 + F,G,H,I,J,-1 + K,S,T,U,V,K,Q,R) [J >= F] (?,1) 8. f60(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f13(A,1 + B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [F >= 1 + J] (?,1) 9. f45(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f60(A,B,C,D,E,1,G,H,I,S,B,L,M,N,O,P,T,U) [F >= 1 + B] (?,1) 10. f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f1(A,B,A,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [F >= 1 + B && A = C] (?,1) 11. f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f45(A,B,C,D,E,1,S,T,U,J,K,L,M,N,O,P,Q,R) [A >= 1 + C && F >= 1 + B] (?,1) 12. f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f45(A,B,C,D,E,1,S,T,U,J,K,L,M,N,O,P,Q,R) [C >= 1 + A && F >= 1 + B] (?,1) 13. f20(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f31(A,B,C,D,E,1,G,H,I,J,K,L,M,N,O,P,Q,R) [0 >= 1 + E && F >= 1 + B] (?,1) 14. f20(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f31(A,B,C,D,E,1,G,H,I,J,K,L,M,N,O,P,Q,R) [E >= 1 && F >= 1 + B] (?,1) 15. f20(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f31(A,B,C,D,0,1,G,H,I,J,K,L,M,N,O,P,Q,R) [F >= 1 + B && E = 0] (?,1) 16. f13(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [B >= 1 + A] (?,1) 17. f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) True (?,1) 18. f13(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) True (?,1) 19. f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) True (1,1) Signature: {(exitus616,18);(f1,18);(f13,18);(f2,18);(f20,18);(f31,18);(f45,18);(f60,18)} Flow Graph: [0->{},1->{3,16,18},2->{3,16,18},3->{4,13,14,15},4->{4,13,14,15},5->{5,10,11,12,17},6->{6,9},7->{7,8} ,8->{3,16,18},9->{7,8},10->{},11->{6,9},12->{6,9},13->{5,10,11,12,17},14->{5,10,11,12,17},15->{5,10,11,12 ,17},16->{},17->{},18->{},19->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,3),(2,16)] * Step 5: LooptreeTransformer MAYBE + Considered Problem: Rules: 0. f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f1(1,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [A = 1] (1,1) 1. f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f13(A,1,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [0 >= A] (1,1) 2. f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f13(A,1,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [A >= 2] (1,1) 3. f13(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f20(A,B,1 + B,S,T,1,G,H,I,J,K,L,M,N,O,P,Q,R) [A >= B] (?,1) 4. f20(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f20(A,B,C,S,T,1 + F,G,H,I,J,K,L,M,N,O,P,Q,R) [B >= F] (?,1) 5. f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f31(A,B,C,D,E,1 + F,G,H,I,J,K,L,M,N,O,P,Q,R) [B >= F] (?,1) 6. f45(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f45(A,B,C,D,E,1 + F,S,T,U,J,K,L,M,N,O,P,Q,R) [B >= F] (?,1) 7. f60(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f60(A,B,C,D,E,1 + F,G,H,I,J,-1 + K,S,T,U,V,K,Q,R) [J >= F] (?,1) 8. f60(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f13(A,1 + B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [F >= 1 + J] (?,1) 9. f45(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f60(A,B,C,D,E,1,G,H,I,S,B,L,M,N,O,P,T,U) [F >= 1 + B] (?,1) 10. f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f1(A,B,A,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [F >= 1 + B && A = C] (?,1) 11. f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f45(A,B,C,D,E,1,S,T,U,J,K,L,M,N,O,P,Q,R) [A >= 1 + C && F >= 1 + B] (?,1) 12. f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f45(A,B,C,D,E,1,S,T,U,J,K,L,M,N,O,P,Q,R) [C >= 1 + A && F >= 1 + B] (?,1) 13. f20(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f31(A,B,C,D,E,1,G,H,I,J,K,L,M,N,O,P,Q,R) [0 >= 1 + E && F >= 1 + B] (?,1) 14. f20(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f31(A,B,C,D,E,1,G,H,I,J,K,L,M,N,O,P,Q,R) [E >= 1 && F >= 1 + B] (?,1) 15. f20(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f31(A,B,C,D,0,1,G,H,I,J,K,L,M,N,O,P,Q,R) [F >= 1 + B && E = 0] (?,1) 16. f13(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [B >= 1 + A] (?,1) 17. f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) True (?,1) 18. f13(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) True (?,1) 19. f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) True (1,1) Signature: {(exitus616,18);(f1,18);(f13,18);(f2,18);(f20,18);(f31,18);(f45,18);(f60,18)} Flow Graph: [0->{},1->{16,18},2->{3,18},3->{4,13,14,15},4->{4,13,14,15},5->{5,10,11,12,17},6->{6,9},7->{7,8},8->{3,16 ,18},9->{7,8},10->{},11->{6,9},12->{6,9},13->{5,10,11,12,17},14->{5,10,11,12,17},15->{5,10,11,12,17},16->{} ,17->{},18->{},19->{}] + Applied Processor: LooptreeTransformer + 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] | `- p:[3,8,7,9,6,11,5,13,4,14,15,12] c: [3] | +- p:[4] c: [4] | +- p:[5] c: [5] | +- p:[6] c: [6] | `- p:[7] c: [7] * Step 6: SizeAbstraction MAYBE + Considered Problem: (Rules: 0. f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f1(1,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [A = 1] (1,1) 1. f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f13(A,1,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [0 >= A] (1,1) 2. f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f13(A,1,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [A >= 2] (1,1) 3. f13(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f20(A,B,1 + B,S,T,1,G,H,I,J,K,L,M,N,O,P,Q,R) [A >= B] (?,1) 4. f20(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f20(A,B,C,S,T,1 + F,G,H,I,J,K,L,M,N,O,P,Q,R) [B >= F] (?,1) 5. f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f31(A,B,C,D,E,1 + F,G,H,I,J,K,L,M,N,O,P,Q,R) [B >= F] (?,1) 6. f45(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f45(A,B,C,D,E,1 + F,S,T,U,J,K,L,M,N,O,P,Q,R) [B >= F] (?,1) 7. f60(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f60(A,B,C,D,E,1 + F,G,H,I,J,-1 + K,S,T,U,V,K,Q,R) [J >= F] (?,1) 8. f60(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f13(A,1 + B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [F >= 1 + J] (?,1) 9. f45(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f60(A,B,C,D,E,1,G,H,I,S,B,L,M,N,O,P,T,U) [F >= 1 + B] (?,1) 10. f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f1(A,B,A,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [F >= 1 + B && A = C] (?,1) 11. f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f45(A,B,C,D,E,1,S,T,U,J,K,L,M,N,O,P,Q,R) [A >= 1 + C && F >= 1 + B] (?,1) 12. f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f45(A,B,C,D,E,1,S,T,U,J,K,L,M,N,O,P,Q,R) [C >= 1 + A && F >= 1 + B] (?,1) 13. f20(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f31(A,B,C,D,E,1,G,H,I,J,K,L,M,N,O,P,Q,R) [0 >= 1 + E && F >= 1 + B] (?,1) 14. f20(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f31(A,B,C,D,E,1,G,H,I,J,K,L,M,N,O,P,Q,R) [E >= 1 && F >= 1 + B] (?,1) 15. f20(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f31(A,B,C,D,0,1,G,H,I,J,K,L,M,N,O,P,Q,R) [F >= 1 + B && E = 0] (?,1) 16. f13(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) [B >= 1 + A] (?,1) 17. f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) True (?,1) 18. f13(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) True (?,1) 19. f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) True (1,1) Signature: {(exitus616,18);(f1,18);(f13,18);(f2,18);(f20,18);(f31,18);(f45,18);(f60,18)} Flow Graph: [0->{},1->{16,18},2->{3,18},3->{4,13,14,15},4->{4,13,14,15},5->{5,10,11,12,17},6->{6,9},7->{7,8},8->{3,16 ,18},9->{7,8},10->{},11->{6,9},12->{6,9},13->{5,10,11,12,17},14->{5,10,11,12,17},15->{5,10,11,12,17},16->{} ,17->{},18->{},19->{}] ,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] | `- p:[3,8,7,9,6,11,5,13,4,14,15,12] c: [3] | +- p:[4] c: [4] | +- p:[5] c: [5] | +- p:[6] c: [6] | `- p:[7] c: [7]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 7: FlowAbstraction MAYBE + Considered Problem: Program: Domain: [A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,0.0,0.0.0,0.0.1,0.0.2,0.0.3] f2 ~> f1 [A <= K, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] f2 ~> f13 [A <= A, B <= K, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] f2 ~> f13 [A <= A, B <= K, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] f13 ~> f20 [A <= A, B <= B, C <= K + B, D <= unknown, E <= unknown, F <= K, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] f20 ~> f20 [A <= A, B <= B, C <= C, D <= unknown, E <= unknown, F <= K + F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] f31 ~> f31 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K + F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] f45 ~> f45 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K + F, G <= unknown, H <= unknown, I <= unknown, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] f60 ~> f60 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K + F, G <= G, H <= H, I <= I, J <= J, K <= K + K, L <= unknown, M <= unknown, N <= unknown, O <= unknown, P <= K, Q <= Q, R <= R] f60 ~> f13 [A <= A, B <= K + B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] f45 ~> f60 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K, G <= G, H <= H, I <= I, J <= unknown, K <= B, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= unknown, R <= unknown] f31 ~> f1 [A <= A, B <= B, C <= A, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] f31 ~> f45 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K, G <= unknown, H <= unknown, I <= unknown, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] f31 ~> f45 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K, G <= unknown, H <= unknown, I <= unknown, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] f20 ~> f31 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] f20 ~> f31 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] f20 ~> f31 [A <= A, B <= B, C <= C, D <= D, E <= 0*K, F <= K, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] f13 ~> f1 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] f31 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] f13 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] f2 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] + Loop: [0.0 <= 2*K + A + B] f13 ~> f20 [A <= A, B <= B, C <= K + B, D <= unknown, E <= unknown, F <= K, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] f60 ~> f13 [A <= A, B <= K + B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] f60 ~> f60 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K + F, G <= G, H <= H, I <= I, J <= J, K <= K + K, L <= unknown, M <= unknown, N <= unknown, O <= unknown, P <= K, Q <= Q, R <= R] f45 ~> f60 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K, G <= G, H <= H, I <= I, J <= unknown, K <= B, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= unknown, R <= unknown] f45 ~> f45 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K + F, G <= unknown, H <= unknown, I <= unknown, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] f31 ~> f45 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K, G <= unknown, H <= unknown, I <= unknown, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] f31 ~> f31 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K + F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] f20 ~> f31 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] f20 ~> f20 [A <= A, B <= B, C <= C, D <= unknown, E <= unknown, F <= K + F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] f20 ~> f31 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] f20 ~> f31 [A <= A, B <= B, C <= C, D <= D, E <= 0*K, F <= K, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] f31 ~> f45 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K, G <= unknown, H <= unknown, I <= unknown, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] + Loop: [0.0.0 <= K + B + F] f20 ~> f20 [A <= A, B <= B, C <= C, D <= unknown, E <= unknown, F <= K + F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] + Loop: [0.0.1 <= K + B + F] f31 ~> f31 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K + F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] + Loop: [0.0.2 <= K + B + F] f45 ~> f45 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K + F, G <= unknown, H <= unknown, I <= unknown, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q, R <= R] + Loop: [0.0.3 <= K + F + J] f60 ~> f60 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K + F, G <= G, H <= H, I <= I, J <= J, K <= K + K, L <= unknown, M <= unknown, N <= unknown, O <= unknown, P <= K, Q <= Q, R <= R] + Applied Processor: FlowAbstraction + Details: () * Step 8: Failure MAYBE + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,0.0,0.0.0,0.0.1,0.0.2,0.0.3] f2 ~> f1 [K ~=> A] f2 ~> f13 [K ~=> B] f2 ~> f13 [K ~=> B] f13 ~> f20 [K ~=> F,huge ~=> D,huge ~=> E,B ~+> C,K ~+> C] f20 ~> f20 [huge ~=> D,huge ~=> E,F ~+> F,K ~+> F] f31 ~> f31 [F ~+> F,K ~+> F] f45 ~> f45 [huge ~=> G,huge ~=> H,huge ~=> I,F ~+> F,K ~+> F] f60 ~> f60 [K ~=> P,huge ~=> L,huge ~=> M,huge ~=> N,huge ~=> O,F ~+> F,K ~+> K,K ~+> F,K ~+> K] f60 ~> f13 [B ~+> B,K ~+> B] f45 ~> f60 [B ~=> K,K ~=> F,huge ~=> J,huge ~=> Q,huge ~=> R] f31 ~> f1 [A ~=> C] f31 ~> f45 [K ~=> F,huge ~=> G,huge ~=> H,huge ~=> I] f31 ~> f45 [K ~=> F,huge ~=> G,huge ~=> H,huge ~=> I] f20 ~> f31 [K ~=> F] f20 ~> f31 [K ~=> F] f20 ~> f31 [K ~=> E,K ~=> F] f13 ~> f1 [] f31 ~> exitus616 [] f13 ~> exitus616 [] f2 ~> exitus616 [] + Loop: [A ~+> 0.0,B ~+> 0.0,K ~*> 0.0] f13 ~> f20 [K ~=> F,huge ~=> D,huge ~=> E,B ~+> C,K ~+> C] f60 ~> f13 [B ~+> B,K ~+> B] f60 ~> f60 [K ~=> P,huge ~=> L,huge ~=> M,huge ~=> N,huge ~=> O,F ~+> F,K ~+> K,K ~+> F,K ~+> K] f45 ~> f60 [B ~=> K,K ~=> F,huge ~=> J,huge ~=> Q,huge ~=> R] f45 ~> f45 [huge ~=> G,huge ~=> H,huge ~=> I,F ~+> F,K ~+> F] f31 ~> f45 [K ~=> F,huge ~=> G,huge ~=> H,huge ~=> I] f31 ~> f31 [F ~+> F,K ~+> F] f20 ~> f31 [K ~=> F] f20 ~> f20 [huge ~=> D,huge ~=> E,F ~+> F,K ~+> F] f20 ~> f31 [K ~=> F] f20 ~> f31 [K ~=> E,K ~=> F] f31 ~> f45 [K ~=> F,huge ~=> G,huge ~=> H,huge ~=> I] + Loop: [B ~+> 0.0.0,F ~+> 0.0.0,K ~+> 0.0.0] f20 ~> f20 [huge ~=> D,huge ~=> E,F ~+> F,K ~+> F] + Loop: [B ~+> 0.0.1,F ~+> 0.0.1,K ~+> 0.0.1] f31 ~> f31 [F ~+> F,K ~+> F] + Loop: [B ~+> 0.0.2,F ~+> 0.0.2,K ~+> 0.0.2] f45 ~> f45 [huge ~=> G,huge ~=> H,huge ~=> I,F ~+> F,K ~+> F] + Loop: [F ~+> 0.0.3,J ~+> 0.0.3,K ~+> 0.0.3] f60 ~> f60 [K ~=> P,huge ~=> L,huge ~=> M,huge ~=> N,huge ~=> O,F ~+> F,K ~+> K,K ~+> F,K ~+> K] + Applied Processor: LareProcessor + Details: Unknown bound. MAYBE