[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 39 from proof recovery (previous step)

log0 = abs-log(nx1, gstore2 ↓), remove-refsize0(gstore3) = gstore3, elems nx1 ∩ jro4 = ∅, dom gstore3 ∪ elems nx1 = dom gstore2 ∪ jro4, jro5.keys.inodes?, jro1.keys.inodes?, jro5 < jmaxino3, jro1 < jmaxino0, ri0.inos < jmaxino3, fi3.inos < jmaxino0, inv(gstore2 \ jro4), inv(gstore3), inv(crash(gstore2, gstore3, jro4, nx1) \ jro4), log-cons(abs-log(nx1, gstore2 ↓), nodes(gstore2 ↓, jro4)), refsize-cons(gstore2, range ri0), refsize-cons(gstore3, range fi3), ri-inj(ri0), ri-inj(fi3), jmaxino0 ≤ jmaxino3, ri0.lebs ⊆ dom gstore2, fi3.lebs ⊆ dom gstore3, jvalid8 ∧ nx1 ≠ [] → valid-journal-head(nx1, gstore2, jro4) ⊦ ⟨fs0 := nodes(gstore2 ↓, jro4); fo0 := jro1.keys; fi1 := fi3; fi0 := fi3; ro := ∅; aubifs_core_recover#(jvalid2; ax, ks0, fi3, ro, fo0, log0, fs0; ri, jvalid, err1)⟩ ( jro1.keys = ro ∧ jro1.keys = fo0 ∧ fi1 = ri ∧ fi0 = fi3 ∧ log0 = abs-log(nx1, gstore2 ↓) ∧ fs0 = nodes(gstore2 ↓, jro4) ∧ abs-log(nx1, gstore2 ↓) = ax ∧ jro1.keys = ks0 ∧ ESUCCESS = err1), jmaxino0 = 0, jmaxino3 = 0, dups(nx1)

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information