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