[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 428 from proof refine-link (previous step)

dirs[ino2] = mkdir(# entries1, md, # links(ino2, dirs), m3, entries1), files[entries[str]] = mkfile(m0, md2, # links(entries[str], dirs), content0), dirs[ino1] = mkdir(# entries0, md0, # links(ino1, dirs), m2, entries0), entries0[str] = entries[str], dirs[ino] = mkdir(# entries, md1, # links(ino, dirs), m4, entries), root.dir?, root[q].dir?, root[q0].dir?, dom of < ino0, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), ispath(q0, ROOT_INO, ino2, dirs, files), ispath(q, ROOT_INO, ino1, dirs, files), of-cons(of, dirs, files), pw(user, md), px(user, md0), px(user, md), px-parent(user, q0, ROOT_INO, dirs, files), px-parent(user, q, ROOT_INO, dirs, files), str ∈ entries0, entries[str] ∈ files, ino1 ∈ dirs, ino2 ∈ dirs, ino ∈ dirs, str ∈ entries, ⌊err1⌋ , ¬ root[q + str '].dir?, ¬ entries[str] ∈ dirs, ¬ str0 ∈ entries1, psynced → asynced0, links(ino1, dirs) ≠ ∅ ∨ ino1 = ROOT_INO, links(ino2, dirs) ≠ ∅ ∨ ino2 = ROOT_INO, links(ino, dirs) ≠ ∅ ∨ ino = ROOT_INO ⊦ ∃ err. pre-link(q + str ', q0 + str0 ', err, user, root, abs-files(files), abs-of(of)) ∧ ⟨err0 := err; if err0 = ESUCCESS then let fid = root[q + str '].fid in root[q0 + str0 '] := fnode(fid); psynced := ?⟩ (abs(root, ROOT_INO)(dirs) ∧ (psynced → asynced) ∧ err1 = err0)

Heuristic use patterns applied rule exists right

And obtained the following new goals

Proof step 429:
dirs[ino] = mkdir(# entries, md1, # links(ino, dirs), m4, entries), entries0[str] = entries[str], dirs[ino1] = mkdir(# entries0, md0, # links(ino1, dirs), m2, entries0), files[entries[str]] = mkfile(m0, md2, # links(entries[str], dirs), content0), dirs[ino2] = mkdir(# entries1, md, # links(ino2, dirs), m3, entries1), root[q0].dir?, root[q].dir?, root.dir?, dom of < ino0, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), ispath(q, ROOT_INO, ino1, dirs, files), ispath(q0, ROOT_INO, ino2, dirs, files), of-cons(of, dirs, files), pw(user, md), px(user, md), px(user, md0), px-parent(user, q, ROOT_INO, dirs, files), px-parent(user, q0, ROOT_INO, dirs, files), str ∈ entries, ino ∈ dirs, ino2 ∈ dirs, ino1 ∈ dirs, entries[str] ∈ files, str ∈ entries0, ⌊err1⌋ , psynced → asynced0, links(ino, dirs) ≠ ∅ ∨ ino = ROOT_INO, links(ino2, dirs) ≠ ∅ ∨ ino2 = ROOT_INO, links(ino1, dirs) ≠ ∅ ∨ ino1 = ROOT_INO ⊦ pre-link(q + str ', q0 + str0 ', err1, user, root, abs-files(files), abs-of(of)) ∧ ⟨err0 := err1; if err0 = ESUCCESS then let fid = root[q + str '].fid in root[q0 + str0 '] := fnode(fid); psynced := ?⟩ (abs(root, ROOT_INO)(dirs) ∧ (psynced → asynced) ∧ err1 = err0), root[q + str '].dir?, entries[str] ∈ dirs, str0 ∈ entries1

Rule argument

pos: right 1 terms: err1 abort: T discard: T computed: F

Additional information

Used terms: err1