proposition: Lemma Zlength_update_rootpairs': forall (rootpairs : list rootpair) (roots : list val), (Zlength rootpairs <= Zlength roots)%Z <-> Zlength (update_rootpairs rootpairs roots) = Zlength rootpairs.
proof: Proof. induction rootpairs as [|[??]]; destruct roots; simpl; intros; try list_solve. rewrite !Zlength_cons. specialize (IHrootpairs roots). split; intros. f_equal; apply IHrootpairs. lia. lia. 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