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