WORST_CASE(?,O(1))
* Step 1: LocalSizeboundsProc WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. start(A,B,C,D)  -> lbl41(E,B,C,D) [A = B && C = D] (?,1)
          1. lbl41(A,B,C,D)  -> stop(A,B,A,D)  [C = D]          (?,1)
          2. start0(A,B,C,D) -> start(B,B,D,D) True             (1,1)
        Signature:
          {(lbl41,4);(start,4);(start0,4);(stop,4)}
        Flow Graph:
          [0->{1},1->{},2->{0}]
        
    + Applied Processor:
        LocalSizeboundsProc
    + Details:
        LocalSizebounds generated; rvgraph
          (<0,0,A>, ?,   .?) (<0,0,B>, B, .= 0) (<0,0,C>, C, .= 0) (<0,0,D>, D, .= 0) 
          (<1,0,A>, A, .= 0) (<1,0,B>, B, .= 0) (<1,0,C>, A, .= 0) (<1,0,D>, D, .= 0) 
          (<2,0,A>, B, .= 0) (<2,0,B>, B, .= 0) (<2,0,C>, D, .= 0) (<2,0,D>, D, .= 0) 
* Step 2: SizeboundsProc WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. start(A,B,C,D)  -> lbl41(E,B,C,D) [A = B && C = D] (?,1)
          1. lbl41(A,B,C,D)  -> stop(A,B,A,D)  [C = D]          (?,1)
          2. start0(A,B,C,D) -> start(B,B,D,D) True             (1,1)
        Signature:
          {(lbl41,4);(start,4);(start0,4);(stop,4)}
        Flow Graph:
          [0->{1},1->{},2->{0}]
        Sizebounds:
          (<0,0,A>, ?) (<0,0,B>, ?) (<0,0,C>, ?) (<0,0,D>, ?) 
          (<1,0,A>, ?) (<1,0,B>, ?) (<1,0,C>, ?) (<1,0,D>, ?) 
          (<2,0,A>, ?) (<2,0,B>, ?) (<2,0,C>, ?) (<2,0,D>, ?) 
    + Applied Processor:
        SizeboundsProc
    + Details:
        Sizebounds computed:
          (<0,0,A>, ?) (<0,0,B>, B) (<0,0,C>, D) (<0,0,D>, D) 
          (<1,0,A>, ?) (<1,0,B>, B) (<1,0,C>, ?) (<1,0,D>, D) 
          (<2,0,A>, B) (<2,0,B>, B) (<2,0,C>, D) (<2,0,D>, D) 
* Step 3: LeafRules WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. start(A,B,C,D)  -> lbl41(E,B,C,D) [A = B && C = D] (?,1)
          1. lbl41(A,B,C,D)  -> stop(A,B,A,D)  [C = D]          (?,1)
          2. start0(A,B,C,D) -> start(B,B,D,D) True             (1,1)
        Signature:
          {(lbl41,4);(start,4);(start0,4);(stop,4)}
        Flow Graph:
          [0->{1},1->{},2->{0}]
        Sizebounds:
          (<0,0,A>, ?) (<0,0,B>, B) (<0,0,C>, D) (<0,0,D>, D) 
          (<1,0,A>, ?) (<1,0,B>, B) (<1,0,C>, ?) (<1,0,D>, D) 
          (<2,0,A>, B) (<2,0,B>, B) (<2,0,C>, D) (<2,0,D>, D) 
    + Applied Processor:
        LeafRules
    + Details:
        The following transitions are estimated by its predecessors and are removed [0,1]
* Step 4: LocalSizeboundsProc WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          2. start0(A,B,C,D) -> start(B,B,D,D) True (1,1)
        Signature:
          {(lbl41,4);(start,4);(start0,4);(stop,4)}
        Flow Graph:
          [2->{}]
        Sizebounds:
          (<2,0,A>, B) (<2,0,B>, B) (<2,0,C>, D) (<2,0,D>, D) 
    + Applied Processor:
        LocalSizeboundsProc
    + Details:
        The problem is already solved.

WORST_CASE(?,O(1))