Section GhostLogCorrectProof.
Context {orig_base_params : BaseParams}.
Context {one_node_params : OneNodeParams orig_base_params}.
Context {raft_params : RaftParams orig_base_params}.
Context {rmri : raft_msg_refinement_interface}.
Context {nisi : nextIndex_safety_interface}.
Context {rlmli : refined_log_matching_lemmas_interface}.
Definition lifted_nextIndex_safety net : Prop :=
forall h h',
type (snd (nwState net h)) = Leader ->
pred (getNextIndex (snd (nwState net h)) h') <= maxIndex (log (snd (nwState net h))).
Proof using nisi rmri.
intros.
enough (nextIndex_safety (deghost (mgv_deghost net))) by
(unfold nextIndex_safety, lifted_nextIndex_safety, deghost, mgv_deghost in *;
simpl in *;
repeat break_match; simpl in *; auto).
apply msg_lift_prop_all_the_way; eauto using nextIndex_safety_invariant.
Qed.
Definition lifted_entries_contiguous net :=
forall h,
contiguous_range_exact_lo (log (snd (nwState net h))) 0.
Definition lifted_entries_sorted net :=
forall h,
sorted (log (snd (nwState net h))).
Proof using rlmli rmri.
intros.
enough (entries_contiguous (mgv_deghost net)) by
(unfold entries_contiguous, lifted_entries_contiguous, mgv_deghost in *;
simpl in *;
repeat break_match; simpl in *; auto).
apply msg_lift_prop; eauto using entries_contiguous_invariant.
Qed.
Proof using rlmli rmri.
intros.
enough (entries_sorted (mgv_deghost net)) by
(unfold entries_sorted, lifted_entries_sorted, mgv_deghost in *;
simpl in *;
repeat break_match; simpl in *; auto).
apply msg_lift_prop; eauto using entries_sorted_invariant.
Qed.
Proof using.
red. unfold ghost_log_correct. intros. simpl in *.
find_apply_hyp_hyp; intuition; eauto.
subst. simpl in *.
subst.
find_apply_lem_hyp handleAppendEntries_not_append_entries.
intuition. find_false.
repeat eexists; eauto.
Qed.
Proof using.
red. unfold ghost_log_correct. intros. simpl in *.
find_apply_hyp_hyp; intuition; eauto.
subst. simpl in *.
subst.
find_apply_lem_hyp handleAppendEntriesReply_packets.
subst. simpl in *. intuition.
Qed.
Proof using.
red. unfold ghost_log_correct. intros. simpl in *.
find_apply_hyp_hyp; intuition; eauto.
subst. simpl in *.
subst.
find_apply_lem_hyp handleRequestVote_no_append_entries.
intuition. find_false.
repeat eexists; eauto.
Qed.
Proof using.
red. unfold ghost_log_correct. intros. simpl in *.
find_apply_hyp_hyp; intuition; eauto.
Qed.
Proof using.
unfold doLeader in *.
intros; repeat break_match; find_inversion; simpl in *; intuition.
do_in_map. eauto.
Qed.
Proof using.
intros.
unfold getNextIndex, doLeader, advanceCommitIndex in *.
repeat break_match; find_inversion; simpl in *; auto.
Qed.
Proof using rlmli nisi rmri.
red. unfold ghost_log_correct. intros. simpl in *.
match goal with
| H : nwState ?net ?h = (?gd, ?d) |- _ =>
replace gd with (fst (nwState net h)) in * by (rewrite H; reflexivity);
replace d with (snd (nwState net h)) in * by (rewrite H; reflexivity);
clear H
end.
find_apply_hyp_hyp; intuition; eauto.
do_in_map.
subst. simpl in *.
unfold add_ghost_msg in *. do_in_map. subst. simpl in *.
find_eapply_lem_hyp doLeader_replicaMessage; eauto.
break_and.
break_exists. subst.
unfold replicaMessage in *.
simpl in *. find_inversion.
unfold write_ghost_log. simpl.
match goal with
| |- context [pred ?x] =>
remember (pred x) as index
end.
destruct index.
- left. intuition; eauto.
+ break_match; intuition.
find_apply_lem_hyp findAtIndex_elim.
intuition.
find_erewrite_lem doLeader_log; eauto.
enough (0 < eIndex e) by lia.
eapply lifted_entries_contiguous_invariant; eauto.
+ erewrite doLeader_log; eauto.
apply sorted_findGtIndex_0; [|eapply lifted_entries_sorted_invariant; eauto].
intros. eapply lifted_entries_contiguous_invariant; eauto.
- right.
erewrite doLeader_log; eauto.
enough (exists e, findAtIndex (log (snd (nwState net leaderId))) (S index) = Some e) by
(break_exists_name e;
find_copy_apply_lem_hyp findAtIndex_elim; intuition;
auto;
exists e; intuition;
do 2 (unfold raft_data in *; simpl in *);
repeat find_rewrite; auto).
eapply contiguous_findAtIndex;
[eapply lifted_entries_sorted_invariant; eauto|
eapply lifted_entries_contiguous_invariant; eauto|].
intuition.
repeat find_rewrite.
erewrite doLeader_getNextIndex; eauto.
eapply lifted_nextIndex_safety_invariant; eauto.
Qed.
Proof using.
red. unfold ghost_log_correct. intros. simpl in *.
match goal with
| H : nwState ?net ?h = (?gd, ?d) |- _ =>
replace gd with (fst (nwState net h)) in * by (rewrite H; reflexivity);
replace d with (snd (nwState net h)) in * by (rewrite H; reflexivity);
clear H
end.
find_apply_hyp_hyp; intuition; eauto.
find_apply_lem_hyp doGenericServer_packets.
subst. simpl in *. intuition.
Qed.
Proof using.
red. unfold ghost_log_correct. intros. simpl in *.
match goal with
| H : nwState ?net ?h = (?gd, ?d) |- _ =>
replace gd with (fst (nwState net h)) in * by (rewrite H; reflexivity);
replace d with (snd (nwState net h)) in * by (rewrite H; reflexivity);
clear H
end.
repeat find_reverse_rewrite. eauto.
Qed.
Proof using.
red. unfold ghost_log_correct. intros. simpl in *.
find_apply_hyp_hyp; intuition; eauto.
subst. simpl in *.
subst.
find_apply_lem_hyp handleClientRequest_packets.
subst. simpl in *. intuition.
Qed.
Proof using.
red. unfold ghost_log_correct. intros. simpl in *.
find_apply_hyp_hyp; intuition; eauto.
exfalso.
subst. simpl in *.
subst. do_in_map. subst.
simpl in *. unfold add_ghost_msg in *.
do_in_map. subst. simpl in *.
find_eapply_lem_hyp handleTimeout_packets; eauto.
repeat find_rewrite. intuition. find_false.
repeat eexists; eauto.
Qed.
Proof using.
red. unfold ghost_log_correct. intros. simpl in *.
eauto.
Qed.

Lemma ghost_log_correct_init :
msg_refined_raft_net_invariant_init ghost_log_correct.