MAYBE
* Step 1: TrivialSCCs MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D,E,F,G) -> f2(A,B,C,D,E,F,G)           [0 >= A]           (?,1)
          1. f0(A,B,C,D,E,F,G) -> f0(-1 + A,C,-1 + C,A,E,F,G) [A >= 1]           (?,1)
          2. f2(A,B,C,D,E,F,G) -> f4(A,B,C,D,E,F,H)           [0 >= C]           (?,1)
          3. f2(A,B,C,D,E,F,G) -> f0(H,B,C,D,E,F,G)           [H >= 1 && C >= 1] (?,1)
          4. f3(A,B,C,D,E,F,G) -> f2(H,B,I,D,E,F,G)           True               (1,1)
        Signature:
          {(f0,7);(f2,7);(f3,7);(f4,7)}
        Flow Graph:
          [0->{2,3},1->{0,1},2->{},3->{0,1},4->{2,3}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D,E,F,G) -> f2(A,B,C,D,E,F,G)           [0 >= A]           (?,1)
          1. f0(A,B,C,D,E,F,G) -> f0(-1 + A,C,-1 + C,A,E,F,G) [A >= 1]           (?,1)
          2. f2(A,B,C,D,E,F,G) -> f4(A,B,C,D,E,F,H)           [0 >= C]           (1,1)
          3. f2(A,B,C,D,E,F,G) -> f0(H,B,C,D,E,F,G)           [H >= 1 && C >= 1] (?,1)
          4. f3(A,B,C,D,E,F,G) -> f2(H,B,I,D,E,F,G)           True               (1,1)
        Signature:
          {(f0,7);(f2,7);(f3,7);(f4,7)}
        Flow Graph:
          [0->{2,3},1->{0,1},2->{},3->{0,1},4->{2,3}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(3,0)]
* Step 3: AddSinks MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D,E,F,G) -> f2(A,B,C,D,E,F,G)           [0 >= A]           (?,1)
          1. f0(A,B,C,D,E,F,G) -> f0(-1 + A,C,-1 + C,A,E,F,G) [A >= 1]           (?,1)
          2. f2(A,B,C,D,E,F,G) -> f4(A,B,C,D,E,F,H)           [0 >= C]           (1,1)
          3. f2(A,B,C,D,E,F,G) -> f0(H,B,C,D,E,F,G)           [H >= 1 && C >= 1] (?,1)
          4. f3(A,B,C,D,E,F,G) -> f2(H,B,I,D,E,F,G)           True               (1,1)
        Signature:
          {(f0,7);(f2,7);(f3,7);(f4,7)}
        Flow Graph:
          [0->{2,3},1->{0,1},2->{},3->{1},4->{2,3}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 4: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D,E,F,G) -> f2(A,B,C,D,E,F,G)           [0 >= A]           (?,1)
          1. f0(A,B,C,D,E,F,G) -> f0(-1 + A,C,-1 + C,A,E,F,G) [A >= 1]           (?,1)
          2. f2(A,B,C,D,E,F,G) -> f4(A,B,C,D,E,F,H)           [0 >= C]           (?,1)
          3. f2(A,B,C,D,E,F,G) -> f0(H,B,C,D,E,F,G)           [H >= 1 && C >= 1] (?,1)
          4. f3(A,B,C,D,E,F,G) -> f2(H,B,I,D,E,F,G)           True               (1,1)
          5. f2(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G)    True               (?,1)
        Signature:
          {(exitus616,7);(f0,7);(f2,7);(f3,7);(f4,7)}
        Flow Graph:
          [0->{2,3,5},1->{0,1},2->{},3->{0,1},4->{2,3,5},5->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(3,0)]
* Step 5: LooptreeTransformer MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D,E,F,G) -> f2(A,B,C,D,E,F,G)           [0 >= A]           (?,1)
          1. f0(A,B,C,D,E,F,G) -> f0(-1 + A,C,-1 + C,A,E,F,G) [A >= 1]           (?,1)
          2. f2(A,B,C,D,E,F,G) -> f4(A,B,C,D,E,F,H)           [0 >= C]           (?,1)
          3. f2(A,B,C,D,E,F,G) -> f0(H,B,C,D,E,F,G)           [H >= 1 && C >= 1] (?,1)
          4. f3(A,B,C,D,E,F,G) -> f2(H,B,I,D,E,F,G)           True               (1,1)
          5. f2(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G)    True               (?,1)
        Signature:
          {(exitus616,7);(f0,7);(f2,7);(f3,7);(f4,7)}
        Flow Graph:
          [0->{2,3,5},1->{0,1},2->{},3->{1},4->{2,3,5},5->{}]
        
    + Applied Processor:
        LooptreeTransformer
    + Details:
        We construct a looptree:
          P: [0,1,2,3,4,5]
          |
          `- p:[0,1,3] c: [3]
             |
             `- p:[1] c: [1]
* Step 6: SizeAbstraction MAYBE
    + Considered Problem:
        (Rules:
          0. f0(A,B,C,D,E,F,G) -> f2(A,B,C,D,E,F,G)           [0 >= A]           (?,1)
          1. f0(A,B,C,D,E,F,G) -> f0(-1 + A,C,-1 + C,A,E,F,G) [A >= 1]           (?,1)
          2. f2(A,B,C,D,E,F,G) -> f4(A,B,C,D,E,F,H)           [0 >= C]           (?,1)
          3. f2(A,B,C,D,E,F,G) -> f0(H,B,C,D,E,F,G)           [H >= 1 && C >= 1] (?,1)
          4. f3(A,B,C,D,E,F,G) -> f2(H,B,I,D,E,F,G)           True               (1,1)
          5. f2(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G)    True               (?,1)
        Signature:
          {(exitus616,7);(f0,7);(f2,7);(f3,7);(f4,7)}
        Flow Graph:
          [0->{2,3,5},1->{0,1},2->{},3->{1},4->{2,3,5},5->{}]
        
        ,We construct a looptree:
          P: [0,1,2,3,4,5]
          |
          `- p:[0,1,3] c: [3]
             |
             `- p:[1] c: [1])
    + Applied Processor:
        SizeAbstraction UseCFG Minimize
    + Details:
        ()
* Step 7: FlowAbstraction MAYBE
    + Considered Problem:
        Program:
          Domain: [A,B,C,D,E,F,G,0.0,0.0.0]
           f0  ~>  f2          [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G]
           f0  ~>  f0          [A <= A, B <= C, C <= K + C, D <= A, E <= E, F <= F, G <= G]
           f2  ~>  f4          [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= unknown]
           f2  ~>  f0          [A <= unknown, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G]
           f3  ~>  f2          [A <= unknown, B <= B, C <= unknown, D <= D, E <= E, F <= F, G <= G]
           f2  ~>  exitus616   [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G]
          + Loop: [0.0 <= A + C]
               f0  ~>  f2   [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G]
               f0  ~>  f0   [A <= A, B <= C, C <= K + C, D <= A, E <= E, F <= F, G <= G]
               f2  ~>  f0   [A <= unknown, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G]
            + Loop: [0.0.0 <= A]
                 f0  ~>  f0   [A <= A, B <= C, C <= K + C, D <= A, E <= E, F <= F, G <= G]
    + Applied Processor:
        FlowAbstraction
    + Details:
        ()
* Step 8: Failure MAYBE
  + Considered Problem:
      Program:
        Domain: [tick,huge,K,A,B,C,D,E,F,G,0.0,0.0.0]
         f0  ~>  f2          []
         f0  ~>  f0          [A ~=> D,C ~=> B,C ~+> C,K ~+> C]
         f2  ~>  f4          [huge ~=> G]
         f2  ~>  f0          [huge ~=> A]
         f3  ~>  f2          [huge ~=> A,huge ~=> C]
         f2  ~>  exitus616   []
        + Loop: [A ~+> 0.0,C ~+> 0.0]
             f0  ~>  f2   []
             f0  ~>  f0   [A ~=> D,C ~=> B,C ~+> C,K ~+> C]
             f2  ~>  f0   [huge ~=> A]
          + Loop: [A ~=> 0.0.0]
               f0  ~>  f0   [A ~=> D,C ~=> B,C ~+> C,K ~+> C]
  + Applied Processor:
      LareProcessor
  + Details:
      Unknown bound.
MAYBE