proposition: Lemma cvmgil_eq: forall to l, to < length l -> nth to (copy_v_mod_gen_info_list l to) null_info = copy_v_mod_gen_info (nth to l null_info).
proof: Proof. intros. unfold copy_v_mod_gen_info_list. assert (length (firstn to l) = to) by (rewrite firstn_length_le; lia). rewrite app_nth2 by lia. rewrite H0. replace (to - to) with O by lia. simpl. reflexivity. 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