YES(?,O(n^1)) * Step 1: UnsatPaths WORST_CASE(?,O(n^1)) + Considered Problem: Rules: 0. evalDis2start(A,B,C) -> evalDis2entryin(A,B,C) True (1,1) 1. evalDis2entryin(A,B,C) -> evalDis2bb3in(B,C,A) True (?,1) 2. evalDis2bb3in(A,B,C) -> evalDis2bbin(A,B,C) [A >= 1 + C] (?,1) 3. evalDis2bb3in(A,B,C) -> evalDis2returnin(A,B,C) [C >= A] (?,1) 4. evalDis2bbin(A,B,C) -> evalDis2bb1in(A,B,C) [-1 + A + -1*C >= 0 && B >= 1 + C] (?,1) 5. evalDis2bbin(A,B,C) -> evalDis2bb2in(A,B,C) [-1 + A + -1*C >= 0 && C >= B] (?,1) 6. evalDis2bb1in(A,B,C) -> evalDis2bb3in(A,B,1 + C) [-1 + B + -1*C >= 0 && -1 + A + -1*C >= 0] (?,1) 7. evalDis2bb2in(A,B,C) -> evalDis2bb3in(A,1 + B,C) [-1 + A + -1*C >= 0 && -1*B + C >= 0 && -1 + A + -1*B >= 0] (?,1) 8. evalDis2returnin(A,B,C) -> evalDis2stop(A,B,C) [-1*A + C >= 0] (?,1) Signature: {(evalDis2bb1in,3) ;(evalDis2bb2in,3) ;(evalDis2bb3in,3) ;(evalDis2bbin,3) ;(evalDis2entryin,3) ;(evalDis2returnin,3) ;(evalDis2start,3) ;(evalDis2stop,3)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{8},4->{6},5->{7},6->{2,3},7->{2,3},8->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(7,3)] * Step 2: FromIts WORST_CASE(?,O(n^1)) + Considered Problem: Rules: 0. evalDis2start(A,B,C) -> evalDis2entryin(A,B,C) True (1,1) 1. evalDis2entryin(A,B,C) -> evalDis2bb3in(B,C,A) True (?,1) 2. evalDis2bb3in(A,B,C) -> evalDis2bbin(A,B,C) [A >= 1 + C] (?,1) 3. evalDis2bb3in(A,B,C) -> evalDis2returnin(A,B,C) [C >= A] (?,1) 4. evalDis2bbin(A,B,C) -> evalDis2bb1in(A,B,C) [-1 + A + -1*C >= 0 && B >= 1 + C] (?,1) 5. evalDis2bbin(A,B,C) -> evalDis2bb2in(A,B,C) [-1 + A + -1*C >= 0 && C >= B] (?,1) 6. evalDis2bb1in(A,B,C) -> evalDis2bb3in(A,B,1 + C) [-1 + B + -1*C >= 0 && -1 + A + -1*C >= 0] (?,1) 7. evalDis2bb2in(A,B,C) -> evalDis2bb3in(A,1 + B,C) [-1 + A + -1*C >= 0 && -1*B + C >= 0 && -1 + A + -1*B >= 0] (?,1) 8. evalDis2returnin(A,B,C) -> evalDis2stop(A,B,C) [-1*A + C >= 0] (?,1) Signature: {(evalDis2bb1in,3) ;(evalDis2bb2in,3) ;(evalDis2bb3in,3) ;(evalDis2bbin,3) ;(evalDis2entryin,3) ;(evalDis2returnin,3) ;(evalDis2start,3) ;(evalDis2stop,3)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{8},4->{6},5->{7},6->{2,3},7->{2},8->{}] + Applied Processor: FromIts + Details: () * Step 3: AddSinks WORST_CASE(?,O(n^1)) + Considered Problem: Rules: evalDis2start(A,B,C) -> evalDis2entryin(A,B,C) True evalDis2entryin(A,B,C) -> evalDis2bb3in(B,C,A) True evalDis2bb3in(A,B,C) -> evalDis2bbin(A,B,C) [A >= 1 + C] evalDis2bb3in(A,B,C) -> evalDis2returnin(A,B,C) [C >= A] evalDis2bbin(A,B,C) -> evalDis2bb1in(A,B,C) [-1 + A + -1*C >= 0 && B >= 1 + C] evalDis2bbin(A,B,C) -> evalDis2bb2in(A,B,C) [-1 + A + -1*C >= 0 && C >= B] evalDis2bb1in(A,B,C) -> evalDis2bb3in(A,B,1 + C) [-1 + B + -1*C >= 0 && -1 + A + -1*C >= 0] evalDis2bb2in(A,B,C) -> evalDis2bb3in(A,1 + B,C) [-1 + A + -1*C >= 0 && -1*B + C >= 0 && -1 + A + -1*B >= 0] evalDis2returnin(A,B,C) -> evalDis2stop(A,B,C) [-1*A + C >= 0] Signature: {(evalDis2bb1in,3) ;(evalDis2bb2in,3) ;(evalDis2bb3in,3) ;(evalDis2bbin,3) ;(evalDis2entryin,3) ;(evalDis2returnin,3) ;(evalDis2start,3) ;(evalDis2stop,3)} Rule Graph: [0->{1},1->{2,3},2->{4,5},3->{8},4->{6},5->{7},6->{2,3},7->{2},8->{}] + Applied Processor: AddSinks + Details: () * Step 4: Decompose WORST_CASE(?,O(n^1)) + Considered Problem: Rules: evalDis2start(A,B,C) -> evalDis2entryin(A,B,C) True evalDis2entryin(A,B,C) -> evalDis2bb3in(B,C,A) True evalDis2bb3in(A,B,C) -> evalDis2bbin(A,B,C) [A >= 1 + C] evalDis2bb3in(A,B,C) -> evalDis2returnin(A,B,C) [C >= A] evalDis2bbin(A,B,C) -> evalDis2bb1in(A,B,C) [-1 + A + -1*C >= 0 && B >= 1 + C] evalDis2bbin(A,B,C) -> evalDis2bb2in(A,B,C) [-1 + A + -1*C >= 0 && C >= B] evalDis2bb1in(A,B,C) -> evalDis2bb3in(A,B,1 + C) [-1 + B + -1*C >= 0 && -1 + A + -1*C >= 0] evalDis2bb2in(A,B,C) -> evalDis2bb3in(A,1 + B,C) [-1 + A + -1*C >= 0 && -1*B + C >= 0 && -1 + A + -1*B >= 0] evalDis2returnin(A,B,C) -> evalDis2stop(A,B,C) [-1*A + C >= 0] evalDis2stop(A,B,C) -> exitus616(A,B,C) True Signature: {(evalDis2bb1in,3) ;(evalDis2bb2in,3) ;(evalDis2bb3in,3) ;(evalDis2bbin,3) ;(evalDis2entryin,3) ;(evalDis2returnin,3) ;(evalDis2start,3) ;(evalDis2stop,3) ;(exitus616,3)} Rule Graph: [0->{1},1->{2,3},2->{4,5},3->{8},4->{6},5->{7},6->{2,3},7->{2},8->{9}] + Applied Processor: Decompose Greedy + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9] | `- p:[2,6,4,7,5] c: [2,4,5,6,7] * Step 5: AbstractSize WORST_CASE(?,O(n^1)) + Considered Problem: (Rules: evalDis2start(A,B,C) -> evalDis2entryin(A,B,C) True evalDis2entryin(A,B,C) -> evalDis2bb3in(B,C,A) True evalDis2bb3in(A,B,C) -> evalDis2bbin(A,B,C) [A >= 1 + C] evalDis2bb3in(A,B,C) -> evalDis2returnin(A,B,C) [C >= A] evalDis2bbin(A,B,C) -> evalDis2bb1in(A,B,C) [-1 + A + -1*C >= 0 && B >= 1 + C] evalDis2bbin(A,B,C) -> evalDis2bb2in(A,B,C) [-1 + A + -1*C >= 0 && C >= B] evalDis2bb1in(A,B,C) -> evalDis2bb3in(A,B,1 + C) [-1 + B + -1*C >= 0 && -1 + A + -1*C >= 0] evalDis2bb2in(A,B,C) -> evalDis2bb3in(A,1 + B,C) [-1 + A + -1*C >= 0 && -1*B + C >= 0 && -1 + A + -1*B >= 0] evalDis2returnin(A,B,C) -> evalDis2stop(A,B,C) [-1*A + C >= 0] evalDis2stop(A,B,C) -> exitus616(A,B,C) True Signature: {(evalDis2bb1in,3) ;(evalDis2bb2in,3) ;(evalDis2bb3in,3) ;(evalDis2bbin,3) ;(evalDis2entryin,3) ;(evalDis2returnin,3) ;(evalDis2start,3) ;(evalDis2stop,3) ;(exitus616,3)} Rule Graph: [0->{1},1->{2,3},2->{4,5},3->{8},4->{6},5->{7},6->{2,3},7->{2},8->{9}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9] | `- p:[2,6,4,7,5] c: [2,4,5,6,7]) + Applied Processor: AbstractSize Minimize + Details: () * Step 6: AbstractFlow WORST_CASE(?,O(n^1)) + Considered Problem: Program: Domain: [A,B,C,0.0] evalDis2start ~> evalDis2entryin [A <= A, B <= B, C <= C] evalDis2entryin ~> evalDis2bb3in [A <= B, B <= C, C <= A] evalDis2bb3in ~> evalDis2bbin [A <= A, B <= B, C <= C] evalDis2bb3in ~> evalDis2returnin [A <= A, B <= B, C <= C] evalDis2bbin ~> evalDis2bb1in [A <= A, B <= B, C <= C] evalDis2bbin ~> evalDis2bb2in [A <= A, B <= B, C <= C] evalDis2bb1in ~> evalDis2bb3in [A <= A, B <= B, C <= K + C] evalDis2bb2in ~> evalDis2bb3in [A <= A, B <= A + B, C <= C] evalDis2returnin ~> evalDis2stop [A <= A, B <= B, C <= C] evalDis2stop ~> exitus616 [A <= A, B <= B, C <= C] + Loop: [0.0 <= K + A + B + C] evalDis2bb3in ~> evalDis2bbin [A <= A, B <= B, C <= C] evalDis2bb1in ~> evalDis2bb3in [A <= A, B <= B, C <= K + C] evalDis2bbin ~> evalDis2bb1in [A <= A, B <= B, C <= C] evalDis2bb2in ~> evalDis2bb3in [A <= A, B <= A + B, C <= C] evalDis2bbin ~> evalDis2bb2in [A <= A, B <= B, C <= C] + Applied Processor: AbstractFlow + Details: () * Step 7: Lare WORST_CASE(?,O(n^1)) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,0.0] evalDis2start ~> evalDis2entryin [] evalDis2entryin ~> evalDis2bb3in [A ~=> C,B ~=> A,C ~=> B] evalDis2bb3in ~> evalDis2bbin [] evalDis2bb3in ~> evalDis2returnin [] evalDis2bbin ~> evalDis2bb1in [] evalDis2bbin ~> evalDis2bb2in [] evalDis2bb1in ~> evalDis2bb3in [C ~+> C,K ~+> C] evalDis2bb2in ~> evalDis2bb3in [A ~+> B,B ~+> B] evalDis2returnin ~> evalDis2stop [] evalDis2stop ~> exitus616 [] + Loop: [A ~+> 0.0,B ~+> 0.0,C ~+> 0.0,K ~+> 0.0] evalDis2bb3in ~> evalDis2bbin [] evalDis2bb1in ~> evalDis2bb3in [C ~+> C,K ~+> C] evalDis2bbin ~> evalDis2bb1in [] evalDis2bb2in ~> evalDis2bb3in [A ~+> B,B ~+> B] evalDis2bbin ~> evalDis2bb2in [] + Applied Processor: Lare + Details: evalDis2start ~> exitus616 [A ~=> C ,B ~=> A ,C ~=> B ,A ~+> C ,A ~+> 0.0 ,A ~+> tick ,B ~+> B ,B ~+> 0.0 ,B ~+> tick ,C ~+> B ,C ~+> 0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> C ,K ~+> 0.0 ,K ~+> tick ,A ~*> B ,A ~*> C ,B ~*> B ,B ~*> C ,C ~*> B ,C ~*> C ,K ~*> B ,K ~*> C] + evalDis2bb3in> [A ~+> B ,A ~+> 0.0 ,A ~+> tick ,B ~+> B ,B ~+> 0.0 ,B ~+> tick ,C ~+> C ,C ~+> 0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> C ,K ~+> 0.0 ,K ~+> tick ,A ~*> B ,A ~*> C ,B ~*> B ,B ~*> C ,C ~*> B ,C ~*> C ,K ~*> B ,K ~*> C] YES(?,O(n^1))