YES(?,POLY) * Step 1: TrivialSCCs WORST_CASE(?,POLY) + Considered Problem: Rules: 0. eval_start_start(v__0,v_flag_0,v_n) -> eval_start_bb0_in(v__0,v_flag_0,v_n) True (1,1) 1. eval_start_bb0_in(v__0,v_flag_0,v_n) -> eval_start_0(v__0,v_flag_0,v_n) True (?,1) 2. eval_start_0(v__0,v_flag_0,v_n) -> eval_start_1(v__0,v_flag_0,v_n) True (?,1) 3. eval_start_1(v__0,v_flag_0,v_n) -> eval_start_2(v__0,v_flag_0,v_n) True (?,1) 4. eval_start_2(v__0,v_flag_0,v_n) -> eval_start_3(v__0,v_flag_0,v_n) True (?,1) 5. eval_start_3(v__0,v_flag_0,v_n) -> eval_start_4(v__0,v_flag_0,v_n) True (?,1) 6. eval_start_4(v__0,v_flag_0,v_n) -> eval_start_5(v__0,v_flag_0,v_n) True (?,1) 7. eval_start_5(v__0,v_flag_0,v_n) -> eval_start_bb1_in(v_n,1,v_n) True (?,1) 8. eval_start_bb1_in(v__0,v_flag_0,v_n) -> eval_start_bb2_in(v__0,v_flag_0,v_n) [-1 + v_flag_0 >= 0] (?,1) 9. eval_start_bb1_in(v__0,v_flag_0,v_n) -> eval_start_bb3_in(v__0,v_flag_0,v_n) [0 >= v_flag_0] (?,1) 10. eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(-1 + v__0,1,v_n) [-1 + v__0 >= 0 && -1 + v__0 >= 0] (?,1) 11. eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(v__0,1,v_n) [-1 + v__0 >= 0 && 0 >= v__0] (?,1) 12. eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(-1 + v__0,0,v_n) [0 >= v__0 && -1 + v__0 >= 0] (?,1) 13. eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(v__0,0,v_n) [0 >= v__0 && 0 >= v__0] (?,1) 14. eval_start_bb3_in(v__0,v_flag_0,v_n) -> eval_start_stop(v__0,v_flag_0,v_n) True (?,1) Signature: {(eval_start_0,3) ;(eval_start_1,3) ;(eval_start_2,3) ;(eval_start_3,3) ;(eval_start_4,3) ;(eval_start_5,3) ;(eval_start_bb0_in,3) ;(eval_start_bb1_in,3) ;(eval_start_bb2_in,3) ;(eval_start_bb3_in,3) ;(eval_start_start,3) ;(eval_start_stop,3)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7},7->{8,9},8->{10,11,12,13},9->{14},10->{8,9},11->{8,9} ,12->{8,9},13->{8,9},14->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatRules WORST_CASE(?,POLY) + Considered Problem: Rules: 0. eval_start_start(v__0,v_flag_0,v_n) -> eval_start_bb0_in(v__0,v_flag_0,v_n) True (1,1) 1. eval_start_bb0_in(v__0,v_flag_0,v_n) -> eval_start_0(v__0,v_flag_0,v_n) True (1,1) 2. eval_start_0(v__0,v_flag_0,v_n) -> eval_start_1(v__0,v_flag_0,v_n) True (1,1) 3. eval_start_1(v__0,v_flag_0,v_n) -> eval_start_2(v__0,v_flag_0,v_n) True (1,1) 4. eval_start_2(v__0,v_flag_0,v_n) -> eval_start_3(v__0,v_flag_0,v_n) True (1,1) 5. eval_start_3(v__0,v_flag_0,v_n) -> eval_start_4(v__0,v_flag_0,v_n) True (1,1) 6. eval_start_4(v__0,v_flag_0,v_n) -> eval_start_5(v__0,v_flag_0,v_n) True (1,1) 7. eval_start_5(v__0,v_flag_0,v_n) -> eval_start_bb1_in(v_n,1,v_n) True (1,1) 8. eval_start_bb1_in(v__0,v_flag_0,v_n) -> eval_start_bb2_in(v__0,v_flag_0,v_n) [-1 + v_flag_0 >= 0] (?,1) 9. eval_start_bb1_in(v__0,v_flag_0,v_n) -> eval_start_bb3_in(v__0,v_flag_0,v_n) [0 >= v_flag_0] (1,1) 10. eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(-1 + v__0,1,v_n) [-1 + v__0 >= 0 && -1 + v__0 >= 0] (?,1) 11. eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(v__0,1,v_n) [-1 + v__0 >= 0 && 0 >= v__0] (?,1) 12. eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(-1 + v__0,0,v_n) [0 >= v__0 && -1 + v__0 >= 0] (?,1) 13. eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(v__0,0,v_n) [0 >= v__0 && 0 >= v__0] (?,1) 14. eval_start_bb3_in(v__0,v_flag_0,v_n) -> eval_start_stop(v__0,v_flag_0,v_n) True (1,1) Signature: {(eval_start_0,3) ;(eval_start_1,3) ;(eval_start_2,3) ;(eval_start_3,3) ;(eval_start_4,3) ;(eval_start_5,3) ;(eval_start_bb0_in,3) ;(eval_start_bb1_in,3) ;(eval_start_bb2_in,3) ;(eval_start_bb3_in,3) ;(eval_start_start,3) ;(eval_start_stop,3)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7},7->{8,9},8->{10,11,12,13},9->{14},10->{8,9},11->{8,9} ,12->{8,9},13->{8,9},14->{}] + Applied Processor: UnsatRules + Details: Following transitions have unsatisfiable constraints and are removed: [11,12] * Step 3: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. eval_start_start(v__0,v_flag_0,v_n) -> eval_start_bb0_in(v__0,v_flag_0,v_n) True (1,1) 1. eval_start_bb0_in(v__0,v_flag_0,v_n) -> eval_start_0(v__0,v_flag_0,v_n) True (1,1) 2. eval_start_0(v__0,v_flag_0,v_n) -> eval_start_1(v__0,v_flag_0,v_n) True (1,1) 3. eval_start_1(v__0,v_flag_0,v_n) -> eval_start_2(v__0,v_flag_0,v_n) True (1,1) 4. eval_start_2(v__0,v_flag_0,v_n) -> eval_start_3(v__0,v_flag_0,v_n) True (1,1) 5. eval_start_3(v__0,v_flag_0,v_n) -> eval_start_4(v__0,v_flag_0,v_n) True (1,1) 6. eval_start_4(v__0,v_flag_0,v_n) -> eval_start_5(v__0,v_flag_0,v_n) True (1,1) 7. eval_start_5(v__0,v_flag_0,v_n) -> eval_start_bb1_in(v_n,1,v_n) True (1,1) 8. eval_start_bb1_in(v__0,v_flag_0,v_n) -> eval_start_bb2_in(v__0,v_flag_0,v_n) [-1 + v_flag_0 >= 0] (?,1) 9. eval_start_bb1_in(v__0,v_flag_0,v_n) -> eval_start_bb3_in(v__0,v_flag_0,v_n) [0 >= v_flag_0] (1,1) 10. eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(-1 + v__0,1,v_n) [-1 + v__0 >= 0 && -1 + v__0 >= 0] (?,1) 13. eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(v__0,0,v_n) [0 >= v__0 && 0 >= v__0] (?,1) 14. eval_start_bb3_in(v__0,v_flag_0,v_n) -> eval_start_stop(v__0,v_flag_0,v_n) True (1,1) Signature: {(eval_start_0,3) ;(eval_start_1,3) ;(eval_start_2,3) ;(eval_start_3,3) ;(eval_start_4,3) ;(eval_start_5,3) ;(eval_start_bb0_in,3) ;(eval_start_bb1_in,3) ;(eval_start_bb2_in,3) ;(eval_start_bb3_in,3) ;(eval_start_start,3) ;(eval_start_stop,3)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7},7->{8,9},8->{10,13},9->{14},10->{8,9},13->{8,9},14->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(7,9),(10,9),(13,8)] * Step 4: AddSinks WORST_CASE(?,POLY) + Considered Problem: Rules: 0. eval_start_start(v__0,v_flag_0,v_n) -> eval_start_bb0_in(v__0,v_flag_0,v_n) True (1,1) 1. eval_start_bb0_in(v__0,v_flag_0,v_n) -> eval_start_0(v__0,v_flag_0,v_n) True (1,1) 2. eval_start_0(v__0,v_flag_0,v_n) -> eval_start_1(v__0,v_flag_0,v_n) True (1,1) 3. eval_start_1(v__0,v_flag_0,v_n) -> eval_start_2(v__0,v_flag_0,v_n) True (1,1) 4. eval_start_2(v__0,v_flag_0,v_n) -> eval_start_3(v__0,v_flag_0,v_n) True (1,1) 5. eval_start_3(v__0,v_flag_0,v_n) -> eval_start_4(v__0,v_flag_0,v_n) True (1,1) 6. eval_start_4(v__0,v_flag_0,v_n) -> eval_start_5(v__0,v_flag_0,v_n) True (1,1) 7. eval_start_5(v__0,v_flag_0,v_n) -> eval_start_bb1_in(v_n,1,v_n) True (1,1) 8. eval_start_bb1_in(v__0,v_flag_0,v_n) -> eval_start_bb2_in(v__0,v_flag_0,v_n) [-1 + v_flag_0 >= 0] (?,1) 9. eval_start_bb1_in(v__0,v_flag_0,v_n) -> eval_start_bb3_in(v__0,v_flag_0,v_n) [0 >= v_flag_0] (1,1) 10. eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(-1 + v__0,1,v_n) [-1 + v__0 >= 0 && -1 + v__0 >= 0] (?,1) 13. eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(v__0,0,v_n) [0 >= v__0 && 0 >= v__0] (?,1) 14. eval_start_bb3_in(v__0,v_flag_0,v_n) -> eval_start_stop(v__0,v_flag_0,v_n) True (1,1) Signature: {(eval_start_0,3) ;(eval_start_1,3) ;(eval_start_2,3) ;(eval_start_3,3) ;(eval_start_4,3) ;(eval_start_5,3) ;(eval_start_bb0_in,3) ;(eval_start_bb1_in,3) ;(eval_start_bb2_in,3) ;(eval_start_bb3_in,3) ;(eval_start_start,3) ;(eval_start_stop,3)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7},7->{8},8->{10,13},9->{14},10->{8},13->{9},14->{}] + Applied Processor: AddSinks + Details: () * Step 5: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. eval_start_start(v__0,v_flag_0,v_n) -> eval_start_bb0_in(v__0,v_flag_0,v_n) True (1,1) 1. eval_start_bb0_in(v__0,v_flag_0,v_n) -> eval_start_0(v__0,v_flag_0,v_n) True (?,1) 2. eval_start_0(v__0,v_flag_0,v_n) -> eval_start_1(v__0,v_flag_0,v_n) True (?,1) 3. eval_start_1(v__0,v_flag_0,v_n) -> eval_start_2(v__0,v_flag_0,v_n) True (?,1) 4. eval_start_2(v__0,v_flag_0,v_n) -> eval_start_3(v__0,v_flag_0,v_n) True (?,1) 5. eval_start_3(v__0,v_flag_0,v_n) -> eval_start_4(v__0,v_flag_0,v_n) True (?,1) 6. eval_start_4(v__0,v_flag_0,v_n) -> eval_start_5(v__0,v_flag_0,v_n) True (?,1) 7. eval_start_5(v__0,v_flag_0,v_n) -> eval_start_bb1_in(v_n,1,v_n) True (?,1) 8. eval_start_bb1_in(v__0,v_flag_0,v_n) -> eval_start_bb2_in(v__0,v_flag_0,v_n) [-1 + v_flag_0 >= 0] (?,1) 9. eval_start_bb1_in(v__0,v_flag_0,v_n) -> eval_start_bb3_in(v__0,v_flag_0,v_n) [0 >= v_flag_0] (?,1) 10. eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(-1 + v__0,1,v_n) [-1 + v__0 >= 0 && -1 + v__0 >= 0] (?,1) 13. eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(v__0,0,v_n) [0 >= v__0 && 0 >= v__0] (?,1) 14. eval_start_bb3_in(v__0,v_flag_0,v_n) -> eval_start_stop(v__0,v_flag_0,v_n) True (?,1) 15. eval_start_bb3_in(v__0,v_flag_0,v_n) -> exitus616(v__0,v_flag_0,v_n) True (?,1) Signature: {(eval_start_0,3) ;(eval_start_1,3) ;(eval_start_2,3) ;(eval_start_3,3) ;(eval_start_4,3) ;(eval_start_5,3) ;(eval_start_bb0_in,3) ;(eval_start_bb1_in,3) ;(eval_start_bb2_in,3) ;(eval_start_bb3_in,3) ;(eval_start_start,3) ;(eval_start_stop,3) ;(exitus616,3)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7},7->{8,9},8->{10,13},9->{14,15},10->{8,9},13->{8,9} ,14->{},15->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(7,9),(10,9),(13,8)] * Step 6: LooptreeTransformer WORST_CASE(?,POLY) + Considered Problem: Rules: 0. eval_start_start(v__0,v_flag_0,v_n) -> eval_start_bb0_in(v__0,v_flag_0,v_n) True (1,1) 1. eval_start_bb0_in(v__0,v_flag_0,v_n) -> eval_start_0(v__0,v_flag_0,v_n) True (?,1) 2. eval_start_0(v__0,v_flag_0,v_n) -> eval_start_1(v__0,v_flag_0,v_n) True (?,1) 3. eval_start_1(v__0,v_flag_0,v_n) -> eval_start_2(v__0,v_flag_0,v_n) True (?,1) 4. eval_start_2(v__0,v_flag_0,v_n) -> eval_start_3(v__0,v_flag_0,v_n) True (?,1) 5. eval_start_3(v__0,v_flag_0,v_n) -> eval_start_4(v__0,v_flag_0,v_n) True (?,1) 6. eval_start_4(v__0,v_flag_0,v_n) -> eval_start_5(v__0,v_flag_0,v_n) True (?,1) 7. eval_start_5(v__0,v_flag_0,v_n) -> eval_start_bb1_in(v_n,1,v_n) True (?,1) 8. eval_start_bb1_in(v__0,v_flag_0,v_n) -> eval_start_bb2_in(v__0,v_flag_0,v_n) [-1 + v_flag_0 >= 0] (?,1) 9. eval_start_bb1_in(v__0,v_flag_0,v_n) -> eval_start_bb3_in(v__0,v_flag_0,v_n) [0 >= v_flag_0] (?,1) 10. eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(-1 + v__0,1,v_n) [-1 + v__0 >= 0 && -1 + v__0 >= 0] (?,1) 13. eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(v__0,0,v_n) [0 >= v__0 && 0 >= v__0] (?,1) 14. eval_start_bb3_in(v__0,v_flag_0,v_n) -> eval_start_stop(v__0,v_flag_0,v_n) True (?,1) 15. eval_start_bb3_in(v__0,v_flag_0,v_n) -> exitus616(v__0,v_flag_0,v_n) True (?,1) Signature: {(eval_start_0,3) ;(eval_start_1,3) ;(eval_start_2,3) ;(eval_start_3,3) ;(eval_start_4,3) ;(eval_start_5,3) ;(eval_start_bb0_in,3) ;(eval_start_bb1_in,3) ;(eval_start_bb2_in,3) ;(eval_start_bb3_in,3) ;(eval_start_start,3) ;(eval_start_stop,3) ;(exitus616,3)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7},7->{8},8->{10,13},9->{14,15},10->{8},13->{9},14->{} ,15->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,13,14,15] | `- p:[8,10] c: [10] * Step 7: SizeAbstraction WORST_CASE(?,POLY) + Considered Problem: (Rules: 0. eval_start_start(v__0,v_flag_0,v_n) -> eval_start_bb0_in(v__0,v_flag_0,v_n) True (1,1) 1. eval_start_bb0_in(v__0,v_flag_0,v_n) -> eval_start_0(v__0,v_flag_0,v_n) True (?,1) 2. eval_start_0(v__0,v_flag_0,v_n) -> eval_start_1(v__0,v_flag_0,v_n) True (?,1) 3. eval_start_1(v__0,v_flag_0,v_n) -> eval_start_2(v__0,v_flag_0,v_n) True (?,1) 4. eval_start_2(v__0,v_flag_0,v_n) -> eval_start_3(v__0,v_flag_0,v_n) True (?,1) 5. eval_start_3(v__0,v_flag_0,v_n) -> eval_start_4(v__0,v_flag_0,v_n) True (?,1) 6. eval_start_4(v__0,v_flag_0,v_n) -> eval_start_5(v__0,v_flag_0,v_n) True (?,1) 7. eval_start_5(v__0,v_flag_0,v_n) -> eval_start_bb1_in(v_n,1,v_n) True (?,1) 8. eval_start_bb1_in(v__0,v_flag_0,v_n) -> eval_start_bb2_in(v__0,v_flag_0,v_n) [-1 + v_flag_0 >= 0] (?,1) 9. eval_start_bb1_in(v__0,v_flag_0,v_n) -> eval_start_bb3_in(v__0,v_flag_0,v_n) [0 >= v_flag_0] (?,1) 10. eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(-1 + v__0,1,v_n) [-1 + v__0 >= 0 && -1 + v__0 >= 0] (?,1) 13. eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(v__0,0,v_n) [0 >= v__0 && 0 >= v__0] (?,1) 14. eval_start_bb3_in(v__0,v_flag_0,v_n) -> eval_start_stop(v__0,v_flag_0,v_n) True (?,1) 15. eval_start_bb3_in(v__0,v_flag_0,v_n) -> exitus616(v__0,v_flag_0,v_n) True (?,1) Signature: {(eval_start_0,3) ;(eval_start_1,3) ;(eval_start_2,3) ;(eval_start_3,3) ;(eval_start_4,3) ;(eval_start_5,3) ;(eval_start_bb0_in,3) ;(eval_start_bb1_in,3) ;(eval_start_bb2_in,3) ;(eval_start_bb3_in,3) ;(eval_start_start,3) ;(eval_start_stop,3) ;(exitus616,3)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7},7->{8},8->{10,13},9->{14,15},10->{8},13->{9},14->{} ,15->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,13,14,15] | `- p:[8,10] c: [10]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 8: FlowAbstraction WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [v__0,v_flag_0,v_n,0.0] eval_start_start ~> eval_start_bb0_in [v__0 <= v__0, v_flag_0 <= v_flag_0, v_n <= v_n] eval_start_bb0_in ~> eval_start_0 [v__0 <= v__0, v_flag_0 <= v_flag_0, v_n <= v_n] eval_start_0 ~> eval_start_1 [v__0 <= v__0, v_flag_0 <= v_flag_0, v_n <= v_n] eval_start_1 ~> eval_start_2 [v__0 <= v__0, v_flag_0 <= v_flag_0, v_n <= v_n] eval_start_2 ~> eval_start_3 [v__0 <= v__0, v_flag_0 <= v_flag_0, v_n <= v_n] eval_start_3 ~> eval_start_4 [v__0 <= v__0, v_flag_0 <= v_flag_0, v_n <= v_n] eval_start_4 ~> eval_start_5 [v__0 <= v__0, v_flag_0 <= v_flag_0, v_n <= v_n] eval_start_5 ~> eval_start_bb1_in [v__0 <= v_n, v_flag_0 <= K, v_n <= v_n] eval_start_bb1_in ~> eval_start_bb2_in [v__0 <= v__0, v_flag_0 <= v_flag_0, v_n <= v_n] eval_start_bb1_in ~> eval_start_bb3_in [v__0 <= v__0, v_flag_0 <= v_flag_0, v_n <= v_n] eval_start_bb2_in ~> eval_start_bb1_in [v__0 <= v__0, v_flag_0 <= K, v_n <= v_n] eval_start_bb2_in ~> eval_start_bb1_in [v__0 <= v__0, v_flag_0 <= 0*K, v_n <= v_n] eval_start_bb3_in ~> eval_start_stop [v__0 <= v__0, v_flag_0 <= v_flag_0, v_n <= v_n] eval_start_bb3_in ~> exitus616 [v__0 <= v__0, v_flag_0 <= v_flag_0, v_n <= v_n] + Loop: [0.0 <= v__0] eval_start_bb1_in ~> eval_start_bb2_in [v__0 <= v__0, v_flag_0 <= v_flag_0, v_n <= v_n] eval_start_bb2_in ~> eval_start_bb1_in [v__0 <= v__0, v_flag_0 <= K, v_n <= v_n] + Applied Processor: FlowAbstraction + Details: () * Step 9: LareProcessor WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,v__0,v_flag_0,v_n,0.0] eval_start_start ~> eval_start_bb0_in [] eval_start_bb0_in ~> eval_start_0 [] eval_start_0 ~> eval_start_1 [] eval_start_1 ~> eval_start_2 [] eval_start_2 ~> eval_start_3 [] eval_start_3 ~> eval_start_4 [] eval_start_4 ~> eval_start_5 [] eval_start_5 ~> eval_start_bb1_in [v_n ~=> v__0,K ~=> v_flag_0] eval_start_bb1_in ~> eval_start_bb2_in [] eval_start_bb1_in ~> eval_start_bb3_in [] eval_start_bb2_in ~> eval_start_bb1_in [K ~=> v_flag_0] eval_start_bb2_in ~> eval_start_bb1_in [K ~=> v_flag_0] eval_start_bb3_in ~> eval_start_stop [] eval_start_bb3_in ~> exitus616 [] + Loop: [v__0 ~=> 0.0] eval_start_bb1_in ~> eval_start_bb2_in [] eval_start_bb2_in ~> eval_start_bb1_in [K ~=> v_flag_0] + Applied Processor: LareProcessor + Details: eval_start_start ~> eval_start_bb2_in [v_n ~=> v__0 ,v_n ~=> 0.0 ,K ~=> v_flag_0 ,v_n ~+> tick ,tick ~+> tick ,v_n ~*> tick] eval_start_start ~> eval_start_stop [v_n ~=> v__0 ,v_n ~=> 0.0 ,K ~=> v_flag_0 ,v_n ~+> tick ,tick ~+> tick] eval_start_start ~> exitus616 [v_n ~=> v__0 ,v_n ~=> 0.0 ,K ~=> v_flag_0 ,v_n ~+> tick ,tick ~+> tick] + eval_start_bb2_in> [v__0 ~=> 0.0,K ~=> v_flag_0,v__0 ~+> tick,tick ~+> tick] eval_start_bb1_in> [v__0 ~=> 0.0,K ~=> v_flag_0,v__0 ~+> tick,tick ~+> tick] YES(?,POLY)