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