From 9d2893040ea7c69f384b0735a1407e9d91f89e35 Mon Sep 17 00:00:00 2001 From: Alan Mishchenko Date: Fri, 23 Dec 2011 00:29:26 -0800 Subject: Transforming the solver to use different clause representation. --- src/aig/ivy/ivyFraig.c | 2 ++ 1 file changed, 2 insertions(+) (limited to 'src/aig/ivy') diff --git a/src/aig/ivy/ivyFraig.c b/src/aig/ivy/ivyFraig.c index b53805b4..f7c0743b 100644 --- a/src/aig/ivy/ivyFraig.c +++ b/src/aig/ivy/ivyFraig.c @@ -2113,6 +2113,7 @@ int Ivy_FraigNodesAreEquiv( Ivy_FraigMan_t * p, Ivy_Obj_t * pOld, Ivy_Obj_t * pN if ( p->pSat == NULL ) { p->pSat = sat_solver_new(); + p->pSat->factors = ABC_CALLOC( double, 1 ); p->nSatVars = 1; sat_solver_setnvars( p->pSat, 1000 ); // var 0 is reserved for const1 node - add the clause @@ -2264,6 +2265,7 @@ int Ivy_FraigNodeIsConst( Ivy_FraigMan_t * p, Ivy_Obj_t * pNew ) if ( p->pSat == NULL ) { p->pSat = sat_solver_new(); + p->pSat->factors = ABC_CALLOC( double, 1 ); p->nSatVars = 1; sat_solver_setnvars( p->pSat, 1000 ); // var 0 is reserved for const1 node - add the clause -- cgit v1.2.3