MAYBE
* Step 1: ArgumentFilter MAYBE
    + Considered Problem:
        Rules:
          0. f1(A,B,C) -> f3(A,D,C)     [499 + -1*C >= 0 && -1 + A + -1*C >= 0 && 999 + -1*A + -1*C >= 0 && 500 + -1*A >= 0 && A >= 500] (?,1)
          1. f1(A,B,C) -> f1(1 + A,B,C) [499 + -1*C >= 0 && -1 + A + -1*C >= 0 && 999 + -1*A + -1*C >= 0 && 500 + -1*A >= 0 && 499 >= A] (?,1)
          2. f2(A,B,C) -> f3(E,D,E)     [E >= 500]                                                                                       (1,1)
          3. f2(A,B,C) -> f1(1 + D,B,D) [499 >= D]                                                                                       (1,1)
        Signature:
          {(f1,3);(f2,3);(f3,3)}
        Flow Graph:
          [0->{},1->{0,1},2->{},3->{0,1}]
        
    + Applied Processor:
        ArgumentFilter [1]
    + Details:
        We remove following argument positions: [1].
* Step 2: FromIts MAYBE
    + Considered Problem:
        Rules:
          0. f1(A,C) -> f3(A,C)     [499 + -1*C >= 0 && -1 + A + -1*C >= 0 && 999 + -1*A + -1*C >= 0 && 500 + -1*A >= 0 && A >= 500] (?,1)
          1. f1(A,C) -> f1(1 + A,C) [499 + -1*C >= 0 && -1 + A + -1*C >= 0 && 999 + -1*A + -1*C >= 0 && 500 + -1*A >= 0 && 499 >= A] (?,1)
          2. f2(A,C) -> f3(E,E)     [E >= 500]                                                                                       (1,1)
          3. f2(A,C) -> f1(1 + D,D) [499 >= D]                                                                                       (1,1)
        Signature:
          {(f1,3);(f2,3);(f3,3)}
        Flow Graph:
          [0->{},1->{0,1},2->{},3->{0,1}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: AddSinks MAYBE
    + Considered Problem:
        Rules:
          f1(A,C) -> f3(A,C)      [499 + -1*C >= 0
                                   && -1 + A + -1*C >= 0
                                   && 999 + -1*A + -1*C >= 0
                                   && 500 + -1*A >= 0
                                   && A >= 500]
          f1(A,C) -> f1(1 + A,C)  [499 + -1*C >= 0
                                   && -1 + A + -1*C >= 0
                                   && 999 + -1*A + -1*C >= 0
                                   && 500 + -1*A >= 0
                                   && 499 >= A]
          f2(A,C) -> f3(E,E)      [E >= 500]
          f2(A,C) -> f1(1 + D,D)  [499 >= D]
        Signature:
          {(f1,3);(f2,3);(f3,3)}
        Rule Graph:
          [0->{},1->{0,1},2->{},3->{0,1}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 4: Decompose MAYBE
    + Considered Problem:
        Rules:
          f1(A,C) -> f3(A,C)         [499 + -1*C >= 0
                                      && -1 + A + -1*C >= 0
                                      && 999 + -1*A + -1*C >= 0
                                      && 500 + -1*A >= 0
                                      && A >= 500]
          f1(A,C) -> f1(1 + A,C)     [499 + -1*C >= 0
                                      && -1 + A + -1*C >= 0
                                      && 999 + -1*A + -1*C >= 0
                                      && 500 + -1*A >= 0
                                      && 499 >= A]
          f2(A,C) -> f3(E,E)         [E >= 500]
          f2(A,C) -> f1(1 + D,D)     [499 >= D]
          f3(A,C) -> exitus616(A,C)  True
          f3(A,C) -> exitus616(A,C)  True
        Signature:
          {(exitus616,2);(f1,3);(f2,3);(f3,3)}
        Rule Graph:
          [0->{4},1->{0,1},2->{5},3->{0,1}]
    + Applied Processor:
        Decompose Greedy
    + Details:
        We construct a looptree:
          P: [0,1,2,3,4,5]
          |
          `- p:[1] c: [1]
* Step 5: AbstractSize MAYBE
    + Considered Problem:
        (Rules:
          f1(A,C) -> f3(A,C)         [499 + -1*C >= 0
                                      && -1 + A + -1*C >= 0
                                      && 999 + -1*A + -1*C >= 0
                                      && 500 + -1*A >= 0
                                      && A >= 500]
          f1(A,C) -> f1(1 + A,C)     [499 + -1*C >= 0
                                      && -1 + A + -1*C >= 0
                                      && 999 + -1*A + -1*C >= 0
                                      && 500 + -1*A >= 0
                                      && 499 >= A]
          f2(A,C) -> f3(E,E)         [E >= 500]
          f2(A,C) -> f1(1 + D,D)     [499 >= D]
          f3(A,C) -> exitus616(A,C)  True
          f3(A,C) -> exitus616(A,C)  True
        Signature:
          {(exitus616,2);(f1,3);(f2,3);(f3,3)}
        Rule Graph:
          [0->{4},1->{0,1},2->{5},3->{0,1}]
        ,We construct a looptree:
          P: [0,1,2,3,4,5]
          |
          `- p:[1] c: [1])
    + Applied Processor:
        AbstractSize Minimize
    + Details:
        ()
* Step 6: AbstractFlow MAYBE
    + Considered Problem:
        Program:
          Domain: [A,C,0.0]
           f1  ~>  f3          [A <= A, C <= C]
           f1  ~>  f1          [A <= K + A, C <= C]
           f2  ~>  f3          [A <= unknown, C <= unknown]
           f2  ~>  f1          [A <= unknown, C <= unknown]
           f3  ~>  exitus616   [A <= A, C <= C]
           f3  ~>  exitus616   [A <= A, C <= C]
          + Loop: [0.0 <= 499*K + A]
               f1  ~>  f1   [A <= K + A, C <= C]
    + Applied Processor:
        AbstractFlow
    + Details:
        ()
* Step 7: Failure MAYBE
  + Considered Problem:
      Program:
        Domain: [tick,huge,K,A,C,0.0]
         f1  ~>  f3          []
         f1  ~>  f1          [A ~+> A,K ~+> A]
         f2  ~>  f3          [huge ~=> A,huge ~=> C]
         f2  ~>  f1          [huge ~=> A,huge ~=> C]
         f3  ~>  exitus616   []
         f3  ~>  exitus616   []
        + Loop: [A ~+> 0.0,K ~*> 0.0]
             f1  ~>  f1   [A ~+> A,K ~+> A]
  + Applied Processor:
      Lare
  + Details:
      Unknown bound.
MAYBE