Make regular expression sort not closed enumerable (#7092)

This ensures we don't try to apply e.g. enumerative instantiation to quantified formulas over regular expressions, since no type enumerator exists for RE.

Fixes #6750.

diff --git a/src/expr/type_node.cpp b/src/expr/type_node.cpp
index fa6a56c991953a747754b1db3dd22205cb6b88bc..a7747c6744643f39e5c8d41c4bf102a2cb9b2d34 100644 (file)
--- a/src/expr/type_node.cpp
+++ b/src/expr/type_node.cpp
@@ -208,7 +208,7 @@ bool TypeNode::isClosedEnumerable()
   if (!getAttribute(IsClosedEnumerableComputedAttr()))
   {
     bool ret = true;
-    if (isArray() || isSort() || isCodatatype() || isFunction())
+    if (isArray() || isSort() || isCodatatype() || isFunction() || isRegExp())
     {
       ret = false;
     }