MAYBE
* Step 1: AddSinks MAYBE
    + Considered Problem:
        Rules:
          0. f0(A) -> f1(B) [B >= 2]                         (1,1)
          1. f1(A) -> f1(B) [1 >= B && 1 + B >= 0 && C >= 2] (?,1)
        Signature:
          {(f0,1);(f1,1)}
        Flow Graph:
          [0->{1},1->{1}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 2: Failure MAYBE
  + Considered Problem:
      Rules:
        0. f0(A) -> f1(B)        [B >= 2]                         (1,1)
        1. f1(A) -> f1(B)        [1 >= B && 1 + B >= 0 && C >= 2] (?,1)
        2. f1(A) -> exitus616(A) True                             (?,1)
      Signature:
        {(exitus616,1);(f0,1);(f1,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