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: FromIts 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:
        FromIts
    + Details:
        ()
* Step 3: Unfold MAYBE
    + Considered Problem:
        Rules:
          f3(A,B,C,D,E,F) -> f0(5000,B,G,D,E,F)         [G >= 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]
          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]
        Signature:
          {(f0,6);(f3,6)}
        Rule Graph:
          [0->{1},1->{1,2},2->{1}]
    + Applied Processor:
        Unfold
    + Details:
        ()
* Step 4: AddSinks MAYBE
    + Considered Problem:
        Rules:
          f3.0(A,B,C,D,E,F) -> f0.1(5000,B,G,D,E,F)         [G >= 1]
          f0.1(A,B,C,D,E,F) -> f0.1(-1 + A,C,-1 + C,A,E,F)  [4999 + -1*A + C >= 0 && 5000 + -1*A >= 0 && A >= 1]
          f0.1(A,B,C,D,E,F) -> f0.2(-1 + A,C,-1 + C,A,E,F)  [4999 + -1*A + C >= 0 && 5000 + -1*A >= 0 && A >= 1]
          f0.2(A,B,C,D,E,F) -> f0.1(5000,B,C,D,E,F)         [4999 + -1*A + C >= 0
                                                             && 5000 + -1*A >= 0
                                                             && 0 >= A
                                                             && C >= 1]
        Signature:
          {(f0.1,6);(f0.2,6);(f3.0,6)}
        Rule Graph:
          [0->{1,2},1->{1,2},2->{3},3->{1,2}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 5: Decompose MAYBE
    + Considered Problem:
        Rules:
          f3.0(A,B,C,D,E,F) -> f0.1(5000,B,G,D,E,F)         [G >= 1]
          f0.1(A,B,C,D,E,F) -> f0.1(-1 + A,C,-1 + C,A,E,F)  [4999 + -1*A + C >= 0 && 5000 + -1*A >= 0 && A >= 1]
          f0.1(A,B,C,D,E,F) -> f0.2(-1 + A,C,-1 + C,A,E,F)  [4999 + -1*A + C >= 0 && 5000 + -1*A >= 0 && A >= 1]
          f0.2(A,B,C,D,E,F) -> f0.1(5000,B,C,D,E,F)         [4999 + -1*A + C >= 0
                                                             && 5000 + -1*A >= 0
                                                             && 0 >= A
                                                             && C >= 1]
          f0.1(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F)       True
          f0.1(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F)       True
          f0.2(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F)       True
        Signature:
          {(exitus616,6);(f0.1,6);(f0.2,6);(f3.0,6)}
        Rule Graph:
          [0->{1,2},1->{1,2,4},2->{3,6},3->{1,2,5}]
    + Applied Processor:
        Decompose Greedy
    + Details:
        We construct a looptree:
          P: [0,1,2,3,4,5,6]
          |
          `- p:[1,3,2] c: [1,2,3]
* Step 6: AbstractSize MAYBE
    + Considered Problem:
        (Rules:
          f3.0(A,B,C,D,E,F) -> f0.1(5000,B,G,D,E,F)         [G >= 1]
          f0.1(A,B,C,D,E,F) -> f0.1(-1 + A,C,-1 + C,A,E,F)  [4999 + -1*A + C >= 0 && 5000 + -1*A >= 0 && A >= 1]
          f0.1(A,B,C,D,E,F) -> f0.2(-1 + A,C,-1 + C,A,E,F)  [4999 + -1*A + C >= 0 && 5000 + -1*A >= 0 && A >= 1]
          f0.2(A,B,C,D,E,F) -> f0.1(5000,B,C,D,E,F)         [4999 + -1*A + C >= 0
                                                             && 5000 + -1*A >= 0
                                                             && 0 >= A
                                                             && C >= 1]
          f0.1(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F)       True
          f0.1(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F)       True
          f0.2(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F)       True
        Signature:
          {(exitus616,6);(f0.1,6);(f0.2,6);(f3.0,6)}
        Rule Graph:
          [0->{1,2},1->{1,2,4},2->{3,6},3->{1,2,5}]
        ,We construct a looptree:
          P: [0,1,2,3,4,5,6]
          |
          `- p:[1,3,2] c: [1,2,3])
    + Applied Processor:
        AbstractSize Minimize
    + Details:
        ()
* Step 7: AbstractFlow MAYBE
    + Considered Problem:
        Program:
          Domain: [A,B,C,D,E,F,0.0]
           f3.0  ~>  f0.1        [A <= 5000*K, B <= B, C <= unknown, D <= D, E <= E, F <= F]
           f0.1  ~>  f0.1        [A <= 4999*K, B <= C, C <= A + C, D <= A, E <= E, F <= F]
           f0.1  ~>  f0.2        [A <= 4999*K, B <= C, C <= A + C, D <= A, E <= E, F <= F]
           f0.2  ~>  f0.1        [A <= 5000*K, B <= B, C <= C, D <= D, E <= E, F <= F]
           f0.1  ~>  exitus616   [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F]
           f0.1  ~>  exitus616   [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F]
           f0.2  ~>  exitus616   [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F]
          + Loop: [0.0 <= 9997*K + A + 2*C]
               f0.1  ~>  f0.1   [A <= 4999*K, B <= C, C <= A + C, D <= A, E <= E, F <= F]
               f0.2  ~>  f0.1   [A <= 5000*K, B <= B, C <= C, D <= D, E <= E, F <= F]
               f0.1  ~>  f0.2   [A <= 4999*K, B <= C, C <= A + C, D <= A, E <= E, F <= F]
    + Applied Processor:
        AbstractFlow
    + Details:
        ()
* Step 8: Failure MAYBE
  + Considered Problem:
      Program:
        Domain: [tick,huge,K,A,B,C,D,E,F,0.0]
         f3.0  ~>  f0.1        [K ~=> A,huge ~=> C]
         f0.1  ~>  f0.1        [A ~=> D,C ~=> B,K ~=> A,A ~+> C,C ~+> C]
         f0.1  ~>  f0.2        [A ~=> D,C ~=> B,K ~=> A,A ~+> C,C ~+> C]
         f0.2  ~>  f0.1        [K ~=> A]
         f0.1  ~>  exitus616   []
         f0.1  ~>  exitus616   []
         f0.2  ~>  exitus616   []
        + Loop: [A ~+> 0.0,C ~*> 0.0,K ~*> 0.0]
             f0.1  ~>  f0.1   [A ~=> D,C ~=> B,K ~=> A,A ~+> C,C ~+> C]
             f0.2  ~>  f0.1   [K ~=> A]
             f0.1  ~>  f0.2   [A ~=> D,C ~=> B,K ~=> A,A ~+> C,C ~+> C]
  + Applied Processor:
      Lare
  + Details:
      Unknown bound.
MAYBE