proposition: Lemma update_rootpairs_frames2rootpairs: forall frames roots, Zlength roots = Zlength (frames2rootpairs frames) -> update_rootpairs (frames2rootpairs frames) roots = frames2rootpairs (update_frames frames roots).
proof: Proof. induction frames as [ | [ a r s ] rest] ;[ destruct roots; auto | ]. intros. simpl. autorewrite with sublist in *. simpl in *. rewrite <- IHrest by list_solve; clear IHrest. unfold frame2rootpairs. simpl. set (i:=0) at 1 2. clearbody i. revert roots i H; induction s; destruct roots; simpl; intros; auto. - autorewrite with sublist. auto. - list_solve. - autorewrite with sublist in H. rewrite IHs by list_solve; clear IHs. rewrite sublist_0_cons by list_solve. autorewrite with sublist. unfold Z.succ. rewrite (sublist_pos_cons (_ + _)) by list_solve. rewrite !Z.add_simpl_r. unfold frame2rootpairs' at 2; fold frame2rootpairs'. simpl. 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