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

YES(?,POLY)