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