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