Checks that all indices in the seltrace are resolved expressions.
(vl-seltrace-unres-count x) → count
Function:
(defun vl-seltrace-unres-count (x) (declare (xargs :guard (vl-seltrace-p x))) (let ((__function__ 'vl-seltrace-unres-count)) (declare (ignorable __function__)) (if (atom x) 0 (+ (if (vl-selstep-resolved-p (car x)) 0 1) (vl-seltrace-unres-count (cdr x))))))
Theorem:
(defthm natp-of-vl-seltrace-unres-count (b* ((count (vl-seltrace-unres-count x))) (natp count)) :rule-classes :type-prescription)
Theorem:
(defthm vl-seltrace-unres-count-of-vl-seltrace-fix-x (equal (vl-seltrace-unres-count (vl-seltrace-fix x)) (vl-seltrace-unres-count x)))
Theorem:
(defthm vl-seltrace-unres-count-vl-seltrace-equiv-congruence-on-x (implies (vl-seltrace-equiv x x-equiv) (equal (vl-seltrace-unres-count x) (vl-seltrace-unres-count x-equiv))) :rule-classes :congruence)