YES(?,O(1))
* Step 1: ArgumentFilter WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f0(A,B,C)  -> f8(D,0,C)      True                                                    (1,1)
          1. f8(A,B,C)  -> f8(A,1 + B,C)  [B >= 0 && 9 >= B]                                      (?,1)
          2. f19(A,B,C) -> f19(A,B,1 + C) [C >= 0 && -10 + B + C >= 0 && -10 + B >= 0 && 9 >= C]  (?,1)
          3. f19(A,B,C) -> f29(A,B,C)     [C >= 0 && -10 + B + C >= 0 && -10 + B >= 0 && C >= 10] (?,1)
          4. f8(A,B,C)  -> f19(A,B,0)     [B >= 0 && B >= 10]                                     (?,1)
        Signature:
          {(f0,3);(f19,3);(f29,3);(f8,3)}
        Flow Graph:
          [0->{1,4},1->{1,4},2->{2,3},3->{},4->{2,3}]
        
    + Applied Processor:
        ArgumentFilter [0]
    + Details:
        We remove following argument positions: [0].
* Step 2: UnsatPaths WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f0(B,C)  -> f8(0,C)      True                                                    (1,1)
          1. f8(B,C)  -> f8(1 + B,C)  [B >= 0 && 9 >= B]                                      (?,1)
          2. f19(B,C) -> f19(B,1 + C) [C >= 0 && -10 + B + C >= 0 && -10 + B >= 0 && 9 >= C]  (?,1)
          3. f19(B,C) -> f29(B,C)     [C >= 0 && -10 + B + C >= 0 && -10 + B >= 0 && C >= 10] (?,1)
          4. f8(B,C)  -> f19(B,0)     [B >= 0 && B >= 10]                                     (?,1)
        Signature:
          {(f0,3);(f19,3);(f29,3);(f8,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(B,C)  -> f8(0,C)      True                                                    (1,1)
          1. f8(B,C)  -> f8(1 + B,C)  [B >= 0 && 9 >= B]                                      (?,1)
          2. f19(B,C) -> f19(B,1 + C) [C >= 0 && -10 + B + C >= 0 && -10 + B >= 0 && 9 >= C]  (?,1)
          3. f19(B,C) -> f29(B,C)     [C >= 0 && -10 + B + C >= 0 && -10 + B >= 0 && C >= 10] (?,1)
          4. f8(B,C)  -> f19(B,0)     [B >= 0 && B >= 10]                                     (?,1)
        Signature:
          {(f0,3);(f19,3);(f29,3);(f8,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(B,C)  -> f8(0,C)       True
          f8(B,C)  -> f8(1 + B,C)   [B >= 0 && 9 >= B]
          f19(B,C) -> f19(B,1 + C)  [C >= 0 && -10 + B + C >= 0 && -10 + B >= 0 && 9 >= C]
          f19(B,C) -> f29(B,C)      [C >= 0 && -10 + B + C >= 0 && -10 + B >= 0 && C >= 10]
          f8(B,C)  -> f19(B,0)      [B >= 0 && B >= 10]
        Signature:
          {(f0,3);(f19,3);(f29,3);(f8,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(B,C)  -> f8(0,C)         True
          f8(B,C)  -> f8(1 + B,C)     [B >= 0 && 9 >= B]
          f19(B,C) -> f19(B,1 + C)    [C >= 0 && -10 + B + C >= 0 && -10 + B >= 0 && 9 >= C]
          f19(B,C) -> f29(B,C)        [C >= 0 && -10 + B + C >= 0 && -10 + B >= 0 && C >= 10]
          f8(B,C)  -> f19(B,0)        [B >= 0 && B >= 10]
          f29(B,C) -> exitus616(B,C)  True
        Signature:
          {(exitus616,2);(f0,3);(f19,3);(f29,3);(f8,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(B,C)  -> f8(0,C)         True
          f8(B,C)  -> f8(1 + B,C)     [B >= 0 && 9 >= B]
          f19(B,C) -> f19(B,1 + C)    [C >= 0 && -10 + B + C >= 0 && -10 + B >= 0 && 9 >= C]
          f19(B,C) -> f29(B,C)        [C >= 0 && -10 + B + C >= 0 && -10 + B >= 0 && C >= 10]
          f8(B,C)  -> f19(B,0)        [B >= 0 && B >= 10]
          f29(B,C) -> exitus616(B,C)  True
        Signature:
          {(exitus616,2);(f0,3);(f19,3);(f29,3);(f8,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: [B,C,0.0,0.1]
           f0   ~>  f8          [B <= 0*K, C <= C]
           f8   ~>  f8          [B <= 10*K, C <= C]
           f19  ~>  f19         [B <= B, C <= 10*K]
           f19  ~>  f29         [B <= B, C <= C]
           f8   ~>  f19         [B <= B, C <= 0*K]
           f29  ~>  exitus616   [B <= B, C <= C]
          + Loop: [0.0 <= 9*K + B]
               f8  ~>  f8   [B <= 10*K, C <= C]
          + Loop: [0.1 <= 9*K + C]
               f19  ~>  f19   [B <= B, C <= 10*K]
    + Applied Processor:
        AbstractFlow
    + Details:
        ()
* Step 8: Lare WORST_CASE(?,O(1))
    + Considered Problem:
        Program:
          Domain: [tick,huge,K,B,C,0.0,0.1]
           f0   ~>  f8          [K ~=> B]
           f8   ~>  f8          [K ~=> B]
           f19  ~>  f19         [K ~=> C]
           f19  ~>  f29         []
           f8   ~>  f19         [K ~=> C]
           f29  ~>  exitus616   []
          + Loop: [B ~+> 0.0,K ~*> 0.0]
               f8  ~>  f8   [K ~=> B]
          + Loop: [C ~+> 0.1,K ~*> 0.1]
               f19  ~>  f19   [K ~=> C]
    + Applied Processor:
        Lare
    + Details:
         f0  ~>  exitus616   [K ~=> B
                             ,K ~=> C
                             ,tick ~+> tick
                             ,K ~+> 0.0
                             ,K ~+> 0.1
                             ,K ~+> tick
                             ,K ~*> 0.0
                             ,K ~*> 0.1
                             ,K ~*> tick]
        + <f8  ~>  f8>  [K ~=> B,B ~+> 0.0,B ~+> tick,tick ~+> tick,K ~*> 0.0,K ~*> tick]
        + <f19  ~>  f19>  [K ~=> C,C ~+> 0.1,C ~+> tick,tick ~+> tick,K ~*> 0.1,K ~*> tick]

YES(?,O(1))