linserach(S,x,i) is
{@$ m\ge 0 \land S.0..m-1\in Int \land x\in Int$@}
@$\bb$@ initially i=0  
   @$\{\text{invariant }P\}$@
   @$\{\text{bound } T \}$@
   do 
     @$G_0$@: m-i @$\neq$@ 0 cand x @$\neq$@ S.i @$\rightarrow$@ i:=i+1
   od
   @$\{P \land \neg B\}$@

  ; R:=i=m
  @$\{R \ll.=\lr. \bnd{\exists}{j}{\lelt0jm}{x=S.j}\}$@
@$\be$@
