Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
A
abc
Overview
Overview
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
lvzhengyang
abc
Commits
6ff66ed4
Commit
6ff66ed4
authored
Aug 16, 2017
by
Alan Mishchenko
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Changing enconding of the SAT solver return value in &bmcs.
parent
443776fe
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
11 additions
and
5 deletions
+11
-5
src/sat/bmc/bmcBmcS.c
+11
-5
No files found.
src/sat/bmc/bmcBmcS.c
View file @
6ff66ed4
...
@@ -28,13 +28,19 @@
...
@@ -28,13 +28,19 @@
#ifdef ABC_USE_EXT_SOLVERS
#ifdef ABC_USE_EXT_SOLVERS
#include "extsat/bmc/bmcApi.h"
#include "extsat/bmc/bmcApi.h"
#define l_Undef -1
#define l_True 1
#define l_False 0
#else
#else
#define l_Undef 0
#define l_True 1
#define l_False -1
#define bmc_sat_solver satoko_t
#define bmc_sat_solver satoko_t
#define bmc_sat_solver_start(type) satoko_create()
#define bmc_sat_solver_start(type) satoko_create()
#define bmc_sat_solver_stop satoko_destroy
#define bmc_sat_solver_stop satoko_destroy
#define bmc_sat_solver_addclause satoko_add_clause
#define bmc_sat_solver_addclause satoko_add_clause
#define bmc_sat_solver_addvar(s) satoko_add_variable(s, 0)
#define bmc_sat_solver_addvar(s) satoko_add_variable(s, 0)
#define bmc_sat_solver_solve satoko_solve_
with_
assumptions
#define bmc_sat_solver_solve satoko_solve_assumptions
#define bmc_sat_solver_read_cex_varvalue solver_read_cex_varvalue
#define bmc_sat_solver_read_cex_varvalue solver_read_cex_varvalue
#define bmc_sat_solver_setstop solver_set_stop
#define bmc_sat_solver_setstop solver_set_stop
#endif
#endif
...
@@ -635,7 +641,7 @@ int Bmcs_ManPerformOne( Gia_Man_t * pGia, Bmc_AndPar_t * pPars )
...
@@ -635,7 +641,7 @@ int Bmcs_ManPerformOne( Gia_Man_t * pGia, Bmc_AndPar_t * pPars )
if
(
pPars
->
nTimeOut
&&
(
Abc_Clock
()
-
clkStart
)
/
CLOCKS_PER_SEC
>=
pPars
->
nTimeOut
)
if
(
pPars
->
nTimeOut
&&
(
Abc_Clock
()
-
clkStart
)
/
CLOCKS_PER_SEC
>=
pPars
->
nTimeOut
)
break
;
break
;
status
=
bmc_sat_solver_solve
(
p
->
pSats
[
0
],
&
iLit
,
1
);
status
=
bmc_sat_solver_solve
(
p
->
pSats
[
0
],
&
iLit
,
1
);
if
(
status
==
1
)
// unsat
if
(
status
==
l_False
)
// unsat
{
{
if
(
i
==
Gia_ManPoNum
(
pGia
)
-
1
)
if
(
i
==
Gia_ManPoNum
(
pGia
)
-
1
)
Bmcs_ManPrintFrame
(
p
,
f
+
k
,
nClauses
,
-
1
,
clkStart
);
Bmcs_ManPrintFrame
(
p
,
f
+
k
,
nClauses
,
-
1
,
clkStart
);
...
@@ -643,7 +649,7 @@ int Bmcs_ManPerformOne( Gia_Man_t * pGia, Bmc_AndPar_t * pPars )
...
@@ -643,7 +649,7 @@ int Bmcs_ManPerformOne( Gia_Man_t * pGia, Bmc_AndPar_t * pPars )
pPars
->
pFuncOnFrameDone
(
f
+
k
,
i
,
0
);
pPars
->
pFuncOnFrameDone
(
f
+
k
,
i
,
0
);
continue
;
continue
;
}
}
if
(
status
==
0
)
// sat
if
(
status
==
l_True
)
// sat
{
{
RetValue
=
0
;
RetValue
=
0
;
pPars
->
iFrame
=
f
+
k
;
pPars
->
iFrame
=
f
+
k
;
...
@@ -820,7 +826,7 @@ int Bmcs_ManPerformMulti( Gia_Man_t * pGia, Bmc_AndPar_t * pPars )
...
@@ -820,7 +826,7 @@ int Bmcs_ManPerformMulti( Gia_Man_t * pGia, Bmc_AndPar_t * pPars )
if
(
pPars
->
nTimeOut
&&
(
Abc_Clock
()
-
clkStart
)
/
CLOCKS_PER_SEC
>=
pPars
->
nTimeOut
)
if
(
pPars
->
nTimeOut
&&
(
Abc_Clock
()
-
clkStart
)
/
CLOCKS_PER_SEC
>=
pPars
->
nTimeOut
)
break
;
break
;
status
=
Bmcs_ManPerform_Solve
(
p
,
iLit
,
WorkerThread
,
ThData
,
pPars
->
nProcs
,
&
Solver
);
status
=
Bmcs_ManPerform_Solve
(
p
,
iLit
,
WorkerThread
,
ThData
,
pPars
->
nProcs
,
&
Solver
);
if
(
status
==
1
)
// unsat
if
(
status
==
l_False
)
// unsat
{
{
if
(
i
==
Gia_ManPoNum
(
pGia
)
-
1
)
if
(
i
==
Gia_ManPoNum
(
pGia
)
-
1
)
Bmcs_ManPrintFrame
(
p
,
f
+
k
,
nClauses
,
Solver
,
clkStart
);
Bmcs_ManPrintFrame
(
p
,
f
+
k
,
nClauses
,
Solver
,
clkStart
);
...
@@ -828,7 +834,7 @@ int Bmcs_ManPerformMulti( Gia_Man_t * pGia, Bmc_AndPar_t * pPars )
...
@@ -828,7 +834,7 @@ int Bmcs_ManPerformMulti( Gia_Man_t * pGia, Bmc_AndPar_t * pPars )
pPars
->
pFuncOnFrameDone
(
f
+
k
,
i
,
0
);
pPars
->
pFuncOnFrameDone
(
f
+
k
,
i
,
0
);
continue
;
continue
;
}
}
if
(
status
==
0
)
// sat
if
(
status
==
l_True
)
// sat
{
{
RetValue
=
0
;
RetValue
=
0
;
pPars
->
iFrame
=
f
+
k
;
pPars
->
iFrame
=
f
+
k
;
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment