MAYBE * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D) -> f6(E,0,C,D) True (1,1) 1. f6(A,B,C,D) -> f10(-1 + A,1 + B,C,D) [-1*B >= 0 && A >= 1] (?,1) 2. f10(A,B,C,D) -> f14(A,-1 + B,-1 + A,D) [A >= 0 && B >= 1] (?,1) 3. f14(A,B,C,D) -> f14(A,B,-1 + C,0) [-1 + A + -1*C >= 0 (?,1) && 1 + C >= 0 && 1 + B + C >= 0 && 1 + A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && C >= 1] 4. f14(A,B,C,D) -> f14(-1 + A,1 + B,-1 + C,E) [-1 + A + -1*C >= 0 (?,1) && 1 + C >= 0 && 1 + B + C >= 0 && 1 + A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && C >= 1 && 0 >= 1 + E] 5. f14(A,B,C,D) -> f14(-1 + A,1 + B,-1 + C,E) [-1 + A + -1*C >= 0 (?,1) && 1 + C >= 0 && 1 + B + C >= 0 && 1 + A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && C >= 1 && E >= 1] 6. f14(A,B,C,D) -> f10(A,B,C,D) [-1 + A + -1*C >= 0 (?,1) && 1 + C >= 0 && 1 + B + C >= 0 && 1 + A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && 0 >= C] 7. f10(A,B,C,D) -> f6(A,B,C,D) [A >= 0 && 0 >= B] (?,1) 8. f6(A,B,C,D) -> f25(A,B,C,D) [-1*B >= 0 && 0 >= A] (?,1) Signature: {(f0,4);(f10,4);(f14,4);(f25,4);(f6,4)} Flow Graph: [0->{1,8},1->{2,7},2->{3,4,5,6},3->{3,4,5,6},4->{3,4,5,6},5->{3,4,5,6},6->{2,7},7->{1,8},8->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: Failure MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D) -> f6(E,0,C,D) True (1,1) 1. f6(A,B,C,D) -> f10(-1 + A,1 + B,C,D) [-1*B >= 0 && A >= 1] (?,1) 2. f10(A,B,C,D) -> f14(A,-1 + B,-1 + A,D) [A >= 0 && B >= 1] (?,1) 3. f14(A,B,C,D) -> f14(A,B,-1 + C,0) [-1 + A + -1*C >= 0 (?,1) && 1 + C >= 0 && 1 + B + C >= 0 && 1 + A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && C >= 1] 4. f14(A,B,C,D) -> f14(-1 + A,1 + B,-1 + C,E) [-1 + A + -1*C >= 0 (?,1) && 1 + C >= 0 && 1 + B + C >= 0 && 1 + A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && C >= 1 && 0 >= 1 + E] 5. f14(A,B,C,D) -> f14(-1 + A,1 + B,-1 + C,E) [-1 + A + -1*C >= 0 (?,1) && 1 + C >= 0 && 1 + B + C >= 0 && 1 + A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && C >= 1 && E >= 1] 6. f14(A,B,C,D) -> f10(A,B,C,D) [-1 + A + -1*C >= 0 (?,1) && 1 + C >= 0 && 1 + B + C >= 0 && 1 + A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && 0 >= C] 7. f10(A,B,C,D) -> f6(A,B,C,D) [A >= 0 && 0 >= B] (?,1) 8. f6(A,B,C,D) -> f25(A,B,C,D) [-1*B >= 0 && 0 >= A] (1,1) Signature: {(f0,4);(f10,4);(f14,4);(f25,4);(f6,4)} Flow Graph: [0->{1,8},1->{2,7},2->{3,4,5,6},3->{3,4,5,6},4->{3,4,5,6},5->{3,4,5,6},6->{2,7},7->{1,8},8->{}] + Applied Processor: Failing "Open problems left." + Details: Open problems left. MAYBE