MAYBE
* Step 1: TrivialSCCs MAYBE
    + Considered Problem:
        Rules:
          0. f2(A,B) -> f2(-1 + D,B) [0 >= C && 0 >= 1 + A] (?,1)
          1. f2(A,B) -> f2(1 + D,B)  [C >= 2 && 0 >= 1 + A] (?,1)
          2. f2(A,B) -> f2(-1 + D,B) [0 >= 2 + C && A >= 1] (?,1)
          3. f2(A,B) -> f2(1 + D,B)  [C >= 0 && A >= 1]     (?,1)
          4. f3(A,B) -> f2(A,B)      True                   (1,1)
          5. f2(A,B) -> f300(0,D)    [0 >= 1 + A]           (?,1)
          6. f2(A,B) -> f300(0,D)    [A >= 1]               (?,1)
          7. f2(A,B) -> f300(A,D)    [A = 0]                (?,1)
        Signature:
          {(f2,2);(f3,2);(f300,2)}
        Flow Graph:
          [0->{0,1,2,3,5,6,7},1->{0,1,2,3,5,6,7},2->{0,1,2,3,5,6,7},3->{0,1,2,3,5,6,7},4->{0,1,2,3,5,6,7},5->{}
          ,6->{},7->{}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: AddSinks MAYBE
    + Considered Problem:
        Rules:
          0. f2(A,B) -> f2(-1 + D,B) [0 >= C && 0 >= 1 + A] (?,1)
          1. f2(A,B) -> f2(1 + D,B)  [C >= 2 && 0 >= 1 + A] (?,1)
          2. f2(A,B) -> f2(-1 + D,B) [0 >= 2 + C && A >= 1] (?,1)
          3. f2(A,B) -> f2(1 + D,B)  [C >= 0 && A >= 1]     (?,1)
          4. f3(A,B) -> f2(A,B)      True                   (1,1)
          5. f2(A,B) -> f300(0,D)    [0 >= 1 + A]           (1,1)
          6. f2(A,B) -> f300(0,D)    [A >= 1]               (1,1)
          7. f2(A,B) -> f300(A,D)    [A = 0]                (1,1)
        Signature:
          {(f2,2);(f3,2);(f300,2)}
        Flow Graph:
          [0->{0,1,2,3,5,6,7},1->{0,1,2,3,5,6,7},2->{0,1,2,3,5,6,7},3->{0,1,2,3,5,6,7},4->{0,1,2,3,5,6,7},5->{}
          ,6->{},7->{}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: Failure MAYBE
  + Considered Problem:
      Rules:
        0. f2(A,B) -> f2(-1 + D,B)   [0 >= C && 0 >= 1 + A] (?,1)
        1. f2(A,B) -> f2(1 + D,B)    [C >= 2 && 0 >= 1 + A] (?,1)
        2. f2(A,B) -> f2(-1 + D,B)   [0 >= 2 + C && A >= 1] (?,1)
        3. f2(A,B) -> f2(1 + D,B)    [C >= 0 && A >= 1]     (?,1)
        4. f3(A,B) -> f2(A,B)        True                   (1,1)
        5. f2(A,B) -> f300(0,D)      [0 >= 1 + A]           (?,1)
        6. f2(A,B) -> f300(0,D)      [A >= 1]               (?,1)
        7. f2(A,B) -> f300(A,D)      [A = 0]                (?,1)
        8. f2(A,B) -> exitus616(A,B) True                   (?,1)
      Signature:
        {(exitus616,2);(f2,2);(f3,2);(f300,2)}
      Flow Graph:
        [0->{0,1,2,3,5,6,7,8},1->{0,1,2,3,5,6,7,8},2->{0,1,2,3,5,6,7,8},3->{0,1,2,3,5,6,7,8},4->{0,1,2,3,5,6,7,8}
        ,5->{},6->{},7->{},8->{}]
      
  + Applied Processor:
      LooptreeTransformer
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5,6,7,8]
        |
        `- p:[0,1,2,3] c: []
MAYBE