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