YES * Step 1: FromIts YES + Considered Problem: Rules: 0. eval_start_start(v__0,v__1,v_y,v_z) -> eval_start_bb0_in(v__0,v__1,v_y,v_z) True (1,1) 1. eval_start_bb0_in(v__0,v__1,v_y,v_z) -> eval_start_0(v__0,v__1,v_y,v_z) True (?,1) 2. eval_start_0(v__0,v__1,v_y,v_z) -> eval_start_1(v__0,v__1,v_y,v_z) True (?,1) 3. eval_start_1(v__0,v__1,v_y,v_z) -> eval_start_2(v__0,v__1,v_y,v_z) True (?,1) 4. eval_start_2(v__0,v__1,v_y,v_z) -> eval_start_3(v__0,v__1,v_y,v_z) True (?,1) 5. eval_start_3(v__0,v__1,v_y,v_z) -> eval_start_bb1_in(v_y,v__1,v_y,v_z) True (?,1) 6. eval_start_bb1_in(v__0,v__1,v_y,v_z) -> eval_start_bb2_in(v__0,v__1,v_y,v_z) [-1 + v_z >= v__0] (?,1) 7. eval_start_bb1_in(v__0,v__1,v_y,v_z) -> eval_start_bb3_in(v__0,v__0,v_y,v_z) [v__0 >= v_z] (?,1) 8. eval_start_bb2_in(v__0,v__1,v_y,v_z) -> eval_start_bb1_in(1 + v__0,v__1,v_y,v_z) True (?,1) 9. eval_start_bb3_in(v__0,v__1,v_y,v_z) -> eval_start_bb4_in(v__0,v__1,v_y,v_z) [-1 + v__1 >= 2] (?,1) 10. eval_start_bb3_in(v__0,v__1,v_y,v_z) -> eval_start_bb5_in(v__0,v__1,v_y,v_z) [2 >= v__1] (?,1) 11. eval_start_bb4_in(v__0,v__1,v_y,v_z) -> eval_start_bb3_in(v__0,-3 + v__1,v_y,v_z) True (?,1) 12. eval_start_bb5_in(v__0,v__1,v_y,v_z) -> eval_start_stop(v__0,v__1,v_y,v_z) True (?,1) Signature: {(eval_start_0,4) ;(eval_start_1,4) ;(eval_start_2,4) ;(eval_start_3,4) ;(eval_start_bb0_in,4) ;(eval_start_bb1_in,4) ;(eval_start_bb2_in,4) ;(eval_start_bb3_in,4) ;(eval_start_bb4_in,4) ;(eval_start_bb5_in,4) ;(eval_start_start,4) ;(eval_start_stop,4)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6,7},6->{8},7->{9,10},8->{6,7},9->{11},10->{12},11->{9,10},12->{}] + Applied Processor: FromIts + Details: () * Step 2: Decompose YES + Considered Problem: Rules: eval_start_start(v__0,v__1,v_y,v_z) -> eval_start_bb0_in(v__0,v__1,v_y,v_z) True eval_start_bb0_in(v__0,v__1,v_y,v_z) -> eval_start_0(v__0,v__1,v_y,v_z) True eval_start_0(v__0,v__1,v_y,v_z) -> eval_start_1(v__0,v__1,v_y,v_z) True eval_start_1(v__0,v__1,v_y,v_z) -> eval_start_2(v__0,v__1,v_y,v_z) True eval_start_2(v__0,v__1,v_y,v_z) -> eval_start_3(v__0,v__1,v_y,v_z) True eval_start_3(v__0,v__1,v_y,v_z) -> eval_start_bb1_in(v_y,v__1,v_y,v_z) True eval_start_bb1_in(v__0,v__1,v_y,v_z) -> eval_start_bb2_in(v__0,v__1,v_y,v_z) [-1 + v_z >= v__0] eval_start_bb1_in(v__0,v__1,v_y,v_z) -> eval_start_bb3_in(v__0,v__0,v_y,v_z) [v__0 >= v_z] eval_start_bb2_in(v__0,v__1,v_y,v_z) -> eval_start_bb1_in(1 + v__0,v__1,v_y,v_z) True eval_start_bb3_in(v__0,v__1,v_y,v_z) -> eval_start_bb4_in(v__0,v__1,v_y,v_z) [-1 + v__1 >= 2] eval_start_bb3_in(v__0,v__1,v_y,v_z) -> eval_start_bb5_in(v__0,v__1,v_y,v_z) [2 >= v__1] eval_start_bb4_in(v__0,v__1,v_y,v_z) -> eval_start_bb3_in(v__0,-3 + v__1,v_y,v_z) True eval_start_bb5_in(v__0,v__1,v_y,v_z) -> eval_start_stop(v__0,v__1,v_y,v_z) True Signature: {(eval_start_0,4) ;(eval_start_1,4) ;(eval_start_2,4) ;(eval_start_3,4) ;(eval_start_bb0_in,4) ;(eval_start_bb1_in,4) ;(eval_start_bb2_in,4) ;(eval_start_bb3_in,4) ;(eval_start_bb4_in,4) ;(eval_start_bb5_in,4) ;(eval_start_start,4) ;(eval_start_stop,4)} Rule Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6,7},6->{8},7->{9,10},8->{6,7},9->{11},10->{12},11->{9,10},12->{}] + Applied Processor: Decompose NoGreedy + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12] | +- p:[6,8] c: [6,8] | `- p:[9,11] c: [9,11] * Step 3: CloseWith YES + Considered Problem: (Rules: eval_start_start(v__0,v__1,v_y,v_z) -> eval_start_bb0_in(v__0,v__1,v_y,v_z) True eval_start_bb0_in(v__0,v__1,v_y,v_z) -> eval_start_0(v__0,v__1,v_y,v_z) True eval_start_0(v__0,v__1,v_y,v_z) -> eval_start_1(v__0,v__1,v_y,v_z) True eval_start_1(v__0,v__1,v_y,v_z) -> eval_start_2(v__0,v__1,v_y,v_z) True eval_start_2(v__0,v__1,v_y,v_z) -> eval_start_3(v__0,v__1,v_y,v_z) True eval_start_3(v__0,v__1,v_y,v_z) -> eval_start_bb1_in(v_y,v__1,v_y,v_z) True eval_start_bb1_in(v__0,v__1,v_y,v_z) -> eval_start_bb2_in(v__0,v__1,v_y,v_z) [-1 + v_z >= v__0] eval_start_bb1_in(v__0,v__1,v_y,v_z) -> eval_start_bb3_in(v__0,v__0,v_y,v_z) [v__0 >= v_z] eval_start_bb2_in(v__0,v__1,v_y,v_z) -> eval_start_bb1_in(1 + v__0,v__1,v_y,v_z) True eval_start_bb3_in(v__0,v__1,v_y,v_z) -> eval_start_bb4_in(v__0,v__1,v_y,v_z) [-1 + v__1 >= 2] eval_start_bb3_in(v__0,v__1,v_y,v_z) -> eval_start_bb5_in(v__0,v__1,v_y,v_z) [2 >= v__1] eval_start_bb4_in(v__0,v__1,v_y,v_z) -> eval_start_bb3_in(v__0,-3 + v__1,v_y,v_z) True eval_start_bb5_in(v__0,v__1,v_y,v_z) -> eval_start_stop(v__0,v__1,v_y,v_z) True Signature: {(eval_start_0,4) ;(eval_start_1,4) ;(eval_start_2,4) ;(eval_start_3,4) ;(eval_start_bb0_in,4) ;(eval_start_bb1_in,4) ;(eval_start_bb2_in,4) ;(eval_start_bb3_in,4) ;(eval_start_bb4_in,4) ;(eval_start_bb5_in,4) ;(eval_start_start,4) ;(eval_start_stop,4)} Rule Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6,7},6->{8},7->{9,10},8->{6,7},9->{11},10->{12},11->{9,10},12->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12] | +- p:[6,8] c: [6,8] | `- p:[9,11] c: [9,11]) + Applied Processor: CloseWith True + Details: () YES