Update to standard implementation of getting free variables (#3175)

diff --git a/src/theory/quantifiers/quantifiers_rewriter.cpp b/src/theory/quantifiers/quantifiers_rewriter.cpp
index 63f19355740e6cdb6c3860d7f106ea23bb52386a..fb21d689525b4e6c6c4bad431eb4de6d46998401 100644 (file)
--- a/src/theory/quantifiers/quantifiers_rewriter.cpp
+++ b/src/theory/quantifiers/quantifiers_rewriter.cpp
@@ -1245,9 +1245,9 @@ bool QuantifiersRewriter::getVarElimIneq(Node body,
         {
           // compute variables in itm->first, these are not eligible for
           // elimination
-          std::vector<Node> bvs;
-          TermUtil::getBoundVars(m.first, bvs);
-          for (TNode v : bvs)
+          std::unordered_set<Node, NodeHashFunction> fvs;
+          expr::getFreeVariables(m.first, fvs);
+          for (const Node& v : fvs)
           {
             Trace("var-elim-ineq-debug")
                 << "...ineligible " << v

diff --git a/src/theory/quantifiers/single_inv_partition.cpp b/src/theory/quantifiers/single_inv_partition.cpp
index 153ab71cc191762fb2b8d2db6a64b08b94389dbc..2bb05ad1b79b10d9435c41db8d3e5ff0c07a5bb4 100644 (file)
--- a/src/theory/quantifiers/single_inv_partition.cpp
+++ b/src/theory/quantifiers/single_inv_partition.cpp
@@ -14,6 +14,7 @@
  **/
 #include "theory/quantifiers/single_inv_partition.h"
 
+#include "expr/node_algorithm.h"
 #include "theory/quantifiers/term_util.h"
 
 using namespace CVC4;
@@ -280,17 +281,17 @@ bool SingleInvocationPartition::init(std::vector<Node>& funcs,
         Trace("si-prt-debug") << "...normalized invocations to " << cr
                               << std::endl;
         // now must check if it has other bound variables
-        std::vector<Node> bvs;
-        TermUtil::getBoundVars(cr, bvs);
+        std::unordered_set<Node, NodeHashFunction> fvs;
+        expr::getFreeVariables(cr, fvs);
         // bound variables must be contained in the single invocation variables
-        for (const Node& bv : bvs)
+        for (const Node& bv : fvs)
         {
           if (std::find(d_si_vars.begin(), d_si_vars.end(), bv)
               == d_si_vars.end())
           {
-            // getBoundVars also collects functions in the rare case that we are
-            // synthesizing a function with 0 arguments, take this into account
-            // here.
+            // getFreeVariables also collects functions in the rare case that
+            // we are synthesizing a function with 0 arguments, take this into
+            // account here.
             if (std::find(d_input_funcs.begin(), d_input_funcs.end(), bv)
                 == d_input_funcs.end())
             {
@@ -311,15 +312,15 @@ bool SingleInvocationPartition::init(std::vector<Node>& funcs,
         Trace("si-prt") << "...not single invocation." << std::endl;
         singleInvocation = false;
         // rename bound variables with maximal overlap with si_vars
-        std::vector<Node> bvs;
-        TermUtil::getBoundVars(cr, bvs);
+        std::unordered_set<Node, NodeHashFunction> fvs;
+        expr::getFreeVariables(cr, fvs);
         std::vector<Node> terms;
         std::vector<Node> subs;
-        for (unsigned j = 0; j < bvs.size(); j++)
+        for (const Node& v : fvs)
         {
-          TypeNode tn = bvs[j].getType();
-          Trace("si-prt-debug") << "Fit bound var #" << j << " : " << bvs[j]
-                                << " with si." << std::endl;
+          TypeNode tn = v.getType();
+          Trace("si-prt-debug")
+              << "Fit bound var: " << v << " with si." << std::endl;
           for (unsigned k = 0; k < d_si_vars.size(); k++)
           {
             if (tn == d_arg_types[k])
@@ -327,7 +328,7 @@ bool SingleInvocationPartition::init(std::vector<Node>& funcs,
               if (std::find(subs.begin(), subs.end(), d_si_vars[k])
                   == subs.end())
               {
-                terms.push_back(bvs[j]);
+                terms.push_back(v);
                 subs.push_back(d_si_vars[k]);
                 Trace("si-prt-debug") << "  ...use " << d_si_vars[k]
                                       << std::endl;
@@ -344,7 +345,9 @@ bool SingleInvocationPartition::init(std::vector<Node>& funcs,
       Trace("si-prt") << ".....got si=" << singleInvocation
                       << ", result : " << cr << std::endl;
       d_conjuncts[2].push_back(cr);
-      TermUtil::getBoundVars(cr, d_all_vars);
+      std::unordered_set<Node, NodeHashFunction> fvs;
+      expr::getFreeVariables(cr, fvs);
+      d_all_vars.insert(d_all_vars.end(), fvs.begin(), fvs.end());
       if (singleInvocation)
       {
         // replace with single invocation formulation
@@ -420,7 +423,6 @@ bool SingleInvocationPartition::processConjunct(Node n,
   else
   {
     bool ret = true;
-    // if( TermUtil::hasBoundVarAttr( n ) ){
     for (unsigned i = 0; i < n.getNumChildren(); i++)
     {
       if (!processConjunct(n[i], visited, args, terms, subs))

diff --git a/src/theory/quantifiers/term_util.cpp b/src/theory/quantifiers/term_util.cpp
index 065096607b1e39e16fb9edfe008ab8245fca0824..1243d8d4ad0f6e0b80d9b49ee4ed53ebff4f8f3c 100644 (file)
--- a/src/theory/quantifiers/term_util.cpp
+++ b/src/theory/quantifiers/term_util.cpp
@@ -68,20 +68,6 @@ void TermUtil::registerQuantifier( Node q ){
   }
 }
 
-void TermUtil::getBoundVars2( Node n, std::vector< Node >& vars, std::map< Node, bool >& visited ) {
-  if( visited.find( n )==visited.end() ){
-    visited[n] = true;
-    if( n.getKind()==BOUND_VARIABLE ){
-      if( std::find( vars.begin(), vars.end(), n )==vars.end() ) {
-        vars.push_back( n );
-      }
-    }
-    for( unsigned i=0; i<n.getNumChildren(); i++ ){
-      getBoundVars2( n[i], vars, visited );
-    }
-  }
-}
-
 Node TermUtil::getRemoveQuantifiers2( Node n, std::map< Node, Node >& visited ) {
   std::map< Node, Node >::iterator it = visited.find( n );
   if( it!=visited.end() ){
@@ -161,11 +147,6 @@ bool TermUtil::hasBoundVarAttr( Node n ) {
   return !getBoundVarAttr(n).isNull();
 }
 
-void TermUtil::getBoundVars( Node n, std::vector< Node >& vars ) {
-  std::map< Node, bool > visited;
-  return getBoundVars2( n, vars, visited );
-}
-
 //remove quantifiers
 Node TermUtil::getRemoveQuantifiers( Node n ) {
   std::map< Node, Node > visited;
@@ -174,15 +155,18 @@ Node TermUtil::getRemoveQuantifiers( Node n ) {
 
 //quantified simplify
 Node TermUtil::getQuantSimplify( Node n ) {
-  std::vector< Node > bvs;
-  getBoundVars( n, bvs );
-  if( bvs.empty() ) {
+  std::unordered_set<Node, NodeHashFunction> fvs;
+  expr::getFreeVariables(n, fvs);
+  if (fvs.empty())
+  {
     return Rewriter::rewrite( n );
-  }else{
-    Node q = NodeManager::currentNM()->mkNode( FORALL, NodeManager::currentNM()->mkNode( BOUND_VAR_LIST, bvs ), n );
-    q = Rewriter::rewrite( q );
-    return getRemoveQuantifiers( q );
   }
+  std::vector<Node> bvs;
+  bvs.insert(bvs.end(), fvs.begin(), fvs.end());
+  NodeManager* nm = NodeManager::currentNM();
+  Node q = nm->mkNode(FORALL, nm->mkNode(BOUND_VAR_LIST, bvs), n);
+  q = Rewriter::rewrite(q);
+  return getRemoveQuantifiers(q);
 }
 
 /** get the i^th instantiation constant of q */

diff --git a/src/theory/quantifiers/term_util.h b/src/theory/quantifiers/term_util.h
index 1f2eea1c5885b77d4e8224dd42f6e539836a9c63..302901625d4ba8f5955bd34646cdc0fd3ad94f67 100644 (file)
--- a/src/theory/quantifiers/term_util.h
+++ b/src/theory/quantifiers/term_util.h
@@ -163,13 +163,9 @@ public:
   static bool hasBoundVarAttr( Node n );
   
 private:
-  /** get bound vars */
-  static void getBoundVars2( Node n, std::vector< Node >& vars, std::map< Node, bool >& visited );
   /** get bound vars */
   static Node getRemoveQuantifiers2( Node n, std::map< Node, Node >& visited );
 public:
-  //get the bound variables in this node
-  static void getBoundVars( Node n, std::vector< Node >& vars );
   //remove quantifiers
   static Node getRemoveQuantifiers( Node n );
   //quantified simplify (treat free variables in n as quantified and run rewriter)

diff --git a/test/regress/CMakeLists.txt b/test/regress/CMakeLists.txt
index a04fd49638b58831a638b97d46dc894717ce6dbe..4bceb1b74b960d1966916c72f351cef60f501bfb 100644 (file)
--- a/test/regress/CMakeLists.txt
+++ b/test/regress/CMakeLists.txt
@@ -1640,7 +1640,6 @@ set(regress_1_tests
   regress1/sygus/abv.sy
   regress1/sygus/array_search_5-Q-easy.sy
   regress1/sygus/bvudiv-by-2.sy
-  regress1/sygus/car_3.lus.sy
   regress1/sygus/cegar1.sy
   regress1/sygus/cegis-unif-inv-eq-fair.sy
   regress1/sygus/cegisunif-depth1.sy
@@ -2173,6 +2172,8 @@ set(regression_disabled_tests
   regress1/rewriterules/why3_vstte10_max_sum_harness2.smt2
   regress1/sets/setofsets-disequal.smt2
   regress1/simple-rdl-definefun.smt2
+  # does not solve after minor modification to search
+  regress1/sygus/car_3.lus.sy
   regress1/sygus/Base16_1.sy
   regress1/sygus/enum-test.sy
   regress1/sygus/inv_gen_fig8.sy