[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 55 from proof inv-mkdir (previous step)

dirs0[m0] = mkdir(m3, md1, # links(m0, dirs0), m5, entries0), (dirs0[m0, mkdir(m3 + 1, md1, # links(m0, dirs0), m5 + 1, entries0[str, ino0])] ++ ino0)[m0] = mkdir(m, md0, m1, m2, entries), err = ESUCCESS, ino0 ≠ 0, afs-cons(dirs0, files), afs-cons ((dirs0[m0, mkdir(m3 + 1, md1, # links(m0, dirs0), m5 + 1, entries0[str, ino0])] ++ ino0)[ino0, mkdir(0, md, 1, 0, ∅)] [m0, mkdir(m, md2, m1, m2, entries) ], files), dcache-cons(dcache, dirs0, files), icache-cons(icache, dirs0, files), pcache-cons(pcache, dirs0, files), synced(dirs0, icache, pcache), m0 ∈ dirs0, ¬ str ∈ entries0, ¬ ino0 ∈ files, ¬ ino0 ∈ dirs0, asynced1 → synced(files, icache, pcache), links(m0, dirs0) ≠ ∅ ∨ m0 = ROOT_INO ⊦ ⟪icache_set#(mkinode(m0, md2, true, m1, m2, m), false; err, icache); icache_set# (getinode (mkdentry(str, ino0).ino, (dirs0[m0, mkdir(m3 + 1, md1, # links(m0, dirs0), m5 + 1, entries0[str, ino0])] ++ ino0)[ino0, mkdir(0, md, 1, 0, ∅)] [m0, (m0 = ino0 ∧ ino0 ∈ dirs0[ino0, mkdir(m3 + 1, md1, # links(ino0, dirs0), m5 + 1, entries0[str, ino0])] ++ ino0 ⊃ mkdir(0, md, 1, 0, ∅) ;(dirs0[m0, mkdir(m3 + 1, md1, # links(m0, dirs0), m5 + 1, entries0[str, ino0])] ++ ino0)[m0] ) .meta:= md2 ], files), false ; err, icache); dcache_set#(m0, str, mkdentry(str, ino0); err, dcache)⟫ ( icache-cons (icache, (dirs0[m0, mkdir(m3 + 1, md1, # links(m0, dirs0), m5 + 1, entries0[str, ino0])] ++ ino0)[ino0, mkdir(0, md, 1, 0, ∅)] [m0, (dirs0[m0, mkdir(m3 + 1, md1, # links(m0, dirs0), m5 + 1, entries0[str, ino0])] ++ ino0)[m0].meta:= md2 ], files) ∧ dcache-cons (dcache, (dirs0[m0, mkdir(m3 + 1, md1, # links(m0, dirs0), m5 + 1, entries0[str, ino0])] ++ ino0)[ino0, mkdir(0, md, 1, 0, ∅)] [m0, (dirs0[m0, mkdir(m3 + 1, md1, # links(m0, dirs0), m5 + 1, entries0[str, ino0])] ++ ino0)[m0].meta:= md2 ], files) ∧ pcache-cons (pcache, (dirs0[m0, mkdir(m3 + 1, md1, # links(m0, dirs0), m5 + 1, entries0[str, ino0])] ++ ino0)[ino0, mkdir(0, md, 1, 0, ∅)] [m0, (dirs0[m0, mkdir(m3 + 1, md1, # links(m0, dirs0), m5 + 1, entries0[str, ino0])] ++ ino0)[m0].meta:= md2 ], files) ∧ synced ((dirs0[m0, mkdir(m3 + 1, md1, # links(m0, dirs0), m5 + 1, entries0[str, ino0])] ++ ino0)[ino0, mkdir(0, md, 1, 0, ∅)] [m0, (dirs0[m0, mkdir(m3 + 1, md1, # links(m0, dirs0), m5 + 1, entries0[str, ino0])] ++ ino0)[m0].meta:= md2 ], icache, pcache) ∧ (asynced1 → synced(files, icache, pcache)))

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 56:
asynced ↔ false, (dirs0[m0, mkdir(m3 + 1, md1, # links(m0, dirs0), m5 + 1, entries0[str, ino0])] ++ ino0)[m0] = mkdir(m, md0, m1, m2, entries), dirs0[m0] = mkdir(m3, md1, # links(m0, dirs0), m5, entries0), err = ESUCCESS, inode = mkinode(m0, md2, true, m1, m2, m), afs-cons ((dirs0[m0, mkdir(m3 + 1, md1, # links(m0, dirs0), m5 + 1, entries0[str, ino0])] ++ ino0)[ino0, mkdir(0, md, 1, 0, ∅)] [m0, mkdir(m, md2, m1, m2, entries) ], files), afs-cons(dirs0, files), dcache-cons(dcache, dirs0, files), icache-cons(icache, dirs0, files), pcache-cons(pcache, dirs0, files), synced(dirs0, icache, pcache), m0 ∈ dirs0, asynced1 → synced(files, icache, pcache), links(m0, dirs0) ≠ ∅ ∨ m0 = ROOT_INO ⊦ ⟪icache[inode.ino] := mkientry(asynced, inode); icache_set# (getinode (mkdentry(str, ino0).ino, (dirs0[m0, mkdir(m3 + 1, md1, # links(m0, dirs0), m5 + 1, entries0[str, ino0])] ++ ino0)[ino0, mkdir(0, md, 1, 0, ∅)] [m0, (m0 = ino0 ∧ ino0 ∈ dirs0[ino0, mkdir(m3 + 1, md1, # links(ino0, dirs0), m5 + 1, entries0[str, ino0])] ++ ino0 ⊃ mkdir(0, md, 1, 0, ∅) ;(dirs0[m0, mkdir(m3 + 1, md1, # links(m0, dirs0), m5 + 1, entries0[str, ino0])] ++ ino0)[m0] ) .meta:= md2 ], files), false ; err, icache); dcache_set#(m0, str, mkdentry(str, ino0); err, dcache)⟫ ( icache-cons (icache, (dirs0[m0, mkdir(m3 + 1, md1, # links(m0, dirs0), m5 + 1, entries0[str, ino0])] ++ ino0)[ino0, mkdir(0, md, 1, 0, ∅)] [m0, (dirs0[m0, mkdir(m3 + 1, md1, # links(m0, dirs0), m5 + 1, entries0[str, ino0])] ++ ino0)[m0].meta:= md2 ], files) ∧ dcache-cons (dcache, (dirs0[m0, mkdir(m3 + 1, md1, # links(m0, dirs0), m5 + 1, entries0[str, ino0])] ++ ino0)[ino0, mkdir(0, md, 1, 0, ∅)] [m0, (dirs0[m0, mkdir(m3 + 1, md1, # links(m0, dirs0), m5 + 1, entries0[str, ino0])] ++ ino0)[m0].meta:= md2 ], files) ∧ pcache-cons (pcache, (dirs0[m0, mkdir(m3 + 1, md1, # links(m0, dirs0), m5 + 1, entries0[str, ino0])] ++ ino0)[ino0, mkdir(0, md, 1, 0, ∅)] [m0, (dirs0[m0, mkdir(m3 + 1, md1, # links(m0, dirs0), m5 + 1, entries0[str, ino0])] ++ ino0)[m0].meta:= md2 ], files) ∧ synced ((dirs0[m0, mkdir(m3 + 1, md1, # links(m0, dirs0), m5 + 1, entries0[str, ino0])] ++ ino0)[ino0, mkdir(0, md, 1, 0, ∅)] [m0, (dirs0[m0, mkdir(m3 + 1, md1, # links(m0, dirs0), m5 + 1, entries0[str, ino0])] ++ ino0)[m0].meta:= md2 ], icache, pcache) ∧ (asynced1 → synced(files, icache, pcache))), ino0 = 0, str ∈ entries0, ino0 ∈ files, ino0 ∈ dirs0

Rule argument

pos: right 1

Additional information

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