YES * Step 1: TrivialSCCs YES + Considered Problem: Rules: 0. evalrealselectstart(A,B,C) -> evalrealselectentryin(A,B,C) True (1,1) 1. evalrealselectentryin(A,B,C) -> evalrealselectbb6in(0,B,C) True (?,1) 2. evalrealselectbb6in(A,B,C) -> evalrealselectbbin(A,B,C) [A >= 0 && B >= 2 + A] (?,1) 3. evalrealselectbb6in(A,B,C) -> evalrealselectreturnin(A,B,C) [A >= 0 && 1 + A >= B] (?,1) 4. evalrealselectbbin(A,B,C) -> evalrealselectbb4in(A,B,1 + A) [-2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0] (?,1) 5. evalrealselectbb4in(A,B,C) -> evalrealselectbb1in(A,B,C) [-1 + C >= 0 (?,1) && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && B >= 1 + C] 6. evalrealselectbb4in(A,B,C) -> evalrealselectbb5in(A,B,C) [-1 + C >= 0 (?,1) && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && C >= B] 7. evalrealselectbb1in(A,B,C) -> evalrealselectbb4in(A,B,1 + C) [-1 + B + -1*C >= 0 (?,1) && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && D >= 1 + E] 8. evalrealselectbb1in(A,B,C) -> evalrealselectbb4in(A,B,1 + C) [-1 + B + -1*C >= 0 (?,1) && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && E >= D] 9. evalrealselectbb5in(A,B,C) -> evalrealselectbb6in(1 + A,B,C) [-2 + C >= 0 (?,1) && -4 + B + C >= 0 && -1*B + C >= 0 && -2 + A + C >= 0 && -2 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0] 10. evalrealselectreturnin(A,B,C) -> evalrealselectstop(A,B,C) [1 + A + -1*B >= 0 && A >= 0] (?,1) Signature: {(evalrealselectbb1in,3) ;(evalrealselectbb4in,3) ;(evalrealselectbb5in,3) ;(evalrealselectbb6in,3) ;(evalrealselectbbin,3) ;(evalrealselectentryin,3) ;(evalrealselectreturnin,3) ;(evalrealselectstart,3) ;(evalrealselectstop,3)} Flow Graph: [0->{1},1->{2,3},2->{4},3->{10},4->{5,6},5->{7,8},6->{9},7->{5,6},8->{5,6},9->{2,3},10->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths YES + Considered Problem: Rules: 0. evalrealselectstart(A,B,C) -> evalrealselectentryin(A,B,C) True (1,1) 1. evalrealselectentryin(A,B,C) -> evalrealselectbb6in(0,B,C) True (1,1) 2. evalrealselectbb6in(A,B,C) -> evalrealselectbbin(A,B,C) [A >= 0 && B >= 2 + A] (?,1) 3. evalrealselectbb6in(A,B,C) -> evalrealselectreturnin(A,B,C) [A >= 0 && 1 + A >= B] (1,1) 4. evalrealselectbbin(A,B,C) -> evalrealselectbb4in(A,B,1 + A) [-2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0] (?,1) 5. evalrealselectbb4in(A,B,C) -> evalrealselectbb1in(A,B,C) [-1 + C >= 0 (?,1) && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && B >= 1 + C] 6. evalrealselectbb4in(A,B,C) -> evalrealselectbb5in(A,B,C) [-1 + C >= 0 (?,1) && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && C >= B] 7. evalrealselectbb1in(A,B,C) -> evalrealselectbb4in(A,B,1 + C) [-1 + B + -1*C >= 0 (?,1) && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && D >= 1 + E] 8. evalrealselectbb1in(A,B,C) -> evalrealselectbb4in(A,B,1 + C) [-1 + B + -1*C >= 0 (?,1) && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && E >= D] 9. evalrealselectbb5in(A,B,C) -> evalrealselectbb6in(1 + A,B,C) [-2 + C >= 0 (?,1) && -4 + B + C >= 0 && -1*B + C >= 0 && -2 + A + C >= 0 && -2 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0] 10. evalrealselectreturnin(A,B,C) -> evalrealselectstop(A,B,C) [1 + A + -1*B >= 0 && A >= 0] (1,1) Signature: {(evalrealselectbb1in,3) ;(evalrealselectbb4in,3) ;(evalrealselectbb5in,3) ;(evalrealselectbb6in,3) ;(evalrealselectbbin,3) ;(evalrealselectentryin,3) ;(evalrealselectreturnin,3) ;(evalrealselectstart,3) ;(evalrealselectstop,3)} Flow Graph: [0->{1},1->{2,3},2->{4},3->{10},4->{5,6},5->{7,8},6->{9},7->{5,6},8->{5,6},9->{2,3},10->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(4,6)] * Step 3: Looptree YES + Considered Problem: Rules: 0. evalrealselectstart(A,B,C) -> evalrealselectentryin(A,B,C) True (1,1) 1. evalrealselectentryin(A,B,C) -> evalrealselectbb6in(0,B,C) True (1,1) 2. evalrealselectbb6in(A,B,C) -> evalrealselectbbin(A,B,C) [A >= 0 && B >= 2 + A] (?,1) 3. evalrealselectbb6in(A,B,C) -> evalrealselectreturnin(A,B,C) [A >= 0 && 1 + A >= B] (1,1) 4. evalrealselectbbin(A,B,C) -> evalrealselectbb4in(A,B,1 + A) [-2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0] (?,1) 5. evalrealselectbb4in(A,B,C) -> evalrealselectbb1in(A,B,C) [-1 + C >= 0 (?,1) && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && B >= 1 + C] 6. evalrealselectbb4in(A,B,C) -> evalrealselectbb5in(A,B,C) [-1 + C >= 0 (?,1) && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && C >= B] 7. evalrealselectbb1in(A,B,C) -> evalrealselectbb4in(A,B,1 + C) [-1 + B + -1*C >= 0 (?,1) && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && D >= 1 + E] 8. evalrealselectbb1in(A,B,C) -> evalrealselectbb4in(A,B,1 + C) [-1 + B + -1*C >= 0 (?,1) && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && E >= D] 9. evalrealselectbb5in(A,B,C) -> evalrealselectbb6in(1 + A,B,C) [-2 + C >= 0 (?,1) && -4 + B + C >= 0 && -1*B + C >= 0 && -2 + A + C >= 0 && -2 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0] 10. evalrealselectreturnin(A,B,C) -> evalrealselectstop(A,B,C) [1 + A + -1*B >= 0 && A >= 0] (1,1) Signature: {(evalrealselectbb1in,3) ;(evalrealselectbb4in,3) ;(evalrealselectbb5in,3) ;(evalrealselectbb6in,3) ;(evalrealselectbbin,3) ;(evalrealselectentryin,3) ;(evalrealselectreturnin,3) ;(evalrealselectstart,3) ;(evalrealselectstop,3)} Flow Graph: [0->{1},1->{2,3},2->{4},3->{10},4->{5},5->{7,8},6->{9},7->{5,6},8->{5,6},9->{2,3},10->{}] + Applied Processor: Looptree + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10] | `- p:[2,9,6,7,5,4,8] c: [9] | `- p:[5,7,8] c: [8] | `- p:[5,7] c: [7] YES