YES(?,POLY) * Step 1: TrivialSCCs WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [0 >= A && B = C && D = E && F = G && H = A] (?,1) 1. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [0 >= 1 + G && B = C && D = E && F = G && H = A] (?,1) 2. start(A,B,C,D,E,F,G,H) -> stop(A,0,C,F,E,F,G,H) [A >= 1 && F = 0 && B = C && D = E && G = 0 && H = A] (?,1) 3. start(A,B,C,D,E,F,G,H) -> lM1(A,1,C,-1 + F,E,F,G,H) [A >= 1 && G >= 1 && B = C && D = E && F = G && H = A] (?,1) 4. lM1(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= B && G >= B && B >= 1 && D = 0 && H = A && F = G] (?,1) 5. lM1(A,B,C,D,E,F,G,H) -> lZZ1(A,0,C,D,E,F,G,H) [D >= 1 && G >= A + D && A >= 1 && D >= 0 && B = A && H = A && F = G] (?,1) 6. lM1(A,B,C,D,E,F,G,H) -> lM1(A,1 + B,C,-1 + D,E,F,G,H) [A >= 1 + B && D >= 1 && A >= B && G >= B + D && B >= 1 && D >= 0 && H = A && F = G] (?,1) 7. lZZ1(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [0 >= D && G >= A + D && A >= 2 && D >= 1 && B = 0 && H = A && F = G] (?,1) 8. lZZ1(A,B,C,D,E,F,G,H) -> lZZ1(A,0,C,D,E,F,G,H) [D >= 1 && 0 >= A && G >= A + D && A >= 2 && B = 0 && H = A && F = G] (?,1) 9. lZZ1(A,B,C,D,E,F,G,H) -> lM1(A,1 + B,C,-1 + D,E,F,G,H) [A >= 1 && D >= 1 && G >= A + D && A >= 2 && B = 0 && H = A && F = G] (?,1) 10. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,E,E,G,G,A) True (1,1) Signature: {(lM1,8);(lZZ1,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{},2->{},3->{4,5,6},4->{},5->{7,8,9},6->{4,5,6},7->{},8->{7,8,9},9->{4,5,6},10->{0,1,2,3}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatRules WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [0 >= A && B = C && D = E && F = G && H = A] (1,1) 1. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [0 >= 1 + G && B = C && D = E && F = G && H = A] (1,1) 2. start(A,B,C,D,E,F,G,H) -> stop(A,0,C,F,E,F,G,H) [A >= 1 && F = 0 && B = C && D = E && G = 0 && H = A] (1,1) 3. start(A,B,C,D,E,F,G,H) -> lM1(A,1,C,-1 + F,E,F,G,H) [A >= 1 && G >= 1 && B = C && D = E && F = G && H = A] (1,1) 4. lM1(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= B && G >= B && B >= 1 && D = 0 && H = A && F = G] (1,1) 5. lM1(A,B,C,D,E,F,G,H) -> lZZ1(A,0,C,D,E,F,G,H) [D >= 1 && G >= A + D && A >= 1 && D >= 0 && B = A && H = A && F = G] (?,1) 6. lM1(A,B,C,D,E,F,G,H) -> lM1(A,1 + B,C,-1 + D,E,F,G,H) [A >= 1 + B && D >= 1 && A >= B && G >= B + D && B >= 1 && D >= 0 && H = A && F = G] (?,1) 7. lZZ1(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [0 >= D && G >= A + D && A >= 2 && D >= 1 && B = 0 && H = A && F = G] (1,1) 8. lZZ1(A,B,C,D,E,F,G,H) -> lZZ1(A,0,C,D,E,F,G,H) [D >= 1 && 0 >= A && G >= A + D && A >= 2 && B = 0 && H = A && F = G] (?,1) 9. lZZ1(A,B,C,D,E,F,G,H) -> lM1(A,1 + B,C,-1 + D,E,F,G,H) [A >= 1 && D >= 1 && G >= A + D && A >= 2 && B = 0 && H = A && F = G] (?,1) 10. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,E,E,G,G,A) True (1,1) Signature: {(lM1,8);(lZZ1,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{},2->{},3->{4,5,6},4->{},5->{7,8,9},6->{4,5,6},7->{},8->{7,8,9},9->{4,5,6},10->{0,1,2,3}] + Applied Processor: UnsatRules + Details: Following transitions have unsatisfiable constraints and are removed: [8] * Step 3: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [0 >= A && B = C && D = E && F = G && H = A] (1,1) 1. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [0 >= 1 + G && B = C && D = E && F = G && H = A] (1,1) 2. start(A,B,C,D,E,F,G,H) -> stop(A,0,C,F,E,F,G,H) [A >= 1 && F = 0 && B = C && D = E && G = 0 && H = A] (1,1) 3. start(A,B,C,D,E,F,G,H) -> lM1(A,1,C,-1 + F,E,F,G,H) [A >= 1 && G >= 1 && B = C && D = E && F = G && H = A] (1,1) 4. lM1(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= B && G >= B && B >= 1 && D = 0 && H = A && F = G] (1,1) 5. lM1(A,B,C,D,E,F,G,H) -> lZZ1(A,0,C,D,E,F,G,H) [D >= 1 && G >= A + D && A >= 1 && D >= 0 && B = A && H = A && F = G] (?,1) 6. lM1(A,B,C,D,E,F,G,H) -> lM1(A,1 + B,C,-1 + D,E,F,G,H) [A >= 1 + B && D >= 1 && A >= B && G >= B + D && B >= 1 && D >= 0 && H = A && F = G] (?,1) 7. lZZ1(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [0 >= D && G >= A + D && A >= 2 && D >= 1 && B = 0 && H = A && F = G] (1,1) 9. lZZ1(A,B,C,D,E,F,G,H) -> lM1(A,1 + B,C,-1 + D,E,F,G,H) [A >= 1 && D >= 1 && G >= A + D && A >= 2 && B = 0 && H = A && F = G] (?,1) 10. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,E,E,G,G,A) True (1,1) Signature: {(lM1,8);(lZZ1,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{},2->{},3->{4,5,6},4->{},5->{7,9},6->{4,5,6},7->{},9->{4,5,6},10->{0,1,2,3}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(5,7),(9,5)] * Step 4: UnreachableRules WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [0 >= A && B = C && D = E && F = G && H = A] (1,1) 1. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [0 >= 1 + G && B = C && D = E && F = G && H = A] (1,1) 2. start(A,B,C,D,E,F,G,H) -> stop(A,0,C,F,E,F,G,H) [A >= 1 && F = 0 && B = C && D = E && G = 0 && H = A] (1,1) 3. start(A,B,C,D,E,F,G,H) -> lM1(A,1,C,-1 + F,E,F,G,H) [A >= 1 && G >= 1 && B = C && D = E && F = G && H = A] (1,1) 4. lM1(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= B && G >= B && B >= 1 && D = 0 && H = A && F = G] (1,1) 5. lM1(A,B,C,D,E,F,G,H) -> lZZ1(A,0,C,D,E,F,G,H) [D >= 1 && G >= A + D && A >= 1 && D >= 0 && B = A && H = A && F = G] (?,1) 6. lM1(A,B,C,D,E,F,G,H) -> lM1(A,1 + B,C,-1 + D,E,F,G,H) [A >= 1 + B && D >= 1 && A >= B && G >= B + D && B >= 1 && D >= 0 && H = A && F = G] (?,1) 7. lZZ1(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [0 >= D && G >= A + D && A >= 2 && D >= 1 && B = 0 && H = A && F = G] (1,1) 9. lZZ1(A,B,C,D,E,F,G,H) -> lM1(A,1 + B,C,-1 + D,E,F,G,H) [A >= 1 && D >= 1 && G >= A + D && A >= 2 && B = 0 && H = A && F = G] (?,1) 10. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,E,E,G,G,A) True (1,1) Signature: {(lM1,8);(lZZ1,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{},2->{},3->{4,5,6},4->{},5->{9},6->{4,5,6},7->{},9->{4,6},10->{0,1,2,3}] + Applied Processor: UnreachableRules + Details: Following transitions are not reachable from the starting states and are revomed: [7] * Step 5: AddSinks WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [0 >= A && B = C && D = E && F = G && H = A] (1,1) 1. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [0 >= 1 + G && B = C && D = E && F = G && H = A] (1,1) 2. start(A,B,C,D,E,F,G,H) -> stop(A,0,C,F,E,F,G,H) [A >= 1 && F = 0 && B = C && D = E && G = 0 && H = A] (1,1) 3. start(A,B,C,D,E,F,G,H) -> lM1(A,1,C,-1 + F,E,F,G,H) [A >= 1 && G >= 1 && B = C && D = E && F = G && H = A] (1,1) 4. lM1(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= B && G >= B && B >= 1 && D = 0 && H = A && F = G] (1,1) 5. lM1(A,B,C,D,E,F,G,H) -> lZZ1(A,0,C,D,E,F,G,H) [D >= 1 && G >= A + D && A >= 1 && D >= 0 && B = A && H = A && F = G] (?,1) 6. lM1(A,B,C,D,E,F,G,H) -> lM1(A,1 + B,C,-1 + D,E,F,G,H) [A >= 1 + B && D >= 1 && A >= B && G >= B + D && B >= 1 && D >= 0 && H = A && F = G] (?,1) 9. lZZ1(A,B,C,D,E,F,G,H) -> lM1(A,1 + B,C,-1 + D,E,F,G,H) [A >= 1 && D >= 1 && G >= A + D && A >= 2 && B = 0 && H = A && F = G] (?,1) 10. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,E,E,G,G,A) True (1,1) Signature: {(lM1,8);(lZZ1,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{},2->{},3->{4,5,6},4->{},5->{9},6->{4,5,6},9->{4,6},10->{0,1,2,3}] + Applied Processor: AddSinks + Details: () * Step 6: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [0 >= A && B = C && D = E && F = G && H = A] (?,1) 1. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [0 >= 1 + G && B = C && D = E && F = G && H = A] (?,1) 2. start(A,B,C,D,E,F,G,H) -> stop(A,0,C,F,E,F,G,H) [A >= 1 && F = 0 && B = C && D = E && G = 0 && H = A] (?,1) 3. start(A,B,C,D,E,F,G,H) -> lM1(A,1,C,-1 + F,E,F,G,H) [A >= 1 && G >= 1 && B = C && D = E && F = G && H = A] (?,1) 4. lM1(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= B && G >= B && B >= 1 && D = 0 && H = A && F = G] (?,1) 5. lM1(A,B,C,D,E,F,G,H) -> lZZ1(A,0,C,D,E,F,G,H) [D >= 1 && G >= A + D && A >= 1 && D >= 0 && B = A && H = A && F = G] (?,1) 6. lM1(A,B,C,D,E,F,G,H) -> lM1(A,1 + B,C,-1 + D,E,F,G,H) [A >= 1 + B && D >= 1 && A >= B && G >= B + D && B >= 1 && D >= 0 && H = A && F = G] (?,1) 9. lZZ1(A,B,C,D,E,F,G,H) -> lM1(A,1 + B,C,-1 + D,E,F,G,H) [A >= 1 && D >= 1 && G >= A + D && A >= 2 && B = 0 && H = A && F = G] (?,1) 10. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,E,E,G,G,A) True (1,1) 11. lM1(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) 12. start(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) Signature: {(exitus616,8);(lM1,8);(lZZ1,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{},2->{},3->{4,5,6,11},4->{},5->{9},6->{4,5,6,11},9->{4,5,6,11},10->{0,1,2,3,12},11->{},12->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(9,5)] * Step 7: LooptreeTransformer WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [0 >= A && B = C && D = E && F = G && H = A] (?,1) 1. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [0 >= 1 + G && B = C && D = E && F = G && H = A] (?,1) 2. start(A,B,C,D,E,F,G,H) -> stop(A,0,C,F,E,F,G,H) [A >= 1 && F = 0 && B = C && D = E && G = 0 && H = A] (?,1) 3. start(A,B,C,D,E,F,G,H) -> lM1(A,1,C,-1 + F,E,F,G,H) [A >= 1 && G >= 1 && B = C && D = E && F = G && H = A] (?,1) 4. lM1(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= B && G >= B && B >= 1 && D = 0 && H = A && F = G] (?,1) 5. lM1(A,B,C,D,E,F,G,H) -> lZZ1(A,0,C,D,E,F,G,H) [D >= 1 && G >= A + D && A >= 1 && D >= 0 && B = A && H = A && F = G] (?,1) 6. lM1(A,B,C,D,E,F,G,H) -> lM1(A,1 + B,C,-1 + D,E,F,G,H) [A >= 1 + B && D >= 1 && A >= B && G >= B + D && B >= 1 && D >= 0 && H = A && F = G] (?,1) 9. lZZ1(A,B,C,D,E,F,G,H) -> lM1(A,1 + B,C,-1 + D,E,F,G,H) [A >= 1 && D >= 1 && G >= A + D && A >= 2 && B = 0 && H = A && F = G] (?,1) 10. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,E,E,G,G,A) True (1,1) 11. lM1(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) 12. start(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) Signature: {(exitus616,8);(lM1,8);(lZZ1,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{},2->{},3->{4,5,6,11},4->{},5->{9},6->{4,5,6,11},9->{4,6,11},10->{0,1,2,3,12},11->{},12->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,9,10,11,12] | `- p:[5,6,9] c: [9] | `- p:[6] c: [6] * Step 8: SizeAbstraction WORST_CASE(?,POLY) + Considered Problem: (Rules: 0. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [0 >= A && B = C && D = E && F = G && H = A] (?,1) 1. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [0 >= 1 + G && B = C && D = E && F = G && H = A] (?,1) 2. start(A,B,C,D,E,F,G,H) -> stop(A,0,C,F,E,F,G,H) [A >= 1 && F = 0 && B = C && D = E && G = 0 && H = A] (?,1) 3. start(A,B,C,D,E,F,G,H) -> lM1(A,1,C,-1 + F,E,F,G,H) [A >= 1 && G >= 1 && B = C && D = E && F = G && H = A] (?,1) 4. lM1(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= B && G >= B && B >= 1 && D = 0 && H = A && F = G] (?,1) 5. lM1(A,B,C,D,E,F,G,H) -> lZZ1(A,0,C,D,E,F,G,H) [D >= 1 && G >= A + D && A >= 1 && D >= 0 && B = A && H = A && F = G] (?,1) 6. lM1(A,B,C,D,E,F,G,H) -> lM1(A,1 + B,C,-1 + D,E,F,G,H) [A >= 1 + B && D >= 1 && A >= B && G >= B + D && B >= 1 && D >= 0 && H = A && F = G] (?,1) 9. lZZ1(A,B,C,D,E,F,G,H) -> lM1(A,1 + B,C,-1 + D,E,F,G,H) [A >= 1 && D >= 1 && G >= A + D && A >= 2 && B = 0 && H = A && F = G] (?,1) 10. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,E,E,G,G,A) True (1,1) 11. lM1(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) 12. start(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) Signature: {(exitus616,8);(lM1,8);(lZZ1,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{},2->{},3->{4,5,6,11},4->{},5->{9},6->{4,5,6,11},9->{4,6,11},10->{0,1,2,3,12},11->{},12->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,9,10,11,12] | `- p:[5,6,9] c: [9] | `- p:[6] c: [6]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 9: FlowAbstraction WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [A,B,C,D,E,F,G,H,0.0,0.0.0] start ~> stop [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] start ~> stop [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] start ~> stop [A <= A, B <= 0*K, C <= C, D <= F, E <= E, F <= F, G <= G, H <= H] start ~> lM1 [A <= A, B <= K, C <= C, D <= G, E <= E, F <= F, G <= G, H <= H] lM1 ~> stop [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] lM1 ~> lZZ1 [A <= A, B <= 0*K, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] lM1 ~> lM1 [A <= A, B <= H, C <= C, D <= G, E <= E, F <= F, G <= G, H <= H] lZZ1 ~> lM1 [A <= A, B <= K, C <= C, D <= F, E <= E, F <= F, G <= G, H <= H] start0 ~> start [A <= A, B <= C, C <= C, D <= E, E <= E, F <= G, G <= G, H <= A] lM1 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] start ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] + Loop: [0.0 <= A + B + D] lM1 ~> lZZ1 [A <= A, B <= 0*K, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] lM1 ~> lM1 [A <= A, B <= H, C <= C, D <= G, E <= E, F <= F, G <= G, H <= H] lZZ1 ~> lM1 [A <= A, B <= K, C <= C, D <= F, E <= E, F <= F, G <= G, H <= H] + Loop: [0.0.0 <= K + A + B] lM1 ~> lM1 [A <= A, B <= H, C <= C, D <= G, E <= E, F <= F, G <= G, H <= H] + Applied Processor: FlowAbstraction + Details: () * Step 10: LareProcessor WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,F,G,H,0.0,0.0.0] start ~> stop [] start ~> stop [] start ~> stop [F ~=> D,K ~=> B] start ~> lM1 [G ~=> D,K ~=> B] lM1 ~> stop [] lM1 ~> lZZ1 [K ~=> B] lM1 ~> lM1 [G ~=> D,H ~=> B] lZZ1 ~> lM1 [F ~=> D,K ~=> B] start0 ~> start [A ~=> H,C ~=> B,E ~=> D,G ~=> F] lM1 ~> exitus616 [] start ~> exitus616 [] + Loop: [A ~+> 0.0,B ~+> 0.0,D ~+> 0.0] lM1 ~> lZZ1 [K ~=> B] lM1 ~> lM1 [G ~=> D,H ~=> B] lZZ1 ~> lM1 [F ~=> D,K ~=> B] + Loop: [A ~+> 0.0.0,B ~+> 0.0.0,K ~+> 0.0.0] lM1 ~> lM1 [G ~=> D,H ~=> B] + Applied Processor: LareProcessor + Details: start0 ~> stop [A ~=> B ,A ~=> H ,C ~=> B ,E ~=> D ,G ~=> D ,G ~=> F ,K ~=> B ,A ~+> 0.0 ,A ~+> 0.0.0 ,A ~+> tick ,G ~+> 0.0 ,G ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> 0.0.0 ,A ~*> tick ,G ~*> tick ,K ~*> 0.0.0 ,K ~*> tick] start0 ~> exitus616 [A ~=> B ,A ~=> H ,C ~=> B ,E ~=> D ,G ~=> D ,G ~=> F ,K ~=> B ,A ~+> 0.0 ,A ~+> 0.0.0 ,A ~+> tick ,G ~+> 0.0 ,G ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> 0.0.0 ,A ~*> tick ,G ~*> tick ,K ~*> 0.0.0 ,K ~*> tick] + lM1> [F ~=> D ,G ~=> D ,H ~=> B ,K ~=> B ,A ~+> 0.0 ,A ~+> 0.0.0 ,A ~+> tick ,B ~+> 0.0 ,B ~+> 0.0.0 ,B ~+> tick ,D ~+> 0.0 ,D ~+> tick ,H ~+> 0.0.0 ,H ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> tick ,B ~*> tick ,D ~*> tick ,K ~*> 0.0.0 ,K ~*> tick] + lM1> [G ~=> D ,H ~=> B ,A ~+> 0.0.0 ,A ~+> tick ,B ~+> 0.0.0 ,B ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> tick] YES(?,POLY)