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,D,H) [0 >= 1 + A && B = C && D = A && E = F && G = H] (?,1) 1. start(A,B,C,D,E,F,G,H) -> lbl142(A,B,C,D,0,F,-1 + D,H) [D = 0 && B = C && A = 0 && E = F && G = H] (?,1) 2. start(A,B,C,D,E,F,G,H) -> lbl91(A,I,C,D,0,F,D,H) [A >= 1 && B = C && D = A && E = F && G = H] (?,1) 3. start(A,B,C,D,E,F,G,H) -> lbl131(A,B,C,D,1,F,D,H) [A >= 1 && B = C && D = A && E = F && G = H] (?,1) 4. lbl142(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= 0 && 1 + G = 0 && E = 0 && D = A] (?,1) 5. lbl142(A,B,C,D,E,F,G,H) -> lbl142(A,B,C,D,0,F,-1 + G,H) [A >= 1 && G = 0 && E = 1 && D = A] (?,1) 6. lbl142(A,B,C,D,E,F,G,H) -> lbl91(A,I,C,D,0,F,G,H) [E >= 2 && E >= 0 && A >= E && 1 + G = E && D = A] (?,1) 7. lbl142(A,B,C,D,E,F,G,H) -> lbl131(A,B,C,D,1,F,G,H) [E >= 2 && E >= 0 && A >= E && 1 + G = E && D = A] (?,1) 8. lbl131(A,B,C,D,E,F,G,H) -> lbl142(A,B,C,D,E,F,-1 + G,H) [G >= 1 && A >= G && E = G && D = A] (?,1) 9. lbl131(A,B,C,D,E,F,G,H) -> lbl91(A,I,C,D,E,F,G,H) [G >= 1 + E && G >= E && E >= 1 && A >= G && D = A] (?,1) 10. lbl131(A,B,C,D,E,F,G,H) -> lbl131(A,B,C,D,1 + E,F,G,H) [G >= 1 + E && G >= E && E >= 1 && A >= G && D = A] (?,1) 11. lbl91(A,B,C,D,E,F,G,H) -> lbl131(A,B,C,D,1 + E,F,G,H) [E >= 0 && G >= 1 + E && A >= G && D = A] (?,1) 12. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,A,F,F,H,H) True (1,1) Signature: {(lbl131,8);(lbl142,8);(lbl91,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{4,5,6,7},2->{11},3->{8,9,10},4->{},5->{4,5,6,7},6->{11},7->{8,9,10},8->{4,5,6,7},9->{11},10->{8 ,9,10},11->{8,9,10},12->{0,1,2,3}] + 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,D,H) [0 >= 1 + A && B = C && D = A && E = F && G = H] (1,1) 1. start(A,B,C,D,E,F,G,H) -> lbl142(A,B,C,D,0,F,-1 + D,H) [D = 0 && B = C && A = 0 && E = F && G = H] (1,1) 2. start(A,B,C,D,E,F,G,H) -> lbl91(A,I,C,D,0,F,D,H) [A >= 1 && B = C && D = A && E = F && G = H] (1,1) 3. start(A,B,C,D,E,F,G,H) -> lbl131(A,B,C,D,1,F,D,H) [A >= 1 && B = C && D = A && E = F && G = H] (1,1) 4. lbl142(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= 0 && 1 + G = 0 && E = 0 && D = A] (1,1) 5. lbl142(A,B,C,D,E,F,G,H) -> lbl142(A,B,C,D,0,F,-1 + G,H) [A >= 1 && G = 0 && E = 1 && D = A] (?,1) 6. lbl142(A,B,C,D,E,F,G,H) -> lbl91(A,I,C,D,0,F,G,H) [E >= 2 && E >= 0 && A >= E && 1 + G = E && D = A] (?,1) 7. lbl142(A,B,C,D,E,F,G,H) -> lbl131(A,B,C,D,1,F,G,H) [E >= 2 && E >= 0 && A >= E && 1 + G = E && D = A] (?,1) 8. lbl131(A,B,C,D,E,F,G,H) -> lbl142(A,B,C,D,E,F,-1 + G,H) [G >= 1 && A >= G && E = G && D = A] (?,1) 9. lbl131(A,B,C,D,E,F,G,H) -> lbl91(A,I,C,D,E,F,G,H) [G >= 1 + E && G >= E && E >= 1 && A >= G && D = A] (?,1) 10. lbl131(A,B,C,D,E,F,G,H) -> lbl131(A,B,C,D,1 + E,F,G,H) [G >= 1 + E && G >= E && E >= 1 && A >= G && D = A] (?,1) 11. lbl91(A,B,C,D,E,F,G,H) -> lbl131(A,B,C,D,1 + E,F,G,H) [E >= 0 && G >= 1 + E && A >= G && D = A] (?,1) 12. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,A,F,F,H,H) True (1,1) Signature: {(lbl131,8);(lbl142,8);(lbl91,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{4,5,6,7},2->{11},3->{8,9,10},4->{},5->{4,5,6,7},6->{11},7->{8,9,10},8->{4,5,6,7},9->{11},10->{8 ,9,10},11->{8,9,10},12->{0,1,2,3}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,5),(1,6),(1,7),(5,5),(5,6),(5,7),(8,4)] * 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,D,H) [0 >= 1 + A && B = C && D = A && E = F && G = H] (1,1) 1. start(A,B,C,D,E,F,G,H) -> lbl142(A,B,C,D,0,F,-1 + D,H) [D = 0 && B = C && A = 0 && E = F && G = H] (1,1) 2. start(A,B,C,D,E,F,G,H) -> lbl91(A,I,C,D,0,F,D,H) [A >= 1 && B = C && D = A && E = F && G = H] (1,1) 3. start(A,B,C,D,E,F,G,H) -> lbl131(A,B,C,D,1,F,D,H) [A >= 1 && B = C && D = A && E = F && G = H] (1,1) 4. lbl142(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= 0 && 1 + G = 0 && E = 0 && D = A] (1,1) 5. lbl142(A,B,C,D,E,F,G,H) -> lbl142(A,B,C,D,0,F,-1 + G,H) [A >= 1 && G = 0 && E = 1 && D = A] (?,1) 6. lbl142(A,B,C,D,E,F,G,H) -> lbl91(A,I,C,D,0,F,G,H) [E >= 2 && E >= 0 && A >= E && 1 + G = E && D = A] (?,1) 7. lbl142(A,B,C,D,E,F,G,H) -> lbl131(A,B,C,D,1,F,G,H) [E >= 2 && E >= 0 && A >= E && 1 + G = E && D = A] (?,1) 8. lbl131(A,B,C,D,E,F,G,H) -> lbl142(A,B,C,D,E,F,-1 + G,H) [G >= 1 && A >= G && E = G && D = A] (?,1) 9. lbl131(A,B,C,D,E,F,G,H) -> lbl91(A,I,C,D,E,F,G,H) [G >= 1 + E && G >= E && E >= 1 && A >= G && D = A] (?,1) 10. lbl131(A,B,C,D,E,F,G,H) -> lbl131(A,B,C,D,1 + E,F,G,H) [G >= 1 + E && G >= E && E >= 1 && A >= G && D = A] (?,1) 11. lbl91(A,B,C,D,E,F,G,H) -> lbl131(A,B,C,D,1 + E,F,G,H) [E >= 0 && G >= 1 + E && A >= G && D = A] (?,1) 12. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,A,F,F,H,H) True (1,1) Signature: {(lbl131,8);(lbl142,8);(lbl91,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{4},2->{11},3->{8,9,10},4->{},5->{4},6->{11},7->{8,9,10},8->{5,6,7},9->{11},10->{8,9,10},11->{8 ,9,10},12->{0,1,2,3}] + 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,D,H) [0 >= 1 + A && B = C && D = A && E = F && G = H] (?,1) 1. start(A,B,C,D,E,F,G,H) -> lbl142(A,B,C,D,0,F,-1 + D,H) [D = 0 && B = C && A = 0 && E = F && G = H] (?,1) 2. start(A,B,C,D,E,F,G,H) -> lbl91(A,I,C,D,0,F,D,H) [A >= 1 && B = C && D = A && E = F && G = H] (?,1) 3. start(A,B,C,D,E,F,G,H) -> lbl131(A,B,C,D,1,F,D,H) [A >= 1 && B = C && D = A && E = F && G = H] (?,1) 4. lbl142(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= 0 && 1 + G = 0 && E = 0 && D = A] (?,1) 5. lbl142(A,B,C,D,E,F,G,H) -> lbl142(A,B,C,D,0,F,-1 + G,H) [A >= 1 && G = 0 && E = 1 && D = A] (?,1) 6. lbl142(A,B,C,D,E,F,G,H) -> lbl91(A,I,C,D,0,F,G,H) [E >= 2 && E >= 0 && A >= E && 1 + G = E && D = A] (?,1) 7. lbl142(A,B,C,D,E,F,G,H) -> lbl131(A,B,C,D,1,F,G,H) [E >= 2 && E >= 0 && A >= E && 1 + G = E && D = A] (?,1) 8. lbl131(A,B,C,D,E,F,G,H) -> lbl142(A,B,C,D,E,F,-1 + G,H) [G >= 1 && A >= G && E = G && D = A] (?,1) 9. lbl131(A,B,C,D,E,F,G,H) -> lbl91(A,I,C,D,E,F,G,H) [G >= 1 + E && G >= E && E >= 1 && A >= G && D = A] (?,1) 10. lbl131(A,B,C,D,E,F,G,H) -> lbl131(A,B,C,D,1 + E,F,G,H) [G >= 1 + E && G >= E && E >= 1 && A >= G && D = A] (?,1) 11. lbl91(A,B,C,D,E,F,G,H) -> lbl131(A,B,C,D,1 + E,F,G,H) [E >= 0 && G >= 1 + E && A >= G && D = A] (?,1) 12. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,A,F,F,H,H) True (1,1) 13. lbl142(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) 14. start(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) Signature: {(exitus616,8);(lbl131,8);(lbl142,8);(lbl91,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{4,5,6,7,13},2->{11},3->{8,9,10},4->{},5->{4,5,6,7,13},6->{11},7->{8,9,10},8->{4,5,6,7,13} ,9->{11},10->{8,9,10},11->{8,9,10},12->{0,1,2,3,14},13->{},14->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,5),(1,6),(1,7),(5,5),(5,6),(5,7),(8,4)] * 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,D,H) [0 >= 1 + A && B = C && D = A && E = F && G = H] (?,1) 1. start(A,B,C,D,E,F,G,H) -> lbl142(A,B,C,D,0,F,-1 + D,H) [D = 0 && B = C && A = 0 && E = F && G = H] (?,1) 2. start(A,B,C,D,E,F,G,H) -> lbl91(A,I,C,D,0,F,D,H) [A >= 1 && B = C && D = A && E = F && G = H] (?,1) 3. start(A,B,C,D,E,F,G,H) -> lbl131(A,B,C,D,1,F,D,H) [A >= 1 && B = C && D = A && E = F && G = H] (?,1) 4. lbl142(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= 0 && 1 + G = 0 && E = 0 && D = A] (?,1) 5. lbl142(A,B,C,D,E,F,G,H) -> lbl142(A,B,C,D,0,F,-1 + G,H) [A >= 1 && G = 0 && E = 1 && D = A] (?,1) 6. lbl142(A,B,C,D,E,F,G,H) -> lbl91(A,I,C,D,0,F,G,H) [E >= 2 && E >= 0 && A >= E && 1 + G = E && D = A] (?,1) 7. lbl142(A,B,C,D,E,F,G,H) -> lbl131(A,B,C,D,1,F,G,H) [E >= 2 && E >= 0 && A >= E && 1 + G = E && D = A] (?,1) 8. lbl131(A,B,C,D,E,F,G,H) -> lbl142(A,B,C,D,E,F,-1 + G,H) [G >= 1 && A >= G && E = G && D = A] (?,1) 9. lbl131(A,B,C,D,E,F,G,H) -> lbl91(A,I,C,D,E,F,G,H) [G >= 1 + E && G >= E && E >= 1 && A >= G && D = A] (?,1) 10. lbl131(A,B,C,D,E,F,G,H) -> lbl131(A,B,C,D,1 + E,F,G,H) [G >= 1 + E && G >= E && E >= 1 && A >= G && D = A] (?,1) 11. lbl91(A,B,C,D,E,F,G,H) -> lbl131(A,B,C,D,1 + E,F,G,H) [E >= 0 && G >= 1 + E && A >= G && D = A] (?,1) 12. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,A,F,F,H,H) True (1,1) 13. lbl142(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) 14. start(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) Signature: {(exitus616,8);(lbl131,8);(lbl142,8);(lbl91,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{4,13},2->{11},3->{8,9,10},4->{},5->{4,13},6->{11},7->{8,9,10},8->{5,6,7,13},9->{11},10->{8,9 ,10},11->{8,9,10},12->{0,1,2,3,14},13->{},14->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14] | `- p:[11,6,8,7,10,9] c: [8] | `- p:[11,9,10] c: [11] | `- p:[10] c: [10] * 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,D,H) [0 >= 1 + A && B = C && D = A && E = F && G = H] (?,1) 1. start(A,B,C,D,E,F,G,H) -> lbl142(A,B,C,D,0,F,-1 + D,H) [D = 0 && B = C && A = 0 && E = F && G = H] (?,1) 2. start(A,B,C,D,E,F,G,H) -> lbl91(A,I,C,D,0,F,D,H) [A >= 1 && B = C && D = A && E = F && G = H] (?,1) 3. start(A,B,C,D,E,F,G,H) -> lbl131(A,B,C,D,1,F,D,H) [A >= 1 && B = C && D = A && E = F && G = H] (?,1) 4. lbl142(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= 0 && 1 + G = 0 && E = 0 && D = A] (?,1) 5. lbl142(A,B,C,D,E,F,G,H) -> lbl142(A,B,C,D,0,F,-1 + G,H) [A >= 1 && G = 0 && E = 1 && D = A] (?,1) 6. lbl142(A,B,C,D,E,F,G,H) -> lbl91(A,I,C,D,0,F,G,H) [E >= 2 && E >= 0 && A >= E && 1 + G = E && D = A] (?,1) 7. lbl142(A,B,C,D,E,F,G,H) -> lbl131(A,B,C,D,1,F,G,H) [E >= 2 && E >= 0 && A >= E && 1 + G = E && D = A] (?,1) 8. lbl131(A,B,C,D,E,F,G,H) -> lbl142(A,B,C,D,E,F,-1 + G,H) [G >= 1 && A >= G && E = G && D = A] (?,1) 9. lbl131(A,B,C,D,E,F,G,H) -> lbl91(A,I,C,D,E,F,G,H) [G >= 1 + E && G >= E && E >= 1 && A >= G && D = A] (?,1) 10. lbl131(A,B,C,D,E,F,G,H) -> lbl131(A,B,C,D,1 + E,F,G,H) [G >= 1 + E && G >= E && E >= 1 && A >= G && D = A] (?,1) 11. lbl91(A,B,C,D,E,F,G,H) -> lbl131(A,B,C,D,1 + E,F,G,H) [E >= 0 && G >= 1 + E && A >= G && D = A] (?,1) 12. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,A,F,F,H,H) True (1,1) 13. lbl142(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) 14. start(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) Signature: {(exitus616,8);(lbl131,8);(lbl142,8);(lbl91,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{4,13},2->{11},3->{8,9,10},4->{},5->{4,13},6->{11},7->{8,9,10},8->{5,6,7,13},9->{11},10->{8,9 ,10},11->{8,9,10},12->{0,1,2,3,14},13->{},14->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14] | `- p:[11,6,8,7,10,9] c: [8] | `- p:[11,9,10] c: [11] | `- p:[10] c: [10]) + 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 <= D, H <= H] start ~> lbl142 [A <= A, B <= B, C <= C, D <= D, E <= 0*K, F <= F, G <= K, H <= H] start ~> lbl91 [A <= A, B <= unknown, C <= C, D <= D, E <= 0*K, F <= F, G <= D, H <= H] start ~> lbl131 [A <= A, B <= B, C <= C, D <= D, E <= K, F <= F, G <= D, H <= H] lbl142 ~> stop [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] lbl142 ~> lbl142 [A <= A, B <= B, C <= C, D <= D, E <= 0*K, F <= F, G <= K, H <= H] lbl142 ~> lbl91 [A <= A, B <= unknown, C <= C, D <= D, E <= 0*K, F <= F, G <= G, H <= H] lbl142 ~> lbl131 [A <= A, B <= B, C <= C, D <= D, E <= K, F <= F, G <= G, H <= H] lbl131 ~> lbl142 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= D, H <= H] lbl131 ~> lbl91 [A <= A, B <= unknown, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] lbl131 ~> lbl131 [A <= A, B <= B, C <= C, D <= D, E <= D, F <= F, G <= G, H <= H] lbl91 ~> lbl131 [A <= A, B <= B, C <= C, D <= D, E <= D, F <= F, G <= G, H <= H] start0 ~> start [A <= A, B <= C, C <= C, D <= A, E <= F, F <= F, G <= H, H <= H] lbl142 ~> 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 + G] lbl91 ~> lbl131 [A <= A, B <= B, C <= C, D <= D, E <= D, F <= F, G <= G, H <= H] lbl142 ~> lbl91 [A <= A, B <= unknown, C <= C, D <= D, E <= 0*K, F <= F, G <= G, H <= H] lbl131 ~> lbl142 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= D, H <= H] lbl142 ~> lbl131 [A <= A, B <= B, C <= C, D <= D, E <= K, F <= F, G <= G, H <= H] lbl131 ~> lbl131 [A <= A, B <= B, C <= C, D <= D, E <= D, F <= F, G <= G, H <= H] lbl131 ~> lbl91 [A <= A, B <= unknown, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] + Loop: [0.0.0 <= E + G] lbl91 ~> lbl131 [A <= A, B <= B, C <= C, D <= D, E <= D, F <= F, G <= G, H <= H] lbl131 ~> lbl91 [A <= A, B <= unknown, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] lbl131 ~> lbl131 [A <= A, B <= B, C <= C, D <= D, E <= D, F <= F, G <= G, H <= H] + Loop: [0.0.0.0 <= K + E + G] lbl131 ~> lbl131 [A <= A, B <= B, C <= C, D <= D, E <= D, 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 [D ~=> G] start ~> lbl142 [K ~=> E,K ~=> G] start ~> lbl91 [D ~=> G,K ~=> E,huge ~=> B] start ~> lbl131 [D ~=> G,K ~=> E] lbl142 ~> stop [] lbl142 ~> lbl142 [K ~=> E,K ~=> G] lbl142 ~> lbl91 [K ~=> E,huge ~=> B] lbl142 ~> lbl131 [K ~=> E] lbl131 ~> lbl142 [D ~=> G] lbl131 ~> lbl91 [huge ~=> B] lbl131 ~> lbl131 [D ~=> E] lbl91 ~> lbl131 [D ~=> E] start0 ~> start [A ~=> D,C ~=> B,F ~=> E,H ~=> G] lbl142 ~> exitus616 [] start ~> exitus616 [] + Loop: [G ~+> 0.0,K ~+> 0.0] lbl91 ~> lbl131 [D ~=> E] lbl142 ~> lbl91 [K ~=> E,huge ~=> B] lbl131 ~> lbl142 [D ~=> G] lbl142 ~> lbl131 [K ~=> E] lbl131 ~> lbl131 [D ~=> E] lbl131 ~> lbl91 [huge ~=> B] + Loop: [E ~+> 0.0.0,G ~+> 0.0.0] lbl91 ~> lbl131 [D ~=> E] lbl131 ~> lbl91 [huge ~=> B] lbl131 ~> lbl131 [D ~=> E] + Loop: [E ~+> 0.0.0.0,G ~+> 0.0.0.0,K ~+> 0.0.0.0] lbl131 ~> lbl131 [D ~=> E] + Applied Processor: LareProcessor + Details: start0 ~> stop [A ~=> D ,A ~=> E ,A ~=> G ,C ~=> B ,F ~=> E ,K ~=> E ,K ~=> G ,huge ~=> B ,A ~+> 0.0 ,A ~+> 0.0.0 ,A ~+> 0.0.0.0 ,A ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> tick ,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 ~> exitus616 [A ~=> D ,A ~=> E ,A ~=> G ,C ~=> B ,F ~=> E ,H ~=> G ,K ~=> E ,K ~=> G ,huge ~=> B ,A ~+> 0.0 ,A ~+> 0.0.0 ,A ~+> 0.0.0.0 ,A ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> tick ,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] + lbl142> [D ~=> E ,D ~=> G ,K ~=> E ,huge ~=> B ,D ~+> 0.0.0 ,D ~+> 0.0.0.0 ,D ~+> tick ,G ~+> 0.0 ,G ~+> 0.0.0 ,G ~+> 0.0.0.0 ,G ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> tick ,D ~*> 0.0.0 ,D ~*> 0.0.0.0 ,D ~*> tick ,G ~*> tick ,K ~*> 0.0.0.0 ,K ~*> tick] lbl142> [D ~=> E ,D ~=> G ,K ~=> E ,huge ~=> B ,D ~+> 0.0.0 ,D ~+> 0.0.0.0 ,D ~+> tick ,E ~+> 0.0.0 ,E ~+> 0.0.0.0 ,E ~+> tick ,G ~+> 0.0 ,G ~+> 0.0.0 ,G ~+> 0.0.0.0 ,G ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> tick ,D ~*> 0.0.0 ,D ~*> 0.0.0.0 ,D ~*> tick ,E ~*> tick ,G ~*> tick ,K ~*> 0.0.0.0 ,K ~*> tick] lbl142> [D ~=> E ,D ~=> G ,K ~=> E ,huge ~=> B ,D ~+> 0.0.0 ,D ~+> 0.0.0.0 ,D ~+> tick ,E ~+> 0.0.0 ,E ~+> 0.0.0.0 ,E ~+> tick ,G ~+> 0.0 ,G ~+> 0.0.0 ,G ~+> 0.0.0.0 ,G ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> tick ,D ~*> 0.0.0 ,D ~*> 0.0.0.0 ,D ~*> tick ,E ~*> tick ,G ~*> tick ,K ~*> 0.0.0.0 ,K ~*> tick] + lbl131> [D ~=> E ,huge ~=> B ,D ~+> 0.0.0.0 ,D ~+> tick ,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.0.0 ,K ~+> tick ,E ~*> tick ,G ~*> tick ,K ~*> tick] lbl131> [D ~=> E ,huge ~=> B ,D ~+> 0.0.0.0 ,D ~+> tick ,E ~+> 0.0.0 ,E ~+> tick ,G ~+> 0.0.0 ,G ~+> 0.0.0.0 ,G ~+> tick ,tick ~+> tick ,K ~+> 0.0.0.0 ,K ~+> tick ,D ~*> tick ,E ~*> tick ,G ~*> tick ,K ~*> tick] + lbl131> [D ~=> E ,E ~+> 0.0.0.0 ,E ~+> tick ,G ~+> 0.0.0.0 ,G ~+> tick ,tick ~+> tick ,K ~+> 0.0.0.0 ,K ~+> tick] YES(?,POLY)