MAYBE * Step 1: AddSinks MAYBE + Considered Problem: Rules: 0. start(A,B) -> eval(A,B) True (1,1) 1. eval(A,B) -> eval(A,D) [A >= 0 (?,1) && B >= 0 && B >= 1 + A && A + B >= 2*C && 3*C >= 1 + A + B && D >= C && A + B >= 2*E && 3*E >= 1 + A + B && E >= D] 2. eval(A,B) -> eval(D,B) [A >= 0 (?,1) && B >= 0 && B >= 1 + A && A + B >= 2*C && 3*C >= 1 + A + B && D >= 1 + C && A + B >= 2*E && 3*E >= 1 + A + B && 1 + E >= D] Signature: {(eval,2);(start,2)} Flow Graph: [0->{1,2},1->{1,2},2->{1,2}] + Applied Processor: AddSinks + Details: () * Step 2: Failure MAYBE + Considered Problem: Rules: 0. start(A,B) -> eval(A,B) True (1,1) 1. eval(A,B) -> eval(A,D) [A >= 0 (?,1) && B >= 0 && B >= 1 + A && A + B >= 2*C && 3*C >= 1 + A + B && D >= C && A + B >= 2*E && 3*E >= 1 + A + B && E >= D] 2. eval(A,B) -> eval(D,B) [A >= 0 (?,1) && B >= 0 && B >= 1 + A && A + B >= 2*C && 3*C >= 1 + A + B && D >= 1 + C && A + B >= 2*E && 3*E >= 1 + A + B && 1 + E >= D] 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: [1] | `- p:[2] c: [] MAYBE