proposition: Lemma rgc_reset: forall g gen roots, roots_graph_compatible roots g -> roots_have_no_gen roots gen -> roots_graph_compatible roots (reset_graph gen g).
proof: Proof. intros. red in H |-*. rewrite Forall_forall in *. intros. specialize (H _ H1). destruct H. split. - rewrite graph_has_gen_reset. assumption. - rewrite gen_has_index_reset. split. 1: assumption. rewrite <- filter_sum_right_In_iff in H1. apply H0 in H1. auto. 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