YES(?,POLY) * Step 1: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. eval_start_start(v_n,v_x_0,v_y_0) -> eval_start_bb0_in(v_n,v_x_0,v_y_0) True (1,1) 1. eval_start_bb0_in(v_n,v_x_0,v_y_0) -> eval_start_0(v_n,v_x_0,v_y_0) True (?,1) 2. eval_start_0(v_n,v_x_0,v_y_0) -> eval_start_1(v_n,v_x_0,v_y_0) True (?,1) 3. eval_start_1(v_n,v_x_0,v_y_0) -> eval_start_2(v_n,v_x_0,v_y_0) True (?,1) 4. eval_start_2(v_n,v_x_0,v_y_0) -> eval_start_3(v_n,v_x_0,v_y_0) True (?,1) 5. eval_start_3(v_n,v_x_0,v_y_0) -> eval_start_4(v_n,v_x_0,v_y_0) True (?,1) 6. eval_start_4(v_n,v_x_0,v_y_0) -> eval_start_5(v_n,v_x_0,v_y_0) True (?,1) 7. eval_start_5(v_n,v_x_0,v_y_0) -> eval_start_6(v_n,v_x_0,v_y_0) True (?,1) 8. eval_start_6(v_n,v_x_0,v_y_0) -> eval_start_bb1_in(v_n,0,0) True (?,1) 9. eval_start_bb1_in(v_n,v_x_0,v_y_0) -> eval_start_bb2_in(v_n,v_x_0,v_y_0) [v_x_0 + -1*v_y_0 >= 0 && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && v_x_0 >= 0 && -1 + v_n >= v_x_0] (?,1) 10. eval_start_bb1_in(v_n,v_x_0,v_y_0) -> eval_start_bb3_in(v_n,v_x_0,v_y_0) [v_x_0 + -1*v_y_0 >= 0 && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && v_x_0 >= 0 && v_x_0 >= v_n] (?,1) 11. eval_start_bb2_in(v_n,v_x_0,v_y_0) -> eval_start_bb1_in(v_n,1 + v_x_0,1 + v_y_0) [v_x_0 + -1*v_y_0 >= 0 (?,1) && -1 + v_n + -1*v_y_0 >= 0 && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && -1 + v_n + v_y_0 >= 0 && -1 + v_n + -1*v_x_0 >= 0 && v_x_0 >= 0 && -1 + v_n + v_x_0 >= 0 && -1 + v_n >= 0] 12. eval_start_bb3_in(v_n,v_x_0,v_y_0) -> eval_start_bb4_in(v_n,v_x_0,v_y_0) [v_x_0 + -1*v_y_0 >= 0 (?,1) && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && v_x_0 >= 0 && -1*v_n + v_x_0 >= 0 && -1 + v_y_0 >= 0] 13. eval_start_bb3_in(v_n,v_x_0,v_y_0) -> eval_start_bb5_in(v_n,v_x_0,v_y_0) [v_x_0 + -1*v_y_0 >= 0 (?,1) && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && v_x_0 >= 0 && -1*v_n + v_x_0 >= 0 && 0 >= v_y_0] 14. eval_start_bb4_in(v_n,v_x_0,v_y_0) -> eval_start_bb1_in(v_n,v_x_0,-1 + v_y_0) [v_x_0 + -1*v_y_0 >= 0 (?,1) && -1 + v_y_0 >= 0 && -2 + v_x_0 + v_y_0 >= 0 && -1 + v_x_0 >= 0 && -1*v_n + v_x_0 >= 0] 15. eval_start_bb5_in(v_n,v_x_0,v_y_0) -> eval_start_stop(v_n,v_x_0,v_y_0) [-1*v_y_0 >= 0 (?,1) && v_x_0 + -1*v_y_0 >= 0 && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && v_x_0 >= 0 && -1*v_n + v_x_0 >= 0] 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_6,3) ;(eval_start_bb0_in,3) ;(eval_start_bb1_in,3) ;(eval_start_bb2_in,3) ;(eval_start_bb3_in,3) ;(eval_start_bb4_in,3) ;(eval_start_bb5_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->{9,10},9->{11},10->{12,13},11->{9,10},12->{14} ,13->{15},14->{9,10},15->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(14,9)] * Step 2: FromIts WORST_CASE(?,POLY) + Considered Problem: Rules: 0. eval_start_start(v_n,v_x_0,v_y_0) -> eval_start_bb0_in(v_n,v_x_0,v_y_0) True (1,1) 1. eval_start_bb0_in(v_n,v_x_0,v_y_0) -> eval_start_0(v_n,v_x_0,v_y_0) True (?,1) 2. eval_start_0(v_n,v_x_0,v_y_0) -> eval_start_1(v_n,v_x_0,v_y_0) True (?,1) 3. eval_start_1(v_n,v_x_0,v_y_0) -> eval_start_2(v_n,v_x_0,v_y_0) True (?,1) 4. eval_start_2(v_n,v_x_0,v_y_0) -> eval_start_3(v_n,v_x_0,v_y_0) True (?,1) 5. eval_start_3(v_n,v_x_0,v_y_0) -> eval_start_4(v_n,v_x_0,v_y_0) True (?,1) 6. eval_start_4(v_n,v_x_0,v_y_0) -> eval_start_5(v_n,v_x_0,v_y_0) True (?,1) 7. eval_start_5(v_n,v_x_0,v_y_0) -> eval_start_6(v_n,v_x_0,v_y_0) True (?,1) 8. eval_start_6(v_n,v_x_0,v_y_0) -> eval_start_bb1_in(v_n,0,0) True (?,1) 9. eval_start_bb1_in(v_n,v_x_0,v_y_0) -> eval_start_bb2_in(v_n,v_x_0,v_y_0) [v_x_0 + -1*v_y_0 >= 0 && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && v_x_0 >= 0 && -1 + v_n >= v_x_0] (?,1) 10. eval_start_bb1_in(v_n,v_x_0,v_y_0) -> eval_start_bb3_in(v_n,v_x_0,v_y_0) [v_x_0 + -1*v_y_0 >= 0 && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && v_x_0 >= 0 && v_x_0 >= v_n] (?,1) 11. eval_start_bb2_in(v_n,v_x_0,v_y_0) -> eval_start_bb1_in(v_n,1 + v_x_0,1 + v_y_0) [v_x_0 + -1*v_y_0 >= 0 (?,1) && -1 + v_n + -1*v_y_0 >= 0 && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && -1 + v_n + v_y_0 >= 0 && -1 + v_n + -1*v_x_0 >= 0 && v_x_0 >= 0 && -1 + v_n + v_x_0 >= 0 && -1 + v_n >= 0] 12. eval_start_bb3_in(v_n,v_x_0,v_y_0) -> eval_start_bb4_in(v_n,v_x_0,v_y_0) [v_x_0 + -1*v_y_0 >= 0 (?,1) && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && v_x_0 >= 0 && -1*v_n + v_x_0 >= 0 && -1 + v_y_0 >= 0] 13. eval_start_bb3_in(v_n,v_x_0,v_y_0) -> eval_start_bb5_in(v_n,v_x_0,v_y_0) [v_x_0 + -1*v_y_0 >= 0 (?,1) && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && v_x_0 >= 0 && -1*v_n + v_x_0 >= 0 && 0 >= v_y_0] 14. eval_start_bb4_in(v_n,v_x_0,v_y_0) -> eval_start_bb1_in(v_n,v_x_0,-1 + v_y_0) [v_x_0 + -1*v_y_0 >= 0 (?,1) && -1 + v_y_0 >= 0 && -2 + v_x_0 + v_y_0 >= 0 && -1 + v_x_0 >= 0 && -1*v_n + v_x_0 >= 0] 15. eval_start_bb5_in(v_n,v_x_0,v_y_0) -> eval_start_stop(v_n,v_x_0,v_y_0) [-1*v_y_0 >= 0 (?,1) && v_x_0 + -1*v_y_0 >= 0 && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && v_x_0 >= 0 && -1*v_n + v_x_0 >= 0] 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_6,3) ;(eval_start_bb0_in,3) ;(eval_start_bb1_in,3) ;(eval_start_bb2_in,3) ;(eval_start_bb3_in,3) ;(eval_start_bb4_in,3) ;(eval_start_bb5_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->{9,10},9->{11},10->{12,13},11->{9,10},12->{14} ,13->{15},14->{10},15->{}] + Applied Processor: FromIts + Details: () * Step 3: AddSinks WORST_CASE(?,POLY) + Considered Problem: Rules: eval_start_start(v_n,v_x_0,v_y_0) -> eval_start_bb0_in(v_n,v_x_0,v_y_0) True eval_start_bb0_in(v_n,v_x_0,v_y_0) -> eval_start_0(v_n,v_x_0,v_y_0) True eval_start_0(v_n,v_x_0,v_y_0) -> eval_start_1(v_n,v_x_0,v_y_0) True eval_start_1(v_n,v_x_0,v_y_0) -> eval_start_2(v_n,v_x_0,v_y_0) True eval_start_2(v_n,v_x_0,v_y_0) -> eval_start_3(v_n,v_x_0,v_y_0) True eval_start_3(v_n,v_x_0,v_y_0) -> eval_start_4(v_n,v_x_0,v_y_0) True eval_start_4(v_n,v_x_0,v_y_0) -> eval_start_5(v_n,v_x_0,v_y_0) True eval_start_5(v_n,v_x_0,v_y_0) -> eval_start_6(v_n,v_x_0,v_y_0) True eval_start_6(v_n,v_x_0,v_y_0) -> eval_start_bb1_in(v_n,0,0) True eval_start_bb1_in(v_n,v_x_0,v_y_0) -> eval_start_bb2_in(v_n,v_x_0,v_y_0) [v_x_0 + -1*v_y_0 >= 0 && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && v_x_0 >= 0 && -1 + v_n >= v_x_0] eval_start_bb1_in(v_n,v_x_0,v_y_0) -> eval_start_bb3_in(v_n,v_x_0,v_y_0) [v_x_0 + -1*v_y_0 >= 0 && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && v_x_0 >= 0 && v_x_0 >= v_n] eval_start_bb2_in(v_n,v_x_0,v_y_0) -> eval_start_bb1_in(v_n,1 + v_x_0,1 + v_y_0) [v_x_0 + -1*v_y_0 >= 0 && -1 + v_n + -1*v_y_0 >= 0 && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && -1 + v_n + v_y_0 >= 0 && -1 + v_n + -1*v_x_0 >= 0 && v_x_0 >= 0 && -1 + v_n + v_x_0 >= 0 && -1 + v_n >= 0] eval_start_bb3_in(v_n,v_x_0,v_y_0) -> eval_start_bb4_in(v_n,v_x_0,v_y_0) [v_x_0 + -1*v_y_0 >= 0 && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && v_x_0 >= 0 && -1*v_n + v_x_0 >= 0 && -1 + v_y_0 >= 0] eval_start_bb3_in(v_n,v_x_0,v_y_0) -> eval_start_bb5_in(v_n,v_x_0,v_y_0) [v_x_0 + -1*v_y_0 >= 0 && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && v_x_0 >= 0 && -1*v_n + v_x_0 >= 0 && 0 >= v_y_0] eval_start_bb4_in(v_n,v_x_0,v_y_0) -> eval_start_bb1_in(v_n,v_x_0,-1 + v_y_0) [v_x_0 + -1*v_y_0 >= 0 && -1 + v_y_0 >= 0 && -2 + v_x_0 + v_y_0 >= 0 && -1 + v_x_0 >= 0 && -1*v_n + v_x_0 >= 0] eval_start_bb5_in(v_n,v_x_0,v_y_0) -> eval_start_stop(v_n,v_x_0,v_y_0) [-1*v_y_0 >= 0 && v_x_0 + -1*v_y_0 >= 0 && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && v_x_0 >= 0 && -1*v_n + v_x_0 >= 0] 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_6,3) ;(eval_start_bb0_in,3) ;(eval_start_bb1_in,3) ;(eval_start_bb2_in,3) ;(eval_start_bb3_in,3) ;(eval_start_bb4_in,3) ;(eval_start_bb5_in,3) ;(eval_start_start,3) ;(eval_start_stop,3)} Rule Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7},7->{8},8->{9,10},9->{11},10->{12,13},11->{9,10},12->{14} ,13->{15},14->{10},15->{}] + Applied Processor: AddSinks + Details: () * Step 4: Decompose WORST_CASE(?,POLY) + Considered Problem: Rules: eval_start_start(v_n,v_x_0,v_y_0) -> eval_start_bb0_in(v_n,v_x_0,v_y_0) True eval_start_bb0_in(v_n,v_x_0,v_y_0) -> eval_start_0(v_n,v_x_0,v_y_0) True eval_start_0(v_n,v_x_0,v_y_0) -> eval_start_1(v_n,v_x_0,v_y_0) True eval_start_1(v_n,v_x_0,v_y_0) -> eval_start_2(v_n,v_x_0,v_y_0) True eval_start_2(v_n,v_x_0,v_y_0) -> eval_start_3(v_n,v_x_0,v_y_0) True eval_start_3(v_n,v_x_0,v_y_0) -> eval_start_4(v_n,v_x_0,v_y_0) True eval_start_4(v_n,v_x_0,v_y_0) -> eval_start_5(v_n,v_x_0,v_y_0) True eval_start_5(v_n,v_x_0,v_y_0) -> eval_start_6(v_n,v_x_0,v_y_0) True eval_start_6(v_n,v_x_0,v_y_0) -> eval_start_bb1_in(v_n,0,0) True eval_start_bb1_in(v_n,v_x_0,v_y_0) -> eval_start_bb2_in(v_n,v_x_0,v_y_0) [v_x_0 + -1*v_y_0 >= 0 && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && v_x_0 >= 0 && -1 + v_n >= v_x_0] eval_start_bb1_in(v_n,v_x_0,v_y_0) -> eval_start_bb3_in(v_n,v_x_0,v_y_0) [v_x_0 + -1*v_y_0 >= 0 && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && v_x_0 >= 0 && v_x_0 >= v_n] eval_start_bb2_in(v_n,v_x_0,v_y_0) -> eval_start_bb1_in(v_n,1 + v_x_0,1 + v_y_0) [v_x_0 + -1*v_y_0 >= 0 && -1 + v_n + -1*v_y_0 >= 0 && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && -1 + v_n + v_y_0 >= 0 && -1 + v_n + -1*v_x_0 >= 0 && v_x_0 >= 0 && -1 + v_n + v_x_0 >= 0 && -1 + v_n >= 0] eval_start_bb3_in(v_n,v_x_0,v_y_0) -> eval_start_bb4_in(v_n,v_x_0,v_y_0) [v_x_0 + -1*v_y_0 >= 0 && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && v_x_0 >= 0 && -1*v_n + v_x_0 >= 0 && -1 + v_y_0 >= 0] eval_start_bb3_in(v_n,v_x_0,v_y_0) -> eval_start_bb5_in(v_n,v_x_0,v_y_0) [v_x_0 + -1*v_y_0 >= 0 && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && v_x_0 >= 0 && -1*v_n + v_x_0 >= 0 && 0 >= v_y_0] eval_start_bb4_in(v_n,v_x_0,v_y_0) -> eval_start_bb1_in(v_n,v_x_0,-1 + v_y_0) [v_x_0 + -1*v_y_0 >= 0 && -1 + v_y_0 >= 0 && -2 + v_x_0 + v_y_0 >= 0 && -1 + v_x_0 >= 0 && -1*v_n + v_x_0 >= 0] eval_start_bb5_in(v_n,v_x_0,v_y_0) -> eval_start_stop(v_n,v_x_0,v_y_0) [-1*v_y_0 >= 0 && v_x_0 + -1*v_y_0 >= 0 && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && v_x_0 >= 0 && -1*v_n + v_x_0 >= 0] eval_start_stop(v_n,v_x_0,v_y_0) -> exitus616(v_n,v_x_0,v_y_0) True 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_6,3) ;(eval_start_bb0_in,3) ;(eval_start_bb1_in,3) ;(eval_start_bb2_in,3) ;(eval_start_bb3_in,3) ;(eval_start_bb4_in,3) ;(eval_start_bb5_in,3) ;(eval_start_start,3) ;(eval_start_stop,3) ;(exitus616,3)} Rule Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7},7->{8},8->{9,10},9->{11},10->{12,13},11->{9,10},12->{14} ,13->{15},14->{10},15->{16}] + Applied Processor: Decompose Greedy + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16] | +- p:[9,11] c: [9,11] | `- p:[10,14,12] c: [10,12,14] * Step 5: AbstractSize WORST_CASE(?,POLY) + Considered Problem: (Rules: eval_start_start(v_n,v_x_0,v_y_0) -> eval_start_bb0_in(v_n,v_x_0,v_y_0) True eval_start_bb0_in(v_n,v_x_0,v_y_0) -> eval_start_0(v_n,v_x_0,v_y_0) True eval_start_0(v_n,v_x_0,v_y_0) -> eval_start_1(v_n,v_x_0,v_y_0) True eval_start_1(v_n,v_x_0,v_y_0) -> eval_start_2(v_n,v_x_0,v_y_0) True eval_start_2(v_n,v_x_0,v_y_0) -> eval_start_3(v_n,v_x_0,v_y_0) True eval_start_3(v_n,v_x_0,v_y_0) -> eval_start_4(v_n,v_x_0,v_y_0) True eval_start_4(v_n,v_x_0,v_y_0) -> eval_start_5(v_n,v_x_0,v_y_0) True eval_start_5(v_n,v_x_0,v_y_0) -> eval_start_6(v_n,v_x_0,v_y_0) True eval_start_6(v_n,v_x_0,v_y_0) -> eval_start_bb1_in(v_n,0,0) True eval_start_bb1_in(v_n,v_x_0,v_y_0) -> eval_start_bb2_in(v_n,v_x_0,v_y_0) [v_x_0 + -1*v_y_0 >= 0 && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && v_x_0 >= 0 && -1 + v_n >= v_x_0] eval_start_bb1_in(v_n,v_x_0,v_y_0) -> eval_start_bb3_in(v_n,v_x_0,v_y_0) [v_x_0 + -1*v_y_0 >= 0 && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && v_x_0 >= 0 && v_x_0 >= v_n] eval_start_bb2_in(v_n,v_x_0,v_y_0) -> eval_start_bb1_in(v_n,1 + v_x_0,1 + v_y_0) [v_x_0 + -1*v_y_0 >= 0 && -1 + v_n + -1*v_y_0 >= 0 && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && -1 + v_n + v_y_0 >= 0 && -1 + v_n + -1*v_x_0 >= 0 && v_x_0 >= 0 && -1 + v_n + v_x_0 >= 0 && -1 + v_n >= 0] eval_start_bb3_in(v_n,v_x_0,v_y_0) -> eval_start_bb4_in(v_n,v_x_0,v_y_0) [v_x_0 + -1*v_y_0 >= 0 && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && v_x_0 >= 0 && -1*v_n + v_x_0 >= 0 && -1 + v_y_0 >= 0] eval_start_bb3_in(v_n,v_x_0,v_y_0) -> eval_start_bb5_in(v_n,v_x_0,v_y_0) [v_x_0 + -1*v_y_0 >= 0 && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && v_x_0 >= 0 && -1*v_n + v_x_0 >= 0 && 0 >= v_y_0] eval_start_bb4_in(v_n,v_x_0,v_y_0) -> eval_start_bb1_in(v_n,v_x_0,-1 + v_y_0) [v_x_0 + -1*v_y_0 >= 0 && -1 + v_y_0 >= 0 && -2 + v_x_0 + v_y_0 >= 0 && -1 + v_x_0 >= 0 && -1*v_n + v_x_0 >= 0] eval_start_bb5_in(v_n,v_x_0,v_y_0) -> eval_start_stop(v_n,v_x_0,v_y_0) [-1*v_y_0 >= 0 && v_x_0 + -1*v_y_0 >= 0 && v_y_0 >= 0 && v_x_0 + v_y_0 >= 0 && v_x_0 >= 0 && -1*v_n + v_x_0 >= 0] eval_start_stop(v_n,v_x_0,v_y_0) -> exitus616(v_n,v_x_0,v_y_0) True 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_6,3) ;(eval_start_bb0_in,3) ;(eval_start_bb1_in,3) ;(eval_start_bb2_in,3) ;(eval_start_bb3_in,3) ;(eval_start_bb4_in,3) ;(eval_start_bb5_in,3) ;(eval_start_start,3) ;(eval_start_stop,3) ;(exitus616,3)} Rule Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7},7->{8},8->{9,10},9->{11},10->{12,13},11->{9,10},12->{14} ,13->{15},14->{10},15->{16}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16] | +- p:[9,11] c: [9,11] | `- p:[10,14,12] c: [10,12,14]) + Applied Processor: AbstractSize Minimize + Details: () * Step 6: AbstractFlow WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [v_n,v_x_0,v_y_0,0.0,0.1] eval_start_start ~> eval_start_bb0_in [v_n <= v_n, v_x_0 <= v_x_0, v_y_0 <= v_y_0] eval_start_bb0_in ~> eval_start_0 [v_n <= v_n, v_x_0 <= v_x_0, v_y_0 <= v_y_0] eval_start_0 ~> eval_start_1 [v_n <= v_n, v_x_0 <= v_x_0, v_y_0 <= v_y_0] eval_start_1 ~> eval_start_2 [v_n <= v_n, v_x_0 <= v_x_0, v_y_0 <= v_y_0] eval_start_2 ~> eval_start_3 [v_n <= v_n, v_x_0 <= v_x_0, v_y_0 <= v_y_0] eval_start_3 ~> eval_start_4 [v_n <= v_n, v_x_0 <= v_x_0, v_y_0 <= v_y_0] eval_start_4 ~> eval_start_5 [v_n <= v_n, v_x_0 <= v_x_0, v_y_0 <= v_y_0] eval_start_5 ~> eval_start_6 [v_n <= v_n, v_x_0 <= v_x_0, v_y_0 <= v_y_0] eval_start_6 ~> eval_start_bb1_in [v_n <= v_n, v_x_0 <= 0*K, v_y_0 <= 0*K] eval_start_bb1_in ~> eval_start_bb2_in [v_n <= v_n, v_x_0 <= v_x_0, v_y_0 <= v_y_0] eval_start_bb1_in ~> eval_start_bb3_in [v_n <= v_n, v_x_0 <= v_x_0, v_y_0 <= v_y_0] eval_start_bb2_in ~> eval_start_bb1_in [v_n <= v_n, v_x_0 <= v_n, v_y_0 <= v_n] eval_start_bb3_in ~> eval_start_bb4_in [v_n <= v_n, v_x_0 <= v_x_0, v_y_0 <= v_y_0] eval_start_bb3_in ~> eval_start_bb5_in [v_n <= v_n, v_x_0 <= v_x_0, v_y_0 <= v_y_0] eval_start_bb4_in ~> eval_start_bb1_in [v_n <= v_n, v_x_0 <= v_x_0, v_y_0 <= v_y_0] eval_start_bb5_in ~> eval_start_stop [v_n <= v_n, v_x_0 <= v_x_0, v_y_0 <= v_y_0] eval_start_stop ~> exitus616 [v_n <= v_n, v_x_0 <= v_x_0, v_y_0 <= v_y_0] + Loop: [0.0 <= v_n + v_y_0] eval_start_bb1_in ~> eval_start_bb2_in [v_n <= v_n, v_x_0 <= v_x_0, v_y_0 <= v_y_0] eval_start_bb2_in ~> eval_start_bb1_in [v_n <= v_n, v_x_0 <= v_n, v_y_0 <= v_n] + Loop: [0.1 <= K + v_y_0] eval_start_bb1_in ~> eval_start_bb3_in [v_n <= v_n, v_x_0 <= v_x_0, v_y_0 <= v_y_0] eval_start_bb4_in ~> eval_start_bb1_in [v_n <= v_n, v_x_0 <= v_x_0, v_y_0 <= v_y_0] eval_start_bb3_in ~> eval_start_bb4_in [v_n <= v_n, v_x_0 <= v_x_0, v_y_0 <= v_y_0] + Applied Processor: AbstractFlow + Details: () * Step 7: Lare WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,v_n,v_x_0,v_y_0,0.0,0.1] 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_6 [] eval_start_6 ~> eval_start_bb1_in [K ~=> v_x_0,K ~=> v_y_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 [v_n ~=> v_x_0,v_n ~=> v_y_0] eval_start_bb3_in ~> eval_start_bb4_in [] eval_start_bb3_in ~> eval_start_bb5_in [] eval_start_bb4_in ~> eval_start_bb1_in [] eval_start_bb5_in ~> eval_start_stop [] eval_start_stop ~> exitus616 [] + Loop: [v_n ~+> 0.0,v_y_0 ~+> 0.0] eval_start_bb1_in ~> eval_start_bb2_in [] eval_start_bb2_in ~> eval_start_bb1_in [v_n ~=> v_x_0,v_n ~=> v_y_0] + Loop: [v_y_0 ~+> 0.1,K ~+> 0.1] eval_start_bb1_in ~> eval_start_bb3_in [] eval_start_bb4_in ~> eval_start_bb1_in [] eval_start_bb3_in ~> eval_start_bb4_in [] + Applied Processor: Lare + Details: eval_start_start ~> exitus616 [v_n ~=> v_x_0 ,v_n ~=> v_y_0 ,K ~=> v_x_0 ,K ~=> v_y_0 ,v_n ~+> 0.0 ,v_n ~+> 0.1 ,v_n ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.1 ,K ~+> tick ,v_n ~*> tick ,K ~*> 0.1 ,K ~*> tick] + eval_start_bb1_in> [v_n ~=> v_x_0 ,v_n ~=> v_y_0 ,v_n ~+> 0.0 ,v_n ~+> tick ,v_y_0 ~+> 0.0 ,v_y_0 ~+> tick ,tick ~+> tick] + eval_start_bb3_in> [v_y_0 ~+> 0.1 ,v_y_0 ~+> tick ,tick ~+> tick ,K ~+> 0.1 ,K ~+> tick] eval_start_bb1_in> [v_y_0 ~+> 0.1 ,v_y_0 ~+> tick ,tick ~+> tick ,K ~+> 0.1 ,K ~+> tick] YES(?,POLY)