YES(?,POLY) * Step 1: TrivialSCCs WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalrealbubblestart(A,B,C,D) -> evalrealbubbleentryin(A,B,C,D) True (1,1) 1. evalrealbubbleentryin(A,B,C,D) -> evalrealbubblebb7in(-1 + A,B,C,D) True (?,1) 2. evalrealbubblebb7in(A,B,C,D) -> evalrealbubblebb4in(A,0,0,D) [A >= 1] (?,1) 3. evalrealbubblebb7in(A,B,C,D) -> evalrealbubblereturnin(A,B,C,D) [0 >= A] (?,1) 4. evalrealbubblebb4in(A,B,C,D) -> evalrealbubblebb1in(A,B,C,D) [A >= 1 + B] (?,1) 5. evalrealbubblebb4in(A,B,C,D) -> evalrealbubblebb5in(A,B,C,D) [B >= A] (?,1) 6. evalrealbubblebb1in(A,B,C,D) -> evalrealbubblebb2in(A,B,C,D) [E >= 1 + F] (?,1) 7. evalrealbubblebb1in(A,B,C,D) -> evalrealbubblebb3in(A,B,C,C) [F >= E] (?,1) 8. evalrealbubblebb2in(A,B,C,D) -> evalrealbubblebb3in(A,B,C,1) True (?,1) 9. evalrealbubblebb3in(A,B,C,D) -> evalrealbubblebb4in(A,1 + B,D,D) True (?,1) 10. evalrealbubblebb5in(A,B,C,D) -> evalrealbubblereturnin(A,B,C,D) [C = 0] (?,1) 11. evalrealbubblebb5in(A,B,C,D) -> evalrealbubblebb6in(A,B,C,D) [0 >= 1 + C] (?,1) 12. evalrealbubblebb5in(A,B,C,D) -> evalrealbubblebb6in(A,B,C,D) [C >= 1] (?,1) 13. evalrealbubblebb6in(A,B,C,D) -> evalrealbubblebb7in(-1 + A,B,C,D) True (?,1) 14. evalrealbubblereturnin(A,B,C,D) -> evalrealbubblestop(A,B,C,D) True (?,1) Signature: {(evalrealbubblebb1in,4) ;(evalrealbubblebb2in,4) ;(evalrealbubblebb3in,4) ;(evalrealbubblebb4in,4) ;(evalrealbubblebb5in,4) ;(evalrealbubblebb6in,4) ;(evalrealbubblebb7in,4) ;(evalrealbubbleentryin,4) ;(evalrealbubblereturnin,4) ;(evalrealbubblestart,4) ;(evalrealbubblestop,4)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{14},4->{6,7},5->{10,11,12},6->{8},7->{9},8->{9},9->{4,5},10->{14},11->{13} ,12->{13},13->{2,3},14->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalrealbubblestart(A,B,C,D) -> evalrealbubbleentryin(A,B,C,D) True (1,1) 1. evalrealbubbleentryin(A,B,C,D) -> evalrealbubblebb7in(-1 + A,B,C,D) True (1,1) 2. evalrealbubblebb7in(A,B,C,D) -> evalrealbubblebb4in(A,0,0,D) [A >= 1] (?,1) 3. evalrealbubblebb7in(A,B,C,D) -> evalrealbubblereturnin(A,B,C,D) [0 >= A] (1,1) 4. evalrealbubblebb4in(A,B,C,D) -> evalrealbubblebb1in(A,B,C,D) [A >= 1 + B] (?,1) 5. evalrealbubblebb4in(A,B,C,D) -> evalrealbubblebb5in(A,B,C,D) [B >= A] (?,1) 6. evalrealbubblebb1in(A,B,C,D) -> evalrealbubblebb2in(A,B,C,D) [E >= 1 + F] (?,1) 7. evalrealbubblebb1in(A,B,C,D) -> evalrealbubblebb3in(A,B,C,C) [F >= E] (?,1) 8. evalrealbubblebb2in(A,B,C,D) -> evalrealbubblebb3in(A,B,C,1) True (?,1) 9. evalrealbubblebb3in(A,B,C,D) -> evalrealbubblebb4in(A,1 + B,D,D) True (?,1) 10. evalrealbubblebb5in(A,B,C,D) -> evalrealbubblereturnin(A,B,C,D) [C = 0] (1,1) 11. evalrealbubblebb5in(A,B,C,D) -> evalrealbubblebb6in(A,B,C,D) [0 >= 1 + C] (?,1) 12. evalrealbubblebb5in(A,B,C,D) -> evalrealbubblebb6in(A,B,C,D) [C >= 1] (?,1) 13. evalrealbubblebb6in(A,B,C,D) -> evalrealbubblebb7in(-1 + A,B,C,D) True (?,1) 14. evalrealbubblereturnin(A,B,C,D) -> evalrealbubblestop(A,B,C,D) True (1,1) Signature: {(evalrealbubblebb1in,4) ;(evalrealbubblebb2in,4) ;(evalrealbubblebb3in,4) ;(evalrealbubblebb4in,4) ;(evalrealbubblebb5in,4) ;(evalrealbubblebb6in,4) ;(evalrealbubblebb7in,4) ;(evalrealbubbleentryin,4) ;(evalrealbubblereturnin,4) ;(evalrealbubblestart,4) ;(evalrealbubblestop,4)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{14},4->{6,7},5->{10,11,12},6->{8},7->{9},8->{9},9->{4,5},10->{14},11->{13} ,12->{13},13->{2,3},14->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(2,5)] * Step 3: AddSinks WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalrealbubblestart(A,B,C,D) -> evalrealbubbleentryin(A,B,C,D) True (1,1) 1. evalrealbubbleentryin(A,B,C,D) -> evalrealbubblebb7in(-1 + A,B,C,D) True (1,1) 2. evalrealbubblebb7in(A,B,C,D) -> evalrealbubblebb4in(A,0,0,D) [A >= 1] (?,1) 3. evalrealbubblebb7in(A,B,C,D) -> evalrealbubblereturnin(A,B,C,D) [0 >= A] (1,1) 4. evalrealbubblebb4in(A,B,C,D) -> evalrealbubblebb1in(A,B,C,D) [A >= 1 + B] (?,1) 5. evalrealbubblebb4in(A,B,C,D) -> evalrealbubblebb5in(A,B,C,D) [B >= A] (?,1) 6. evalrealbubblebb1in(A,B,C,D) -> evalrealbubblebb2in(A,B,C,D) [E >= 1 + F] (?,1) 7. evalrealbubblebb1in(A,B,C,D) -> evalrealbubblebb3in(A,B,C,C) [F >= E] (?,1) 8. evalrealbubblebb2in(A,B,C,D) -> evalrealbubblebb3in(A,B,C,1) True (?,1) 9. evalrealbubblebb3in(A,B,C,D) -> evalrealbubblebb4in(A,1 + B,D,D) True (?,1) 10. evalrealbubblebb5in(A,B,C,D) -> evalrealbubblereturnin(A,B,C,D) [C = 0] (1,1) 11. evalrealbubblebb5in(A,B,C,D) -> evalrealbubblebb6in(A,B,C,D) [0 >= 1 + C] (?,1) 12. evalrealbubblebb5in(A,B,C,D) -> evalrealbubblebb6in(A,B,C,D) [C >= 1] (?,1) 13. evalrealbubblebb6in(A,B,C,D) -> evalrealbubblebb7in(-1 + A,B,C,D) True (?,1) 14. evalrealbubblereturnin(A,B,C,D) -> evalrealbubblestop(A,B,C,D) True (1,1) Signature: {(evalrealbubblebb1in,4) ;(evalrealbubblebb2in,4) ;(evalrealbubblebb3in,4) ;(evalrealbubblebb4in,4) ;(evalrealbubblebb5in,4) ;(evalrealbubblebb6in,4) ;(evalrealbubblebb7in,4) ;(evalrealbubbleentryin,4) ;(evalrealbubblereturnin,4) ;(evalrealbubblestart,4) ;(evalrealbubblestop,4)} Flow Graph: [0->{1},1->{2,3},2->{4},3->{14},4->{6,7},5->{10,11,12},6->{8},7->{9},8->{9},9->{4,5},10->{14},11->{13} ,12->{13},13->{2,3},14->{}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalrealbubblestart(A,B,C,D) -> evalrealbubbleentryin(A,B,C,D) True (1,1) 1. evalrealbubbleentryin(A,B,C,D) -> evalrealbubblebb7in(-1 + A,B,C,D) True (?,1) 2. evalrealbubblebb7in(A,B,C,D) -> evalrealbubblebb4in(A,0,0,D) [A >= 1] (?,1) 3. evalrealbubblebb7in(A,B,C,D) -> evalrealbubblereturnin(A,B,C,D) [0 >= A] (?,1) 4. evalrealbubblebb4in(A,B,C,D) -> evalrealbubblebb1in(A,B,C,D) [A >= 1 + B] (?,1) 5. evalrealbubblebb4in(A,B,C,D) -> evalrealbubblebb5in(A,B,C,D) [B >= A] (?,1) 6. evalrealbubblebb1in(A,B,C,D) -> evalrealbubblebb2in(A,B,C,D) [E >= 1 + F] (?,1) 7. evalrealbubblebb1in(A,B,C,D) -> evalrealbubblebb3in(A,B,C,C) [F >= E] (?,1) 8. evalrealbubblebb2in(A,B,C,D) -> evalrealbubblebb3in(A,B,C,1) True (?,1) 9. evalrealbubblebb3in(A,B,C,D) -> evalrealbubblebb4in(A,1 + B,D,D) True (?,1) 10. evalrealbubblebb5in(A,B,C,D) -> evalrealbubblereturnin(A,B,C,D) [C = 0] (?,1) 11. evalrealbubblebb5in(A,B,C,D) -> evalrealbubblebb6in(A,B,C,D) [0 >= 1 + C] (?,1) 12. evalrealbubblebb5in(A,B,C,D) -> evalrealbubblebb6in(A,B,C,D) [C >= 1] (?,1) 13. evalrealbubblebb6in(A,B,C,D) -> evalrealbubblebb7in(-1 + A,B,C,D) True (?,1) 14. evalrealbubblereturnin(A,B,C,D) -> evalrealbubblestop(A,B,C,D) True (?,1) 15. evalrealbubblereturnin(A,B,C,D) -> exitus616(A,B,C,D) True (?,1) Signature: {(evalrealbubblebb1in,4) ;(evalrealbubblebb2in,4) ;(evalrealbubblebb3in,4) ;(evalrealbubblebb4in,4) ;(evalrealbubblebb5in,4) ;(evalrealbubblebb6in,4) ;(evalrealbubblebb7in,4) ;(evalrealbubbleentryin,4) ;(evalrealbubblereturnin,4) ;(evalrealbubblestart,4) ;(evalrealbubblestop,4) ;(exitus616,4)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{14,15},4->{6,7},5->{10,11,12},6->{8},7->{9},8->{9},9->{4,5},10->{14,15} ,11->{13},12->{13},13->{2,3},14->{},15->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(2,5)] * Step 5: LooptreeTransformer WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalrealbubblestart(A,B,C,D) -> evalrealbubbleentryin(A,B,C,D) True (1,1) 1. evalrealbubbleentryin(A,B,C,D) -> evalrealbubblebb7in(-1 + A,B,C,D) True (?,1) 2. evalrealbubblebb7in(A,B,C,D) -> evalrealbubblebb4in(A,0,0,D) [A >= 1] (?,1) 3. evalrealbubblebb7in(A,B,C,D) -> evalrealbubblereturnin(A,B,C,D) [0 >= A] (?,1) 4. evalrealbubblebb4in(A,B,C,D) -> evalrealbubblebb1in(A,B,C,D) [A >= 1 + B] (?,1) 5. evalrealbubblebb4in(A,B,C,D) -> evalrealbubblebb5in(A,B,C,D) [B >= A] (?,1) 6. evalrealbubblebb1in(A,B,C,D) -> evalrealbubblebb2in(A,B,C,D) [E >= 1 + F] (?,1) 7. evalrealbubblebb1in(A,B,C,D) -> evalrealbubblebb3in(A,B,C,C) [F >= E] (?,1) 8. evalrealbubblebb2in(A,B,C,D) -> evalrealbubblebb3in(A,B,C,1) True (?,1) 9. evalrealbubblebb3in(A,B,C,D) -> evalrealbubblebb4in(A,1 + B,D,D) True (?,1) 10. evalrealbubblebb5in(A,B,C,D) -> evalrealbubblereturnin(A,B,C,D) [C = 0] (?,1) 11. evalrealbubblebb5in(A,B,C,D) -> evalrealbubblebb6in(A,B,C,D) [0 >= 1 + C] (?,1) 12. evalrealbubblebb5in(A,B,C,D) -> evalrealbubblebb6in(A,B,C,D) [C >= 1] (?,1) 13. evalrealbubblebb6in(A,B,C,D) -> evalrealbubblebb7in(-1 + A,B,C,D) True (?,1) 14. evalrealbubblereturnin(A,B,C,D) -> evalrealbubblestop(A,B,C,D) True (?,1) 15. evalrealbubblereturnin(A,B,C,D) -> exitus616(A,B,C,D) True (?,1) Signature: {(evalrealbubblebb1in,4) ;(evalrealbubblebb2in,4) ;(evalrealbubblebb3in,4) ;(evalrealbubblebb4in,4) ;(evalrealbubblebb5in,4) ;(evalrealbubblebb6in,4) ;(evalrealbubblebb7in,4) ;(evalrealbubbleentryin,4) ;(evalrealbubblereturnin,4) ;(evalrealbubblestart,4) ;(evalrealbubblestop,4) ;(exitus616,4)} Flow Graph: [0->{1},1->{2,3},2->{4},3->{14,15},4->{6,7},5->{10,11,12},6->{8},7->{9},8->{9},9->{4,5},10->{14,15} ,11->{13},12->{13},13->{2,3},14->{},15->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15] | `- p:[2,13,11,5,9,7,4,8,6,12] c: [2] | `- p:[4,9,7,8,6] c: [4] * Step 6: SizeAbstraction WORST_CASE(?,POLY) + Considered Problem: (Rules: 0. evalrealbubblestart(A,B,C,D) -> evalrealbubbleentryin(A,B,C,D) True (1,1) 1. evalrealbubbleentryin(A,B,C,D) -> evalrealbubblebb7in(-1 + A,B,C,D) True (?,1) 2. evalrealbubblebb7in(A,B,C,D) -> evalrealbubblebb4in(A,0,0,D) [A >= 1] (?,1) 3. evalrealbubblebb7in(A,B,C,D) -> evalrealbubblereturnin(A,B,C,D) [0 >= A] (?,1) 4. evalrealbubblebb4in(A,B,C,D) -> evalrealbubblebb1in(A,B,C,D) [A >= 1 + B] (?,1) 5. evalrealbubblebb4in(A,B,C,D) -> evalrealbubblebb5in(A,B,C,D) [B >= A] (?,1) 6. evalrealbubblebb1in(A,B,C,D) -> evalrealbubblebb2in(A,B,C,D) [E >= 1 + F] (?,1) 7. evalrealbubblebb1in(A,B,C,D) -> evalrealbubblebb3in(A,B,C,C) [F >= E] (?,1) 8. evalrealbubblebb2in(A,B,C,D) -> evalrealbubblebb3in(A,B,C,1) True (?,1) 9. evalrealbubblebb3in(A,B,C,D) -> evalrealbubblebb4in(A,1 + B,D,D) True (?,1) 10. evalrealbubblebb5in(A,B,C,D) -> evalrealbubblereturnin(A,B,C,D) [C = 0] (?,1) 11. evalrealbubblebb5in(A,B,C,D) -> evalrealbubblebb6in(A,B,C,D) [0 >= 1 + C] (?,1) 12. evalrealbubblebb5in(A,B,C,D) -> evalrealbubblebb6in(A,B,C,D) [C >= 1] (?,1) 13. evalrealbubblebb6in(A,B,C,D) -> evalrealbubblebb7in(-1 + A,B,C,D) True (?,1) 14. evalrealbubblereturnin(A,B,C,D) -> evalrealbubblestop(A,B,C,D) True (?,1) 15. evalrealbubblereturnin(A,B,C,D) -> exitus616(A,B,C,D) True (?,1) Signature: {(evalrealbubblebb1in,4) ;(evalrealbubblebb2in,4) ;(evalrealbubblebb3in,4) ;(evalrealbubblebb4in,4) ;(evalrealbubblebb5in,4) ;(evalrealbubblebb6in,4) ;(evalrealbubblebb7in,4) ;(evalrealbubbleentryin,4) ;(evalrealbubblereturnin,4) ;(evalrealbubblestart,4) ;(evalrealbubblestop,4) ;(exitus616,4)} Flow Graph: [0->{1},1->{2,3},2->{4},3->{14,15},4->{6,7},5->{10,11,12},6->{8},7->{9},8->{9},9->{4,5},10->{14,15} ,11->{13},12->{13},13->{2,3},14->{},15->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15] | `- p:[2,13,11,5,9,7,4,8,6,12] c: [2] | `- p:[4,9,7,8,6] c: [4]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 7: FlowAbstraction WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [A,B,C,D,0.0,0.0.0] evalrealbubblestart ~> evalrealbubbleentryin [A <= A, B <= B, C <= C, D <= D] evalrealbubbleentryin ~> evalrealbubblebb7in [A <= K + A, B <= B, C <= C, D <= D] evalrealbubblebb7in ~> evalrealbubblebb4in [A <= A, B <= 0*K, C <= 0*K, D <= D] evalrealbubblebb7in ~> evalrealbubblereturnin [A <= A, B <= B, C <= C, D <= D] evalrealbubblebb4in ~> evalrealbubblebb1in [A <= A, B <= B, C <= C, D <= D] evalrealbubblebb4in ~> evalrealbubblebb5in [A <= A, B <= B, C <= C, D <= D] evalrealbubblebb1in ~> evalrealbubblebb2in [A <= A, B <= B, C <= C, D <= D] evalrealbubblebb1in ~> evalrealbubblebb3in [A <= A, B <= B, C <= C, D <= C] evalrealbubblebb2in ~> evalrealbubblebb3in [A <= A, B <= B, C <= C, D <= K] evalrealbubblebb3in ~> evalrealbubblebb4in [A <= A, B <= K + B, C <= D, D <= D] evalrealbubblebb5in ~> evalrealbubblereturnin [A <= A, B <= B, C <= C, D <= D] evalrealbubblebb5in ~> evalrealbubblebb6in [A <= A, B <= B, C <= C, D <= D] evalrealbubblebb5in ~> evalrealbubblebb6in [A <= A, B <= B, C <= C, D <= D] evalrealbubblebb6in ~> evalrealbubblebb7in [A <= K + A, B <= B, C <= C, D <= D] evalrealbubblereturnin ~> evalrealbubblestop [A <= A, B <= B, C <= C, D <= D] evalrealbubblereturnin ~> exitus616 [A <= A, B <= B, C <= C, D <= D] + Loop: [0.0 <= 2*K + A] evalrealbubblebb7in ~> evalrealbubblebb4in [A <= A, B <= 0*K, C <= 0*K, D <= D] evalrealbubblebb6in ~> evalrealbubblebb7in [A <= K + A, B <= B, C <= C, D <= D] evalrealbubblebb5in ~> evalrealbubblebb6in [A <= A, B <= B, C <= C, D <= D] evalrealbubblebb4in ~> evalrealbubblebb5in [A <= A, B <= B, C <= C, D <= D] evalrealbubblebb3in ~> evalrealbubblebb4in [A <= A, B <= K + B, C <= D, D <= D] evalrealbubblebb1in ~> evalrealbubblebb3in [A <= A, B <= B, C <= C, D <= C] evalrealbubblebb4in ~> evalrealbubblebb1in [A <= A, B <= B, C <= C, D <= D] evalrealbubblebb2in ~> evalrealbubblebb3in [A <= A, B <= B, C <= C, D <= K] evalrealbubblebb1in ~> evalrealbubblebb2in [A <= A, B <= B, C <= C, D <= D] evalrealbubblebb5in ~> evalrealbubblebb6in [A <= A, B <= B, C <= C, D <= D] + Loop: [0.0.0 <= 2*K + A + B] evalrealbubblebb4in ~> evalrealbubblebb1in [A <= A, B <= B, C <= C, D <= D] evalrealbubblebb3in ~> evalrealbubblebb4in [A <= A, B <= K + B, C <= D, D <= D] evalrealbubblebb1in ~> evalrealbubblebb3in [A <= A, B <= B, C <= C, D <= C] evalrealbubblebb2in ~> evalrealbubblebb3in [A <= A, B <= B, C <= C, D <= K] evalrealbubblebb1in ~> evalrealbubblebb2in [A <= A, B <= B, C <= C, D <= D] + Applied Processor: FlowAbstraction + Details: () * Step 8: LareProcessor WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,0.0,0.0.0] evalrealbubblestart ~> evalrealbubbleentryin [] evalrealbubbleentryin ~> evalrealbubblebb7in [A ~+> A,K ~+> A] evalrealbubblebb7in ~> evalrealbubblebb4in [K ~=> B,K ~=> C] evalrealbubblebb7in ~> evalrealbubblereturnin [] evalrealbubblebb4in ~> evalrealbubblebb1in [] evalrealbubblebb4in ~> evalrealbubblebb5in [] evalrealbubblebb1in ~> evalrealbubblebb2in [] evalrealbubblebb1in ~> evalrealbubblebb3in [C ~=> D] evalrealbubblebb2in ~> evalrealbubblebb3in [K ~=> D] evalrealbubblebb3in ~> evalrealbubblebb4in [D ~=> C,B ~+> B,K ~+> B] evalrealbubblebb5in ~> evalrealbubblereturnin [] evalrealbubblebb5in ~> evalrealbubblebb6in [] evalrealbubblebb5in ~> evalrealbubblebb6in [] evalrealbubblebb6in ~> evalrealbubblebb7in [A ~+> A,K ~+> A] evalrealbubblereturnin ~> evalrealbubblestop [] evalrealbubblereturnin ~> exitus616 [] + Loop: [A ~+> 0.0,K ~*> 0.0] evalrealbubblebb7in ~> evalrealbubblebb4in [K ~=> B,K ~=> C] evalrealbubblebb6in ~> evalrealbubblebb7in [A ~+> A,K ~+> A] evalrealbubblebb5in ~> evalrealbubblebb6in [] evalrealbubblebb4in ~> evalrealbubblebb5in [] evalrealbubblebb3in ~> evalrealbubblebb4in [D ~=> C,B ~+> B,K ~+> B] evalrealbubblebb1in ~> evalrealbubblebb3in [C ~=> D] evalrealbubblebb4in ~> evalrealbubblebb1in [] evalrealbubblebb2in ~> evalrealbubblebb3in [K ~=> D] evalrealbubblebb1in ~> evalrealbubblebb2in [] evalrealbubblebb5in ~> evalrealbubblebb6in [] + Loop: [A ~+> 0.0.0,B ~+> 0.0.0,K ~*> 0.0.0] evalrealbubblebb4in ~> evalrealbubblebb1in [] evalrealbubblebb3in ~> evalrealbubblebb4in [D ~=> C,B ~+> B,K ~+> B] evalrealbubblebb1in ~> evalrealbubblebb3in [C ~=> D] evalrealbubblebb2in ~> evalrealbubblebb3in [K ~=> D] evalrealbubblebb1in ~> evalrealbubblebb2in [] + Applied Processor: LareProcessor + Details: evalrealbubblestart ~> exitus616 [K ~=> B ,K ~=> C ,K ~=> D ,A ~+> A ,A ~+> 0.0 ,A ~+> 0.0.0 ,A ~+> tick ,tick ~+> tick ,K ~+> A ,K ~+> B ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> A ,A ~*> B ,A ~*> 0.0 ,A ~*> 0.0.0 ,A ~*> tick ,K ~*> A ,K ~*> B ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> tick ,A ~^> B ,K ~^> B] evalrealbubblestart ~> evalrealbubblestop [K ~=> B ,K ~=> C ,K ~=> D ,A ~+> A ,A ~+> 0.0 ,A ~+> 0.0.0 ,A ~+> tick ,tick ~+> tick ,K ~+> A ,K ~+> B ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> A ,A ~*> B ,A ~*> 0.0 ,A ~*> 0.0.0 ,A ~*> tick ,K ~*> A ,K ~*> B ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> tick ,A ~^> B ,K ~^> B] + evalrealbubblebb7in> [K ~=> B ,K ~=> C ,K ~=> D ,A ~+> A ,A ~+> 0.0 ,A ~+> 0.0.0 ,A ~+> tick ,tick ~+> tick ,K ~+> A ,K ~+> B ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> A ,A ~*> B ,A ~*> 0.0.0 ,A ~*> tick ,K ~*> A ,K ~*> B ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> tick ,A ~^> B ,K ~^> B] evalrealbubblebb5in> [K ~=> B ,K ~=> C ,K ~=> D ,A ~+> A ,A ~+> 0.0 ,A ~+> 0.0.0 ,A ~+> tick ,tick ~+> tick ,K ~+> A ,K ~+> B ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> A ,A ~*> B ,A ~*> 0.0.0 ,A ~*> tick ,K ~*> A ,K ~*> B ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> tick ,A ~^> B ,K ~^> B] + evalrealbubblebb4in> [C ~=> D ,K ~=> C ,K ~=> D ,A ~+> 0.0.0 ,A ~+> tick ,B ~+> B ,B ~+> 0.0.0 ,B ~+> tick ,tick ~+> tick ,K ~+> B ,A ~*> B ,B ~*> B ,K ~*> B ,K ~*> 0.0.0 ,K ~*> tick] YES(?,POLY)