proposition: Lemma gcl_add_tail: forall l g1 roots1 g2 roots2 g3 roots3 g4 i, garbage_collect_loop l roots1 g1 roots2 g2 -> new_gen_relation (S i) g2 g3 -> do_generation_relation i (S i) roots2 roots3 g3 g4 -> garbage_collect_loop (l +:: i) roots1 g1 roots3 g4.
proof: Proof. induction l; intros. - simpl. inversion H. subst. eapply gcl_cons; eauto. constructor. - inversion H. subst. clear H. simpl app. eapply gcl_cons; 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