YES(?,O(n^1))
* Step 1: TrivialSCCs WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          0. l0(A,B) -> l1(0,B)          True               (1,1)
          1. l1(A,B) -> l1(1 + A,-1 + B) [A >= 0 && B >= 1] (?,1)
          2. l1(A,B) -> l2(A,B)          [A >= 0 && 0 >= B] (?,1)
        Signature:
          {(l0,2);(l1,2);(l2,2)}
        Flow Graph:
          [0->{1,2},1->{1,2},2->{}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: AddSinks WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          0. l0(A,B) -> l1(0,B)          True               (1,1)
          1. l1(A,B) -> l1(1 + A,-1 + B) [A >= 0 && B >= 1] (?,1)
          2. l1(A,B) -> l2(A,B)          [A >= 0 && 0 >= B] (1,1)
        Signature:
          {(l0,2);(l1,2);(l2,2)}
        Flow Graph:
          [0->{1,2},1->{1,2},2->{}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: LooptreeTransformer WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          0. l0(A,B) -> l1(0,B)          True               (1,1)
          1. l1(A,B) -> l1(1 + A,-1 + B) [A >= 0 && B >= 1] (?,1)
          2. l1(A,B) -> l2(A,B)          [A >= 0 && 0 >= B] (?,1)
          3. l1(A,B) -> exitus616(A,B)   True               (?,1)
        Signature:
          {(exitus616,2);(l0,2);(l1,2);(l2,2)}
        Flow Graph:
          [0->{1,2,3},1->{1,2,3},2->{},3->{}]
        
    + Applied Processor:
        LooptreeTransformer
    + Details:
        We construct a looptree:
          P: [0,1,2,3]
          |
          `- p:[1] c: [1]
* Step 4: SizeAbstraction WORST_CASE(?,O(n^1))
    + Considered Problem:
        (Rules:
          0. l0(A,B) -> l1(0,B)          True               (1,1)
          1. l1(A,B) -> l1(1 + A,-1 + B) [A >= 0 && B >= 1] (?,1)
          2. l1(A,B) -> l2(A,B)          [A >= 0 && 0 >= B] (?,1)
          3. l1(A,B) -> exitus616(A,B)   True               (?,1)
        Signature:
          {(exitus616,2);(l0,2);(l1,2);(l2,2)}
        Flow Graph:
          [0->{1,2,3},1->{1,2,3},2->{},3->{}]
        
        ,We construct a looptree:
          P: [0,1,2,3]
          |
          `- p:[1] c: [1])
    + Applied Processor:
        SizeAbstraction UseCFG Minimize
    + Details:
        ()
* Step 5: FlowAbstraction WORST_CASE(?,O(n^1))
    + Considered Problem:
        Program:
          Domain: [A,B,0.0]
           l0  ~>  l1          [A <= 0*K, B <= B]
           l1  ~>  l1          [A <= K + A, B <= B]
           l1  ~>  l2          [A <= A, B <= B]
           l1  ~>  exitus616   [A <= A, B <= B]
          + Loop: [0.0 <= B]
               l1  ~>  l1   [A <= K + A, B <= B]
    + Applied Processor:
        FlowAbstraction
    + Details:
        ()
* Step 6: LareProcessor WORST_CASE(?,O(n^1))
    + Considered Problem:
        Program:
          Domain: [tick,huge,K,A,B,0.0]
           l0  ~>  l1          [K ~=> A]
           l1  ~>  l1          [A ~+> A,K ~+> A]
           l1  ~>  l2          []
           l1  ~>  exitus616   []
          + Loop: [B ~=> 0.0]
               l1  ~>  l1   [A ~+> A,K ~+> A]
    + Applied Processor:
        LareProcessor
    + Details:
         l0  ~>  exitus616   [B ~=> 0.0,K ~=> A,B ~+> tick,tick ~+> tick,K ~+> A,B ~*> A,K ~*> A]
         l0  ~>  l2          [B ~=> 0.0,K ~=> A,B ~+> tick,tick ~+> tick,K ~+> A,B ~*> A,K ~*> A]
        + <l1  ~>  l1>  [B ~=> 0.0,A ~+> A,B ~+> tick,tick ~+> tick,K ~+> A,B ~*> A,K ~*> A]

YES(?,O(n^1))