CGlucoseCore.h 18 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
// The code in this file was developed by He-Teng Zhang (National Taiwan University)

#ifndef Glucose_CGlucoseCore_h
#define Glucose_CGlucoseCore_h

/*
 * justification for glucose 
 */

#include "sat/glucose2/Options.h"
#include "sat/glucose2/Solver.h"

ABC_NAMESPACE_IMPL_START

namespace Gluco2 {
16
inline int  Solver::justUsage() const { return jftr; }
17 18 19

inline Lit  Solver::gateJustFanin(Var v) const {
	assert(v < nVars());
20
	assert(isJReason(v));
21 22


23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39
	lbool val0, val1;
	val0 = value(getFaninLit0(v));
	val1 = value(getFaninLit1(v));

	if(isAND(v)){
		// should be handled by conflict analysis before entering here
		assert( value(v) != l_False || l_True  != val0 || l_True  != val1 );

		if(val0 == l_False || val1 == l_False)
			return lit_Undef;

		// branch 
		if(val0 == l_True)
			return ~getFaninLit1(v);
		if(val1 == l_True)
			return ~getFaninLit0(v);

40 41
		//assert( jdata[v].act_fanin == activity[getFaninVar0(v)] || jdata[v].act_fanin == activity[getFaninVar1(v)] );
		//assert( jdata[v].act_fanin == (jdata[v].adir? activity[getFaninVar1(v)]: activity[getFaninVar0(v)]) );
42
		return maxActiveLit( ~getFaninLit0(v), ~getFaninLit1(v) );
43
		//return jdata[v].adir? ~getFaninLit1(v): ~getFaninLit0(v);
44 45 46 47 48 49 50 51 52 53 54 55
	} else { // xor scope
		// should be handled by conflict analysis before entering here
		assert( value(v) == l_Undef || value(v) != l_False || val0 == val1 );

		// both are assigned
		if( l_Undef != val0 && l_Undef != val1 )
			return lit_Undef;

		// should be handled by propagation before entering here
		assert( l_Undef == val0 && l_Undef == val1 );
		return maxActiveLit( getFaninPlt0(v), getFaninPlt1(v) );
	}
56 57 58 59
}


// a var should at most be enqueued one time
60
inline void Solver::pushJustQueue(Var v, int index){
61
	assert(v < nVars());
62
	assert(isJReason(v));
63 64 65 66

	if( ! isRoundWatch(v) )\
		return;

67
	var2NodeData[v].now = true;
68 69


70 71 72 73 74 75 76 77 78 79 80 81 82
	if( activity[getFaninVar1(v)] > activity[getFaninVar0(v)] )
		jheap.update( JustKey( activity[getFaninVar1(v)], v, index ) );
	else
		jheap.update( JustKey( activity[getFaninVar0(v)], v, index ) );
}

inline void Solver::uncheckedEnqueue2(Lit p, CRef from)
{
    //assert( isRoundWatch(var(p)) ); // inplace sorting guarantee this 
    assert(value(p) == l_Undef);
    assigns[var(p)] = lbool(!sign(p));
    vardata[var(p)] = mkVarData(from, decisionLevel());
    trail.push_(p);
83 84 85
}

inline void Solver::ResetJustData(bool fCleanMemory){
86 87
	jhead = 0;
	jheap .clear_( fCleanMemory );
88 89
}

90
inline Lit Solver::pickJustLit( int& index ){
91 92
	Var next = var_Undef;
	Lit jlit = lit_Undef;
93

94 95 96 97 98
	for( ; jhead < trail.size() ; jhead++ ){
		Var x = var(trail[jhead]);
		if( !decisionLevel() && !isRoundWatch(x) ) continue;
		if( isJReason(x) && l_Undef == value( getFaninVar0(x) ) && l_Undef == value( getFaninVar1(x) ) )
			pushJustQueue(x,jhead);
99
	}
100 101 102 103

	while( ! jheap.empty() ){
		next = jheap.removeMin(index);
		if( ! var2NodeData[next].now )
104 105
			continue; 

106
		assert(isJReason(next));
107 108
		if( lit_Undef != (jlit = gateJustFanin(next)) ){
			//assert( jheap.prev.key() == activity[getFaninVar0(next)] || jheap.prev.key() == activity[getFaninVar1(next)] );
109
			break;
110 111
		}
		gateAddJwatch(next,index);
112 113 114 115 116 117
	}

	return jlit;
}


118
inline void Solver::gateAddJwatch(Var v,int index){
119
	assert(v < nVars());
120
	assert(isJReason(v));
121 122 123 124 125

	lbool val0, val1;
	Var var0, var1;
	var0 = getFaninVar0(v);
	var1 = getFaninVar1(v);
126 127
	val0 = value(getFaninLit0(v));
	val1 = value(getFaninLit1(v));
128

129 130
	assert( !isAND(v) ||  l_False == val0 || l_False == val1  );
	assert(  isAND(v) || (l_Undef != val0 && l_Undef != val1) );
131

132
	if( (val0 == l_False && val1 == l_False) || !isAND(v) ){
133
		addJwatch(vardata[var0].level < vardata[var1].level? var0: var1, v, index);
134 135 136
		return;
	}

137
	addJwatch(l_False == val0? var0: var1, v, index);
138

139
	return;
140 141 142
}

inline void Solver::updateJustActivity( Var v ){
143 144 145 146 147
	if( ! var2NodeData[v].sort )
		inplace_sort(v);

	int nFanout = 0;
	for(Lit lfo = var2Fanout0[ v ]; nFanout < var2NodeData[v].sort; lfo = var2FanoutN[ toInt(lfo) ], nFanout ++ ){
148
		Var x = var(lfo);
149 150 151 152 153
		if( var2NodeData[x].now && jheap.inHeap(x) ){
			if( activity[getFaninVar1(x)] > activity[getFaninVar0(x)] )
				jheap.update( JustKey( activity[getFaninVar1(x)], x, jheap.data_attr(x) ) );
			else
				jheap.update( JustKey( activity[getFaninVar0(x)], x, jheap.data_attr(x) ) );
154 155 156 157 158
		}
	}
}


159 160 161 162
inline void Solver::addJwatch( Var host, Var member, int index ){
	assert(level(host) >= level(member));
	jnext[index] = jlevel[level(host)];
	jlevel[level(host)] = index;
163 164 165 166 167 168 169 170 171 172 173 174 175
}

/*
 * circuit propagation 
 */

inline void Solver::justCheck(){
	Lit lit;
	int i, nJustFail = 0;
	for(i=0; i<trail.size(); i++){
		Var      x  = var(trail[i]);
		if( ! isRoundWatch(x) )
			continue;
176
		if( !isJReason(x) )
177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244
			continue;
		if( lit_Undef != (lit = gateJustFanin(x)) ){
			printf("\t%8d is not justified (value=%d, level=%3d)\n", x, l_True == value(x)? 1: 0, vardata[x].level), nJustFail ++ ;

			assert(false);
		}
	}
	if( nJustFail )
		printf("%d just-fails\n", nJustFail);
}
/**
inline void Solver::delVarFaninLits( Var v ){
	if( toLit(~0) != getFaninLit0(v) ){
		if( toLit(~0) == var2FanoutP[ (v<<1) + 0 ] ){
			// head of linked-list 
			Lit root = mkLit(getFaninVar0(v));
			Lit next = var2FanoutN[ (v<<1) + 0 ];
			if( toLit(~0) != next ){
				assert( var2Fanout0[ toInt(root) ] == toLit((v<<1) + 0) );
				assert( var2FanoutP[ toInt(next) ] == toLit((v<<1) + 0) );
				var2Fanout0[ getFaninVar0(v) ] = next;
				var2FanoutP[ toInt(next) ] = toLit(~0);
			}
		} else {
			Lit prev = var2FanoutP[ (v<<1) + 0 ];
			Lit next = var2FanoutN[ (v<<1) + 0 ];
			if( toLit(~0) != next ){
				assert( var2FanoutN[ toInt(prev) ] == toLit((v<<1) + 0) );
				assert( var2FanoutP[ toInt(next) ] == toLit((v<<1) + 0) );
				var2FanoutN[ toInt(prev) ] = next;
				var2FanoutP[ toInt(next) ] = prev;
			}
		}
	}


	if( toLit(~0) != getFaninLit1(v) ){
		if( toLit(~0) == var2FanoutP[ (v<<1) + 1 ] ){
			// head of linked-list 
			Lit root = mkLit(getFaninVar1(v));
			Lit next = var2FanoutN[ (v<<1) + 1 ];
			if( toLit(~0) != next ){
				assert( var2Fanout0[ toInt(root) ] == toLit((v<<1) + 1) );
				assert( var2FanoutP[ toInt(next) ] == toLit((v<<1) + 1) );
				var2Fanout0[ getFaninVar1(v) ] = next;
				var2FanoutP[ toInt(next) ] = toLit(~0);
			}
		} else {
			Lit prev = var2FanoutP[ (v<<1) + 1 ];
			Lit next = var2FanoutN[ (v<<1) + 1 ];
			if( toLit(~0) != next ){
				assert( var2FanoutN[ toInt(prev) ] == toLit((v<<1) + 1) );
				assert( var2FanoutP[ toInt(next) ] == toLit((v<<1) + 1) );
				var2FanoutN[ toInt(prev) ] = next;
				var2FanoutP[ toInt(next) ] = prev;
			}
		}
	}

	var2FanoutP  [ (v<<1) + 0 ] = toLit(~0);
	var2FanoutP  [ (v<<1) + 1 ] = toLit(~0);
	var2FanoutN  [ (v<<1) + 0 ] = toLit(~0);
	var2FanoutN  [ (v<<1) + 1 ] = toLit(~0);
	var2FaninLits[ (v<<1) + 0 ] = toLit(~0);
	var2FaninLits[ (v<<1) + 1 ] = toLit(~0);
}
**/
inline void Solver::setVarFaninLits( Var v, Lit lit1, Lit lit2 ){
245
	assert( var(lit1) != var(lit2) );
246 247 248
	int mincap = var(lit1) < var(lit2)? var(lit2): var(lit1);
	mincap = (v < mincap? mincap: v) + 1;

249 250
	var2NodeData[ v ].lit0 = lit1;
	var2NodeData[ v ].lit1 = lit2;
251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268


	assert( toLit(~0) != lit1 && toLit(~0) != lit2 );

	var2FanoutN[ (v<<1) + 0 ] = var2Fanout0[ var(lit1) ];
	var2FanoutN[ (v<<1) + 1 ] = var2Fanout0[ var(lit2) ];
	var2Fanout0[ var(lit1) ] = toLit( (v<<1) + 0 );
	var2Fanout0[ var(lit2) ] = toLit( (v<<1) + 1 );

	//if( toLit(~0) != var2FanoutN[ (v<<1) + 0 ] )
	//	var2FanoutP[ toInt(var2FanoutN[ (v<<1) + 0 ]) ] = toLit((v<<1) + 0);

	//if( toLit(~0) != var2FanoutN[ (v<<1) + 1 ] )
	//	var2FanoutP[ toInt(var2FanoutN[ (v<<1) + 1 ]) ] = toLit((v<<1) + 1);
}


inline bool Solver::isTwoFanin( Var v ) const {
269 270
	Lit lit0 = var2NodeData[ v ].lit0;
	Lit lit1 = var2NodeData[ v ].lit1;
271 272
	assert( toLit(~0) == lit0 || var(lit0) < nVars() );
	assert( toLit(~0) == lit1 || var(lit1) < nVars() );
273
    lit0.x = lit1.x = 0; // suppress the warning - alanmi
274
	return toLit(~0) != var2NodeData[ v ].lit0 && toLit(~0) != var2NodeData[ v ].lit1;
275 276 277 278 279 280
}

// this implementation return the last conflict encountered
// which follows minisat concept
inline CRef Solver::gatePropagate( Lit p ){
	CRef confl = CRef_Undef, stats;
281
	if( justUsage() < 2 )
282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301
		return CRef_Undef;

	if( ! isRoundWatch(var(p)) )
		return CRef_Undef;

	if( ! isTwoFanin( var(p) ) )
		goto check_fanout;


	// check fanin consistency 
	if( CRef_Undef != (stats = gatePropagateCheckThis( var(p) )) ){
		confl = stats;
		if( l_True == value(var(p)) )
			return confl;
	}

	// check fanout consistency
check_fanout:
	assert( var(p) < var2Fanout0.size() );

302 303
	if( ! var2NodeData[var(p)].sort )
		inplace_sort(var(p));
304

305 306 307
	int nFanout = 0;
	for( Lit lfo = var2Fanout0[ var(p) ]; nFanout < var2NodeData[var(p)].sort; lfo = var2FanoutN[ toInt(lfo) ], nFanout ++ )
	{
308 309 310 311 312 313 314 315 316 317 318 319 320
		if( CRef_Undef != (stats = gatePropagateCheckFanout( var(p), lfo )) ){
			confl = stats;
			if( l_True == value(var(lfo)) )
				return confl;
		}
	}

	return confl;
}

inline CRef Solver::gatePropagateCheckFanout( Var v, Lit lfo ){
	Lit faninLit = sign(lfo)? getFaninLit1(var(lfo)): getFaninLit0(var(lfo));
	assert( var(faninLit) == v );
321 322 323 324 325
	if( isAND(var(lfo)) ){
		if( l_False == value(faninLit) )
		{
			if( l_False == value(var(lfo)) )
				return CRef_Undef;
326

327 328 329
			if( l_True == value(var(lfo)) )
				return Var2CRef(var(lfo));
			
330 331
			var2NodeData[var(lfo)].dir = sign(lfo);
			uncheckedEnqueue2(~mkLit(var(lfo)), Var2CRef( var(lfo) ) );
332 333
		} else {
			assert( l_True == value(faninLit) );
334

335 336 337 338 339 340 341 342 343
			if( l_True == value(var(lfo)) )
				return CRef_Undef;
			
			// check value of the other fanin 
			Lit faninLitP = sign(lfo)? getFaninLit0(var(lfo)): getFaninLit1(var(lfo));
			if( l_False == value(var(lfo)) ){
				
				if( l_False == value(faninLitP) )
					return CRef_Undef;
344

345 346 347
				if( l_True == value(faninLitP) )
					return Var2CRef(var(lfo));

348
				uncheckedEnqueue2( ~faninLitP, Var2CRef( var(lfo) ) );
349 350 351
			}
			else
			if( l_True == value(faninLitP) )
352
				uncheckedEnqueue2( mkLit(var(lfo)), Var2CRef( var(lfo) ) );
353 354
		}
	} else { // xor scope
355 356 357
		// check value of the other fanin 
		Lit faninLitP = sign(lfo)? getFaninLit0(var(lfo)): getFaninLit1(var(lfo));

358 359 360 361
		lbool val0, val1, valo;
		val0 = value(faninLit );
		val1 = value(faninLitP);
		valo = value(var(lfo));
362

363 364 365 366
		if( l_Undef == val1 && l_Undef == valo )
			return CRef_Undef;
		else
		if( l_Undef == val1 )
367
			uncheckedEnqueue2( ~faninLitP ^ ( (l_True == val0) ^ (l_True == valo) ), Var2CRef( var(lfo) ) );
368 369
		else
		if( l_Undef == valo )
370
			uncheckedEnqueue2( ~mkLit( var(lfo), (l_True == val0) ^ (l_True == val1) ), Var2CRef( var(lfo) ) );
371
		else
372 373 374
		if( l_False  == (valo ^ (val0 == val1)) )
			return Var2CRef(var(lfo));

375
	}
376
	
377 378 379 380 381
	return CRef_Undef;
}

inline CRef Solver::gatePropagateCheckThis( Var v ){
	CRef confl = CRef_Undef;
382 383 384 385
	if( isAND(v) ){
		if( l_False == value(v) ){
			if( l_True == value(getFaninLit0(v)) && l_True == value(getFaninLit1(v)) )
				return Var2CRef(v);
386

387 388
			if( l_False == value(getFaninLit0(v)) || l_False == value(getFaninLit1(v)) )
				return CRef_Undef;
389

390
			if( l_True == value(getFaninLit0(v)) )
391
				uncheckedEnqueue2(~getFaninLit1( v ), Var2CRef( v ) );
392
			if( l_True == value(getFaninLit1(v)) )
393
				uncheckedEnqueue2(~getFaninLit0( v ), Var2CRef( v ) );
394 395 396 397
		} else {
			assert( l_True == value(v) );
			if( l_False == value(getFaninLit0(v)) || l_False == value(getFaninLit1(v)) )
				confl = Var2CRef(v);
398

399
			if( l_Undef == value( getFaninLit0( v )) )
400
				uncheckedEnqueue2( getFaninLit0( v ), Var2CRef( v ) );
401

402
			if( l_Undef == value( getFaninLit1( v )) )
403
				uncheckedEnqueue2( getFaninLit1( v ), Var2CRef( v ) );
404

405 406 407 408 409 410 411 412 413
		}
	} else { // xor scope
		lbool val0, val1, valo;
		val0 = value(getFaninLit0(v));
		val1 = value(getFaninLit1(v));
		valo = value(v);
		if( l_Undef == val0 && l_Undef == val1 )
			return CRef_Undef;
		if( l_Undef == val0 )
414
			uncheckedEnqueue2(~getFaninLit0( v ) ^ ( (l_True == val1) ^ (l_True == valo) ), Var2CRef( v ) );
415 416
		else
		if( l_Undef == val1 )
417
			uncheckedEnqueue2(~getFaninLit1( v ) ^ ( (l_True == val0) ^ (l_True == valo) ), Var2CRef( v ) );
418 419 420
		else
		if( l_False == (valo ^ (val0 == val1)) )
			return Var2CRef(v);
421 422 423 424 425 426 427 428 429 430 431
	}

	return confl;
}

inline CRef Solver::getConfClause( CRef r ){
	if( !isGateCRef(r) )
		return r;
	Var v = CRef2Var(r);
	assert( isTwoFanin(v) );

432 433 434 435 436 437 438 439 440 441 442
	if(isAND(v)){
		if( l_False == value(v) ){
			setItpcSize(3);
			Clause& c = ca[itpc];
			c[0] = mkLit(v);
			c[1] = ~getFaninLit0( v );
			c[2] = ~getFaninLit1( v );
		} else {
			setItpcSize(2);
			Clause& c = ca[itpc];
			c[0] = ~mkLit(v);
443

444 445
			lbool val0 = value(getFaninLit0(v));
			lbool val1 = value(getFaninLit1(v));
446

447 448 449 450 451 452 453
			if( l_False == val0 && l_False == val1 )
				c[1] = level(getFaninVar0(v)) < level(getFaninVar1(v))? getFaninLit0( v ): getFaninLit1( v );
			else
			if( l_False == val0 )
				c[1] = getFaninLit0( v );
			else
				c[1] = getFaninLit1( v );
454
		}
455 456 457 458 459 460
	} else { // xor scope
		setItpcSize(3);
		Clause& c = ca[itpc];
		c[0] = mkLit(v, l_True == value(v));
		c[1] = mkLit(getFaninVar0(v), l_True == value(getFaninVar0(v)));
		c[2] = mkLit(getFaninVar1(v), l_True == value(getFaninVar1(v)));
461
	}
462
	
463

464
	return itpc;
465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489
}

inline void Solver::setItpcSize( int sz ){
	assert( 3 >= sz );
	assert( CRef_Undef != itpc );
	ca[itpc].header.size = sz;
}

inline CRef Solver::interpret( Var v, Var t )
{ // get gate-clause on implication graph
	assert( isTwoFanin(v) );

	lbool val0, val1, valo;
	Var var0, var1;
	var0 = getFaninVar0( v );
	var1 = getFaninVar1( v );
	val0 = value(var0);
	val1 = value(var1);
	valo = value( v );

	// phased values
	if(l_Undef != val0) val0 = val0 ^ getFaninC0( v );
	if(l_Undef != val1) val1 = val1 ^ getFaninC1( v );


490 491 492 493 494 495 496
	if( isAND(v) ){
		if( v == t ){ // tracing output 
			if( l_False == valo ){
				setItpcSize(2);
				Clause& c = ca[itpc];
				c[0] = ~mkLit(v);

497
				c[1] = var2NodeData[v].dir ? getFaninLit1( v ): getFaninLit0( v );
498 499 500 501 502 503 504
			} else {
				setItpcSize(3);
				Clause& c = ca[itpc];
				c[0] = mkLit(v);
				c[1] = ~getFaninLit0( v );
				c[2] = ~getFaninLit1( v );
			}
505
		} else {
506 507 508 509 510 511 512 513 514 515 516 517 518 519 520
			assert( t == var0 || t == var1 );
			if( l_False == valo ){
				setItpcSize(3);
				Clause& c = ca[itpc];
				c[0] = ~getFaninLit0( v );
				c[1] = ~getFaninLit1( v );
				c[2] = mkLit(v);
				if( t == var1 )
	                c[1].x ^= c[0].x, c[0].x ^= c[1].x, c[1].x ^= c[0].x;
			} else {
				setItpcSize(2);
				Clause& c = ca[itpc];
				c[0] =  t == var0? getFaninLit0( v ): getFaninLit1( v );
				c[1] = ~mkLit(v);
			}
521
		}
522 523 524 525 526 527 528
	} else { // xor scope
		setItpcSize(3);
		Clause& c = ca[itpc];
		if( v == t ){
			c[0] = mkLit(v, l_False == value(v));
			c[1] = mkLit(var0, l_True == value(var0));
			c[2] = mkLit(var1, l_True == value(var1));
529
		} else {
530 531 532 533 534
			if( t == var0)
				c[0] = mkLit(var0, l_False == value(var0)), c[1] = mkLit(var1, l_True  == value(var1));
			else
				c[1] = mkLit(var0, l_True  == value(var0)), c[0] = mkLit(var1, l_False == value(var1));
			c[2] = mkLit(v, l_True == value(v));
535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554
		}
	}

	return itpc;
}

inline CRef Solver::castCRef( Lit p ){
	CRef cr = reason( var(p) );
	if( CRef_Undef == cr )
		return cr;
	if( ! isGateCRef(cr) )
		return cr;
	Var v = CRef2Var(cr);
	return interpret(v,var(p));
}

inline void Solver::markCone( Var v ){
	if( var2TravId[v] >= travId )
		return;
	var2TravId[v] = travId;
555 556 557 558
	var2NodeData[v].sort = 0;
	Var var0, var1;
	var0 = getFaninVar0(v);
	var1 = getFaninVar1(v);
559 560
	if( !isTwoFanin(v) )
		return;
561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613
	markCone( var0 );
	markCone( var1 );
}

inline void Solver::inplace_sort( Var v ){
	Lit w, next, prev;
	prev= var2Fanout0[v];

	if( toLit(~0) == prev ) return;

	if( isRoundWatch(var(prev)) )
		var2NodeData[v].sort ++ ;

	if( toLit(~0) == (w = var2FanoutN[toInt(prev)]) )
		return;

	while( toLit(~0) != w ){
		next = var2FanoutN[toInt(w)];
		if( isRoundWatch(var(w)) )
			var2NodeData[v].sort ++ ;
		if( isRoundWatch(var(w)) && !isRoundWatch(var(prev)) ){
			var2FanoutN[toInt(w)] = var2Fanout0[v];
			var2Fanout0[v] = w;
			var2FanoutN[toInt(prev)] = next;
		} else 
			prev = w;
		w = next;
	}
}

inline void Solver::prelocate( int base_var_num ){
	if( justUsage() ){
		var2FanoutN .prelocate( base_var_num << 1 );
		var2Fanout0 .prelocate( base_var_num );
		var2NodeData.prelocate( base_var_num );
		var2TravId  .prelocate( base_var_num );
		jheap       .prelocate( base_var_num );
		jlevel      .prelocate( base_var_num );
		jnext       .prelocate( base_var_num );
	}
	watches    .prelocate( base_var_num << 1 );
	watchesBin .prelocate( base_var_num << 1 );

	decision   .prelocate( base_var_num );
	trail      .prelocate( base_var_num );
	assigns    .prelocate( base_var_num );
	vardata    .prelocate( base_var_num );
	activity   .prelocate( base_var_num );


	seen       .prelocate( base_var_num );
	permDiff   .prelocate( base_var_num );
	polarity   .prelocate( base_var_num );
614 615
}

616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694

inline void Solver::markTill( Var v, int nlim ){
	if( var2TravId[v] == travId )
		return;

	vMarked.push(v);
	
	if( vMarked.size() >= nlim )
		return;
	if( var2TravId[v] == travId-1 || !isTwoFanin(v) )
		goto finalize;

	markTill( getFaninVar0(v), nlim );
	markTill( getFaninVar1(v), nlim );
finalize:
	var2TravId[v] = travId;
}

inline void Solver::markApprox( Var v0, Var v1, int nlim ){
    int i;
	if( travId <= 1 || nSkipMark>=4 || 0 == nlim )
		goto finalize;

	vMarked.shrink_( vMarked.size() );
	travId ++ ; // travId = t+1
	assert(travId>1);

	markTill(v0, nlim);
	if( vMarked.size() >= nlim )
		goto finalize;

	markTill(v1, nlim);
	if( vMarked.size() >= nlim )
		goto finalize;

	travId -- ; // travId = t
	for(i = 0; i < vMarked.size(); i ++){
		var2TravId  [ vMarked[i] ]      = travId;   // set new nodes to time t 
		var2NodeData[ vMarked[i] ].sort = 0;
	}
	nSkipMark ++ ;
	return;
finalize:

	travId ++ ;
	nSkipMark = 0;
	markCone(v0);
	markCone(v1);
}

inline void Solver::loadJust_rec( Var v ){
	//assert( value(v) != l_Undef );
	if( var2TravId[v] == travId || value(v) == l_Undef )
		return;
	assert( var2TravId[v] == travId-1 );
	var2TravId[v] = travId;
	vMarked.push(v);

	if( !isTwoFanin(v) ){
		JustModel.push( mkLit( v, value(v) == l_False ) );
		return;
	}
	loadJust_rec( getFaninVar0(v) );
	loadJust_rec( getFaninVar1(v) );
}
inline void Solver::loadJust(){
    int i;
	travId ++ ;
	JustModel.shrink_(JustModel.size());
	vMarked.shrink_(vMarked.size());
	JustModel.push(toLit(0));
	for(i = 0; i < assumptions.size(); i ++)
		loadJust_rec( var(assumptions[i]) );
	JustModel[0] = toLit( JustModel.size()-1 );
	travId -- ;
	for(i = 0; i < vMarked.size(); i ++)
		var2TravId[ vMarked[i] ] = travId;
}

695 696 697 698
};

ABC_NAMESPACE_IMPL_END

699
#endif