MAYBE * Step 1: UnsatPaths MAYBE + Considered Problem: Rules: 0. f1(A,B,C,D,E,F) -> f0(A,B,C,D,E,F) True (1,1) 1. f0(A,B,C,D,E,F) -> f0(-1 + A,B,I,G,H,F) [H >= 1 && A >= 1] (?,1) 2. f0(A,B,C,D,E,F) -> f0(-1 + A,B,I,G,H,F) [0 >= 1 + H && A >= 1] (?,1) 3. f0(A,B,C,D,E,F) -> f0(A,B,-1 + C,G,0,H) [A >= 1 && C >= 3] (?,1) 4. f0(A,B,C,D,E,F) -> f2(A,G,C,D,E,F) [0 >= A] (?,1) Signature: {(f0,6);(f1,6);(f2,6)} Flow Graph: [0->{1,2,3,4},1->{1,2,3,4},2->{1,2,3,4},3->{1,2,3,4},4->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(3,4)] * Step 2: FromIts MAYBE + Considered Problem: Rules: 0. f1(A,B,C,D,E,F) -> f0(A,B,C,D,E,F) True (1,1) 1. f0(A,B,C,D,E,F) -> f0(-1 + A,B,I,G,H,F) [H >= 1 && A >= 1] (?,1) 2. f0(A,B,C,D,E,F) -> f0(-1 + A,B,I,G,H,F) [0 >= 1 + H && A >= 1] (?,1) 3. f0(A,B,C,D,E,F) -> f0(A,B,-1 + C,G,0,H) [A >= 1 && C >= 3] (?,1) 4. f0(A,B,C,D,E,F) -> f2(A,G,C,D,E,F) [0 >= A] (?,1) Signature: {(f0,6);(f1,6);(f2,6)} Flow Graph: [0->{1,2,3,4},1->{1,2,3,4},2->{1,2,3,4},3->{1,2,3},4->{}] + Applied Processor: FromIts + Details: () * Step 3: Unfold MAYBE + Considered Problem: Rules: f1(A,B,C,D,E,F) -> f0(A,B,C,D,E,F) True f0(A,B,C,D,E,F) -> f0(-1 + A,B,I,G,H,F) [H >= 1 && A >= 1] f0(A,B,C,D,E,F) -> f0(-1 + A,B,I,G,H,F) [0 >= 1 + H && A >= 1] f0(A,B,C,D,E,F) -> f0(A,B,-1 + C,G,0,H) [A >= 1 && C >= 3] f0(A,B,C,D,E,F) -> f2(A,G,C,D,E,F) [0 >= A] Signature: {(f0,6);(f1,6);(f2,6)} Rule Graph: [0->{1,2,3,4},1->{1,2,3,4},2->{1,2,3,4},3->{1,2,3},4->{}] + Applied Processor: Unfold + Details: () * Step 4: AddSinks MAYBE + Considered Problem: Rules: f1.0(A,B,C,D,E,F) -> f0.1(A,B,C,D,E,F) True f1.0(A,B,C,D,E,F) -> f0.2(A,B,C,D,E,F) True f1.0(A,B,C,D,E,F) -> f0.3(A,B,C,D,E,F) True f1.0(A,B,C,D,E,F) -> f0.4(A,B,C,D,E,F) True f0.1(A,B,C,D,E,F) -> f0.1(-1 + A,B,I,G,H,F) [H >= 1 && A >= 1] f0.1(A,B,C,D,E,F) -> f0.2(-1 + A,B,I,G,H,F) [H >= 1 && A >= 1] f0.1(A,B,C,D,E,F) -> f0.3(-1 + A,B,I,G,H,F) [H >= 1 && A >= 1] f0.1(A,B,C,D,E,F) -> f0.4(-1 + A,B,I,G,H,F) [H >= 1 && A >= 1] f0.2(A,B,C,D,E,F) -> f0.1(-1 + A,B,I,G,H,F) [0 >= 1 + H && A >= 1] f0.2(A,B,C,D,E,F) -> f0.2(-1 + A,B,I,G,H,F) [0 >= 1 + H && A >= 1] f0.2(A,B,C,D,E,F) -> f0.3(-1 + A,B,I,G,H,F) [0 >= 1 + H && A >= 1] f0.2(A,B,C,D,E,F) -> f0.4(-1 + A,B,I,G,H,F) [0 >= 1 + H && A >= 1] f0.3(A,B,C,D,E,F) -> f0.1(A,B,-1 + C,G,0,H) [A >= 1 && C >= 3] f0.3(A,B,C,D,E,F) -> f0.2(A,B,-1 + C,G,0,H) [A >= 1 && C >= 3] f0.3(A,B,C,D,E,F) -> f0.3(A,B,-1 + C,G,0,H) [A >= 1 && C >= 3] f0.4(A,B,C,D,E,F) -> f2.5(A,G,C,D,E,F) [0 >= A] Signature: {(f0.1,6);(f0.2,6);(f0.3,6);(f0.4,6);(f1.0,6);(f2.5,6)} Rule Graph: [0->{4,5,6,7},1->{8,9,10,11},2->{12,13,14},3->{15},4->{4,5,6,7},5->{8,9,10,11},6->{12,13,14},7->{15},8->{4 ,5,6,7},9->{8,9,10,11},10->{12,13,14},11->{15},12->{4,5,6,7},13->{8,9,10,11},14->{12,13,14},15->{}] + Applied Processor: AddSinks + Details: () * Step 5: Decompose MAYBE + Considered Problem: Rules: f1.0(A,B,C,D,E,F) -> f0.1(A,B,C,D,E,F) True f1.0(A,B,C,D,E,F) -> f0.2(A,B,C,D,E,F) True f1.0(A,B,C,D,E,F) -> f0.3(A,B,C,D,E,F) True f1.0(A,B,C,D,E,F) -> f0.4(A,B,C,D,E,F) True f0.1(A,B,C,D,E,F) -> f0.1(-1 + A,B,I,G,H,F) [H >= 1 && A >= 1] f0.1(A,B,C,D,E,F) -> f0.2(-1 + A,B,I,G,H,F) [H >= 1 && A >= 1] f0.1(A,B,C,D,E,F) -> f0.3(-1 + A,B,I,G,H,F) [H >= 1 && A >= 1] f0.1(A,B,C,D,E,F) -> f0.4(-1 + A,B,I,G,H,F) [H >= 1 && A >= 1] f0.2(A,B,C,D,E,F) -> f0.1(-1 + A,B,I,G,H,F) [0 >= 1 + H && A >= 1] f0.2(A,B,C,D,E,F) -> f0.2(-1 + A,B,I,G,H,F) [0 >= 1 + H && A >= 1] f0.2(A,B,C,D,E,F) -> f0.3(-1 + A,B,I,G,H,F) [0 >= 1 + H && A >= 1] f0.2(A,B,C,D,E,F) -> f0.4(-1 + A,B,I,G,H,F) [0 >= 1 + H && A >= 1] f0.3(A,B,C,D,E,F) -> f0.1(A,B,-1 + C,G,0,H) [A >= 1 && C >= 3] f0.3(A,B,C,D,E,F) -> f0.2(A,B,-1 + C,G,0,H) [A >= 1 && C >= 3] f0.3(A,B,C,D,E,F) -> f0.3(A,B,-1 + C,G,0,H) [A >= 1 && C >= 3] f0.4(A,B,C,D,E,F) -> f2.5(A,G,C,D,E,F) [0 >= A] f2.5(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True f2.5(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True f2.5(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True f2.5(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True f2.5(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True f2.5(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True f2.5(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True Signature: {(exitus616,6);(f0.1,6);(f0.2,6);(f0.3,6);(f0.4,6);(f1.0,6);(f2.5,6)} Rule Graph: [0->{4,5,6,7},1->{8,9,10,11},2->{12,13,14},3->{15},4->{4,5,6,7},5->{8,9,10,11},6->{12,13,14},7->{15},8->{4 ,5,6,7},9->{8,9,10,11},10->{12,13,14},11->{15},12->{4,5,6,7},13->{8,9,10,11},14->{12,13,14},15->{16,17,18,19 ,20,21,22}] + Applied Processor: Decompose Greedy + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22] | `- p:[4,8,5,12,6,10,9,13,14] c: [4,5,6,8,9,10,12,13] | `- p:[14] c: [14] * Step 6: AbstractSize MAYBE + Considered Problem: (Rules: f1.0(A,B,C,D,E,F) -> f0.1(A,B,C,D,E,F) True f1.0(A,B,C,D,E,F) -> f0.2(A,B,C,D,E,F) True f1.0(A,B,C,D,E,F) -> f0.3(A,B,C,D,E,F) True f1.0(A,B,C,D,E,F) -> f0.4(A,B,C,D,E,F) True f0.1(A,B,C,D,E,F) -> f0.1(-1 + A,B,I,G,H,F) [H >= 1 && A >= 1] f0.1(A,B,C,D,E,F) -> f0.2(-1 + A,B,I,G,H,F) [H >= 1 && A >= 1] f0.1(A,B,C,D,E,F) -> f0.3(-1 + A,B,I,G,H,F) [H >= 1 && A >= 1] f0.1(A,B,C,D,E,F) -> f0.4(-1 + A,B,I,G,H,F) [H >= 1 && A >= 1] f0.2(A,B,C,D,E,F) -> f0.1(-1 + A,B,I,G,H,F) [0 >= 1 + H && A >= 1] f0.2(A,B,C,D,E,F) -> f0.2(-1 + A,B,I,G,H,F) [0 >= 1 + H && A >= 1] f0.2(A,B,C,D,E,F) -> f0.3(-1 + A,B,I,G,H,F) [0 >= 1 + H && A >= 1] f0.2(A,B,C,D,E,F) -> f0.4(-1 + A,B,I,G,H,F) [0 >= 1 + H && A >= 1] f0.3(A,B,C,D,E,F) -> f0.1(A,B,-1 + C,G,0,H) [A >= 1 && C >= 3] f0.3(A,B,C,D,E,F) -> f0.2(A,B,-1 + C,G,0,H) [A >= 1 && C >= 3] f0.3(A,B,C,D,E,F) -> f0.3(A,B,-1 + C,G,0,H) [A >= 1 && C >= 3] f0.4(A,B,C,D,E,F) -> f2.5(A,G,C,D,E,F) [0 >= A] f2.5(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True f2.5(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True f2.5(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True f2.5(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True f2.5(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True f2.5(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True f2.5(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True Signature: {(exitus616,6);(f0.1,6);(f0.2,6);(f0.3,6);(f0.4,6);(f1.0,6);(f2.5,6)} Rule Graph: [0->{4,5,6,7},1->{8,9,10,11},2->{12,13,14},3->{15},4->{4,5,6,7},5->{8,9,10,11},6->{12,13,14},7->{15},8->{4 ,5,6,7},9->{8,9,10,11},10->{12,13,14},11->{15},12->{4,5,6,7},13->{8,9,10,11},14->{12,13,14},15->{16,17,18,19 ,20,21,22}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22] | `- p:[4,8,5,12,6,10,9,13,14] c: [4,5,6,8,9,10,12,13] | `- p:[14] c: [14]) + Applied Processor: AbstractSize Minimize + Details: () * Step 7: AbstractFlow MAYBE + Considered Problem: Program: Domain: [A,B,C,D,E,F,0.0,0.0.0] f1.0 ~> f0.1 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] f1.0 ~> f0.2 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] f1.0 ~> f0.3 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] f1.0 ~> f0.4 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] f0.1 ~> f0.1 [A <= A, B <= B, C <= unknown, D <= unknown, E <= unknown, F <= F] f0.1 ~> f0.2 [A <= A, B <= B, C <= unknown, D <= unknown, E <= unknown, F <= F] f0.1 ~> f0.3 [A <= A, B <= B, C <= unknown, D <= unknown, E <= unknown, F <= F] f0.1 ~> f0.4 [A <= A, B <= B, C <= unknown, D <= unknown, E <= unknown, F <= F] f0.2 ~> f0.1 [A <= A, B <= B, C <= unknown, D <= unknown, E <= unknown, F <= F] f0.2 ~> f0.2 [A <= A, B <= B, C <= unknown, D <= unknown, E <= unknown, F <= F] f0.2 ~> f0.3 [A <= A, B <= B, C <= unknown, D <= unknown, E <= unknown, F <= F] f0.2 ~> f0.4 [A <= A, B <= B, C <= unknown, D <= unknown, E <= unknown, F <= F] f0.3 ~> f0.1 [A <= A, B <= B, C <= C, D <= unknown, E <= 0*K, F <= unknown] f0.3 ~> f0.2 [A <= A, B <= B, C <= C, D <= unknown, E <= 0*K, F <= unknown] f0.3 ~> f0.3 [A <= A, B <= B, C <= C, D <= unknown, E <= 0*K, F <= unknown] f0.4 ~> f2.5 [A <= A, B <= unknown, C <= C, D <= D, E <= E, F <= F] f2.5 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] f2.5 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] f2.5 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] f2.5 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] f2.5 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] f2.5 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] f2.5 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] + Loop: [0.0 <= K + A] f0.1 ~> f0.1 [A <= A, B <= B, C <= unknown, D <= unknown, E <= unknown, F <= F] f0.2 ~> f0.1 [A <= A, B <= B, C <= unknown, D <= unknown, E <= unknown, F <= F] f0.1 ~> f0.2 [A <= A, B <= B, C <= unknown, D <= unknown, E <= unknown, F <= F] f0.3 ~> f0.1 [A <= A, B <= B, C <= C, D <= unknown, E <= 0*K, F <= unknown] f0.1 ~> f0.3 [A <= A, B <= B, C <= unknown, D <= unknown, E <= unknown, F <= F] f0.2 ~> f0.3 [A <= A, B <= B, C <= unknown, D <= unknown, E <= unknown, F <= F] f0.2 ~> f0.2 [A <= A, B <= B, C <= unknown, D <= unknown, E <= unknown, F <= F] f0.3 ~> f0.2 [A <= A, B <= B, C <= C, D <= unknown, E <= 0*K, F <= unknown] f0.3 ~> f0.3 [A <= A, B <= B, C <= C, D <= unknown, E <= 0*K, F <= unknown] + Loop: [0.0.0 <= 3*K + C] f0.3 ~> f0.3 [A <= A, B <= B, C <= C, D <= unknown, E <= 0*K, F <= unknown] + Applied Processor: AbstractFlow + Details: () * Step 8: Failure MAYBE + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,F,0.0,0.0.0] f1.0 ~> f0.1 [] f1.0 ~> f0.2 [] f1.0 ~> f0.3 [] f1.0 ~> f0.4 [] f0.1 ~> f0.1 [huge ~=> C,huge ~=> D,huge ~=> E] f0.1 ~> f0.2 [huge ~=> C,huge ~=> D,huge ~=> E] f0.1 ~> f0.3 [huge ~=> C,huge ~=> D,huge ~=> E] f0.1 ~> f0.4 [huge ~=> C,huge ~=> D,huge ~=> E] f0.2 ~> f0.1 [huge ~=> C,huge ~=> D,huge ~=> E] f0.2 ~> f0.2 [huge ~=> C,huge ~=> D,huge ~=> E] f0.2 ~> f0.3 [huge ~=> C,huge ~=> D,huge ~=> E] f0.2 ~> f0.4 [huge ~=> C,huge ~=> D,huge ~=> E] f0.3 ~> f0.1 [K ~=> E,huge ~=> D,huge ~=> F] f0.3 ~> f0.2 [K ~=> E,huge ~=> D,huge ~=> F] f0.3 ~> f0.3 [K ~=> E,huge ~=> D,huge ~=> F] f0.4 ~> f2.5 [huge ~=> B] f2.5 ~> exitus616 [] f2.5 ~> exitus616 [] f2.5 ~> exitus616 [] f2.5 ~> exitus616 [] f2.5 ~> exitus616 [] f2.5 ~> exitus616 [] f2.5 ~> exitus616 [] + Loop: [A ~+> 0.0,K ~+> 0.0] f0.1 ~> f0.1 [huge ~=> C,huge ~=> D,huge ~=> E] f0.2 ~> f0.1 [huge ~=> C,huge ~=> D,huge ~=> E] f0.1 ~> f0.2 [huge ~=> C,huge ~=> D,huge ~=> E] f0.3 ~> f0.1 [K ~=> E,huge ~=> D,huge ~=> F] f0.1 ~> f0.3 [huge ~=> C,huge ~=> D,huge ~=> E] f0.2 ~> f0.3 [huge ~=> C,huge ~=> D,huge ~=> E] f0.2 ~> f0.2 [huge ~=> C,huge ~=> D,huge ~=> E] f0.3 ~> f0.2 [K ~=> E,huge ~=> D,huge ~=> F] f0.3 ~> f0.3 [K ~=> E,huge ~=> D,huge ~=> F] + Loop: [C ~+> 0.0.0,K ~*> 0.0.0] f0.3 ~> f0.3 [K ~=> E,huge ~=> D,huge ~=> F] + Applied Processor: Lare + Details: Unknown bound. MAYBE