[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 40 from proof validref-refs-last-valid-subset (previous step)

st0[r0 -- _length] = intval(i0), acc + r1 ' = r2 ' + refs, st0[r0 -- i '] = refval(r2), st[r0 -- _type] = typeval(mkarraytype(ty0)), st0[r0 -- _type] = typeval(mkarraytype(ty0)), type∃(str, ty0), i < i0, validrefs(str, r2 ' + refs, ty0, st0), 0 ≤ i, r0 ∈ st0, mkarraytype(ty0) ≤ ty, validref(str, r0, mkarraytype(ty0), st), st ⊆ st0, r0 -- _type ∈ st0, okreftype(refval(r0), mkarraytype(ty0), st0), r0 -- _length ∈ st0, is_arrayref(r0, i0, st0), 0 < i0, 0 ≤ i0, validref(str, noval .refval, ty0, st), ∀ str, r, st, st0, r1, ty. validref(str, r, st[r -- _type] .type, st) ∧ st ⊆ st0 ∧ r ∈ acc ∧ validrefs(str, acc + r1 ', ty, st0) → validref(str, r1, st[r1 -- _type] .type, st), ∀ j. ¬ j < 0 ∧ ¬ i0 ≤ j → okval(st0[r0 -- j '], ty0) ⊦ is_obj(r0, st), r0 = jvmref, ty0 .jtelemtype = void_type, ty0 .jtelemtype = abstract_type, r0 = jvmref, r0 -- i ' ∈ st, validref(str, r1, st[r1 -- _type] .type, st), noval .refval ∈ acc, r1 ≠ r2 ∧ ¬ r1 ∈ refs, ¬ r2 ∈ acc ∧ r2 ≠ r1

User applied rule weakening

And obtained the following new goals

Rule argument

[fmaposlist-arg: (pos: left 2, pos: left 3, pos: left 4, pos: left 5, pos: left 6, pos: left 8, pos: left 10, pos: left 11, pos: left 14, pos: left 15, pos: left 16, pos: left 17, pos: left 18, pos: left 20, pos: left 21, pos: left 22, pos: right 3, pos: right 4, pos: right 7) ]

Additional information

[[CONCRETESIMPRULES : ()]]