proposition: Lemma upd_roots_compatible: forall g roots outlier z, roots_compatible g outlier roots -> forall v : VType, graph_has_v g v -> roots_compatible g outlier (upd_Znth z roots (inr v)).
proof: Proof. intros. destruct H. split. - apply upd_roots_outlier_compatible; assumption. - apply upd_Znth_graph_compatible; 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