MAYBE
* Step 1: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B)  -> f9(C,B)       True                      (1,1)
          1. f9(A,B)  -> f20(A,B)      [A >= 6]                  (?,1)
          2. f9(A,B)  -> f20(A,0)      [5 >= A]                  (?,1)
          3. f9(A,B)  -> f12(A,C)      [5 >= A && C >= 1]        (?,1)
          4. f9(A,B)  -> f12(A,C)      [5 >= A && 0 >= 1 + C]    (?,1)
          5. f20(A,B) -> f20(-1 + A,B) [A >= 3]                  (?,1)
          6. f20(A,B) -> f9(A,B)       [2 >= A]                  (?,1)
          7. f12(A,B) -> f9(1 + A,B)   [5 + -1*A >= 0 && 5 >= A] (?,1)
        Signature:
          {(f0,2);(f12,2);(f20,2);(f9,2)}
        Flow Graph:
          [0->{1,2,3,4},1->{5,6},2->{5,6},3->{7},4->{7},5->{5,6},6->{1,2,3,4},7->{1,2,3,4}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,6),(6,1)]
* Step 2: AddSinks MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B)  -> f9(C,B)       True                      (1,1)
          1. f9(A,B)  -> f20(A,B)      [A >= 6]                  (?,1)
          2. f9(A,B)  -> f20(A,0)      [5 >= A]                  (?,1)
          3. f9(A,B)  -> f12(A,C)      [5 >= A && C >= 1]        (?,1)
          4. f9(A,B)  -> f12(A,C)      [5 >= A && 0 >= 1 + C]    (?,1)
          5. f20(A,B) -> f20(-1 + A,B) [A >= 3]                  (?,1)
          6. f20(A,B) -> f9(A,B)       [2 >= A]                  (?,1)
          7. f12(A,B) -> f9(1 + A,B)   [5 + -1*A >= 0 && 5 >= A] (?,1)
        Signature:
          {(f0,2);(f12,2);(f20,2);(f9,2)}
        Flow Graph:
          [0->{1,2,3,4},1->{5},2->{5,6},3->{7},4->{7},5->{5,6},6->{2,3,4},7->{1,2,3,4}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0.  f0(A,B)  -> f9(C,B)        True                      (1,1)
          1.  f9(A,B)  -> f20(A,B)       [A >= 6]                  (?,1)
          2.  f9(A,B)  -> f20(A,0)       [5 >= A]                  (?,1)
          3.  f9(A,B)  -> f12(A,C)       [5 >= A && C >= 1]        (?,1)
          4.  f9(A,B)  -> f12(A,C)       [5 >= A && 0 >= 1 + C]    (?,1)
          5.  f20(A,B) -> f20(-1 + A,B)  [A >= 3]                  (?,1)
          6.  f20(A,B) -> f9(A,B)        [2 >= A]                  (?,1)
          7.  f12(A,B) -> f9(1 + A,B)    [5 + -1*A >= 0 && 5 >= A] (?,1)
          8.  f9(A,B)  -> exitus616(A,B) True                      (?,1)
          9.  f12(A,B) -> exitus616(A,B) True                      (?,1)
          10. f20(A,B) -> exitus616(A,B) True                      (?,1)
        Signature:
          {(exitus616,2);(f0,2);(f12,2);(f20,2);(f9,2)}
        Flow Graph:
          [0->{1,2,3,4,8},1->{5,6,10},2->{5,6,10},3->{7,9},4->{7,9},5->{5,6,10},6->{1,2,3,4,8},7->{1,2,3,4,8},8->{}
          ,9->{},10->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,6),(6,1)]
* Step 4: Failure MAYBE
  + Considered Problem:
      Rules:
        0.  f0(A,B)  -> f9(C,B)        True                      (1,1)
        1.  f9(A,B)  -> f20(A,B)       [A >= 6]                  (?,1)
        2.  f9(A,B)  -> f20(A,0)       [5 >= A]                  (?,1)
        3.  f9(A,B)  -> f12(A,C)       [5 >= A && C >= 1]        (?,1)
        4.  f9(A,B)  -> f12(A,C)       [5 >= A && 0 >= 1 + C]    (?,1)
        5.  f20(A,B) -> f20(-1 + A,B)  [A >= 3]                  (?,1)
        6.  f20(A,B) -> f9(A,B)        [2 >= A]                  (?,1)
        7.  f12(A,B) -> f9(1 + A,B)    [5 + -1*A >= 0 && 5 >= A] (?,1)
        8.  f9(A,B)  -> exitus616(A,B) True                      (?,1)
        9.  f12(A,B) -> exitus616(A,B) True                      (?,1)
        10. f20(A,B) -> exitus616(A,B) True                      (?,1)
      Signature:
        {(exitus616,2);(f0,2);(f12,2);(f20,2);(f9,2)}
      Flow Graph:
        [0->{1,2,3,4,8},1->{5,10},2->{5,6,10},3->{7,9},4->{7,9},5->{5,6,10},6->{2,3,4,8},7->{1,2,3,4,8},8->{}
        ,9->{},10->{}]
      
  + Applied Processor:
      LooptreeTransformer
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5,6,7,8,9,10]
        |
        `- p:[1,7,3,6,2,5,4] c: []
MAYBE