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