theory structures_proofs

lemma (in kernel_all_substitute) cap_asid_pool_cap_new_spec:
  "\<forall>s. \<Gamma> \<turnstile> {s}
       \<acute>ret__struct_cap_C :== PROC cap_asid_pool_cap_new(\<acute>capASIDBase, \<acute>capASIDPool)
       \<lbrace>cap_asid_pool_cap_lift \<acute>ret__struct_cap_C = \<lparr>
          cap_asid_pool_cap_CL.capASIDBase_CL = (\<^bsup>s\<^esup>capASIDBase___unsigned AND mask 17),
          cap_asid_pool_cap_CL.capASIDPool_CL = (\<^bsup>s\<^esup>capASIDPool___unsigned AND NOT (mask 4)) \<rparr> \<and>
        cap_get_tag \<acute>ret__struct_cap_C = scast cap_asid_pool_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_asid_pool_cap_def
                         mask_def shift_over_ao_dists word_bw_assocs word_ao_dist) apply (simp add: cap_asid_pool_cap_lift_def) apply (erule cap_lift_asid_pool_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_asid_pool_cap_def))? done

(* Proof state trace *)
proof (prove)
goal (1 subgoal):
 1. \<forall>s. \<Gamma>\<turnstile> {s} Call cap_asid_pool_cap_new_'proc \<lbrace>cap_asid_pool_cap_lift \<acute>ret__struct_cap_C = \<lparr>capASIDBase_CL = \<^bsup>s\<^esup>capASIDBase && mask 17, capASIDPool_CL = \<^bsup>s\<^esup>capASIDPool && ~~ mask 4\<rparr> \<and> cap_get_tag \<acute>ret__struct_cap_C = SCAST(32 signed \<rightarrow> 32) cap_asid_pool_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> 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_asid_pool_cap_lift (cap_C.words_C_update (\<lambda>v. Arrays.update v (unat 1) (SCAST(32 signed \<rightarrow> 32) 0 || (\<acute>capASIDBase && 0x1FFFF << unat 0))) (cap_C.words_C_update (\<lambda>v. Arrays.update v (unat 0) ((SCAST(32 signed \<rightarrow> 32) 0 || (\<acute>capASIDPool && 0xFFFFFFF0 >> unat 0)) || (SCAST(32 signed \<rightarrow> 32) cap_asid_pool_cap && 0xF << unat 0))) v)) = \<lparr>capASIDBase_CL = \<^bsup>s\<^esup>capASIDBase && mask 17, capASIDPool_CL = \<^bsup>s\<^esup>capASIDPool && ~~ mask 4\<rparr> \<and> cap_get_tag (cap_C.words_C_update (\<lambda>v. Arrays.update v (unat 1) (SCAST(32 signed \<rightarrow> 32) 0 || (\<acute>capASIDBase && 0x1FFFF << unat 0))) (cap_C.words_C_update (\<lambda>v. Arrays.update v (unat 0) ((SCAST(32 signed \<rightarrow> 32) 0 || (\<acute>capASIDPool && 0xFFFFFFF0 >> unat 0)) || (SCAST(32 signed \<rightarrow> 32) cap_asid_pool_cap && 0xF << unat 0))) v)) = SCAST(32 signed \<rightarrow> 32) cap_asid_pool_cap\<rbrace> proof (prove)
goal (1 subgoal):
 1. \<And>s v. cap_asid_pool_cap_lift (cap_C.words_C_update (\<lambda>x. Arrays.update (Arrays.update x (Suc 0) (capASIDBase_' s && 0x1FFFF)) 0 (capASIDPool_' s && 0xFFFFFFF0 || SCAST(32 signed \<rightarrow> 32) cap_asid_pool_cap && 0xF)) v) = \<lparr>capASIDBase_CL = capASIDBase_' s && 0x1FFFF, capASIDPool_CL = capASIDPool_' s && 0xFFFFFFF0\<rparr> \<and> cap_get_tag (cap_C.words_C_update (\<lambda>x. Arrays.update (Arrays.update x (Suc 0) (capASIDBase_' s && 0x1FFFF)) 0 (capASIDPool_' s && 0xFFFFFFF0 || SCAST(32 signed \<rightarrow> 32) cap_asid_pool_cap && 0xF)) v) = SCAST(32 signed \<rightarrow> 32) cap_asid_pool_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 (Suc 0) (capASIDBase_' s && 0x1FFFF)) 0 (capASIDPool_' s && 0xFFFFFFF0 || SCAST(32 signed \<rightarrow> 32) cap_asid_pool_cap && 0xF)) v) = SCAST(32 signed \<rightarrow> 32) cap_asid_pool_cap \<Longrightarrow> cap_asid_pool_cap_lift (cap_C.words_C_update (\<lambda>x. Arrays.update (Arrays.update x (Suc 0) (capASIDBase_' s && 0x1FFFF)) 0 (capASIDPool_' s && 0xFFFFFFF0 || SCAST(32 signed \<rightarrow> 32) cap_asid_pool_cap && 0xF)) v) = \<lparr>capASIDBase_CL = capASIDBase_' s && 0x1FFFF, capASIDPool_CL = capASIDPool_' s && 0xFFFFFFF0\<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 (Suc 0) (capASIDBase_' s && 0x1FFFF)) 0 (capASIDPool_' s && 0xFFFFFFF0 || SCAST(32 signed \<rightarrow> 32) cap_asid_pool_cap && 0xF)) v) = SCAST(32 signed \<rightarrow> 32) cap_asid_pool_cap \<Longrightarrow> (case cap_lift (cap_C.words_C_update (\<lambda>x. Arrays.update (Arrays.update x (Suc 0) (capASIDBase_' s && 0x1FFFF)) 0 (capASIDPool_' s && 0xFFFFFFF0 || SCAST(32 signed \<rightarrow> 32) cap_asid_pool_cap && 0xF)) v) of Some (Cap_asid_pool_cap rec) \<Rightarrow> rec) = \<lparr>capASIDBase_CL = capASIDBase_' s && 0x1FFFF, capASIDPool_CL = capASIDPool_' s && 0xFFFFFFF0\<rparr> proof (prove)
goal (1 subgoal):
 1. \<And>s. (capASIDBase_' s && 0x1FFFF) && mask 17 = capASIDBase_' s && 0x1FFFF \<and> (capASIDPool_' s && 0xFFFFFFF0 || SCAST(32 signed \<rightarrow> 32) cap_asid_pool_cap && 0xF) && ~~ mask 4 = capASIDPool_' s && 0xFFFFFFF0 proof (prove)
goal:
No subgoals!