[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 262 from proof inv-truncate-buff-none-uncached (previous step)

(m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode (m, (m ∈ files0 ⊃ mkfile(n, md, # links(m, dirs), content0 upto min(n, m2));files0[m]).meta, false, (m ∈ files0 ⊃ mkfile(n, md, # links(m, dirs), content0 upto min(n, m2));files0[m]).nlink, 0, (m ∈ files0 ⊃ mkfile(n, md, # links(m, dirs), content0 upto min(n, m2));files0[m]).size) ) = mkinode(m0, md0, boolvar, m3, m4, m5), files0[m] = mkfile(m1, md1, # links(m, dirs), content0), err = ESUCCESS, afs-cons(dirs, files0), afs-cons(dirs, files0[m, mkfile(n, md, # links(m, dirs), content0 upto min(n, m2))]), dcache-cons(dcache, dirs, files0), icache-cons(icache, dirs, files0), pcache-cons(pcache, dirs, files0), synced(dirs, icache, pcache), m ∈ files0, asynced2 → synced(files0, icache, pcache) ⊦ ⟪icache_set#(mkinode(m, md, false, # links(m, dirs), 0, n), false; err, icache); pcache_truncate#(m0, m2, n; err, pcache); inode := mkinode(m, md, false, # links(m, dirs), 0, n); ino := m; files := files0[m, mkfile(m1, md1, # links(m, dirs), content0 upto min(n, m2))]; asynced4 := false; if asynced4 then pcache_set# ((m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode (m, (m = ino ∧ ino ∈ files ⊃ (files[ino].size:= inode.size).meta:= inode.meta;files[m]).meta, false, (m = ino ∧ ino ∈ files ⊃ (files[ino].size:= inode.size).meta:= inode.meta;files[m]).nlink, 0, (m = ino ∧ ino ∈ files ⊃ (files[ino].size:= inode.size).meta:= inode.meta;files[m]).size) ) .ino, m2 / VFS_PAGE_SIZE, none.buf, false ; err, pcache); if ¬ asynced4 ∨ err ≠ ESUCCESS then buf-opt := none⟫ ( icache-cons(icache, dirs, files[ino, (ino ∈ files ⊃ files[ino].size:= inode.size;files[ino]).meta:= inode.meta]) ∧ dcache-cons(dcache, dirs, files[ino, (ino ∈ files ⊃ files[ino].size:= inode.size;files[ino]).meta:= inode.meta]) ∧ pcache-cons(pcache, dirs, files[ino, (ino ∈ files ⊃ files[ino].size:= inode.size;files[ino]).meta:= inode.meta]) ∧ synced(dirs, icache, pcache) ∧ (asynced2 → synced(files[ino, (ino ∈ files ⊃ files[ino].size:= inode.size;files[ino]).meta:= inode.meta], icache, pcache))), datakey(m, m2 / VFS_PAGE_SIZE) ∈ pcache, m2 ≤ n ∧ m2 % VFS_PAGE_SIZE ≠ 0 ∧ m2 / VFS_PAGE_SIZE ∈ content0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 263:
files0[m0] = mkfile(m1, md1, # links(m0, dirs), content0), err = ESUCCESS, afs-cons(dirs, files0[m0, mkfile(m5, md0, # links(m0, dirs), content0 upto min(m5, m2))]), afs-cons(dirs, files0), dcache-cons(dcache, dirs, files0), icache-cons(icache, dirs, files0), pcache-cons(pcache, dirs, files0), synced(dirs, icache, pcache), m0 ∈ files0, ¬ datakey(m0, m2 / VFS_PAGE_SIZE) ∈ pcache, asynced2 → synced(files0, icache, pcache) ⊦ ⟪icache_set#(mkinode(m0, md0, false, # links(m0, dirs), 0, m5), false; err, icache); pcache_truncate#(m0, m2, m5; err, pcache); inode := mkinode(m0, md0, false, # links(m0, dirs), 0, m5); ino := m0; files := files0[m0, mkfile(m1, md1, # links(m0, dirs), content0 upto min(m5, m2))]; asynced4 := false; if asynced4 then pcache_set# ((m0 ∈ dirs ⊃ mkinode(m0, dirs[m0].meta, true, dirs[m0].nlink, dirs[m0].nsubdirs, dirs[m0].size) ;mkinode (m0, (m0 = ino ∧ ino ∈ files ⊃ (files[ino].size:= inode.size).meta:= inode.meta;files[m0]).meta, false, (m0 = ino ∧ ino ∈ files ⊃ (files[ino].size:= inode.size).meta:= inode.meta;files[m0]).nlink, 0, (m0 = ino ∧ ino ∈ files ⊃ (files[ino].size:= inode.size).meta:= inode.meta;files[m0]).size) ) .ino, m2 / VFS_PAGE_SIZE, none.buf, false ; err, pcache); if ¬ asynced4 ∨ err ≠ ESUCCESS then buf-opt := none⟫ ( icache-cons(icache, dirs, files[ino, (ino ∈ files ⊃ files[ino].size:= inode.size;files[ino]).meta:= inode.meta]) ∧ dcache-cons(dcache, dirs, files[ino, (ino ∈ files ⊃ files[ino].size:= inode.size;files[ino]).meta:= inode.meta]) ∧ pcache-cons(pcache, dirs, files[ino, (ino ∈ files ⊃ files[ino].size:= inode.size;files[ino]).meta:= inode.meta]) ∧ synced(dirs, icache, pcache) ∧ (asynced2 → synced(files[ino, (ino ∈ files ⊃ files[ino].size:= inode.size;files[ino]).meta:= inode.meta], icache, pcache))), m2 ≤ m5 ∧ m2 % VFS_PAGE_SIZE ≠ 0 ∧ m2 / VFS_PAGE_SIZE ∈ content0

Rule argument

Additional information

Used simplifier rules: ⊦ mkinode(m, md, boolvar, m0, m1, m2) = mkinode(m3, md0, boolvar0, m4, m5, m6) ↔ m = m3 ∧ md = md0 ∧ (boolvar ↔ boolvar0) ∧ m0 = m4 ∧ m1 = m5 ∧ m2 = m6; (ws)% ⊦ afs-cons(dirs, files) ∧ ino ∈ dirs → ¬ ino ∈ files; (s)% ⊦ mkfile(m, md, m0, content).size = m; (s)% ⊦ mkfile(m, md, m0, content).nlink = m0; (s)% ⊦ mkfile(m, md, m0, content).meta = md; (s)