YES(?,O(n^1)) * Step 1: AddSinks WORST_CASE(?,O(n^1)) + Considered Problem: Rules: 0. eval(A) -> eval(-2 + 2*B) [2*B >= 0 && A = 1 + 2*B] (?,1) 1. start(A) -> eval(A) True (1,1) Signature: {(eval,1);(start,1)} Flow Graph: [0->{0},1->{0}] + Applied Processor: AddSinks + Details: () * Step 2: LooptreeTransformer WORST_CASE(?,O(n^1)) + Considered Problem: Rules: 0. eval(A) -> eval(-2 + 2*B) [2*B >= 0 && A = 1 + 2*B] (?,1) 1. start(A) -> eval(A) True (1,1) 2. eval(A) -> exitus616(A) True (?,1) Signature: {(eval,1);(exitus616,1);(start,1)} Flow Graph: [0->{0,2},1->{0,2},2->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2] | `- p:[0] c: [0] * Step 3: SizeAbstraction WORST_CASE(?,O(n^1)) + Considered Problem: (Rules: 0. eval(A) -> eval(-2 + 2*B) [2*B >= 0 && A = 1 + 2*B] (?,1) 1. start(A) -> eval(A) True (1,1) 2. eval(A) -> exitus616(A) True (?,1) Signature: {(eval,1);(exitus616,1);(start,1)} Flow Graph: [0->{0,2},1->{0,2},2->{}] ,We construct a looptree: P: [0,1,2] | `- p:[0] c: [0]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 4: FlowAbstraction WORST_CASE(?,O(n^1)) + Considered Problem: Program: Domain: [A,0.0] eval ~> eval [A <= K + A] start ~> eval [A <= A] eval ~> exitus616 [A <= A] + Loop: [0.0 <= A] eval ~> eval [A <= K + A] + Applied Processor: FlowAbstraction + Details: () * Step 5: LareProcessor WORST_CASE(?,O(n^1)) + Considered Problem: Program: Domain: [tick,huge,K,A,0.0] eval ~> eval [A ~+> A,K ~+> A] start ~> eval [] eval ~> exitus616 [] + Loop: [A ~=> 0.0] eval ~> eval [A ~+> A,K ~+> A] + Applied Processor: LareProcessor + Details: start ~> exitus616 [A ~=> 0.0,A ~+> A,A ~+> tick,tick ~+> tick,K ~+> A,A ~*> A,K ~*> A] + eval> [A ~=> 0.0,A ~+> A,A ~+> tick,tick ~+> tick,K ~+> A,A ~*> A,K ~*> A] YES(?,O(n^1))