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