MAYBE
* Step 1: TrivialSCCs MAYBE
    + Considered Problem:
        Rules:
          0. f10(A,B,C,D,E) -> f16(A,0,F,D,E) [0 >= A && F >= 1] (?,1)
          1. f16(A,B,C,D,E) -> f16(A,B,C,D,E) [C >= 1]           (?,1)
          2. f25(A,B,C,D,E) -> f25(A,B,C,D,E) True               (?,1)
          3. f27(A,B,C,D,E) -> f30(A,B,C,D,E) True               (?,1)
          4. f16(A,B,C,D,E) -> f10(F,B,C,0,F) [0 >= C]           (?,1)
          5. f10(A,B,C,D,E) -> f25(A,B,C,D,E) [A >= 1]           (?,1)
          6. f0(A,B,C,D,E)  -> f10(F,0,C,0,F) True               (1,1)
        Signature:
          {(f0,5);(f10,5);(f16,5);(f25,5);(f27,5);(f30,5)}
        Flow Graph:
          [0->{1,4},1->{1,4},2->{2},3->{},4->{0,5},5->{2},6->{0,5}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f10(A,B,C,D,E) -> f16(A,0,F,D,E) [0 >= A && F >= 1] (?,1)
          1. f16(A,B,C,D,E) -> f16(A,B,C,D,E) [C >= 1]           (?,1)
          2. f25(A,B,C,D,E) -> f25(A,B,C,D,E) True               (?,1)
          3. f27(A,B,C,D,E) -> f30(A,B,C,D,E) True               (1,1)
          4. f16(A,B,C,D,E) -> f10(F,B,C,0,F) [0 >= C]           (?,1)
          5. f10(A,B,C,D,E) -> f25(A,B,C,D,E) [A >= 1]           (1,1)
          6. f0(A,B,C,D,E)  -> f10(F,0,C,0,F) True               (1,1)
        Signature:
          {(f0,5);(f10,5);(f16,5);(f25,5);(f27,5);(f30,5)}
        Flow Graph:
          [0->{1,4},1->{1,4},2->{2},3->{},4->{0,5},5->{2},6->{0,5}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,4),(1,4)]
* Step 3: UnreachableRules MAYBE
    + Considered Problem:
        Rules:
          0. f10(A,B,C,D,E) -> f16(A,0,F,D,E) [0 >= A && F >= 1] (?,1)
          1. f16(A,B,C,D,E) -> f16(A,B,C,D,E) [C >= 1]           (?,1)
          2. f25(A,B,C,D,E) -> f25(A,B,C,D,E) True               (?,1)
          3. f27(A,B,C,D,E) -> f30(A,B,C,D,E) True               (1,1)
          4. f16(A,B,C,D,E) -> f10(F,B,C,0,F) [0 >= C]           (?,1)
          5. f10(A,B,C,D,E) -> f25(A,B,C,D,E) [A >= 1]           (1,1)
          6. f0(A,B,C,D,E)  -> f10(F,0,C,0,F) True               (1,1)
        Signature:
          {(f0,5);(f10,5);(f16,5);(f25,5);(f27,5);(f30,5)}
        Flow Graph:
          [0->{1},1->{1},2->{2},3->{},4->{0,5},5->{2},6->{0,5}]
        
    + Applied Processor:
        UnreachableRules
    + Details:
        Following transitions are not reachable from the starting states and are revomed: [3,4]
* Step 4: AddSinks MAYBE
    + Considered Problem:
        Rules:
          0. f10(A,B,C,D,E) -> f16(A,0,F,D,E) [0 >= A && F >= 1] (?,1)
          1. f16(A,B,C,D,E) -> f16(A,B,C,D,E) [C >= 1]           (?,1)
          2. f25(A,B,C,D,E) -> f25(A,B,C,D,E) True               (?,1)
          5. f10(A,B,C,D,E) -> f25(A,B,C,D,E) [A >= 1]           (1,1)
          6. f0(A,B,C,D,E)  -> f10(F,0,C,0,F) True               (1,1)
        Signature:
          {(f0,5);(f10,5);(f16,5);(f25,5);(f27,5);(f30,5)}
        Flow Graph:
          [0->{1},1->{1},2->{2},5->{2},6->{0,5}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 5: Failure MAYBE
  + Considered Problem:
      Rules:
        0. f10(A,B,C,D,E) -> f16(A,0,F,D,E)       [0 >= A && F >= 1] (?,1)
        1. f16(A,B,C,D,E) -> f16(A,B,C,D,E)       [C >= 1]           (?,1)
        2. f25(A,B,C,D,E) -> f25(A,B,C,D,E)       True               (?,1)
        5. f10(A,B,C,D,E) -> f25(A,B,C,D,E)       [A >= 1]           (?,1)
        6. f0(A,B,C,D,E)  -> f10(F,0,C,0,F)       True               (1,1)
        7. f25(A,B,C,D,E) -> exitus616(A,B,C,D,E) True               (?,1)
        8. f16(A,B,C,D,E) -> exitus616(A,B,C,D,E) True               (?,1)
      Signature:
        {(exitus616,5);(f0,5);(f10,5);(f16,5);(f25,5);(f27,5);(f30,5)}
      Flow Graph:
        [0->{1,8},1->{1,8},2->{2,7},5->{2,7},6->{0,5},7->{},8->{}]
      
  + Applied Processor:
      LooptreeTransformer
  + Details:
      We construct a looptree:
        P: [0,1,2,5,6,7,8]
        |
        +- p:[2] c: []
        |
        `- p:[1] c: []
MAYBE