[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 79 from proof fsync-dirs (previous step)

asynced0 ↔ false, dirs0[m3] = mkdir(m4, md1, m5, m6, entries), files0[m] = mkfile(m0, md0, m1, content), icache[m] = mkientry(true, mkinode(m3, md, true, m5, m6, m4)), dirs = dirs0[m3, mkdir(m4, md, m5, m6, entries)], inode = mkinode(m3, md, true, m5, m6, m4), m ∈ icache, m ∈ files0, m3 ∈ dirs0, m2 ≤ n * VFS_PAGE_SIZE ⊦ [if valid-file-inode(inode, dirs, files) then {fail_or_success#(; ; err); choose bv with true in asynced := bv} else abort] (dirs0[m3, mkdir(m4, md, m5, m6, entries)] = dirs0)

Heuristic symbolic execution applied rule if negative right

And obtained the following new goals

Proof step 80:
asynced0 ↔ false, icache[m] = mkientry(true, mkinode(m3, md, true, m5, m6, m4)), files0[m] = mkfile(m0, md0, m1, content), dirs0[m3] = mkdir(m4, md1, m5, m6, entries), dirs = dirs0[m3, mkdir(m4, md, m5, m6, entries)], inode = mkinode(m3, md, true, m5, m6, m4), m3 ∈ dirs0, m ∈ files0, m ∈ icache, m2 ≤ n * VFS_PAGE_SIZE ⊦ [abort] (dirs0[m3, mkdir(m4, md, m5, m6, entries)] = dirs0)

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ valid-file-inode(inode, dirs, files) ↔ valid-file-ino(inode.ino, dirs, files) ∧ inode.nlink = files[inode.ino].nlink ∧ inode.nsubdirs = 0 ∧ ¬ inode.directory; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)% ⊦ valid-file-ino(ino, dirs, files) ↔ ino ∈ files; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).nlink = m0; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).nsubdirs = m1; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).directory ↔ boolvar; (s)