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

(m = m0 ⊃ mkfile(m5, md0, # links(m0, dirs), content0 upto min(m5, m2));files0[m]) = mkfile(m4, md, m6, content), truncate(m0, min(m5, m2), pcache0)[datakey(m, m3)] = mkpentry(boolvar, buf), files0[m0] = mkfile(m1, md1, # links(m0, dirs), content0), afs-cons(dirs, files0), afs-cons(dirs, files0[m0, mkfile(m5, md0, # links(m0, dirs), content0 upto min(m5, m2))]), synced(dirs, icache, pcache0), m0 ∈ files0, datakey(m, m3) ∈ pcache0, asynced2 → synced(files0, icache, pcache0), ∀ key. key ∈ pcache0 → key.data?, ∀ key. key ∈ pcache0 → key.data? ∧ # pcache0[key].page = VFS_PAGE_SIZE ∧ key.ino ∈ files0 ∧ (¬ pcache0[key].dirty → key.part ∈ files0[key.ino].content ∧ pcache0[key].page = files0[key.ino].content[key.part]), m3 * VFS_PAGE_SIZE < min(m5, m2) ∨ m0 ≠ m ⊦ datakey(m0, m2 / VFS_PAGE_SIZE) ∈ pcache0, m2 ≤ m5 ∧ m2 % VFS_PAGE_SIZE ≠ 0 ∧ m2 / VFS_PAGE_SIZE ∈ content0, # buf = VFS_PAGE_SIZE ∧ m ∈ files0 ∧ (¬ boolvar → m3 ∈ content ∧ buf = content[m3])

Heuristic use patterns applied rule all left

And obtained the following new goals

Proof step 347:
(m = m0 ⊃ mkfile(m5, md0, # links(m0, dirs), content0 upto min(m5, m2));files0[m]) = mkfile(m4, md, m6, content), files0[m0] = mkfile(m1, md1, # links(m0, dirs), content0), truncate(m0, min(m5, m2), pcache0)[datakey(m, m3)] = mkpentry(boolvar, buf), afs-cons(dirs, files0[m0, mkfile(m5, md0, # links(m0, dirs), content0 upto min(m5, m2))]), afs-cons(dirs, files0), synced(dirs, icache, pcache0), datakey(m, m3) ∈ pcache0, m0 ∈ files0, asynced2 → synced(files0, icache, pcache0), datakey(m, m3) ∈ pcache0 → datakey(m, m3).data? ∧ # pcache0[datakey(m, m3)].page = VFS_PAGE_SIZE ∧ datakey(m, m3).ino ∈ files0 ∧ ( ¬ pcache0[datakey(m, m3)].dirty → datakey(m, m3).part ∈ files0[datakey(m, m3).ino].content ∧ pcache0[datakey(m, m3)].page = files0[datakey(m, m3).ino].content[datakey(m, m3).part]), ∀ key. key ∈ pcache0 → key.data? ∧ # pcache0[key].page = VFS_PAGE_SIZE ∧ key.ino ∈ files0 ∧ (¬ pcache0[key].dirty → key.part ∈ files0[key.ino].content ∧ pcache0[key].page = files0[key.ino].content[key.part]), ∀ key. key ∈ pcache0 → key.data?, m3 * VFS_PAGE_SIZE < min(m5, m2) ∨ m0 ≠ m ⊦ datakey(m0, m2 / VFS_PAGE_SIZE) ∈ pcache0, # buf = VFS_PAGE_SIZE ∧ m ∈ files0 ∧ (¬ boolvar → m3 ∈ content ∧ buf = content[m3]), m2 ≤ m5 ∧ m2 % VFS_PAGE_SIZE ≠ 0 ∧ m2 / VFS_PAGE_SIZE ∈ content0

Rule argument

pos: left 11 terms: datakey(m, m3) abort: T discard: F computed: F

Additional information

Used terms: datakey(m, m3)