MAYBE * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. evalrealheapsortstart(A,B,C,D) -> evalrealheapsortentryin(A,B,C,D) True (1,1) 1. evalrealheapsortentryin(A,B,C,D) -> evalrealheapsortbb6in(A,1,C,D) [A >= 3] (?,1) 2. evalrealheapsortentryin(A,B,C,D) -> evalrealheapsortreturnin(A,B,C,D) [2 >= A] (?,1) 3. evalrealheapsortbb6in(A,B,C,D) -> evalrealheapsortbb3in(A,B,B,D) [A >= 1 + B] (?,1) 4. evalrealheapsortbb6in(A,B,C,D) -> evalrealheapsortbb7in(A,B,C,D) [B >= A] (?,1) 5. evalrealheapsortbb3in(A,B,C,D) -> evalrealheapsortbb5in(A,B,C,D) [0 >= C] (?,1) 6. evalrealheapsortbb3in(A,B,C,D) -> evalrealheapsortbb4in(A,B,C,D) [C >= 1] (?,1) 7. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb2in(A,B,C,D) [1 + C = 0] (?,1) 8. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb2in(A,B,C,D) [C >= 0 && E >= 0 && 1 + C >= 2*E && 2*E >= C] (?,1) 9. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb2in(A,B,C,D) [0 >= 2 + C && 0 >= E && 2*E >= 1 + C && 2 + C >= 2*E] (?,1) 10. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb5in(A,B,C,D) [1 + C = 0] (?,1) 11. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb5in(A,B,C,D) [C >= 0 && E >= 0 && 1 + C >= 2*E && 2*E >= C] (?,1) 12. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb5in(A,B,C,D) [0 >= 2 + C && 0 >= E && 2*E >= 1 + C && 2 + C >= 2*E] (?,1) 13. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1,D) [1 + C = 0] (?,1) 14. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 1 && E >= 0 && 0 >= 2*E && 1 + 2*E >= 0 && 1 + C = 0] (?,1) 15. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 1 && 0 >= E && 1 + C = 0 && 2*E >= 1 + C && 2 + C >= 2*E] (?,1) 16. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1,D) [0 >= 1 && E >= 0 && 0 >= 2*E && 1 + 2*E >= 0 && 1 + C = 0] (?,1) 17. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 1 && F >= 0 && 0 >= 2*F && 1 + 2*F >= 0 && E >= 0 && 0 >= 2*E && 1 + 2*E >= 0 && 1 + C = 0] (?,1) 18. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 1 && F >= 0 && 0 >= 2*F && 1 + 2*F >= 0 && 0 >= E && 1 + C = 0 && 2*E >= 1 + C && 2 + C >= 2*E] (?,1) 19. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1,D) [0 >= 1 && 0 >= E && 1 + C = 0 && 2*E >= 1 + C && 2 + C >= 2*E] (?,1) 20. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 1 && 0 >= F && E >= 0 && 0 >= 2*E && 1 + 2*E >= 0 && 1 + C = 0 && 2*F >= 1 + C && 2 + C >= 2*F] (?,1) 21. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 1 && 0 >= F && 0 >= E && 1 + C = 0 && 2*F >= 1 + C && 2 + C >= 2*F && 2*E >= 1 + C && 2 + C >= 2*E] (?,1) 22. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1,D) [0 >= 1 && E >= 0 && 0 >= 2*E && 1 + 2*E >= 0 && 1 + C = 0] (?,1) 23. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 1 && F >= 0 && 0 >= 2*F && 1 + 2*F >= 0 && E >= 0 && 0 >= 2*E && 1 + 2*E >= 0 && 1 + C = 0] (?,1) 24. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 1 && F >= 0 && 0 >= 2*F && 1 + 2*F >= 0 && 0 >= E && 1 + C = 0 && 2*E >= 1 + C && 2 + C >= 2*E] (?,1) 25. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1,D) [0 >= 1 && E >= 0 && 0 >= 2*E && 1 + 2*E >= 0 && F >= 0 && 0 >= 2*F && 1 + 2*F >= 0 && 1 + C = 0] (?,1) 26. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [C >= 0 (?,1) && F >= 0 && 1 + C >= 2*F && 2*F >= C && G >= 0 && 1 + C >= 2*G && 2*G >= C && E >= 0 && 1 + C >= 2*E && 2*E >= C] 27. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [C >= 0 (?,1) && F >= 0 && 1 + C >= 2*F && 2*F >= C && G >= 0 && 1 + C >= 2*G && 2*G >= C && 0 >= 2 + C && 0 >= E && 2*E >= 1 + C && 2 + C >= 2*E] 28. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1,D) [0 >= 1 && E >= 0 && 0 >= 2*E && 1 + 2*E >= 0 && 0 >= F && 1 + C = 0 && 2*F >= 1 + C && 2 + C >= 2*F] (?,1) 29. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [C >= 0 (?,1) && F >= 0 && 1 + C >= 2*F && 2*F >= C && 0 >= 2 + C && 0 >= G && E >= 0 && 1 + C >= 2*E && 2*E >= C && 2*G >= 1 + C && 2 + C >= 2*G] 30. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [C >= 0 (?,1) && F >= 0 && 1 + C >= 2*F && 2*F >= C && 0 >= 2 + C && 0 >= G && 0 >= E && 2*G >= 1 + C && 2 + C >= 2*G && 2*E >= 1 + C && 2 + C >= 2*E] 31. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1,D) [0 >= 1 && 0 >= E && 1 + C = 0 && 2*E >= 1 + C && 2 + C >= 2*E] (?,1) 32. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 1 && 0 >= F && E >= 0 && 0 >= 2*E && 1 + 2*E >= 0 && 1 + C = 0 && 2*F >= 1 + C && 2 + C >= 2*F] (?,1) 33. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 1 && 0 >= F && 0 >= E && 1 + C = 0 && 2*F >= 1 + C && 2 + C >= 2*F && 2*E >= 1 + C && 2 + C >= 2*E] (?,1) 34. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1,D) [0 >= 1 && 0 >= E && F >= 0 && 0 >= 2*F && 1 + 2*F >= 0 && 1 + C = 0 && 2*E >= 1 + C && 2 + C >= 2*E] (?,1) 35. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 2 + C (?,1) && 0 >= F && C >= 0 && G >= 0 && 1 + C >= 2*G && 2*G >= C && E >= 0 && 1 + C >= 2*E && 2*E >= C && 2*F >= 1 + C && 2 + C >= 2*F] 36. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 2 + C (?,1) && 0 >= F && C >= 0 && G >= 0 && 1 + C >= 2*G && 2*G >= C && 0 >= E && 2*F >= 1 + C && 2 + C >= 2*F && 2*E >= 1 + C && 2 + C >= 2*E] 37. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1,D) [0 >= 1 && 0 >= E && 0 >= F && 1 + C = 0 && 2*E >= 1 + C && 2 + C >= 2*E && 2*F >= 1 + C && 2 + C >= 2*F] (?,1) 38. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 2 + C (?,1) && 0 >= F && 0 >= G && C >= 0 && E >= 0 && 1 + C >= 2*E && 2*E >= C && 2*F >= 1 + C && 2 + C >= 2*F && 2*G >= 1 + C && 2 + C >= 2*G] 39. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 2 + C (?,1) && 0 >= F && 0 >= G && 0 >= E && 2*F >= 1 + C && 2 + C >= 2*F && 2*G >= 1 + C && 2 + C >= 2*G && 2*E >= 1 + C && 2 + C >= 2*E] 40. evalrealheapsortbb5in(A,B,C,D) -> evalrealheapsortbb6in(A,1 + B,C,D) True (?,1) 41. evalrealheapsortbb7in(A,B,C,D) -> evalrealheapsortbb18in(A,0,C,D) True (?,1) 42. evalrealheapsortbb18in(A,B,C,D) -> evalrealheapsortbb8in(A,B,C,D) [A >= 2 + B] (?,1) 43. evalrealheapsortbb18in(A,B,C,D) -> evalrealheapsortreturnin(A,B,C,D) [1 + B >= A] (?,1) 44. evalrealheapsortbb8in(A,B,C,D) -> evalrealheapsortbb16in(A,B,0,D) True (?,1) 45. evalrealheapsortbb16in(A,B,C,D) -> evalrealheapsortbb9in(A,B,C,D) [A >= 3 + B + 2*C] (?,1) 46. evalrealheapsortbb16in(A,B,C,D) -> evalrealheapsortbb17in(A,B,C,D) [2 + B + 2*C >= A] (?,1) 47. evalrealheapsortbb9in(A,B,C,D) -> evalrealheapsortbb11in(A,B,C,D) [A = 3 + B + 2*C] (?,1) 48. evalrealheapsortbb9in(A,B,C,D) -> evalrealheapsortbb10in(A,B,C,D) [A >= 4 + B + 2*C] (?,1) 49. evalrealheapsortbb9in(A,B,C,D) -> evalrealheapsortbb10in(A,B,C,D) [2 + B + 2*C >= A] (?,1) 50. evalrealheapsortbb10in(A,B,C,D) -> evalrealheapsortbb11in(A,B,C,D) True (?,1) 51. evalrealheapsortbb10in(A,B,C,D) -> evalrealheapsortbb12in(A,B,C,D) True (?,1) 52. evalrealheapsortbb11in(A,B,C,D) -> evalrealheapsortbb13in(A,B,C,1 + 2*C) True (?,1) 53. evalrealheapsortbb12in(A,B,C,D) -> evalrealheapsortbb13in(A,B,C,2 + 2*C) True (?,1) 54. evalrealheapsortbb13in(A,B,C,D) -> evalrealheapsortbb14in(A,B,C,D) True (?,1) 55. evalrealheapsortbb13in(A,B,C,D) -> evalrealheapsortbb16in(A,B,A,D) True (?,1) 56. evalrealheapsortbb14in(A,B,C,D) -> evalrealheapsortbb16in(A,B,D,D) True (?,1) 57. evalrealheapsortbb17in(A,B,C,D) -> evalrealheapsortbb18in(A,1 + B,C,D) True (?,1) 58. evalrealheapsortreturnin(A,B,C,D) -> evalrealheapsortstop(A,B,C,D) True (?,1) Signature: {(evalrealheapsortbb10in,4) ;(evalrealheapsortbb11in,4) ;(evalrealheapsortbb12in,4) ;(evalrealheapsortbb13in,4) ;(evalrealheapsortbb14in,4) ;(evalrealheapsortbb16in,4) ;(evalrealheapsortbb17in,4) ;(evalrealheapsortbb18in,4) ;(evalrealheapsortbb2in,4) ;(evalrealheapsortbb3in,4) ;(evalrealheapsortbb4in,4) ;(evalrealheapsortbb5in,4) ;(evalrealheapsortbb6in,4) ;(evalrealheapsortbb7in,4) ;(evalrealheapsortbb8in,4) ;(evalrealheapsortbb9in,4) ;(evalrealheapsortentryin,4) ;(evalrealheapsortreturnin,4) ;(evalrealheapsortstart,4) ;(evalrealheapsortstop,4)} Flow Graph: [0->{1,2},1->{3,4},2->{58},3->{5,6},4->{41},5->{40},6->{7,8,9,10,11,12},7->{13,14,15,16,17,18,19,20,21,22 ,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39},8->{13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29 ,30,31,32,33,34,35,36,37,38,39},9->{13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36 ,37,38,39},10->{40},11->{40},12->{40},13->{5,6},14->{5,6},15->{5,6},16->{5,6},17->{5,6},18->{5,6},19->{5,6} ,20->{5,6},21->{5,6},22->{5,6},23->{5,6},24->{5,6},25->{5,6},26->{5,6},27->{5,6},28->{5,6},29->{5,6},30->{5 ,6},31->{5,6},32->{5,6},33->{5,6},34->{5,6},35->{5,6},36->{5,6},37->{5,6},38->{5,6},39->{5,6},40->{3,4} ,41->{42,43},42->{44},43->{58},44->{45,46},45->{47,48,49},46->{57},47->{52},48->{50,51},49->{50,51},50->{52} ,51->{53},52->{54,55},53->{54,55},54->{56},55->{45,46},56->{45,46},57->{42,43},58->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatRules MAYBE + Considered Problem: Rules: 0. evalrealheapsortstart(A,B,C,D) -> evalrealheapsortentryin(A,B,C,D) True (1,1) 1. evalrealheapsortentryin(A,B,C,D) -> evalrealheapsortbb6in(A,1,C,D) [A >= 3] (1,1) 2. evalrealheapsortentryin(A,B,C,D) -> evalrealheapsortreturnin(A,B,C,D) [2 >= A] (1,1) 3. evalrealheapsortbb6in(A,B,C,D) -> evalrealheapsortbb3in(A,B,B,D) [A >= 1 + B] (?,1) 4. evalrealheapsortbb6in(A,B,C,D) -> evalrealheapsortbb7in(A,B,C,D) [B >= A] (1,1) 5. evalrealheapsortbb3in(A,B,C,D) -> evalrealheapsortbb5in(A,B,C,D) [0 >= C] (?,1) 6. evalrealheapsortbb3in(A,B,C,D) -> evalrealheapsortbb4in(A,B,C,D) [C >= 1] (?,1) 7. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb2in(A,B,C,D) [1 + C = 0] (?,1) 8. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb2in(A,B,C,D) [C >= 0 && E >= 0 && 1 + C >= 2*E && 2*E >= C] (?,1) 9. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb2in(A,B,C,D) [0 >= 2 + C && 0 >= E && 2*E >= 1 + C && 2 + C >= 2*E] (?,1) 10. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb5in(A,B,C,D) [1 + C = 0] (?,1) 11. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb5in(A,B,C,D) [C >= 0 && E >= 0 && 1 + C >= 2*E && 2*E >= C] (?,1) 12. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb5in(A,B,C,D) [0 >= 2 + C && 0 >= E && 2*E >= 1 + C && 2 + C >= 2*E] (?,1) 13. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1,D) [1 + C = 0] (?,1) 14. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 1 && E >= 0 && 0 >= 2*E && 1 + 2*E >= 0 && 1 + C = 0] (?,1) 15. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 1 && 0 >= E && 1 + C = 0 && 2*E >= 1 + C && 2 + C >= 2*E] (?,1) 16. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1,D) [0 >= 1 && E >= 0 && 0 >= 2*E && 1 + 2*E >= 0 && 1 + C = 0] (?,1) 17. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 1 && F >= 0 && 0 >= 2*F && 1 + 2*F >= 0 && E >= 0 && 0 >= 2*E && 1 + 2*E >= 0 && 1 + C = 0] (?,1) 18. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 1 && F >= 0 && 0 >= 2*F && 1 + 2*F >= 0 && 0 >= E && 1 + C = 0 && 2*E >= 1 + C && 2 + C >= 2*E] (?,1) 19. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1,D) [0 >= 1 && 0 >= E && 1 + C = 0 && 2*E >= 1 + C && 2 + C >= 2*E] (?,1) 20. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 1 && 0 >= F && E >= 0 && 0 >= 2*E && 1 + 2*E >= 0 && 1 + C = 0 && 2*F >= 1 + C && 2 + C >= 2*F] (?,1) 21. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 1 && 0 >= F && 0 >= E && 1 + C = 0 && 2*F >= 1 + C && 2 + C >= 2*F && 2*E >= 1 + C && 2 + C >= 2*E] (?,1) 22. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1,D) [0 >= 1 && E >= 0 && 0 >= 2*E && 1 + 2*E >= 0 && 1 + C = 0] (?,1) 23. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 1 && F >= 0 && 0 >= 2*F && 1 + 2*F >= 0 && E >= 0 && 0 >= 2*E && 1 + 2*E >= 0 && 1 + C = 0] (?,1) 24. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 1 && F >= 0 && 0 >= 2*F && 1 + 2*F >= 0 && 0 >= E && 1 + C = 0 && 2*E >= 1 + C && 2 + C >= 2*E] (?,1) 25. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1,D) [0 >= 1 && E >= 0 && 0 >= 2*E && 1 + 2*E >= 0 && F >= 0 && 0 >= 2*F && 1 + 2*F >= 0 && 1 + C = 0] (?,1) 26. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [C >= 0 (?,1) && F >= 0 && 1 + C >= 2*F && 2*F >= C && G >= 0 && 1 + C >= 2*G && 2*G >= C && E >= 0 && 1 + C >= 2*E && 2*E >= C] 27. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [C >= 0 (?,1) && F >= 0 && 1 + C >= 2*F && 2*F >= C && G >= 0 && 1 + C >= 2*G && 2*G >= C && 0 >= 2 + C && 0 >= E && 2*E >= 1 + C && 2 + C >= 2*E] 28. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1,D) [0 >= 1 && E >= 0 && 0 >= 2*E && 1 + 2*E >= 0 && 0 >= F && 1 + C = 0 && 2*F >= 1 + C && 2 + C >= 2*F] (?,1) 29. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [C >= 0 (?,1) && F >= 0 && 1 + C >= 2*F && 2*F >= C && 0 >= 2 + C && 0 >= G && E >= 0 && 1 + C >= 2*E && 2*E >= C && 2*G >= 1 + C && 2 + C >= 2*G] 30. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [C >= 0 (?,1) && F >= 0 && 1 + C >= 2*F && 2*F >= C && 0 >= 2 + C && 0 >= G && 0 >= E && 2*G >= 1 + C && 2 + C >= 2*G && 2*E >= 1 + C && 2 + C >= 2*E] 31. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1,D) [0 >= 1 && 0 >= E && 1 + C = 0 && 2*E >= 1 + C && 2 + C >= 2*E] (?,1) 32. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 1 && 0 >= F && E >= 0 && 0 >= 2*E && 1 + 2*E >= 0 && 1 + C = 0 && 2*F >= 1 + C && 2 + C >= 2*F] (?,1) 33. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 1 && 0 >= F && 0 >= E && 1 + C = 0 && 2*F >= 1 + C && 2 + C >= 2*F && 2*E >= 1 + C && 2 + C >= 2*E] (?,1) 34. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1,D) [0 >= 1 && 0 >= E && F >= 0 && 0 >= 2*F && 1 + 2*F >= 0 && 1 + C = 0 && 2*E >= 1 + C && 2 + C >= 2*E] (?,1) 35. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 2 + C (?,1) && 0 >= F && C >= 0 && G >= 0 && 1 + C >= 2*G && 2*G >= C && E >= 0 && 1 + C >= 2*E && 2*E >= C && 2*F >= 1 + C && 2 + C >= 2*F] 36. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 2 + C (?,1) && 0 >= F && C >= 0 && G >= 0 && 1 + C >= 2*G && 2*G >= C && 0 >= E && 2*F >= 1 + C && 2 + C >= 2*F && 2*E >= 1 + C && 2 + C >= 2*E] 37. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1,D) [0 >= 1 && 0 >= E && 0 >= F && 1 + C = 0 && 2*E >= 1 + C && 2 + C >= 2*E && 2*F >= 1 + C && 2 + C >= 2*F] (?,1) 38. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 2 + C (?,1) && 0 >= F && 0 >= G && C >= 0 && E >= 0 && 1 + C >= 2*E && 2*E >= C && 2*F >= 1 + C && 2 + C >= 2*F && 2*G >= 1 + C && 2 + C >= 2*G] 39. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 2 + C (?,1) && 0 >= F && 0 >= G && 0 >= E && 2*F >= 1 + C && 2 + C >= 2*F && 2*G >= 1 + C && 2 + C >= 2*G && 2*E >= 1 + C && 2 + C >= 2*E] 40. evalrealheapsortbb5in(A,B,C,D) -> evalrealheapsortbb6in(A,1 + B,C,D) True (?,1) 41. evalrealheapsortbb7in(A,B,C,D) -> evalrealheapsortbb18in(A,0,C,D) True (1,1) 42. evalrealheapsortbb18in(A,B,C,D) -> evalrealheapsortbb8in(A,B,C,D) [A >= 2 + B] (?,1) 43. evalrealheapsortbb18in(A,B,C,D) -> evalrealheapsortreturnin(A,B,C,D) [1 + B >= A] (1,1) 44. evalrealheapsortbb8in(A,B,C,D) -> evalrealheapsortbb16in(A,B,0,D) True (?,1) 45. evalrealheapsortbb16in(A,B,C,D) -> evalrealheapsortbb9in(A,B,C,D) [A >= 3 + B + 2*C] (?,1) 46. evalrealheapsortbb16in(A,B,C,D) -> evalrealheapsortbb17in(A,B,C,D) [2 + B + 2*C >= A] (?,1) 47. evalrealheapsortbb9in(A,B,C,D) -> evalrealheapsortbb11in(A,B,C,D) [A = 3 + B + 2*C] (?,1) 48. evalrealheapsortbb9in(A,B,C,D) -> evalrealheapsortbb10in(A,B,C,D) [A >= 4 + B + 2*C] (?,1) 49. evalrealheapsortbb9in(A,B,C,D) -> evalrealheapsortbb10in(A,B,C,D) [2 + B + 2*C >= A] (?,1) 50. evalrealheapsortbb10in(A,B,C,D) -> evalrealheapsortbb11in(A,B,C,D) True (?,1) 51. evalrealheapsortbb10in(A,B,C,D) -> evalrealheapsortbb12in(A,B,C,D) True (?,1) 52. evalrealheapsortbb11in(A,B,C,D) -> evalrealheapsortbb13in(A,B,C,1 + 2*C) True (?,1) 53. evalrealheapsortbb12in(A,B,C,D) -> evalrealheapsortbb13in(A,B,C,2 + 2*C) True (?,1) 54. evalrealheapsortbb13in(A,B,C,D) -> evalrealheapsortbb14in(A,B,C,D) True (?,1) 55. evalrealheapsortbb13in(A,B,C,D) -> evalrealheapsortbb16in(A,B,A,D) True (?,1) 56. evalrealheapsortbb14in(A,B,C,D) -> evalrealheapsortbb16in(A,B,D,D) True (?,1) 57. evalrealheapsortbb17in(A,B,C,D) -> evalrealheapsortbb18in(A,1 + B,C,D) True (?,1) 58. evalrealheapsortreturnin(A,B,C,D) -> evalrealheapsortstop(A,B,C,D) True (1,1) Signature: {(evalrealheapsortbb10in,4) ;(evalrealheapsortbb11in,4) ;(evalrealheapsortbb12in,4) ;(evalrealheapsortbb13in,4) ;(evalrealheapsortbb14in,4) ;(evalrealheapsortbb16in,4) ;(evalrealheapsortbb17in,4) ;(evalrealheapsortbb18in,4) ;(evalrealheapsortbb2in,4) ;(evalrealheapsortbb3in,4) ;(evalrealheapsortbb4in,4) ;(evalrealheapsortbb5in,4) ;(evalrealheapsortbb6in,4) ;(evalrealheapsortbb7in,4) ;(evalrealheapsortbb8in,4) ;(evalrealheapsortbb9in,4) ;(evalrealheapsortentryin,4) ;(evalrealheapsortreturnin,4) ;(evalrealheapsortstart,4) ;(evalrealheapsortstop,4)} Flow Graph: [0->{1,2},1->{3,4},2->{58},3->{5,6},4->{41},5->{40},6->{7,8,9,10,11,12},7->{13,14,15,16,17,18,19,20,21,22 ,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39},8->{13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29 ,30,31,32,33,34,35,36,37,38,39},9->{13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36 ,37,38,39},10->{40},11->{40},12->{40},13->{5,6},14->{5,6},15->{5,6},16->{5,6},17->{5,6},18->{5,6},19->{5,6} ,20->{5,6},21->{5,6},22->{5,6},23->{5,6},24->{5,6},25->{5,6},26->{5,6},27->{5,6},28->{5,6},29->{5,6},30->{5 ,6},31->{5,6},32->{5,6},33->{5,6},34->{5,6},35->{5,6},36->{5,6},37->{5,6},38->{5,6},39->{5,6},40->{3,4} ,41->{42,43},42->{44},43->{58},44->{45,46},45->{47,48,49},46->{57},47->{52},48->{50,51},49->{50,51},50->{52} ,51->{53},52->{54,55},53->{54,55},54->{56},55->{45,46},56->{45,46},57->{42,43},58->{}] + Applied Processor: UnsatRules + Details: Following transitions have unsatisfiable constraints and are removed: [14 ,15 ,16 ,17 ,18 ,19 ,20 ,21 ,22 ,23 ,24 ,25 ,27 ,28 ,29 ,30 ,31 ,32 ,33 ,34 ,35 ,36 ,37 ,38] * Step 3: UnsatPaths MAYBE + Considered Problem: Rules: 0. evalrealheapsortstart(A,B,C,D) -> evalrealheapsortentryin(A,B,C,D) True (1,1) 1. evalrealheapsortentryin(A,B,C,D) -> evalrealheapsortbb6in(A,1,C,D) [A >= 3] (1,1) 2. evalrealheapsortentryin(A,B,C,D) -> evalrealheapsortreturnin(A,B,C,D) [2 >= A] (1,1) 3. evalrealheapsortbb6in(A,B,C,D) -> evalrealheapsortbb3in(A,B,B,D) [A >= 1 + B] (?,1) 4. evalrealheapsortbb6in(A,B,C,D) -> evalrealheapsortbb7in(A,B,C,D) [B >= A] (1,1) 5. evalrealheapsortbb3in(A,B,C,D) -> evalrealheapsortbb5in(A,B,C,D) [0 >= C] (?,1) 6. evalrealheapsortbb3in(A,B,C,D) -> evalrealheapsortbb4in(A,B,C,D) [C >= 1] (?,1) 7. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb2in(A,B,C,D) [1 + C = 0] (?,1) 8. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb2in(A,B,C,D) [C >= 0 && E >= 0 && 1 + C >= 2*E && 2*E >= C] (?,1) 9. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb2in(A,B,C,D) [0 >= 2 + C && 0 >= E && 2*E >= 1 + C && 2 + C >= 2*E] (?,1) 10. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb5in(A,B,C,D) [1 + C = 0] (?,1) 11. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb5in(A,B,C,D) [C >= 0 && E >= 0 && 1 + C >= 2*E && 2*E >= C] (?,1) 12. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb5in(A,B,C,D) [0 >= 2 + C && 0 >= E && 2*E >= 1 + C && 2 + C >= 2*E] (?,1) 13. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1,D) [1 + C = 0] (?,1) 26. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [C >= 0 (?,1) && F >= 0 && 1 + C >= 2*F && 2*F >= C && G >= 0 && 1 + C >= 2*G && 2*G >= C && E >= 0 && 1 + C >= 2*E && 2*E >= C] 39. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 2 + C (?,1) && 0 >= F && 0 >= G && 0 >= E && 2*F >= 1 + C && 2 + C >= 2*F && 2*G >= 1 + C && 2 + C >= 2*G && 2*E >= 1 + C && 2 + C >= 2*E] 40. evalrealheapsortbb5in(A,B,C,D) -> evalrealheapsortbb6in(A,1 + B,C,D) True (?,1) 41. evalrealheapsortbb7in(A,B,C,D) -> evalrealheapsortbb18in(A,0,C,D) True (1,1) 42. evalrealheapsortbb18in(A,B,C,D) -> evalrealheapsortbb8in(A,B,C,D) [A >= 2 + B] (?,1) 43. evalrealheapsortbb18in(A,B,C,D) -> evalrealheapsortreturnin(A,B,C,D) [1 + B >= A] (1,1) 44. evalrealheapsortbb8in(A,B,C,D) -> evalrealheapsortbb16in(A,B,0,D) True (?,1) 45. evalrealheapsortbb16in(A,B,C,D) -> evalrealheapsortbb9in(A,B,C,D) [A >= 3 + B + 2*C] (?,1) 46. evalrealheapsortbb16in(A,B,C,D) -> evalrealheapsortbb17in(A,B,C,D) [2 + B + 2*C >= A] (?,1) 47. evalrealheapsortbb9in(A,B,C,D) -> evalrealheapsortbb11in(A,B,C,D) [A = 3 + B + 2*C] (?,1) 48. evalrealheapsortbb9in(A,B,C,D) -> evalrealheapsortbb10in(A,B,C,D) [A >= 4 + B + 2*C] (?,1) 49. evalrealheapsortbb9in(A,B,C,D) -> evalrealheapsortbb10in(A,B,C,D) [2 + B + 2*C >= A] (?,1) 50. evalrealheapsortbb10in(A,B,C,D) -> evalrealheapsortbb11in(A,B,C,D) True (?,1) 51. evalrealheapsortbb10in(A,B,C,D) -> evalrealheapsortbb12in(A,B,C,D) True (?,1) 52. evalrealheapsortbb11in(A,B,C,D) -> evalrealheapsortbb13in(A,B,C,1 + 2*C) True (?,1) 53. evalrealheapsortbb12in(A,B,C,D) -> evalrealheapsortbb13in(A,B,C,2 + 2*C) True (?,1) 54. evalrealheapsortbb13in(A,B,C,D) -> evalrealheapsortbb14in(A,B,C,D) True (?,1) 55. evalrealheapsortbb13in(A,B,C,D) -> evalrealheapsortbb16in(A,B,A,D) True (?,1) 56. evalrealheapsortbb14in(A,B,C,D) -> evalrealheapsortbb16in(A,B,D,D) True (?,1) 57. evalrealheapsortbb17in(A,B,C,D) -> evalrealheapsortbb18in(A,1 + B,C,D) True (?,1) 58. evalrealheapsortreturnin(A,B,C,D) -> evalrealheapsortstop(A,B,C,D) True (1,1) Signature: {(evalrealheapsortbb10in,4) ;(evalrealheapsortbb11in,4) ;(evalrealheapsortbb12in,4) ;(evalrealheapsortbb13in,4) ;(evalrealheapsortbb14in,4) ;(evalrealheapsortbb16in,4) ;(evalrealheapsortbb17in,4) ;(evalrealheapsortbb18in,4) ;(evalrealheapsortbb2in,4) ;(evalrealheapsortbb3in,4) ;(evalrealheapsortbb4in,4) ;(evalrealheapsortbb5in,4) ;(evalrealheapsortbb6in,4) ;(evalrealheapsortbb7in,4) ;(evalrealheapsortbb8in,4) ;(evalrealheapsortbb9in,4) ;(evalrealheapsortentryin,4) ;(evalrealheapsortreturnin,4) ;(evalrealheapsortstart,4) ;(evalrealheapsortstop,4)} Flow Graph: [0->{1,2},1->{3,4},2->{58},3->{5,6},4->{41},5->{40},6->{7,8,9,10,11,12},7->{13,26,39},8->{13,26,39},9->{13 ,26,39},10->{40},11->{40},12->{40},13->{5,6},26->{5,6},39->{5,6},40->{3,4},41->{42,43},42->{44},43->{58} ,44->{45,46},45->{47,48,49},46->{57},47->{52},48->{50,51},49->{50,51},50->{52},51->{53},52->{54,55},53->{54 ,55},54->{56},55->{45,46},56->{45,46},57->{42,43},58->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,4) ,(6,7) ,(6,9) ,(6,10) ,(6,12) ,(7,26) ,(7,39) ,(8,13) ,(8,39) ,(9,13) ,(9,26) ,(13,6) ,(39,6) ,(45,49)] * Step 4: UnreachableRules MAYBE + Considered Problem: Rules: 0. evalrealheapsortstart(A,B,C,D) -> evalrealheapsortentryin(A,B,C,D) True (1,1) 1. evalrealheapsortentryin(A,B,C,D) -> evalrealheapsortbb6in(A,1,C,D) [A >= 3] (1,1) 2. evalrealheapsortentryin(A,B,C,D) -> evalrealheapsortreturnin(A,B,C,D) [2 >= A] (1,1) 3. evalrealheapsortbb6in(A,B,C,D) -> evalrealheapsortbb3in(A,B,B,D) [A >= 1 + B] (?,1) 4. evalrealheapsortbb6in(A,B,C,D) -> evalrealheapsortbb7in(A,B,C,D) [B >= A] (1,1) 5. evalrealheapsortbb3in(A,B,C,D) -> evalrealheapsortbb5in(A,B,C,D) [0 >= C] (?,1) 6. evalrealheapsortbb3in(A,B,C,D) -> evalrealheapsortbb4in(A,B,C,D) [C >= 1] (?,1) 7. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb2in(A,B,C,D) [1 + C = 0] (?,1) 8. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb2in(A,B,C,D) [C >= 0 && E >= 0 && 1 + C >= 2*E && 2*E >= C] (?,1) 9. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb2in(A,B,C,D) [0 >= 2 + C && 0 >= E && 2*E >= 1 + C && 2 + C >= 2*E] (?,1) 10. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb5in(A,B,C,D) [1 + C = 0] (?,1) 11. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb5in(A,B,C,D) [C >= 0 && E >= 0 && 1 + C >= 2*E && 2*E >= C] (?,1) 12. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb5in(A,B,C,D) [0 >= 2 + C && 0 >= E && 2*E >= 1 + C && 2 + C >= 2*E] (?,1) 13. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1,D) [1 + C = 0] (?,1) 26. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [C >= 0 (?,1) && F >= 0 && 1 + C >= 2*F && 2*F >= C && G >= 0 && 1 + C >= 2*G && 2*G >= C && E >= 0 && 1 + C >= 2*E && 2*E >= C] 39. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [0 >= 2 + C (?,1) && 0 >= F && 0 >= G && 0 >= E && 2*F >= 1 + C && 2 + C >= 2*F && 2*G >= 1 + C && 2 + C >= 2*G && 2*E >= 1 + C && 2 + C >= 2*E] 40. evalrealheapsortbb5in(A,B,C,D) -> evalrealheapsortbb6in(A,1 + B,C,D) True (?,1) 41. evalrealheapsortbb7in(A,B,C,D) -> evalrealheapsortbb18in(A,0,C,D) True (1,1) 42. evalrealheapsortbb18in(A,B,C,D) -> evalrealheapsortbb8in(A,B,C,D) [A >= 2 + B] (?,1) 43. evalrealheapsortbb18in(A,B,C,D) -> evalrealheapsortreturnin(A,B,C,D) [1 + B >= A] (1,1) 44. evalrealheapsortbb8in(A,B,C,D) -> evalrealheapsortbb16in(A,B,0,D) True (?,1) 45. evalrealheapsortbb16in(A,B,C,D) -> evalrealheapsortbb9in(A,B,C,D) [A >= 3 + B + 2*C] (?,1) 46. evalrealheapsortbb16in(A,B,C,D) -> evalrealheapsortbb17in(A,B,C,D) [2 + B + 2*C >= A] (?,1) 47. evalrealheapsortbb9in(A,B,C,D) -> evalrealheapsortbb11in(A,B,C,D) [A = 3 + B + 2*C] (?,1) 48. evalrealheapsortbb9in(A,B,C,D) -> evalrealheapsortbb10in(A,B,C,D) [A >= 4 + B + 2*C] (?,1) 49. evalrealheapsortbb9in(A,B,C,D) -> evalrealheapsortbb10in(A,B,C,D) [2 + B + 2*C >= A] (?,1) 50. evalrealheapsortbb10in(A,B,C,D) -> evalrealheapsortbb11in(A,B,C,D) True (?,1) 51. evalrealheapsortbb10in(A,B,C,D) -> evalrealheapsortbb12in(A,B,C,D) True (?,1) 52. evalrealheapsortbb11in(A,B,C,D) -> evalrealheapsortbb13in(A,B,C,1 + 2*C) True (?,1) 53. evalrealheapsortbb12in(A,B,C,D) -> evalrealheapsortbb13in(A,B,C,2 + 2*C) True (?,1) 54. evalrealheapsortbb13in(A,B,C,D) -> evalrealheapsortbb14in(A,B,C,D) True (?,1) 55. evalrealheapsortbb13in(A,B,C,D) -> evalrealheapsortbb16in(A,B,A,D) True (?,1) 56. evalrealheapsortbb14in(A,B,C,D) -> evalrealheapsortbb16in(A,B,D,D) True (?,1) 57. evalrealheapsortbb17in(A,B,C,D) -> evalrealheapsortbb18in(A,1 + B,C,D) True (?,1) 58. evalrealheapsortreturnin(A,B,C,D) -> evalrealheapsortstop(A,B,C,D) True (1,1) Signature: {(evalrealheapsortbb10in,4) ;(evalrealheapsortbb11in,4) ;(evalrealheapsortbb12in,4) ;(evalrealheapsortbb13in,4) ;(evalrealheapsortbb14in,4) ;(evalrealheapsortbb16in,4) ;(evalrealheapsortbb17in,4) ;(evalrealheapsortbb18in,4) ;(evalrealheapsortbb2in,4) ;(evalrealheapsortbb3in,4) ;(evalrealheapsortbb4in,4) ;(evalrealheapsortbb5in,4) ;(evalrealheapsortbb6in,4) ;(evalrealheapsortbb7in,4) ;(evalrealheapsortbb8in,4) ;(evalrealheapsortbb9in,4) ;(evalrealheapsortentryin,4) ;(evalrealheapsortreturnin,4) ;(evalrealheapsortstart,4) ;(evalrealheapsortstop,4)} Flow Graph: [0->{1,2},1->{3},2->{58},3->{5,6},4->{41},5->{40},6->{8,11},7->{13},8->{26},9->{39},10->{40},11->{40} ,12->{40},13->{5},26->{5,6},39->{5},40->{3,4},41->{42,43},42->{44},43->{58},44->{45,46},45->{47,48},46->{57} ,47->{52},48->{50,51},49->{50,51},50->{52},51->{53},52->{54,55},53->{54,55},54->{56},55->{45,46},56->{45,46} ,57->{42,43},58->{}] + Applied Processor: UnreachableRules + Details: Following transitions are not reachable from the starting states and are revomed: [7,9,10,12,13,39,49] * Step 5: AddSinks MAYBE + Considered Problem: Rules: 0. evalrealheapsortstart(A,B,C,D) -> evalrealheapsortentryin(A,B,C,D) True (1,1) 1. evalrealheapsortentryin(A,B,C,D) -> evalrealheapsortbb6in(A,1,C,D) [A >= 3] (1,1) 2. evalrealheapsortentryin(A,B,C,D) -> evalrealheapsortreturnin(A,B,C,D) [2 >= A] (1,1) 3. evalrealheapsortbb6in(A,B,C,D) -> evalrealheapsortbb3in(A,B,B,D) [A >= 1 + B] (?,1) 4. evalrealheapsortbb6in(A,B,C,D) -> evalrealheapsortbb7in(A,B,C,D) [B >= A] (1,1) 5. evalrealheapsortbb3in(A,B,C,D) -> evalrealheapsortbb5in(A,B,C,D) [0 >= C] (?,1) 6. evalrealheapsortbb3in(A,B,C,D) -> evalrealheapsortbb4in(A,B,C,D) [C >= 1] (?,1) 8. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb2in(A,B,C,D) [C >= 0 && E >= 0 && 1 + C >= 2*E && 2*E >= C] (?,1) 11. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb5in(A,B,C,D) [C >= 0 && E >= 0 && 1 + C >= 2*E && 2*E >= C] (?,1) 26. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [C >= 0 (?,1) && F >= 0 && 1 + C >= 2*F && 2*F >= C && G >= 0 && 1 + C >= 2*G && 2*G >= C && E >= 0 && 1 + C >= 2*E && 2*E >= C] 40. evalrealheapsortbb5in(A,B,C,D) -> evalrealheapsortbb6in(A,1 + B,C,D) True (?,1) 41. evalrealheapsortbb7in(A,B,C,D) -> evalrealheapsortbb18in(A,0,C,D) True (1,1) 42. evalrealheapsortbb18in(A,B,C,D) -> evalrealheapsortbb8in(A,B,C,D) [A >= 2 + B] (?,1) 43. evalrealheapsortbb18in(A,B,C,D) -> evalrealheapsortreturnin(A,B,C,D) [1 + B >= A] (1,1) 44. evalrealheapsortbb8in(A,B,C,D) -> evalrealheapsortbb16in(A,B,0,D) True (?,1) 45. evalrealheapsortbb16in(A,B,C,D) -> evalrealheapsortbb9in(A,B,C,D) [A >= 3 + B + 2*C] (?,1) 46. evalrealheapsortbb16in(A,B,C,D) -> evalrealheapsortbb17in(A,B,C,D) [2 + B + 2*C >= A] (?,1) 47. evalrealheapsortbb9in(A,B,C,D) -> evalrealheapsortbb11in(A,B,C,D) [A = 3 + B + 2*C] (?,1) 48. evalrealheapsortbb9in(A,B,C,D) -> evalrealheapsortbb10in(A,B,C,D) [A >= 4 + B + 2*C] (?,1) 50. evalrealheapsortbb10in(A,B,C,D) -> evalrealheapsortbb11in(A,B,C,D) True (?,1) 51. evalrealheapsortbb10in(A,B,C,D) -> evalrealheapsortbb12in(A,B,C,D) True (?,1) 52. evalrealheapsortbb11in(A,B,C,D) -> evalrealheapsortbb13in(A,B,C,1 + 2*C) True (?,1) 53. evalrealheapsortbb12in(A,B,C,D) -> evalrealheapsortbb13in(A,B,C,2 + 2*C) True (?,1) 54. evalrealheapsortbb13in(A,B,C,D) -> evalrealheapsortbb14in(A,B,C,D) True (?,1) 55. evalrealheapsortbb13in(A,B,C,D) -> evalrealheapsortbb16in(A,B,A,D) True (?,1) 56. evalrealheapsortbb14in(A,B,C,D) -> evalrealheapsortbb16in(A,B,D,D) True (?,1) 57. evalrealheapsortbb17in(A,B,C,D) -> evalrealheapsortbb18in(A,1 + B,C,D) True (?,1) 58. evalrealheapsortreturnin(A,B,C,D) -> evalrealheapsortstop(A,B,C,D) True (1,1) Signature: {(evalrealheapsortbb10in,4) ;(evalrealheapsortbb11in,4) ;(evalrealheapsortbb12in,4) ;(evalrealheapsortbb13in,4) ;(evalrealheapsortbb14in,4) ;(evalrealheapsortbb16in,4) ;(evalrealheapsortbb17in,4) ;(evalrealheapsortbb18in,4) ;(evalrealheapsortbb2in,4) ;(evalrealheapsortbb3in,4) ;(evalrealheapsortbb4in,4) ;(evalrealheapsortbb5in,4) ;(evalrealheapsortbb6in,4) ;(evalrealheapsortbb7in,4) ;(evalrealheapsortbb8in,4) ;(evalrealheapsortbb9in,4) ;(evalrealheapsortentryin,4) ;(evalrealheapsortreturnin,4) ;(evalrealheapsortstart,4) ;(evalrealheapsortstop,4)} Flow Graph: [0->{1,2},1->{3},2->{58},3->{5,6},4->{41},5->{40},6->{8,11},8->{26},11->{40},26->{5,6},40->{3,4},41->{42 ,43},42->{44},43->{58},44->{45,46},45->{47,48},46->{57},47->{52},48->{50,51},50->{52},51->{53},52->{54,55} ,53->{54,55},54->{56},55->{45,46},56->{45,46},57->{42,43},58->{}] + Applied Processor: AddSinks + Details: () * Step 6: UnsatPaths MAYBE + Considered Problem: Rules: 0. evalrealheapsortstart(A,B,C,D) -> evalrealheapsortentryin(A,B,C,D) True (1,1) 1. evalrealheapsortentryin(A,B,C,D) -> evalrealheapsortbb6in(A,1,C,D) [A >= 3] (?,1) 2. evalrealheapsortentryin(A,B,C,D) -> evalrealheapsortreturnin(A,B,C,D) [2 >= A] (?,1) 3. evalrealheapsortbb6in(A,B,C,D) -> evalrealheapsortbb3in(A,B,B,D) [A >= 1 + B] (?,1) 4. evalrealheapsortbb6in(A,B,C,D) -> evalrealheapsortbb7in(A,B,C,D) [B >= A] (?,1) 5. evalrealheapsortbb3in(A,B,C,D) -> evalrealheapsortbb5in(A,B,C,D) [0 >= C] (?,1) 6. evalrealheapsortbb3in(A,B,C,D) -> evalrealheapsortbb4in(A,B,C,D) [C >= 1] (?,1) 8. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb2in(A,B,C,D) [C >= 0 && E >= 0 && 1 + C >= 2*E && 2*E >= C] (?,1) 11. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb5in(A,B,C,D) [C >= 0 && E >= 0 && 1 + C >= 2*E && 2*E >= C] (?,1) 26. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [C >= 0 (?,1) && F >= 0 && 1 + C >= 2*F && 2*F >= C && G >= 0 && 1 + C >= 2*G && 2*G >= C && E >= 0 && 1 + C >= 2*E && 2*E >= C] 40. evalrealheapsortbb5in(A,B,C,D) -> evalrealheapsortbb6in(A,1 + B,C,D) True (?,1) 41. evalrealheapsortbb7in(A,B,C,D) -> evalrealheapsortbb18in(A,0,C,D) True (?,1) 42. evalrealheapsortbb18in(A,B,C,D) -> evalrealheapsortbb8in(A,B,C,D) [A >= 2 + B] (?,1) 43. evalrealheapsortbb18in(A,B,C,D) -> evalrealheapsortreturnin(A,B,C,D) [1 + B >= A] (?,1) 44. evalrealheapsortbb8in(A,B,C,D) -> evalrealheapsortbb16in(A,B,0,D) True (?,1) 45. evalrealheapsortbb16in(A,B,C,D) -> evalrealheapsortbb9in(A,B,C,D) [A >= 3 + B + 2*C] (?,1) 46. evalrealheapsortbb16in(A,B,C,D) -> evalrealheapsortbb17in(A,B,C,D) [2 + B + 2*C >= A] (?,1) 47. evalrealheapsortbb9in(A,B,C,D) -> evalrealheapsortbb11in(A,B,C,D) [A = 3 + B + 2*C] (?,1) 48. evalrealheapsortbb9in(A,B,C,D) -> evalrealheapsortbb10in(A,B,C,D) [A >= 4 + B + 2*C] (?,1) 50. evalrealheapsortbb10in(A,B,C,D) -> evalrealheapsortbb11in(A,B,C,D) True (?,1) 51. evalrealheapsortbb10in(A,B,C,D) -> evalrealheapsortbb12in(A,B,C,D) True (?,1) 52. evalrealheapsortbb11in(A,B,C,D) -> evalrealheapsortbb13in(A,B,C,1 + 2*C) True (?,1) 53. evalrealheapsortbb12in(A,B,C,D) -> evalrealheapsortbb13in(A,B,C,2 + 2*C) True (?,1) 54. evalrealheapsortbb13in(A,B,C,D) -> evalrealheapsortbb14in(A,B,C,D) True (?,1) 55. evalrealheapsortbb13in(A,B,C,D) -> evalrealheapsortbb16in(A,B,A,D) True (?,1) 56. evalrealheapsortbb14in(A,B,C,D) -> evalrealheapsortbb16in(A,B,D,D) True (?,1) 57. evalrealheapsortbb17in(A,B,C,D) -> evalrealheapsortbb18in(A,1 + B,C,D) True (?,1) 58. evalrealheapsortreturnin(A,B,C,D) -> evalrealheapsortstop(A,B,C,D) True (?,1) 59. evalrealheapsortreturnin(A,B,C,D) -> exitus616(A,B,C,D) True (?,1) Signature: {(evalrealheapsortbb10in,4) ;(evalrealheapsortbb11in,4) ;(evalrealheapsortbb12in,4) ;(evalrealheapsortbb13in,4) ;(evalrealheapsortbb14in,4) ;(evalrealheapsortbb16in,4) ;(evalrealheapsortbb17in,4) ;(evalrealheapsortbb18in,4) ;(evalrealheapsortbb2in,4) ;(evalrealheapsortbb3in,4) ;(evalrealheapsortbb4in,4) ;(evalrealheapsortbb5in,4) ;(evalrealheapsortbb6in,4) ;(evalrealheapsortbb7in,4) ;(evalrealheapsortbb8in,4) ;(evalrealheapsortbb9in,4) ;(evalrealheapsortentryin,4) ;(evalrealheapsortreturnin,4) ;(evalrealheapsortstart,4) ;(evalrealheapsortstop,4) ;(exitus616,4)} Flow Graph: [0->{1,2},1->{3,4},2->{58,59},3->{5,6},4->{41},5->{40},6->{8,11},8->{26},11->{40},26->{5,6},40->{3,4} ,41->{42,43},42->{44},43->{58,59},44->{45,46},45->{47,48},46->{57},47->{52},48->{50,51},50->{52},51->{53} ,52->{54,55},53->{54,55},54->{56},55->{45,46},56->{45,46},57->{42,43},58->{},59->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,4)] * Step 7: Failure MAYBE + Considered Problem: Rules: 0. evalrealheapsortstart(A,B,C,D) -> evalrealheapsortentryin(A,B,C,D) True (1,1) 1. evalrealheapsortentryin(A,B,C,D) -> evalrealheapsortbb6in(A,1,C,D) [A >= 3] (?,1) 2. evalrealheapsortentryin(A,B,C,D) -> evalrealheapsortreturnin(A,B,C,D) [2 >= A] (?,1) 3. evalrealheapsortbb6in(A,B,C,D) -> evalrealheapsortbb3in(A,B,B,D) [A >= 1 + B] (?,1) 4. evalrealheapsortbb6in(A,B,C,D) -> evalrealheapsortbb7in(A,B,C,D) [B >= A] (?,1) 5. evalrealheapsortbb3in(A,B,C,D) -> evalrealheapsortbb5in(A,B,C,D) [0 >= C] (?,1) 6. evalrealheapsortbb3in(A,B,C,D) -> evalrealheapsortbb4in(A,B,C,D) [C >= 1] (?,1) 8. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb2in(A,B,C,D) [C >= 0 && E >= 0 && 1 + C >= 2*E && 2*E >= C] (?,1) 11. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb5in(A,B,C,D) [C >= 0 && E >= 0 && 1 + C >= 2*E && 2*E >= C] (?,1) 26. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [C >= 0 (?,1) && F >= 0 && 1 + C >= 2*F && 2*F >= C && G >= 0 && 1 + C >= 2*G && 2*G >= C && E >= 0 && 1 + C >= 2*E && 2*E >= C] 40. evalrealheapsortbb5in(A,B,C,D) -> evalrealheapsortbb6in(A,1 + B,C,D) True (?,1) 41. evalrealheapsortbb7in(A,B,C,D) -> evalrealheapsortbb18in(A,0,C,D) True (?,1) 42. evalrealheapsortbb18in(A,B,C,D) -> evalrealheapsortbb8in(A,B,C,D) [A >= 2 + B] (?,1) 43. evalrealheapsortbb18in(A,B,C,D) -> evalrealheapsortreturnin(A,B,C,D) [1 + B >= A] (?,1) 44. evalrealheapsortbb8in(A,B,C,D) -> evalrealheapsortbb16in(A,B,0,D) True (?,1) 45. evalrealheapsortbb16in(A,B,C,D) -> evalrealheapsortbb9in(A,B,C,D) [A >= 3 + B + 2*C] (?,1) 46. evalrealheapsortbb16in(A,B,C,D) -> evalrealheapsortbb17in(A,B,C,D) [2 + B + 2*C >= A] (?,1) 47. evalrealheapsortbb9in(A,B,C,D) -> evalrealheapsortbb11in(A,B,C,D) [A = 3 + B + 2*C] (?,1) 48. evalrealheapsortbb9in(A,B,C,D) -> evalrealheapsortbb10in(A,B,C,D) [A >= 4 + B + 2*C] (?,1) 50. evalrealheapsortbb10in(A,B,C,D) -> evalrealheapsortbb11in(A,B,C,D) True (?,1) 51. evalrealheapsortbb10in(A,B,C,D) -> evalrealheapsortbb12in(A,B,C,D) True (?,1) 52. evalrealheapsortbb11in(A,B,C,D) -> evalrealheapsortbb13in(A,B,C,1 + 2*C) True (?,1) 53. evalrealheapsortbb12in(A,B,C,D) -> evalrealheapsortbb13in(A,B,C,2 + 2*C) True (?,1) 54. evalrealheapsortbb13in(A,B,C,D) -> evalrealheapsortbb14in(A,B,C,D) True (?,1) 55. evalrealheapsortbb13in(A,B,C,D) -> evalrealheapsortbb16in(A,B,A,D) True (?,1) 56. evalrealheapsortbb14in(A,B,C,D) -> evalrealheapsortbb16in(A,B,D,D) True (?,1) 57. evalrealheapsortbb17in(A,B,C,D) -> evalrealheapsortbb18in(A,1 + B,C,D) True (?,1) 58. evalrealheapsortreturnin(A,B,C,D) -> evalrealheapsortstop(A,B,C,D) True (?,1) 59. evalrealheapsortreturnin(A,B,C,D) -> exitus616(A,B,C,D) True (?,1) Signature: {(evalrealheapsortbb10in,4) ;(evalrealheapsortbb11in,4) ;(evalrealheapsortbb12in,4) ;(evalrealheapsortbb13in,4) ;(evalrealheapsortbb14in,4) ;(evalrealheapsortbb16in,4) ;(evalrealheapsortbb17in,4) ;(evalrealheapsortbb18in,4) ;(evalrealheapsortbb2in,4) ;(evalrealheapsortbb3in,4) ;(evalrealheapsortbb4in,4) ;(evalrealheapsortbb5in,4) ;(evalrealheapsortbb6in,4) ;(evalrealheapsortbb7in,4) ;(evalrealheapsortbb8in,4) ;(evalrealheapsortbb9in,4) ;(evalrealheapsortentryin,4) ;(evalrealheapsortreturnin,4) ;(evalrealheapsortstart,4) ;(evalrealheapsortstop,4) ;(exitus616,4)} Flow Graph: [0->{1,2},1->{3},2->{58,59},3->{5,6},4->{41},5->{40},6->{8,11},8->{26},11->{40},26->{5,6},40->{3,4} ,41->{42,43},42->{44},43->{58,59},44->{45,46},45->{47,48},46->{57},47->{52},48->{50,51},50->{52},51->{53} ,52->{54,55},53->{54,55},54->{56},55->{45,46},56->{45,46},57->{42,43},58->{},59->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,8,11,26,40,41,42,43,44,45,46,47,48,50,51,52,53,54,55,56,57,58,59] | +- p:[3,40,5,26,8,6,11] c: [3] | | | `- p:[6,26,8] c: [26] | `- p:[42,57,46,44,55,52,47,45,56,54,53,51,48,50] c: [42] | `- p:[45,55,52,47,50,48,53,51,56,54] c: [] MAYBE