YES * Step 1: UnsatRules YES + Considered Problem: Rules: 0. eval_start_start(v__0,v_flag_0,v_n) -> eval_start_bb0_in(v__0,v_flag_0,v_n) True (1,1) 1. eval_start_bb0_in(v__0,v_flag_0,v_n) -> eval_start_0(v__0,v_flag_0,v_n) True (?,1) 2. eval_start_0(v__0,v_flag_0,v_n) -> eval_start_1(v__0,v_flag_0,v_n) True (?,1) 3. eval_start_1(v__0,v_flag_0,v_n) -> eval_start_2(v__0,v_flag_0,v_n) True (?,1) 4. eval_start_2(v__0,v_flag_0,v_n) -> eval_start_3(v__0,v_flag_0,v_n) True (?,1) 5. eval_start_3(v__0,v_flag_0,v_n) -> eval_start_4(v__0,v_flag_0,v_n) True (?,1) 6. eval_start_4(v__0,v_flag_0,v_n) -> eval_start_5(v__0,v_flag_0,v_n) True (?,1) 7. eval_start_5(v__0,v_flag_0,v_n) -> eval_start_bb1_in(v_n,1,v_n) True (?,1) 8. eval_start_bb1_in(v__0,v_flag_0,v_n) -> eval_start_bb2_in(v__0,v_flag_0,v_n) [-1 + v_flag_0 >= 0] (?,1) 9. eval_start_bb1_in(v__0,v_flag_0,v_n) -> eval_start_bb3_in(v__0,v_flag_0,v_n) [0 >= v_flag_0] (?,1) 10. eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(-1 + v__0,1,v_n) [-1 + v__0 >= 0 && -1 + v__0 >= 0] (?,1) 11. eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(v__0,1,v_n) [-1 + v__0 >= 0 && 0 >= v__0] (?,1) 12. eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(-1 + v__0,0,v_n) [0 >= v__0 && -1 + v__0 >= 0] (?,1) 13. eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(v__0,0,v_n) [0 >= v__0 && 0 >= v__0] (?,1) 14. eval_start_bb3_in(v__0,v_flag_0,v_n) -> eval_start_stop(v__0,v_flag_0,v_n) True (?,1) 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_bb0_in,3) ;(eval_start_bb1_in,3) ;(eval_start_bb2_in,3) ;(eval_start_bb3_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,9},8->{10,11,12,13},9->{14},10->{8,9},11->{8,9} ,12->{8,9},13->{8,9},14->{}] + Applied Processor: UnsatRules + Details: Following transitions have unsatisfiable constraints and are removed: [11,12] * Step 2: UnsatPaths YES + Considered Problem: Rules: 0. eval_start_start(v__0,v_flag_0,v_n) -> eval_start_bb0_in(v__0,v_flag_0,v_n) True (1,1) 1. eval_start_bb0_in(v__0,v_flag_0,v_n) -> eval_start_0(v__0,v_flag_0,v_n) True (?,1) 2. eval_start_0(v__0,v_flag_0,v_n) -> eval_start_1(v__0,v_flag_0,v_n) True (?,1) 3. eval_start_1(v__0,v_flag_0,v_n) -> eval_start_2(v__0,v_flag_0,v_n) True (?,1) 4. eval_start_2(v__0,v_flag_0,v_n) -> eval_start_3(v__0,v_flag_0,v_n) True (?,1) 5. eval_start_3(v__0,v_flag_0,v_n) -> eval_start_4(v__0,v_flag_0,v_n) True (?,1) 6. eval_start_4(v__0,v_flag_0,v_n) -> eval_start_5(v__0,v_flag_0,v_n) True (?,1) 7. eval_start_5(v__0,v_flag_0,v_n) -> eval_start_bb1_in(v_n,1,v_n) True (?,1) 8. eval_start_bb1_in(v__0,v_flag_0,v_n) -> eval_start_bb2_in(v__0,v_flag_0,v_n) [-1 + v_flag_0 >= 0] (?,1) 9. eval_start_bb1_in(v__0,v_flag_0,v_n) -> eval_start_bb3_in(v__0,v_flag_0,v_n) [0 >= v_flag_0] (?,1) 10. eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(-1 + v__0,1,v_n) [-1 + v__0 >= 0 && -1 + v__0 >= 0] (?,1) 13. eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(v__0,0,v_n) [0 >= v__0 && 0 >= v__0] (?,1) 14. eval_start_bb3_in(v__0,v_flag_0,v_n) -> eval_start_stop(v__0,v_flag_0,v_n) True (?,1) 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_bb0_in,3) ;(eval_start_bb1_in,3) ;(eval_start_bb2_in,3) ;(eval_start_bb3_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,9},8->{10,13},9->{14},10->{8,9},13->{8,9},14->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(7,9),(10,9),(13,8)] * Step 3: FromIts YES + Considered Problem: Rules: 0. eval_start_start(v__0,v_flag_0,v_n) -> eval_start_bb0_in(v__0,v_flag_0,v_n) True (1,1) 1. eval_start_bb0_in(v__0,v_flag_0,v_n) -> eval_start_0(v__0,v_flag_0,v_n) True (?,1) 2. eval_start_0(v__0,v_flag_0,v_n) -> eval_start_1(v__0,v_flag_0,v_n) True (?,1) 3. eval_start_1(v__0,v_flag_0,v_n) -> eval_start_2(v__0,v_flag_0,v_n) True (?,1) 4. eval_start_2(v__0,v_flag_0,v_n) -> eval_start_3(v__0,v_flag_0,v_n) True (?,1) 5. eval_start_3(v__0,v_flag_0,v_n) -> eval_start_4(v__0,v_flag_0,v_n) True (?,1) 6. eval_start_4(v__0,v_flag_0,v_n) -> eval_start_5(v__0,v_flag_0,v_n) True (?,1) 7. eval_start_5(v__0,v_flag_0,v_n) -> eval_start_bb1_in(v_n,1,v_n) True (?,1) 8. eval_start_bb1_in(v__0,v_flag_0,v_n) -> eval_start_bb2_in(v__0,v_flag_0,v_n) [-1 + v_flag_0 >= 0] (?,1) 9. eval_start_bb1_in(v__0,v_flag_0,v_n) -> eval_start_bb3_in(v__0,v_flag_0,v_n) [0 >= v_flag_0] (?,1) 10. eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(-1 + v__0,1,v_n) [-1 + v__0 >= 0 && -1 + v__0 >= 0] (?,1) 13. eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(v__0,0,v_n) [0 >= v__0 && 0 >= v__0] (?,1) 14. eval_start_bb3_in(v__0,v_flag_0,v_n) -> eval_start_stop(v__0,v_flag_0,v_n) True (?,1) 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_bb0_in,3) ;(eval_start_bb1_in,3) ;(eval_start_bb2_in,3) ;(eval_start_bb3_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->{10,13},9->{14},10->{8},13->{9},14->{}] + Applied Processor: FromIts + Details: () * Step 4: Decompose YES + Considered Problem: Rules: eval_start_start(v__0,v_flag_0,v_n) -> eval_start_bb0_in(v__0,v_flag_0,v_n) True eval_start_bb0_in(v__0,v_flag_0,v_n) -> eval_start_0(v__0,v_flag_0,v_n) True eval_start_0(v__0,v_flag_0,v_n) -> eval_start_1(v__0,v_flag_0,v_n) True eval_start_1(v__0,v_flag_0,v_n) -> eval_start_2(v__0,v_flag_0,v_n) True eval_start_2(v__0,v_flag_0,v_n) -> eval_start_3(v__0,v_flag_0,v_n) True eval_start_3(v__0,v_flag_0,v_n) -> eval_start_4(v__0,v_flag_0,v_n) True eval_start_4(v__0,v_flag_0,v_n) -> eval_start_5(v__0,v_flag_0,v_n) True eval_start_5(v__0,v_flag_0,v_n) -> eval_start_bb1_in(v_n,1,v_n) True eval_start_bb1_in(v__0,v_flag_0,v_n) -> eval_start_bb2_in(v__0,v_flag_0,v_n) [-1 + v_flag_0 >= 0] eval_start_bb1_in(v__0,v_flag_0,v_n) -> eval_start_bb3_in(v__0,v_flag_0,v_n) [0 >= v_flag_0] eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(-1 + v__0,1,v_n) [-1 + v__0 >= 0 && -1 + v__0 >= 0] eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(v__0,0,v_n) [0 >= v__0 && 0 >= v__0] eval_start_bb3_in(v__0,v_flag_0,v_n) -> eval_start_stop(v__0,v_flag_0,v_n) 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_bb0_in,3) ;(eval_start_bb1_in,3) ;(eval_start_bb2_in,3) ;(eval_start_bb3_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->{10,13},9->{14},10->{8},13->{9},14->{}] + Applied Processor: Decompose NoGreedy + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,13,14] | `- p:[8,10] c: [8,10] * Step 5: CloseWith YES + Considered Problem: (Rules: eval_start_start(v__0,v_flag_0,v_n) -> eval_start_bb0_in(v__0,v_flag_0,v_n) True eval_start_bb0_in(v__0,v_flag_0,v_n) -> eval_start_0(v__0,v_flag_0,v_n) True eval_start_0(v__0,v_flag_0,v_n) -> eval_start_1(v__0,v_flag_0,v_n) True eval_start_1(v__0,v_flag_0,v_n) -> eval_start_2(v__0,v_flag_0,v_n) True eval_start_2(v__0,v_flag_0,v_n) -> eval_start_3(v__0,v_flag_0,v_n) True eval_start_3(v__0,v_flag_0,v_n) -> eval_start_4(v__0,v_flag_0,v_n) True eval_start_4(v__0,v_flag_0,v_n) -> eval_start_5(v__0,v_flag_0,v_n) True eval_start_5(v__0,v_flag_0,v_n) -> eval_start_bb1_in(v_n,1,v_n) True eval_start_bb1_in(v__0,v_flag_0,v_n) -> eval_start_bb2_in(v__0,v_flag_0,v_n) [-1 + v_flag_0 >= 0] eval_start_bb1_in(v__0,v_flag_0,v_n) -> eval_start_bb3_in(v__0,v_flag_0,v_n) [0 >= v_flag_0] eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(-1 + v__0,1,v_n) [-1 + v__0 >= 0 && -1 + v__0 >= 0] eval_start_bb2_in(v__0,v_flag_0,v_n) -> eval_start_bb1_in(v__0,0,v_n) [0 >= v__0 && 0 >= v__0] eval_start_bb3_in(v__0,v_flag_0,v_n) -> eval_start_stop(v__0,v_flag_0,v_n) 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_bb0_in,3) ;(eval_start_bb1_in,3) ;(eval_start_bb2_in,3) ;(eval_start_bb3_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->{10,13},9->{14},10->{8},13->{9},14->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,13,14] | `- p:[8,10] c: [8,10]) + Applied Processor: CloseWith True + Details: () YES