MAYBE * Step 1: AddSinks MAYBE + Considered Problem: Rules: 0. start(A) -> eval(A) True (1,1) 1. eval(A) -> eval(B) [A >= 0 && 2*A + B >= 10 && 10 >= 2*A + B] (?,1) Signature: {(eval,1);(start,1)} Flow Graph: [0->{1},1->{1}] + Applied Processor: AddSinks + Details: () * Step 2: Failure MAYBE + Considered Problem: Rules: 0. start(A) -> eval(A) True (1,1) 1. eval(A) -> eval(B) [A >= 0 && 2*A + B >= 10 && 10 >= 2*A + B] (?,1) 2. eval(A) -> exitus616(A) True (?,1) Signature: {(eval,1);(exitus616,1);(start,1)} Flow Graph: [0->{1,2},1->{1,2},2->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2] | `- p:[1] c: [] MAYBE