Require Export Bmc.Core.
Definition naive_post (I : prop) (T : trans) (P : prop) (k : nat) : Prop :=
safety_nth I T P (S k).
Definition induction_post (I : prop) (T : trans) (P : prop) : Prop :=
(forall (s:state), I s -> P s) /\
(forall (s s':state), P s -> T s s' -> P s').
(**)
(*exists k, ~naive_post I T P k.*)

Theorem completeness_naive_basecase :
forall (I:prop) (T:trans) (P:prop),
( forall (i:nat), prop_nth_init I T P i ) ->
forall (ss:sseq), I ss.[0] -> P ss.[0].