[Imprint][Data Privacy Statement][E-Mail]

View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 296 from proof refine-link (previous step)

cache_dirs[ino2] = mkdir(m8, md4, # links(ino2, cache_dirs), m13, entries2), cache_dirs[ino1] = mkdir(m7, md5, # links(ino1, cache_dirs), m11, entries1), entries[str] = entries2[str], cache_dirs[ino0] = mkdir(m4, md2, # links(ino0, cache_dirs), m10, entries), cache_dirs[ino3] = mkdir(m0, md3, # links(ino3, cache_dirs), m2, entries0), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries2[str]] = mkfile(m5, md1, # links(entries2[str], cache_dirs), content), cache_dirs[m] = mkdir(m1, md7, # links(m, cache_dirs), m9, entries3), entries0[str] = entries2[str], cache_files[entries2[str]] = mkfile(m3, md6, # links(entries2[str], cache_dirs), content1), entries1[str] = entries2[str], afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, dirs = cache_dirs[m, mkdir(m1 + 1, md7, # links(m, cache_dirs), m9, entries3[str0, entries2[str]])], afs-cons(cache_dirs, cache_files), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), 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), str ∈ entries0, str ∈ entries1, ino1 ∈ cache_dirs, entries2[str] ∈ cache_files, m ∈ cache_dirs, ino3 ∈ cache_dirs, ino0 ∈ cache_dirs, str ∈ entries, ino2 ∈ cache_dirs, str ∈ entries2, ⌊err1⌋ , ¬ str0 ∈ entries3, cache_sync → synced(cache_files, cache_icache, cache_pcache), links(ino1, cache_dirs) ≠ ∅ ∨ ino1 = ROOT_INO, links(m, cache_dirs) ≠ ∅ ∨ m = ROOT_INO, links(ino3, cache_dirs) ≠ ∅ ∨ ino3 = ROOT_INO, links(ino0, cache_dirs) ≠ ∅ ∨ ino0 = ROOT_INO, links(ino2, cache_dirs) ≠ ∅ ∨ ino2 = ROOT_INO ⊦ ∃ err0. ⌊err0⌋ ∧ ⟨err := err0; asynced := ?⟩ ((asynced ↔ asynced0) ∧ err1 = err), ⟨afs_inc_nlink#(mkdentry(str, entries0[str]).ino; dirs, afs_files); new_dent := mkdentry(str0, mkdentry(str, entries0[str]).ino); afs_inode_sync#(mkinode(m, md, true, # links(m, cache_dirs), m9, m1); dirs, afs_files); afs_inode_sync#(mkinode(entries1[str], md0, false, # links(entries1[str], cache_dirs), 0, m6); dirs, afs_files); p_inode := (m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode(m, afs_files[m].meta, false, afs_files[m].nlink, 0, afs_files[m].size) ); c_inode := getinode(mkdentry(str, entries0[str]).ino, dirs, afs_files); err := ESUCCESS; asynced := ?⟩ ( dirs = cache_dirs ∧ afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache ∧ (asynced ↔ asynced0) ∧ mkinode(m, md, true, # links(m, cache_dirs), m9, m1) = p_inode ∧ mkinode(entries1[str], md0, false, # links(entries1[str], cache_dirs), 0, m6) = c_inode ∧ negdentry(str0) = new_dent ∧ err1 = err)

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 297:
entries1[str] = entries2[str], cache_files[entries2[str]] = mkfile(m3, md6, # links(entries2[str], cache_dirs), content1), entries0[str] = entries2[str], cache_dirs[m] = mkdir(m1, md7, # links(m, cache_dirs), m9, entries3), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries2[str]] = mkfile(m5, md1, # links(entries2[str], cache_dirs), content), cache_dirs[ino3] = mkdir(m0, md3, # links(ino3, cache_dirs), m2, entries0), cache_dirs[ino0] = mkdir(m4, md2, # links(ino0, cache_dirs), m10, entries), entries[str] = entries2[str], cache_dirs[ino1] = mkdir(m7, md5, # links(ino1, cache_dirs), m11, entries1), cache_dirs[ino2] = mkdir(m8, md4, # links(ino2, cache_dirs), m13, entries2), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, dirs = cache_dirs[m, mkdir(m1 + 1, md7, # links(m, cache_dirs), m9, entries3[str0, entries2[str]])], files = afs_files, ino = mkdentry(str, entries0[str]).ino, mkdentry(str, entries0[str]).dentry?, 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), str ∈ entries2, ino2 ∈ cache_dirs, str ∈ entries, ino0 ∈ cache_dirs, ino3 ∈ cache_dirs, m ∈ cache_dirs, entries2[str] ∈ cache_files, ino1 ∈ cache_dirs, str ∈ entries1, str ∈ entries0, ⌊err1⌋ , cache_sync → synced(cache_files, cache_icache, cache_pcache), links(ino2, cache_dirs) ≠ ∅ ∨ ino2 = ROOT_INO, links(ino0, cache_dirs) ≠ ∅ ∨ ino0 = ROOT_INO, links(ino3, cache_dirs) ≠ ∅ ∨ ino3 = ROOT_INO, links(m, cache_dirs) ≠ ∅ ∨ m = ROOT_INO, links(ino1, cache_dirs) ≠ ∅ ∨ ino1 = ROOT_INO ⊦ ⟨if ino ∈ dirs then dirs[ino].nlink := dirs[ino].nlink + 1; if ino ∈ files then files[ino].nlink := files[ino].nlink + 1; new_dent := mkdentry(str0, mkdentry(str, entries0[str]).ino); afs_inode_sync#(mkinode(m, md, true, # links(m, cache_dirs), m9, m1); dirs, files); afs_inode_sync#(mkinode(entries1[str], md0, false, # links(entries1[str], cache_dirs), 0, m6); dirs, files); p_inode := (m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode(m, files[m].meta, false, files[m].nlink, 0, files[m].size) ); c_inode := getinode(mkdentry(str, entries0[str]).ino, dirs, files); err := ESUCCESS; asynced := ?⟩ ( dirs = cache_dirs ∧ files = (cache_files ⊕ cache_pcache) ⊕ cache_icache ∧ (asynced ↔ asynced0) ∧ mkinode(m, md, true, # links(m, cache_dirs), m9, m1) = p_inode ∧ mkinode(entries1[str], md0, false, # links(entries1[str], cache_dirs), 0, m6) = c_inode ∧ negdentry(str0) = new_dent ∧ err1 = err), ∃ err0. ⌊err0⌋ ∧ ⟨err := err0; asynced := ?⟩ ((asynced ↔ asynced0) ∧ err1 = err), str0 ∈ entries3

Rule argument

pos: right 2

Additional information

Used simplifier rules: afs_inc_nlink#(INO; DIRS, FILES) {if INO ∈ DIRS then DIRS[INO].nlink := DIRS[INO].nlink + 1; if INO ∈ FILES then FILES[INO].nlink := FILES[INO].nlink + 1 };% ⊦ mkdentry(str, m).dentry?; (s)