theory structures_proofs

lemma (in kernel_all_substitute) cap_irq_handler_cap_new_spec:
  "\<forall>s. \<Gamma> \<turnstile> {s}
       \<acute>ret__struct_cap_C :== PROC cap_irq_handler_cap_new(\<acute>capIRQ)
       \<lbrace>cap_irq_handler_cap_lift \<acute>ret__struct_cap_C = \<lparr>
          cap_irq_handler_cap_CL.capIRQ_CL = (\<^bsup>s\<^esup>capIRQ___unsigned AND mask 8) \<rparr> \<and>
        cap_get_tag \<acute>ret__struct_cap_C = scast cap_irq_handler_cap\<rbrace>" apply (rule allI, rule conseqPre, vcg) apply (clarsimp simp: guard_simps o_def mask_def shift_over_ao_dists) apply (rule context_conjI[THEN iffD1[OF conj_commute]],
         fastforce simp: cap_get_tag_eq_x cap_irq_handler_cap_def
                         mask_def shift_over_ao_dists word_bw_assocs word_ao_dist) apply (simp add: cap_irq_handler_cap_lift_def) apply (erule cap_lift_irq_handler_cap[THEN subst[OF sym]]; simp?) apply ((intro conjI sign_extend_eq)?;
         (simp add: mask_def shift_over_ao_dists multi_shift_simps word_size
                    word_ao_dist word_bw_assocs word_and_max_simps cap_irq_handler_cap_def))? done

(* Proof state trace *)
proof (prove)
goal (1 subgoal):
 1. \<forall>s. \<Gamma>\<turnstile> {s} Call cap_irq_handler_cap_new_'proc \<lbrace>cap_irq_handler_cap_lift \<acute>ret__struct_cap_C = \<lparr>capIRQ_CL = \<^bsup>s\<^esup>capIRQ && mask 8\<rparr> \<and> cap_get_tag \<acute>ret__struct_cap_C = SCAST(32 signed \<rightarrow> 32) cap_irq_handler_cap\<rbrace> proof (prove)
goal (1 subgoal):
 1. \<And>s. {s} \<subseteq> \<lbrace>\<forall>v. 0 <s 2 \<and> 0 \<le>s 0 \<and> 0 <s 0x20 \<and> 1 <s 2 \<and> 0 \<le>s 1 \<and> 0 \<le>s 0 \<and> 0 <s 0x20 \<and> cap_irq_handler_cap_lift (cap_C.words_C_update (\<lambda>v. Arrays.update v (unat 1) (SCAST(32 signed \<rightarrow> 32) 0 || (\<acute>capIRQ && 0xFF << unat 0))) (cap_C.words_C_update (\<lambda>v. Arrays.update v (unat 0) (SCAST(32 signed \<rightarrow> 32) 0 || (SCAST(32 signed \<rightarrow> 32) cap_irq_handler_cap && 0xFF << unat 0))) v)) = \<lparr>capIRQ_CL = \<^bsup>s\<^esup>capIRQ && mask 8\<rparr> \<and> cap_get_tag (cap_C.words_C_update (\<lambda>v. Arrays.update v (unat 1) (SCAST(32 signed \<rightarrow> 32) 0 || (\<acute>capIRQ && 0xFF << unat 0))) (cap_C.words_C_update (\<lambda>v. Arrays.update v (unat 0) (SCAST(32 signed \<rightarrow> 32) 0 || (SCAST(32 signed \<rightarrow> 32) cap_irq_handler_cap && 0xFF << unat 0))) v)) = SCAST(32 signed \<rightarrow> 32) cap_irq_handler_cap\<rbrace> proof (prove)
goal (1 subgoal):
 1. \<And>s v. cap_irq_handler_cap_lift (cap_C.words_C_update (\<lambda>x. Arrays.update (Arrays.update x 0 (SCAST(32 signed \<rightarrow> 32) cap_irq_handler_cap && 0xFF)) (Suc 0) (capIRQ_' s && 0xFF)) v) = \<lparr>capIRQ_CL = capIRQ_' s && 0xFF\<rparr> \<and> cap_get_tag (cap_C.words_C_update (\<lambda>x. Arrays.update (Arrays.update x 0 (SCAST(32 signed \<rightarrow> 32) cap_irq_handler_cap && 0xFF)) (Suc 0) (capIRQ_' s && 0xFF)) v) = SCAST(32 signed \<rightarrow> 32) cap_irq_handler_cap proof (prove)
goal (1 subgoal):
 1. \<And>s v. cap_get_tag (cap_C.words_C_update (\<lambda>x. Arrays.update (Arrays.update x 0 (SCAST(32 signed \<rightarrow> 32) cap_irq_handler_cap && 0xFF)) (Suc 0) (capIRQ_' s && 0xFF)) v) = SCAST(32 signed \<rightarrow> 32) cap_irq_handler_cap \<Longrightarrow> cap_irq_handler_cap_lift (cap_C.words_C_update (\<lambda>x. Arrays.update (Arrays.update x 0 (SCAST(32 signed \<rightarrow> 32) cap_irq_handler_cap && 0xFF)) (Suc 0) (capIRQ_' s && 0xFF)) v) = \<lparr>capIRQ_CL = capIRQ_' s && 0xFF\<rparr> proof (prove)
goal (1 subgoal):
 1. \<And>s v. cap_get_tag (cap_C.words_C_update (\<lambda>x. Arrays.update (Arrays.update x 0 (SCAST(32 signed \<rightarrow> 32) cap_irq_handler_cap && 0xFF)) (Suc 0) (capIRQ_' s && 0xFF)) v) = SCAST(32 signed \<rightarrow> 32) cap_irq_handler_cap \<Longrightarrow> (case cap_lift (cap_C.words_C_update (\<lambda>x. Arrays.update (Arrays.update x 0 (SCAST(32 signed \<rightarrow> 32) cap_irq_handler_cap && 0xFF)) (Suc 0) (capIRQ_' s && 0xFF)) v) of Some (Cap_irq_handler_cap rec) \<Rightarrow> rec) = \<lparr>capIRQ_CL = capIRQ_' s && 0xFF\<rparr> proof (prove)
goal (1 subgoal):
 1. \<And>s. (capIRQ_' s && 0xFF) && mask 8 = capIRQ_' s && 0xFF proof (prove)
goal:
No subgoals!