MAYBE
* Step 1: AddSinks MAYBE
    + Considered Problem:
        Rules:
          0. f0(A) -> f2(200 + A) [99 + A >= 0]                   (1,1)
          1. f0(A) -> f2(500 + A) [A >= 1]                        (1,1)
          2. f2(A) -> f2(700 + A) [-101 + A >= 0 && 199 + A >= 0] (?,1)
        Signature:
          {(f0,1);(f2,1)}
        Flow Graph:
          [0->{2},1->{2},2->{2}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 2: Failure MAYBE
  + Considered Problem:
      Rules:
        0. f0(A) -> f2(200 + A)  [99 + A >= 0]                   (1,1)
        1. f0(A) -> f2(500 + A)  [A >= 1]                        (1,1)
        2. f2(A) -> f2(700 + A)  [-101 + A >= 0 && 199 + A >= 0] (?,1)
        3. f2(A) -> exitus616(A) True                            (?,1)
      Signature:
        {(exitus616,1);(f0,1);(f2,1)}
      Flow Graph:
        [0->{2,3},1->{2,3},2->{2,3},3->{}]
      
  + Applied Processor:
      LooptreeTransformer
  + Details:
      We construct a looptree:
        P: [0,1,2,3]
        |
        `- p:[2] c: []
MAYBE