proposition: Lemma fr_roots_compatible: forall depth from to p g g' roots outlier, graph_has_gen g to -> forward_p_compatible p roots g from -> copy_compatible g -> forward_relation from to depth (forward_p2forward_t p roots g) g g' -> roots_compatible g outlier roots -> from <> to -> roots_compatible g' outlier (upd_roots from to p g roots).
proof: Proof. intros. destruct H3. split. - apply fr_roots_outlier_compatible; assumption. - eapply fr_roots_graph_compatible; eauto. 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