YES(?,PRIMREC) * Step 1: UnsatRules MAYBE + Considered Problem: Rules: 0. evalcomplexstart(A,B,C,D,E) -> evalcomplexentryin(A,B,C,D,E) True (1,1) 1. evalcomplexentryin(A,B,C,D,E) -> evalcomplexbb10in(B,A,C,D,E) True (?,1) 2. evalcomplexbb10in(A,B,C,D,E) -> evalcomplexbb8in(A,B,A,B,E) [29 >= B] (?,1) 3. evalcomplexbb10in(A,B,C,D,E) -> evalcomplexreturnin(A,B,C,D,E) [B >= 30] (?,1) 4. evalcomplexbb8in(A,B,C,D,E) -> evalcomplexbb1in(A,B,C,D,E) [D >= 1 + C] (?,1) 5. evalcomplexbb8in(A,B,C,D,E) -> evalcomplexbb9in(A,B,C,D,E) [C >= D] (?,1) 6. evalcomplexbb1in(A,B,C,D,E) -> evalcomplexbb7in(A,B,C,D,7 + C) [C >= 6 && 2 >= C] (?,1) 7. evalcomplexbb1in(A,B,C,D,E) -> evalcomplexbb7in(A,B,C,D,7 + C) [C >= 6] (?,1) 8. evalcomplexbb1in(A,B,C,D,E) -> evalcomplexbb6in(A,B,C,D,7 + C) [C >= 6 && C >= 3 && 5 >= C] (?,1) 9. evalcomplexbb1in(A,B,C,D,E) -> evalcomplexbb7in(A,B,C,D,2 + C) [5 >= C && 7 >= C] (?,1) 10. evalcomplexbb1in(A,B,C,D,E) -> evalcomplexbb7in(A,B,C,D,2 + C) [5 >= C && C >= 11] (?,1) 11. evalcomplexbb1in(A,B,C,D,E) -> evalcomplexbb6in(A,B,C,D,2 + C) [5 >= C && C >= 8 && 10 >= C] (?,1) 12. evalcomplexbb7in(A,B,C,D,E) -> evalcomplexbb8in(A,B,E,1 + D,E) True (?,1) 13. evalcomplexbb6in(A,B,C,D,E) -> evalcomplexbb8in(A,B,E,10 + D,E) True (?,1) 14. evalcomplexbb9in(A,B,C,D,E) -> evalcomplexbb10in(-10 + C,2 + D,C,D,E) True (?,1) 15. evalcomplexreturnin(A,B,C,D,E) -> evalcomplexstop(A,B,C,D,E) True (?,1) Signature: {(evalcomplexbb10in,5) ;(evalcomplexbb1in,5) ;(evalcomplexbb6in,5) ;(evalcomplexbb7in,5) ;(evalcomplexbb8in,5) ;(evalcomplexbb9in,5) ;(evalcomplexentryin,5) ;(evalcomplexreturnin,5) ;(evalcomplexstart,5) ;(evalcomplexstop,5)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{15},4->{6,7,8,9,10,11},5->{14},6->{12},7->{12},8->{13},9->{12},10->{12} ,11->{13},12->{4,5},13->{4,5},14->{2,3},15->{}] + Applied Processor: UnsatRules + Details: Following transitions have unsatisfiable constraints and are removed: [6,8,10,11] * Step 2: UnreachableRules MAYBE + Considered Problem: Rules: 0. evalcomplexstart(A,B,C,D,E) -> evalcomplexentryin(A,B,C,D,E) True (1,1) 1. evalcomplexentryin(A,B,C,D,E) -> evalcomplexbb10in(B,A,C,D,E) True (?,1) 2. evalcomplexbb10in(A,B,C,D,E) -> evalcomplexbb8in(A,B,A,B,E) [29 >= B] (?,1) 3. evalcomplexbb10in(A,B,C,D,E) -> evalcomplexreturnin(A,B,C,D,E) [B >= 30] (?,1) 4. evalcomplexbb8in(A,B,C,D,E) -> evalcomplexbb1in(A,B,C,D,E) [D >= 1 + C] (?,1) 5. evalcomplexbb8in(A,B,C,D,E) -> evalcomplexbb9in(A,B,C,D,E) [C >= D] (?,1) 7. evalcomplexbb1in(A,B,C,D,E) -> evalcomplexbb7in(A,B,C,D,7 + C) [C >= 6] (?,1) 9. evalcomplexbb1in(A,B,C,D,E) -> evalcomplexbb7in(A,B,C,D,2 + C) [5 >= C && 7 >= C] (?,1) 12. evalcomplexbb7in(A,B,C,D,E) -> evalcomplexbb8in(A,B,E,1 + D,E) True (?,1) 13. evalcomplexbb6in(A,B,C,D,E) -> evalcomplexbb8in(A,B,E,10 + D,E) True (?,1) 14. evalcomplexbb9in(A,B,C,D,E) -> evalcomplexbb10in(-10 + C,2 + D,C,D,E) True (?,1) 15. evalcomplexreturnin(A,B,C,D,E) -> evalcomplexstop(A,B,C,D,E) True (?,1) Signature: {(evalcomplexbb10in,5) ;(evalcomplexbb1in,5) ;(evalcomplexbb6in,5) ;(evalcomplexbb7in,5) ;(evalcomplexbb8in,5) ;(evalcomplexbb9in,5) ;(evalcomplexentryin,5) ;(evalcomplexreturnin,5) ;(evalcomplexstart,5) ;(evalcomplexstop,5)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{15},4->{7,9},5->{14},7->{12},9->{12},12->{4,5},13->{4,5},14->{2,3},15->{}] + Applied Processor: UnreachableRules + Details: Following transitions are not reachable from the starting states and are revomed: [13] * Step 3: FromIts MAYBE + Considered Problem: Rules: 0. evalcomplexstart(A,B,C,D,E) -> evalcomplexentryin(A,B,C,D,E) True (1,1) 1. evalcomplexentryin(A,B,C,D,E) -> evalcomplexbb10in(B,A,C,D,E) True (?,1) 2. evalcomplexbb10in(A,B,C,D,E) -> evalcomplexbb8in(A,B,A,B,E) [29 >= B] (?,1) 3. evalcomplexbb10in(A,B,C,D,E) -> evalcomplexreturnin(A,B,C,D,E) [B >= 30] (?,1) 4. evalcomplexbb8in(A,B,C,D,E) -> evalcomplexbb1in(A,B,C,D,E) [D >= 1 + C] (?,1) 5. evalcomplexbb8in(A,B,C,D,E) -> evalcomplexbb9in(A,B,C,D,E) [C >= D] (?,1) 7. evalcomplexbb1in(A,B,C,D,E) -> evalcomplexbb7in(A,B,C,D,7 + C) [C >= 6] (?,1) 9. evalcomplexbb1in(A,B,C,D,E) -> evalcomplexbb7in(A,B,C,D,2 + C) [5 >= C && 7 >= C] (?,1) 12. evalcomplexbb7in(A,B,C,D,E) -> evalcomplexbb8in(A,B,E,1 + D,E) True (?,1) 14. evalcomplexbb9in(A,B,C,D,E) -> evalcomplexbb10in(-10 + C,2 + D,C,D,E) True (?,1) 15. evalcomplexreturnin(A,B,C,D,E) -> evalcomplexstop(A,B,C,D,E) True (?,1) Signature: {(evalcomplexbb10in,5) ;(evalcomplexbb1in,5) ;(evalcomplexbb6in,5) ;(evalcomplexbb7in,5) ;(evalcomplexbb8in,5) ;(evalcomplexbb9in,5) ;(evalcomplexentryin,5) ;(evalcomplexreturnin,5) ;(evalcomplexstart,5) ;(evalcomplexstop,5)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{15},4->{7,9},5->{14},7->{12},9->{12},12->{4,5},14->{2,3},15->{}] + Applied Processor: FromIts + Details: () * Step 4: AddSinks MAYBE + Considered Problem: Rules: evalcomplexstart(A,B,C,D,E) -> evalcomplexentryin(A,B,C,D,E) True evalcomplexentryin(A,B,C,D,E) -> evalcomplexbb10in(B,A,C,D,E) True evalcomplexbb10in(A,B,C,D,E) -> evalcomplexbb8in(A,B,A,B,E) [29 >= B] evalcomplexbb10in(A,B,C,D,E) -> evalcomplexreturnin(A,B,C,D,E) [B >= 30] evalcomplexbb8in(A,B,C,D,E) -> evalcomplexbb1in(A,B,C,D,E) [D >= 1 + C] evalcomplexbb8in(A,B,C,D,E) -> evalcomplexbb9in(A,B,C,D,E) [C >= D] evalcomplexbb1in(A,B,C,D,E) -> evalcomplexbb7in(A,B,C,D,7 + C) [C >= 6] evalcomplexbb1in(A,B,C,D,E) -> evalcomplexbb7in(A,B,C,D,2 + C) [5 >= C && 7 >= C] evalcomplexbb7in(A,B,C,D,E) -> evalcomplexbb8in(A,B,E,1 + D,E) True evalcomplexbb9in(A,B,C,D,E) -> evalcomplexbb10in(-10 + C,2 + D,C,D,E) True evalcomplexreturnin(A,B,C,D,E) -> evalcomplexstop(A,B,C,D,E) True Signature: {(evalcomplexbb10in,5) ;(evalcomplexbb1in,5) ;(evalcomplexbb6in,5) ;(evalcomplexbb7in,5) ;(evalcomplexbb8in,5) ;(evalcomplexbb9in,5) ;(evalcomplexentryin,5) ;(evalcomplexreturnin,5) ;(evalcomplexstart,5) ;(evalcomplexstop,5)} Rule Graph: [0->{1},1->{2,3},2->{4,5},3->{15},4->{7,9},5->{14},7->{12},9->{12},12->{4,5},14->{2,3},15->{}] + Applied Processor: AddSinks + Details: () * Step 5: Decompose MAYBE + Considered Problem: Rules: evalcomplexstart(A,B,C,D,E) -> evalcomplexentryin(A,B,C,D,E) True evalcomplexentryin(A,B,C,D,E) -> evalcomplexbb10in(B,A,C,D,E) True evalcomplexbb10in(A,B,C,D,E) -> evalcomplexbb8in(A,B,A,B,E) [29 >= B] evalcomplexbb10in(A,B,C,D,E) -> evalcomplexreturnin(A,B,C,D,E) [B >= 30] evalcomplexbb8in(A,B,C,D,E) -> evalcomplexbb1in(A,B,C,D,E) [D >= 1 + C] evalcomplexbb8in(A,B,C,D,E) -> evalcomplexbb9in(A,B,C,D,E) [C >= D] evalcomplexbb1in(A,B,C,D,E) -> evalcomplexbb7in(A,B,C,D,7 + C) [C >= 6] evalcomplexbb1in(A,B,C,D,E) -> evalcomplexbb7in(A,B,C,D,2 + C) [5 >= C && 7 >= C] evalcomplexbb7in(A,B,C,D,E) -> evalcomplexbb8in(A,B,E,1 + D,E) True evalcomplexbb9in(A,B,C,D,E) -> evalcomplexbb10in(-10 + C,2 + D,C,D,E) True evalcomplexreturnin(A,B,C,D,E) -> evalcomplexstop(A,B,C,D,E) True evalcomplexstop(A,B,C,D,E) -> exitus616(A,B,C,D,E) True Signature: {(evalcomplexbb10in,5) ;(evalcomplexbb1in,5) ;(evalcomplexbb6in,5) ;(evalcomplexbb7in,5) ;(evalcomplexbb8in,5) ;(evalcomplexbb9in,5) ;(evalcomplexentryin,5) ;(evalcomplexreturnin,5) ;(evalcomplexstart,5) ;(evalcomplexstop,5) ;(exitus616,5)} Rule Graph: [0->{1},1->{2,3},2->{4,5},3->{15},4->{7,9},5->{14},7->{12},9->{12},12->{4,5},14->{2,3},15->{16}] + Applied Processor: Decompose Greedy + Details: We construct a looptree: P: [0,1,2,3,4,5,7,9,12,14,15,16] | `- p:[2,14,5,12,7,4,9] c: [2,5,14] | `- p:[4,12,7,9] c: [4,7,9,12] * Step 6: AbstractSize MAYBE + Considered Problem: (Rules: evalcomplexstart(A,B,C,D,E) -> evalcomplexentryin(A,B,C,D,E) True evalcomplexentryin(A,B,C,D,E) -> evalcomplexbb10in(B,A,C,D,E) True evalcomplexbb10in(A,B,C,D,E) -> evalcomplexbb8in(A,B,A,B,E) [29 >= B] evalcomplexbb10in(A,B,C,D,E) -> evalcomplexreturnin(A,B,C,D,E) [B >= 30] evalcomplexbb8in(A,B,C,D,E) -> evalcomplexbb1in(A,B,C,D,E) [D >= 1 + C] evalcomplexbb8in(A,B,C,D,E) -> evalcomplexbb9in(A,B,C,D,E) [C >= D] evalcomplexbb1in(A,B,C,D,E) -> evalcomplexbb7in(A,B,C,D,7 + C) [C >= 6] evalcomplexbb1in(A,B,C,D,E) -> evalcomplexbb7in(A,B,C,D,2 + C) [5 >= C && 7 >= C] evalcomplexbb7in(A,B,C,D,E) -> evalcomplexbb8in(A,B,E,1 + D,E) True evalcomplexbb9in(A,B,C,D,E) -> evalcomplexbb10in(-10 + C,2 + D,C,D,E) True evalcomplexreturnin(A,B,C,D,E) -> evalcomplexstop(A,B,C,D,E) True evalcomplexstop(A,B,C,D,E) -> exitus616(A,B,C,D,E) True Signature: {(evalcomplexbb10in,5) ;(evalcomplexbb1in,5) ;(evalcomplexbb6in,5) ;(evalcomplexbb7in,5) ;(evalcomplexbb8in,5) ;(evalcomplexbb9in,5) ;(evalcomplexentryin,5) ;(evalcomplexreturnin,5) ;(evalcomplexstart,5) ;(evalcomplexstop,5) ;(exitus616,5)} Rule Graph: [0->{1},1->{2,3},2->{4,5},3->{15},4->{7,9},5->{14},7->{12},9->{12},12->{4,5},14->{2,3},15->{16}] ,We construct a looptree: P: [0,1,2,3,4,5,7,9,12,14,15,16] | `- p:[2,14,5,12,7,4,9] c: [2,5,14] | `- p:[4,12,7,9] c: [4,7,9,12]) + Applied Processor: AbstractSize Minimize + Details: () * Step 7: AbstractFlow MAYBE + Considered Problem: Program: Domain: [A,B,C,D,E,0.0,0.0.0] evalcomplexstart ~> evalcomplexentryin [A <= A, B <= B, C <= C, D <= D, E <= E] evalcomplexentryin ~> evalcomplexbb10in [A <= B, B <= A, C <= C, D <= D, E <= E] evalcomplexbb10in ~> evalcomplexbb8in [A <= A, B <= B, C <= A, D <= B, E <= E] evalcomplexbb10in ~> evalcomplexreturnin [A <= A, B <= B, C <= C, D <= D, E <= E] evalcomplexbb8in ~> evalcomplexbb1in [A <= A, B <= B, C <= C, D <= D, E <= E] evalcomplexbb8in ~> evalcomplexbb9in [A <= A, B <= B, C <= C, D <= D, E <= E] evalcomplexbb1in ~> evalcomplexbb7in [A <= A, B <= B, C <= C, D <= D, E <= 7*K + C] evalcomplexbb1in ~> evalcomplexbb7in [A <= A, B <= B, C <= C, D <= D, E <= 2*K + C] evalcomplexbb7in ~> evalcomplexbb8in [A <= A, B <= B, C <= E, D <= K + D, E <= E] evalcomplexbb9in ~> evalcomplexbb10in [A <= 10*K + C, B <= 2*K + D, C <= C, D <= D, E <= E] evalcomplexreturnin ~> evalcomplexstop [A <= A, B <= B, C <= C, D <= D, E <= E] evalcomplexstop ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E] + Loop: [0.0 <= 29*K + B] evalcomplexbb10in ~> evalcomplexbb8in [A <= A, B <= B, C <= A, D <= B, E <= E] evalcomplexbb9in ~> evalcomplexbb10in [A <= 10*K + C, B <= 2*K + D, C <= C, D <= D, E <= E] evalcomplexbb8in ~> evalcomplexbb9in [A <= A, B <= B, C <= C, D <= D, E <= E] evalcomplexbb7in ~> evalcomplexbb8in [A <= A, B <= B, C <= E, D <= K + D, E <= E] evalcomplexbb1in ~> evalcomplexbb7in [A <= A, B <= B, C <= C, D <= D, E <= 7*K + C] evalcomplexbb8in ~> evalcomplexbb1in [A <= A, B <= B, C <= C, D <= D, E <= E] evalcomplexbb1in ~> evalcomplexbb7in [A <= A, B <= B, C <= C, D <= D, E <= 2*K + C] + Loop: [0.0.0 <= 7*K + C + D] evalcomplexbb8in ~> evalcomplexbb1in [A <= A, B <= B, C <= C, D <= D, E <= E] evalcomplexbb7in ~> evalcomplexbb8in [A <= A, B <= B, C <= E, D <= K + D, E <= E] evalcomplexbb1in ~> evalcomplexbb7in [A <= A, B <= B, C <= C, D <= D, E <= 7*K + C] evalcomplexbb1in ~> evalcomplexbb7in [A <= A, B <= B, C <= C, D <= D, E <= 2*K + C] + Applied Processor: AbstractFlow + Details: () * Step 8: Lare MAYBE + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,0.0,0.0.0] evalcomplexstart ~> evalcomplexentryin [] evalcomplexentryin ~> evalcomplexbb10in [A ~=> B,B ~=> A] evalcomplexbb10in ~> evalcomplexbb8in [A ~=> C,B ~=> D] evalcomplexbb10in ~> evalcomplexreturnin [] evalcomplexbb8in ~> evalcomplexbb1in [] evalcomplexbb8in ~> evalcomplexbb9in [] evalcomplexbb1in ~> evalcomplexbb7in [C ~+> E,K ~*> E] evalcomplexbb1in ~> evalcomplexbb7in [C ~+> E,K ~*> E] evalcomplexbb7in ~> evalcomplexbb8in [E ~=> C,D ~+> D,K ~+> D] evalcomplexbb9in ~> evalcomplexbb10in [C ~+> A,D ~+> B,K ~*> A,K ~*> B] evalcomplexreturnin ~> evalcomplexstop [] evalcomplexstop ~> exitus616 [] + Loop: [B ~+> 0.0,K ~*> 0.0] evalcomplexbb10in ~> evalcomplexbb8in [A ~=> C,B ~=> D] evalcomplexbb9in ~> evalcomplexbb10in [C ~+> A,D ~+> B,K ~*> A,K ~*> B] evalcomplexbb8in ~> evalcomplexbb9in [] evalcomplexbb7in ~> evalcomplexbb8in [E ~=> C,D ~+> D,K ~+> D] evalcomplexbb1in ~> evalcomplexbb7in [C ~+> E,K ~*> E] evalcomplexbb8in ~> evalcomplexbb1in [] evalcomplexbb1in ~> evalcomplexbb7in [C ~+> E,K ~*> E] + Loop: [C ~+> 0.0.0,D ~+> 0.0.0,K ~*> 0.0.0] evalcomplexbb8in ~> evalcomplexbb1in [] evalcomplexbb7in ~> evalcomplexbb8in [E ~=> C,D ~+> D,K ~+> D] evalcomplexbb1in ~> evalcomplexbb7in [C ~+> E,K ~*> E] evalcomplexbb1in ~> evalcomplexbb7in [C ~+> E,K ~*> E] + Applied Processor: Lare + Details: evalcomplexstart ~> exitus616 [A ~=> B ,A ~=> D ,B ~=> A ,B ~=> C ,A ~+> B ,A ~+> D ,A ~+> 0.0 ,A ~+> 0.0.0 ,A ~+> tick ,B ~+> A ,B ~+> C ,B ~+> E ,B ~+> 0.0.0 ,B ~+> tick ,tick ~+> tick ,K ~+> B ,K ~+> D ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> A ,A ~*> B ,A ~*> C ,A ~*> D ,A ~*> E ,A ~*> 0.0.0 ,A ~*> tick ,B ~*> A ,B ~*> B ,B ~*> C ,B ~*> D ,B ~*> E ,B ~*> 0.0.0 ,B ~*> tick ,K ~*> A ,K ~*> B ,K ~*> C ,K ~*> D ,K ~*> E ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> tick ,A ~^> A ,A ~^> B ,A ~^> C ,A ~^> D ,A ~^> E ,A ~^> 0.0.0 ,A ~^> tick ,K ~^> A ,K ~^> B ,K ~^> C ,K ~^> D ,K ~^> E ,K ~^> 0.0.0 ,K ~^> tick] + evalcomplexbb10in> [A ~=> C ,B ~=> D ,A ~+> A ,A ~+> C ,A ~+> E ,A ~+> 0.0.0 ,A ~+> tick ,B ~+> B ,B ~+> D ,B ~+> 0.0 ,B ~+> 0.0.0 ,B ~+> tick ,tick ~+> tick ,K ~+> B ,K ~+> D ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> A ,A ~*> B ,A ~*> C ,A ~*> D ,A ~*> E ,A ~*> 0.0.0 ,A ~*> tick ,B ~*> A ,B ~*> B ,B ~*> C ,B ~*> D ,B ~*> E ,B ~*> 0.0.0 ,B ~*> tick ,K ~*> A ,K ~*> B ,K ~*> C ,K ~*> D ,K ~*> E ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> tick ,B ~^> A ,B ~^> B ,B ~^> C ,B ~^> D ,B ~^> E ,B ~^> 0.0.0 ,B ~^> tick ,K ~^> A ,K ~^> B ,K ~^> C ,K ~^> D ,K ~^> E ,K ~^> 0.0.0 ,K ~^> tick] + evalcomplexbb8in> [C ~+> C ,C ~+> E ,C ~+> 0.0.0 ,C ~+> tick ,D ~+> D ,D ~+> 0.0.0 ,D ~+> tick ,tick ~+> tick ,K ~+> D ,C ~*> C ,C ~*> D ,D ~*> C ,D ~*> D ,K ~*> C ,K ~*> D ,K ~*> E ,K ~*> 0.0.0 ,K ~*> tick] YES(?,PRIMREC)