Section RaftRefinementProof.
Context {orig_base_params : BaseParams}.
Context {one_node_params : OneNodeParams orig_base_params}.
Context {raft_params : RaftParams orig_base_params}.
Proof using.
intros.
unfold handleMessage, update_elections_data_net in *.
break_match; repeat break_let; repeat find_inversion;
[eapply_prop refined_raft_net_invariant_request_vote|
eapply_prop refined_raft_net_invariant_request_vote_reply|
eapply_prop refined_raft_net_invariant_append_entries|
eapply_prop refined_raft_net_invariant_append_entries_reply]; eauto;
unfold send_packets in *; simpl in *; intros; subst; auto; find_apply_hyp_hyp; intuition.
Qed.
Proof using.
intros.
unfold handleInput, update_elections_data_input in *.
break_match; repeat break_let; repeat find_inversion;
[eapply_prop refined_raft_net_invariant_timeout|
eapply_prop refined_raft_net_invariant_client_request]; eauto; subst; auto.
Qed.
Proof using.
intros.
induction H10.
- intuition.
-  match goal with [H : step_failure _ _ _ |- _ ] => invcs H end.
+ unfold refined_net_handlers in *. simpl in *.
unfold RaftNetHandler, update_elections_data_net in *.
repeat break_let.
repeat find_inversion.
assert
(refined_raft_intermediate_reachable
{|
nwPackets := (xs ++ ys) ++ send_packets (pDst p) l2;
nwState := update name_eq_dec (nwState net) (pDst p)
(update_elections_data_net (pDst p)
(pSrc p)
(pBody p)
(nwState net (pDst p)), r0) |})
by (eapply RRIR_handleMessage; eauto; in_crush).
assert
(refined_raft_intermediate_reachable
{|
nwPackets := ((xs ++ ys)
++ send_packets (pDst p) l2)
++ send_packets (pDst p) l3 ;
nwState := update name_eq_dec
(nwState
{|
nwPackets := (xs ++ ys) ++ send_packets (pDst p) l2;
nwState := update name_eq_dec
(nwState net)
(pDst p)
(update_elections_data_net
(pDst p) (pSrc p)
(pBody p) (nwState net (pDst p)), r0) |})
(pDst p)
(update_elections_data_net (pDst p)
(pSrc p) (pBody p) (nwState net (pDst p)), r1) |})
by
(eapply RRIR_doLeader; eauto;
[simpl in *; break_if; try congruence; eauto| in_crush]).
eapply_prop refined_raft_net_invariant_do_generic_server. eauto.
eapply_prop refined_raft_net_invariant_do_leader. eauto.
eapply refined_raft_invariant_handle_message with (P := P); eauto using in_app_or.
auto.
simpl. break_if; intuition eauto.
eauto.
simpl. eapply in_app_or. auto.
simpl. break_if; eauto; congruence.
simpl. intros.
break_if; subst;
repeat rewrite update_same by auto;
repeat rewrite update_neq by auto; auto.
simpl. in_crush.
+ unfold refined_input_handlers in *. simpl in *.
unfold RaftInputHandler, update_elections_data_input in *. repeat break_let.
repeat find_inversion.
assert
(refined_raft_intermediate_reachable
{|
nwPackets := nwPackets net ++ send_packets h l2;
nwState := update name_eq_dec (nwState net) h
(update_elections_data_input h
inp
(nwState net h), r0) |})
by (eapply RRIR_handleInput; eauto; in_crush).
assert
(refined_raft_intermediate_reachable
{|
nwPackets := (nwPackets net
++ send_packets h l2)
++ send_packets h l4 ;
nwState := update name_eq_dec
(nwState
{|
nwPackets := nwPackets net ++ send_packets h l2;
nwState := update name_eq_dec
(nwState net)
h
(update_elections_data_input h inp
(nwState net h), r0) |})
h
(update_elections_data_input h inp (nwState net h), r1) |})
by
(eapply RRIR_doLeader; eauto;
[simpl in *; break_if; try congruence; eauto| in_crush]).
eapply_prop refined_raft_net_invariant_do_generic_server. eauto.
eapply_prop refined_raft_net_invariant_do_leader. eauto.
eapply refined_raft_invariant_handle_input with (P := P); eauto using in_app_or.
auto.
simpl. break_if; intuition eauto.
eauto.
simpl. eapply in_app_or.
auto.
simpl. break_if; eauto; congruence.
simpl. intros.
break_if; subst;
repeat rewrite update_same by auto;
repeat rewrite update_neq by auto; auto.
simpl. unfold send_packets.  intros. in_crush.
+ match goal with
| [ H : nwPackets ?net = _ |- _ {| nwPackets := ?ps ; nwState := ?st |} ] =>
assert (forall p, In p (nwPackets {| nwPackets := ps ; nwState := st |}) ->
In p (nwPackets net)) by (intros; simpl in *; find_rewrite; in_crush)
end.
eapply_prop refined_raft_net_invariant_state_same_packet_subset; [|eauto|idtac|];
eauto.
+ match goal with
| [ H : nwPackets ?net = _ |- _ {| nwPackets := ?ps ; nwState := ?st |} ] =>
assert (forall p, In p (nwPackets {| nwPackets := ps ; nwState := st |}) ->
In p (nwPackets net)) by (intros; simpl in *; find_rewrite; in_crush)
end.
eapply_prop refined_raft_net_invariant_state_same_packet_subset; [|eauto|idtac|];
eauto.
+ auto.
+ eapply_prop refined_raft_net_invariant_reboot; eauto;
intros; simpl in *; repeat break_if; intuition; subst; intuition eauto.
destruct (nwState net h); auto.
- eapply refined_raft_invariant_handle_input; eauto.
- eapply refined_raft_invariant_handle_message; eauto.
- eapply_prop refined_raft_net_invariant_do_leader; eauto.
- eapply_prop refined_raft_net_invariant_do_generic_server; eauto.
Qed.
Proof using.
intros.
unfold handleMessage, update_elections_data_net in *.
break_match; repeat break_let; repeat find_inversion;
[eapply_prop refined_raft_net_invariant_request_vote'|
eapply_prop refined_raft_net_invariant_request_vote_reply'|
eapply_prop refined_raft_net_invariant_append_entries'|
eapply_prop refined_raft_net_invariant_append_entries_reply']; eauto;
unfold send_packets in *; simpl in *; intros; subst; auto; find_apply_hyp_hyp; intuition.
Qed.
Proof using.
intros.
unfold handleInput, update_elections_data_input in *.
break_match; repeat break_let; repeat find_inversion;
[eapply_prop refined_raft_net_invariant_timeout'|
eapply_prop refined_raft_net_invariant_client_request']; eauto; subst; auto.
Qed.
Proof using.
intros.
induction H10.
- intuition.
-  match goal with [H : step_failure _ _ _ |- _ ] => invcs H end.
+ match goal with
| [ H : refined_raft_intermediate_reachable _ |- _ ?x ] =>
assert (refined_raft_intermediate_reachable x) as Hpost
by (eapply RRIR_step_failure; eauto; eapply StepFailure_deliver; eauto)
end.
unfold refined_net_handlers in *. simpl in *.
unfold RaftNetHandler, update_elections_data_net in *.
repeat break_let.
repeat find_inversion.
match goal with
| [ H : refined_raft_intermediate_reachable ?net, H' : context [net]  |- _ ] =>
match type of H' with
| refined_raft_intermediate_reachable _ => move H after H'
end
end.
assert
(refined_raft_intermediate_reachable
{|
nwPackets := (xs ++ ys) ++ send_packets (pDst p) l2;
nwState := update name_eq_dec (nwState net) (pDst p)
(update_elections_data_net (pDst p)
(pSrc p)
(pBody p)
(nwState net (pDst p)), r0) |})
by (eapply RRIR_handleMessage; eauto; in_crush).
assert
(refined_raft_intermediate_reachable
{|
nwPackets := ((xs ++ ys)
++ send_packets (pDst p) l2)
++ send_packets (pDst p) l3 ;
nwState := update name_eq_dec
(nwState
{|
nwPackets := (xs ++ ys) ++ send_packets (pDst p) l2;
nwState := update name_eq_dec (nwState net)
(pDst p)
(update_elections_data_net
(pDst p) (pSrc p)
(pBody p) (nwState net (pDst p)), r0) |})
(pDst p)
(update_elections_data_net (pDst p)
(pSrc p) (pBody p) (nwState net (pDst p)), r1) |})
by
(eapply RRIR_doLeader; eauto;
[simpl in *; break_if; try congruence; eauto| in_crush]).
eapply_prop refined_raft_net_invariant_do_generic_server'. eauto.
eapply_prop refined_raft_net_invariant_do_leader'. eauto.
eapply refined_raft_invariant_handle_message' with (P := P); auto.
eauto. eauto.   auto. eauto.  eauto. eauto using in_app_or. auto.
eauto.
simpl. break_if; intuition eauto.
eauto.
simpl. eapply in_app_or. auto. auto.
simpl. break_if; eauto; congruence.
simpl. intros.
break_if; subst;
repeat rewrite update_same by auto;
repeat rewrite update_neq by auto; auto.
simpl. in_crush.
+ match goal with
| [ H : refined_raft_intermediate_reachable _ |- _ ?x ] =>
assert (refined_raft_intermediate_reachable x) as Hpost
by (eapply RRIR_step_failure; eauto; eapply StepFailure_input; eauto)
end.
unfold refined_input_handlers in *. simpl in *.
unfold RaftInputHandler, update_elections_data_input in *. repeat break_let.
repeat find_inversion.
match goal with
| [ H : refined_raft_intermediate_reachable ?net, H' : context [net]  |- _ ] =>
match type of H' with
| refined_raft_intermediate_reachable _ => move H after H'
end
end.
assert
(refined_raft_intermediate_reachable
{|
nwPackets := nwPackets net ++ send_packets h l2;
nwState := update name_eq_dec (nwState net) h
(update_elections_data_input h
inp
(nwState net h), r0) |})
by (eapply RRIR_handleInput; eauto; in_crush).
assert
(refined_raft_intermediate_reachable
{|
nwPackets := (nwPackets net
++ send_packets h l2)
++ send_packets h l4 ;
nwState := update name_eq_dec
(nwState
{|
nwPackets := nwPackets net ++ send_packets h l2;
nwState := update name_eq_dec
(nwState net)
h
(update_elections_data_input h inp
(nwState net h), r0) |})
h
(update_elections_data_input h inp (nwState net h), r1) |})
by
(eapply RRIR_doLeader; eauto;
[simpl in *; break_if; try congruence; eauto| in_crush]).
eapply_prop refined_raft_net_invariant_do_generic_server'. eauto.
eapply_prop refined_raft_net_invariant_do_leader'. eauto.
eapply refined_raft_invariant_handle_input' with (P := P); auto.
eauto. all:auto. all: eauto. eauto using in_app_or.
simpl. break_if; intuition eauto.
eauto.
simpl. eapply in_app_or.
auto.
simpl. break_if; eauto; congruence.
simpl. intros.
break_if; subst;
repeat rewrite update_same by auto;
repeat rewrite update_neq by auto; auto.
simpl. unfold send_packets.  intros. in_crush.
+ match goal with
| [ H : nwPackets ?net = _ |- _ {| nwPackets := ?ps ; nwState := ?st |} ] =>
assert (forall p, In p (nwPackets {| nwPackets := ps ; nwState := st |}) ->
In p (nwPackets net)) by (intros; simpl in *; find_rewrite; in_crush)
end.
eapply_prop refined_raft_net_invariant_state_same_packet_subset; [|eauto|idtac|];
eauto.
+ match goal with
| [ H : nwPackets ?net = _ |- _ {| nwPackets := ?ps ; nwState := ?st |} ] =>
assert (forall p, In p (nwPackets {| nwPackets := ps ; nwState := st |}) ->
In p (nwPackets net)) by (intros; simpl in *; find_rewrite; in_crush)
end.
eapply_prop refined_raft_net_invariant_state_same_packet_subset; [|eauto|idtac|];
eauto.
+ auto.
+ eapply_prop refined_raft_net_invariant_reboot'; eauto;
intros; simpl in *; repeat break_if; intuition; subst; intuition eauto.
* econstructor. eauto. eapply StepFailure_reboot; eauto.
* destruct (nwState net h); auto.
- eapply refined_raft_invariant_handle_input'; eauto.
eapply RRIR_handleInput; eauto.
- eapply refined_raft_invariant_handle_message'; eauto.
eapply RRIR_handleMessage; eauto.
- eapply_prop refined_raft_net_invariant_do_leader'; eauto.
eapply RRIR_doLeader; eauto.
- eapply_prop refined_raft_net_invariant_do_generic_server'; eauto.
eapply RRIR_doGenericServer; eauto.
Qed.
Ltac workhorse :=
try match goal with
| [ |- mkNetwork _ _ = mkNetwork _ _ ] => f_equal
end;
try match goal with
| [ |- (fun _ => _) = (fun _ => _) ] => apply functional_extensionality; intros
end;
repeat break_match;
repeat match goal with
| [ H : (_, _) = (_, _) |- _ ] => invc H
end;
repeat (simpl in *; subst);
repeat rewrite map_app;
repeat rewrite map_map.
Proof using.
intros.
induction H.
- constructor.
- simpl in *.
pose proof (RIR_step_failure).
specialize (H1 failed (deghost net) failed' (deghost net') out).
apply H1; auto.
apply ghost_simulation_1; auto.
- unfold deghost in *. simpl in *.
eapply RIR_handleInput; eauto.
+ simpl in *. repeat break_match. simpl in *.
assert (nwState h = (g, d0)) by eauto.
repeat find_rewrite. eauto.
+ intros. simpl in *.
repeat break_match; subst; simpl in *;
repeat find_higher_order_rewrite; break_if; subst; simpl in *;
congruence.
+ intros. simpl in *. in_crush.
find_apply_hyp_hyp.
in_crush.
- unfold deghost in *. simpl in *.
pose proof (RIR_handleMessage).
specialize
(H5 (@mkPacket _ multi_params
(pSrc p)
(pDst p)
(pBody p))).
eapply H5; eauto.
+ simpl in *. repeat break_match. simpl in *.
repeat find_rewrite. eauto.
+ simpl in *.
unfold raft_refined_base_params, raft_refined_multi_params in *.
simpl in *.
repeat find_rewrite.
map_crush. eauto.
+ intros. repeat break_match. simpl in *.
repeat find_higher_order_rewrite.
repeat break_match; congruence.
+ in_crush.
find_apply_hyp_hyp. in_crush.
- unfold deghost in *. simpl in *.
eapply RIR_doLeader; eauto.
+ simpl in *. repeat break_match. simpl in *.
assert (nwState h = (g, d0)) by eauto.
repeat find_rewrite. repeat find_inversion. eauto.
+ simpl in *.
intros. repeat break_match; simpl in *;
repeat find_higher_order_rewrite;
repeat break_match; congruence.
+ in_crush.
find_apply_hyp_hyp. in_crush.
- unfold deghost in *. simpl in *.
eapply RIR_doGenericServer; eauto.
+ simpl in *. repeat break_match. simpl in *.
assert (nwState h = (g, d0)) by eauto.
repeat find_rewrite. repeat find_inversion. eauto.
+ simpl in *.
intros. repeat break_match; simpl in *;
repeat find_higher_order_rewrite;
repeat break_match; congruence.
+ in_crush.
find_apply_hyp_hyp. in_crush.
Qed.
Proof using.
intros.
eauto using simulation_1.
Qed.
Proof using.
intros.
induction H.
- exists (reghost step_async_init). intuition.
unfold reghost. constructor.
- break_exists. break_and.
apply ghost_simulation_2 with (gnet := x) in H0; auto.
repeat (break_exists; intuition).
subst.
exists x0. intuition.
eapply RRIR_step_failure; eauto.
- break_exists. break_and.
subst.
exists {| nwPackets := map ghost_packet ps' ;
nwState := update name_eq_dec (nwState x) h (update_elections_data_input h inp (nwState x h), d)
|}. intuition.
+ unfold deghost. simpl in *. map_crush. f_equal.
* map_id.
* apply functional_extensionality.
intros. find_higher_order_rewrite.
repeat break_match; auto. simpl in *. congruence.
+ unfold deghost in *.
eapply RRIR_handleInput; repeat break_match; simpl in *; eauto.
simpl in *. in_crush.
find_apply_hyp_hyp. in_crush.
destruct x. auto.
- break_exists. break_and.
subst.
exists {| nwPackets := map ghost_packet ps' ;
nwState := update name_eq_dec (nwState x) (pDst p)
(update_elections_data_net (pDst p) (pSrc p)
(pBody p) (nwState x (pDst p)), d)
|}. intuition.
+ unfold deghost. simpl in *. map_crush. f_equal.
* map_id.
* apply functional_extensionality.
intros. find_higher_order_rewrite.
repeat break_match; auto. simpl in *. congruence.
+ unfold deghost in *.
eapply @RRIR_handleMessage with (p := ghost_packet p);
repeat break_match; simpl in *; eauto.
* simpl in *.
match goal with
| H : map _ ?la = ?lb |- _ =>
symmetry in H;
pose proof @map_inverses _ _ la lb deghost_packet ghost_packet
end.
repeat (forwards; [intro a; destruct a; reflexivity|]; concludes;
match goal with
| H :  forall _ : packet,  _ = _ |- _ => clear H
end).
concludes. map_crush. eauto.
* simpl in *. in_crush.
find_apply_hyp_hyp. in_crush.
- break_exists. break_and. subst.
exists {| nwPackets := map ghost_packet ps' ;
nwState := update name_eq_dec (nwState x) h (fst (nwState x h) , d')
|}. intuition.
+ unfold deghost. simpl in *. map_crush. f_equal.
* map_id.
* apply functional_extensionality.
intros. find_higher_order_rewrite.
repeat break_match; auto. simpl in *. congruence.
+ unfold deghost in *. simpl in *. repeat break_match; simpl in *.
eapply @RRIR_doLeader with (d := d) (h := h);
repeat (break_match; simpl in *); eauto.
* simpl in *. find_rewrite. simpl in *. auto.
* simpl in *. in_crush.
find_apply_hyp_hyp. in_crush.
destruct x. auto.
- break_exists. break_and. subst.
exists {| nwPackets := map ghost_packet ps' ;
nwState := update name_eq_dec (nwState x) h (fst (nwState x h) , d')
|}. intuition.
+ unfold deghost. simpl in *. map_crush. f_equal.
* map_id.
* apply functional_extensionality.
intros. find_higher_order_rewrite.
repeat break_match; auto. simpl in *. congruence.
+ unfold deghost in *. simpl in *. repeat break_match; simpl in *.
eapply @RRIR_doGenericServer with (d := d) (h := h);
repeat (break_match; simpl in *); eauto.
* simpl in *. find_rewrite. simpl in *. auto.
* simpl in *. in_crush.
find_apply_hyp_hyp. in_crush.
destruct x. auto.
Qed.
Proof using.
intros.
find_apply_lem_hyp simulation_2.
break_exists. intuition. subst. eauto.
Qed.

Lemma deghost_spec :
forall (net : @network _ raft_refined_multi_params) h,
nwState (deghost net) h = snd (nwState net h).