YES(?,PRIMREC) * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. evalfstart(A,B,C,D,E) -> evalfentryin(A,B,C,D,E) True (1,1) 1. evalfentryin(A,B,C,D,E) -> evalfbb10in(1,B,C,D,E) True (?,1) 2. evalfbb10in(A,B,C,D,E) -> evalfbb8in(A,B,1,D,E) [-1 + A >= 0 && B >= A] (?,1) 3. evalfbb10in(A,B,C,D,E) -> evalfreturnin(A,B,C,D,E) [-1 + A >= 0 && A >= 1 + B] (?,1) 4. evalfbb8in(A,B,C,D,E) -> evalfbb6in(A,B,C,1 + A,E) [1 + B + -1*C >= 0 (?,1) && 1 + A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0 && A >= C] 5. evalfbb8in(A,B,C,D,E) -> evalfbb10in(1 + A,B,C,D,E) [1 + B + -1*C >= 0 (?,1) && 1 + A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0 && C >= 1 + A] 6. evalfbb6in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1) [1 + B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -3 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0 && B >= D] 7. evalfbb6in(A,B,C,D,E) -> evalfbb7in(A,B,C,D,E) [1 + B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -3 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0 && D >= 1 + B] 8. evalfbb4in(A,B,C,D,E) -> evalfbb3in(A,B,C,D,E) [-1 + E >= 0 (?,1) && -3 + D + E >= 0 && -2 + C + E >= 0 && -3 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -2 + A + C >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && D >= E] 9. evalfbb4in(A,B,C,D,E) -> evalfbb5in(A,B,C,D,E) [-1 + E >= 0 (?,1) && -3 + D + E >= 0 && -2 + C + E >= 0 && -3 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -2 + A + C >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && E >= 1 + D] 10. evalfbb3in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1 + E) [D + -1*E >= 0 (?,1) && B + -1*E >= 0 && -1 + E >= 0 && -3 + D + E >= 0 && -2 + C + E >= 0 && -3 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -2 + A + C >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] 11. evalfbb5in(A,B,C,D,E) -> evalfbb6in(A,B,C,1 + D,E) [-3 + E >= 0 (?,1) && -5 + D + E >= 0 && -1 + -1*D + E >= 0 && -4 + C + E >= 0 && -2 + -1*C + E >= 0 && -5 + B + E >= 0 && -4 + A + E >= 0 && -2 + -1*A + E >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -2 + A + C >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] 12. evalfbb7in(A,B,C,D,E) -> evalfbb8in(A,B,1 + C,D,E) [1 + B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -3 + B + D >= 0 && -1 + -1*B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0] 13. evalfreturnin(A,B,C,D,E) -> evalfstop(A,B,C,D,E) [-1 + A + -1*B >= 0 && -1 + A >= 0] (?,1) Signature: {(evalfbb10in,5) ;(evalfbb3in,5) ;(evalfbb4in,5) ;(evalfbb5in,5) ;(evalfbb6in,5) ;(evalfbb7in,5) ;(evalfbb8in,5) ;(evalfentryin,5) ;(evalfreturnin,5) ;(evalfstart,5) ;(evalfstop,5)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{13},4->{6,7},5->{2,3},6->{8,9},7->{12},8->{10},9->{11},10->{8,9},11->{6,7} ,12->{4,5},13->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths MAYBE + Considered Problem: Rules: 0. evalfstart(A,B,C,D,E) -> evalfentryin(A,B,C,D,E) True (1,1) 1. evalfentryin(A,B,C,D,E) -> evalfbb10in(1,B,C,D,E) True (1,1) 2. evalfbb10in(A,B,C,D,E) -> evalfbb8in(A,B,1,D,E) [-1 + A >= 0 && B >= A] (?,1) 3. evalfbb10in(A,B,C,D,E) -> evalfreturnin(A,B,C,D,E) [-1 + A >= 0 && A >= 1 + B] (1,1) 4. evalfbb8in(A,B,C,D,E) -> evalfbb6in(A,B,C,1 + A,E) [1 + B + -1*C >= 0 (?,1) && 1 + A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0 && A >= C] 5. evalfbb8in(A,B,C,D,E) -> evalfbb10in(1 + A,B,C,D,E) [1 + B + -1*C >= 0 (?,1) && 1 + A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0 && C >= 1 + A] 6. evalfbb6in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1) [1 + B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -3 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0 && B >= D] 7. evalfbb6in(A,B,C,D,E) -> evalfbb7in(A,B,C,D,E) [1 + B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -3 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0 && D >= 1 + B] 8. evalfbb4in(A,B,C,D,E) -> evalfbb3in(A,B,C,D,E) [-1 + E >= 0 (?,1) && -3 + D + E >= 0 && -2 + C + E >= 0 && -3 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -2 + A + C >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && D >= E] 9. evalfbb4in(A,B,C,D,E) -> evalfbb5in(A,B,C,D,E) [-1 + E >= 0 (?,1) && -3 + D + E >= 0 && -2 + C + E >= 0 && -3 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -2 + A + C >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && E >= 1 + D] 10. evalfbb3in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1 + E) [D + -1*E >= 0 (?,1) && B + -1*E >= 0 && -1 + E >= 0 && -3 + D + E >= 0 && -2 + C + E >= 0 && -3 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -2 + A + C >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] 11. evalfbb5in(A,B,C,D,E) -> evalfbb6in(A,B,C,1 + D,E) [-3 + E >= 0 (?,1) && -5 + D + E >= 0 && -1 + -1*D + E >= 0 && -4 + C + E >= 0 && -2 + -1*C + E >= 0 && -5 + B + E >= 0 && -4 + A + E >= 0 && -2 + -1*A + E >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -2 + A + C >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] 12. evalfbb7in(A,B,C,D,E) -> evalfbb8in(A,B,1 + C,D,E) [1 + B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -3 + B + D >= 0 && -1 + -1*B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0] 13. evalfreturnin(A,B,C,D,E) -> evalfstop(A,B,C,D,E) [-1 + A + -1*B >= 0 && -1 + A >= 0] (1,1) Signature: {(evalfbb10in,5) ;(evalfbb3in,5) ;(evalfbb4in,5) ;(evalfbb5in,5) ;(evalfbb6in,5) ;(evalfbb7in,5) ;(evalfbb8in,5) ;(evalfentryin,5) ;(evalfreturnin,5) ;(evalfstart,5) ;(evalfstop,5)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{13},4->{6,7},5->{2,3},6->{8,9},7->{12},8->{10},9->{11},10->{8,9},11->{6,7} ,12->{4,5},13->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(2,5),(6,9)] * Step 3: AddSinks MAYBE + Considered Problem: Rules: 0. evalfstart(A,B,C,D,E) -> evalfentryin(A,B,C,D,E) True (1,1) 1. evalfentryin(A,B,C,D,E) -> evalfbb10in(1,B,C,D,E) True (1,1) 2. evalfbb10in(A,B,C,D,E) -> evalfbb8in(A,B,1,D,E) [-1 + A >= 0 && B >= A] (?,1) 3. evalfbb10in(A,B,C,D,E) -> evalfreturnin(A,B,C,D,E) [-1 + A >= 0 && A >= 1 + B] (1,1) 4. evalfbb8in(A,B,C,D,E) -> evalfbb6in(A,B,C,1 + A,E) [1 + B + -1*C >= 0 (?,1) && 1 + A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0 && A >= C] 5. evalfbb8in(A,B,C,D,E) -> evalfbb10in(1 + A,B,C,D,E) [1 + B + -1*C >= 0 (?,1) && 1 + A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0 && C >= 1 + A] 6. evalfbb6in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1) [1 + B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -3 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0 && B >= D] 7. evalfbb6in(A,B,C,D,E) -> evalfbb7in(A,B,C,D,E) [1 + B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -3 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0 && D >= 1 + B] 8. evalfbb4in(A,B,C,D,E) -> evalfbb3in(A,B,C,D,E) [-1 + E >= 0 (?,1) && -3 + D + E >= 0 && -2 + C + E >= 0 && -3 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -2 + A + C >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && D >= E] 9. evalfbb4in(A,B,C,D,E) -> evalfbb5in(A,B,C,D,E) [-1 + E >= 0 (?,1) && -3 + D + E >= 0 && -2 + C + E >= 0 && -3 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -2 + A + C >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && E >= 1 + D] 10. evalfbb3in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1 + E) [D + -1*E >= 0 (?,1) && B + -1*E >= 0 && -1 + E >= 0 && -3 + D + E >= 0 && -2 + C + E >= 0 && -3 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -2 + A + C >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] 11. evalfbb5in(A,B,C,D,E) -> evalfbb6in(A,B,C,1 + D,E) [-3 + E >= 0 (?,1) && -5 + D + E >= 0 && -1 + -1*D + E >= 0 && -4 + C + E >= 0 && -2 + -1*C + E >= 0 && -5 + B + E >= 0 && -4 + A + E >= 0 && -2 + -1*A + E >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -2 + A + C >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] 12. evalfbb7in(A,B,C,D,E) -> evalfbb8in(A,B,1 + C,D,E) [1 + B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -3 + B + D >= 0 && -1 + -1*B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0] 13. evalfreturnin(A,B,C,D,E) -> evalfstop(A,B,C,D,E) [-1 + A + -1*B >= 0 && -1 + A >= 0] (1,1) Signature: {(evalfbb10in,5) ;(evalfbb3in,5) ;(evalfbb4in,5) ;(evalfbb5in,5) ;(evalfbb6in,5) ;(evalfbb7in,5) ;(evalfbb8in,5) ;(evalfentryin,5) ;(evalfreturnin,5) ;(evalfstart,5) ;(evalfstop,5)} Flow Graph: [0->{1},1->{2,3},2->{4},3->{13},4->{6,7},5->{2,3},6->{8},7->{12},8->{10},9->{11},10->{8,9},11->{6,7} ,12->{4,5},13->{}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths MAYBE + Considered Problem: Rules: 0. evalfstart(A,B,C,D,E) -> evalfentryin(A,B,C,D,E) True (1,1) 1. evalfentryin(A,B,C,D,E) -> evalfbb10in(1,B,C,D,E) True (?,1) 2. evalfbb10in(A,B,C,D,E) -> evalfbb8in(A,B,1,D,E) [-1 + A >= 0 && B >= A] (?,1) 3. evalfbb10in(A,B,C,D,E) -> evalfreturnin(A,B,C,D,E) [-1 + A >= 0 && A >= 1 + B] (?,1) 4. evalfbb8in(A,B,C,D,E) -> evalfbb6in(A,B,C,1 + A,E) [1 + B + -1*C >= 0 (?,1) && 1 + A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0 && A >= C] 5. evalfbb8in(A,B,C,D,E) -> evalfbb10in(1 + A,B,C,D,E) [1 + B + -1*C >= 0 (?,1) && 1 + A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0 && C >= 1 + A] 6. evalfbb6in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1) [1 + B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -3 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0 && B >= D] 7. evalfbb6in(A,B,C,D,E) -> evalfbb7in(A,B,C,D,E) [1 + B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -3 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0 && D >= 1 + B] 8. evalfbb4in(A,B,C,D,E) -> evalfbb3in(A,B,C,D,E) [-1 + E >= 0 (?,1) && -3 + D + E >= 0 && -2 + C + E >= 0 && -3 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -2 + A + C >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && D >= E] 9. evalfbb4in(A,B,C,D,E) -> evalfbb5in(A,B,C,D,E) [-1 + E >= 0 (?,1) && -3 + D + E >= 0 && -2 + C + E >= 0 && -3 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -2 + A + C >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && E >= 1 + D] 10. evalfbb3in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1 + E) [D + -1*E >= 0 (?,1) && B + -1*E >= 0 && -1 + E >= 0 && -3 + D + E >= 0 && -2 + C + E >= 0 && -3 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -2 + A + C >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] 11. evalfbb5in(A,B,C,D,E) -> evalfbb6in(A,B,C,1 + D,E) [-3 + E >= 0 (?,1) && -5 + D + E >= 0 && -1 + -1*D + E >= 0 && -4 + C + E >= 0 && -2 + -1*C + E >= 0 && -5 + B + E >= 0 && -4 + A + E >= 0 && -2 + -1*A + E >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -2 + A + C >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] 12. evalfbb7in(A,B,C,D,E) -> evalfbb8in(A,B,1 + C,D,E) [1 + B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -3 + B + D >= 0 && -1 + -1*B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0] 13. evalfreturnin(A,B,C,D,E) -> evalfstop(A,B,C,D,E) [-1 + A + -1*B >= 0 && -1 + A >= 0] (?,1) 14. evalfreturnin(A,B,C,D,E) -> exitus616(A,B,C,D,E) True (?,1) Signature: {(evalfbb10in,5) ;(evalfbb3in,5) ;(evalfbb4in,5) ;(evalfbb5in,5) ;(evalfbb6in,5) ;(evalfbb7in,5) ;(evalfbb8in,5) ;(evalfentryin,5) ;(evalfreturnin,5) ;(evalfstart,5) ;(evalfstop,5) ;(exitus616,5)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{13,14},4->{6,7},5->{2,3},6->{8,9},7->{12},8->{10},9->{11},10->{8,9},11->{6 ,7},12->{4,5},13->{},14->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(2,5),(6,9)] * Step 5: LooptreeTransformer MAYBE + Considered Problem: Rules: 0. evalfstart(A,B,C,D,E) -> evalfentryin(A,B,C,D,E) True (1,1) 1. evalfentryin(A,B,C,D,E) -> evalfbb10in(1,B,C,D,E) True (?,1) 2. evalfbb10in(A,B,C,D,E) -> evalfbb8in(A,B,1,D,E) [-1 + A >= 0 && B >= A] (?,1) 3. evalfbb10in(A,B,C,D,E) -> evalfreturnin(A,B,C,D,E) [-1 + A >= 0 && A >= 1 + B] (?,1) 4. evalfbb8in(A,B,C,D,E) -> evalfbb6in(A,B,C,1 + A,E) [1 + B + -1*C >= 0 (?,1) && 1 + A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0 && A >= C] 5. evalfbb8in(A,B,C,D,E) -> evalfbb10in(1 + A,B,C,D,E) [1 + B + -1*C >= 0 (?,1) && 1 + A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0 && C >= 1 + A] 6. evalfbb6in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1) [1 + B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -3 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0 && B >= D] 7. evalfbb6in(A,B,C,D,E) -> evalfbb7in(A,B,C,D,E) [1 + B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -3 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0 && D >= 1 + B] 8. evalfbb4in(A,B,C,D,E) -> evalfbb3in(A,B,C,D,E) [-1 + E >= 0 (?,1) && -3 + D + E >= 0 && -2 + C + E >= 0 && -3 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -2 + A + C >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && D >= E] 9. evalfbb4in(A,B,C,D,E) -> evalfbb5in(A,B,C,D,E) [-1 + E >= 0 (?,1) && -3 + D + E >= 0 && -2 + C + E >= 0 && -3 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -2 + A + C >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && E >= 1 + D] 10. evalfbb3in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1 + E) [D + -1*E >= 0 (?,1) && B + -1*E >= 0 && -1 + E >= 0 && -3 + D + E >= 0 && -2 + C + E >= 0 && -3 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -2 + A + C >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] 11. evalfbb5in(A,B,C,D,E) -> evalfbb6in(A,B,C,1 + D,E) [-3 + E >= 0 (?,1) && -5 + D + E >= 0 && -1 + -1*D + E >= 0 && -4 + C + E >= 0 && -2 + -1*C + E >= 0 && -5 + B + E >= 0 && -4 + A + E >= 0 && -2 + -1*A + E >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -2 + A + C >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] 12. evalfbb7in(A,B,C,D,E) -> evalfbb8in(A,B,1 + C,D,E) [1 + B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -3 + B + D >= 0 && -1 + -1*B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0] 13. evalfreturnin(A,B,C,D,E) -> evalfstop(A,B,C,D,E) [-1 + A + -1*B >= 0 && -1 + A >= 0] (?,1) 14. evalfreturnin(A,B,C,D,E) -> exitus616(A,B,C,D,E) True (?,1) Signature: {(evalfbb10in,5) ;(evalfbb3in,5) ;(evalfbb4in,5) ;(evalfbb5in,5) ;(evalfbb6in,5) ;(evalfbb7in,5) ;(evalfbb8in,5) ;(evalfentryin,5) ;(evalfreturnin,5) ;(evalfstart,5) ;(evalfstop,5) ;(exitus616,5)} Flow Graph: [0->{1},1->{2,3},2->{4},3->{13,14},4->{6,7},5->{2,3},6->{8},7->{12},8->{10},9->{11},10->{8,9},11->{6,7} ,12->{4,5},13->{},14->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14] | `- p:[2,5,12,7,4,11,9,10,8,6] c: [5] | `- p:[4,12,7,11,9,10,8,6] c: [12] | `- p:[6,11,9,10,8] c: [11] | `- p:[8,10] c: [10] * Step 6: SizeAbstraction MAYBE + Considered Problem: (Rules: 0. evalfstart(A,B,C,D,E) -> evalfentryin(A,B,C,D,E) True (1,1) 1. evalfentryin(A,B,C,D,E) -> evalfbb10in(1,B,C,D,E) True (?,1) 2. evalfbb10in(A,B,C,D,E) -> evalfbb8in(A,B,1,D,E) [-1 + A >= 0 && B >= A] (?,1) 3. evalfbb10in(A,B,C,D,E) -> evalfreturnin(A,B,C,D,E) [-1 + A >= 0 && A >= 1 + B] (?,1) 4. evalfbb8in(A,B,C,D,E) -> evalfbb6in(A,B,C,1 + A,E) [1 + B + -1*C >= 0 (?,1) && 1 + A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0 && A >= C] 5. evalfbb8in(A,B,C,D,E) -> evalfbb10in(1 + A,B,C,D,E) [1 + B + -1*C >= 0 (?,1) && 1 + A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0 && C >= 1 + A] 6. evalfbb6in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1) [1 + B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -3 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0 && B >= D] 7. evalfbb6in(A,B,C,D,E) -> evalfbb7in(A,B,C,D,E) [1 + B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -3 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0 && D >= 1 + B] 8. evalfbb4in(A,B,C,D,E) -> evalfbb3in(A,B,C,D,E) [-1 + E >= 0 (?,1) && -3 + D + E >= 0 && -2 + C + E >= 0 && -3 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -2 + A + C >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && D >= E] 9. evalfbb4in(A,B,C,D,E) -> evalfbb5in(A,B,C,D,E) [-1 + E >= 0 (?,1) && -3 + D + E >= 0 && -2 + C + E >= 0 && -3 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -2 + A + C >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && E >= 1 + D] 10. evalfbb3in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1 + E) [D + -1*E >= 0 (?,1) && B + -1*E >= 0 && -1 + E >= 0 && -3 + D + E >= 0 && -2 + C + E >= 0 && -3 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -2 + A + C >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] 11. evalfbb5in(A,B,C,D,E) -> evalfbb6in(A,B,C,1 + D,E) [-3 + E >= 0 (?,1) && -5 + D + E >= 0 && -1 + -1*D + E >= 0 && -4 + C + E >= 0 && -2 + -1*C + E >= 0 && -5 + B + E >= 0 && -4 + A + E >= 0 && -2 + -1*A + E >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -2 + A + C >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] 12. evalfbb7in(A,B,C,D,E) -> evalfbb8in(A,B,1 + C,D,E) [1 + B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -3 + B + D >= 0 && -1 + -1*B + D >= 0 && -3 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1*A + B >= 0 && -1 + A >= 0] 13. evalfreturnin(A,B,C,D,E) -> evalfstop(A,B,C,D,E) [-1 + A + -1*B >= 0 && -1 + A >= 0] (?,1) 14. evalfreturnin(A,B,C,D,E) -> exitus616(A,B,C,D,E) True (?,1) Signature: {(evalfbb10in,5) ;(evalfbb3in,5) ;(evalfbb4in,5) ;(evalfbb5in,5) ;(evalfbb6in,5) ;(evalfbb7in,5) ;(evalfbb8in,5) ;(evalfentryin,5) ;(evalfreturnin,5) ;(evalfstart,5) ;(evalfstop,5) ;(exitus616,5)} Flow Graph: [0->{1},1->{2,3},2->{4},3->{13,14},4->{6,7},5->{2,3},6->{8},7->{12},8->{10},9->{11},10->{8,9},11->{6,7} ,12->{4,5},13->{},14->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14] | `- p:[2,5,12,7,4,11,9,10,8,6] c: [5] | `- p:[4,12,7,11,9,10,8,6] c: [12] | `- p:[6,11,9,10,8] c: [11] | `- p:[8,10] c: [10]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 7: FlowAbstraction MAYBE + Considered Problem: Program: Domain: [A,B,C,D,E,0.0,0.0.0,0.0.0.0,0.0.0.0.0] evalfstart ~> evalfentryin [A <= A, B <= B, C <= C, D <= D, E <= E] evalfentryin ~> evalfbb10in [A <= K, B <= B, C <= C, D <= D, E <= E] evalfbb10in ~> evalfbb8in [A <= A, B <= B, C <= K, D <= D, E <= E] evalfbb10in ~> evalfreturnin [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb8in ~> evalfbb6in [A <= A, B <= B, C <= C, D <= B + C, E <= E] evalfbb8in ~> evalfbb10in [A <= C, B <= B, C <= C, D <= D, E <= E] evalfbb6in ~> evalfbb4in [A <= A, B <= B, C <= C, D <= D, E <= K] evalfbb6in ~> evalfbb7in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb4in ~> evalfbb3in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb4in ~> evalfbb5in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb3in ~> evalfbb4in [A <= A, B <= B, C <= C, D <= D, E <= B + D] evalfbb5in ~> evalfbb6in [A <= A, B <= B, C <= C, D <= E, E <= E] evalfbb7in ~> evalfbb8in [A <= A, B <= B, C <= D, D <= D, E <= E] evalfreturnin ~> evalfstop [A <= A, B <= B, C <= C, D <= D, E <= E] evalfreturnin ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E] + Loop: [0.0 <= K + A + B] evalfbb10in ~> evalfbb8in [A <= A, B <= B, C <= K, D <= D, E <= E] evalfbb8in ~> evalfbb10in [A <= C, B <= B, C <= C, D <= D, E <= E] evalfbb7in ~> evalfbb8in [A <= A, B <= B, C <= D, D <= D, E <= E] evalfbb6in ~> evalfbb7in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb8in ~> evalfbb6in [A <= A, B <= B, C <= C, D <= B + C, E <= E] evalfbb5in ~> evalfbb6in [A <= A, B <= B, C <= C, D <= E, E <= E] evalfbb4in ~> evalfbb5in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb3in ~> evalfbb4in [A <= A, B <= B, C <= C, D <= D, E <= B + D] evalfbb4in ~> evalfbb3in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb6in ~> evalfbb4in [A <= A, B <= B, C <= C, D <= D, E <= K] + Loop: [0.0.0 <= 2*B + C] evalfbb8in ~> evalfbb6in [A <= A, B <= B, C <= C, D <= B + C, E <= E] evalfbb7in ~> evalfbb8in [A <= A, B <= B, C <= D, D <= D, E <= E] evalfbb6in ~> evalfbb7in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb5in ~> evalfbb6in [A <= A, B <= B, C <= C, D <= E, E <= E] evalfbb4in ~> evalfbb5in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb3in ~> evalfbb4in [A <= A, B <= B, C <= C, D <= D, E <= B + D] evalfbb4in ~> evalfbb3in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb6in ~> evalfbb4in [A <= A, B <= B, C <= C, D <= D, E <= K] + Loop: [0.0.0.0 <= K + 2*B + D] evalfbb6in ~> evalfbb4in [A <= A, B <= B, C <= C, D <= D, E <= K] evalfbb5in ~> evalfbb6in [A <= A, B <= B, C <= C, D <= E, E <= E] evalfbb4in ~> evalfbb5in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb3in ~> evalfbb4in [A <= A, B <= B, C <= C, D <= D, E <= B + D] evalfbb4in ~> evalfbb3in [A <= A, B <= B, C <= C, D <= D, E <= E] + Loop: [0.0.0.0.0 <= K + D + E] evalfbb4in ~> evalfbb3in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb3in ~> evalfbb4in [A <= A, B <= B, C <= C, D <= D, E <= B + D] + Applied Processor: FlowAbstraction + Details: () * Step 8: LareProcessor MAYBE + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,0.0,0.0.0,0.0.0.0,0.0.0.0.0] evalfstart ~> evalfentryin [] evalfentryin ~> evalfbb10in [K ~=> A] evalfbb10in ~> evalfbb8in [K ~=> C] evalfbb10in ~> evalfreturnin [] evalfbb8in ~> evalfbb6in [B ~+> D,C ~+> D] evalfbb8in ~> evalfbb10in [C ~=> A] evalfbb6in ~> evalfbb4in [K ~=> E] evalfbb6in ~> evalfbb7in [] evalfbb4in ~> evalfbb3in [] evalfbb4in ~> evalfbb5in [] evalfbb3in ~> evalfbb4in [B ~+> E,D ~+> E] evalfbb5in ~> evalfbb6in [E ~=> D] evalfbb7in ~> evalfbb8in [D ~=> C] evalfreturnin ~> evalfstop [] evalfreturnin ~> exitus616 [] + Loop: [A ~+> 0.0,B ~+> 0.0,K ~+> 0.0] evalfbb10in ~> evalfbb8in [K ~=> C] evalfbb8in ~> evalfbb10in [C ~=> A] evalfbb7in ~> evalfbb8in [D ~=> C] evalfbb6in ~> evalfbb7in [] evalfbb8in ~> evalfbb6in [B ~+> D,C ~+> D] evalfbb5in ~> evalfbb6in [E ~=> D] evalfbb4in ~> evalfbb5in [] evalfbb3in ~> evalfbb4in [B ~+> E,D ~+> E] evalfbb4in ~> evalfbb3in [] evalfbb6in ~> evalfbb4in [K ~=> E] + Loop: [C ~+> 0.0.0,B ~*> 0.0.0] evalfbb8in ~> evalfbb6in [B ~+> D,C ~+> D] evalfbb7in ~> evalfbb8in [D ~=> C] evalfbb6in ~> evalfbb7in [] evalfbb5in ~> evalfbb6in [E ~=> D] evalfbb4in ~> evalfbb5in [] evalfbb3in ~> evalfbb4in [B ~+> E,D ~+> E] evalfbb4in ~> evalfbb3in [] evalfbb6in ~> evalfbb4in [K ~=> E] + Loop: [D ~+> 0.0.0.0,K ~+> 0.0.0.0,B ~*> 0.0.0.0] evalfbb6in ~> evalfbb4in [K ~=> E] evalfbb5in ~> evalfbb6in [E ~=> D] evalfbb4in ~> evalfbb5in [] evalfbb3in ~> evalfbb4in [B ~+> E,D ~+> E] evalfbb4in ~> evalfbb3in [] + Loop: [D ~+> 0.0.0.0.0,E ~+> 0.0.0.0.0,K ~+> 0.0.0.0.0] evalfbb4in ~> evalfbb3in [] evalfbb3in ~> evalfbb4in [B ~+> E,D ~+> E] + Applied Processor: LareProcessor + Details: evalfstart ~> exitus616 [K ~=> A ,K ~=> C ,K ~=> D ,K ~=> E ,B ~+> A ,B ~+> C ,B ~+> D ,B ~+> E ,B ~+> 0.0 ,B ~+> 0.0.0 ,B ~+> 0.0.0.0 ,B ~+> 0.0.0.0.0 ,B ~+> tick ,tick ~+> tick ,K ~+> A ,K ~+> C ,K ~+> D ,K ~+> E ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,B ~*> A ,B ~*> C ,B ~*> D ,B ~*> E ,B ~*> 0.0.0 ,B ~*> 0.0.0.0 ,B ~*> 0.0.0.0.0 ,B ~*> tick ,K ~*> A ,K ~*> C ,K ~*> D ,K ~*> E ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> 0.0.0.0 ,K ~*> 0.0.0.0.0 ,K ~*> tick ,B ~^> A ,B ~^> C ,B ~^> D ,B ~^> E ,B ~^> 0.0.0 ,B ~^> 0.0.0.0 ,B ~^> 0.0.0.0.0 ,B ~^> tick ,K ~^> A ,K ~^> C ,K ~^> D ,K ~^> E ,K ~^> 0.0.0 ,K ~^> 0.0.0.0 ,K ~^> 0.0.0.0.0 ,K ~^> tick] evalfstart ~> evalfstop [K ~=> A ,K ~=> C ,K ~=> D ,K ~=> E ,B ~+> A ,B ~+> C ,B ~+> D ,B ~+> E ,B ~+> 0.0 ,B ~+> 0.0.0 ,B ~+> 0.0.0.0 ,B ~+> 0.0.0.0.0 ,B ~+> tick ,tick ~+> tick ,K ~+> A ,K ~+> C ,K ~+> D ,K ~+> E ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,B ~*> A ,B ~*> C ,B ~*> D ,B ~*> E ,B ~*> 0.0.0 ,B ~*> 0.0.0.0 ,B ~*> 0.0.0.0.0 ,B ~*> tick ,K ~*> A ,K ~*> C ,K ~*> D ,K ~*> E ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> 0.0.0.0 ,K ~*> 0.0.0.0.0 ,K ~*> tick ,B ~^> A ,B ~^> C ,B ~^> D ,B ~^> E ,B ~^> 0.0.0 ,B ~^> 0.0.0.0 ,B ~^> 0.0.0.0.0 ,B ~^> tick ,K ~^> A ,K ~^> C ,K ~^> D ,K ~^> E ,K ~^> 0.0.0 ,K ~^> 0.0.0.0 ,K ~^> 0.0.0.0.0 ,K ~^> tick] + evalfbb10in> [K ~=> A ,K ~=> C ,K ~=> D ,K ~=> E ,A ~+> 0.0 ,A ~+> tick ,B ~+> A ,B ~+> C ,B ~+> D ,B ~+> E ,B ~+> 0.0 ,B ~+> 0.0.0 ,B ~+> 0.0.0.0 ,B ~+> 0.0.0.0.0 ,B ~+> tick ,tick ~+> tick ,K ~+> A ,K ~+> C ,K ~+> D ,K ~+> E ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,A ~*> A ,A ~*> C ,A ~*> tick ,B ~*> A ,B ~*> C ,B ~*> D ,B ~*> E ,B ~*> 0.0.0 ,B ~*> 0.0.0.0 ,B ~*> 0.0.0.0.0 ,B ~*> tick ,K ~*> A ,K ~*> C ,K ~*> D ,K ~*> E ,K ~*> 0.0.0 ,K ~*> 0.0.0.0 ,K ~*> 0.0.0.0.0 ,K ~*> tick ,A ~^> A ,A ~^> C ,B ~^> A ,B ~^> C ,B ~^> D ,B ~^> E ,B ~^> 0.0.0 ,B ~^> 0.0.0.0 ,B ~^> 0.0.0.0.0 ,B ~^> tick ,K ~^> A ,K ~^> C ,K ~^> D ,K ~^> E ,K ~^> 0.0.0 ,K ~^> 0.0.0.0 ,K ~^> 0.0.0.0.0 ,K ~^> tick] + evalfbb8in> [K ~=> C ,K ~=> D ,K ~=> E ,B ~+> C ,B ~+> D ,B ~+> E ,B ~+> 0.0.0.0 ,B ~+> 0.0.0.0.0 ,B ~+> tick ,C ~+> C ,C ~+> D ,C ~+> E ,C ~+> 0.0.0 ,C ~+> 0.0.0.0 ,C ~+> 0.0.0.0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> C ,K ~+> D ,K ~+> E ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,B ~*> C ,B ~*> D ,B ~*> E ,B ~*> 0.0.0 ,B ~*> 0.0.0.0 ,B ~*> 0.0.0.0.0 ,B ~*> tick ,C ~*> C ,C ~*> D ,C ~*> E ,C ~*> 0.0.0.0 ,C ~*> 0.0.0.0.0 ,C ~*> tick ,K ~*> C ,K ~*> D ,K ~*> E ,K ~*> 0.0.0.0 ,K ~*> 0.0.0.0.0 ,K ~*> tick ,B ~^> C ,B ~^> D ,B ~^> E ,B ~^> 0.0.0.0 ,B ~^> 0.0.0.0.0 ,B ~^> tick ,C ~^> C ,C ~^> D ,C ~^> E ,C ~^> 0.0.0.0 ,C ~^> 0.0.0.0.0 ,C ~^> tick] + evalfbb6in> [K ~=> D ,K ~=> E ,B ~+> D ,B ~+> E ,B ~+> 0.0.0.0.0 ,B ~+> tick ,D ~+> D ,D ~+> E ,D ~+> 0.0.0.0 ,D ~+> 0.0.0.0.0 ,D ~+> tick ,tick ~+> tick ,K ~+> D ,K ~+> E ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,B ~*> D ,B ~*> E ,B ~*> 0.0.0.0 ,B ~*> 0.0.0.0.0 ,B ~*> tick ,D ~*> D ,D ~*> 0.0.0.0.0 ,D ~*> tick ,K ~*> D ,K ~*> 0.0.0.0.0 ,K ~*> tick] + evalfbb4in> [B ~+> E ,D ~+> E ,D ~+> 0.0.0.0.0 ,D ~+> tick ,E ~+> 0.0.0.0.0 ,E ~+> tick ,tick ~+> tick ,K ~+> 0.0.0.0.0 ,K ~+> tick] YES(?,PRIMREC)