Proof with (try discriminate).
intros. unfold is_intconst in *.
destruct a... destruct o... inv H. inv H0. destruct vl; inv H5. auto.
Qed.

Lemma eval_divlu_mull:
forall le x y p M,
divlu_mul_params (Int64.unsigned y) = Some(p, M) ->
nth_error le O = Some (Vlong x) ->
eval_expr ge sp e m le (divlu_mull p M) (Vlong (Int64.divu x y)).