Bug#978311: glpk-java: FTBFS: dh_auto_test: error: make -j4 check VERBOSE=1 returned exit code 2

Sat Dec 26 21:53:32 GMT 2020

Source: glpk-java
Version: 1.12.0-1
Severity: serious
Justification: FTBFS on amd64
Tags: bullseye sid ftbfs
Usertags: ftbfs-20201226 ftbfs-bullseye

Hi,

During a rebuild of all packages in sid, your package failed to build
on amd64.

Relevant part (hopefully):
> make[2]: Entering directory '/<<PKGBUILDDIR>>/swig'
> cd ../examples/java;/usr/bin/javac -source 1.8 -target 1.8 \
>   -classpath ../../swig/glpk-java.jar Gmpl.java
> warning: [options] bootstrap class path not set in conjunction with -source 8
> 1 warning
> cd ../examples/java;java -Djava.library.path=../../swig/.libs \
>   -classpath ../../swig/glpk-java.jar:. Gmpl marbles.mod
> Reading model section from marbles.mod...
> 51 lines were read
> The smallest bag contains 3 marbles
> The largest bag contains 42 marbles
> 857 colors are used
> Generating obj...
> Generating nBags...
> Generating fCol...
> Model has been successfully generated
> GLPK Integer Optimizer 5.0
> 1002 rows, 1100 columns, 4140 non-zeros
> 100 integer variables, all of which are binary
> Preprocessing...
> 858 rows, 957 columns, 2997 non-zeros
> 100 integer variables, all of which are binary
> Scaling...
>  A: min|aij| =  1.000e+00  max|aij| =  1.000e+00  ratio =  1.000e+00
> Problem data seem to be well scaled
> Constructing initial basis...
> Size of triangular part is 858
> Solving LP relaxation...
> GLPK Simplex Optimizer 5.0
> 858 rows, 957 columns, 2997 non-zeros
> *     0: obj =  -0.000000000e+00 inf =   0.000e+00 (857)
> Perturbing LP to avoid stalling [472]...
> Removing LP perturbation [1157]...
> *  1157: obj =   3.275000000e+02 inf =   7.824e-13 (0) 2
> OPTIMAL LP SOLUTION FOUND
> Integer optimization begins...
> Long-step dual simplex will be used
> +  1157: mip =     not found yet <=              +inf        (1; 0)
> +  1303: >>>>>   3.170000000e+02 <=   3.265000000e+02   3.0% (9; 0)
> Better solution found
> +  1713: >>>>>   3.180000000e+02 <=   3.210000000e+02   0.9% (9; 8)
> Better solution found
> +  1784: >>>>>   3.190000000e+02 <=   3.195000000e+02   0.2% (5; 20)
> Better solution found
> +  1793: mip =   3.190000000e+02 <=     tree is empty   0.0% (0; 37)
> INTEGER OPTIMAL SOLUTION FOUND
> Bags chosen:
> bag 7, bag 12, bag 23, bag 28, bag 36, bag 45, bag 75, bag 82, bag 83, bag 99.
> Colors retrieved: 319
> Model has been successfully processed
> cd ../examples/java;/usr/bin/javac -source 1.8 -target 1.8 -classpath \
>   ../../swig/glpk-java.jar Lp.java
> warning: [options] bootstrap class path not set in conjunction with -source 8
> 1 warning
> cd ../examples/java;java -Djava.library.path=../../swig/.libs \
>   -classpath ../../swig/glpk-java.jar:. Lp
> Problem created
> GLPK Simplex Optimizer 5.0
> 2 rows, 3 columns, 4 non-zeros
> *     0: obj =   1.000000000e+00 inf =   0.000e+00 (2)
> *     3: obj =   4.250000000e-01 inf =   0.000e+00 (0)
> OPTIMAL LP SOLUTION FOUND
> z = 0.42500000000000004
> x1 = 0.25
> x2 = 0.09999999999999998
> x3 = 0.5
> cd ../examples/java;/usr/bin/javac -source 1.8 -target 1.8 -classpath \
>   ../../swig/glpk-java.jar Mip.java
> warning: [options] bootstrap class path not set in conjunction with -source 8
> 1 warning
> cd ../examples/java;java -Djava.library.path=../../swig/.libs \
>   -classpath ../../swig/glpk-java.jar:. Mip
> Problem created
> GLPK Integer Optimizer 5.0
> 2 rows, 2 columns, 4 non-zeros
> 2 integer variables, none of which are binary
> Preprocessing...
> 2 rows, 2 columns, 4 non-zeros
> 2 integer variables, none of which are binary
> Scaling...
>  A: min|aij| =  1.000e+00  max|aij| =  1.000e+01  ratio =  1.000e+01
> Problem data seem to be well scaled
> Constructing initial basis...
> Size of triangular part is 2
> Solving LP relaxation...
> GLPK Simplex Optimizer 5.0
> 2 rows, 2 columns, 4 non-zeros
> *     0: obj =  -0.000000000e+00 inf =   0.000e+00 (2)
> *     3: obj =   6.833333333e+01 inf =   0.000e+00 (0)
> OPTIMAL LP SOLUTION FOUND
> Integer optimization begins...
> Long-step dual simplex will be used
> +     3: mip =     not found yet <=              +inf        (1; 0)
> Solution found by heuristic: 63
> +     4: >>>>>   6.800000000e+01 <=   6.800000000e+01   0.0% (3; 0)
> +     4: mip =   6.800000000e+01 <=     tree is empty   0.0% (0; 5)
> INTEGER OPTIMAL SOLUTION FOUND
> obj = 68.0
> x1 = 4.0
> x2 = 0.0
> cd ../examples/java;/usr/bin/javac -source 1.8 -target 1.8 \
>    -classpath ../../swig/glpk-java.jar OutOfMemory.java
> warning: [options] bootstrap class path not set in conjunction with -source 8
> 1 warning
> cd ../examples/java;java -Djava.library.path=../../swig/.libs \
>    -classpath ../../swig/glpk-java.jar:. OutOfMemory
> Testing allocation of integer array.
> 1: No error should occur
> 1: Success
> 2: Error should occur
> java.lang.OutOfMemoryError: new_intArray: calloc failed, C-runtime heap is full.
> 	at org.gnu.glpk.GLPKJNI.new_intArray(Native Method)
> 	at org.gnu.glpk.GLPK.new_intArray(GLPK.java:44)
> 	at OutOfMemory.main(OutOfMemory.java:25)
> 2: Success
> cd ../examples/java;/usr/bin/javac -source 1.8 -target 1.8 \
>    -classpath ../../swig/glpk-java.jar ErrorDemo.java
> warning: [options] bootstrap class path not set in conjunction with -source 8
> 1 warning
> cd ../examples/java;java -Djava.library.path=../../swig/.libs \
>    -classpath ../../swig/glpk-java.jar:. ErrorDemo
> GLPK version: 5.0
> 
> Iteration 1, success expected.
> Problem created
> Successful execution.
> 
> Iteration 2, error expected to occur.
> Problem created
> leaving function glp_java_set_msg_lvl.
> entering function glp_add_rows.
> glp_add_rows: nrs = -1; invalid number of rows
> Error detected in file api/prob1.c at line 254
> leaving function glp_add_rows.
> Error in callback: function glp_add_rows failed
> entering function glp_java_set_msg_lvl.
> function glp_intopt failed
> An error has occured.
> 
> Iteration 3, success expected.
> Problem created
> Successful execution.
> 
> Iteration 4, error expected to occur.
> Problem created
> leaving function glp_java_set_msg_lvl.
> entering function glp_add_rows.
> glp_add_rows: nrs = -1; invalid number of rows
> Error detected in file api/prob1.c at line 254
> leaving function glp_add_rows.
> Error in callback: function glp_add_rows failed
> entering function glp_java_set_msg_lvl.
> function glp_intopt failed
> An error has occured.
> cd ../examples/java;/usr/bin/javac -source 1.8 -target 1.8 \
>   -classpath ../../swig/glpk-java.jar LinOrd.java
> warning: [options] bootstrap class path not set in conjunction with -source 8
> 1 warning
> cd ../examples/java && rm -f tiw56r72.sol && \
>   java -Djava.library.path=../../swig/.libs \
>   -classpath ../../swig/glpk-java.jar:. LinOrd tiw56r72.mat \
>   tiw56r72.sol && rm tiw56r72.sol
> Reading LOP instance data from 'tiw56r72.mat'...
> INPUT-OUTPUT-TABELLE BRD  1 9 7 2 (REAL)
> Digraph has 56 nodes
> Constructing initial basis...
> Size of triangular part is 1540
> GLPK Simplex Optimizer 5.0
> 1540 rows, 3080 columns, 3080 non-zeros
> *     0: obj =   2.691170000e+05 inf =   0.000e+00 (680)
> *   680: obj =   3.562500000e+05 inf =   0.000e+00 (0)
> OPTIMAL LP SOLUTION FOUND
> GLPK Integer Optimizer 5.0
> 1540 rows, 3080 columns, 3080 non-zeros
> 3080 integer variables, all of which are binary
> Integer optimization begins...
> Long-step dual simplex will be used
> +   680: mip =     not found yet <=              +inf        (1; 0)
> 0 inactive constraints removed
> 228 violated constraints were generated
> 0 inactive constraints removed
> 187 violated constraints were generated
> 38 inactive constraints removed
> 38 inactive constraints removed
> 198 violated constraints were generated
> 107 inactive constraints removed
> 107 inactive constraints removed
> 188 violated constraints were generated
> 124 inactive constraints removed
> 124 inactive constraints removed
> 158 violated constraints were generated
> 120 inactive constraints removed
> 120 inactive constraints removed
> 171 violated constraints were generated
> 154 inactive constraints removed
> 154 inactive constraints removed
> 140 violated constraints were generated
> 123 inactive constraints removed
> 123 inactive constraints removed
> 149 violated constraints were generated
> 134 inactive constraints removed
> 134 inactive constraints removed
> 109 violated constraints were generated
> 101 inactive constraints removed
> 101 inactive constraints removed
> 132 violated constraints were generated
> 131 inactive constraints removed
> 131 inactive constraints removed
> 113 violated constraints were generated
> 110 inactive constraints removed
> 110 inactive constraints removed
> 129 violated constraints were generated
> 132 inactive constraints removed
> 132 inactive constraints removed
> 94 violated constraints were generated
> 101 inactive constraints removed
> 101 inactive constraints removed
> 86 violated constraints were generated
> 84 inactive constraints removed
> 84 inactive constraints removed
> 102 violated constraints were generated
> 97 inactive constraints removed
> 97 inactive constraints removed
> 101 violated constraints were generated
> 94 inactive constraints removed
> 94 inactive constraints removed
> 129 violated constraints were generated
> 114 inactive constraints removed
> 114 inactive constraints removed
> 61 violated constraints were generated
> 60 inactive constraints removed
> 60 inactive constraints removed
> 96 violated constraints were generated
> 90 inactive constraints removed
> 90 inactive constraints removed
> 56 violated constraints were generated
> 57 inactive constraints removed
> 57 inactive constraints removed
> 47 violated constraints were generated
> 47 inactive constraints removed
> 47 inactive constraints removed
> 34 violated constraints were generated
> 38 inactive constraints removed
> 38 inactive constraints removed
> 25 violated constraints were generated
> 29 inactive constraints removed
> 29 inactive constraints removed
> 43 violated constraints were generated
> 41 inactive constraints removed
> 41 inactive constraints removed
> 20 violated constraints were generated
> 18 inactive constraints removed
> 18 inactive constraints removed
> 31 violated constraints were generated
> 32 inactive constraints removed
> 32 inactive constraints removed
> 18 violated constraints were generated
> 16 inactive constraints removed
> 16 inactive constraints removed
> 22 violated constraints were generated
> 21 inactive constraints removed
> 21 inactive constraints removed
> 11 violated constraints were generated
> 11 inactive constraints removed
> 11 inactive constraints removed
> 11 violated constraints were generated
> 14 inactive constraints removed
> 14 inactive constraints removed
> 18 violated constraints were generated
> 18 inactive constraints removed
> 18 inactive constraints removed
> 1 violated constraints were generated
> 1 inactive constraints removed
> 1 inactive constraints removed
> 5 violated constraints were generated
> 4 inactive constraints removed
> 4 inactive constraints removed
> 0 violated constraints were generated
> +  2795: >>>>>   3.416230000e+05 <=   3.416230000e+05   0.0% (1; 0)
> +  2795: mip =   3.416230000e+05 <=     tree is empty   0.0% (0; 1)
> INTEGER OPTIMAL SOLUTION FOUND
> Writing MIP solution to 'tiw56r72.sol'...
> cd ../examples/java; /usr/bin/javac -source 1.8 -target 1.8 \
>   -classpath ../../swig/glpk-java.jar MinimumCostFlow.java
> warning: [options] bootstrap class path not set in conjunction with -source 8
> 1 warning
> cd ../examples/java; rm -f mincost.dimacs mincost.lp && \
>   java -Djava.library.path=../../swig/.libs \
>   -classpath ../../swig/glpk-java.jar:. MinimumCostFlow && \
>   rm mincost.dimacs mincost.lp
> Writing min-cost flow problem data to 'mincost.dimacs'...
> 19 lines were written
> Writing problem data to 'mincost.lp'...
> 34 lines were written
> cd ../examples/java;/usr/bin/javac -source 1.8 -target 1.8 \
>   -classpath ../../swig/glpk-java.jar Relax4.java
> warning: [options] bootstrap class path not set in conjunction with -source 8
> 1 warning
> cd ../examples/java;java -Djava.library.path=../../swig/.libs \
>   -classpath ../../swig/glpk-java.jar:. Relax4 sample.min
> Reading min-cost flow problem data from 'sample.min'...
> Flow network has 9 nodes and 14 arcs
> 26 lines were read
> relax4_inidat: sorry, this routine is temporarily disabled due to licensing problems
> Error detected in file misc/relax4.c at line 18
> function glp_mincost_relax4 failed
> make[2]: *** [Makefile:521: check] Error 1
> make[2]: Leaving directory '/<<PKGBUILDDIR>>/swig'
> make[1]: *** [Makefile:405: check-recursive] Error 1
> make[1]: Leaving directory '/<<PKGBUILDDIR>>'
> dh_auto_test: error: make -j4 check VERBOSE=1 returned exit code 2

The full build log is available from:
   http://qa-logs.debian.net/2020/12/26/glpk-java_1.12.0-1_unstable.log

A list of current common problems and possible solutions is available at
http://wiki.debian.org/qa.debian.org/FTBFS . You're welcome to contribute!

If you reassign this bug to another package, please marking it as 'affects'-ing
this package. See https://www.debian.org/Bugs/server-control#affects

If you fail to reproduce this, please provide a build log and diff it with me
so that we can identify if something relevant changed in the meantime.

About the archive rebuild: The rebuild was done on EC2 VM instances from
Amazon Web Services, using a clean, minimal and up-to-date chroot. Every
failed build was retried once to eliminate random failures.