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