[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 939 from proof refine-truncate-buff-none-cached (previous step)

# buf0 = VFS_PAGE_SIZE, ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[m3] = mkfile(m0, md0, # links(m3, cache_dirs), content0), cache_files[m3] = mkfile(m1, md2, # links(m3, cache_dirs), content1), cache_pcache[datakey(m3, m2 / VFS_PAGE_SIZE)] = mkpentry(boolvar, buf0), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, err = ESUCCESS, 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), datakey(m3, m2 / VFS_PAGE_SIZE) ∈ cache_pcache, m3 ∈ cache_files, cache_sync → synced(cache_files, cache_icache, cache_pcache) ⊦ ⟪icache_set#(mkinode(m3, md1, false, # links(m3, cache_dirs), 0, m6), false; err, cache_icache); pcache_truncate#(m3, m2, m6; err, cache_pcache); inode1 := (m3 ∈ cache_dirs ⊃ mkinode(m3, cache_dirs[m3].meta, true, cache_dirs[m3].nlink, cache_dirs[m3].nsubdirs, cache_dirs[m3].size) ;mkinode (m3, (m3 ∈ cache_files ⊃ mkfile(m6, md1, # links(m3, cache_dirs), content1 upto min(m6, m2));cache_files[m3]).meta, false, (m3 ∈ cache_files ⊃ mkfile(m6, md1, # links(m3, cache_dirs), content1 upto min(m6, m2));cache_files[m3]).nlink, 0, (m3 ∈ cache_files ⊃ mkfile(m6, md1, # links(m3, cache_dirs), content1 upto min(m6, m2));cache_files[m3]).size) ); buf-opt := some(buf0); asynced1 := false; if asynced1 then pcache_set#(inode1.ino, m2 / VFS_PAGE_SIZE, buf-opt.buf, false; err, cache_pcache); if ¬ asynced1 ∨ err ≠ ESUCCESS then buf-opt := none⟫ ⟨buf-opt0 := none; inode0 := mkinode(m3, md1, false, # links(m3, cache_dirs), 0, m2); cache_dirs0 := cache_dirs; cache_dirs1 := cache_dirs; cache_dirs2 := cache_dirs; cache_dirs3 := cache_dirs; afs_truncate#(m6, m2 / VFS_PAGE_SIZE; buf-opt0, inode0, asynced5, err0, cache_dirs, afs_files, cache_asynced)⟩ ( cache_dirs = cache_dirs3 ∧ afs_files = (cache_files[m3, mkfile(m6, md1, # links(m3, cache_dirs2), content1 upto min(m6, m2))] ⊕ cache_pcache) ⊕ cache_icache ∧ (cache_asynced ↔ asynced) ∧ buf-opt = buf-opt0 ∧ inode1 = inode0 ∧ (asynced1 ↔ asynced5) ∧ err = err0), m2 ≤ m6 ∧ m2 % VFS_PAGE_SIZE ≠ 0

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 940:
# buf0 = VFS_PAGE_SIZE, asynced ↔ false, cache_pcache[datakey(m3, m2 / VFS_PAGE_SIZE)] = mkpentry(boolvar, buf0), cache_files[m3] = mkfile(m1, md2, # links(m3, cache_dirs), content1), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[m3] = mkfile(m0, md0, # links(m3, cache_dirs), content0), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, err = ESUCCESS, icache = cache_icache, inode = mkinode(m3, md1, false, # links(m3, cache_dirs), 0, m6), 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), m3 ∈ cache_files, datakey(m3, m2 / VFS_PAGE_SIZE) ∈ cache_pcache, cache_sync → synced(cache_files, cache_icache, cache_pcache) ⊦ ⟪icache[inode.ino] := mkientry(asynced, inode); pcache_truncate#(m3, m2, m6; err, cache_pcache); inode1 := (m3 ∈ cache_dirs ⊃ mkinode(m3, cache_dirs[m3].meta, true, cache_dirs[m3].nlink, cache_dirs[m3].nsubdirs, cache_dirs[m3].size) ;mkinode (m3, (m3 ∈ cache_files ⊃ mkfile(m6, md1, # links(m3, cache_dirs), content1 upto min(m6, m2));cache_files[m3]).meta, false, (m3 ∈ cache_files ⊃ mkfile(m6, md1, # links(m3, cache_dirs), content1 upto min(m6, m2));cache_files[m3]).nlink, 0, (m3 ∈ cache_files ⊃ mkfile(m6, md1, # links(m3, cache_dirs), content1 upto min(m6, m2));cache_files[m3]).size) ); buf-opt := some(buf0); asynced1 := false; if asynced1 then pcache_set#(inode1.ino, m2 / VFS_PAGE_SIZE, buf-opt.buf, false; err, cache_pcache); if ¬ asynced1 ∨ err ≠ ESUCCESS then buf-opt := none⟫ ⟨buf-opt0 := none; inode0 := mkinode(m3, md1, false, # links(m3, cache_dirs), 0, m2); cache_dirs0 := cache_dirs; cache_dirs1 := cache_dirs; cache_dirs2 := cache_dirs; cache_dirs3 := cache_dirs; afs_truncate#(m6, m2 / VFS_PAGE_SIZE; buf-opt0, inode0, asynced5, err0, cache_dirs, afs_files, cache_asynced)⟩ ( cache_dirs = cache_dirs3 ∧ afs_files = (cache_files[m3, mkfile(m6, md1, # links(m3, cache_dirs2), content1 upto min(m6, m2))] ⊕ cache_pcache) ⊕ icache ∧ (cache_asynced ↔ asynced) ∧ buf-opt = buf-opt0 ∧ inode1 = inode0 ∧ (asynced1 ↔ asynced5) ∧ err = err0), m2 ≤ m6 ∧ m2 % VFS_PAGE_SIZE ≠ 0

Rule argument

pos: right 1

Additional information

Used simplifier rules: icache_set#(INODE, DIRTY; ERR, ICACHE) {ICACHE[INODE.ino] := mkientry(DIRTY, INODE)};