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