MAYBE * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. f4(A,B) -> f11(A,B) [A >= B] (?,1) 1. f4(A,B) -> f4(A,E) [B >= 1 + A] (?,1) 2. f4(A,B) -> f4(E,B) [B >= 1 + A && C >= 1 + D] (?,1) 3. f0(A,B) -> f4(0,99) True (1,1) Signature: {(f0,2);(f11,2);(f4,2)} Flow Graph: [0->{},1->{0,1,2},2->{0,1,2},3->{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. f4(A,B) -> f11(A,B) [A >= B] (1,1) 1. f4(A,B) -> f4(A,E) [B >= 1 + A] (?,1) 2. f4(A,B) -> f4(E,B) [B >= 1 + A && C >= 1 + D] (?,1) 3. f0(A,B) -> f4(0,99) True (1,1) Signature: {(f0,2);(f11,2);(f4,2)} Flow Graph: [0->{},1->{0,1,2},2->{0,1,2},3->{0,1,2}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(3,0)] * Step 3: AddSinks MAYBE + Considered Problem: Rules: 0. f4(A,B) -> f11(A,B) [A >= B] (1,1) 1. f4(A,B) -> f4(A,E) [B >= 1 + A] (?,1) 2. f4(A,B) -> f4(E,B) [B >= 1 + A && C >= 1 + D] (?,1) 3. f0(A,B) -> f4(0,99) True (1,1) Signature: {(f0,2);(f11,2);(f4,2)} Flow Graph: [0->{},1->{0,1,2},2->{0,1,2},3->{1,2}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths MAYBE + Considered Problem: Rules: 0. f4(A,B) -> f11(A,B) [A >= B] (?,1) 1. f4(A,B) -> f4(A,E) [B >= 1 + A] (?,1) 2. f4(A,B) -> f4(E,B) [B >= 1 + A && C >= 1 + D] (?,1) 3. f0(A,B) -> f4(0,99) True (1,1) 4. f4(A,B) -> exitus616(A,B) True (?,1) Signature: {(exitus616,2);(f0,2);(f11,2);(f4,2)} Flow Graph: [0->{},1->{0,1,2,4},2->{0,1,2,4},3->{0,1,2,4},4->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(3,0)] * Step 5: Failure MAYBE + Considered Problem: Rules: 0. f4(A,B) -> f11(A,B) [A >= B] (?,1) 1. f4(A,B) -> f4(A,E) [B >= 1 + A] (?,1) 2. f4(A,B) -> f4(E,B) [B >= 1 + A && C >= 1 + D] (?,1) 3. f0(A,B) -> f4(0,99) True (1,1) 4. f4(A,B) -> exitus616(A,B) True (?,1) Signature: {(exitus616,2);(f0,2);(f11,2);(f4,2)} Flow Graph: [0->{},1->{0,1,2,4},2->{0,1,2,4},3->{1,2,4},4->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4] | `- p:[1,2] c: [] MAYBE