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