MAYBE * Step 1: UnreachableRules MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G) -> f2(A,B,C,D,E,F,G) [0 >= A] (?,1) 1. f0(A,B,C,D,E,F,G) -> f0(-1 + A,C,-1 + C,A,E,F,G) [A >= 1] (?,1) 2. f1(A,B,C,D,E,F,G) -> f0(-1 + A,B,-1 + C,D,C,A,G) [A >= 1 && C >= 1] (?,1) 3. f2(A,B,C,D,E,F,G) -> f4(A,B,C,D,E,F,H) [0 >= C] (?,1) 4. f2(A,B,C,D,E,F,G) -> f0(H,B,C,D,E,F,G) [H >= 1 && C >= 1] (?,1) 5. f3(A,B,C,D,E,F,G) -> f2(H,B,I,D,E,F,G) True (1,1) Signature: {(f0,7);(f1,7);(f2,7);(f3,7);(f4,7)} Flow Graph: [0->{3,4},1->{0,1},2->{0,1},3->{},4->{0,1},5->{3,4}] + Applied Processor: UnreachableRules + Details: Following transitions are not reachable from the starting states and are revomed: [2] * Step 2: UnsatPaths MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G) -> f2(A,B,C,D,E,F,G) [0 >= A] (?,1) 1. f0(A,B,C,D,E,F,G) -> f0(-1 + A,C,-1 + C,A,E,F,G) [A >= 1] (?,1) 3. f2(A,B,C,D,E,F,G) -> f4(A,B,C,D,E,F,H) [0 >= C] (?,1) 4. f2(A,B,C,D,E,F,G) -> f0(H,B,C,D,E,F,G) [H >= 1 && C >= 1] (?,1) 5. f3(A,B,C,D,E,F,G) -> f2(H,B,I,D,E,F,G) True (1,1) Signature: {(f0,7);(f1,7);(f2,7);(f3,7);(f4,7)} Flow Graph: [0->{3,4},1->{0,1},3->{},4->{0,1},5->{3,4}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(4,0)] * Step 3: FromIts MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G) -> f2(A,B,C,D,E,F,G) [0 >= A] (?,1) 1. f0(A,B,C,D,E,F,G) -> f0(-1 + A,C,-1 + C,A,E,F,G) [A >= 1] (?,1) 3. f2(A,B,C,D,E,F,G) -> f4(A,B,C,D,E,F,H) [0 >= C] (?,1) 4. f2(A,B,C,D,E,F,G) -> f0(H,B,C,D,E,F,G) [H >= 1 && C >= 1] (?,1) 5. f3(A,B,C,D,E,F,G) -> f2(H,B,I,D,E,F,G) True (1,1) Signature: {(f0,7);(f1,7);(f2,7);(f3,7);(f4,7)} Flow Graph: [0->{3,4},1->{0,1},3->{},4->{1},5->{3,4}] + Applied Processor: FromIts + Details: () * Step 4: Unfold MAYBE + Considered Problem: Rules: f0(A,B,C,D,E,F,G) -> f2(A,B,C,D,E,F,G) [0 >= A] f0(A,B,C,D,E,F,G) -> f0(-1 + A,C,-1 + C,A,E,F,G) [A >= 1] f2(A,B,C,D,E,F,G) -> f4(A,B,C,D,E,F,H) [0 >= C] f2(A,B,C,D,E,F,G) -> f0(H,B,C,D,E,F,G) [H >= 1 && C >= 1] f3(A,B,C,D,E,F,G) -> f2(H,B,I,D,E,F,G) True Signature: {(f0,7);(f1,7);(f2,7);(f3,7);(f4,7)} Rule Graph: [0->{3,4},1->{0,1},3->{},4->{1},5->{3,4}] + Applied Processor: Unfold + Details: () * Step 5: AddSinks MAYBE + Considered Problem: Rules: f0.0(A,B,C,D,E,F,G) -> f2.3(A,B,C,D,E,F,G) [0 >= A] f0.0(A,B,C,D,E,F,G) -> f2.4(A,B,C,D,E,F,G) [0 >= A] f0.1(A,B,C,D,E,F,G) -> f0.0(-1 + A,C,-1 + C,A,E,F,G) [A >= 1] f0.1(A,B,C,D,E,F,G) -> f0.1(-1 + A,C,-1 + C,A,E,F,G) [A >= 1] f2.3(A,B,C,D,E,F,G) -> f4.6(A,B,C,D,E,F,H) [0 >= C] f2.4(A,B,C,D,E,F,G) -> f0.1(H,B,C,D,E,F,G) [H >= 1 && C >= 1] f3.5(A,B,C,D,E,F,G) -> f2.3(H,B,I,D,E,F,G) True f3.5(A,B,C,D,E,F,G) -> f2.4(H,B,I,D,E,F,G) True Signature: {(f0.0,7);(f0.1,7);(f2.3,7);(f2.4,7);(f3.5,7);(f4.6,7)} Rule Graph: [0->{4},1->{5},2->{0,1},3->{2,3},4->{},5->{2,3},6->{4},7->{5}] + Applied Processor: AddSinks + Details: () * Step 6: Decompose MAYBE + Considered Problem: Rules: f0.0(A,B,C,D,E,F,G) -> f2.3(A,B,C,D,E,F,G) [0 >= A] f0.0(A,B,C,D,E,F,G) -> f2.4(A,B,C,D,E,F,G) [0 >= A] f0.1(A,B,C,D,E,F,G) -> f0.0(-1 + A,C,-1 + C,A,E,F,G) [A >= 1] f0.1(A,B,C,D,E,F,G) -> f0.1(-1 + A,C,-1 + C,A,E,F,G) [A >= 1] f2.3(A,B,C,D,E,F,G) -> f4.6(A,B,C,D,E,F,H) [0 >= C] f2.4(A,B,C,D,E,F,G) -> f0.1(H,B,C,D,E,F,G) [H >= 1 && C >= 1] f3.5(A,B,C,D,E,F,G) -> f2.3(H,B,I,D,E,F,G) True f3.5(A,B,C,D,E,F,G) -> f2.4(H,B,I,D,E,F,G) True f4.6(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True f4.6(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True Signature: {(exitus616,7);(f0.0,7);(f0.1,7);(f2.3,7);(f2.4,7);(f3.5,7);(f4.6,7)} Rule Graph: [0->{4},1->{5},2->{0,1},3->{2,3},4->{8,9},5->{2,3},6->{4},7->{5}] + Applied Processor: Decompose Greedy + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9] | `- p:[1,2,3,5] c: [1,2,5] | `- p:[3] c: [3] * Step 7: AbstractSize MAYBE + Considered Problem: (Rules: f0.0(A,B,C,D,E,F,G) -> f2.3(A,B,C,D,E,F,G) [0 >= A] f0.0(A,B,C,D,E,F,G) -> f2.4(A,B,C,D,E,F,G) [0 >= A] f0.1(A,B,C,D,E,F,G) -> f0.0(-1 + A,C,-1 + C,A,E,F,G) [A >= 1] f0.1(A,B,C,D,E,F,G) -> f0.1(-1 + A,C,-1 + C,A,E,F,G) [A >= 1] f2.3(A,B,C,D,E,F,G) -> f4.6(A,B,C,D,E,F,H) [0 >= C] f2.4(A,B,C,D,E,F,G) -> f0.1(H,B,C,D,E,F,G) [H >= 1 && C >= 1] f3.5(A,B,C,D,E,F,G) -> f2.3(H,B,I,D,E,F,G) True f3.5(A,B,C,D,E,F,G) -> f2.4(H,B,I,D,E,F,G) True f4.6(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True f4.6(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True Signature: {(exitus616,7);(f0.0,7);(f0.1,7);(f2.3,7);(f2.4,7);(f3.5,7);(f4.6,7)} Rule Graph: [0->{4},1->{5},2->{0,1},3->{2,3},4->{8,9},5->{2,3},6->{4},7->{5}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9] | `- p:[1,2,3,5] c: [1,2,5] | `- p:[3] c: [3]) + Applied Processor: AbstractSize Minimize + Details: () * Step 8: AbstractFlow MAYBE + Considered Problem: Program: Domain: [A,B,C,D,E,F,G,0.0,0.0.0] f0.0 ~> f2.3 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G] f0.0 ~> f2.4 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G] f0.1 ~> f0.0 [A <= A, B <= C, C <= K + C, D <= A, E <= E, F <= F, G <= G] f0.1 ~> f0.1 [A <= A, B <= C, C <= K + C, D <= A, E <= E, F <= F, G <= G] f2.3 ~> f4.6 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= unknown] f2.4 ~> f0.1 [A <= unknown, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G] f3.5 ~> f2.3 [A <= unknown, B <= B, C <= unknown, D <= D, E <= E, F <= F, G <= G] f3.5 ~> f2.4 [A <= unknown, B <= B, C <= unknown, D <= D, E <= E, F <= F, G <= G] f4.6 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G] f4.6 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G] + Loop: [0.0 <= K + C] f0.0 ~> f2.4 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G] f0.1 ~> f0.0 [A <= A, B <= C, C <= K + C, D <= A, E <= E, F <= F, G <= G] f0.1 ~> f0.1 [A <= A, B <= C, C <= K + C, D <= A, E <= E, F <= F, G <= G] f2.4 ~> f0.1 [A <= unknown, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G] + Loop: [0.0.0 <= K + A] f0.1 ~> f0.1 [A <= A, B <= C, C <= K + C, D <= A, E <= E, F <= F, G <= G] + Applied Processor: AbstractFlow + Details: () * Step 9: Failure MAYBE + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,F,G,0.0,0.0.0] f0.0 ~> f2.3 [] f0.0 ~> f2.4 [] f0.1 ~> f0.0 [A ~=> D,C ~=> B,C ~+> C,K ~+> C] f0.1 ~> f0.1 [A ~=> D,C ~=> B,C ~+> C,K ~+> C] f2.3 ~> f4.6 [huge ~=> G] f2.4 ~> f0.1 [huge ~=> A] f3.5 ~> f2.3 [huge ~=> A,huge ~=> C] f3.5 ~> f2.4 [huge ~=> A,huge ~=> C] f4.6 ~> exitus616 [] f4.6 ~> exitus616 [] + Loop: [C ~+> 0.0,K ~+> 0.0] f0.0 ~> f2.4 [] f0.1 ~> f0.0 [A ~=> D,C ~=> B,C ~+> C,K ~+> C] f0.1 ~> f0.1 [A ~=> D,C ~=> B,C ~+> C,K ~+> C] f2.4 ~> f0.1 [huge ~=> A] + Loop: [A ~+> 0.0.0,K ~+> 0.0.0] f0.1 ~> f0.1 [A ~=> D,C ~=> B,C ~+> C,K ~+> C] + Applied Processor: Lare + Details: Unknown bound. MAYBE