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

YES(?,O(1))