Head

GCC Code Coverage Report

Directory:	.		Exec	Total	Coverage
File:	src/theory/arith/callbacks.cpp	Lines:	100	114	87.7 %
Date:	2021-05-21	Branches:	112	466	24.0 %


/******************************************************************************
 * Top contributors (to current version):
 *   Tim King, Haniel Barbosa, Mathias Preiner
 *
 * 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.
 * ****************************************************************************
 *
 * [[ Add one-line brief description here ]]
 *
 * [[ Add lengthier description here ]]
 * \todo document this file
 */

#include "theory/arith/callbacks.h"

#include "expr/proof_node.h"
#include "expr/skolem_manager.h"
#include "theory/arith/proof_macros.h"
#include "theory/arith/theory_arith_private.h"

namespace cvc5 {
namespace theory {
namespace arith {

SetupLiteralCallBack::SetupLiteralCallBack(TheoryArithPrivate& ta)
  : d_arith(ta)
{}
void SetupLiteralCallBack::operator()(TNode lit){
  TNode atom = (lit.getKind() == kind::NOT) ? lit[0] : lit;
  if(!d_arith.isSetup(atom)){
    d_arith.setupAtom(atom);
  }
}

DeltaComputeCallback::DeltaComputeCallback(const TheoryArithPrivate& ta)
  : d_ta(ta)
{}
Rational DeltaComputeCallback::operator()() const{
  return d_ta.deltaValueForTotalOrder();
}

TempVarMalloc::TempVarMalloc(TheoryArithPrivate& ta)
: d_ta(ta)
{}
ArithVar TempVarMalloc::request(){
  NodeManager* nm = NodeManager::currentNM();
  SkolemManager* sm = nm->getSkolemManager();
  Node skolem = sm->mkDummySkolem("tmpVar", nm->realType());
  return d_ta.requestArithVar(skolem, false, true);
}
void TempVarMalloc::release(ArithVar v){
  d_ta.releaseArithVar(v);
}

BasicVarModelUpdateCallBack::BasicVarModelUpdateCallBack(TheoryArithPrivate& ta)
  : d_ta(ta)
{}
void BasicVarModelUpdateCallBack::operator()(ArithVar x){
  d_ta.signal(x);
}

RaiseConflict::RaiseConflict(TheoryArithPrivate& ta)
  : d_ta(ta)
{}

void RaiseConflict::raiseConflict(ConstraintCP c, InferenceId id) const{
  Assert(c->inConflict());
  d_ta.raiseConflict(c, id);
}

FarkasConflictBuilder::FarkasConflictBuilder()
  : d_farkas()
  , d_constraints()
  , d_consequent(NullConstraint)
  , d_consequentSet(false)
{
  reset();
}

bool FarkasConflictBuilder::underConstruction() const{
  return d_consequent != NullConstraint;
}

bool FarkasConflictBuilder::consequentIsSet() const{
  return d_consequentSet;
}

void FarkasConflictBuilder::reset(){
  d_consequent = NullConstraint;
  d_constraints.clear();
  d_consequentSet = false;
  ARITH_PROOF(d_farkas.clear());
  Assert(!underConstruction());
}

/* Adds a constraint to the constraint under construction. */
void FarkasConflictBuilder::addConstraint(ConstraintCP c, const Rational& fc){
  Assert(
      !ARITH_PROOF_ON()
      || (!underConstruction() && d_constraints.empty() && d_farkas.empty())
      || (underConstruction() && d_constraints.size() + 1 == d_farkas.size()));
  Assert(ARITH_PROOF_ON() || d_farkas.empty());
  Assert(c->isTrue());

  if(d_consequent == NullConstraint){
    d_consequent = c;
  } else {
    d_constraints.push_back(c);
  }
  ARITH_PROOF(d_farkas.push_back(fc));
  Assert(!ARITH_PROOF_ON() || d_constraints.size() + 1 == d_farkas.size());
  Assert(ARITH_PROOF_ON() || d_farkas.empty());
}

void FarkasConflictBuilder::addConstraint(ConstraintCP c, const Rational& fc, const Rational& mult){
  Assert(!mult.isZero());
  if (ARITH_PROOF_ON() && !mult.isOne())
  {
    Rational prod = fc * mult;
    addConstraint(c, prod);
  }
  else
  {
    addConstraint(c, fc);
  }
}

void FarkasConflictBuilder::makeLastConsequent(){
  Assert(!d_consequentSet);
  Assert(underConstruction());

  if(d_constraints.empty()){
    // no-op
    d_consequentSet = true;
  } else {
    Assert(d_consequent != NullConstraint);
    ConstraintCP last = d_constraints.back();
    d_constraints.back() = d_consequent;
    d_consequent = last;
    ARITH_PROOF(std::swap(d_farkas.front(), d_farkas.back()));
    d_consequentSet = true;
  }

  Assert(!d_consequent->negationHasProof());
  Assert(d_consequentSet);
}

/* Turns the vector under construction into a conflict */
ConstraintCP FarkasConflictBuilder::commitConflict(){
  Assert(underConstruction());
  Assert(!d_constraints.empty());
  Assert(
      !ARITH_PROOF_ON()
      || (!underConstruction() && d_constraints.empty() && d_farkas.empty())
      || (underConstruction() && d_constraints.size() + 1 == d_farkas.size()));
  Assert(ARITH_PROOF_ON() || d_farkas.empty());
  Assert(d_consequentSet);

  ConstraintP not_c = d_consequent->getNegation();
  RationalVectorCP coeffs = ARITH_NULLPROOF(&d_farkas);
  not_c->impliedByFarkas(d_constraints, coeffs, true );

  reset();
  Assert(!underConstruction());
  Assert(not_c->inConflict());
  Assert(!d_consequentSet);
  return not_c;
}

RaiseEqualityEngineConflict::RaiseEqualityEngineConflict(TheoryArithPrivate& ta)
  : d_ta(ta)
{}

/* If you are not an equality engine, don't use this! */
void RaiseEqualityEngineConflict::raiseEEConflict(
    Node n, std::shared_ptr<ProofNode> pf) const
{
  d_ta.raiseBlackBoxConflict(n, pf);
}

BoundCountingLookup::BoundCountingLookup(TheoryArithPrivate& ta)
: d_ta(ta)
{}

const BoundsInfo& BoundCountingLookup::boundsInfo(ArithVar basic) const{
  return d_ta.boundsInfo(basic);
}

BoundCounts BoundCountingLookup::atBounds(ArithVar basic) const{
  return boundsInfo(basic).atBounds();
}
BoundCounts BoundCountingLookup::hasBounds(ArithVar basic) const {
  return boundsInfo(basic).hasBounds();
}

}  // namespace arith
}  // namespace theory
}  // namespace cvc5


Generated by: GCOVR (Version 3.2)

Line	Exec	Source
1		/******************************************************************************
2		* Top contributors (to current version):
3		* Tim King, Haniel Barbosa, Mathias Preiner
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		* [[ Add one-line brief description here ]]
14		*
15		* [[ Add lengthier description here ]]
16		* \todo document this file
17		*/
18
19		#include "theory/arith/callbacks.h"
20
21		#include "expr/proof_node.h"
22		#include "expr/skolem_manager.h"
23		#include "theory/arith/proof_macros.h"
24		#include "theory/arith/theory_arith_private.h"
25
26		namespace cvc5 {
27		namespace theory {
28		namespace arith {
29
30	8954	SetupLiteralCallBack::SetupLiteralCallBack(TheoryArithPrivate& ta)
31	8954	: d_arith(ta)
32	8954	{}
33	16314	void SetupLiteralCallBack::operator()(TNode lit){
34	32628	TNode atom = (lit.getKind() == kind::NOT) ? lit[0] : lit;
35	16314	if(!d_arith.isSetup(atom)){
36	16314	d_arith.setupAtom(atom);
37		}
38	16314	}
39
40	8954	DeltaComputeCallback::DeltaComputeCallback(const TheoryArithPrivate& ta)
41	8954	: d_ta(ta)
42	8954	{}
43	11796	Rational DeltaComputeCallback::operator()() const{
44	11796	return d_ta.deltaValueForTotalOrder();
45		}
46
47	35816	TempVarMalloc::TempVarMalloc(TheoryArithPrivate& ta)
48	35816	: d_ta(ta)
49	35816	{}
50		ArithVar TempVarMalloc::request(){
51		NodeManager* nm = NodeManager::currentNM();
52		SkolemManager* sm = nm->getSkolemManager();
53		Node skolem = sm->mkDummySkolem("tmpVar", nm->realType());
54		return d_ta.requestArithVar(skolem, false, true);
55		}
56		void TempVarMalloc::release(ArithVar v){
57		d_ta.releaseArithVar(v);
58		}
59
60	8954	BasicVarModelUpdateCallBack::BasicVarModelUpdateCallBack(TheoryArithPrivate& ta)
61	8954	: d_ta(ta)
62	8954	{}
63	5309440	void BasicVarModelUpdateCallBack::operator()(ArithVar x){
64	5309440	d_ta.signal(x);
65	5309440	}
66
67	44770	RaiseConflict::RaiseConflict(TheoryArithPrivate& ta)
68	44770	: d_ta(ta)
69	44770	{}
70
71	52741	void RaiseConflict::raiseConflict(ConstraintCP c, InferenceId id) const{
72	52741	Assert(c->inConflict());
73	52741	d_ta.raiseConflict(c, id);
74	52741	}
75
76	35816	FarkasConflictBuilder::FarkasConflictBuilder()
77		: d_farkas()
78		, d_constraints()
79		, d_consequent(NullConstraint)
80	35816	, d_consequentSet(false)
81		{
82	35816	reset();
83	35816	}
84
85	630107	bool FarkasConflictBuilder::underConstruction() const{
86	630107	return d_consequent != NullConstraint;
87		}
88
89	52741	bool FarkasConflictBuilder::consequentIsSet() const{
90	52741	return d_consequentSet;
91		}
92
93	88557	void FarkasConflictBuilder::reset(){
94	88557	d_consequent = NullConstraint;
95	88557	d_constraints.clear();
96	88557	d_consequentSet = false;
97	88557	ARITH_PROOF(d_farkas.clear());
98	88557	Assert(!underConstruction());
99	88557	}
100
101		/* Adds a constraint to the constraint under construction. */
102	800847	void FarkasConflictBuilder::addConstraint(ConstraintCP c, const Rational& fc){
103	800847	Assert(
104		!ARITH_PROOF_ON()
105		\|\| (!underConstruction() && d_constraints.empty() && d_farkas.empty())
106		\|\| (underConstruction() && d_constraints.size() + 1 == d_farkas.size()));
107	800847	Assert(ARITH_PROOF_ON() \|\| d_farkas.empty());
108	800847	Assert(c->isTrue());
109
110	800847	if(d_consequent == NullConstraint){
111	52741	d_consequent = c;
112		} else {
113	748106	d_constraints.push_back(c);
114		}
115	800847	ARITH_PROOF(d_farkas.push_back(fc));
116	800847	Assert(!ARITH_PROOF_ON() \|\| d_constraints.size() + 1 == d_farkas.size());
117	800847	Assert(ARITH_PROOF_ON() \|\| d_farkas.empty());
118	800847	}
119
120	800847	void FarkasConflictBuilder::addConstraint(ConstraintCP c, const Rational& fc, const Rational& mult){
121	800847	Assert(!mult.isZero());
122	800847	if (ARITH_PROOF_ON() && !mult.isOne())
123		{
124	143992	Rational prod = fc * mult;
125	71996	addConstraint(c, prod);
126		}
127		else
128		{
129	728851	addConstraint(c, fc);
130		}
131	800847	}
132
133	52741	void FarkasConflictBuilder::makeLastConsequent(){
134	52741	Assert(!d_consequentSet);
135	52741	Assert(underConstruction());
136
137	52741	if(d_constraints.empty()){
138		// no-op
139	2106	d_consequentSet = true;
140		} else {
141	50635	Assert(d_consequent != NullConstraint);
142	50635	ConstraintCP last = d_constraints.back();
143	50635	d_constraints.back() = d_consequent;
144	50635	d_consequent = last;
145	50635	ARITH_PROOF(std::swap(d_farkas.front(), d_farkas.back()));
146	50635	d_consequentSet = true;
147		}
148
149	52741	Assert(!d_consequent->negationHasProof());
150	52741	Assert(d_consequentSet);
151	52741	}
152
153		/* Turns the vector under construction into a conflict */
154	52741	ConstraintCP FarkasConflictBuilder::commitConflict(){
155	52741	Assert(underConstruction());
156	52741	Assert(!d_constraints.empty());
157	52741	Assert(
158		!ARITH_PROOF_ON()
159		\|\| (!underConstruction() && d_constraints.empty() && d_farkas.empty())
160		\|\| (underConstruction() && d_constraints.size() + 1 == d_farkas.size()));
161	52741	Assert(ARITH_PROOF_ON() \|\| d_farkas.empty());
162	52741	Assert(d_consequentSet);
163
164	52741	ConstraintP not_c = d_consequent->getNegation();
165	52741	RationalVectorCP coeffs = ARITH_NULLPROOF(&d_farkas);
166	52741	not_c->impliedByFarkas(d_constraints, coeffs, true );
167
168	52741	reset();
169	52741	Assert(!underConstruction());
170	52741	Assert(not_c->inConflict());
171	52741	Assert(!d_consequentSet);
172	52741	return not_c;
173		}
174
175	8954	RaiseEqualityEngineConflict::RaiseEqualityEngineConflict(TheoryArithPrivate& ta)
176	8954	: d_ta(ta)
177	8954	{}
178
179		/* If you are not an equality engine, don't use this! */
180	1912	void RaiseEqualityEngineConflict::raiseEEConflict(
181		Node n, std::shared_ptr<ProofNode> pf) const
182		{
183	1912	d_ta.raiseBlackBoxConflict(n, pf);
184	1912	}
185
186	8954	BoundCountingLookup::BoundCountingLookup(TheoryArithPrivate& ta)
187	8954	: d_ta(ta)
188	8954	{}
189
190		const BoundsInfo& BoundCountingLookup::boundsInfo(ArithVar basic) const{
191		return d_ta.boundsInfo(basic);
192		}
193
194		BoundCounts BoundCountingLookup::atBounds(ArithVar basic) const{
195		return boundsInfo(basic).atBounds();
196		}
197		BoundCounts BoundCountingLookup::hasBounds(ArithVar basic) const {
198		return boundsInfo(basic).hasBounds();
199		}
200
201		} // namespace arith
202		} // namespace theory
203	27735	} // namespace cvc5