YES * Step 1: UnsatRules YES + Considered Problem: Rules: 0. eval_realheapsort_step1_start(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb0_in(v_33,v_N,v_j_0,v_k_0) True (1,1) 1. eval_realheapsort_step1_bb0_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_0(v_33,v_N,v_j_0,v_k_0) True (?,1) 2. eval_realheapsort_step1_0(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_1(v_33,v_N,v_j_0,v_k_0) True (?,1) 3. eval_realheapsort_step1_1(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_2(v_33,v_N,v_j_0,v_k_0) True (?,1) 4. eval_realheapsort_step1_2(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb1_in(v_33,v_N,v_j_0,1) [-1 + v_N >= 2] (?,1) 5. eval_realheapsort_step1_2(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb5_in(v_33,v_N,v_j_0,v_k_0) [2 >= v_N] (?,1) 6. eval_realheapsort_step1_bb1_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,v_k_0,v_k_0) [-1 + v_N >= v_k_0] (?,1) 7. eval_realheapsort_step1_bb1_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb5_in(v_33,v_N,v_j_0,v_k_0) [-1 + v_k_0 >= -1 + v_N] (?,1) 8. eval_realheapsort_step1_bb2_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0,v_k_0) [-1 + v_j_0 >= 0] (?,1) 9. eval_realheapsort_step1_bb2_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1__critedge_in(v_33,v_N,v_j_0,v_k_0) [0 >= v_j_0] (?,1) 10. eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) [1 + v_j_0 = 0 && nondef_0 = 0] (?,1) 11. eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) [v_j_0 >= 0 && nondef_0 >= 0 && 1 + -2*nondef_0 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_0 + v_j_0] (?,1) 12. eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) [-1 >= 1 + v_j_0 && 0 >= nondef_0 && -1 + 2*nondef_0 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_0 + -1*v_j_0] (?,1) 13. eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1__critedge_in(v_33,v_N,v_j_0,v_k_0) [1 + v_j_0 = 0 && nondef_0 = 0] (?,1) 14. eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1__critedge_in(v_33,v_N,v_j_0,v_k_0) [v_j_0 >= 0 && nondef_0 >= 0 && 1 + -2*nondef_0 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_0 + v_j_0] (?,1) 15. eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1__critedge_in(v_33,v_N,v_j_0,v_k_0) [-1 >= 1 + v_j_0 && 0 >= nondef_0 && -1 + 2*nondef_0 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_0 + -1*v_j_0] (?,1) 16. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [1 + v_j_0 = 0 && nondef_1 = 0 && 1 + v_j_0 = 0 && nondef_2 = 0 && 1 + v_j_0 = 0 && nondef_3 = 0] (?,1) 17. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [1 + v_j_0 = 0 (?,1) && nondef_1 = 0 && 1 + v_j_0 = 0 && nondef_2 = 0 && v_j_0 >= 0 && nondef_3 >= 0 && 1 + -2*nondef_3 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_3 + v_j_0] 18. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [1 + v_j_0 = 0 (?,1) && nondef_1 = 0 && 1 + v_j_0 = 0 && nondef_2 = 0 && -1 >= 1 + v_j_0 && 0 >= nondef_3 && -1 + 2*nondef_3 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_3 + -1*v_j_0] 19. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [1 + v_j_0 = 0 (?,1) && nondef_1 = 0 && v_j_0 >= 0 && nondef_2 >= 0 && 1 + -2*nondef_2 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_2 + v_j_0 && 1 + v_j_0 = 0 && nondef_3 = 0] 20. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [1 + v_j_0 = 0 (?,1) && nondef_1 = 0 && v_j_0 >= 0 && nondef_2 >= 0 && 1 + -2*nondef_2 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_2 + v_j_0 && v_j_0 >= 0 && nondef_3 >= 0 && 1 + -2*nondef_3 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_3 + v_j_0] 21. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [1 + v_j_0 = 0 (?,1) && nondef_1 = 0 && v_j_0 >= 0 && nondef_2 >= 0 && 1 + -2*nondef_2 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_2 + v_j_0 && -1 >= 1 + v_j_0 && 0 >= nondef_3 && -1 + 2*nondef_3 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_3 + -1*v_j_0] 22. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [1 + v_j_0 = 0 (?,1) && nondef_1 = 0 && -1 >= 1 + v_j_0 && 0 >= nondef_2 && -1 + 2*nondef_2 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_2 + -1*v_j_0 && 1 + v_j_0 = 0 && nondef_3 = 0] 23. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [1 + v_j_0 = 0 (?,1) && nondef_1 = 0 && -1 >= 1 + v_j_0 && 0 >= nondef_2 && -1 + 2*nondef_2 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_2 + -1*v_j_0 && v_j_0 >= 0 && nondef_3 >= 0 && 1 + -2*nondef_3 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_3 + v_j_0] 24. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [1 + v_j_0 = 0 (?,1) && nondef_1 = 0 && -1 >= 1 + v_j_0 && 0 >= nondef_2 && -1 + 2*nondef_2 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_2 + -1*v_j_0 && -1 >= 1 + v_j_0 && 0 >= nondef_3 && -1 + 2*nondef_3 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_3 + -1*v_j_0] 25. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [v_j_0 >= 0 (?,1) && nondef_1 >= 0 && 1 + -2*nondef_1 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_1 + v_j_0 && 1 + v_j_0 = 0 && nondef_2 = 0 && 1 + v_j_0 = 0 && nondef_3 = 0] 26. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [v_j_0 >= 0 (?,1) && nondef_1 >= 0 && 1 + -2*nondef_1 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_1 + v_j_0 && 1 + v_j_0 = 0 && nondef_2 = 0 && v_j_0 >= 0 && nondef_3 >= 0 && 1 + -2*nondef_3 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_3 + v_j_0] 27. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [v_j_0 >= 0 (?,1) && nondef_1 >= 0 && 1 + -2*nondef_1 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_1 + v_j_0 && 1 + v_j_0 = 0 && nondef_2 = 0 && -1 >= 1 + v_j_0 && 0 >= nondef_3 && -1 + 2*nondef_3 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_3 + -1*v_j_0] 28. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [v_j_0 >= 0 (?,1) && nondef_1 >= 0 && 1 + -2*nondef_1 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_1 + v_j_0 && v_j_0 >= 0 && nondef_2 >= 0 && 1 + -2*nondef_2 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_2 + v_j_0 && 1 + v_j_0 = 0 && nondef_3 = 0] 29. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [v_j_0 >= 0 (?,1) && nondef_1 >= 0 && 1 + -2*nondef_1 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_1 + v_j_0 && v_j_0 >= 0 && nondef_2 >= 0 && 1 + -2*nondef_2 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_2 + v_j_0 && v_j_0 >= 0 && nondef_3 >= 0 && 1 + -2*nondef_3 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_3 + v_j_0] 30. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [v_j_0 >= 0 (?,1) && nondef_1 >= 0 && 1 + -2*nondef_1 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_1 + v_j_0 && v_j_0 >= 0 && nondef_2 >= 0 && 1 + -2*nondef_2 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_2 + v_j_0 && -1 >= 1 + v_j_0 && 0 >= nondef_3 && -1 + 2*nondef_3 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_3 + -1*v_j_0] 31. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [v_j_0 >= 0 (?,1) && nondef_1 >= 0 && 1 + -2*nondef_1 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_1 + v_j_0 && -1 >= 1 + v_j_0 && 0 >= nondef_2 && -1 + 2*nondef_2 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_2 + -1*v_j_0 && 1 + v_j_0 = 0 && nondef_3 = 0] 32. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [v_j_0 >= 0 (?,1) && nondef_1 >= 0 && 1 + -2*nondef_1 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_1 + v_j_0 && -1 >= 1 + v_j_0 && 0 >= nondef_2 && -1 + 2*nondef_2 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_2 + -1*v_j_0 && v_j_0 >= 0 && nondef_3 >= 0 && 1 + -2*nondef_3 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_3 + v_j_0] 33. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [v_j_0 >= 0 (?,1) && nondef_1 >= 0 && 1 + -2*nondef_1 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_1 + v_j_0 && -1 >= 1 + v_j_0 && 0 >= nondef_2 && -1 + 2*nondef_2 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_2 + -1*v_j_0 && -1 >= 1 + v_j_0 && 0 >= nondef_3 && -1 + 2*nondef_3 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_3 + -1*v_j_0] 34. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [-1 >= 1 + v_j_0 (?,1) && 0 >= nondef_1 && -1 + 2*nondef_1 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_1 + -1*v_j_0 && 1 + v_j_0 = 0 && nondef_2 = 0 && 1 + v_j_0 = 0 && nondef_3 = 0] 35. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [-1 >= 1 + v_j_0 (?,1) && 0 >= nondef_1 && -1 + 2*nondef_1 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_1 + -1*v_j_0 && 1 + v_j_0 = 0 && nondef_2 = 0 && v_j_0 >= 0 && nondef_3 >= 0 && 1 + -2*nondef_3 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_3 + v_j_0] 36. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [-1 >= 1 + v_j_0 (?,1) && 0 >= nondef_1 && -1 + 2*nondef_1 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_1 + -1*v_j_0 && 1 + v_j_0 = 0 && nondef_2 = 0 && -1 >= 1 + v_j_0 && 0 >= nondef_3 && -1 + 2*nondef_3 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_3 + -1*v_j_0] 37. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [-1 >= 1 + v_j_0 (?,1) && 0 >= nondef_1 && -1 + 2*nondef_1 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_1 + -1*v_j_0 && v_j_0 >= 0 && nondef_2 >= 0 && 1 + -2*nondef_2 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_2 + v_j_0 && 1 + v_j_0 = 0 && nondef_3 = 0] 38. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [-1 >= 1 + v_j_0 (?,1) && 0 >= nondef_1 && -1 + 2*nondef_1 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_1 + -1*v_j_0 && v_j_0 >= 0 && nondef_2 >= 0 && 1 + -2*nondef_2 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_2 + v_j_0 && v_j_0 >= 0 && nondef_3 >= 0 && 1 + -2*nondef_3 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_3 + v_j_0] 39. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [-1 >= 1 + v_j_0 (?,1) && 0 >= nondef_1 && -1 + 2*nondef_1 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_1 + -1*v_j_0 && v_j_0 >= 0 && nondef_2 >= 0 && 1 + -2*nondef_2 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_2 + v_j_0 && -1 >= 1 + v_j_0 && 0 >= nondef_3 && -1 + 2*nondef_3 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_3 + -1*v_j_0] 40. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [-1 >= 1 + v_j_0 (?,1) && 0 >= nondef_1 && -1 + 2*nondef_1 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_1 + -1*v_j_0 && -1 >= 1 + v_j_0 && 0 >= nondef_2 && -1 + 2*nondef_2 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_2 + -1*v_j_0 && 1 + v_j_0 = 0 && nondef_3 = 0] 41. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [-1 >= 1 + v_j_0 (?,1) && 0 >= nondef_1 && -1 + 2*nondef_1 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_1 + -1*v_j_0 && -1 >= 1 + v_j_0 && 0 >= nondef_2 && -1 + 2*nondef_2 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_2 + -1*v_j_0 && v_j_0 >= 0 && nondef_3 >= 0 && 1 + -2*nondef_3 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_3 + v_j_0] 42. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [-1 >= 1 + v_j_0 (?,1) && 0 >= nondef_1 && -1 + 2*nondef_1 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_1 + -1*v_j_0 && -1 >= 1 + v_j_0 && 0 >= nondef_2 && -1 + 2*nondef_2 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_2 + -1*v_j_0 && -1 >= 1 + v_j_0 && 0 >= nondef_3 && -1 + 2*nondef_3 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_3 + -1*v_j_0] 43. eval_realheapsort_step1__critedge_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_28(1 + v_k_0,v_N,v_j_0,v_k_0) True (?,1) 44. eval_realheapsort_step1_28(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_29(v_33,v_N,v_j_0,v_k_0) True (?,1) 45. eval_realheapsort_step1_29(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb1_in(v_33,v_N,v_j_0,v_33) True (?,1) 46. eval_realheapsort_step1_bb5_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_stop(v_33,v_N,v_j_0,v_k_0) True (?,1) Signature: {(eval_realheapsort_step1_0,4) ;(eval_realheapsort_step1_1,4) ;(eval_realheapsort_step1_2,4) ;(eval_realheapsort_step1_28,4) ;(eval_realheapsort_step1_29,4) ;(eval_realheapsort_step1__critedge_in,4) ;(eval_realheapsort_step1_bb0_in,4) ;(eval_realheapsort_step1_bb1_in,4) ;(eval_realheapsort_step1_bb2_in,4) ;(eval_realheapsort_step1_bb3_in,4) ;(eval_realheapsort_step1_bb4_in,4) ;(eval_realheapsort_step1_bb5_in,4) ;(eval_realheapsort_step1_start,4) ;(eval_realheapsort_step1_stop,4)} Flow Graph: [0->{1},1->{2},2->{3},3->{4,5},4->{6,7},5->{46},6->{8,9},7->{46},8->{10,11,12,13,14,15},9->{43},10->{16,17 ,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42},11->{16,17,18,19,20,21,22,23,24 ,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42},12->{16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31 ,32,33,34,35,36,37,38,39,40,41,42},13->{43},14->{43},15->{43},16->{8,9},17->{8,9},18->{8,9},19->{8,9},20->{8 ,9},21->{8,9},22->{8,9},23->{8,9},24->{8,9},25->{8,9},26->{8,9},27->{8,9},28->{8,9},29->{8,9},30->{8,9} ,31->{8,9},32->{8,9},33->{8,9},34->{8,9},35->{8,9},36->{8,9},37->{8,9},38->{8,9},39->{8,9},40->{8,9},41->{8 ,9},42->{8,9},43->{44},44->{45},45->{6,7},46->{}] + Applied Processor: UnsatRules + Details: Following transitions have unsatisfiable constraints and are removed: [17 ,18 ,19 ,20 ,21 ,22 ,23 ,24 ,25 ,26 ,27 ,28 ,30 ,31 ,32 ,33 ,34 ,35 ,36 ,37 ,38 ,39 ,40 ,41] * Step 2: UnsatPaths YES + Considered Problem: Rules: 0. eval_realheapsort_step1_start(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb0_in(v_33,v_N,v_j_0,v_k_0) True (1,1) 1. eval_realheapsort_step1_bb0_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_0(v_33,v_N,v_j_0,v_k_0) True (?,1) 2. eval_realheapsort_step1_0(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_1(v_33,v_N,v_j_0,v_k_0) True (?,1) 3. eval_realheapsort_step1_1(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_2(v_33,v_N,v_j_0,v_k_0) True (?,1) 4. eval_realheapsort_step1_2(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb1_in(v_33,v_N,v_j_0,1) [-1 + v_N >= 2] (?,1) 5. eval_realheapsort_step1_2(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb5_in(v_33,v_N,v_j_0,v_k_0) [2 >= v_N] (?,1) 6. eval_realheapsort_step1_bb1_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,v_k_0,v_k_0) [-1 + v_N >= v_k_0] (?,1) 7. eval_realheapsort_step1_bb1_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb5_in(v_33,v_N,v_j_0,v_k_0) [-1 + v_k_0 >= -1 + v_N] (?,1) 8. eval_realheapsort_step1_bb2_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0,v_k_0) [-1 + v_j_0 >= 0] (?,1) 9. eval_realheapsort_step1_bb2_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1__critedge_in(v_33,v_N,v_j_0,v_k_0) [0 >= v_j_0] (?,1) 10. eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) [1 + v_j_0 = 0 && nondef_0 = 0] (?,1) 11. eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) [v_j_0 >= 0 && nondef_0 >= 0 && 1 + -2*nondef_0 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_0 + v_j_0] (?,1) 12. eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) [-1 >= 1 + v_j_0 && 0 >= nondef_0 && -1 + 2*nondef_0 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_0 + -1*v_j_0] (?,1) 13. eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1__critedge_in(v_33,v_N,v_j_0,v_k_0) [1 + v_j_0 = 0 && nondef_0 = 0] (?,1) 14. eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1__critedge_in(v_33,v_N,v_j_0,v_k_0) [v_j_0 >= 0 && nondef_0 >= 0 && 1 + -2*nondef_0 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_0 + v_j_0] (?,1) 15. eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1__critedge_in(v_33,v_N,v_j_0,v_k_0) [-1 >= 1 + v_j_0 && 0 >= nondef_0 && -1 + 2*nondef_0 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_0 + -1*v_j_0] (?,1) 16. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [1 + v_j_0 = 0 && nondef_1 = 0 && 1 + v_j_0 = 0 && nondef_2 = 0 && 1 + v_j_0 = 0 && nondef_3 = 0] (?,1) 29. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [v_j_0 >= 0 (?,1) && nondef_1 >= 0 && 1 + -2*nondef_1 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_1 + v_j_0 && v_j_0 >= 0 && nondef_2 >= 0 && 1 + -2*nondef_2 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_2 + v_j_0 && v_j_0 >= 0 && nondef_3 >= 0 && 1 + -2*nondef_3 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_3 + v_j_0] 42. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [-1 >= 1 + v_j_0 (?,1) && 0 >= nondef_1 && -1 + 2*nondef_1 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_1 + -1*v_j_0 && -1 >= 1 + v_j_0 && 0 >= nondef_2 && -1 + 2*nondef_2 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_2 + -1*v_j_0 && -1 >= 1 + v_j_0 && 0 >= nondef_3 && -1 + 2*nondef_3 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_3 + -1*v_j_0] 43. eval_realheapsort_step1__critedge_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_28(1 + v_k_0,v_N,v_j_0,v_k_0) True (?,1) 44. eval_realheapsort_step1_28(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_29(v_33,v_N,v_j_0,v_k_0) True (?,1) 45. eval_realheapsort_step1_29(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb1_in(v_33,v_N,v_j_0,v_33) True (?,1) 46. eval_realheapsort_step1_bb5_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_stop(v_33,v_N,v_j_0,v_k_0) True (?,1) Signature: {(eval_realheapsort_step1_0,4) ;(eval_realheapsort_step1_1,4) ;(eval_realheapsort_step1_2,4) ;(eval_realheapsort_step1_28,4) ;(eval_realheapsort_step1_29,4) ;(eval_realheapsort_step1__critedge_in,4) ;(eval_realheapsort_step1_bb0_in,4) ;(eval_realheapsort_step1_bb1_in,4) ;(eval_realheapsort_step1_bb2_in,4) ;(eval_realheapsort_step1_bb3_in,4) ;(eval_realheapsort_step1_bb4_in,4) ;(eval_realheapsort_step1_bb5_in,4) ;(eval_realheapsort_step1_start,4) ;(eval_realheapsort_step1_stop,4)} Flow Graph: [0->{1},1->{2},2->{3},3->{4,5},4->{6,7},5->{46},6->{8,9},7->{46},8->{10,11,12,13,14,15},9->{43},10->{16,29 ,42},11->{16,29,42},12->{16,29,42},13->{43},14->{43},15->{43},16->{8,9},29->{8,9},42->{8,9},43->{44} ,44->{45},45->{6,7},46->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(4,7) ,(8,10) ,(8,12) ,(8,13) ,(8,15) ,(10,29) ,(10,42) ,(11,16) ,(11,42) ,(12,16) ,(12,29) ,(16,8) ,(42,8)] * Step 3: UnreachableRules YES + Considered Problem: Rules: 0. eval_realheapsort_step1_start(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb0_in(v_33,v_N,v_j_0,v_k_0) True (1,1) 1. eval_realheapsort_step1_bb0_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_0(v_33,v_N,v_j_0,v_k_0) True (?,1) 2. eval_realheapsort_step1_0(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_1(v_33,v_N,v_j_0,v_k_0) True (?,1) 3. eval_realheapsort_step1_1(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_2(v_33,v_N,v_j_0,v_k_0) True (?,1) 4. eval_realheapsort_step1_2(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb1_in(v_33,v_N,v_j_0,1) [-1 + v_N >= 2] (?,1) 5. eval_realheapsort_step1_2(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb5_in(v_33,v_N,v_j_0,v_k_0) [2 >= v_N] (?,1) 6. eval_realheapsort_step1_bb1_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,v_k_0,v_k_0) [-1 + v_N >= v_k_0] (?,1) 7. eval_realheapsort_step1_bb1_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb5_in(v_33,v_N,v_j_0,v_k_0) [-1 + v_k_0 >= -1 + v_N] (?,1) 8. eval_realheapsort_step1_bb2_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0,v_k_0) [-1 + v_j_0 >= 0] (?,1) 9. eval_realheapsort_step1_bb2_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1__critedge_in(v_33,v_N,v_j_0,v_k_0) [0 >= v_j_0] (?,1) 10. eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) [1 + v_j_0 = 0 && nondef_0 = 0] (?,1) 11. eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) [v_j_0 >= 0 && nondef_0 >= 0 && 1 + -2*nondef_0 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_0 + v_j_0] (?,1) 12. eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) [-1 >= 1 + v_j_0 && 0 >= nondef_0 && -1 + 2*nondef_0 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_0 + -1*v_j_0] (?,1) 13. eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1__critedge_in(v_33,v_N,v_j_0,v_k_0) [1 + v_j_0 = 0 && nondef_0 = 0] (?,1) 14. eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1__critedge_in(v_33,v_N,v_j_0,v_k_0) [v_j_0 >= 0 && nondef_0 >= 0 && 1 + -2*nondef_0 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_0 + v_j_0] (?,1) 15. eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1__critedge_in(v_33,v_N,v_j_0,v_k_0) [-1 >= 1 + v_j_0 && 0 >= nondef_0 && -1 + 2*nondef_0 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_0 + -1*v_j_0] (?,1) 16. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [1 + v_j_0 = 0 && nondef_1 = 0 && 1 + v_j_0 = 0 && nondef_2 = 0 && 1 + v_j_0 = 0 && nondef_3 = 0] (?,1) 29. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [v_j_0 >= 0 (?,1) && nondef_1 >= 0 && 1 + -2*nondef_1 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_1 + v_j_0 && v_j_0 >= 0 && nondef_2 >= 0 && 1 + -2*nondef_2 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_2 + v_j_0 && v_j_0 >= 0 && nondef_3 >= 0 && 1 + -2*nondef_3 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_3 + v_j_0] 42. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [-1 >= 1 + v_j_0 (?,1) && 0 >= nondef_1 && -1 + 2*nondef_1 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_1 + -1*v_j_0 && -1 >= 1 + v_j_0 && 0 >= nondef_2 && -1 + 2*nondef_2 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_2 + -1*v_j_0 && -1 >= 1 + v_j_0 && 0 >= nondef_3 && -1 + 2*nondef_3 + -1*v_j_0 >= 0 && 1 >= -1 + 2*nondef_3 + -1*v_j_0] 43. eval_realheapsort_step1__critedge_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_28(1 + v_k_0,v_N,v_j_0,v_k_0) True (?,1) 44. eval_realheapsort_step1_28(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_29(v_33,v_N,v_j_0,v_k_0) True (?,1) 45. eval_realheapsort_step1_29(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb1_in(v_33,v_N,v_j_0,v_33) True (?,1) 46. eval_realheapsort_step1_bb5_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_stop(v_33,v_N,v_j_0,v_k_0) True (?,1) Signature: {(eval_realheapsort_step1_0,4) ;(eval_realheapsort_step1_1,4) ;(eval_realheapsort_step1_2,4) ;(eval_realheapsort_step1_28,4) ;(eval_realheapsort_step1_29,4) ;(eval_realheapsort_step1__critedge_in,4) ;(eval_realheapsort_step1_bb0_in,4) ;(eval_realheapsort_step1_bb1_in,4) ;(eval_realheapsort_step1_bb2_in,4) ;(eval_realheapsort_step1_bb3_in,4) ;(eval_realheapsort_step1_bb4_in,4) ;(eval_realheapsort_step1_bb5_in,4) ;(eval_realheapsort_step1_start,4) ;(eval_realheapsort_step1_stop,4)} Flow Graph: [0->{1},1->{2},2->{3},3->{4,5},4->{6},5->{46},6->{8,9},7->{46},8->{11,14},9->{43},10->{16},11->{29} ,12->{42},13->{43},14->{43},15->{43},16->{9},29->{8,9},42->{9},43->{44},44->{45},45->{6,7},46->{}] + Applied Processor: UnreachableRules + Details: Following transitions are not reachable from the starting states and are revomed: [10,12,13,15,16,42] * Step 4: FromIts YES + Considered Problem: Rules: 0. eval_realheapsort_step1_start(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb0_in(v_33,v_N,v_j_0,v_k_0) True (1,1) 1. eval_realheapsort_step1_bb0_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_0(v_33,v_N,v_j_0,v_k_0) True (?,1) 2. eval_realheapsort_step1_0(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_1(v_33,v_N,v_j_0,v_k_0) True (?,1) 3. eval_realheapsort_step1_1(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_2(v_33,v_N,v_j_0,v_k_0) True (?,1) 4. eval_realheapsort_step1_2(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb1_in(v_33,v_N,v_j_0,1) [-1 + v_N >= 2] (?,1) 5. eval_realheapsort_step1_2(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb5_in(v_33,v_N,v_j_0,v_k_0) [2 >= v_N] (?,1) 6. eval_realheapsort_step1_bb1_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,v_k_0,v_k_0) [-1 + v_N >= v_k_0] (?,1) 7. eval_realheapsort_step1_bb1_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb5_in(v_33,v_N,v_j_0,v_k_0) [-1 + v_k_0 >= -1 + v_N] (?,1) 8. eval_realheapsort_step1_bb2_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0,v_k_0) [-1 + v_j_0 >= 0] (?,1) 9. eval_realheapsort_step1_bb2_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1__critedge_in(v_33,v_N,v_j_0,v_k_0) [0 >= v_j_0] (?,1) 11. eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) [v_j_0 >= 0 && nondef_0 >= 0 && 1 + -2*nondef_0 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_0 + v_j_0] (?,1) 14. eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1__critedge_in(v_33,v_N,v_j_0,v_k_0) [v_j_0 >= 0 && nondef_0 >= 0 && 1 + -2*nondef_0 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_0 + v_j_0] (?,1) 29. eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,-1 + nondef_3,v_k_0) [v_j_0 >= 0 (?,1) && nondef_1 >= 0 && 1 + -2*nondef_1 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_1 + v_j_0 && v_j_0 >= 0 && nondef_2 >= 0 && 1 + -2*nondef_2 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_2 + v_j_0 && v_j_0 >= 0 && nondef_3 >= 0 && 1 + -2*nondef_3 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_3 + v_j_0] 43. eval_realheapsort_step1__critedge_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_28(1 + v_k_0,v_N,v_j_0,v_k_0) True (?,1) 44. eval_realheapsort_step1_28(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_29(v_33,v_N,v_j_0,v_k_0) True (?,1) 45. eval_realheapsort_step1_29(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb1_in(v_33,v_N,v_j_0,v_33) True (?,1) 46. eval_realheapsort_step1_bb5_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_stop(v_33,v_N,v_j_0,v_k_0) True (?,1) Signature: {(eval_realheapsort_step1_0,4) ;(eval_realheapsort_step1_1,4) ;(eval_realheapsort_step1_2,4) ;(eval_realheapsort_step1_28,4) ;(eval_realheapsort_step1_29,4) ;(eval_realheapsort_step1__critedge_in,4) ;(eval_realheapsort_step1_bb0_in,4) ;(eval_realheapsort_step1_bb1_in,4) ;(eval_realheapsort_step1_bb2_in,4) ;(eval_realheapsort_step1_bb3_in,4) ;(eval_realheapsort_step1_bb4_in,4) ;(eval_realheapsort_step1_bb5_in,4) ;(eval_realheapsort_step1_start,4) ;(eval_realheapsort_step1_stop,4)} Flow Graph: [0->{1},1->{2},2->{3},3->{4,5},4->{6},5->{46},6->{8,9},7->{46},8->{11,14},9->{43},11->{29},14->{43},29->{8 ,9},43->{44},44->{45},45->{6,7},46->{}] + Applied Processor: FromIts + Details: () * Step 5: Decompose YES + Considered Problem: Rules: eval_realheapsort_step1_start(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb0_in(v_33,v_N ,v_j_0 ,v_k_0) True eval_realheapsort_step1_bb0_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_0(v_33,v_N,v_j_0 ,v_k_0) True eval_realheapsort_step1_0(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_1(v_33,v_N,v_j_0 ,v_k_0) True eval_realheapsort_step1_1(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_2(v_33,v_N,v_j_0 ,v_k_0) True eval_realheapsort_step1_2(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb1_in(v_33,v_N,v_j_0 ,1) [-1 + v_N >= 2] eval_realheapsort_step1_2(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb5_in(v_33,v_N,v_j_0 ,v_k_0) [2 >= v_N] eval_realheapsort_step1_bb1_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,v_k_0 ,v_k_0) [-1 + v_N >= v_k_0] eval_realheapsort_step1_bb1_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb5_in(v_33,v_N,v_j_0 ,v_k_0) [-1 + v_k_0 >= -1 + v_N] eval_realheapsort_step1_bb2_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0 ,v_k_0) [-1 + v_j_0 >= 0] eval_realheapsort_step1_bb2_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1__critedge_in(v_33,v_N ,v_j_0 ,v_k_0) [0 >= v_j_0] eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0 ,v_k_0) [v_j_0 >= 0 && nondef_0 >= 0 && 1 + -2*nondef_0 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_0 + v_j_0] eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1__critedge_in(v_33,v_N ,v_j_0 ,v_k_0) [v_j_0 >= 0 && nondef_0 >= 0 && 1 + -2*nondef_0 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_0 + v_j_0] eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N ,-1 + nondef_3 ,v_k_0) [v_j_0 >= 0 && nondef_1 >= 0 && 1 + -2*nondef_1 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_1 + v_j_0 && v_j_0 >= 0 && nondef_2 >= 0 && 1 + -2*nondef_2 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_2 + v_j_0 && v_j_0 >= 0 && nondef_3 >= 0 && 1 + -2*nondef_3 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_3 + v_j_0] eval_realheapsort_step1__critedge_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_28(1 + v_k_0,v_N ,v_j_0 ,v_k_0) True eval_realheapsort_step1_28(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_29(v_33,v_N,v_j_0 ,v_k_0) True eval_realheapsort_step1_29(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb1_in(v_33,v_N,v_j_0 ,v_33) True eval_realheapsort_step1_bb5_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_stop(v_33,v_N,v_j_0 ,v_k_0) True Signature: {(eval_realheapsort_step1_0,4) ;(eval_realheapsort_step1_1,4) ;(eval_realheapsort_step1_2,4) ;(eval_realheapsort_step1_28,4) ;(eval_realheapsort_step1_29,4) ;(eval_realheapsort_step1__critedge_in,4) ;(eval_realheapsort_step1_bb0_in,4) ;(eval_realheapsort_step1_bb1_in,4) ;(eval_realheapsort_step1_bb2_in,4) ;(eval_realheapsort_step1_bb3_in,4) ;(eval_realheapsort_step1_bb4_in,4) ;(eval_realheapsort_step1_bb5_in,4) ;(eval_realheapsort_step1_start,4) ;(eval_realheapsort_step1_stop,4)} Rule Graph: [0->{1},1->{2},2->{3},3->{4,5},4->{6},5->{46},6->{8,9},7->{46},8->{11,14},9->{43},11->{29},14->{43},29->{8 ,9},43->{44},44->{45},45->{6,7},46->{}] + Applied Processor: Decompose NoGreedy + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,11,14,29,43,44,45,46] | `- p:[6,45,44,43,9,29,11,8,14] c: [6,9,14,43,44,45] | `- p:[8,29,11] c: [8,11,29] * Step 6: CloseWith YES + Considered Problem: (Rules: eval_realheapsort_step1_start(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb0_in(v_33,v_N ,v_j_0 ,v_k_0) True eval_realheapsort_step1_bb0_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_0(v_33,v_N,v_j_0 ,v_k_0) True eval_realheapsort_step1_0(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_1(v_33,v_N,v_j_0 ,v_k_0) True eval_realheapsort_step1_1(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_2(v_33,v_N,v_j_0 ,v_k_0) True eval_realheapsort_step1_2(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb1_in(v_33,v_N,v_j_0 ,1) [-1 + v_N >= 2] eval_realheapsort_step1_2(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb5_in(v_33,v_N,v_j_0 ,v_k_0) [2 >= v_N] eval_realheapsort_step1_bb1_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N,v_k_0 ,v_k_0) [-1 + v_N >= v_k_0] eval_realheapsort_step1_bb1_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb5_in(v_33,v_N,v_j_0 ,v_k_0) [-1 + v_k_0 >= -1 + v_N] eval_realheapsort_step1_bb2_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0 ,v_k_0) [-1 + v_j_0 >= 0] eval_realheapsort_step1_bb2_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1__critedge_in(v_33,v_N ,v_j_0 ,v_k_0) [0 >= v_j_0] eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0 ,v_k_0) [v_j_0 >= 0 && nondef_0 >= 0 && 1 + -2*nondef_0 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_0 + v_j_0] eval_realheapsort_step1_bb3_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1__critedge_in(v_33,v_N ,v_j_0 ,v_k_0) [v_j_0 >= 0 && nondef_0 >= 0 && 1 + -2*nondef_0 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_0 + v_j_0] eval_realheapsort_step1_bb4_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb2_in(v_33,v_N ,-1 + nondef_3 ,v_k_0) [v_j_0 >= 0 && nondef_1 >= 0 && 1 + -2*nondef_1 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_1 + v_j_0 && v_j_0 >= 0 && nondef_2 >= 0 && 1 + -2*nondef_2 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_2 + v_j_0 && v_j_0 >= 0 && nondef_3 >= 0 && 1 + -2*nondef_3 + v_j_0 >= 0 && 1 >= 1 + -2*nondef_3 + v_j_0] eval_realheapsort_step1__critedge_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_28(1 + v_k_0,v_N ,v_j_0 ,v_k_0) True eval_realheapsort_step1_28(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_29(v_33,v_N,v_j_0 ,v_k_0) True eval_realheapsort_step1_29(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_bb1_in(v_33,v_N,v_j_0 ,v_33) True eval_realheapsort_step1_bb5_in(v_33,v_N,v_j_0,v_k_0) -> eval_realheapsort_step1_stop(v_33,v_N,v_j_0 ,v_k_0) True Signature: {(eval_realheapsort_step1_0,4) ;(eval_realheapsort_step1_1,4) ;(eval_realheapsort_step1_2,4) ;(eval_realheapsort_step1_28,4) ;(eval_realheapsort_step1_29,4) ;(eval_realheapsort_step1__critedge_in,4) ;(eval_realheapsort_step1_bb0_in,4) ;(eval_realheapsort_step1_bb1_in,4) ;(eval_realheapsort_step1_bb2_in,4) ;(eval_realheapsort_step1_bb3_in,4) ;(eval_realheapsort_step1_bb4_in,4) ;(eval_realheapsort_step1_bb5_in,4) ;(eval_realheapsort_step1_start,4) ;(eval_realheapsort_step1_stop,4)} Rule Graph: [0->{1},1->{2},2->{3},3->{4,5},4->{6},5->{46},6->{8,9},7->{46},8->{11,14},9->{43},11->{29},14->{43},29->{8 ,9},43->{44},44->{45},45->{6,7},46->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,11,14,29,43,44,45,46] | `- p:[6,45,44,43,9,29,11,8,14] c: [6,9,14,43,44,45] | `- p:[8,29,11] c: [8,11,29]) + Applied Processor: CloseWith True + Details: () YES