YES(?,O(n^1))
* Step 1: FromIts WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          0. a(A)     -> a(-1 + A) [A >= 1]  (?,1)
          1. start(A) -> a(100)    [A = 100] (1,1)
          2. start(A) -> a(A)      [A >= 1]  (1,1)
        Signature:
          {(a,1);(start,1)}
        Flow Graph:
          [0->{0},1->{0},2->{0}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 2: AddSinks WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          a(A)     -> a(-1 + A)  [A >= 1]
          start(A) -> a(100)     [A = 100]
          start(A) -> a(A)       [A >= 1]
        Signature:
          {(a,1);(start,1)}
        Rule Graph:
          [0->{0},1->{0},2->{0}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: Decompose WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          a(A)     -> a(-1 + A)     [A >= 1]
          start(A) -> a(100)        [A = 100]
          start(A) -> a(A)          [A >= 1]
          a(A)     -> exitus616(A)  True
          a(A)     -> exitus616(A)  True
        Signature:
          {(a,1);(exitus616,1);(start,1)}
        Rule Graph:
          [0->{0,3,4},1->{0},2->{0}]
    + Applied Processor:
        Decompose Greedy
    + Details:
        We construct a looptree:
          P: [0,1,2,3,4]
          |
          `- p:[0] c: [0]
* Step 4: AbstractSize WORST_CASE(?,O(n^1))
    + Considered Problem:
        (Rules:
          a(A)     -> a(-1 + A)     [A >= 1]
          start(A) -> a(100)        [A = 100]
          start(A) -> a(A)          [A >= 1]
          a(A)     -> exitus616(A)  True
          a(A)     -> exitus616(A)  True
        Signature:
          {(a,1);(exitus616,1);(start,1)}
        Rule Graph:
          [0->{0,3,4},1->{0},2->{0}]
        ,We construct a looptree:
          P: [0,1,2,3,4]
          |
          `- p:[0] c: [0])
    + Applied Processor:
        AbstractSize Minimize
    + Details:
        ()
* Step 5: AbstractFlow WORST_CASE(?,O(n^1))
    + Considered Problem:
        Program:
          Domain: [A,0.0]
           a      ~>  a           [A <= A]
           start  ~>  a           [A <= 100*K]
           start  ~>  a           [A <= A]
           a      ~>  exitus616   [A <= A]
           a      ~>  exitus616   [A <= A]
          + Loop: [0.0 <= K + A]
               a  ~>  a   [A <= A]
    + Applied Processor:
        AbstractFlow
    + Details:
        ()
* Step 6: Lare WORST_CASE(?,O(n^1))
    + Considered Problem:
        Program:
          Domain: [tick,huge,K,A,0.0]
           a      ~>  a           []
           start  ~>  a           [K ~=> A]
           start  ~>  a           []
           a      ~>  exitus616   []
           a      ~>  exitus616   []
          + Loop: [A ~+> 0.0,K ~+> 0.0]
               a  ~>  a   []
    + Applied Processor:
        Lare
    + Details:
         start  ~>  exitus616   [K ~=> A
                                ,A ~+> 0.0
                                ,A ~+> tick
                                ,tick ~+> tick
                                ,K ~+> 0.0
                                ,K ~+> tick
                                ,K ~*> 0.0
                                ,K ~*> tick]
        + <a  ~>  a>  [A ~+> 0.0,A ~+> tick,tick ~+> tick,K ~+> 0.0,K ~+> tick]

YES(?,O(n^1))