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

# buf0 = VFS_PAGE_SIZE, VFS_PAGE_SIZE = n0 + m2 % 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, m2 % VFS_PAGE_SIZE ≠ 0, 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, m2 ≤ m, cache_sync → synced(cache_files, cache_icache, cache_pcache) ⊦ ⟪pcache_truncate#(m3, m2, m; 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, md, false, # links(m3, cache_dirs), 0, m) ); buf-opt1 := some(fill(some(buf0).buf, zero, m2 % VFS_PAGE_SIZE, n0)); asynced1 := true; if asynced1 then pcache_set#(inode1.ino, m2 / VFS_PAGE_SIZE, buf-opt1.buf, false; err, cache_pcache); if ¬ asynced1 ∨ err ≠ ESUCCESS then buf-opt1 := none⟫ ⟨buf-opt0 := none; inode0 := mkinode(m3, md, false, # links(m3, cache_dirs), 0, m2); cache_dirs0 := cache_dirs; cache_dirs1 := cache_dirs; cache_dirs2 := cache_dirs; cache_dirs3 := cache_dirs; cache_dirs0 := cache_dirs; afs_truncate#(m, 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(m, md, # links(m3, cache_dirs2), content1[m2 / VFS_PAGE_SIZE, fill(buf0, zero, m2 % VFS_PAGE_SIZE, n0)] upto m2) ] ⊕ cache_pcache) ⊕ cache_icache[m3, mkientry(false, mkinode(m3, md, false, # links(m3, cache_dirs0), 0, m))] ∧ ¬ cache_asynced ∧ buf-opt1 = buf-opt0 ∧ inode1 = inode0 ∧ (asynced1 ↔ asynced5) ∧ err = err0)

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 92:
# buf0 = VFS_PAGE_SIZE, VFS_PAGE_SIZE = n0 + m2 % VFS_PAGE_SIZE, 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, ino = m3, n = m, pcache = cache_pcache, size = m2, 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, m2 ≤ m, cache_sync → synced(cache_files, cache_icache, cache_pcache) ⊦ ⟪if ∀ key. key ∈ pcache → key.data? then pcache := truncate(ino, min(n, size), pcache) else abort; 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, md, false, # links(m3, cache_dirs), 0, m) ); buf-opt1 := some(fill(some(buf0).buf, zero, m2 % VFS_PAGE_SIZE, n0)); asynced1 := true; cache_pcache := pcache; if asynced1 then pcache_set#(inode1.ino, m2 / VFS_PAGE_SIZE, buf-opt1.buf, false; err, cache_pcache); if ¬ asynced1 ∨ err ≠ ESUCCESS then buf-opt1 := none⟫ ⟨buf-opt0 := none; inode0 := mkinode(m3, md, false, # links(m3, cache_dirs), 0, m2); cache_dirs0 := cache_dirs; cache_dirs1 := cache_dirs; cache_dirs2 := cache_dirs; cache_dirs3 := cache_dirs; cache_dirs0 := cache_dirs; afs_truncate#(m, 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(m, md, # links(m3, cache_dirs2), content1[m2 / VFS_PAGE_SIZE, fill(buf0, zero, m2 % VFS_PAGE_SIZE, n0)] upto m2) ] ⊕ cache_pcache) ⊕ cache_icache[m3, mkientry(false, mkinode(m3, md, false, # links(m3, cache_dirs0), 0, m))] ∧ ¬ cache_asynced ∧ buf-opt1 = buf-opt0 ∧ inode1 = inode0 ∧ (asynced1 ↔ asynced5) ∧ err = err0), m2 % VFS_PAGE_SIZE = 0

Rule argument

pos: right 1

Additional information

Used simplifier rules: pcache_truncate#(INO, SIZE, N; ERR, PCACHE) {if ∀ key. key ∈ PCACHE → key.data? then PCACHE := truncate(INO, min(N, SIZE), PCACHE) else abort };