[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 129 from proof refine-unlink (previous step)

# links(entries[str], cache_dirs) = m0 + 1, # links(m3, cache_dirs) = m1, m9 + 1 = m, cache_files[entries[str]] = mkfile(m2, md3, m0 + 1, content), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries[str]] = mkfile(m7, md2, m0 + 1, content0), cache_dirs[m3] = mkdir(m9 + 1, md4, m1, m4, entries), entries[str] = entries0[str], cache_dirs[m3] = mkdir(m, md, m1, m4, entries0), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, dirs = cache_dirs[m3, (cache_dirs[m3].entries:= (entries0 -- str)).size:= m9], afs-cons(cache_dirs[m3, mkdir(m9, md1, m1, m4, entries -- str)], cache_files[entries[str], mkfile(m6, md0, m0, content)]), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), afs-cons(cache_dirs, cache_files), dcache-cons (cache_dcache -- dentrykey(m3, str), cache_dirs[m3, mkdir(m9, md1, m1, m4, entries -- str)], cache_files[entries[str], mkfile(m6, md0, m0, content)]), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons (cache_icache[entries[str], mkientry(false, mkinode(entries[str], md0, false, m0, 0, m6))][m3, mkientry(false, mkinode(m3, md1, true, m1, m4, m9))], cache_dirs[m3, mkdir(m9, md1, m1, m4, entries -- str)], cache_files[entries[str], mkfile(m6, md0, m0, content)]), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons(cache_pcache, cache_dirs[m3, mkdir(m9, md1, m1, m4, entries -- str)], cache_files[entries[str], mkfile(m6, md0, m0, content)]), pcache-cons(cache_pcache, cache_dirs, cache_files), synced (cache_dirs[m3, mkdir(m9, md1, m1, m4, entries -- str)], cache_icache[entries[str], mkientry(false, mkinode(entries[str], md0, false, m0, 0, m6))][m3, mkientry(false, mkinode(m3, md1, true, m1, m4, m9))], cache_pcache), synced(cache_dirs, cache_icache, cache_pcache), str ∈ entries, entries[str] ∈ cache_files, m3 ∈ cache_dirs, str ∈ entries0, cache_sync → synced (cache_files[entries[str], mkfile(m6, md0, m0, content)], cache_icache[entries[str], mkientry(false, mkinode(entries[str], md0, false, m0, 0, m6))][m3, mkientry(false, mkinode(m3, md1, true, m1, m4, m9))], cache_pcache), cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m3, cache_dirs) ≠ ∅ ∨ m3 = ROOT_INO ⊦ ⟨afs_drop_nlink#(mkdentry(str, entries[str]).ino; dirs, afs_files); dent := negdentry(mkdentry(str, entries[str]).name); afs_inode_sync#(mkinode(m3, md1, true, m1, m4, m9 + 1); dirs, afs_files); afs_inode_sync#(mkinode(entries[str], md0, false, m0 + 1, 0, m6); dirs, afs_files); p_inode := (m3 ∈ dirs ⊃ mkinode(m3, dirs[m3].meta, true, dirs[m3].nlink, dirs[m3].nsubdirs, dirs[m3].size) ;mkinode(m3, afs_files[m3].meta, false, afs_files[m3].nlink, 0, afs_files[m3].size) ); c_inode := getinode(entries[str], dirs, afs_files); err := ESUCCESS; asynced := ?⟩ ( dirs = cache_dirs[m3, mkdir(m9, md1, # links(m3, cache_dirs), m4, entries -- str)] ∧ afs_files = (cache_files[entries[str], mkfile(m6, md0, m0, content)] ⊕ cache_pcache) ⊕ cache_icache[entries[str], mkientry(false, mkinode(entries[str], md0, false, m0, 0, m6))] [m3, mkientry(false, mkinode(m3, md1, true, # links(m3, cache_dirs), m4, m9)) ] ∧ (asynced ↔ asynced0) ∧ mkinode(m3, md1, true, # links(m3, cache_dirs), m4, m9) = p_inode ∧ mkinode(entries[str], md0, false, m0, 0, m6) = c_inode ∧ negdentry(str) = dent ∧ ESUCCESS = err)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 130:
# links(entries0[str], cache_dirs) = m0 + 1, cache_dirs[m3] = mkdir(m9 + 1, md, # links(m3, cache_dirs), m4, entries0), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries0[str]] = mkfile(m7, md2, m0 + 1, content0), cache_files[entries0[str]] = mkfile(m2, md3, m0 + 1, content), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, dirs = cache_dirs[m3, mkdir(m9, md, # links(m3, cache_dirs), m4, entries0 -- str)], afs-cons(cache_dirs, cache_files), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), afs-cons(cache_dirs[m3, mkdir(m9, md1, # links(m3, cache_dirs), m4, entries0 -- str)], cache_files[entries0[str], mkfile(m6, md0, m0, content)]), dcache-cons(cache_dcache, cache_dirs, cache_files), dcache-cons (cache_dcache -- dentrykey(m3, str), cache_dirs[m3, mkdir(m9, md1, # links(m3, cache_dirs), m4, entries0 -- str)], cache_files[entries0[str], mkfile(m6, md0, m0, content)]), icache-cons(cache_icache, cache_dirs, cache_files), icache-cons (cache_icache[entries0[str], mkientry(false, mkinode(entries0[str], md0, false, m0, 0, m6))] [m3, mkientry(false, mkinode(m3, md1, true, # links(m3, cache_dirs), m4, m9)) ], cache_dirs[m3, mkdir(m9, md1, # links(m3, cache_dirs), m4, entries0 -- str)], cache_files[entries0[str], mkfile(m6, md0, m0, content)]), pcache-cons(cache_pcache, cache_dirs, cache_files), pcache-cons (cache_pcache, cache_dirs[m3, mkdir(m9, md1, # links(m3, cache_dirs), m4, entries0 -- str)], cache_files[entries0[str], mkfile(m6, md0, m0, content)]), synced(cache_dirs, cache_icache, cache_pcache), synced (cache_dirs[m3, mkdir(m9, md1, # links(m3, cache_dirs), m4, entries0 -- str)], cache_icache[entries0[str], mkientry(false, mkinode(entries0[str], md0, false, m0, 0, m6))] [m3, mkientry(false, mkinode(m3, md1, true, # links(m3, cache_dirs), m4, m9)) ], cache_pcache), m3 ∈ cache_dirs, entries0[str] ∈ cache_files, str ∈ entries0, cache_sync → synced(cache_files, cache_icache, cache_pcache), cache_sync → synced (cache_files[entries0[str], mkfile(m6, md0, m0, content)], cache_icache[entries0[str], mkientry(false, mkinode(entries0[str], md0, false, m0, 0, m6))] [m3, mkientry(false, mkinode(m3, md1, true, # links(m3, cache_dirs), m4, m9)) ], cache_pcache), links(m3, cache_dirs) ≠ ∅ ∨ m3 = ROOT_INO ⊦ ⟨afs_drop_nlink#(mkdentry(str, entries0[str]).ino; dirs, afs_files); dent := negdentry(mkdentry(str, entries0[str]).name); afs_inode_sync#(mkinode(m3, md1, true, # links(m3, cache_dirs), m4, m9 + 1); dirs, afs_files); afs_inode_sync#(mkinode(entries0[str], md0, false, m0 + 1, 0, m6); dirs, afs_files); p_inode := (m3 ∈ dirs ⊃ mkinode(m3, dirs[m3].meta, true, dirs[m3].nlink, dirs[m3].nsubdirs, dirs[m3].size) ;mkinode(m3, afs_files[m3].meta, false, afs_files[m3].nlink, 0, afs_files[m3].size) ); c_inode := getinode(entries0[str], dirs, afs_files); err := ESUCCESS; asynced := ?⟩ ( dirs = cache_dirs[m3, mkdir(m9, md1, # links(m3, cache_dirs), m4, entries0 -- str)] ∧ afs_files = (cache_files[entries0[str], mkfile(m6, md0, m0, content)] ⊕ cache_pcache) ⊕ cache_icache[entries0[str], mkientry(false, mkinode(entries0[str], md0, false, m0, 0, m6))] [m3, mkientry(false, mkinode(m3, md1, true, # links(m3, cache_dirs), m4, m9)) ] ∧ (asynced ↔ asynced0) ∧ mkinode(m3, md1, true, # links(m3, cache_dirs), m4, m9) = p_inode ∧ mkinode(entries0[str], md0, false, m0, 0, m6) = c_inode ∧ negdentry(str) = dent ∧ ESUCCESS = err)

Rule argument

Additional information

Used simplifier rules: ⊦ mkdir(m, md, m0, m1, entries).size:= m2 = mkdir(m2, md, m0, m1, entries); (s)%⊦ mkdir(m, md, m0, m1, entries).entries:= entries0 = mkdir(m, md, m0, m1, entries0); (s)%⊦ mkdir(m, md, m0, m1, entries) = mkdir(m2, md0, m3, m4, entries0) ↔ m = m2 ∧ md = md0 ∧ m0 = m3 ∧ m1 = m4 ∧ entries = entries0; (ws)%afs-cons-file-nlink: ⊦ afs-cons(dirs, files) ∧ ino ∈ files ∧ files[ino] = mkfile(m, md, n, content) → # links(ino, dirs) = n; (forward) from specification afs-base