proposition: Lemma lcv_roots_compatible_unchanged: forall g roots outlier v to, graph_has_gen g to -> roots_compatible g outlier roots -> roots_compatible (lgraph_copy_v g v to) outlier roots.
proof: Proof. intros. destruct H0. split; [|apply lcv_rgc_unchanged]; 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