7 files changed, 13 insertions, 13 deletions
diff --git a/src/proof/acec/acecFadds.c b/src/proof/acec/acecFadds.c
index 7f6dcd53..d55eefe2 100644
--- a/src/proof/acec/acecFadds.c
+++ b/src/proof/acec/acecFadds.c
@@ -438,10 +438,10 @@ Vec_Int_t * Gia_ManDetectFullAdders( Gia_Man_t * p, int fVerbose, Vec_Int_t ** p
 {
     Vec_Int_t * vCutsXor, * vCutsMaj, * vFadds;
     Dtc_ManComputeCuts( p, pvCutsXor2, &vCutsXor, &vCutsMaj, fVerbose );
-    qsort( Vec_IntArray(vCutsXor), Vec_IntSize(vCutsXor)/4, 16, (int (*)(const void *, const void *))Dtc_ManCompare );
-    qsort( Vec_IntArray(vCutsMaj), Vec_IntSize(vCutsMaj)/4, 16, (int (*)(const void *, const void *))Dtc_ManCompare );
+    qsort( Vec_IntArray(vCutsXor), (size_t)(Vec_IntSize(vCutsXor)/4), 16, (int (*)(const void *, const void *))Dtc_ManCompare );
+    qsort( Vec_IntArray(vCutsMaj), (size_t)(Vec_IntSize(vCutsMaj)/4), 16, (int (*)(const void *, const void *))Dtc_ManCompare );
     vFadds = Dtc_ManFindCommonCuts( p, vCutsXor, vCutsMaj );
-    qsort( Vec_IntArray(vFadds), Vec_IntSize(vFadds)/5, 20, (int (*)(const void *, const void *))Dtc_ManCompare2 );
+    qsort( Vec_IntArray(vFadds), (size_t)(Vec_IntSize(vFadds)/5), 20, (int (*)(const void *, const void *))Dtc_ManCompare2 );
     if ( fVerbose )
         printf( "XOR3 cuts = %d.  MAJ cuts = %d.  Full-adders = %d.\n", Vec_IntSize(vCutsXor)/4, Vec_IntSize(vCutsMaj)/4, Vec_IntSize(vFadds)/5 );
     if ( fVerbose )
diff --git a/src/proof/acec/acecPo.c b/src/proof/acec/acecPo.c
index 91f6d5aa..36362efc 100644
--- a/src/proof/acec/acecPo.c
+++ b/src/proof/acec/acecPo.c
@@ -361,7 +361,7 @@ Vec_Wec_t * Gia_PolynGetResult( Hsh_VecMan_t * pHashC, Hsh_VecMan_t * pHashM, Ve
     Vec_WecForEachLevel( vSorted, vClass, i )
     {
         // sort monomials by the index of the first variable
-        qsort( Vec_IntArray(vClass), Vec_IntSize(vClass)/3, 12, (int (*)(const void *, const void *))Gia_PolynGetResultCompare );
+        qsort( Vec_IntArray(vClass), (size_t)(Vec_IntSize(vClass)/3), 12, (int (*)(const void *, const void *))Gia_PolynGetResultCompare );
         Vec_IntForEachEntryTriple( vClass, iConst, iMono, iFirst, k )
         {
             vArray = Hsh_VecReadEntry( pHashC, iConst );
diff --git a/src/proof/acec/acecPolyn.c b/src/proof/acec/acecPolyn.c
index 53ddf710..9fcc0136 100644
--- a/src/proof/acec/acecPolyn.c
+++ b/src/proof/acec/acecPolyn.c
@@ -139,7 +139,7 @@ void Pln_ManPrintFinal( Pln_Man_t * p, int fVerbose, int fVeryVerbose )
         Vec_IntPushTwo( vPairs, iConst, iMono );
     }
     // sort triples
-    qsort( Vec_IntArray(vPairs), Vec_IntSize(vPairs)/4, 16, (int (*)(const void *, const void *))Pln_ManCompare3 );
+    qsort( Vec_IntArray(vPairs), (size_t)(Vec_IntSize(vPairs)/4), 16, (int (*)(const void *, const void *))Pln_ManCompare3 );
     // print
     if ( fVerbose )
     Vec_IntForEachEntryDouble( vPairs, iConst, iMono, i )
diff --git a/src/proof/acec/acecPool.c b/src/proof/acec/acecPool.c
index 0868545e..49b7ce39 100644
--- a/src/proof/acec/acecPool.c
+++ b/src/proof/acec/acecPool.c
@@ -223,8 +223,8 @@ void Acec_ManCollectInsOuts( Gia_Man_t * p, Vec_Int_t * vAdds, Vec_Int_t * vBoxe
     Vec_IntForEachEntryDouble( vResOuts, iObj, Rank, k )
         Vec_IntWriteEntry( vResOuts, k+1, 1 + RankMax - Rank );
     // sort by rank
-    qsort( Vec_IntArray(vResIns),  Vec_IntSize(vResIns)/2,  8, (int (*)(const void *, const void *))Acec_ManCompareTwo );
-    qsort( Vec_IntArray(vResOuts), Vec_IntSize(vResOuts)/2, 8, (int (*)(const void *, const void *))Acec_ManCompareTwo );
+    qsort( Vec_IntArray(vResIns),  (size_t)(Vec_IntSize(vResIns)/2),  8, (int (*)(const void *, const void *))Acec_ManCompareTwo );
+    qsort( Vec_IntArray(vResOuts), (size_t)(Vec_IntSize(vResOuts)/2), 8, (int (*)(const void *, const void *))Acec_ManCompareTwo );
 }
 void Acec_ManCollectBoxSets_rec( Gia_Man_t * p, int Carry, int iRank, Vec_Int_t * vAdds, Vec_Int_t * vCarryMap, Vec_Int_t * vBoxes, Vec_Int_t * vBoxRanks )
 {
diff --git a/src/proof/acec/acecRe.c b/src/proof/acec/acecRe.c
index 5e5ca688..785058db 100644
--- a/src/proof/acec/acecRe.c
+++ b/src/proof/acec/acecRe.c
@@ -442,7 +442,7 @@ Vec_Int_t * Ree_ManComputeCuts( Gia_Man_t * p, Vec_Int_t ** pvXors, int fVerbose
     Vec_IntFree( vTemp );
     Vec_IntFree( vCuts );
     vAdds = Ree_ManDeriveAdds( pHash, vData, fVerbose );
-    qsort( Vec_IntArray(vAdds), Vec_IntSize(vAdds)/6, 24, (int (*)(const void *, const void *))Ree_ManCompare );
+    qsort( Vec_IntArray(vAdds), (size_t)(Vec_IntSize(vAdds)/6), 24, (int (*)(const void *, const void *))Ree_ManCompare );
     if ( fVerbose )
         printf( "Adders = %d.  Total cuts = %d.  Hashed cuts = %d.  Hashed/Adders = %.2f.\n", 
             Vec_IntSize(vAdds)/6, Vec_IntSize(vData)/3, Hash_IntManEntryNum(pHash), 6.0*Hash_IntManEntryNum(pHash)/Vec_IntSize(vAdds) );
diff --git a/src/proof/fra/fraImp.c b/src/proof/fra/fraImp.c
index 027d8eb2..4581e0a1 100644
--- a/src/proof/fra/fraImp.c
+++ b/src/proof/fra/fraImp.c
@@ -395,7 +395,7 @@ finish:
     }
     Vec_PtrFree( vNodes );
     // reorder implications topologically
-    qsort( (void *)Vec_IntArray(vImps), Vec_IntSize(vImps), sizeof(int), 
+    qsort( (void *)Vec_IntArray(vImps), (size_t)Vec_IntSize(vImps), sizeof(int), 
             (int (*)(const void *, const void *)) Sml_CompareMaxId );
 if ( p->pPars->fVerbose )
 {
diff --git a/src/proof/fraig/fraigVec.c b/src/proof/fraig/fraigVec.c
index 25d50bf3..5670c112 100644
--- a/src/proof/fraig/fraigVec.c
+++ b/src/proof/fraig/fraigVec.c
@@ -501,10 +501,10 @@ int Fraig_NodeVecCompareRefCounts( Fraig_Node_t ** pp1, Fraig_Node_t ** pp2 )
 void Fraig_NodeVecSortByLevel( Fraig_NodeVec_t * p, int fIncreasing )
 {
     if ( fIncreasing )
-        qsort( (void *)p->pArray, p->nSize, sizeof(Fraig_Node_t *), 
+        qsort( (void *)p->pArray, (size_t)p->nSize, sizeof(Fraig_Node_t *), 
                 (int (*)(const void *, const void *)) Fraig_NodeVecCompareLevelsIncreasing );
     else 
-        qsort( (void *)p->pArray, p->nSize, sizeof(Fraig_Node_t *), 
+        qsort( (void *)p->pArray, (size_t)p->nSize, sizeof(Fraig_Node_t *), 
                 (int (*)(const void *, const void *)) Fraig_NodeVecCompareLevelsDecreasing );
 }
 
@@ -521,7 +521,7 @@ void Fraig_NodeVecSortByLevel( Fraig_NodeVec_t * p, int fIncreasing )
 ***********************************************************************/
 void Fraig_NodeVecSortByNumber( Fraig_NodeVec_t * p )
 {
-    qsort( (void *)p->pArray, p->nSize, sizeof(Fraig_Node_t *), 
+    qsort( (void *)p->pArray, (size_t)p->nSize, sizeof(Fraig_Node_t *), 
             (int (*)(const void *, const void *)) Fraig_NodeVecCompareNumbers );
 }
 
@@ -538,7 +538,7 @@ void Fraig_NodeVecSortByNumber( Fraig_NodeVec_t * p )
 ***********************************************************************/
 void Fraig_NodeVecSortByRefCount( Fraig_NodeVec_t * p )
 {
-    qsort( (void *)p->pArray, p->nSize, sizeof(Fraig_Node_t *), 
+    qsort( (void *)p->pArray, (size_t)p->nSize, sizeof(Fraig_Node_t *), 
             (int (*)(const void *, const void *)) Fraig_NodeVecCompareRefCounts );
 }