YES(?,O(1)) * Step 1: TrivialSCCs WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. eval_easy1_start(v_0,v_x_0) -> eval_easy1_bb0_in(v_0,v_x_0) True (1,1) 1. eval_easy1_bb0_in(v_0,v_x_0) -> eval_easy1_1(nondef_0,v_x_0) True (?,1) 2. eval_easy1_1(v_0,v_x_0) -> eval_easy1_2(v_0,v_x_0) True (?,1) 3. eval_easy1_2(v_0,v_x_0) -> eval_easy1_3(v_0,v_x_0) True (?,1) 4. eval_easy1_3(v_0,v_x_0) -> eval_easy1_4(v_0,v_x_0) True (?,1) 5. eval_easy1_4(v_0,v_x_0) -> eval_easy1_5(v_0,v_x_0) True (?,1) 6. eval_easy1_5(v_0,v_x_0) -> eval_easy1_6(v_0,v_x_0) True (?,1) 7. eval_easy1_6(v_0,v_x_0) -> eval_easy1_bb1_in(v_0,0) True (?,1) 8. eval_easy1_bb1_in(v_0,v_x_0) -> eval_easy1_bb2_in(v_0,v_x_0) [v_x_0 >= 0 && 39 >= v_x_0] (?,1) 9. eval_easy1_bb1_in(v_0,v_x_0) -> eval_easy1_bb3_in(v_0,v_x_0) [v_x_0 >= 0 && v_x_0 >= 40] (?,1) 10. eval_easy1_bb2_in(v_0,v_x_0) -> eval_easy1_bb1_in(v_0,1 + v_x_0) [39 + -1*v_x_0 >= 0 && v_x_0 >= 0 && v_0 = 0] (?,1) 11. eval_easy1_bb2_in(v_0,v_x_0) -> eval_easy1_bb1_in(v_0,2 + v_x_0) [39 + -1*v_x_0 >= 0 && v_x_0 >= 0 && -1 >= v_0] (?,1) 12. eval_easy1_bb2_in(v_0,v_x_0) -> eval_easy1_bb1_in(v_0,2 + v_x_0) [39 + -1*v_x_0 >= 0 && v_x_0 >= 0 && -1 + v_0 >= 0] (?,1) 13. eval_easy1_bb3_in(v_0,v_x_0) -> eval_easy1_stop(v_0,v_x_0) [-40 + v_x_0 >= 0] (?,1) Signature: {(eval_easy1_1,2) ;(eval_easy1_2,2) ;(eval_easy1_3,2) ;(eval_easy1_4,2) ;(eval_easy1_5,2) ;(eval_easy1_6,2) ;(eval_easy1_bb0_in,2) ;(eval_easy1_bb1_in,2) ;(eval_easy1_bb2_in,2) ;(eval_easy1_bb3_in,2) ;(eval_easy1_start,2) ;(eval_easy1_stop,2)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7},7->{8,9},8->{10,11,12},9->{13},10->{8,9},11->{8,9} ,12->{8,9},13->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. eval_easy1_start(v_0,v_x_0) -> eval_easy1_bb0_in(v_0,v_x_0) True (1,1) 1. eval_easy1_bb0_in(v_0,v_x_0) -> eval_easy1_1(nondef_0,v_x_0) True (1,1) 2. eval_easy1_1(v_0,v_x_0) -> eval_easy1_2(v_0,v_x_0) True (1,1) 3. eval_easy1_2(v_0,v_x_0) -> eval_easy1_3(v_0,v_x_0) True (1,1) 4. eval_easy1_3(v_0,v_x_0) -> eval_easy1_4(v_0,v_x_0) True (1,1) 5. eval_easy1_4(v_0,v_x_0) -> eval_easy1_5(v_0,v_x_0) True (1,1) 6. eval_easy1_5(v_0,v_x_0) -> eval_easy1_6(v_0,v_x_0) True (1,1) 7. eval_easy1_6(v_0,v_x_0) -> eval_easy1_bb1_in(v_0,0) True (1,1) 8. eval_easy1_bb1_in(v_0,v_x_0) -> eval_easy1_bb2_in(v_0,v_x_0) [v_x_0 >= 0 && 39 >= v_x_0] (?,1) 9. eval_easy1_bb1_in(v_0,v_x_0) -> eval_easy1_bb3_in(v_0,v_x_0) [v_x_0 >= 0 && v_x_0 >= 40] (1,1) 10. eval_easy1_bb2_in(v_0,v_x_0) -> eval_easy1_bb1_in(v_0,1 + v_x_0) [39 + -1*v_x_0 >= 0 && v_x_0 >= 0 && v_0 = 0] (?,1) 11. eval_easy1_bb2_in(v_0,v_x_0) -> eval_easy1_bb1_in(v_0,2 + v_x_0) [39 + -1*v_x_0 >= 0 && v_x_0 >= 0 && -1 >= v_0] (?,1) 12. eval_easy1_bb2_in(v_0,v_x_0) -> eval_easy1_bb1_in(v_0,2 + v_x_0) [39 + -1*v_x_0 >= 0 && v_x_0 >= 0 && -1 + v_0 >= 0] (?,1) 13. eval_easy1_bb3_in(v_0,v_x_0) -> eval_easy1_stop(v_0,v_x_0) [-40 + v_x_0 >= 0] (1,1) Signature: {(eval_easy1_1,2) ;(eval_easy1_2,2) ;(eval_easy1_3,2) ;(eval_easy1_4,2) ;(eval_easy1_5,2) ;(eval_easy1_6,2) ;(eval_easy1_bb0_in,2) ;(eval_easy1_bb1_in,2) ;(eval_easy1_bb2_in,2) ;(eval_easy1_bb3_in,2) ;(eval_easy1_start,2) ;(eval_easy1_stop,2)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7},7->{8,9},8->{10,11,12},9->{13},10->{8,9},11->{8,9} ,12->{8,9},13->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(7,9)] * Step 3: AddSinks WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. eval_easy1_start(v_0,v_x_0) -> eval_easy1_bb0_in(v_0,v_x_0) True (1,1) 1. eval_easy1_bb0_in(v_0,v_x_0) -> eval_easy1_1(nondef_0,v_x_0) True (1,1) 2. eval_easy1_1(v_0,v_x_0) -> eval_easy1_2(v_0,v_x_0) True (1,1) 3. eval_easy1_2(v_0,v_x_0) -> eval_easy1_3(v_0,v_x_0) True (1,1) 4. eval_easy1_3(v_0,v_x_0) -> eval_easy1_4(v_0,v_x_0) True (1,1) 5. eval_easy1_4(v_0,v_x_0) -> eval_easy1_5(v_0,v_x_0) True (1,1) 6. eval_easy1_5(v_0,v_x_0) -> eval_easy1_6(v_0,v_x_0) True (1,1) 7. eval_easy1_6(v_0,v_x_0) -> eval_easy1_bb1_in(v_0,0) True (1,1) 8. eval_easy1_bb1_in(v_0,v_x_0) -> eval_easy1_bb2_in(v_0,v_x_0) [v_x_0 >= 0 && 39 >= v_x_0] (?,1) 9. eval_easy1_bb1_in(v_0,v_x_0) -> eval_easy1_bb3_in(v_0,v_x_0) [v_x_0 >= 0 && v_x_0 >= 40] (1,1) 10. eval_easy1_bb2_in(v_0,v_x_0) -> eval_easy1_bb1_in(v_0,1 + v_x_0) [39 + -1*v_x_0 >= 0 && v_x_0 >= 0 && v_0 = 0] (?,1) 11. eval_easy1_bb2_in(v_0,v_x_0) -> eval_easy1_bb1_in(v_0,2 + v_x_0) [39 + -1*v_x_0 >= 0 && v_x_0 >= 0 && -1 >= v_0] (?,1) 12. eval_easy1_bb2_in(v_0,v_x_0) -> eval_easy1_bb1_in(v_0,2 + v_x_0) [39 + -1*v_x_0 >= 0 && v_x_0 >= 0 && -1 + v_0 >= 0] (?,1) 13. eval_easy1_bb3_in(v_0,v_x_0) -> eval_easy1_stop(v_0,v_x_0) [-40 + v_x_0 >= 0] (1,1) Signature: {(eval_easy1_1,2) ;(eval_easy1_2,2) ;(eval_easy1_3,2) ;(eval_easy1_4,2) ;(eval_easy1_5,2) ;(eval_easy1_6,2) ;(eval_easy1_bb0_in,2) ;(eval_easy1_bb1_in,2) ;(eval_easy1_bb2_in,2) ;(eval_easy1_bb3_in,2) ;(eval_easy1_start,2) ;(eval_easy1_stop,2)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7},7->{8},8->{10,11,12},9->{13},10->{8,9},11->{8,9},12->{8 ,9},13->{}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. eval_easy1_start(v_0,v_x_0) -> eval_easy1_bb0_in(v_0,v_x_0) True (1,1) 1. eval_easy1_bb0_in(v_0,v_x_0) -> eval_easy1_1(nondef_0,v_x_0) True (?,1) 2. eval_easy1_1(v_0,v_x_0) -> eval_easy1_2(v_0,v_x_0) True (?,1) 3. eval_easy1_2(v_0,v_x_0) -> eval_easy1_3(v_0,v_x_0) True (?,1) 4. eval_easy1_3(v_0,v_x_0) -> eval_easy1_4(v_0,v_x_0) True (?,1) 5. eval_easy1_4(v_0,v_x_0) -> eval_easy1_5(v_0,v_x_0) True (?,1) 6. eval_easy1_5(v_0,v_x_0) -> eval_easy1_6(v_0,v_x_0) True (?,1) 7. eval_easy1_6(v_0,v_x_0) -> eval_easy1_bb1_in(v_0,0) True (?,1) 8. eval_easy1_bb1_in(v_0,v_x_0) -> eval_easy1_bb2_in(v_0,v_x_0) [v_x_0 >= 0 && 39 >= v_x_0] (?,1) 9. eval_easy1_bb1_in(v_0,v_x_0) -> eval_easy1_bb3_in(v_0,v_x_0) [v_x_0 >= 0 && v_x_0 >= 40] (?,1) 10. eval_easy1_bb2_in(v_0,v_x_0) -> eval_easy1_bb1_in(v_0,1 + v_x_0) [39 + -1*v_x_0 >= 0 && v_x_0 >= 0 && v_0 = 0] (?,1) 11. eval_easy1_bb2_in(v_0,v_x_0) -> eval_easy1_bb1_in(v_0,2 + v_x_0) [39 + -1*v_x_0 >= 0 && v_x_0 >= 0 && -1 >= v_0] (?,1) 12. eval_easy1_bb2_in(v_0,v_x_0) -> eval_easy1_bb1_in(v_0,2 + v_x_0) [39 + -1*v_x_0 >= 0 && v_x_0 >= 0 && -1 + v_0 >= 0] (?,1) 13. eval_easy1_bb3_in(v_0,v_x_0) -> eval_easy1_stop(v_0,v_x_0) [-40 + v_x_0 >= 0] (?,1) 14. eval_easy1_bb3_in(v_0,v_x_0) -> exitus616(v_0,v_x_0) True (?,1) Signature: {(eval_easy1_1,2) ;(eval_easy1_2,2) ;(eval_easy1_3,2) ;(eval_easy1_4,2) ;(eval_easy1_5,2) ;(eval_easy1_6,2) ;(eval_easy1_bb0_in,2) ;(eval_easy1_bb1_in,2) ;(eval_easy1_bb2_in,2) ;(eval_easy1_bb3_in,2) ;(eval_easy1_start,2) ;(eval_easy1_stop,2) ;(exitus616,2)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7},7->{8,9},8->{10,11,12},9->{13,14},10->{8,9},11->{8,9} ,12->{8,9},13->{},14->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(7,9)] * Step 5: LooptreeTransformer WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. eval_easy1_start(v_0,v_x_0) -> eval_easy1_bb0_in(v_0,v_x_0) True (1,1) 1. eval_easy1_bb0_in(v_0,v_x_0) -> eval_easy1_1(nondef_0,v_x_0) True (?,1) 2. eval_easy1_1(v_0,v_x_0) -> eval_easy1_2(v_0,v_x_0) True (?,1) 3. eval_easy1_2(v_0,v_x_0) -> eval_easy1_3(v_0,v_x_0) True (?,1) 4. eval_easy1_3(v_0,v_x_0) -> eval_easy1_4(v_0,v_x_0) True (?,1) 5. eval_easy1_4(v_0,v_x_0) -> eval_easy1_5(v_0,v_x_0) True (?,1) 6. eval_easy1_5(v_0,v_x_0) -> eval_easy1_6(v_0,v_x_0) True (?,1) 7. eval_easy1_6(v_0,v_x_0) -> eval_easy1_bb1_in(v_0,0) True (?,1) 8. eval_easy1_bb1_in(v_0,v_x_0) -> eval_easy1_bb2_in(v_0,v_x_0) [v_x_0 >= 0 && 39 >= v_x_0] (?,1) 9. eval_easy1_bb1_in(v_0,v_x_0) -> eval_easy1_bb3_in(v_0,v_x_0) [v_x_0 >= 0 && v_x_0 >= 40] (?,1) 10. eval_easy1_bb2_in(v_0,v_x_0) -> eval_easy1_bb1_in(v_0,1 + v_x_0) [39 + -1*v_x_0 >= 0 && v_x_0 >= 0 && v_0 = 0] (?,1) 11. eval_easy1_bb2_in(v_0,v_x_0) -> eval_easy1_bb1_in(v_0,2 + v_x_0) [39 + -1*v_x_0 >= 0 && v_x_0 >= 0 && -1 >= v_0] (?,1) 12. eval_easy1_bb2_in(v_0,v_x_0) -> eval_easy1_bb1_in(v_0,2 + v_x_0) [39 + -1*v_x_0 >= 0 && v_x_0 >= 0 && -1 + v_0 >= 0] (?,1) 13. eval_easy1_bb3_in(v_0,v_x_0) -> eval_easy1_stop(v_0,v_x_0) [-40 + v_x_0 >= 0] (?,1) 14. eval_easy1_bb3_in(v_0,v_x_0) -> exitus616(v_0,v_x_0) True (?,1) Signature: {(eval_easy1_1,2) ;(eval_easy1_2,2) ;(eval_easy1_3,2) ;(eval_easy1_4,2) ;(eval_easy1_5,2) ;(eval_easy1_6,2) ;(eval_easy1_bb0_in,2) ;(eval_easy1_bb1_in,2) ;(eval_easy1_bb2_in,2) ;(eval_easy1_bb3_in,2) ;(eval_easy1_start,2) ;(eval_easy1_stop,2) ;(exitus616,2)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7},7->{8},8->{10,11,12},9->{13,14},10->{8,9},11->{8,9} ,12->{8,9},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:[8,10,11,12] c: [12] | `- p:[8,10,11] c: [11] | `- p:[8,10] c: [10] * Step 6: SizeAbstraction WORST_CASE(?,O(1)) + Considered Problem: (Rules: 0. eval_easy1_start(v_0,v_x_0) -> eval_easy1_bb0_in(v_0,v_x_0) True (1,1) 1. eval_easy1_bb0_in(v_0,v_x_0) -> eval_easy1_1(nondef_0,v_x_0) True (?,1) 2. eval_easy1_1(v_0,v_x_0) -> eval_easy1_2(v_0,v_x_0) True (?,1) 3. eval_easy1_2(v_0,v_x_0) -> eval_easy1_3(v_0,v_x_0) True (?,1) 4. eval_easy1_3(v_0,v_x_0) -> eval_easy1_4(v_0,v_x_0) True (?,1) 5. eval_easy1_4(v_0,v_x_0) -> eval_easy1_5(v_0,v_x_0) True (?,1) 6. eval_easy1_5(v_0,v_x_0) -> eval_easy1_6(v_0,v_x_0) True (?,1) 7. eval_easy1_6(v_0,v_x_0) -> eval_easy1_bb1_in(v_0,0) True (?,1) 8. eval_easy1_bb1_in(v_0,v_x_0) -> eval_easy1_bb2_in(v_0,v_x_0) [v_x_0 >= 0 && 39 >= v_x_0] (?,1) 9. eval_easy1_bb1_in(v_0,v_x_0) -> eval_easy1_bb3_in(v_0,v_x_0) [v_x_0 >= 0 && v_x_0 >= 40] (?,1) 10. eval_easy1_bb2_in(v_0,v_x_0) -> eval_easy1_bb1_in(v_0,1 + v_x_0) [39 + -1*v_x_0 >= 0 && v_x_0 >= 0 && v_0 = 0] (?,1) 11. eval_easy1_bb2_in(v_0,v_x_0) -> eval_easy1_bb1_in(v_0,2 + v_x_0) [39 + -1*v_x_0 >= 0 && v_x_0 >= 0 && -1 >= v_0] (?,1) 12. eval_easy1_bb2_in(v_0,v_x_0) -> eval_easy1_bb1_in(v_0,2 + v_x_0) [39 + -1*v_x_0 >= 0 && v_x_0 >= 0 && -1 + v_0 >= 0] (?,1) 13. eval_easy1_bb3_in(v_0,v_x_0) -> eval_easy1_stop(v_0,v_x_0) [-40 + v_x_0 >= 0] (?,1) 14. eval_easy1_bb3_in(v_0,v_x_0) -> exitus616(v_0,v_x_0) True (?,1) Signature: {(eval_easy1_1,2) ;(eval_easy1_2,2) ;(eval_easy1_3,2) ;(eval_easy1_4,2) ;(eval_easy1_5,2) ;(eval_easy1_6,2) ;(eval_easy1_bb0_in,2) ;(eval_easy1_bb1_in,2) ;(eval_easy1_bb2_in,2) ;(eval_easy1_bb3_in,2) ;(eval_easy1_start,2) ;(eval_easy1_stop,2) ;(exitus616,2)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7},7->{8},8->{10,11,12},9->{13,14},10->{8,9},11->{8,9} ,12->{8,9},13->{},14->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14] | `- p:[8,10,11,12] c: [12] | `- p:[8,10,11] c: [11] | `- p:[8,10] c: [10]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 7: FlowAbstraction WORST_CASE(?,O(1)) + Considered Problem: Program: Domain: [v_0,v_x_0,0.0,0.0.0,0.0.0.0] eval_easy1_start ~> eval_easy1_bb0_in [v_0 <= v_0, v_x_0 <= v_x_0] eval_easy1_bb0_in ~> eval_easy1_1 [v_0 <= unknown, v_x_0 <= v_x_0] eval_easy1_1 ~> eval_easy1_2 [v_0 <= v_0, v_x_0 <= v_x_0] eval_easy1_2 ~> eval_easy1_3 [v_0 <= v_0, v_x_0 <= v_x_0] eval_easy1_3 ~> eval_easy1_4 [v_0 <= v_0, v_x_0 <= v_x_0] eval_easy1_4 ~> eval_easy1_5 [v_0 <= v_0, v_x_0 <= v_x_0] eval_easy1_5 ~> eval_easy1_6 [v_0 <= v_0, v_x_0 <= v_x_0] eval_easy1_6 ~> eval_easy1_bb1_in [v_0 <= v_0, v_x_0 <= 0*K] eval_easy1_bb1_in ~> eval_easy1_bb2_in [v_0 <= v_0, v_x_0 <= v_x_0] eval_easy1_bb1_in ~> eval_easy1_bb3_in [v_0 <= v_0, v_x_0 <= v_x_0] eval_easy1_bb2_in ~> eval_easy1_bb1_in [v_0 <= v_0, v_x_0 <= 40*K] eval_easy1_bb2_in ~> eval_easy1_bb1_in [v_0 <= v_0, v_x_0 <= 41*K] eval_easy1_bb2_in ~> eval_easy1_bb1_in [v_0 <= v_0, v_x_0 <= 41*K] eval_easy1_bb3_in ~> eval_easy1_stop [v_0 <= v_0, v_x_0 <= v_x_0] eval_easy1_bb3_in ~> exitus616 [v_0 <= v_0, v_x_0 <= v_x_0] + Loop: [0.0 <= 41*K + v_x_0] eval_easy1_bb1_in ~> eval_easy1_bb2_in [v_0 <= v_0, v_x_0 <= v_x_0] eval_easy1_bb2_in ~> eval_easy1_bb1_in [v_0 <= v_0, v_x_0 <= 40*K] eval_easy1_bb2_in ~> eval_easy1_bb1_in [v_0 <= v_0, v_x_0 <= 41*K] eval_easy1_bb2_in ~> eval_easy1_bb1_in [v_0 <= v_0, v_x_0 <= 41*K] + Loop: [0.0.0 <= 41*K + v_x_0] eval_easy1_bb1_in ~> eval_easy1_bb2_in [v_0 <= v_0, v_x_0 <= v_x_0] eval_easy1_bb2_in ~> eval_easy1_bb1_in [v_0 <= v_0, v_x_0 <= 40*K] eval_easy1_bb2_in ~> eval_easy1_bb1_in [v_0 <= v_0, v_x_0 <= 41*K] + Loop: [0.0.0.0 <= 40*K + v_x_0] eval_easy1_bb1_in ~> eval_easy1_bb2_in [v_0 <= v_0, v_x_0 <= v_x_0] eval_easy1_bb2_in ~> eval_easy1_bb1_in [v_0 <= v_0, v_x_0 <= 40*K] + Applied Processor: FlowAbstraction + Details: () * Step 8: LareProcessor WORST_CASE(?,O(1)) + Considered Problem: Program: Domain: [tick,huge,K,v_0,v_x_0,0.0,0.0.0,0.0.0.0] eval_easy1_start ~> eval_easy1_bb0_in [] eval_easy1_bb0_in ~> eval_easy1_1 [huge ~=> v_0] eval_easy1_1 ~> eval_easy1_2 [] eval_easy1_2 ~> eval_easy1_3 [] eval_easy1_3 ~> eval_easy1_4 [] eval_easy1_4 ~> eval_easy1_5 [] eval_easy1_5 ~> eval_easy1_6 [] eval_easy1_6 ~> eval_easy1_bb1_in [K ~=> v_x_0] eval_easy1_bb1_in ~> eval_easy1_bb2_in [] eval_easy1_bb1_in ~> eval_easy1_bb3_in [] eval_easy1_bb2_in ~> eval_easy1_bb1_in [K ~=> v_x_0] eval_easy1_bb2_in ~> eval_easy1_bb1_in [K ~=> v_x_0] eval_easy1_bb2_in ~> eval_easy1_bb1_in [K ~=> v_x_0] eval_easy1_bb3_in ~> eval_easy1_stop [] eval_easy1_bb3_in ~> exitus616 [] + Loop: [v_x_0 ~+> 0.0,K ~*> 0.0] eval_easy1_bb1_in ~> eval_easy1_bb2_in [] eval_easy1_bb2_in ~> eval_easy1_bb1_in [K ~=> v_x_0] eval_easy1_bb2_in ~> eval_easy1_bb1_in [K ~=> v_x_0] eval_easy1_bb2_in ~> eval_easy1_bb1_in [K ~=> v_x_0] + Loop: [v_x_0 ~+> 0.0.0,K ~*> 0.0.0] eval_easy1_bb1_in ~> eval_easy1_bb2_in [] eval_easy1_bb2_in ~> eval_easy1_bb1_in [K ~=> v_x_0] eval_easy1_bb2_in ~> eval_easy1_bb1_in [K ~=> v_x_0] + Loop: [v_x_0 ~+> 0.0.0.0,K ~*> 0.0.0.0] eval_easy1_bb1_in ~> eval_easy1_bb2_in [] eval_easy1_bb2_in ~> eval_easy1_bb1_in [K ~=> v_x_0] + Applied Processor: LareProcessor + Details: eval_easy1_start ~> exitus616 [K ~=> v_x_0 ,huge ~=> v_0 ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> tick ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> 0.0.0.0 ,K ~*> tick] eval_easy1_start ~> eval_easy1_stop [K ~=> v_x_0 ,huge ~=> v_0 ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> tick ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> 0.0.0.0 ,K ~*> tick] eval_easy1_start ~> eval_easy1_bb2_in [K ~=> v_x_0 ,huge ~=> v_0 ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> tick ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> 0.0.0.0 ,K ~*> tick] + eval_easy1_bb2_in [K ~=> v_x_0 ,v_x_0 ~+> 0.0 ,v_x_0 ~+> 0.0.0 ,v_x_0 ~+> 0.0.0.0 ,v_x_0 ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> tick ,v_x_0 ~*> tick ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> 0.0.0.0 ,K ~*> tick] eval_easy1_bb1_in> [K ~=> v_x_0 ,v_x_0 ~+> 0.0 ,v_x_0 ~+> 0.0.0 ,v_x_0 ~+> 0.0.0.0 ,v_x_0 ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> tick ,v_x_0 ~*> tick ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> 0.0.0.0 ,K ~*> tick] + eval_easy1_bb2_in [K ~=> v_x_0 ,v_x_0 ~+> 0.0.0 ,v_x_0 ~+> 0.0.0.0 ,v_x_0 ~+> tick ,tick ~+> tick ,K ~+> 0.0.0.0 ,K ~+> tick ,v_x_0 ~*> tick ,K ~*> 0.0.0 ,K ~*> 0.0.0.0 ,K ~*> tick] eval_easy1_bb1_in> [K ~=> v_x_0 ,v_x_0 ~+> 0.0.0 ,v_x_0 ~+> 0.0.0.0 ,v_x_0 ~+> tick ,tick ~+> tick ,K ~+> 0.0.0.0 ,K ~+> tick ,v_x_0 ~*> tick ,K ~*> 0.0.0 ,K ~*> 0.0.0.0 ,K ~*> tick] + eval_easy1_bb2_in> [K ~=> v_x_0 ,v_x_0 ~+> 0.0.0.0 ,v_x_0 ~+> tick ,tick ~+> tick ,K ~*> 0.0.0.0 ,K ~*> tick] eval_easy1_bb1_in> [K ~=> v_x_0 ,v_x_0 ~+> 0.0.0.0 ,v_x_0 ~+> tick ,tick ~+> tick ,K ~*> 0.0.0.0 ,K ~*> tick] YES(?,O(1))