YES(?,POLY) * Step 1: TrivialSCCs WORST_CASE(?,POLY) + Considered Problem: Rules: 0. eval_cousot9_start(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb0_in(v__0,v_N,v_i_0,v_j) True (1,1) 1. eval_cousot9_bb0_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_0(v__0,v_N,v_i_0,v_j) True (?,1) 2. eval_cousot9_0(v__0,v_N,v_i_0,v_j) -> eval_cousot9_1(v__0,v_N,v_i_0,v_j) True (?,1) 3. eval_cousot9_1(v__0,v_N,v_i_0,v_j) -> eval_cousot9_2(v__0,v_N,v_i_0,v_j) True (?,1) 4. eval_cousot9_2(v__0,v_N,v_i_0,v_j) -> eval_cousot9_3(v__0,v_N,v_i_0,v_j) True (?,1) 5. eval_cousot9_3(v__0,v_N,v_i_0,v_j) -> eval_cousot9_4(v__0,v_N,v_i_0,v_j) True (?,1) 6. eval_cousot9_4(v__0,v_N,v_i_0,v_j) -> eval_cousot9_5(v__0,v_N,v_i_0,v_j) True (?,1) 7. eval_cousot9_5(v__0,v_N,v_i_0,v_j) -> eval_cousot9_6(v__0,v_N,v_i_0,v_j) True (?,1) 8. eval_cousot9_6(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb1_in(v_j,v_N,v_N,v_j) True (?,1) 9. eval_cousot9_bb1_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb2_in(v__0,v_N,v_i_0,v_j) [v_N + -1*v_i_0 >= 0 && -1 + v_i_0 >= 0] (?,1) 10. eval_cousot9_bb1_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb3_in(v__0,v_N,v_i_0,v_j) [v_N + -1*v_i_0 >= 0 && 0 >= v_i_0] (?,1) 11. eval_cousot9_bb2_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb1_in(-1 + v__0,v_N,v_i_0,v_j) [v_N + -1*v_i_0 >= 0 && -1 + v_i_0 >= 0 && -2 + v_N + v_i_0 >= 0 && -1 + v_N >= 0 && -1 + v__0 >= 0] (?,1) 12. eval_cousot9_bb2_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb1_in(v_N,v_N,-1 + v_i_0,v_j) [v_N + -1*v_i_0 >= 0 && -1 + v_i_0 >= 0 && -2 + v_N + v_i_0 >= 0 && -1 + v_N >= 0 && 0 >= v__0] (?,1) 13. eval_cousot9_bb3_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_stop(v__0,v_N,v_i_0,v_j) [-1*v_i_0 >= 0 && v_N + -1*v_i_0 >= 0] (?,1) Signature: {(eval_cousot9_0,4) ;(eval_cousot9_1,4) ;(eval_cousot9_2,4) ;(eval_cousot9_3,4) ;(eval_cousot9_4,4) ;(eval_cousot9_5,4) ;(eval_cousot9_6,4) ;(eval_cousot9_bb0_in,4) ;(eval_cousot9_bb1_in,4) ;(eval_cousot9_bb2_in,4) ;(eval_cousot9_bb3_in,4) ;(eval_cousot9_start,4) ;(eval_cousot9_stop,4)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7},7->{8},8->{9,10},9->{11,12},10->{13},11->{9,10},12->{9 ,10},13->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. eval_cousot9_start(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb0_in(v__0,v_N,v_i_0,v_j) True (1,1) 1. eval_cousot9_bb0_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_0(v__0,v_N,v_i_0,v_j) True (1,1) 2. eval_cousot9_0(v__0,v_N,v_i_0,v_j) -> eval_cousot9_1(v__0,v_N,v_i_0,v_j) True (1,1) 3. eval_cousot9_1(v__0,v_N,v_i_0,v_j) -> eval_cousot9_2(v__0,v_N,v_i_0,v_j) True (1,1) 4. eval_cousot9_2(v__0,v_N,v_i_0,v_j) -> eval_cousot9_3(v__0,v_N,v_i_0,v_j) True (1,1) 5. eval_cousot9_3(v__0,v_N,v_i_0,v_j) -> eval_cousot9_4(v__0,v_N,v_i_0,v_j) True (1,1) 6. eval_cousot9_4(v__0,v_N,v_i_0,v_j) -> eval_cousot9_5(v__0,v_N,v_i_0,v_j) True (1,1) 7. eval_cousot9_5(v__0,v_N,v_i_0,v_j) -> eval_cousot9_6(v__0,v_N,v_i_0,v_j) True (1,1) 8. eval_cousot9_6(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb1_in(v_j,v_N,v_N,v_j) True (1,1) 9. eval_cousot9_bb1_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb2_in(v__0,v_N,v_i_0,v_j) [v_N + -1*v_i_0 >= 0 && -1 + v_i_0 >= 0] (?,1) 10. eval_cousot9_bb1_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb3_in(v__0,v_N,v_i_0,v_j) [v_N + -1*v_i_0 >= 0 && 0 >= v_i_0] (1,1) 11. eval_cousot9_bb2_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb1_in(-1 + v__0,v_N,v_i_0,v_j) [v_N + -1*v_i_0 >= 0 && -1 + v_i_0 >= 0 && -2 + v_N + v_i_0 >= 0 && -1 + v_N >= 0 && -1 + v__0 >= 0] (?,1) 12. eval_cousot9_bb2_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb1_in(v_N,v_N,-1 + v_i_0,v_j) [v_N + -1*v_i_0 >= 0 && -1 + v_i_0 >= 0 && -2 + v_N + v_i_0 >= 0 && -1 + v_N >= 0 && 0 >= v__0] (?,1) 13. eval_cousot9_bb3_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_stop(v__0,v_N,v_i_0,v_j) [-1*v_i_0 >= 0 && v_N + -1*v_i_0 >= 0] (1,1) Signature: {(eval_cousot9_0,4) ;(eval_cousot9_1,4) ;(eval_cousot9_2,4) ;(eval_cousot9_3,4) ;(eval_cousot9_4,4) ;(eval_cousot9_5,4) ;(eval_cousot9_6,4) ;(eval_cousot9_bb0_in,4) ;(eval_cousot9_bb1_in,4) ;(eval_cousot9_bb2_in,4) ;(eval_cousot9_bb3_in,4) ;(eval_cousot9_start,4) ;(eval_cousot9_stop,4)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7},7->{8},8->{9,10},9->{11,12},10->{13},11->{9,10},12->{9 ,10},13->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(11,10)] * Step 3: AddSinks WORST_CASE(?,POLY) + Considered Problem: Rules: 0. eval_cousot9_start(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb0_in(v__0,v_N,v_i_0,v_j) True (1,1) 1. eval_cousot9_bb0_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_0(v__0,v_N,v_i_0,v_j) True (1,1) 2. eval_cousot9_0(v__0,v_N,v_i_0,v_j) -> eval_cousot9_1(v__0,v_N,v_i_0,v_j) True (1,1) 3. eval_cousot9_1(v__0,v_N,v_i_0,v_j) -> eval_cousot9_2(v__0,v_N,v_i_0,v_j) True (1,1) 4. eval_cousot9_2(v__0,v_N,v_i_0,v_j) -> eval_cousot9_3(v__0,v_N,v_i_0,v_j) True (1,1) 5. eval_cousot9_3(v__0,v_N,v_i_0,v_j) -> eval_cousot9_4(v__0,v_N,v_i_0,v_j) True (1,1) 6. eval_cousot9_4(v__0,v_N,v_i_0,v_j) -> eval_cousot9_5(v__0,v_N,v_i_0,v_j) True (1,1) 7. eval_cousot9_5(v__0,v_N,v_i_0,v_j) -> eval_cousot9_6(v__0,v_N,v_i_0,v_j) True (1,1) 8. eval_cousot9_6(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb1_in(v_j,v_N,v_N,v_j) True (1,1) 9. eval_cousot9_bb1_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb2_in(v__0,v_N,v_i_0,v_j) [v_N + -1*v_i_0 >= 0 && -1 + v_i_0 >= 0] (?,1) 10. eval_cousot9_bb1_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb3_in(v__0,v_N,v_i_0,v_j) [v_N + -1*v_i_0 >= 0 && 0 >= v_i_0] (1,1) 11. eval_cousot9_bb2_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb1_in(-1 + v__0,v_N,v_i_0,v_j) [v_N + -1*v_i_0 >= 0 && -1 + v_i_0 >= 0 && -2 + v_N + v_i_0 >= 0 && -1 + v_N >= 0 && -1 + v__0 >= 0] (?,1) 12. eval_cousot9_bb2_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb1_in(v_N,v_N,-1 + v_i_0,v_j) [v_N + -1*v_i_0 >= 0 && -1 + v_i_0 >= 0 && -2 + v_N + v_i_0 >= 0 && -1 + v_N >= 0 && 0 >= v__0] (?,1) 13. eval_cousot9_bb3_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_stop(v__0,v_N,v_i_0,v_j) [-1*v_i_0 >= 0 && v_N + -1*v_i_0 >= 0] (1,1) Signature: {(eval_cousot9_0,4) ;(eval_cousot9_1,4) ;(eval_cousot9_2,4) ;(eval_cousot9_3,4) ;(eval_cousot9_4,4) ;(eval_cousot9_5,4) ;(eval_cousot9_6,4) ;(eval_cousot9_bb0_in,4) ;(eval_cousot9_bb1_in,4) ;(eval_cousot9_bb2_in,4) ;(eval_cousot9_bb3_in,4) ;(eval_cousot9_start,4) ;(eval_cousot9_stop,4)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7},7->{8},8->{9,10},9->{11,12},10->{13},11->{9},12->{9,10} ,13->{}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. eval_cousot9_start(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb0_in(v__0,v_N,v_i_0,v_j) True (1,1) 1. eval_cousot9_bb0_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_0(v__0,v_N,v_i_0,v_j) True (?,1) 2. eval_cousot9_0(v__0,v_N,v_i_0,v_j) -> eval_cousot9_1(v__0,v_N,v_i_0,v_j) True (?,1) 3. eval_cousot9_1(v__0,v_N,v_i_0,v_j) -> eval_cousot9_2(v__0,v_N,v_i_0,v_j) True (?,1) 4. eval_cousot9_2(v__0,v_N,v_i_0,v_j) -> eval_cousot9_3(v__0,v_N,v_i_0,v_j) True (?,1) 5. eval_cousot9_3(v__0,v_N,v_i_0,v_j) -> eval_cousot9_4(v__0,v_N,v_i_0,v_j) True (?,1) 6. eval_cousot9_4(v__0,v_N,v_i_0,v_j) -> eval_cousot9_5(v__0,v_N,v_i_0,v_j) True (?,1) 7. eval_cousot9_5(v__0,v_N,v_i_0,v_j) -> eval_cousot9_6(v__0,v_N,v_i_0,v_j) True (?,1) 8. eval_cousot9_6(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb1_in(v_j,v_N,v_N,v_j) True (?,1) 9. eval_cousot9_bb1_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb2_in(v__0,v_N,v_i_0,v_j) [v_N + -1*v_i_0 >= 0 && -1 + v_i_0 >= 0] (?,1) 10. eval_cousot9_bb1_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb3_in(v__0,v_N,v_i_0,v_j) [v_N + -1*v_i_0 >= 0 && 0 >= v_i_0] (?,1) 11. eval_cousot9_bb2_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb1_in(-1 + v__0,v_N,v_i_0,v_j) [v_N + -1*v_i_0 >= 0 && -1 + v_i_0 >= 0 && -2 + v_N + v_i_0 >= 0 && -1 + v_N >= 0 && -1 + v__0 >= 0] (?,1) 12. eval_cousot9_bb2_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb1_in(v_N,v_N,-1 + v_i_0,v_j) [v_N + -1*v_i_0 >= 0 && -1 + v_i_0 >= 0 && -2 + v_N + v_i_0 >= 0 && -1 + v_N >= 0 && 0 >= v__0] (?,1) 13. eval_cousot9_bb3_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_stop(v__0,v_N,v_i_0,v_j) [-1*v_i_0 >= 0 && v_N + -1*v_i_0 >= 0] (?,1) 14. eval_cousot9_bb3_in(v__0,v_N,v_i_0,v_j) -> exitus616(v__0,v_N,v_i_0,v_j) True (?,1) Signature: {(eval_cousot9_0,4) ;(eval_cousot9_1,4) ;(eval_cousot9_2,4) ;(eval_cousot9_3,4) ;(eval_cousot9_4,4) ;(eval_cousot9_5,4) ;(eval_cousot9_6,4) ;(eval_cousot9_bb0_in,4) ;(eval_cousot9_bb1_in,4) ;(eval_cousot9_bb2_in,4) ;(eval_cousot9_bb3_in,4) ;(eval_cousot9_start,4) ;(eval_cousot9_stop,4) ;(exitus616,4)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7},7->{8},8->{9,10},9->{11,12},10->{13,14},11->{9,10} ,12->{9,10},13->{},14->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(11,10)] * Step 5: LooptreeTransformer WORST_CASE(?,POLY) + Considered Problem: Rules: 0. eval_cousot9_start(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb0_in(v__0,v_N,v_i_0,v_j) True (1,1) 1. eval_cousot9_bb0_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_0(v__0,v_N,v_i_0,v_j) True (?,1) 2. eval_cousot9_0(v__0,v_N,v_i_0,v_j) -> eval_cousot9_1(v__0,v_N,v_i_0,v_j) True (?,1) 3. eval_cousot9_1(v__0,v_N,v_i_0,v_j) -> eval_cousot9_2(v__0,v_N,v_i_0,v_j) True (?,1) 4. eval_cousot9_2(v__0,v_N,v_i_0,v_j) -> eval_cousot9_3(v__0,v_N,v_i_0,v_j) True (?,1) 5. eval_cousot9_3(v__0,v_N,v_i_0,v_j) -> eval_cousot9_4(v__0,v_N,v_i_0,v_j) True (?,1) 6. eval_cousot9_4(v__0,v_N,v_i_0,v_j) -> eval_cousot9_5(v__0,v_N,v_i_0,v_j) True (?,1) 7. eval_cousot9_5(v__0,v_N,v_i_0,v_j) -> eval_cousot9_6(v__0,v_N,v_i_0,v_j) True (?,1) 8. eval_cousot9_6(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb1_in(v_j,v_N,v_N,v_j) True (?,1) 9. eval_cousot9_bb1_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb2_in(v__0,v_N,v_i_0,v_j) [v_N + -1*v_i_0 >= 0 && -1 + v_i_0 >= 0] (?,1) 10. eval_cousot9_bb1_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb3_in(v__0,v_N,v_i_0,v_j) [v_N + -1*v_i_0 >= 0 && 0 >= v_i_0] (?,1) 11. eval_cousot9_bb2_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb1_in(-1 + v__0,v_N,v_i_0,v_j) [v_N + -1*v_i_0 >= 0 && -1 + v_i_0 >= 0 && -2 + v_N + v_i_0 >= 0 && -1 + v_N >= 0 && -1 + v__0 >= 0] (?,1) 12. eval_cousot9_bb2_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb1_in(v_N,v_N,-1 + v_i_0,v_j) [v_N + -1*v_i_0 >= 0 && -1 + v_i_0 >= 0 && -2 + v_N + v_i_0 >= 0 && -1 + v_N >= 0 && 0 >= v__0] (?,1) 13. eval_cousot9_bb3_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_stop(v__0,v_N,v_i_0,v_j) [-1*v_i_0 >= 0 && v_N + -1*v_i_0 >= 0] (?,1) 14. eval_cousot9_bb3_in(v__0,v_N,v_i_0,v_j) -> exitus616(v__0,v_N,v_i_0,v_j) True (?,1) Signature: {(eval_cousot9_0,4) ;(eval_cousot9_1,4) ;(eval_cousot9_2,4) ;(eval_cousot9_3,4) ;(eval_cousot9_4,4) ;(eval_cousot9_5,4) ;(eval_cousot9_6,4) ;(eval_cousot9_bb0_in,4) ;(eval_cousot9_bb1_in,4) ;(eval_cousot9_bb2_in,4) ;(eval_cousot9_bb3_in,4) ;(eval_cousot9_start,4) ;(eval_cousot9_stop,4) ;(exitus616,4)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7},7->{8},8->{9,10},9->{11,12},10->{13,14},11->{9},12->{9 ,10},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:[9,11,12] c: [12] | `- p:[9,11] c: [11] * Step 6: SizeAbstraction WORST_CASE(?,POLY) + Considered Problem: (Rules: 0. eval_cousot9_start(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb0_in(v__0,v_N,v_i_0,v_j) True (1,1) 1. eval_cousot9_bb0_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_0(v__0,v_N,v_i_0,v_j) True (?,1) 2. eval_cousot9_0(v__0,v_N,v_i_0,v_j) -> eval_cousot9_1(v__0,v_N,v_i_0,v_j) True (?,1) 3. eval_cousot9_1(v__0,v_N,v_i_0,v_j) -> eval_cousot9_2(v__0,v_N,v_i_0,v_j) True (?,1) 4. eval_cousot9_2(v__0,v_N,v_i_0,v_j) -> eval_cousot9_3(v__0,v_N,v_i_0,v_j) True (?,1) 5. eval_cousot9_3(v__0,v_N,v_i_0,v_j) -> eval_cousot9_4(v__0,v_N,v_i_0,v_j) True (?,1) 6. eval_cousot9_4(v__0,v_N,v_i_0,v_j) -> eval_cousot9_5(v__0,v_N,v_i_0,v_j) True (?,1) 7. eval_cousot9_5(v__0,v_N,v_i_0,v_j) -> eval_cousot9_6(v__0,v_N,v_i_0,v_j) True (?,1) 8. eval_cousot9_6(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb1_in(v_j,v_N,v_N,v_j) True (?,1) 9. eval_cousot9_bb1_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb2_in(v__0,v_N,v_i_0,v_j) [v_N + -1*v_i_0 >= 0 && -1 + v_i_0 >= 0] (?,1) 10. eval_cousot9_bb1_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb3_in(v__0,v_N,v_i_0,v_j) [v_N + -1*v_i_0 >= 0 && 0 >= v_i_0] (?,1) 11. eval_cousot9_bb2_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb1_in(-1 + v__0,v_N,v_i_0,v_j) [v_N + -1*v_i_0 >= 0 && -1 + v_i_0 >= 0 && -2 + v_N + v_i_0 >= 0 && -1 + v_N >= 0 && -1 + v__0 >= 0] (?,1) 12. eval_cousot9_bb2_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_bb1_in(v_N,v_N,-1 + v_i_0,v_j) [v_N + -1*v_i_0 >= 0 && -1 + v_i_0 >= 0 && -2 + v_N + v_i_0 >= 0 && -1 + v_N >= 0 && 0 >= v__0] (?,1) 13. eval_cousot9_bb3_in(v__0,v_N,v_i_0,v_j) -> eval_cousot9_stop(v__0,v_N,v_i_0,v_j) [-1*v_i_0 >= 0 && v_N + -1*v_i_0 >= 0] (?,1) 14. eval_cousot9_bb3_in(v__0,v_N,v_i_0,v_j) -> exitus616(v__0,v_N,v_i_0,v_j) True (?,1) Signature: {(eval_cousot9_0,4) ;(eval_cousot9_1,4) ;(eval_cousot9_2,4) ;(eval_cousot9_3,4) ;(eval_cousot9_4,4) ;(eval_cousot9_5,4) ;(eval_cousot9_6,4) ;(eval_cousot9_bb0_in,4) ;(eval_cousot9_bb1_in,4) ;(eval_cousot9_bb2_in,4) ;(eval_cousot9_bb3_in,4) ;(eval_cousot9_start,4) ;(eval_cousot9_stop,4) ;(exitus616,4)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7},7->{8},8->{9,10},9->{11,12},10->{13,14},11->{9},12->{9 ,10},13->{},14->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14] | `- p:[9,11,12] c: [12] | `- p:[9,11] c: [11]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 7: FlowAbstraction WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [v__0,v_N,v_i_0,v_j,0.0,0.0.0] eval_cousot9_start ~> eval_cousot9_bb0_in [v__0 <= v__0, v_N <= v_N, v_i_0 <= v_i_0, v_j <= v_j] eval_cousot9_bb0_in ~> eval_cousot9_0 [v__0 <= v__0, v_N <= v_N, v_i_0 <= v_i_0, v_j <= v_j] eval_cousot9_0 ~> eval_cousot9_1 [v__0 <= v__0, v_N <= v_N, v_i_0 <= v_i_0, v_j <= v_j] eval_cousot9_1 ~> eval_cousot9_2 [v__0 <= v__0, v_N <= v_N, v_i_0 <= v_i_0, v_j <= v_j] eval_cousot9_2 ~> eval_cousot9_3 [v__0 <= v__0, v_N <= v_N, v_i_0 <= v_i_0, v_j <= v_j] eval_cousot9_3 ~> eval_cousot9_4 [v__0 <= v__0, v_N <= v_N, v_i_0 <= v_i_0, v_j <= v_j] eval_cousot9_4 ~> eval_cousot9_5 [v__0 <= v__0, v_N <= v_N, v_i_0 <= v_i_0, v_j <= v_j] eval_cousot9_5 ~> eval_cousot9_6 [v__0 <= v__0, v_N <= v_N, v_i_0 <= v_i_0, v_j <= v_j] eval_cousot9_6 ~> eval_cousot9_bb1_in [v__0 <= v_j, v_N <= v_N, v_i_0 <= v_N, v_j <= v_j] eval_cousot9_bb1_in ~> eval_cousot9_bb2_in [v__0 <= v__0, v_N <= v_N, v_i_0 <= v_i_0, v_j <= v_j] eval_cousot9_bb1_in ~> eval_cousot9_bb3_in [v__0 <= v__0, v_N <= v_N, v_i_0 <= v_i_0, v_j <= v_j] eval_cousot9_bb2_in ~> eval_cousot9_bb1_in [v__0 <= v__0, v_N <= v_N, v_i_0 <= v_i_0, v_j <= v_j] eval_cousot9_bb2_in ~> eval_cousot9_bb1_in [v__0 <= v_N, v_N <= v_N, v_i_0 <= v_i_0, v_j <= v_j] eval_cousot9_bb3_in ~> eval_cousot9_stop [v__0 <= v__0, v_N <= v_N, v_i_0 <= v_i_0, v_j <= v_j] eval_cousot9_bb3_in ~> exitus616 [v__0 <= v__0, v_N <= v_N, v_i_0 <= v_i_0, v_j <= v_j] + Loop: [0.0 <= v_i_0] eval_cousot9_bb1_in ~> eval_cousot9_bb2_in [v__0 <= v__0, v_N <= v_N, v_i_0 <= v_i_0, v_j <= v_j] eval_cousot9_bb2_in ~> eval_cousot9_bb1_in [v__0 <= v__0, v_N <= v_N, v_i_0 <= v_i_0, v_j <= v_j] eval_cousot9_bb2_in ~> eval_cousot9_bb1_in [v__0 <= v_N, v_N <= v_N, v_i_0 <= v_i_0, v_j <= v_j] + Loop: [0.0.0 <= v__0] eval_cousot9_bb1_in ~> eval_cousot9_bb2_in [v__0 <= v__0, v_N <= v_N, v_i_0 <= v_i_0, v_j <= v_j] eval_cousot9_bb2_in ~> eval_cousot9_bb1_in [v__0 <= v__0, v_N <= v_N, v_i_0 <= v_i_0, v_j <= v_j] + Applied Processor: FlowAbstraction + Details: () * Step 8: LareProcessor WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,v__0,v_N,v_i_0,v_j,0.0,0.0.0] eval_cousot9_start ~> eval_cousot9_bb0_in [] eval_cousot9_bb0_in ~> eval_cousot9_0 [] eval_cousot9_0 ~> eval_cousot9_1 [] eval_cousot9_1 ~> eval_cousot9_2 [] eval_cousot9_2 ~> eval_cousot9_3 [] eval_cousot9_3 ~> eval_cousot9_4 [] eval_cousot9_4 ~> eval_cousot9_5 [] eval_cousot9_5 ~> eval_cousot9_6 [] eval_cousot9_6 ~> eval_cousot9_bb1_in [v_N ~=> v_i_0,v_j ~=> v__0] eval_cousot9_bb1_in ~> eval_cousot9_bb2_in [] eval_cousot9_bb1_in ~> eval_cousot9_bb3_in [] eval_cousot9_bb2_in ~> eval_cousot9_bb1_in [] eval_cousot9_bb2_in ~> eval_cousot9_bb1_in [v_N ~=> v__0] eval_cousot9_bb3_in ~> eval_cousot9_stop [] eval_cousot9_bb3_in ~> exitus616 [] + Loop: [v_i_0 ~=> 0.0] eval_cousot9_bb1_in ~> eval_cousot9_bb2_in [] eval_cousot9_bb2_in ~> eval_cousot9_bb1_in [] eval_cousot9_bb2_in ~> eval_cousot9_bb1_in [v_N ~=> v__0] + Loop: [v__0 ~=> 0.0.0] eval_cousot9_bb1_in ~> eval_cousot9_bb2_in [] eval_cousot9_bb2_in ~> eval_cousot9_bb1_in [] + Applied Processor: LareProcessor + Details: eval_cousot9_start ~> eval_cousot9_stop [v_N ~=> v__0 ,v_N ~=> v_i_0 ,v_N ~=> 0.0 ,v_N ~=> 0.0.0 ,v_j ~=> v__0 ,v_j ~=> 0.0.0 ,v_N ~+> tick ,v_j ~+> tick ,tick ~+> tick ,v_N ~*> tick ,v_j ~*> tick] eval_cousot9_start ~> exitus616 [v_N ~=> v__0 ,v_N ~=> v_i_0 ,v_N ~=> 0.0 ,v_N ~=> 0.0.0 ,v_j ~=> v__0 ,v_j ~=> 0.0.0 ,v_N ~+> tick ,v_j ~+> tick ,tick ~+> tick ,v_N ~*> tick ,v_j ~*> tick] + eval_cousot9_bb1_in> [v_N ~=> v__0 ,v_N ~=> 0.0.0 ,v__0 ~=> 0.0.0 ,v_i_0 ~=> 0.0 ,v_N ~+> tick ,v__0 ~+> tick ,v_i_0 ~+> tick ,tick ~+> tick ,v__0 ~*> tick ,v_i_0 ~*> tick] + eval_cousot9_bb2_in> [v__0 ~=> 0.0.0,v__0 ~+> tick,tick ~+> tick] eval_cousot9_bb1_in> [v__0 ~=> 0.0.0,v__0 ~+> tick,tick ~+> tick] YES(?,POLY)