diff options
| author | Alan Mishchenko <alanmi@berkeley.edu> | 2007-02-17 08:01:00 -0800 |
|---|---|---|
| committer | Alan Mishchenko <alanmi@berkeley.edu> | 2007-02-17 08:01:00 -0800 |
| commit | 50e0d1dea52e73d9646de4869fceb57c10553e6d (patch) | |
| tree | ac127adabc40727ca8f6bca07242fea38322c69e /src/base/abci/abcUnreach.c | |
| parent | 607c253cd2712bacce21ca9b98a848f331ea03a9 (diff) | |
| download | abc-50e0d1dea52e73d9646de4869fceb57c10553e6d.tar.gz abc-50e0d1dea52e73d9646de4869fceb57c10553e6d.tar.bz2 abc-50e0d1dea52e73d9646de4869fceb57c10553e6d.zip | |
Version abc70217
Diffstat (limited to 'src/base/abci/abcUnreach.c')
| -rw-r--r-- | src/base/abci/abcUnreach.c | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/src/base/abci/abcUnreach.c b/src/base/abci/abcUnreach.c index 7697fde1..ea0a4cd2 100644 --- a/src/base/abci/abcUnreach.c +++ b/src/base/abci/abcUnreach.c @@ -62,7 +62,7 @@ int Abc_NtkExtractSequentialDcs( Abc_Ntk_t * pNtk, bool fVerbose ) if ( dd == NULL ) return 0; if ( fVerbose ) - printf( "The shared BDD size is %d nodes.\n", Cudd_ReadKeys(dd) - Cudd_ReadDead(dd) ); + printf( "Shared BDD size = %6d nodes.\n", Cudd_ReadKeys(dd) - Cudd_ReadDead(dd) ); // create the transition relation (dereferenced global BDDs) bRelation = Abc_NtkTransitionRelation( dd, pNtk, fVerbose ); Cudd_Ref( bRelation ); @@ -221,7 +221,7 @@ DdNode * Abc_NtkComputeUnreachable( DdManager * dd, Abc_Ntk_t * pNtk, DdNode * b { DdNode * bRelation, * bReached, * bCubeCs; DdNode * bCurrent, * bNext, * bTemp; - int nIters; + int nIters, nMints; // perform reachability analisys bCurrent = bInitial; Cudd_Ref( bCurrent ); @@ -258,9 +258,9 @@ DdNode * Abc_NtkComputeUnreachable( DdManager * dd, Abc_Ntk_t * pNtk, DdNode * b // report the stats if ( fVerbose ) { - fprintf( stdout, "Reachability analysis completed in %d iterations.\n", nIters ); - fprintf( stdout, "The number of minterms in the reachable state set = %d.\n", - (int)Cudd_CountMinterm(dd, bReached, Abc_NtkLatchNum(pNtk) ) ); + nMints = (int)Cudd_CountMinterm(dd, bReached, Abc_NtkLatchNum(pNtk) ); + fprintf( stdout, "Reachability analysis completed in %d iterations.\n", nIters ); + fprintf( stdout, "The number of minterms in the reachable state set = %d. (%6.2f %%)\n", nMints, 100.0*nMints/(1<<Abc_NtkLatchNum(pNtk)) ); } //PRB( dd, bReached ); Cudd_Deref( bReached ); |