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