proposition: Lemma super_compatible_reset: forall g h rootpairs roots outlier gen, roots_have_no_gen roots gen -> super_compatible g h rootpairs roots outlier -> super_compatible (reset_graph gen g) (reset_nth_heap gen h) rootpairs roots outlier.
proof: Proof. intros. destruct H0 as [? [? [? ?]]]. split; [|split; [|split]]. - apply graph_thread_info_compatible_reset; assumption. - apply fta_compatible_reset; assumption. - apply roots_compatible_reset; assumption. - apply outlier_compatible_reset; 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