MAYBE
* Step 1: TrivialSCCs MAYBE
    + Considered Problem:
        Rules:
          0. f3(A,B,C) -> f2(A,B,C)      True                             (1,1)
          1. f2(A,B,C) -> f2(-1 + E,B,C) [0 >= 1 + A && 0 >= D && B >= 1] (?,1)
          2. f2(A,B,C) -> f2(-1 + E,B,C) [0 >= 1 + A && 0 >= D && 0 >= B] (?,1)
          3. f2(A,B,C) -> f2(1 + E,B,C)  [D >= 2 && 0 >= 1 + A]           (?,1)
          4. f2(A,B,C) -> f2(-1 + E,B,C) [A >= 1 && 0 >= 2 + D && B >= 1] (?,1)
          5. f2(A,B,C) -> f2(-1 + E,B,C) [A >= 1 && 0 >= 2 + D && 0 >= B] (?,1)
          6. f2(A,B,C) -> f2(1 + E,B,C)  [D >= 0 && A >= 1]               (?,1)
          7. f2(A,B,C) -> f300(0,B,E)    [0 >= 1 + A]                     (?,1)
          8. f2(A,B,C) -> f300(0,B,E)    [A >= 1]                         (?,1)
          9. f2(A,B,C) -> f300(A,B,E)    [A = 0]                          (?,1)
        Signature:
          {(f2,3);(f3,3);(f300,3)}
        Flow Graph:
          [0->{1,2,3,4,5,6,7,8,9},1->{1,2,3,4,5,6,7,8,9},2->{1,2,3,4,5,6,7,8,9},3->{1,2,3,4,5,6,7,8,9},4->{1,2,3,4,5
          ,6,7,8,9},5->{1,2,3,4,5,6,7,8,9},6->{1,2,3,4,5,6,7,8,9},7->{},8->{},9->{}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f3(A,B,C) -> f2(A,B,C)      True                             (1,1)
          1. f2(A,B,C) -> f2(-1 + E,B,C) [0 >= 1 + A && 0 >= D && B >= 1] (?,1)
          2. f2(A,B,C) -> f2(-1 + E,B,C) [0 >= 1 + A && 0 >= D && 0 >= B] (?,1)
          3. f2(A,B,C) -> f2(1 + E,B,C)  [D >= 2 && 0 >= 1 + A]           (?,1)
          4. f2(A,B,C) -> f2(-1 + E,B,C) [A >= 1 && 0 >= 2 + D && B >= 1] (?,1)
          5. f2(A,B,C) -> f2(-1 + E,B,C) [A >= 1 && 0 >= 2 + D && 0 >= B] (?,1)
          6. f2(A,B,C) -> f2(1 + E,B,C)  [D >= 0 && A >= 1]               (?,1)
          7. f2(A,B,C) -> f300(0,B,E)    [0 >= 1 + A]                     (1,1)
          8. f2(A,B,C) -> f300(0,B,E)    [A >= 1]                         (1,1)
          9. f2(A,B,C) -> f300(A,B,E)    [A = 0]                          (1,1)
        Signature:
          {(f2,3);(f3,3);(f300,3)}
        Flow Graph:
          [0->{1,2,3,4,5,6,7,8,9},1->{1,2,3,4,5,6,7,8,9},2->{1,2,3,4,5,6,7,8,9},3->{1,2,3,4,5,6,7,8,9},4->{1,2,3,4,5
          ,6,7,8,9},5->{1,2,3,4,5,6,7,8,9},6->{1,2,3,4,5,6,7,8,9},7->{},8->{},9->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,2),(1,5),(2,1),(2,4),(4,2),(4,5),(5,1),(5,4)]
* Step 3: AddSinks MAYBE
    + Considered Problem:
        Rules:
          0. f3(A,B,C) -> f2(A,B,C)      True                             (1,1)
          1. f2(A,B,C) -> f2(-1 + E,B,C) [0 >= 1 + A && 0 >= D && B >= 1] (?,1)
          2. f2(A,B,C) -> f2(-1 + E,B,C) [0 >= 1 + A && 0 >= D && 0 >= B] (?,1)
          3. f2(A,B,C) -> f2(1 + E,B,C)  [D >= 2 && 0 >= 1 + A]           (?,1)
          4. f2(A,B,C) -> f2(-1 + E,B,C) [A >= 1 && 0 >= 2 + D && B >= 1] (?,1)
          5. f2(A,B,C) -> f2(-1 + E,B,C) [A >= 1 && 0 >= 2 + D && 0 >= B] (?,1)
          6. f2(A,B,C) -> f2(1 + E,B,C)  [D >= 0 && A >= 1]               (?,1)
          7. f2(A,B,C) -> f300(0,B,E)    [0 >= 1 + A]                     (1,1)
          8. f2(A,B,C) -> f300(0,B,E)    [A >= 1]                         (1,1)
          9. f2(A,B,C) -> f300(A,B,E)    [A = 0]                          (1,1)
        Signature:
          {(f2,3);(f3,3);(f300,3)}
        Flow Graph:
          [0->{1,2,3,4,5,6,7,8,9},1->{1,3,4,6,7,8,9},2->{2,3,5,6,7,8,9},3->{1,2,3,4,5,6,7,8,9},4->{1,3,4,6,7,8,9}
          ,5->{2,3,5,6,7,8,9},6->{1,2,3,4,5,6,7,8,9},7->{},8->{},9->{}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 4: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0.  f3(A,B,C) -> f2(A,B,C)        True                             (1,1)
          1.  f2(A,B,C) -> f2(-1 + E,B,C)   [0 >= 1 + A && 0 >= D && B >= 1] (?,1)
          2.  f2(A,B,C) -> f2(-1 + E,B,C)   [0 >= 1 + A && 0 >= D && 0 >= B] (?,1)
          3.  f2(A,B,C) -> f2(1 + E,B,C)    [D >= 2 && 0 >= 1 + A]           (?,1)
          4.  f2(A,B,C) -> f2(-1 + E,B,C)   [A >= 1 && 0 >= 2 + D && B >= 1] (?,1)
          5.  f2(A,B,C) -> f2(-1 + E,B,C)   [A >= 1 && 0 >= 2 + D && 0 >= B] (?,1)
          6.  f2(A,B,C) -> f2(1 + E,B,C)    [D >= 0 && A >= 1]               (?,1)
          7.  f2(A,B,C) -> f300(0,B,E)      [0 >= 1 + A]                     (?,1)
          8.  f2(A,B,C) -> f300(0,B,E)      [A >= 1]                         (?,1)
          9.  f2(A,B,C) -> f300(A,B,E)      [A = 0]                          (?,1)
          10. f2(A,B,C) -> exitus616(A,B,C) True                             (?,1)
        Signature:
          {(exitus616,3);(f2,3);(f3,3);(f300,3)}
        Flow Graph:
          [0->{1,2,3,4,5,6,7,8,9,10},1->{1,2,3,4,5,6,7,8,9,10},2->{1,2,3,4,5,6,7,8,9,10},3->{1,2,3,4,5,6,7,8,9,10}
          ,4->{1,2,3,4,5,6,7,8,9,10},5->{1,2,3,4,5,6,7,8,9,10},6->{1,2,3,4,5,6,7,8,9,10},7->{},8->{},9->{},10->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,2),(1,5),(2,1),(2,4),(4,2),(4,5),(5,1),(5,4)]
* Step 5: Failure MAYBE
  + Considered Problem:
      Rules:
        0.  f3(A,B,C) -> f2(A,B,C)        True                             (1,1)
        1.  f2(A,B,C) -> f2(-1 + E,B,C)   [0 >= 1 + A && 0 >= D && B >= 1] (?,1)
        2.  f2(A,B,C) -> f2(-1 + E,B,C)   [0 >= 1 + A && 0 >= D && 0 >= B] (?,1)
        3.  f2(A,B,C) -> f2(1 + E,B,C)    [D >= 2 && 0 >= 1 + A]           (?,1)
        4.  f2(A,B,C) -> f2(-1 + E,B,C)   [A >= 1 && 0 >= 2 + D && B >= 1] (?,1)
        5.  f2(A,B,C) -> f2(-1 + E,B,C)   [A >= 1 && 0 >= 2 + D && 0 >= B] (?,1)
        6.  f2(A,B,C) -> f2(1 + E,B,C)    [D >= 0 && A >= 1]               (?,1)
        7.  f2(A,B,C) -> f300(0,B,E)      [0 >= 1 + A]                     (?,1)
        8.  f2(A,B,C) -> f300(0,B,E)      [A >= 1]                         (?,1)
        9.  f2(A,B,C) -> f300(A,B,E)      [A = 0]                          (?,1)
        10. f2(A,B,C) -> exitus616(A,B,C) True                             (?,1)
      Signature:
        {(exitus616,3);(f2,3);(f3,3);(f300,3)}
      Flow Graph:
        [0->{1,2,3,4,5,6,7,8,9,10},1->{1,3,4,6,7,8,9,10},2->{2,3,5,6,7,8,9,10},3->{1,2,3,4,5,6,7,8,9,10},4->{1,3,4
        ,6,7,8,9,10},5->{2,3,5,6,7,8,9,10},6->{1,2,3,4,5,6,7,8,9,10},7->{},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,3,2,5,6,4] c: []
MAYBE