MAYBE
* Step 1: TrivialSCCs MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D,E,F) -> f0(-1 + A,C,-1 + C,A,E,F) [A >= 1]           (?,1)
          1. f1(A,B,C,D,E,F) -> f0(-1 + A,B,-1 + C,D,C,A) [A >= 1 && C >= 1] (?,1)
          2. f0(A,B,C,D,E,F) -> f0(5000,B,C,D,E,F)        [0 >= A && C >= 1] (?,1)
          3. f3(A,B,C,D,E,F) -> f0(5000,B,G,D,E,F)        [G >= 1]           (1,1)
        Signature:
          {(f0,6);(f1,6);(f3,6)}
        Flow Graph:
          [0->{0,2},1->{0,2},2->{0,2},3->{0,2}]
        
    + 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) -> f0(-1 + A,C,-1 + C,A,E,F) [A >= 1]           (?,1)
          1. f1(A,B,C,D,E,F) -> f0(-1 + A,B,-1 + C,D,C,A) [A >= 1 && C >= 1] (1,1)
          2. f0(A,B,C,D,E,F) -> f0(5000,B,C,D,E,F)        [0 >= A && C >= 1] (?,1)
          3. f3(A,B,C,D,E,F) -> f0(5000,B,G,D,E,F)        [G >= 1]           (1,1)
        Signature:
          {(f0,6);(f1,6);(f3,6)}
        Flow Graph:
          [0->{0,2},1->{0,2},2->{0,2},3->{0,2}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(2,2),(3,2)]
* Step 3: UnreachableRules MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D,E,F) -> f0(-1 + A,C,-1 + C,A,E,F) [A >= 1]           (?,1)
          1. f1(A,B,C,D,E,F) -> f0(-1 + A,B,-1 + C,D,C,A) [A >= 1 && C >= 1] (1,1)
          2. f0(A,B,C,D,E,F) -> f0(5000,B,C,D,E,F)        [0 >= A && C >= 1] (?,1)
          3. f3(A,B,C,D,E,F) -> f0(5000,B,G,D,E,F)        [G >= 1]           (1,1)
        Signature:
          {(f0,6);(f1,6);(f3,6)}
        Flow Graph:
          [0->{0,2},1->{0,2},2->{0},3->{0}]
        
    + Applied Processor:
        UnreachableRules
    + Details:
        Following transitions are not reachable from the starting states and are revomed: [1]
* Step 4: AddSinks MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D,E,F) -> f0(-1 + A,C,-1 + C,A,E,F) [A >= 1]           (?,1)
          2. f0(A,B,C,D,E,F) -> f0(5000,B,C,D,E,F)        [0 >= A && C >= 1] (?,1)
          3. f3(A,B,C,D,E,F) -> f0(5000,B,G,D,E,F)        [G >= 1]           (1,1)
        Signature:
          {(f0,6);(f1,6);(f3,6)}
        Flow Graph:
          [0->{0,2},2->{0},3->{0}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 5: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D,E,F) -> f0(-1 + A,C,-1 + C,A,E,F) [A >= 1]           (?,1)
          2. f0(A,B,C,D,E,F) -> f0(5000,B,C,D,E,F)        [0 >= A && C >= 1] (?,1)
          3. f3(A,B,C,D,E,F) -> f0(5000,B,G,D,E,F)        [G >= 1]           (1,1)
          4. f0(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F)    True               (?,1)
        Signature:
          {(exitus616,6);(f0,6);(f1,6);(f3,6)}
        Flow Graph:
          [0->{0,2,4},2->{0,2,4},3->{0,2,4},4->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(2,2),(3,2)]
* Step 6: LooptreeTransformer MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D,E,F) -> f0(-1 + A,C,-1 + C,A,E,F) [A >= 1]           (?,1)
          2. f0(A,B,C,D,E,F) -> f0(5000,B,C,D,E,F)        [0 >= A && C >= 1] (?,1)
          3. f3(A,B,C,D,E,F) -> f0(5000,B,G,D,E,F)        [G >= 1]           (1,1)
          4. f0(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F)    True               (?,1)
        Signature:
          {(exitus616,6);(f0,6);(f1,6);(f3,6)}
        Flow Graph:
          [0->{0,2,4},2->{0,4},3->{0,4},4->{}]
        
    + Applied Processor:
        LooptreeTransformer
    + Details:
        We construct a looptree:
          P: [0,2,3,4]
          |
          `- p:[0,2] c: [2]
             |
             `- p:[0] c: [0]
* Step 7: SizeAbstraction MAYBE
    + Considered Problem:
        (Rules:
          0. f0(A,B,C,D,E,F) -> f0(-1 + A,C,-1 + C,A,E,F) [A >= 1]           (?,1)
          2. f0(A,B,C,D,E,F) -> f0(5000,B,C,D,E,F)        [0 >= A && C >= 1] (?,1)
          3. f3(A,B,C,D,E,F) -> f0(5000,B,G,D,E,F)        [G >= 1]           (1,1)
          4. f0(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F)    True               (?,1)
        Signature:
          {(exitus616,6);(f0,6);(f1,6);(f3,6)}
        Flow Graph:
          [0->{0,2,4},2->{0,4},3->{0,4},4->{}]
        
        ,We construct a looptree:
          P: [0,2,3,4]
          |
          `- p:[0,2] c: [2]
             |
             `- p:[0] c: [0])
    + Applied Processor:
        SizeAbstraction UseCFG Minimize
    + Details:
        ()
* Step 8: FlowAbstraction MAYBE
    + Considered Problem:
        Program:
          Domain: [A,B,C,D,E,F,0.0,0.0.0]
           f0  ~>  f0          [A <= A, B <= C, C <= K + C, D <= A, E <= E, F <= F]
           f0  ~>  f0          [A <= 5000*K, B <= B, C <= C, D <= D, E <= E, F <= F]
           f3  ~>  f0          [A <= 5000*K, B <= B, C <= unknown, D <= D, E <= E, F <= F]
           f0  ~>  exitus616   [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F]
          + Loop: [0.0 <= A + C]
               f0  ~>  f0   [A <= A, B <= C, C <= K + C, D <= A, E <= E, F <= F]
               f0  ~>  f0   [A <= 5000*K, B <= B, C <= C, D <= D, E <= E, F <= F]
            + Loop: [0.0.0 <= A]
                 f0  ~>  f0   [A <= A, B <= C, C <= K + C, D <= A, E <= E, F <= F]
    + Applied Processor:
        FlowAbstraction
    + Details:
        ()
* Step 9: Failure MAYBE
  + Considered Problem:
      Program:
        Domain: [tick,huge,K,A,B,C,D,E,F,0.0,0.0.0]
         f0  ~>  f0          [A ~=> D,C ~=> B,C ~+> C,K ~+> C]
         f0  ~>  f0          [K ~=> A]
         f3  ~>  f0          [K ~=> A,huge ~=> C]
         f0  ~>  exitus616   []
        + Loop: [A ~+> 0.0,C ~+> 0.0]
             f0  ~>  f0   [A ~=> D,C ~=> B,C ~+> C,K ~+> C]
             f0  ~>  f0   [K ~=> A]
          + Loop: [A ~=> 0.0.0]
               f0  ~>  f0   [A ~=> D,C ~=> B,C ~+> C,K ~+> C]
  + Applied Processor:
      LareProcessor
  + Details:
      Unknown bound.
MAYBE