summaryrefslogtreecommitdiffstats
path: root/src/aig
diff options
context:
space:
mode:
Diffstat (limited to 'src/aig')
-rw-r--r--src/aig/gia/gia.h2
-rw-r--r--src/aig/gia/giaAbs.c8
-rw-r--r--src/aig/saig/module.make1
-rw-r--r--src/aig/saig/saigGlaPba.c17
-rw-r--r--src/aig/saig/saigGlaPba2.c558
5 files changed, 571 insertions, 15 deletions
diff --git a/src/aig/gia/gia.h b/src/aig/gia/gia.h
index a79e12dd..c652f1a0 100644
--- a/src/aig/gia/gia.h
+++ b/src/aig/gia/gia.h
@@ -606,7 +606,7 @@ int Gia_ManCexAbstractionRefine( Gia_Man_t * pGia, Abc_Ce
extern int Gia_ManPbaPerform( Gia_Man_t * pGia, int nStart, int nFrames, int nConfLimit, int nTimeLimit, int fVerbose, int * piFrame );
extern int Gia_ManCbaPerform( Gia_Man_t * pGia, void * pPars );
extern int Gia_ManGlaCbaPerform( Gia_Man_t * pGia, void * pPars, int fNaiveCnf );
-extern int Gia_ManGlaPbaPerform( Gia_Man_t * pGia, void * pPars );
+extern int Gia_ManGlaPbaPerform( Gia_Man_t * pGia, void * pPars, int fNewSolver );
/*=== giaAiger.c ===========================================================*/
extern int Gia_FileSize( char * pFileName );
extern Gia_Man_t * Gia_ReadAigerFromMemory( char * pContents, int nFileSize, int fCheck );
diff --git a/src/aig/gia/giaAbs.c b/src/aig/gia/giaAbs.c
index 165bc996..e9861977 100644
--- a/src/aig/gia/giaAbs.c
+++ b/src/aig/gia/giaAbs.c
@@ -424,9 +424,10 @@ int Gia_ManGlaCbaPerform( Gia_Man_t * pGia, void * pPars, int fNaiveCnf )
SeeAlso []
***********************************************************************/
-int Gia_ManGlaPbaPerform( Gia_Man_t * pGia, void * pPars )
+int Gia_ManGlaPbaPerform( Gia_Man_t * pGia, void * pPars, int fNewSolver )
{
extern Vec_Int_t * Aig_Gla2ManPerform( Aig_Man_t * pAig, int nStart, int nFramesMax, int nConfLimit, int TimeLimit, int fSkipRand, int fVerbose );
+ extern Vec_Int_t * Aig_Gla3ManPerform( Aig_Man_t * pAig, int nStart, int nFramesMax, int nConfLimit, int TimeLimit, int fSkipRand, int fVerbose );
Saig_ParBmc_t * p = (Saig_ParBmc_t *)pPars;
Vec_Int_t * vGateClasses;
Gia_Man_t * pGiaAbs;
@@ -447,7 +448,10 @@ int Gia_ManGlaPbaPerform( Gia_Man_t * pGia, void * pPars )
}
// perform abstraction
- vGateClasses = Aig_Gla2ManPerform( pAig, p->nStart, p->nFramesMax, p->nConfLimit, p->nTimeOut, p->fSkipRand, p->fVerbose );
+ if ( fNewSolver )
+ vGateClasses = Aig_Gla3ManPerform( pAig, p->nStart, p->nFramesMax, p->nConfLimit, p->nTimeOut, p->fSkipRand, p->fVerbose );
+ else
+ vGateClasses = Aig_Gla2ManPerform( pAig, p->nStart, p->nFramesMax, p->nConfLimit, p->nTimeOut, p->fSkipRand, p->fVerbose );
Aig_ManStop( pAig );
// update the BMC depth
diff --git a/src/aig/saig/module.make b/src/aig/saig/module.make
index df6fd7cb..cbd25a18 100644
--- a/src/aig/saig/module.make
+++ b/src/aig/saig/module.make
@@ -13,6 +13,7 @@ SRC += src/aig/saig/saigAbs.c \
src/aig/saig/saigDup.c \
src/aig/saig/saigGlaCba.c \
src/aig/saig/saigGlaPba.c \
+ src/aig/saig/saigGlaPba2.c \
src/aig/saig/saigHaig.c \
src/aig/saig/saigInd.c \
src/aig/saig/saigIoa.c \
diff --git a/src/aig/saig/saigGlaPba.c b/src/aig/saig/saigGlaPba.c
index 5834db76..cdbc05c7 100644
--- a/src/aig/saig/saigGlaPba.c
+++ b/src/aig/saig/saigGlaPba.c
@@ -432,11 +432,10 @@ Vec_Int_t * Saig_AbsSolverUnsatCore( sat_solver * pSat, int nConfMax, int fVerbo
Vec_Int_t * vCore;
void * pSatCnf;
Intp_Man_t * pManProof;
- int RetValue;
+ int RetValue, clk = clock();
if ( piRetValue )
*piRetValue = -1;
// solve the problem
- Abc_Clock(2,1);
RetValue = sat_solver_solve( pSat, NULL, NULL, (ABC_INT64_T)nConfMax, (ABC_INT64_T)0, (ABC_INT64_T)0, (ABC_INT64_T)0 );
if ( RetValue == l_Undef )
{
@@ -453,19 +452,19 @@ Vec_Int_t * Saig_AbsSolverUnsatCore( sat_solver * pSat, int nConfMax, int fVerbo
if ( fVerbose )
{
printf( "SAT solver returned UNSAT after %7d conflicts. ", pSat->stats.conflicts );
- ABC_PRT( "Time", (Abc_Clock(2,0)/ABC_CPS)*CLOCKS_PER_SEC );
+ Abc_PrintTime( 1, "Time", clock() - clk );
}
assert( RetValue == l_False );
pSatCnf = sat_solver_store_release( pSat );
// derive the UNSAT core
- Abc_Clock(2,1);
+ clk = clock();
pManProof = Intp_ManAlloc();
vCore = (Vec_Int_t *)Intp_ManUnsatCore( pManProof, (Sto_Man_t *)pSatCnf, 0 );
Intp_ManFree( pManProof );
if ( fVerbose )
{
- printf( "SAT core contains %8d clauses (out of %8d). ", Vec_IntSize(vCore), ((Sto_Man_t *)pSatCnf)->nRoots );
- ABC_PRT( "Time", (Abc_Clock(2,0)/ABC_CPS)*CLOCKS_PER_SEC );
+ printf( "SAT core contains %8d clauses (out of %8d). ", Vec_IntSize(vCore), sat_solver_nclauses(pSat) );
+ Abc_PrintTime( 1, "Time", clock() - clk );
}
Sto_ManFree( (Sto_Man_t *)pSatCnf );
return vCore;
@@ -561,7 +560,6 @@ Vec_Int_t * Aig_Gla2ManPerform( Aig_Man_t * pAig, int nStart, int nFramesMax, in
int clk, clk2 = clock();
assert( Saig_ManPoNum(pAig) == 1 );
- Abc_Clock(0,1);
if ( fVerbose )
{
if ( TimeLimit )
@@ -572,7 +570,6 @@ Vec_Int_t * Aig_Gla2ManPerform( Aig_Man_t * pAig, int nStart, int nFramesMax, in
// start the solver
clk = clock();
- Abc_Clock(1,1);
p = Aig_Gla2ManStart( pAig, nStart, nFramesMax, fVerbose );
if ( !Aig_Gla2CreateSatSolver( p ) )
{
@@ -581,7 +578,6 @@ Vec_Int_t * Aig_Gla2ManPerform( Aig_Man_t * pAig, int nStart, int nFramesMax, in
return NULL;
}
sat_solver_set_random( p->pSat, fSkipRand );
-// p->timePre += (Abc_Clock(1,0)/ABC_CPS)*CLOCKS_PER_SEC;
p->timePre += clock() - clk;
// set runtime limit
@@ -590,15 +586,12 @@ Vec_Int_t * Aig_Gla2ManPerform( Aig_Man_t * pAig, int nStart, int nFramesMax, in
// compute UNSAT core
clk = clock();
- Abc_Clock(1,1);
vCore = Saig_AbsSolverUnsatCore( p->pSat, nConfLimit, fVerbose, NULL );
if ( vCore == NULL )
{
Aig_Gla2ManStop( p );
return NULL;
}
-// p->timeSat += (Abc_Clock(1,0)/ABC_CPS)*CLOCKS_PER_SEC;
-// p->timeTotal = (Abc_Clock(0,0)/ABC_CPS)*CLOCKS_PER_SEC;
p->timeSat += clock() - clk;
p->timeTotal += clock() - clk2;
diff --git a/src/aig/saig/saigGlaPba2.c b/src/aig/saig/saigGlaPba2.c
new file mode 100644
index 00000000..8de5fb32
--- /dev/null
+++ b/src/aig/saig/saigGlaPba2.c
@@ -0,0 +1,558 @@
+/**CFile****************************************************************
+
+ FileName [saigGlaPba.c]
+
+ SystemName [ABC: Logic synthesis and verification system.]
+
+ PackageName [Sequential AIG package.]
+
+ Synopsis [Gate level abstraction.]
+
+ Author [Alan Mishchenko]
+
+ Affiliation [UC Berkeley]
+
+ Date [Ver. 1.0. Started - June 20, 2005.]
+
+ Revision [$Id: saigGlaPba.c,v 1.00 2005/06/20 00:00:00 alanmi Exp $]
+
+***********************************************************************/
+
+#include "saig.h"
+#include "satSolver2.h"
+
+ABC_NAMESPACE_IMPL_START
+
+
+////////////////////////////////////////////////////////////////////////
+/// DECLARATIONS ///
+////////////////////////////////////////////////////////////////////////
+
+typedef struct Aig_Gla3Man_t_ Aig_Gla3Man_t;
+struct Aig_Gla3Man_t_
+{
+ // user data
+ Aig_Man_t * pAig;
+ int nStart;
+ int nFramesMax;
+ int fVerbose;
+ // unrolling
+ Vec_Int_t * vObj2Vec; // maps obj ID into its vec ID
+ Vec_Int_t * vVec2Var; // maps vec ID into its sat Var (nFrames per vec ID)
+ Vec_Int_t * vVar2Inf; // maps sat Var into its frame and obj ID
+ // clause mapping
+ Vec_Int_t * vCla2Obj; // maps clause into its root object
+ Vec_Int_t * vCla2Fra; // maps clause into its frame
+ Vec_Int_t * vVec2Use; // maps vec ID into its used frames (nFrames per vec ID)
+ // SAT solver
+ sat_solver2 * pSat;
+ // statistics
+ int timePre;
+ int timeSat;
+ int timeTotal;
+};
+
+////////////////////////////////////////////////////////////////////////
+/// FUNCTION DEFINITIONS ///
+////////////////////////////////////////////////////////////////////////
+
+#define ABC_CPS 1000
+
+/**Function*************************************************************
+
+ Synopsis [Adds constant to the solver.]
+
+ Description []
+
+ SideEffects []
+
+ SeeAlso []
+
+***********************************************************************/
+static inline int Aig_Gla3AddConst( sat_solver2 * pSat, int iVar, int fCompl )
+{
+ lit Lit = toLitCond( iVar, fCompl );
+ if ( !sat_solver2_addclause( pSat, &Lit, &Lit + 1 ) )
+ return 0;
+ return 1;
+}
+
+/**Function*************************************************************
+
+ Synopsis [Adds buffer to the solver.]
+
+ Description []
+
+ SideEffects []
+
+ SeeAlso []
+
+***********************************************************************/
+static inline int Aig_Gla3AddBuffer( sat_solver2 * pSat, int iVar0, int iVar1, int fCompl )
+{
+ lit Lits[2];
+
+ Lits[0] = toLitCond( iVar0, 0 );
+ Lits[1] = toLitCond( iVar1, !fCompl );
+ if ( !sat_solver2_addclause( pSat, Lits, Lits + 2 ) )
+ return 0;
+
+ Lits[0] = toLitCond( iVar0, 1 );
+ Lits[1] = toLitCond( iVar1, fCompl );
+ if ( !sat_solver2_addclause( pSat, Lits, Lits + 2 ) )
+ return 0;
+
+ return 1;
+}
+
+/**Function*************************************************************
+
+ Synopsis [Adds buffer to the solver.]
+
+ Description []
+
+ SideEffects []
+
+ SeeAlso []
+
+***********************************************************************/
+static inline int Aig_Gla3AddNode( sat_solver2 * pSat, int iVar, int iVar0, int iVar1, int fCompl0, int fCompl1 )
+{
+ lit Lits[3];
+
+ Lits[0] = toLitCond( iVar, 1 );
+ Lits[1] = toLitCond( iVar0, fCompl0 );
+ if ( !sat_solver2_addclause( pSat, Lits, Lits + 2 ) )
+ return 0;
+
+ Lits[0] = toLitCond( iVar, 1 );
+ Lits[1] = toLitCond( iVar1, fCompl1 );
+ if ( !sat_solver2_addclause( pSat, Lits, Lits + 2 ) )
+ return 0;
+
+ Lits[0] = toLitCond( iVar, 0 );
+ Lits[1] = toLitCond( iVar0, !fCompl0 );
+ Lits[2] = toLitCond( iVar1, !fCompl1 );
+ if ( !sat_solver2_addclause( pSat, Lits, Lits + 3 ) )
+ return 0;
+
+ return 1;
+}
+
+
+/**Function*************************************************************
+
+ Synopsis [Finds existing SAT variable or creates a new one.]
+
+ Description []
+
+ SideEffects []
+
+ SeeAlso []
+
+***********************************************************************/
+int Aig_Gla3FetchVar( Aig_Gla3Man_t * p, Aig_Obj_t * pObj, int k )
+{
+ int i, iVecId, iSatVar;
+ assert( k < p->nFramesMax );
+ iVecId = Vec_IntEntry( p->vObj2Vec, Aig_ObjId(pObj) );
+ if ( iVecId == 0 )
+ {
+ iVecId = Vec_IntSize( p->vVec2Var ) / p->nFramesMax;
+ for ( i = 0; i < p->nFramesMax; i++ )
+ Vec_IntPush( p->vVec2Var, 0 );
+ Vec_IntWriteEntry( p->vObj2Vec, Aig_ObjId(pObj), iVecId );
+ }
+ iSatVar = Vec_IntEntry( p->vVec2Var, iVecId * p->nFramesMax + k );
+ if ( iSatVar == 0 )
+ {
+ iSatVar = Vec_IntSize( p->vVar2Inf ) / 2;
+ Vec_IntPush( p->vVar2Inf, Aig_ObjId(pObj) );
+ Vec_IntPush( p->vVar2Inf, k );
+ Vec_IntWriteEntry( p->vVec2Var, iVecId * p->nFramesMax + k, iSatVar );
+ }
+ return iSatVar;
+}
+
+/**Function*************************************************************
+
+ Synopsis [Assigns variables to the AIG nodes.]
+
+ Description []
+
+ SideEffects []
+
+ SeeAlso []
+
+***********************************************************************/
+void Aig_Gla3AssignVars_rec( Aig_Gla3Man_t * p, Aig_Obj_t * pObj, int f )
+{
+ int nVars = Vec_IntSize(p->vVar2Inf);
+ Aig_Gla3FetchVar( p, pObj, f );
+ if ( nVars == Vec_IntSize(p->vVar2Inf) )
+ return;
+ if ( Aig_ObjIsConst1(pObj) )
+ return;
+ if ( Saig_ObjIsPo( p->pAig, pObj ) )
+ {
+ Aig_Gla3AssignVars_rec( p, Aig_ObjFanin0(pObj), f );
+ return;
+ }
+ if ( Aig_ObjIsPi( pObj ) )
+ {
+ if ( Saig_ObjIsLo(p->pAig, pObj) && f > 0 )
+ Aig_Gla3AssignVars_rec( p, Aig_ObjFanin0( Saig_ObjLoToLi(p->pAig, pObj) ), f-1 );
+ return;
+ }
+ assert( Aig_ObjIsNode(pObj) );
+ Aig_Gla3AssignVars_rec( p, Aig_ObjFanin0(pObj), f );
+ Aig_Gla3AssignVars_rec( p, Aig_ObjFanin1(pObj), f );
+}
+
+/**Function*************************************************************
+
+ Synopsis [Creates SAT solver.]
+
+ Description []
+
+ SideEffects []
+
+ SeeAlso []
+
+***********************************************************************/
+int Aig_Gla3CreateSatSolver( Aig_Gla3Man_t * p )
+{
+ Vec_Int_t * vPoLits;
+ Aig_Obj_t * pObj;
+ int i, f, ObjId, nVars, RetValue = 1;
+
+ // assign variables
+ for ( f = p->nFramesMax - 1; f >= 0; f-- )
+ Aig_Gla3AssignVars_rec( p, Aig_ManPo(p->pAig, 0), f );
+
+ // create SAT solver
+ p->pSat = sat_solver2_new();
+ sat_solver2_setnvars( p->pSat, Vec_IntSize(p->vVar2Inf)/2 );
+
+ // add clauses
+ nVars = Vec_IntSize( p->vVar2Inf );
+ Vec_IntForEachEntryDouble( p->vVar2Inf, ObjId, f, i )
+ {
+ if ( ObjId == -1 )
+ continue;
+ pObj = Aig_ManObj( p->pAig, ObjId );
+ if ( Aig_ObjIsNode(pObj) )
+ {
+ Aig_Gla3AddNode( p->pSat, Aig_Gla3FetchVar(p, pObj, f),
+ Aig_Gla3FetchVar(p, Aig_ObjFanin0(pObj), f),
+ Aig_Gla3FetchVar(p, Aig_ObjFanin1(pObj), f),
+ Aig_ObjFaninC0(pObj), Aig_ObjFaninC1(pObj) );
+ Vec_IntPush( p->vCla2Obj, ObjId );
+ Vec_IntPush( p->vCla2Obj, ObjId );
+ Vec_IntPush( p->vCla2Obj, ObjId );
+
+ Vec_IntPush( p->vCla2Fra, f );
+ Vec_IntPush( p->vCla2Fra, f );
+ Vec_IntPush( p->vCla2Fra, f );
+ }
+ else if ( Saig_ObjIsLo(p->pAig, pObj) )
+ {
+ if ( f == 0 )
+ {
+ Aig_Gla3AddConst( p->pSat, Aig_Gla3FetchVar(p, pObj, f), 1 );
+ Vec_IntPush( p->vCla2Obj, ObjId );
+
+ Vec_IntPush( p->vCla2Fra, f );
+ }
+ else
+ {
+ Aig_Obj_t * pObjLi = Saig_ObjLoToLi(p->pAig, pObj);
+ Aig_Gla3AddBuffer( p->pSat, Aig_Gla3FetchVar(p, pObj, f),
+ Aig_Gla3FetchVar(p, Aig_ObjFanin0(pObjLi), f-1),
+ Aig_ObjFaninC0(pObjLi) );
+ Vec_IntPush( p->vCla2Obj, ObjId );
+ Vec_IntPush( p->vCla2Obj, ObjId );
+
+ Vec_IntPush( p->vCla2Fra, f );
+ Vec_IntPush( p->vCla2Fra, f );
+ }
+ }
+ else if ( Saig_ObjIsPo(p->pAig, pObj) )
+ {
+ Aig_Gla3AddBuffer( p->pSat, Aig_Gla3FetchVar(p, pObj, f),
+ Aig_Gla3FetchVar(p, Aig_ObjFanin0(pObj), f),
+ Aig_ObjFaninC0(pObj) );
+ Vec_IntPush( p->vCla2Obj, ObjId );
+ Vec_IntPush( p->vCla2Obj, ObjId );
+
+ Vec_IntPush( p->vCla2Fra, f );
+ Vec_IntPush( p->vCla2Fra, f );
+ }
+ else if ( Aig_ObjIsConst1(pObj) )
+ {
+ Aig_Gla3AddConst( p->pSat, Aig_Gla3FetchVar(p, pObj, f), 0 );
+ Vec_IntPush( p->vCla2Obj, ObjId );
+
+ Vec_IntPush( p->vCla2Fra, f );
+ }
+ else assert( Saig_ObjIsPi(p->pAig, pObj) );
+ }
+
+ // add output clause
+ vPoLits = Vec_IntAlloc( p->nFramesMax );
+ for ( f = p->nStart; f < p->nFramesMax; f++ )
+ Vec_IntPush( vPoLits, 2 * Aig_Gla3FetchVar(p, Aig_ManPo(p->pAig, 0), f) );
+ sat_solver2_addclause( p->pSat, Vec_IntArray(vPoLits), Vec_IntArray(vPoLits) + Vec_IntSize(vPoLits) );
+ Vec_IntFree( vPoLits );
+ Vec_IntPush( p->vCla2Obj, 0 );
+ Vec_IntPush( p->vCla2Fra, 0 );
+ assert( Vec_IntSize(p->vCla2Fra) == Vec_IntSize(p->vCla2Obj) );
+ assert( nVars == Vec_IntSize(p->vVar2Inf) );
+ assert( Vec_IntSize(p->vCla2Obj) == (int)p->pSat->stats.clauses );
+ if ( p->fVerbose )
+ printf( "The resulting SAT problem contains %d variables and %d clauses.\n",
+ p->pSat->size, p->pSat->stats.clauses );
+ return RetValue;
+}
+
+/**Function*************************************************************
+
+ Synopsis []
+
+ Description []
+
+ SideEffects []
+
+ SeeAlso []
+
+***********************************************************************/
+Aig_Gla3Man_t * Aig_Gla3ManStart( Aig_Man_t * pAig, int nStart, int nFramesMax, int fVerbose )
+{
+ Aig_Gla3Man_t * p;
+ int i;
+
+ p = ABC_CALLOC( Aig_Gla3Man_t, 1 );
+ p->pAig = pAig;
+
+ p->vObj2Vec = Vec_IntStart( Aig_ManObjNumMax(pAig) );
+ p->vVec2Var = Vec_IntAlloc( 1 << 20 );
+ p->vVar2Inf = Vec_IntAlloc( 1 << 20 );
+ p->vCla2Obj = Vec_IntAlloc( 1 << 20 );
+ p->vCla2Fra = Vec_IntAlloc( 1 << 20 );
+
+ // skip first vector ID
+ p->nStart = nStart;
+ p->nFramesMax = nFramesMax;
+ p->fVerbose = fVerbose;
+ for ( i = 0; i < p->nFramesMax; i++ )
+ Vec_IntPush( p->vVec2Var, -1 );
+
+ // skip first SAT variable
+ Vec_IntPush( p->vVar2Inf, -1 );
+ Vec_IntPush( p->vVar2Inf, -1 );
+ return p;
+}
+
+/**Function*************************************************************
+
+ Synopsis []
+
+ Description []
+
+ SideEffects []
+
+ SeeAlso []
+
+***********************************************************************/
+void Aig_Gla3ManStop( Aig_Gla3Man_t * p )
+{
+ Vec_IntFreeP( &p->vObj2Vec );
+ Vec_IntFreeP( &p->vVec2Var );
+ Vec_IntFreeP( &p->vVar2Inf );
+ Vec_IntFreeP( &p->vCla2Obj );
+ Vec_IntFreeP( &p->vCla2Fra );
+ Vec_IntFreeP( &p->vVec2Use );
+
+ if ( p->pSat )
+ sat_solver2_delete( p->pSat );
+ ABC_FREE( p );
+}
+
+
+/**Function*************************************************************
+
+ Synopsis [Finds the set of clauses involved in the UNSAT core.]
+
+ Description []
+
+ SideEffects []
+
+ SeeAlso []
+
+***********************************************************************/
+Vec_Int_t * Aig_Gla3ManUnsatCore( sat_solver2 * pSat, int nConfMax, int fVerbose, int * piRetValue )
+{
+ Vec_Int_t * vCore;
+ int RetValue, clk = clock();
+ if ( piRetValue )
+ *piRetValue = -1;
+ // solve the problem
+ RetValue = sat_solver2_solve( pSat, NULL, NULL, (ABC_INT64_T)nConfMax, (ABC_INT64_T)0, (ABC_INT64_T)0, (ABC_INT64_T)0 );
+ if ( RetValue == l_Undef )
+ {
+ printf( "Conflict limit is reached.\n" );
+ return NULL;
+ }
+ if ( RetValue == l_True )
+ {
+ printf( "The BMC problem is SAT.\n" );
+ if ( piRetValue )
+ *piRetValue = 0;
+ return NULL;
+ }
+ if ( fVerbose )
+ {
+ printf( "SAT solver returned UNSAT after %7d conflicts. ", pSat->stats.conflicts );
+ Abc_PrintTime( 1, "Time", clock() - clk );
+ }
+ assert( RetValue == l_False );
+
+ // derive the UNSAT core
+ clk = clock();
+ vCore = Sat_ProofCore( pSat );
+ if ( fVerbose )
+ {
+ printf( "SAT core contains %8d clauses (out of %8d). ", Vec_IntSize(vCore), sat_solver2_nclauses(pSat) );
+ Abc_PrintTime( 1, "Time", clock() - clk );
+ }
+ return vCore;
+}
+
+/**Function*************************************************************
+
+ Synopsis [Collects abstracted objects.]
+
+ Description []
+
+ SideEffects []
+
+ SeeAlso []
+
+***********************************************************************/
+Vec_Int_t * Aig_Gla3ManCollect( Aig_Gla3Man_t * p, Vec_Int_t * vCore )
+{
+ Vec_Int_t * vResult;
+ Aig_Obj_t * pObj;
+ int i, ClaId, iVecId;
+// p->vVec2Use = Vec_IntStart( Vec_IntSize(p->vVec2Var) );
+
+ vResult = Vec_IntStart( Aig_ManObjNumMax(p->pAig) );
+ Vec_IntWriteEntry( vResult, 0, 1 ); // add const1
+ Vec_IntForEachEntry( vCore, ClaId, i )
+ {
+ pObj = Aig_ManObj( p->pAig, Vec_IntEntry(p->vCla2Obj, ClaId) );
+ if ( Saig_ObjIsPi(p->pAig, pObj) || Saig_ObjIsPo(p->pAig, pObj) || Aig_ObjIsConst1(pObj) )
+ continue;
+ assert( Saig_ObjIsLo(p->pAig, pObj) || Aig_ObjIsNode(pObj) );
+ Vec_IntWriteEntry( vResult, Aig_ObjId(pObj), 1 );
+ if ( p->vVec2Use )
+ {
+ iVecId = Vec_IntEntry( p->vObj2Vec, Aig_ObjId(pObj) );
+ Vec_IntWriteEntry( p->vVec2Use, iVecId * p->nFramesMax + Vec_IntEntry(p->vCla2Fra, ClaId), 1 );
+ }
+ }
+ // count the number of objects in each frame
+ if ( p->vVec2Use )
+ {
+ Vec_Int_t * vCounts = Vec_IntStart( p->nFramesMax );
+ int v, f, Entry, nVecIds = Vec_IntSize(p->vVec2Use) / p->nFramesMax;
+ for ( f = 0; f < p->nFramesMax; f++ )
+ for ( v = 0; v < nVecIds; v++ )
+ if ( Vec_IntEntry( p->vVec2Use, v * p->nFramesMax + f ) )
+ Vec_IntAddToEntry( vCounts, f, 1 );
+ Vec_IntForEachEntry( vCounts, Entry, f )
+ printf( "%d ", Entry );
+ printf( "\n" );
+ Vec_IntFree( vCounts );
+ }
+ return vResult;
+}
+
+/**Function*************************************************************
+
+ Synopsis [Performs gate-level localization abstraction.]
+
+ Description [Returns array of objects included in the abstraction. This array
+ may contain only const1, flop outputs, and internal nodes, that is, objects
+ that should have clauses added to the SAT solver.]
+
+ SideEffects []
+
+ SeeAlso []
+
+***********************************************************************/
+Vec_Int_t * Aig_Gla3ManPerform( Aig_Man_t * pAig, int nStart, int nFramesMax, int nConfLimit, int TimeLimit, int fSkipRand, int fVerbose )
+{
+ Aig_Gla3Man_t * p;
+ Vec_Int_t * vCore, * vResult;
+ int nTimeToStop = time(NULL) + TimeLimit;
+ int clk, clk2 = clock();
+ assert( Saig_ManPoNum(pAig) == 1 );
+
+ if ( fVerbose )
+ {
+ if ( TimeLimit )
+ printf( "Abstracting from frame %d to frame %d with timeout %d sec.\n", nStart, nFramesMax, TimeLimit );
+ else
+ printf( "Abstracting from frame %d to frame %d with no timeout.\n", nStart, nFramesMax );
+ }
+
+ // start the solver
+ clk = clock();
+ p = Aig_Gla3ManStart( pAig, nStart, nFramesMax, fVerbose );
+ if ( !Aig_Gla3CreateSatSolver( p ) )
+ {
+ printf( "Error! SAT solver became UNSAT.\n" );
+ Aig_Gla3ManStop( p );
+ return NULL;
+ }
+ sat_solver2_set_random( p->pSat, fSkipRand );
+ p->timePre += clock() - clk;
+
+ // set runtime limit
+ if ( TimeLimit )
+ sat_solver2_set_runtime_limit( p->pSat, nTimeToStop );
+
+ // compute UNSAT core
+ clk = clock();
+ vCore = Aig_Gla3ManUnsatCore( p->pSat, nConfLimit, fVerbose, NULL );
+ if ( vCore == NULL )
+ {
+ Aig_Gla3ManStop( p );
+ return NULL;
+ }
+ p->timeSat += clock() - clk;
+ p->timeTotal += clock() - clk2;
+
+ // print stats
+ if ( fVerbose )
+ {
+ ABC_PRTP( "Pre ", p->timePre, p->timeTotal );
+ ABC_PRTP( "Sat ", p->timeSat, p->timeTotal );
+ ABC_PRTP( "Total ", p->timeTotal, p->timeTotal );
+ }
+
+ // prepare return value
+ vResult = Aig_Gla3ManCollect( p, vCore );
+ Vec_IntFree( vCore );
+ Aig_Gla3ManStop( p );
+ return vResult;
+}
+
+////////////////////////////////////////////////////////////////////////
+/// END OF FILE ///
+////////////////////////////////////////////////////////////////////////
+
+
+ABC_NAMESPACE_IMPL_END
+
generated by cgit v1.2.3 (git 2.25.1) at 2024-08-19 02:21:17 +0000