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