Proof step 466 from proof refine-rename-file-dentry (previous step)

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

• Proof step 467:

  # links(m, cache_dirs) = cache_dirs[m].nlink, # links(entries1[str0], cache_dirs) = m3, cache_dirs[m] = mkdir(cache_dirs[m].size, md8, cache_dirs[m].nlink, cache_dirs[m].nsubdirs, entries0), cache_files[entries1[str0]] = mkfile(m2, md7, m3, content1), entries1[str0] = cache_dirs[m].entries[str0], entries0[str0] = entries1[str0], cache_files[entries1[str0]] = mkfile(m0, md6, m3, content3), cache_dirs[m] = mkdir(cache_dirs[m].size, md9, cache_dirs[m].nlink, cache_dirs[m].nsubdirs, entries1), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries1[str0]] = mkfile(m8, md4, m3, content0), cache_files[entries1[str0]] = mkfile(m1, md, m3, content), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, dirs = cache_dirs[m, cache_dirs[m].entries:= (cache_dirs[m].entries -- str0).entries:= cache_dirs[m].entries], afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), afs-cons(cache_dirs, cache_files), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons(cache_pcache, cache_dirs, cache_files), synced(cache_dirs, cache_icache, cache_pcache), str0 ∈ cache_dirs[m].entries, entries1[str0] ∈ cache_files, m ∈ cache_dirs, str0 ∈ entries1, str0 ∈ entries0, cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m, cache_dirs) ≠ ∅ ∨ m = ROOT_INO ⊦ [afs_inode_sync#(mkinode(m, md0, true, cache_dirs[m].nlink, cache_dirs[m].nsubdirs, cache_dirs[m].size); dirs, cache_files); afs_inode_sync#(mkinode(m, md0, true, # links(m, cache_dirs), cache_dirs[m].nsubdirs, cache_dirs[m].size); dirs, cache_files); new_child_inode := mkinode(entries0[str0], md1, false, # links(entries0[str0], cache_dirs), 0, m10); afs_inode_sync#(new_child_inode; dirs, cache_files); new_child_inode := (new_child_inode.ino ∈ dirs ⊃ mkinode (new_child_inode.ino, dirs[new_child_inode.ino].meta, true, dirs[new_child_inode.ino].nlink, dirs[new_child_inode.ino].nsubdirs, dirs[new_child_inode.ino].size) ;mkinode (new_child_inode.ino, cache_files[new_child_inode.ino].meta, false, cache_files[new_child_inode.ino].nlink, 0, cache_files[new_child_inode.ino].size) ); old_parent_inode := (m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode(m, cache_files[m].meta, false, cache_files[m].nlink, 0, cache_files[m].size) ); new_parent_inode := (m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode(m, cache_files[m].meta, false, cache_files[m].nlink, 0, cache_files[m].size) ); err := ESUCCESS; asynced := ?; new_dent := mkdentry(mkdentry(str0, entries0[str0]).name, mkdentry(str0, entries1[str0]).ino); old_dent1 := negdentry(mkdentry(str0, entries1[str0]).name); str := str0; if err = ESUCCESS then let asynced = false in {icache_set#(old_parent_inode, asynced; err, cache_icache); icache_set#(new_parent_inode, asynced; err, cache_icache); if mkdentry(str, entries0[str]).dentry? then icache_set#(new_child_inode, asynced; err, cache_icache); dcache_delete#(old_parent_inode.ino, old_dent1.name; err, cache_dcache); dcache_set#(new_parent_inode.ino, new_dent.name, new_dent; err, cache_dcache)}] ( icache-cons(cache_icache, dirs, cache_files) ∧ dcache-cons(cache_dcache, dirs, cache_files) ∧ pcache-cons(cache_pcache, dirs, cache_files) ∧ afs-cons(dirs, cache_files) ∧ synced(dirs, cache_icache, cache_pcache) ∧ (cache_sync → synced(cache_files, cache_icache, cache_pcache)) → ⟨new_dent0 := mkdentry(str, entries0[str]); old_dent0 := mkdentry(str0, entries1[str0]); new_parent_inode0 := mkinode(m, md0, true, # links(m, cache_dirs), cache_dirs[m].nsubdirs, cache_dirs[m].size); old_parent_inode0 := mkinode(m, md0, true, # links(m, cache_dirs), cache_dirs[m].nsubdirs, cache_dirs[m].size); new_child_inode0 := mkinode(entries0[str], md1, false, # links(entries0[str], cache_dirs), 0, m10); old_child_inode0 := mkinode(entries1[str0], md2, false, # links(entries1[str0], cache_dirs), 0, m13); cache_dirs0 := cache_dirs; afs_rename# (; old_parent_inode0, new_parent_inode0, old_child_inode0, new_child_inode0, old_dent0, new_dent0, err0, cache_dirs, afs_files; afs_asynced)⟩ ( old_parent_inode = old_parent_inode0 ∧ new_parent_inode = new_parent_inode0 ∧ mkinode(entries1[str0], md2, false, # links(entries1[str0], cache_dirs0), 0, m13) = old_child_inode0 ∧ new_child_inode = new_child_inode0 ∧ old_dent1 = old_dent0 ∧ new_dent = new_dent0 ∧ err = err0 ∧ cache_dirs = dirs ∧ afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache ∧ (afs_asynced ↔ asynced))), entries1[str0] ∈ cache_dirs

Rule argument

Additional information

Used simplifier rules: ⊦ ((m = af.size ∧ md = af.meta) ∧ m0 = af.nlink) ∧ content = af.content ↔ af = mkfile(m, md, m0, content); (elim) Used terms: cache_files[entries1[str0]], m1, md, m3, content