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