1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
|
/**CFile****************************************************************
FileName [fraIndVer.c]
SystemName [ABC: Logic synthesis and verification system.]
PackageName [New FRAIG package.]
Synopsis [Verification of the inductive invariant.]
Author [Alan Mishchenko]
Affiliation [UC Berkeley]
Date [Ver. 1.0. Started - June 30, 2007.]
Revision [$Id: fraIndVer.c,v 1.00 2007/06/30 00:00:00 alanmi Exp $]
***********************************************************************/
#include "fra.h"
#include "cnf.h"
ABC_NAMESPACE_IMPL_START
////////////////////////////////////////////////////////////////////////
/// DECLARATIONS ///
////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////
/// FUNCTION DEFINITIONS ///
////////////////////////////////////////////////////////////////////////
/**Function*************************************************************
Synopsis [Verifies the inductive invariant.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
int Fra_InvariantVerify( Aig_Man_t * pAig, int nFrames, Vec_Int_t * vClauses, Vec_Int_t * vLits )
{
Cnf_Dat_t * pCnf;
sat_solver * pSat;
int * pStart;
int RetValue, Beg, End, i, k;
int CounterBase = 0, CounterInd = 0;
int clk = clock();
if ( nFrames != 1 )
{
printf( "Invariant verification: Can only verify for K = 1\n" );
return 1;
}
// derive CNF
pCnf = Cnf_DeriveSimple( pAig, Aig_ManPoNum(pAig) );
/*
// add the property
{
Aig_Obj_t * pObj;
int Lits[1];
pObj = Aig_ManPo( pAig, 0 );
Lits[0] = toLitCond( pCnf->pVarNums[pObj->Id], 1 );
Vec_IntPush( vLits, Lits[0] );
Vec_IntPush( vClauses, Vec_IntSize(vLits) );
printf( "Added the target property to the set of clauses to be inductively checked.\n" );
}
*/
// derive initialized frames for the base case
pSat = (sat_solver *)Cnf_DataWriteIntoSolver( pCnf, nFrames, 1 );
// check clauses in the base case
Beg = 0;
pStart = Vec_IntArray( vLits );
Vec_IntForEachEntry( vClauses, End, i )
{
// complement the literals
for ( k = Beg; k < End; k++ )
pStart[k] = lit_neg(pStart[k]);
RetValue = sat_solver_solve( pSat, pStart + Beg, pStart + End, 0, 0, 0, 0 );
for ( k = Beg; k < End; k++ )
pStart[k] = lit_neg(pStart[k]);
Beg = End;
if ( RetValue == l_False )
continue;
// printf( "Clause %d failed the base case.\n", i );
CounterBase++;
}
sat_solver_delete( pSat );
// derive initialized frames for the base case
pSat = (sat_solver *)Cnf_DataWriteIntoSolver( pCnf, nFrames + 1, 0 );
assert( pSat->size == 2 * pCnf->nVars );
// add clauses to the first frame
Beg = 0;
pStart = Vec_IntArray( vLits );
Vec_IntForEachEntry( vClauses, End, i )
{
RetValue = sat_solver_addclause( pSat, pStart + Beg, pStart + End );
Beg = End;
if ( RetValue == 0 )
{
Cnf_DataFree( pCnf );
sat_solver_delete( pSat );
printf( "Invariant verification: SAT solver is unsat after adding a clause.\n" );
return 0;
}
}
// simplify the solver
if ( pSat->qtail != pSat->qhead )
{
RetValue = sat_solver_simplify(pSat);
assert( RetValue != 0 );
assert( pSat->qtail == pSat->qhead );
}
// check clauses in the base case
Beg = 0;
pStart = Vec_IntArray( vLits );
Vec_IntForEachEntry( vClauses, End, i )
{
// complement the literals
for ( k = Beg; k < End; k++ )
{
pStart[k] += 2 * pCnf->nVars;
pStart[k] = lit_neg(pStart[k]);
}
RetValue = sat_solver_solve( pSat, pStart + Beg, pStart + End, 0, 0, 0, 0 );
for ( k = Beg; k < End; k++ )
{
pStart[k] = lit_neg(pStart[k]);
pStart[k] -= 2 * pCnf->nVars;
}
Beg = End;
if ( RetValue == l_False )
continue;
// printf( "Clause %d failed the inductive case.\n", i );
CounterInd++;
}
sat_solver_delete( pSat );
Cnf_DataFree( pCnf );
if ( CounterBase )
printf( "Invariant verification: %d clauses (out of %d) FAILED the base case.\n", CounterBase, Vec_IntSize(vClauses) );
if ( CounterInd )
printf( "Invariant verification: %d clauses (out of %d) FAILED the inductive case.\n", CounterInd, Vec_IntSize(vClauses) );
if ( CounterBase || CounterInd )
return 0;
printf( "Invariant verification: %d clauses verified correctly. ", Vec_IntSize(vClauses) );
ABC_PRT( "Time", clock() - clk );
return 1;
}
////////////////////////////////////////////////////////////////////////
/// END OF FILE ///
////////////////////////////////////////////////////////////////////////
ABC_NAMESPACE_IMPL_END
|
