Index: /issm/trunk-jpl/src/c/bamg/BamgVertex.cpp
===================================================================
--- /issm/trunk-jpl/src/c/bamg/BamgVertex.cpp	(revision 22252)
+++ /issm/trunk-jpl/src/c/bamg/BamgVertex.cpp	(revision 22253)
@@ -114,5 +114,5 @@
 		if ( t && (IndexInTriangle >= 0 ) && (IndexInTriangle <3) ){
 			ret = t->Optim(IndexInTriangle,koption);
-			if(!i){
+			if(i==0){
 				t =0; // for no future optim
 				IndexInTriangle= 0;
Index: /issm/trunk-jpl/src/c/bamg/Mesh.cpp
===================================================================
--- /issm/trunk-jpl/src/c/bamg/Mesh.cpp	(revision 22252)
+++ /issm/trunk-jpl/src/c/bamg/Mesh.cpp	(revision 22253)
@@ -2684,5 +2684,5 @@
 
 		//Intermediary
-		int i;
+		long i;
 		int verbose=0;
 
@@ -2727,5 +2727,7 @@
 		const long PrimeNumber= BigPrimeNumber(nbv);
 		long k0=this->RandomNumber(nbv);
-
+		if (verbose>4) _printf_("      Prime Number = "<<PrimeNumber<<"\n");
+		if (verbose>4) _printf_("      k0 = "<<k0<<"\n");
+		
 		//Build orderedvertices
 		for (i=0; i<nbv; i++){
@@ -2741,4 +2743,5 @@
 			if  (++i>=nbv) _error_("all the vertices are aligned");
 		}
+		if (verbose>4) _printf_("      i = "<<i<<"\n");
 		// exchange i et 2 in "orderedvertices" so that
 		// the first 3 vertices are not aligned (real triangle)
@@ -2783,6 +2786,7 @@
 		long NbSwap=0;
 		if (verbose>3) _printf_("   Begining of insertion process...\n");
-
-		for (int icount=2; icount<nbv; icount++) {
+		if (verbose>4) _printf_("      nbv = "<<nbv<<"\n");
+
+		for (long icount=2; icount<nbv; icount++) {
 
 			//Get new vertex