[Cbc-tickets] [COIN-OR Branch-and-Cut MIP Solver] #73: cbc 2.2.0 release: Assertion fail in preProcess on seymor.mps

Fri Apr 24 09:24:53 EDT 2009

#73: cbc 2.2.0 release: Assertion fail in preProcess on seymor.mps
------------------------+---------------------------------------------------
 Reporter:  tfahle      |       Owner:  somebody
     Type:  defect      |      Status:  new     
 Priority:  major       |   Milestone:          
Component:  component1  |     Version:          
 Keywords:              |  
------------------------+---------------------------------------------------
 I'm running cbcd -import seymour.mps -branchandC
 on a linux computer.
 Source cbc 2.2.0 release compiled with gcc 4.1.2 using configure --enable-
 debug

 That run stops after some seconds with the following assert
 CglPreProcess.cpp:3518: OsiSolverInterface*
 CglPreProcess::modified(OsiSolverInterface*, bool, int&, int, int):
 Assertion `numberRows=basis->getNumArtificial()' failed.

 Notice: The same cbc-call on Windows using Visual Studio 2008 result in
 slightly different intermediate results and no asserts occur.

 Full screen output:

 ~/CBC/Cbc-2.2.2> bin/cbc -import seymour.mps -branchandC
 Coin Cbc and Clp Solver version 2.20.00, build Apr 28 2009
 command line - bin/cbcd -import seymour.mps -branchandC
 At line 1 NAME           seymour
 At line 2 ROWS
 At line 4948 COLUMNS
 At line 22724 RHS
 At line 25197 BOUNDS
 At line 26570 ENDATA
 Problem seymour has 4944 rows, 1372 columns and 33549 elements
 Coin0008I seymour read with 0 errors
 Continuous objective value is 403.846 - 8.71 seconds
 Optimal - objective value 403.846
 Cgl0003I 0 fixed, 0 tightened bounds, 345 strengthened rows, 0
 substitutions
 Cgl0003I 0 fixed, 0 tightened bounds, 345 strengthened rows, 0
 substitutions
 Cgl0003I 0 fixed, 0 tightened bounds, 328 strengthened rows, 0
 substitutions
 Cgl0003I 0 fixed, 0 tightened bounds, 328 strengthened rows, 0
 substitutions
 Cgl0003I 0 fixed, 0 tightened bounds, 328 strengthened rows, 0
 substitutions
 Cgl0003I 0 fixed, 0 tightened bounds, 328 strengthened rows, 0
 substitutions
 Cgl0003I 0 fixed, 0 tightened bounds, 328 strengthened rows, 0
 substitutions
 Cgl0003I 0 fixed, 0 tightened bounds, 328 strengthened rows, 0
 substitutions
 Cgl0003I 0 fixed, 0 tightened bounds, 328 strengthened rows, 0
 substitutions
 Cgl0003I 0 fixed, 0 tightened bounds, 328 strengthened rows, 0
 substitutions
 Cgl0004I processed model has 4779 rows, 1153 columns (1153 integer) and
 33007 elements
 Objective coefficients multiple of 1
 Cutoff increment increased from 1e-05 to 0.999
 Cbc0038I Pass   1: (2.90 seconds) suminf.   56.02721 (217) obj. 425.629
 iterations 1407
 Cbc0038I Pass   2: (3.39 seconds) suminf.   26.31333 (85) obj. 429.86
 iterations 359
 Cbc0038I Pass   3: (3.74 seconds) suminf.    3.00000 (6) obj. 430
 iterations 305
 Cbc0038I Pass   4: (3.94 seconds) suminf.    3.00000 (6) obj. 430
 iterations 152
 Cbc0038I Solution found of 433
 Cbc0038I Cleaned solution of 433
 Cbc0038I Before mini branch and bound, 506 integers at bound fixed and 0
 continuous of which 2 were internal integer and 0 internal continuous
 Cbc0038I Full problem 4779 rows 1153 columns, reduced to 2773 rows 647
 columns - too large
 Cbc0038I Mini branch and bound did not improve solution (6.27 seconds)
 Cbc0038I Round again with cutoff of 429
 Cbc0038I Pass   5: (8.67 seconds) suminf.   56.02721 (217) obj. 425.629
 iterations 1407
 Cbc0038I Pass   6: (9.26 seconds) suminf.   24.25000 (91) obj. 429
 iterations 429
 Cbc0038I Pass   7: (9.73 seconds) suminf.   15.14706 (50) obj. 429
 iterations 460
 Cbc0038I Pass   8: (10.71 seconds) suminf.   11.33333 (35) obj. 429
 iterations 623
 Cbc0038I Pass   9: (10.94 seconds) suminf.    9.33333 (24) obj. 429
 iterations 109
 Cbc0038I Pass  10: (11.46 seconds) suminf.    3.00000 (6) obj. 429
 iterations 272
 Cbc0038I Pass  11: (11.63 seconds) suminf.    3.00000 (6) obj. 429
 iterations 70
 Cbc0038I Pass  12: (11.74 seconds) suminf.    3.00000 (6) obj. 429
 iterations 45
 Cbc0038I Pass  13: (14.25 seconds) suminf.   13.33333 (29) obj. 429
 iterations 1350
 Cbc0038I Pass  14: (15.52 seconds) suminf.   10.00000 (20) obj. 429
 iterations 999
 Cbc0038I Pass  15: (15.57 seconds) suminf.   10.00000 (20) obj. 429
 iterations 10
 Cbc0038I Pass  16: (15.67 seconds) suminf.    3.00000 (6) obj. 429
 iterations 83
 Cbc0038I Pass  17: (15.78 seconds) suminf.    3.00000 (6) obj. 429
 iterations 44
 Cbc0038I Pass  18: (15.84 seconds) suminf.    3.00000 (6) obj. 429
 iterations 26
 Cbc0038I Pass  19: (19.43 seconds) suminf.   11.83333 (31) obj. 429
 iterations 1942
 Cbc0038I Pass  20: (21.36 seconds) suminf.    7.00000 (16) obj. 429
 iterations 1395
 Cbc0038I Pass  21: (21.41 seconds) suminf.    7.00000 (16) obj. 429
 iterations 13
 Cbc0038I Pass  22: (21.55 seconds) suminf.    6.00000 (15) obj. 429
 iterations 84
 Cbc0038I Pass  23: (21.67 seconds) suminf.    5.00000 (10) obj. 429
 iterations 91
 Cbc0038I Pass  24: (21.76 seconds) suminf.    5.00000 (10) obj. 429
 iterations 41
 Cbc0038I No solution found this major pass
 Cbc0038I Before mini branch and bound, 488 integers at bound fixed and 0
 continuous of which 2 were internal integer and 0 internal continuous
 Cbc0038I Full problem 4779 rows 1153 columns, reduced to 2829 rows 665
 columns - too large
 Cbc0038I Mini branch and bound did not improve solution (24.12 seconds)
 Cbc0038I After 24.12 seconds - Feasibility pump exiting with objective of
 433 - took 24.07 seconds
 Cbc0012I Integer solution of 433 found by feasibility pump after 0
 iterations and 0 nodes (25.65 seconds)
 cbcd: CglPreProcess.cpp:3518: OsiSolverInterface*
 CglPreProcess::modified(OsiSolverInterface*, bool, int&, int, int):
 Assertion `numberRows=basis->getNumArtificial()' failed.
 Aborted
 ~/CBC/Cbc-2.2.2>

-- 
Ticket URL: <https://projects.coin-or.org/Cbc/ticket/73>
COIN-OR Branch-and-Cut MIP Solver <http://projects.coin-or.org/Cbc>
An LP-based branch-and-cut MIP solver.