<html><body>
<p> Thank you for your responses! <br>
<br>
<br>
I have sent the code producing the large example and the output to John. Unfortunately the attachments do not go through the mailing list, so I am copying only the text of the message:<br>
<br>
Here is the code (Nash equilibrium for a game of simplified poker):<br>
<br>
The code consists of a single file:[attachment "x.cpp" deleted by Alexey Lvov/Watson/IBM] <br>
Some documentation: [attachment "x.ps" deleted by Alexey Lvov/Watson/IBM] <br>
An example of a ready output of the program:[attachment "h06_f6_sb01_ai0200_ppr.ps" deleted by Alexey Lvov/Watson/IBM] <br>
<br>
"x 4" runs the huge example.<br>
"x 3" runs a small example (finishes in <= 3min. even under valgrind)<br>
"x 2" "x 1" "x 0" are medium examples.<br>
<br>
The "x 4" gives the segmentation fault after ~30 hours of run on AIX machine (rios19) with 64GB of memory, peak memory usage is 1.3GB. <br>
Here is the output (I ran it with model->setLogLevel(1), so it does not have that many details) <br>
[attachment "q.txt" deleted by Alexey Lvov/Watson/IBM] <br>
<br>
All smaller examples (up to 50000 var.) run fine.<br>
By the way CLP does not run absolutely clean under "valgrind" memcheck. It produces a lot of "uninitialized memory reads", but I assume it is ok...<br>
[attachment "errors_under_valgrind.txt" deleted by Alexey Lvov/Watson/IBM] <br>
<br>
- Alexey<br>
<br>
<br>
<br>
<br>
----------------------------------------------------<br>
Dr. Alexey Lvov<br>
IBM T.J. Watson Research Institute<br>
1101 Kitchawan Rd. (Rt. 134) Office 34-159<br>
Yorktown Heights NY 10598<br>
Tel: (914)-945-3732<br>
</body></html>