proposition: Lemma mfv_all_is_ptr_or_int: forall g v, copy_compatible g -> no_dangling_dst g -> graph_has_v g v -> Forall is_pointer_or_integer (make_fields_vals g v).
proof: Proof. intros. rewrite Forall_forall. intros f ?. unfold make_fields_vals in H2. pose proof (mfv_unmarked_all_is_ptr_or_int (raw_tag (vlabel g v)) _ _ H0 H1). rewrite Forall_forall in H3. specialize (H3 f). destruct (raw_mark (vlabel g v)) eqn:? . 2: apply H3; assumption. simpl in H2. destruct H2. 2: apply H3, In_tail; assumption. subst f. unfold vertex_address. apply isptr_is_pointer_or_integer. rewrite isptr_offset_val. apply graph_has_gen_start_isptr, (proj1 (H _ H1 Heqb)). 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