YES(?,O(1))
* Step 1: ArgumentFilter WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f0(A,B,C)  -> f9(0,D,0)      True                                                                      (1,1)
          1. f9(A,B,C)  -> f9(A,B,1 + C)  [C >= 0 && A + C >= 0 && -1*A + C >= 0 && -1*A >= 0 && A >= 0 && 49 >= C] (?,1)
          2. f17(A,B,C) -> f17(1 + A,B,C) [-50 + C >= 0 && -50 + A + C >= 0 && A >= 0 && 49 >= A]                   (?,1)
          3. f17(A,B,C) -> f24(A,B,C)     [-50 + C >= 0 && -50 + A + C >= 0 && A >= 0 && A >= 50]                   (?,1)
          4. f9(A,B,C)  -> f17(0,B,C)     [C >= 0 && A + C >= 0 && -1*A + C >= 0 && -1*A >= 0 && A >= 0 && C >= 50] (?,1)
        Signature:
          {(f0,3);(f17,3);(f24,3);(f9,3)}
        Flow Graph:
          [0->{1,4},1->{1,4},2->{2,3},3->{},4->{2,3}]
        
    + Applied Processor:
        ArgumentFilter [1]
    + Details:
        We remove following argument positions: [1].
* Step 2: UnsatPaths WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f0(A,C)  -> f9(0,0)      True                                                                      (1,1)
          1. f9(A,C)  -> f9(A,1 + C)  [C >= 0 && A + C >= 0 && -1*A + C >= 0 && -1*A >= 0 && A >= 0 && 49 >= C] (?,1)
          2. f17(A,C) -> f17(1 + A,C) [-50 + C >= 0 && -50 + A + C >= 0 && A >= 0 && 49 >= A]                   (?,1)
          3. f17(A,C) -> f24(A,C)     [-50 + C >= 0 && -50 + A + C >= 0 && A >= 0 && A >= 50]                   (?,1)
          4. f9(A,C)  -> f17(0,C)     [C >= 0 && A + C >= 0 && -1*A + C >= 0 && -1*A >= 0 && A >= 0 && C >= 50] (?,1)
        Signature:
          {(f0,3);(f17,3);(f24,3);(f9,3)}
        Flow Graph:
          [0->{1,4},1->{1,4},2->{2,3},3->{},4->{2,3}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,4),(4,3)]
* Step 3: FromIts WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f0(A,C)  -> f9(0,0)      True                                                                      (1,1)
          1. f9(A,C)  -> f9(A,1 + C)  [C >= 0 && A + C >= 0 && -1*A + C >= 0 && -1*A >= 0 && A >= 0 && 49 >= C] (?,1)
          2. f17(A,C) -> f17(1 + A,C) [-50 + C >= 0 && -50 + A + C >= 0 && A >= 0 && 49 >= A]                   (?,1)
          3. f17(A,C) -> f24(A,C)     [-50 + C >= 0 && -50 + A + C >= 0 && A >= 0 && A >= 50]                   (?,1)
          4. f9(A,C)  -> f17(0,C)     [C >= 0 && A + C >= 0 && -1*A + C >= 0 && -1*A >= 0 && A >= 0 && C >= 50] (?,1)
        Signature:
          {(f0,3);(f17,3);(f24,3);(f9,3)}
        Flow Graph:
          [0->{1},1->{1,4},2->{2,3},3->{},4->{2}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 4: AddSinks WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          f0(A,C)  -> f9(0,0)       True
          f9(A,C)  -> f9(A,1 + C)   [C >= 0 && A + C >= 0 && -1*A + C >= 0 && -1*A >= 0 && A >= 0 && 49 >= C]
          f17(A,C) -> f17(1 + A,C)  [-50 + C >= 0 && -50 + A + C >= 0 && A >= 0 && 49 >= A]
          f17(A,C) -> f24(A,C)      [-50 + C >= 0 && -50 + A + C >= 0 && A >= 0 && A >= 50]
          f9(A,C)  -> f17(0,C)      [C >= 0 && A + C >= 0 && -1*A + C >= 0 && -1*A >= 0 && A >= 0 && C >= 50]
        Signature:
          {(f0,3);(f17,3);(f24,3);(f9,3)}
        Rule Graph:
          [0->{1},1->{1,4},2->{2,3},3->{},4->{2}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 5: Decompose WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          f0(A,C)  -> f9(0,0)         True
          f9(A,C)  -> f9(A,1 + C)     [C >= 0 && A + C >= 0 && -1*A + C >= 0 && -1*A >= 0 && A >= 0 && 49 >= C]
          f17(A,C) -> f17(1 + A,C)    [-50 + C >= 0 && -50 + A + C >= 0 && A >= 0 && 49 >= A]
          f17(A,C) -> f24(A,C)        [-50 + C >= 0 && -50 + A + C >= 0 && A >= 0 && A >= 50]
          f9(A,C)  -> f17(0,C)        [C >= 0 && A + C >= 0 && -1*A + C >= 0 && -1*A >= 0 && A >= 0 && C >= 50]
          f24(A,C) -> exitus616(A,C)  True
        Signature:
          {(exitus616,2);(f0,3);(f17,3);(f24,3);(f9,3)}
        Rule Graph:
          [0->{1},1->{1,4},2->{2,3},3->{5},4->{2}]
    + Applied Processor:
        Decompose Greedy
    + Details:
        We construct a looptree:
          P: [0,1,2,3,4,5]
          |
          +- p:[1] c: [1]
          |
          `- p:[2] c: [2]
* Step 6: AbstractSize WORST_CASE(?,O(1))
    + Considered Problem:
        (Rules:
          f0(A,C)  -> f9(0,0)         True
          f9(A,C)  -> f9(A,1 + C)     [C >= 0 && A + C >= 0 && -1*A + C >= 0 && -1*A >= 0 && A >= 0 && 49 >= C]
          f17(A,C) -> f17(1 + A,C)    [-50 + C >= 0 && -50 + A + C >= 0 && A >= 0 && 49 >= A]
          f17(A,C) -> f24(A,C)        [-50 + C >= 0 && -50 + A + C >= 0 && A >= 0 && A >= 50]
          f9(A,C)  -> f17(0,C)        [C >= 0 && A + C >= 0 && -1*A + C >= 0 && -1*A >= 0 && A >= 0 && C >= 50]
          f24(A,C) -> exitus616(A,C)  True
        Signature:
          {(exitus616,2);(f0,3);(f17,3);(f24,3);(f9,3)}
        Rule Graph:
          [0->{1},1->{1,4},2->{2,3},3->{5},4->{2}]
        ,We construct a looptree:
          P: [0,1,2,3,4,5]
          |
          +- p:[1] c: [1]
          |
          `- p:[2] c: [2])
    + Applied Processor:
        AbstractSize Minimize
    + Details:
        ()
* Step 7: AbstractFlow WORST_CASE(?,O(1))
    + Considered Problem:
        Program:
          Domain: [A,C,0.0,0.1]
           f0   ~>  f9          [A <= 0*K, C <= 0*K]
           f9   ~>  f9          [A <= A, C <= 50*K]
           f17  ~>  f17         [A <= 50*K, C <= C]
           f17  ~>  f24         [A <= A, C <= C]
           f9   ~>  f17         [A <= 0*K, C <= C]
           f24  ~>  exitus616   [A <= A, C <= C]
          + Loop: [0.0 <= 49*K + C]
               f9  ~>  f9   [A <= A, C <= 50*K]
          + Loop: [0.1 <= 49*K + A]
               f17  ~>  f17   [A <= 50*K, C <= C]
    + Applied Processor:
        AbstractFlow
    + Details:
        ()
* Step 8: Lare WORST_CASE(?,O(1))
    + Considered Problem:
        Program:
          Domain: [tick,huge,K,A,C,0.0,0.1]
           f0   ~>  f9          [K ~=> A,K ~=> C]
           f9   ~>  f9          [K ~=> C]
           f17  ~>  f17         [K ~=> A]
           f17  ~>  f24         []
           f9   ~>  f17         [K ~=> A]
           f24  ~>  exitus616   []
          + Loop: [C ~+> 0.0,K ~*> 0.0]
               f9  ~>  f9   [K ~=> C]
          + Loop: [A ~+> 0.1,K ~*> 0.1]
               f17  ~>  f17   [K ~=> A]
    + Applied Processor:
        Lare
    + Details:
         f0  ~>  exitus616   [K ~=> A
                             ,K ~=> C
                             ,tick ~+> tick
                             ,K ~+> 0.0
                             ,K ~+> 0.1
                             ,K ~+> tick
                             ,K ~*> 0.0
                             ,K ~*> 0.1
                             ,K ~*> tick]
        + <f9  ~>  f9>  [K ~=> C,C ~+> 0.0,C ~+> tick,tick ~+> tick,K ~*> 0.0,K ~*> tick]
        + <f17  ~>  f17>  [K ~=> A,A ~+> 0.1,A ~+> tick,tick ~+> tick,K ~*> 0.1,K ~*> tick]

YES(?,O(1))