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