MAYBE * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. f5(A,B,C,D,E) -> f300(A,B,C,D,E) True (1,1) 1. f4(A,B,C,D,E) -> f300(A,B,1 + C,D,E) [A >= B] (?,1) 2. f4(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [F >= 1 && B >= 1 + A] (?,1) 3. f4(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [0 >= 1 + F && B >= 1 + A] (?,1) 4. f4(A,B,C,D,E) -> f2(A,B,C,0,E) [B >= 1 + A] (?,1) 5. f2(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [F >= 1 && B >= 1 + A] (?,1) 6. f2(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [0 >= 1 + F && B >= 1 + A] (?,1) 7. f2(A,B,C,D,E) -> f2(A,B,C,0,E) [B >= 1 + A] (?,1) 8. f300(A,B,C,D,E) -> f1(A,B,C,D,F) [C >= A] (?,1) 9. f300(A,B,C,D,E) -> f300(A,B,1 + C,D,E) [A >= 1 + C && A >= B] (?,1) 10. f300(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [F >= 1 && A >= 1 + C && B >= 1 + A] (?,1) 11. f300(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [0 >= 1 + F && A >= 1 + C && B >= 1 + A] (?,1) 12. f300(A,B,C,D,E) -> f2(A,B,C,0,E) [A >= 1 + C && B >= 1 + A] (?,1) Signature: {(f1,5);(f2,5);(f300,5);(f4,5);(f5,5)} Flow Graph: [0->{8,9,10,11,12},1->{8,9,10,11,12},2->{1,2,3,4},3->{1,2,3,4},4->{5,6,7},5->{1,2,3,4},6->{1,2,3,4},7->{5 ,6,7},8->{},9->{8,9,10,11,12},10->{1,2,3,4},11->{1,2,3,4},12->{5,6,7}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths MAYBE + Considered Problem: Rules: 0. f5(A,B,C,D,E) -> f300(A,B,C,D,E) True (1,1) 1. f4(A,B,C,D,E) -> f300(A,B,1 + C,D,E) [A >= B] (?,1) 2. f4(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [F >= 1 && B >= 1 + A] (?,1) 3. f4(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [0 >= 1 + F && B >= 1 + A] (?,1) 4. f4(A,B,C,D,E) -> f2(A,B,C,0,E) [B >= 1 + A] (?,1) 5. f2(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [F >= 1 && B >= 1 + A] (?,1) 6. f2(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [0 >= 1 + F && B >= 1 + A] (?,1) 7. f2(A,B,C,D,E) -> f2(A,B,C,0,E) [B >= 1 + A] (?,1) 8. f300(A,B,C,D,E) -> f1(A,B,C,D,F) [C >= A] (1,1) 9. f300(A,B,C,D,E) -> f300(A,B,1 + C,D,E) [A >= 1 + C && A >= B] (?,1) 10. f300(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [F >= 1 && A >= 1 + C && B >= 1 + A] (?,1) 11. f300(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [0 >= 1 + F && A >= 1 + C && B >= 1 + A] (?,1) 12. f300(A,B,C,D,E) -> f2(A,B,C,0,E) [A >= 1 + C && B >= 1 + A] (?,1) Signature: {(f1,5);(f2,5);(f300,5);(f4,5);(f5,5)} Flow Graph: [0->{8,9,10,11,12},1->{8,9,10,11,12},2->{1,2,3,4},3->{1,2,3,4},4->{5,6,7},5->{1,2,3,4},6->{1,2,3,4},7->{5 ,6,7},8->{},9->{8,9,10,11,12},10->{1,2,3,4},11->{1,2,3,4},12->{5,6,7}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,10),(1,11),(1,12),(9,10),(9,11),(9,12)] * Step 3: AddSinks MAYBE + Considered Problem: Rules: 0. f5(A,B,C,D,E) -> f300(A,B,C,D,E) True (1,1) 1. f4(A,B,C,D,E) -> f300(A,B,1 + C,D,E) [A >= B] (?,1) 2. f4(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [F >= 1 && B >= 1 + A] (?,1) 3. f4(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [0 >= 1 + F && B >= 1 + A] (?,1) 4. f4(A,B,C,D,E) -> f2(A,B,C,0,E) [B >= 1 + A] (?,1) 5. f2(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [F >= 1 && B >= 1 + A] (?,1) 6. f2(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [0 >= 1 + F && B >= 1 + A] (?,1) 7. f2(A,B,C,D,E) -> f2(A,B,C,0,E) [B >= 1 + A] (?,1) 8. f300(A,B,C,D,E) -> f1(A,B,C,D,F) [C >= A] (1,1) 9. f300(A,B,C,D,E) -> f300(A,B,1 + C,D,E) [A >= 1 + C && A >= B] (?,1) 10. f300(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [F >= 1 && A >= 1 + C && B >= 1 + A] (?,1) 11. f300(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [0 >= 1 + F && A >= 1 + C && B >= 1 + A] (?,1) 12. f300(A,B,C,D,E) -> f2(A,B,C,0,E) [A >= 1 + C && B >= 1 + A] (?,1) Signature: {(f1,5);(f2,5);(f300,5);(f4,5);(f5,5)} Flow Graph: [0->{8,9,10,11,12},1->{8,9},2->{1,2,3,4},3->{1,2,3,4},4->{5,6,7},5->{1,2,3,4},6->{1,2,3,4},7->{5,6,7} ,8->{},9->{8,9},10->{1,2,3,4},11->{1,2,3,4},12->{5,6,7}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths MAYBE + Considered Problem: Rules: 0. f5(A,B,C,D,E) -> f300(A,B,C,D,E) True (1,1) 1. f4(A,B,C,D,E) -> f300(A,B,1 + C,D,E) [A >= B] (?,1) 2. f4(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [F >= 1 && B >= 1 + A] (?,1) 3. f4(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [0 >= 1 + F && B >= 1 + A] (?,1) 4. f4(A,B,C,D,E) -> f2(A,B,C,0,E) [B >= 1 + A] (?,1) 5. f2(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [F >= 1 && B >= 1 + A] (?,1) 6. f2(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [0 >= 1 + F && B >= 1 + A] (?,1) 7. f2(A,B,C,D,E) -> f2(A,B,C,0,E) [B >= 1 + A] (?,1) 8. f300(A,B,C,D,E) -> f1(A,B,C,D,F) [C >= A] (?,1) 9. f300(A,B,C,D,E) -> f300(A,B,1 + C,D,E) [A >= 1 + C && A >= B] (?,1) 10. f300(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [F >= 1 && A >= 1 + C && B >= 1 + A] (?,1) 11. f300(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [0 >= 1 + F && A >= 1 + C && B >= 1 + A] (?,1) 12. f300(A,B,C,D,E) -> f2(A,B,C,0,E) [A >= 1 + C && B >= 1 + A] (?,1) 13. f300(A,B,C,D,E) -> exitus616(A,B,C,D,E) True (?,1) Signature: {(exitus616,5);(f1,5);(f2,5);(f300,5);(f4,5);(f5,5)} Flow Graph: [0->{8,9,10,11,12,13},1->{8,9,10,11,12,13},2->{1,2,3,4},3->{1,2,3,4},4->{5,6,7},5->{1,2,3,4},6->{1,2,3,4} ,7->{5,6,7},8->{},9->{8,9,10,11,12,13},10->{1,2,3,4},11->{1,2,3,4},12->{5,6,7},13->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,10),(1,11),(1,12),(9,10),(9,11),(9,12)] * Step 5: Failure MAYBE + Considered Problem: Rules: 0. f5(A,B,C,D,E) -> f300(A,B,C,D,E) True (1,1) 1. f4(A,B,C,D,E) -> f300(A,B,1 + C,D,E) [A >= B] (?,1) 2. f4(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [F >= 1 && B >= 1 + A] (?,1) 3. f4(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [0 >= 1 + F && B >= 1 + A] (?,1) 4. f4(A,B,C,D,E) -> f2(A,B,C,0,E) [B >= 1 + A] (?,1) 5. f2(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [F >= 1 && B >= 1 + A] (?,1) 6. f2(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [0 >= 1 + F && B >= 1 + A] (?,1) 7. f2(A,B,C,D,E) -> f2(A,B,C,0,E) [B >= 1 + A] (?,1) 8. f300(A,B,C,D,E) -> f1(A,B,C,D,F) [C >= A] (?,1) 9. f300(A,B,C,D,E) -> f300(A,B,1 + C,D,E) [A >= 1 + C && A >= B] (?,1) 10. f300(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [F >= 1 && A >= 1 + C && B >= 1 + A] (?,1) 11. f300(A,B,C,D,E) -> f4(1 + A,B,C,F,E) [0 >= 1 + F && A >= 1 + C && B >= 1 + A] (?,1) 12. f300(A,B,C,D,E) -> f2(A,B,C,0,E) [A >= 1 + C && B >= 1 + A] (?,1) 13. f300(A,B,C,D,E) -> exitus616(A,B,C,D,E) True (?,1) Signature: {(exitus616,5);(f1,5);(f2,5);(f300,5);(f4,5);(f5,5)} Flow Graph: [0->{8,9,10,11,12,13},1->{8,9,13},2->{1,2,3,4},3->{1,2,3,4},4->{5,6,7},5->{1,2,3,4},6->{1,2,3,4},7->{5,6 ,7},8->{},9->{8,9,13},10->{1,2,3,4},11->{1,2,3,4},12->{5,6,7},13->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13] | +- p:[2,3,5,4,6,7] c: [6] | | | `- p:[2,3,5,4,7] c: [5] | | | +- p:[2,3] c: [3] | | | | | `- p:[2] c: [2] | | | `- p:[7] c: [] | `- p:[9] c: [9] MAYBE