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