proposition: Lemma nat_seq_nth: forall s num n a, n < num -> nth n (nat_seq s num) a = s + n.
proof: Proof. intros. revert s n H. induction num; intros. 1: exfalso; lia. simpl. destruct n. 1: lia. specialize (IHnum (S s) n). replace (s + S n) with (S s + n) by lia. rewrite IHnum; [reflexivity | 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