proposition: Lemma svwl_add_tail_no_scan: forall from to l g1 g2 i, scan_vertex_while_loop from to l g1 g2 -> gen_has_index g2 to i -> no_scan g2 (to, i) -> scan_vertex_while_loop from to (l +:: i) g1 g2.
proof: Proof. do 3 intro. revert from to. induction l; intros; inversion H; subst. - simpl. apply svwl_no_scan; assumption. - simpl app. apply svwl_no_scan; try assumption. apply IHl; assumption. - simpl app. apply svwl_scan with g3; try assumption. apply IHl; assumption. Qed.
imports: Coq.ZArith.ZArith Coq.Program.Basics Coq.micromega.Lia compcert.lib.Integers compcert.common.Values VST.veric.base VST.veric.Clight_lemmas VST.veric.val_lemmas VST.veric.shares VST.msl.seplog VST.msl.shares VST.zlist.sublist VST.floyd.coqlib3 VST.floyd.functional_base VST.floyd.data_at_rec_lemmas VST.zlist.list_solver CertiGraph.lib.EquivDec_ext CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.graph_gen