Head

GCC Code Coverage Report

Directory:	.		Exec	Total	Coverage
File:	src/prop/skolem_def_manager.cpp	Lines:	82	83	98.8 %
Date:	2021-09-17	Branches:	108	246	43.9 %


/******************************************************************************
 * Top contributors (to current version):
 *   Andrew Reynolds
 *
 * This file is part of the cvc5 project.
 *
 * Copyright (c) 2009-2021 by the authors listed in the file AUTHORS
 * in the top-level source directory and their institutional affiliations.
 * All rights reserved.  See the file COPYING in the top-level source
 * directory for licensing information.
 * ****************************************************************************
 *
 * Skolem definition manager.
 */

#include "prop/skolem_def_manager.h"

#include "expr/attribute.h"

namespace cvc5 {
namespace prop {

SkolemDefManager::SkolemDefManager(context::Context* context,
                                   context::UserContext* userContext)
    : d_skDefs(userContext), d_skActive(context)
{
}

SkolemDefManager::~SkolemDefManager() {}

void SkolemDefManager::notifySkolemDefinition(TNode skolem, Node def)
{
  // Notice that skolem may have kind SKOLEM or BOOLEAN_TERM_VARIABLE
  Trace("sk-defs") << "notifySkolemDefinition: " << def << " for " << skolem
                   << std::endl;
  // in very rare cases, a skolem may be generated twice for terms that are
  // equivalent up to purification
  if (d_skDefs.find(skolem) == d_skDefs.end())
  {
    d_skDefs.insert(skolem, def);
  }
}

TNode SkolemDefManager::getDefinitionForSkolem(TNode skolem) const
{
  NodeNodeMap::const_iterator it = d_skDefs.find(skolem);
  Assert(it != d_skDefs.end()) << "No skolem def for " << skolem;
  return it->second;
}

void SkolemDefManager::notifyAsserted(TNode literal,
                                      std::vector<TNode>& activatedSkolems,
                                      bool useDefs)
{
  std::unordered_set<Node> skolems;
  getSkolems(literal, skolems);
  for (const Node& k : skolems)
  {
    if (d_skActive.find(k) != d_skActive.end())
    {
      // already active
      continue;
    }
    d_skActive.insert(k);
    if (useDefs)
    {
      // add its definition to the activated list
      NodeNodeMap::const_iterator it = d_skDefs.find(k);
      Assert(it != d_skDefs.end());
      activatedSkolems.push_back(it->second);
    }
    else
    {
      // add to the activated list
      activatedSkolems.push_back(k);
    }
  }
}

struct HasSkolemTag
{
};
struct HasSkolemComputedTag
{
};
/** Attribute true for nodes with skolems in them */
typedef expr::Attribute<HasSkolemTag, bool> HasSkolemAttr;
/** Attribute true for nodes where we have computed the above attribute */
typedef expr::Attribute<HasSkolemComputedTag, bool> HasSkolemComputedAttr;

bool SkolemDefManager::hasSkolems(TNode n) const
{
  std::unordered_set<TNode> visited;
  std::unordered_set<TNode>::iterator it;
  std::vector<TNode> visit;
  TNode cur;
  visit.push_back(n);
  do
  {
    cur = visit.back();
    if (cur.getAttribute(HasSkolemComputedAttr()))
    {
      visit.pop_back();
      // already computed
      continue;
    }
    it = visited.find(cur);
    if (it == visited.end())
    {
      visited.insert(cur);
      if (cur.getNumChildren() == 0)
      {
        visit.pop_back();
        bool hasSkolem = false;
        if (cur.isVar())
        {
          hasSkolem = (d_skDefs.find(cur) != d_skDefs.end());
        }
        cur.setAttribute(HasSkolemAttr(), hasSkolem);
        cur.setAttribute(HasSkolemComputedAttr(), true);
      }
      else
      {
        visit.insert(visit.end(), cur.begin(), cur.end());
      }
    }
    else
    {
      visit.pop_back();
      bool hasSkolem = false;
      for (TNode i : cur)
      {
        Assert(i.getAttribute(HasSkolemComputedAttr()));
        if (i.getAttribute(HasSkolemAttr()))
        {
          hasSkolem = true;
          break;
        }
      }
      cur.setAttribute(HasSkolemAttr(), hasSkolem);
      cur.setAttribute(HasSkolemComputedAttr(), true);
    }
  } while (!visit.empty());
  Assert(n.getAttribute(HasSkolemComputedAttr()));
  return n.getAttribute(HasSkolemAttr());
}

void SkolemDefManager::getSkolems(TNode n,
                                  std::unordered_set<Node>& skolems) const
{
  std::unordered_set<TNode> visited;
  std::unordered_set<TNode>::iterator it;
  std::vector<TNode> visit;
  TNode cur;
  visit.push_back(n);
  do
  {
    cur = visit.back();
    visit.pop_back();
    if (!hasSkolems(cur))
    {
      // does not have skolems, continue
      continue;
    }
    it = visited.find(cur);
    if (it == visited.end())
    {
      visited.insert(cur);
      if (cur.isVar())
      {
        if (d_skDefs.find(cur) != d_skDefs.end())
        {
          skolems.insert(cur);
        }
      }
      else
      {
        visit.insert(visit.end(), cur.begin(), cur.end());
      }
    }
  } while (!visit.empty());
}

}  // namespace prop
}  // namespace cvc5


Generated by: GCOVR (Version 3.2)

Line	Exec	Source
1		/******************************************************************************
2		* Top contributors (to current version):
3		* Andrew Reynolds
4		*
5		* This file is part of the cvc5 project.
6		*
7		* Copyright (c) 2009-2021 by the authors listed in the file AUTHORS
8		* in the top-level source directory and their institutional affiliations.
9		* All rights reserved. See the file COPYING in the top-level source
10		* directory for licensing information.
11		* ****************************************************************************
12		*
13		* Skolem definition manager.
14		*/
15
16		#include "prop/skolem_def_manager.h"
17
18		#include "expr/attribute.h"
19
20		namespace cvc5 {
21		namespace prop {
22
23	10009	SkolemDefManager::SkolemDefManager(context::Context* context,
24	10009	context::UserContext* userContext)
25	10009	: d_skDefs(userContext), d_skActive(context)
26		{
27	10009	}
28
29	10006	SkolemDefManager::~SkolemDefManager() {}
30
31	28444	void SkolemDefManager::notifySkolemDefinition(TNode skolem, Node def)
32		{
33		// Notice that skolem may have kind SKOLEM or BOOLEAN_TERM_VARIABLE
34	56888	Trace("sk-defs") << "notifySkolemDefinition: " << def << " for " << skolem
35	28444	<< std::endl;
36		// in very rare cases, a skolem may be generated twice for terms that are
37		// equivalent up to purification
38	28444	if (d_skDefs.find(skolem) == d_skDefs.end())
39		{
40	28438	d_skDefs.insert(skolem, def);
41		}
42	28444	}
43
44	2431	TNode SkolemDefManager::getDefinitionForSkolem(TNode skolem) const
45		{
46	2431	NodeNodeMap::const_iterator it = d_skDefs.find(skolem);
47	2431	Assert(it != d_skDefs.end()) << "No skolem def for " << skolem;
48	2431	return it->second;
49		}
50
51	6793828	void SkolemDefManager::notifyAsserted(TNode literal,
52		std::vector<TNode>& activatedSkolems,
53		bool useDefs)
54		{
55	13587656	std::unordered_set<Node> skolems;
56	6793828	getSkolems(literal, skolems);
57	10430186	for (const Node& k : skolems)
58		{
59	3636358	if (d_skActive.find(k) != d_skActive.end())
60		{
61		// already active
62	3271152	continue;
63		}
64	365206	d_skActive.insert(k);
65	365206	if (useDefs)
66		{
67		// add its definition to the activated list
68	365206	NodeNodeMap::const_iterator it = d_skDefs.find(k);
69	365206	Assert(it != d_skDefs.end());
70	365206	activatedSkolems.push_back(it->second);
71		}
72		else
73		{
74		// add to the activated list
75		activatedSkolems.push_back(k);
76		}
77		}
78	6793828	}
79
80		struct HasSkolemTag
81		{
82		};
83		struct HasSkolemComputedTag
84		{
85		};
86		/** Attribute true for nodes with skolems in them */
87		typedef expr::Attribute<HasSkolemTag, bool> HasSkolemAttr;
88		/** Attribute true for nodes where we have computed the above attribute */
89		typedef expr::Attribute<HasSkolemComputedTag, bool> HasSkolemComputedAttr;
90
91	19916653	bool SkolemDefManager::hasSkolems(TNode n) const
92		{
93	39833306	std::unordered_set<TNode> visited;
94	19916653	std::unordered_set<TNode>::iterator it;
95	39833306	std::vector<TNode> visit;
96	39833306	TNode cur;
97	19916653	visit.push_back(n);
98	2813571	do
99		{
100	22730224	cur = visit.back();
101	43301861	if (cur.getAttribute(HasSkolemComputedAttr()))
102		{
103	20571637	visit.pop_back();
104		// already computed
105	20571637	continue;
106		}
107	2158587	it = visited.find(cur);
108	2158587	if (it == visited.end())
109		{
110	1165016	visited.insert(cur);
111	1165016	if (cur.getNumChildren() == 0)
112		{
113	171445	visit.pop_back();
114	171445	bool hasSkolem = false;
115	171445	if (cur.isVar())
116		{
117	126117	hasSkolem = (d_skDefs.find(cur) != d_skDefs.end());
118		}
119	171445	cur.setAttribute(HasSkolemAttr(), hasSkolem);
120	171445	cur.setAttribute(HasSkolemComputedAttr(), true);
121		}
122		else
123		{
124	993571	visit.insert(visit.end(), cur.begin(), cur.end());
125		}
126		}
127		else
128		{
129	993571	visit.pop_back();
130	993571	bool hasSkolem = false;
131	2599436	for (TNode i : cur)
132		{
133	1744641	Assert(i.getAttribute(HasSkolemComputedAttr()));
134	1744641	if (i.getAttribute(HasSkolemAttr()))
135		{
136	138776	hasSkolem = true;
137	138776	break;
138		}
139		}
140	993571	cur.setAttribute(HasSkolemAttr(), hasSkolem);
141	993571	cur.setAttribute(HasSkolemComputedAttr(), true);
142		}
143	22730224	} while (!visit.empty());
144	19916653	Assert(n.getAttribute(HasSkolemComputedAttr()));
145	39833306	return n.getAttribute(HasSkolemAttr());
146		}
147
148	6797145	void SkolemDefManager::getSkolems(TNode n,
149		std::unordered_set<Node>& skolems) const
150		{
151	13594290	std::unordered_set<TNode> visited;
152	6797145	std::unordered_set<TNode>::iterator it;
153	13594290	std::vector<TNode> visit;
154	13594290	TNode cur;
155	6797145	visit.push_back(n);
156	13119508	do
157		{
158	19916653	cur = visit.back();
159	19916653	visit.pop_back();
160	19916653	if (!hasSkolems(cur))
161		{
162		// does not have skolems, continue
163	7883359	continue;
164		}
165	12033294	it = visited.find(cur);
166	12033294	if (it == visited.end())
167		{
168	11616772	visited.insert(cur);
169	11616772	if (cur.isVar())
170		{
171	3638789	if (d_skDefs.find(cur) != d_skDefs.end())
172		{
173	3638789	skolems.insert(cur);
174		}
175		}
176		else
177		{
178	7977983	visit.insert(visit.end(), cur.begin(), cur.end());
179		}
180		}
181	19916653	} while (!visit.empty());
182	6797145	}
183
184		} // namespace prop
185	29577	} // namespace cvc5