proposition: Lemma root_t_eq_dec: forall r1 r2: root_t, {r1 = r2} + {r1 <> r2}.
proof: Proof. intros. destruct r1; [destruct s|]; (destruct r2; [destruct s|]); try (right; discriminate). - destruct (Z.eq_dec z z0). 1: subst; now left. right; intro HS. inversion HS. contradiction. - destruct g, g0. destruct (block_eq_dec b b0). + subst. destruct (Ptrofs.eq_dec i i0). 1: subst; now left. right. intro HS; apply n. inversion HS. reflexivity. + right. intros HS; apply n. inversion HS. reflexivity. - destruct_eq_dec v v0. 1: subst; now left. right. intro HS. apply H. inversion HS. easy. Defined.
imports: Coq.ZArith.ZArith Coq.Program.Basics 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 CertiGraph.lib.Coqlib CertiGraph.lib.EquivDec_ext CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.graph_gen CertiGraph.graph.path_lemmas CertiGraph.graph.subgraph2 CertiGraph.graph.graph_relation CertiGraph.graph.graph_isomorphism CertiGraph.graph.reachable_ind CertiGraph.CertiGC.GCGraph