[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 126 from proof fsync-inode-keep-abs (previous step)

asynced ↔ icache[ino0].dirty, asynced0 ↔ true, files0 = (files ⊕ pcache) ⊕ icache, ino = m, ino0 = m, inode = mkinode(m, md, boolvar, m0, m1, m2), icache-cons(icache, dirs, files), ino0 ∈ icache ⊦ [if err = ESUCCESS ∧ asynced0 ∧ asynced then afs_write_inode#(inode; err, dirs, files; asynced1); if err = ESUCCESS then {asynced := false; icache_set_status#(ino, asynced; err, icache)}] (files0 = (files ⊕ pcache) ⊕ icache), err = ESUCCESS ∧ asynced0 ∧ asynced

Heuristic conditional right split applied rule if right

And obtained the following new goals

Proof step 127:
asynced0 ↔ true, asynced ↔ icache[ino0].dirty, asynced, asynced0, err = ESUCCESS, files0 = (files ⊕ pcache) ⊕ icache, ino = m, ino0 = m, inode = mkinode(m, md, boolvar, m0, m1, m2), icache-cons(icache, dirs, files), ino0 ∈ icache ⊦ [afs_write_inode#(inode; err, dirs, files; asynced1); if err = ESUCCESS then {asynced := false; icache_set_status#(ino, asynced; err, icache)}] (files0 = (files ⊕ pcache) ⊕ icache), err = ESUCCESS ∧ asynced0 ∧ asynced
Proof step 128:
asynced0 ↔ true, asynced ↔ icache[ino0].dirty, files0 = (files ⊕ pcache) ⊕ icache, ino = m, ino0 = m, inode = mkinode(m, md, boolvar, m0, m1, m2), icache-cons(icache, dirs, files), ino0 ∈ icache ⊦ [skip; if err = ESUCCESS then {asynced := false; icache_set_status#(ino, asynced; err, icache)}] (files0 = (files ⊕ pcache) ⊕ icache), err = ESUCCESS ∧ asynced0 ∧ asynced

Rule argument

pos: right 1

Proof step 126 from proof fsync-inode-keep-abs (previous step)

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

Additional information