Commit cf539dcc by Alan Mishchenko

Fix mismatch in output formatting.

parent a28be94a
...@@ -1111,12 +1111,12 @@ int Ssw_SecSpecial( Aig_Man_t * pPart0, Aig_Man_t * pPart1, int nFrames, int fVe ...@@ -1111,12 +1111,12 @@ int Ssw_SecSpecial( Aig_Man_t * pPart0, Aig_Man_t * pPart1, int nFrames, int fVe
// report the miter // report the miter
if ( RetValue == 1 ) if ( RetValue == 1 )
{ {
printf( "Networks are equivalent. " ); printf( "Networks are equivalent. " );
ABC_PRT( "Time", Abc_Clock() - clkTotal ); ABC_PRT( "Time", Abc_Clock() - clkTotal );
} }
else if ( RetValue == 0 ) else if ( RetValue == 0 )
{ {
printf( "Networks are NOT EQUIVALENT. " ); printf( "Networks are NOT EQUIVALENT. " );
ABC_PRT( "Time", Abc_Clock() - clkTotal ); ABC_PRT( "Time", Abc_Clock() - clkTotal );
if ( pMiterCec->pData == NULL ) if ( pMiterCec->pData == NULL )
printf( "Counter-example is not available.\n" ); printf( "Counter-example is not available.\n" );
......
...@@ -1946,17 +1946,17 @@ finish: ...@@ -1946,17 +1946,17 @@ finish:
// report the miter // report the miter
if ( RetValue == 1 ) if ( RetValue == 1 )
{ {
Abc_Print( 1, "Networks are equivalent. " ); Abc_Print( 1, "Networks are equivalent. " );
ABC_PRT( "Time", Abc_Clock() - clkTotal ); ABC_PRT( "Time", Abc_Clock() - clkTotal );
} }
else if ( RetValue == 0 ) else if ( RetValue == 0 )
{ {
Abc_Print( 1, "Networks are NOT EQUIVALENT. " ); Abc_Print( 1, "Networks are NOT EQUIVALENT. " );
ABC_PRT( "Time", Abc_Clock() - clkTotal ); ABC_PRT( "Time", Abc_Clock() - clkTotal );
} }
else else
{ {
Abc_Print( 1, "Networks are UNDECIDED. " ); Abc_Print( 1, "Networks are UNDECIDED. " );
ABC_PRT( "Time", Abc_Clock() - clkTotal ); ABC_PRT( "Time", Abc_Clock() - clkTotal );
} }
fflush( stdout ); fflush( stdout );
...@@ -3695,17 +3695,17 @@ int Abc_NtkDarInduction( Abc_Ntk_t * pNtk, int nTimeOut, int nFramesMax, int nCo ...@@ -3695,17 +3695,17 @@ int Abc_NtkDarInduction( Abc_Ntk_t * pNtk, int nTimeOut, int nFramesMax, int nCo
RetValue = Saig_ManInduction( pMan, nTimeOut, nFramesMax, nConfMax, fUnique, fUniqueAll, fGetCex, fVerbose, fVeryVerbose ); RetValue = Saig_ManInduction( pMan, nTimeOut, nFramesMax, nConfMax, fUnique, fUniqueAll, fGetCex, fVerbose, fVeryVerbose );
if ( RetValue == 1 ) if ( RetValue == 1 )
{ {
Abc_Print( 1, "Networks are equivalent. " ); Abc_Print( 1, "Networks are equivalent. " );
ABC_PRT( "Time", Abc_Clock() - clkTotal ); ABC_PRT( "Time", Abc_Clock() - clkTotal );
} }
else if ( RetValue == 0 ) else if ( RetValue == 0 )
{ {
Abc_Print( 1, "Networks are NOT EQUIVALENT. " ); Abc_Print( 1, "Networks are NOT EQUIVALENT. " );
ABC_PRT( "Time", Abc_Clock() - clkTotal ); ABC_PRT( "Time", Abc_Clock() - clkTotal );
} }
else else
{ {
Abc_Print( 1, "Networks are UNDECIDED. " ); Abc_Print( 1, "Networks are UNDECIDED. " );
ABC_PRT( "Time", Abc_Clock() - clkTotal ); ABC_PRT( "Time", Abc_Clock() - clkTotal );
} }
if ( fGetCex ) if ( fGetCex )
......
...@@ -85,7 +85,7 @@ int Cec_ManVerifyOld( Gia_Man_t * pMiter, int fVerbose, int * piOutFail, abctime ...@@ -85,7 +85,7 @@ int Cec_ManVerifyOld( Gia_Man_t * pMiter, int fVerbose, int * piOutFail, abctime
{ {
if ( !fSilent ) if ( !fSilent )
{ {
Abc_Print( 1, "Networks are equivalent. " ); Abc_Print( 1, "Networks are equivalent. " );
Abc_PrintTime( 1, "Time", Abc_Clock() - clkTotal ); Abc_PrintTime( 1, "Time", Abc_Clock() - clkTotal );
} }
} }
...@@ -93,7 +93,7 @@ int Cec_ManVerifyOld( Gia_Man_t * pMiter, int fVerbose, int * piOutFail, abctime ...@@ -93,7 +93,7 @@ int Cec_ManVerifyOld( Gia_Man_t * pMiter, int fVerbose, int * piOutFail, abctime
{ {
if ( !fSilent ) if ( !fSilent )
{ {
Abc_Print( 1, "Networks are NOT EQUIVALENT. " ); Abc_Print( 1, "Networks are NOT EQUIVALENT. " );
Abc_PrintTime( 1, "Time", Abc_Clock() - clkTotal ); Abc_PrintTime( 1, "Time", Abc_Clock() - clkTotal );
} }
if ( pMiterCec->pData == NULL ) if ( pMiterCec->pData == NULL )
...@@ -120,7 +120,7 @@ int Cec_ManVerifyOld( Gia_Man_t * pMiter, int fVerbose, int * piOutFail, abctime ...@@ -120,7 +120,7 @@ int Cec_ManVerifyOld( Gia_Man_t * pMiter, int fVerbose, int * piOutFail, abctime
} }
else if ( !fSilent ) else if ( !fSilent )
{ {
Abc_Print( 1, "Networks are UNDECIDED. " ); Abc_Print( 1, "Networks are UNDECIDED. " );
Abc_PrintTime( 1, "Time", Abc_Clock() - clkTotal ); Abc_PrintTime( 1, "Time", Abc_Clock() - clkTotal );
} }
fflush( stdout ); fflush( stdout );
......
...@@ -547,17 +547,17 @@ int Fra_FraigCecTop( Aig_Man_t * pMan1, Aig_Man_t * pMan2, int nConfLimit, int n ...@@ -547,17 +547,17 @@ int Fra_FraigCecTop( Aig_Man_t * pMan1, Aig_Man_t * pMan2, int nConfLimit, int n
// report the miter // report the miter
if ( RetValue == 1 ) if ( RetValue == 1 )
{ {
printf( "Networks are equivalent. " ); printf( "Networks are equivalent. " );
ABC_PRT( "Time", Abc_Clock() - clkTotal ); ABC_PRT( "Time", Abc_Clock() - clkTotal );
} }
else if ( RetValue == 0 ) else if ( RetValue == 0 )
{ {
printf( "Networks are NOT EQUIVALENT. " ); printf( "Networks are NOT EQUIVALENT. " );
ABC_PRT( "Time", Abc_Clock() - clkTotal ); ABC_PRT( "Time", Abc_Clock() - clkTotal );
} }
else else
{ {
printf( "Networks are UNDECIDED. " ); printf( "Networks are UNDECIDED. " );
ABC_PRT( "Time", Abc_Clock() - clkTotal ); ABC_PRT( "Time", Abc_Clock() - clkTotal );
} }
fflush( stdout ); fflush( stdout );
......
...@@ -606,7 +606,7 @@ finish: ...@@ -606,7 +606,7 @@ finish:
{ {
if ( !pParSec->fSilent ) if ( !pParSec->fSilent )
{ {
printf( "Networks are equivalent. " ); printf( "Networks are equivalent. " );
ABC_PRT( "Time", Abc_Clock() - clkTotal ); ABC_PRT( "Time", Abc_Clock() - clkTotal );
} }
if ( pParSec->fReportSolution && !pParSec->fRecursive ) if ( pParSec->fReportSolution && !pParSec->fRecursive )
...@@ -630,7 +630,7 @@ ABC_PRT( "Time", Abc_Clock() - clkTotal ); ...@@ -630,7 +630,7 @@ ABC_PRT( "Time", Abc_Clock() - clkTotal );
} }
if ( !pParSec->fSilent ) if ( !pParSec->fSilent )
{ {
printf( "Networks are NOT EQUIVALENT. " ); printf( "Networks are NOT EQUIVALENT. " );
ABC_PRT( "Time", Abc_Clock() - clkTotal ); ABC_PRT( "Time", Abc_Clock() - clkTotal );
} }
if ( pParSec->fReportSolution && !pParSec->fRecursive ) if ( pParSec->fReportSolution && !pParSec->fRecursive )
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment