MAYBE * Step 1: AddSinks MAYBE + Considered Problem: Rules: 0. start(A,B,C) -> eval(A,B,C) True (1,1) 1. eval(A,B,C) -> eval(A + -1*C,B + C^2,-1 + C) [A >= B] (?,1) 2. eval(A,B,C) -> eval(1 + A,A + B,C) [A >= B] (?,1) Signature: {(eval,3);(start,3)} 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,C) -> eval(A,B,C) True (1,1) 1. eval(A,B,C) -> eval(A + -1*C,B + C^2,-1 + C) [A >= B] (?,1) 2. eval(A,B,C) -> eval(1 + A,A + B,C) [A >= B] (?,1) 3. eval(A,B,C) -> exitus616(A,B,C) True (?,1) Signature: {(eval,3);(exitus616,3);(start,3)} 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: [] MAYBE