proposition: Lemma Zlength_frames2rootpairs_sublist: forall k frs, (0 <= k <= Zlength frs -> Zlength (frames2rootpairs (sublist 0 k frs)) <= Zlength(frames2rootpairs frs))%Z.
proof: Proof. intros ? ? H2. rewrite <- (sublist_same 0 (Zlength frs) frs) at 2 by auto. rewrite (sublist_split 0 k (Zlength frs)) by lia. rewrite frames2rootpairs_app. Zlength_solve. 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