MAYBE
* Step 1: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B) -> f0(A + B,B) [A >= 1 && 0 >= 1 + B] (?,1)
          1. f0(A,B) -> f0(A + B,B) [A >= 1 && B >= 1]     (?,1)
          2. f1(A,B) -> f0(A,B)     True                   (1,1)
        Signature:
          {(f0,2);(f1,2)}
        Flow Graph:
          [0->{0,1},1->{0,1},2->{0,1}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,1),(1,0)]
* Step 2: FromIts MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B) -> f0(A + B,B) [A >= 1 && 0 >= 1 + B] (?,1)
          1. f0(A,B) -> f0(A + B,B) [A >= 1 && B >= 1]     (?,1)
          2. f1(A,B) -> f0(A,B)     True                   (1,1)
        Signature:
          {(f0,2);(f1,2)}
        Flow Graph:
          [0->{0},1->{1},2->{0,1}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: AddSinks MAYBE
    + Considered Problem:
        Rules:
          f0(A,B) -> f0(A + B,B)  [A >= 1 && 0 >= 1 + B]
          f0(A,B) -> f0(A + B,B)  [A >= 1 && B >= 1]
          f1(A,B) -> f0(A,B)      True
        Signature:
          {(f0,2);(f1,2)}
        Rule Graph:
          [0->{0},1->{1},2->{0,1}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 4: Failure MAYBE
  + Considered Problem:
      Rules:
        f0(A,B) -> f0(A + B,B)     [A >= 1 && 0 >= 1 + B]
        f0(A,B) -> f0(A + B,B)     [A >= 1 && B >= 1]
        f1(A,B) -> f0(A,B)         True
        f0(A,B) -> exitus616(A,B)  True
        f0(A,B) -> exitus616(A,B)  True
      Signature:
        {(exitus616,2);(f0,2);(f1,2)}
      Rule Graph:
        [0->{0,4},1->{1,3},2->{0,1}]
  + Applied Processor:
      Decompose Greedy
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4]
        |
        +- p:[1] c: []
        |
        `- p:[0] c: [0]
MAYBE