YES(?,O(n^1)) * Step 1: UnsatPaths WORST_CASE(?,O(n^1)) + Considered Problem: Rules: 0. f0(A,B,C) -> f1(A,B,2) [A >= 0 && 3 >= A && 3 >= B && B >= 0] (1,1) 1. f1(A,B,C) -> f1(A,1 + B,C) [2 + -1*C >= 0 (?,1) && 2 + B + -1*C >= 0 && 5 + -1*B + -1*C >= 0 && 2 + A + -1*C >= 0 && 5 + -1*A + -1*C >= 0 && -2 + C >= 0 && -2 + B + C >= 0 && 1 + -1*B + C >= 0 && -2 + A + C >= 0 && 1 + -1*A + C >= 0 && 3 + -1*B >= 0 && 3 + A + -1*B >= 0 && 6 + -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && 3 + -1*A + B >= 0 && 3 + -1*A >= 0 && A >= 0 && A + C >= 1 + 2*B] 2. f1(A,B,C) -> f1(A,-1 + B,C) [2 + -1*C >= 0 (?,1) && 2 + B + -1*C >= 0 && 5 + -1*B + -1*C >= 0 && 2 + A + -1*C >= 0 && 5 + -1*A + -1*C >= 0 && -2 + C >= 0 && -2 + B + C >= 0 && 1 + -1*B + C >= 0 && -2 + A + C >= 0 && 1 + -1*A + C >= 0 && 3 + -1*B >= 0 && 3 + A + -1*B >= 0 && 6 + -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && 3 + -1*A + B >= 0 && 3 + -1*A >= 0 && A >= 0 && 2*B >= 2 + A + C] Signature: {(f0,3);(f1,3)} Flow Graph: [0->{1,2},1->{1,2},2->{1,2}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,2),(2,1)] * Step 2: AddSinks WORST_CASE(?,O(n^1)) + Considered Problem: Rules: 0. f0(A,B,C) -> f1(A,B,2) [A >= 0 && 3 >= A && 3 >= B && B >= 0] (1,1) 1. f1(A,B,C) -> f1(A,1 + B,C) [2 + -1*C >= 0 (?,1) && 2 + B + -1*C >= 0 && 5 + -1*B + -1*C >= 0 && 2 + A + -1*C >= 0 && 5 + -1*A + -1*C >= 0 && -2 + C >= 0 && -2 + B + C >= 0 && 1 + -1*B + C >= 0 && -2 + A + C >= 0 && 1 + -1*A + C >= 0 && 3 + -1*B >= 0 && 3 + A + -1*B >= 0 && 6 + -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && 3 + -1*A + B >= 0 && 3 + -1*A >= 0 && A >= 0 && A + C >= 1 + 2*B] 2. f1(A,B,C) -> f1(A,-1 + B,C) [2 + -1*C >= 0 (?,1) && 2 + B + -1*C >= 0 && 5 + -1*B + -1*C >= 0 && 2 + A + -1*C >= 0 && 5 + -1*A + -1*C >= 0 && -2 + C >= 0 && -2 + B + C >= 0 && 1 + -1*B + C >= 0 && -2 + A + C >= 0 && 1 + -1*A + C >= 0 && 3 + -1*B >= 0 && 3 + A + -1*B >= 0 && 6 + -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && 3 + -1*A + B >= 0 && 3 + -1*A >= 0 && A >= 0 && 2*B >= 2 + A + C] Signature: {(f0,3);(f1,3)} Flow Graph: [0->{1,2},1->{1},2->{2}] + Applied Processor: AddSinks + Details: () * Step 3: UnsatPaths WORST_CASE(?,O(n^1)) + Considered Problem: Rules: 0. f0(A,B,C) -> f1(A,B,2) [A >= 0 && 3 >= A && 3 >= B && B >= 0] (1,1) 1. f1(A,B,C) -> f1(A,1 + B,C) [2 + -1*C >= 0 (?,1) && 2 + B + -1*C >= 0 && 5 + -1*B + -1*C >= 0 && 2 + A + -1*C >= 0 && 5 + -1*A + -1*C >= 0 && -2 + C >= 0 && -2 + B + C >= 0 && 1 + -1*B + C >= 0 && -2 + A + C >= 0 && 1 + -1*A + C >= 0 && 3 + -1*B >= 0 && 3 + A + -1*B >= 0 && 6 + -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && 3 + -1*A + B >= 0 && 3 + -1*A >= 0 && A >= 0 && A + C >= 1 + 2*B] 2. f1(A,B,C) -> f1(A,-1 + B,C) [2 + -1*C >= 0 (?,1) && 2 + B + -1*C >= 0 && 5 + -1*B + -1*C >= 0 && 2 + A + -1*C >= 0 && 5 + -1*A + -1*C >= 0 && -2 + C >= 0 && -2 + B + C >= 0 && 1 + -1*B + C >= 0 && -2 + A + C >= 0 && 1 + -1*A + C >= 0 && 3 + -1*B >= 0 && 3 + A + -1*B >= 0 && 6 + -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && 3 + -1*A + B >= 0 && 3 + -1*A >= 0 && A >= 0 && 2*B >= 2 + A + C] 3. f1(A,B,C) -> exitus616(A,B,C) True (?,1) Signature: {(exitus616,3);(f0,3);(f1,3)} Flow Graph: [0->{1,2,3},1->{1,2,3},2->{1,2,3},3->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,2),(2,1)] * Step 4: LooptreeTransformer WORST_CASE(?,O(n^1)) + Considered Problem: Rules: 0. f0(A,B,C) -> f1(A,B,2) [A >= 0 && 3 >= A && 3 >= B && B >= 0] (1,1) 1. f1(A,B,C) -> f1(A,1 + B,C) [2 + -1*C >= 0 (?,1) && 2 + B + -1*C >= 0 && 5 + -1*B + -1*C >= 0 && 2 + A + -1*C >= 0 && 5 + -1*A + -1*C >= 0 && -2 + C >= 0 && -2 + B + C >= 0 && 1 + -1*B + C >= 0 && -2 + A + C >= 0 && 1 + -1*A + C >= 0 && 3 + -1*B >= 0 && 3 + A + -1*B >= 0 && 6 + -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && 3 + -1*A + B >= 0 && 3 + -1*A >= 0 && A >= 0 && A + C >= 1 + 2*B] 2. f1(A,B,C) -> f1(A,-1 + B,C) [2 + -1*C >= 0 (?,1) && 2 + B + -1*C >= 0 && 5 + -1*B + -1*C >= 0 && 2 + A + -1*C >= 0 && 5 + -1*A + -1*C >= 0 && -2 + C >= 0 && -2 + B + C >= 0 && 1 + -1*B + C >= 0 && -2 + A + C >= 0 && 1 + -1*A + C >= 0 && 3 + -1*B >= 0 && 3 + A + -1*B >= 0 && 6 + -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && 3 + -1*A + B >= 0 && 3 + -1*A >= 0 && A >= 0 && 2*B >= 2 + A + C] 3. f1(A,B,C) -> exitus616(A,B,C) True (?,1) Signature: {(exitus616,3);(f0,3);(f1,3)} Flow Graph: [0->{1,2,3},1->{1,3},2->{2,3},3->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3] | +- p:[2] c: [2] | `- p:[1] c: [1] * Step 5: SizeAbstraction WORST_CASE(?,O(n^1)) + Considered Problem: (Rules: 0. f0(A,B,C) -> f1(A,B,2) [A >= 0 && 3 >= A && 3 >= B && B >= 0] (1,1) 1. f1(A,B,C) -> f1(A,1 + B,C) [2 + -1*C >= 0 (?,1) && 2 + B + -1*C >= 0 && 5 + -1*B + -1*C >= 0 && 2 + A + -1*C >= 0 && 5 + -1*A + -1*C >= 0 && -2 + C >= 0 && -2 + B + C >= 0 && 1 + -1*B + C >= 0 && -2 + A + C >= 0 && 1 + -1*A + C >= 0 && 3 + -1*B >= 0 && 3 + A + -1*B >= 0 && 6 + -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && 3 + -1*A + B >= 0 && 3 + -1*A >= 0 && A >= 0 && A + C >= 1 + 2*B] 2. f1(A,B,C) -> f1(A,-1 + B,C) [2 + -1*C >= 0 (?,1) && 2 + B + -1*C >= 0 && 5 + -1*B + -1*C >= 0 && 2 + A + -1*C >= 0 && 5 + -1*A + -1*C >= 0 && -2 + C >= 0 && -2 + B + C >= 0 && 1 + -1*B + C >= 0 && -2 + A + C >= 0 && 1 + -1*A + C >= 0 && 3 + -1*B >= 0 && 3 + A + -1*B >= 0 && 6 + -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && 3 + -1*A + B >= 0 && 3 + -1*A >= 0 && A >= 0 && 2*B >= 2 + A + C] 3. f1(A,B,C) -> exitus616(A,B,C) True (?,1) Signature: {(exitus616,3);(f0,3);(f1,3)} Flow Graph: [0->{1,2,3},1->{1,3},2->{2,3},3->{}] ,We construct a looptree: P: [0,1,2,3] | +- p:[2] c: [2] | `- p:[1] c: [1]) + Applied Processor: SizeAbstraction UseCFG NoMinimize + Details: () * Step 6: FlowAbstraction WORST_CASE(?,O(n^1)) + Considered Problem: Program: Domain: [A,B,C,0.0,0.1] f0 ~> f1 [A <= A, B <= B, C <= 2*K] f1 ~> f1 [A <= A, B <= 4*K, C <= C] f1 ~> f1 [A <= A, B <= 2*K, C <= C] f1 ~> exitus616 [A <= A, B <= B, C <= C] + Loop: [0.0 <= K + B] f1 ~> f1 [A <= A, B <= 2*K, C <= C] + Loop: [0.1 <= 2*K + B + C] f1 ~> f1 [A <= A, B <= 4*K, C <= C] + Applied Processor: FlowAbstraction + Details: () * Step 7: LareProcessor WORST_CASE(?,O(n^1)) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,0.0,0.1] f0 ~> f1 [K ~=> C] f1 ~> f1 [K ~=> B] f1 ~> f1 [K ~=> B] f1 ~> exitus616 [] + Loop: [B ~+> 0.0,K ~+> 0.0] f1 ~> f1 [K ~=> B] + Loop: [B ~+> 0.1,C ~+> 0.1,K ~*> 0.1] f1 ~> f1 [K ~=> B] + Applied Processor: LareProcessor + Details: f0 ~> exitus616 [K ~=> B ,K ~=> C ,B ~+> 0.0 ,B ~+> 0.1 ,B ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.1 ,K ~+> tick ,K ~*> 0.1 ,K ~*> tick] + f1> [K ~=> B,B ~+> 0.0,B ~+> tick,tick ~+> tick,K ~+> 0.0,K ~+> tick] + f1> [K ~=> B,B ~+> 0.1,B ~+> tick,C ~+> 0.1,C ~+> tick,tick ~+> tick,K ~*> 0.1,K ~*> tick] YES(?,O(n^1))