Package evaluation of LocalSearchSolvers on Julia 1.13.0-DEV.111 (ce76dbf07d*) started at 2025-02-28T02:43:08.596 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 7.95s ################################################################################ # Installation # Installing LocalSearchSolvers... Resolving package versions... Updating `~/.julia/environments/v1.13/Project.toml` [2b10edaa] + LocalSearchSolvers v0.4.9 Updating `~/.julia/environments/v1.13/Manifest.toml` [66dad0bd] + AliasTables v1.1.3 [00ebfdb7] + CSTParser v3.4.3 [a80b9123] + CommonMark v0.8.15 [34da2185] + Compat v4.16.0 [4b67e4b5] + CompositionalNetworks v0.5.9 [e37357d9] + ConstraintCommons v0.2.3 [5800fd60] + ConstraintDomains v0.3.15 [30f324ab] + Constraints v0.5.8 [a8cc5b0e] + Crayons v4.1.1 [9a962f9c] + DataAPI v1.16.0 [a93c6f00] + DataFrames v1.7.0 [864edb3b] + DataStructures v0.18.20 [e2d170a0] + DataValueInterfaces v1.0.0 [85a47980] + Dictionaries v0.4.4 [b4f34e82] + Distances v0.10.12 [ffbed154] + DocStringExtensions v0.9.3 [e2ba6199] + ExprTools v0.1.10 [c27321d9] + Glob v1.3.1 [313cdc1a] + Indexing v1.1.1 [842dd82b] + InlineStrings v1.4.3 [d8418881] + Intervals v1.10.0 [41ab1584] + InvertedIndices v1.3.1 [92d709cd] + IrrationalConstants v0.2.4 [82899510] + IteratorInterfaceExtensions v1.0.0 [682c06a0] + JSON v0.21.4 [98e50ef6] + JuliaFormatter v1.0.62 [b964fa9f] + LaTeXStrings v1.4.0 [50d2b5c4] + Lazy v0.15.1 [2b10edaa] + LocalSearchSolvers v0.4.9 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.15 [e1d29d7a] + Missings v1.2.0 [78c3b35d] + Mocking v0.8.1 [bac558e1] + OrderedCollections v1.8.0 [69de0a69] + Parsers v2.8.1 [c18a7f1d] + PatternFolds v0.2.6 [2dfb63ee] + PooledArrays v1.4.3 [aea7be01] + PrecompileTools v1.2.1 [21216c6a] + Preferences v1.4.3 [08abe8d2] + PrettyTables v2.4.0 [43287f4e] + PtrArrays v1.3.0 [3cdcf5f2] + RecipesBase v1.3.4 [189a3867] + Reexport v1.2.2 [6c6a2e73] + Scratch v1.2.1 [91c51154] + SentinelArrays v1.4.8 [a2af1166] + SortingAlgorithms v1.2.1 [10745b16] + Statistics v1.11.1 [82ae8749] + StatsAPI v1.7.0 [2913bbd2] + StatsBase v0.34.4 [892a3eda] + StringManipulation v0.4.1 [dc5dba14] + TZJData v1.4.0+2025a [3783bdb8] + TableTraits v1.0.1 [bd369af6] + Tables v1.12.0 [1c621080] + TestItems v1.0.0 [f269a46b] + TimeZones v1.21.2 [0796e94c] + Tokenize v0.5.29 [9602ed7d] + Unrolled v0.1.5 [0dad84c5] + ArgTools v1.1.2 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [f43a241f] + Downloads v1.7.0 [7b1f6079] + FileWatching v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.12.0 [b27032c2] + LibCURL v0.6.4 [76f85450] + LibGit2 v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.12.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [ca575930] + NetworkOptions v1.3.0 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.12.0 [f489334b] + StyledStrings v1.11.0 [fa267f1f] + TOML v1.0.3 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.3.0+1 [deac9b47] + LibCURL_jll v8.11.1+1 [e37daf67] + LibGit2_jll v1.9.0+0 [29816b5a] + LibSSH2_jll v1.11.3+1 [14a3606d] + MozillaCACerts_jll v2024.12.31 [4536629a] + OpenBLAS_jll v0.3.29+0 [458c3c95] + OpenSSL_jll v3.0.16+0 [bea87d4a] + SuiteSparse_jll v7.8.3+2 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.12.0+0 [8e850ede] + nghttp2_jll v1.64.0+1 [3f19e933] + p7zip_jll v17.5.0+2 Installation completed after 3.08s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 41.04s ################################################################################ # Testing # Testing LocalSearchSolvers Status `/tmp/jl_IzhobO/Project.toml` [4c88cf16] Aqua v0.8.11 [4b67e4b5] CompositionalNetworks v0.5.9 [5800fd60] ConstraintDomains v0.3.15 [30f324ab] Constraints v0.5.8 [85a47980] Dictionaries v0.4.4 [682c06a0] JSON v0.21.4 [50d2b5c4] Lazy v0.15.1 [2b10edaa] LocalSearchSolvers v0.4.9 [bac558e1] OrderedCollections v1.8.0 [f8b46487] TestItemRunner v1.1.0 [1c621080] TestItems v1.0.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_IzhobO/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.11 [00ebfdb7] CSTParser v3.4.3 [a80b9123] CommonMark v0.8.15 [34da2185] Compat v4.16.0 [4b67e4b5] CompositionalNetworks v0.5.9 [e37357d9] ConstraintCommons v0.2.3 [5800fd60] ConstraintDomains v0.3.15 [30f324ab] Constraints v0.5.8 [a8cc5b0e] Crayons v4.1.1 [9a962f9c] DataAPI v1.16.0 [a93c6f00] DataFrames v1.7.0 [864edb3b] DataStructures v0.18.20 [e2d170a0] DataValueInterfaces v1.0.0 [85a47980] Dictionaries v0.4.4 [b4f34e82] Distances v0.10.12 [ffbed154] DocStringExtensions v0.9.3 [e2ba6199] ExprTools v0.1.10 [c27321d9] Glob v1.3.1 [313cdc1a] Indexing v1.1.1 [842dd82b] InlineStrings v1.4.3 [d8418881] Intervals v1.10.0 [41ab1584] InvertedIndices v1.3.1 [92d709cd] IrrationalConstants v0.2.4 [82899510] IteratorInterfaceExtensions v1.0.0 [682c06a0] JSON v0.21.4 [98e50ef6] JuliaFormatter v1.0.62 [b964fa9f] LaTeXStrings v1.4.0 [50d2b5c4] Lazy v0.15.1 [2b10edaa] LocalSearchSolvers v0.4.9 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.15 [e1d29d7a] Missings v1.2.0 [78c3b35d] Mocking v0.8.1 [bac558e1] OrderedCollections v1.8.0 [69de0a69] Parsers v2.8.1 [c18a7f1d] PatternFolds v0.2.6 [2dfb63ee] PooledArrays v1.4.3 [aea7be01] PrecompileTools v1.2.1 [21216c6a] Preferences v1.4.3 [08abe8d2] PrettyTables v2.4.0 [43287f4e] PtrArrays v1.3.0 [3cdcf5f2] RecipesBase v1.3.4 [189a3867] Reexport v1.2.2 [6c6a2e73] Scratch v1.2.1 [91c51154] SentinelArrays v1.4.8 [a2af1166] SortingAlgorithms v1.2.1 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.0 [2913bbd2] StatsBase v0.34.4 [892a3eda] StringManipulation v0.4.1 [dc5dba14] TZJData v1.4.0+2025a [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.0 [f8b46487] TestItemRunner v1.1.0 [1c621080] TestItems v1.0.0 [f269a46b] TimeZones v1.21.2 [0796e94c] Tokenize v0.5.29 [9602ed7d] Unrolled v0.1.5 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.12.0 [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.12.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.12.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.12.0 [f489334b] StyledStrings v1.11.0 [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [deac9b47] LibCURL_jll v8.11.1+1 [e37daf67] LibGit2_jll v1.9.0+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2024.12.31 [4536629a] OpenBLAS_jll v0.3.29+0 [458c3c95] OpenSSL_jll v3.0.16+0 [bea87d4a] SuiteSparse_jll v7.8.3+2 [83775a58] Zlib_jll v1.3.1+2 [8e850b90] libblastrampoline_jll v5.12.0+0 [8e850ede] nghttp2_jll v1.64.0+1 [3f19e933] p7zip_jll v17.5.0+2 Testing Running tests... 54 ambiguities found. To get a list, set `broken = false`. ┌ Warning: Both iteration and time limits are disabled. Optimization runs will run infinitely. └ @ LocalSearchSolvers ~/.julia/packages/LocalSearchSolvers/SFF5k/src/options.jl:80 ┌ Info: └ Loop 1 (satisfaction) [ Info: Selected x = 10 [ Info: Compute costs: selected var(s) x_10 = 1 [ Info: cost = 3.0 < 11.0 [ Info: Compute costs: selected var(s) x_10 = 2 [ Info: cost = best_cost = 3.0 [ Info: Compute costs: selected var(s) x_10 = 3 [ Info: cost = 2.0 < 3.0 [ Info: Tabu list: {10 = 4} [ Info: best_values: [3] [ Info: vals: {1 = 3, 2 = 3, 3 = 1, 4 = 2, 5 = 3, 6 = 3, 7 = 1, 8 = 4, 9 = 2, 10 = 3, 11 = 2, 12 = 4, 13 = 4, 14 = 1, 15 = 4, 16 = 4} ┌ Info: └ Loop 2 (satisfaction) [ Info: Selected x = 15 [ Info: Compute costs: selected var(s) x_15 = 1 [ Info: cost = best_cost = 11.0 [ Info: Compute costs: selected var(s) x_15 = 2 [ Info: cost = best_cost = 11.0 [ Info: Compute costs: selected var(s) x_15 = 3 [ Info: cost = best_cost = 11.0 [ Info: Compute costs: selected var(s) x_15 ⇆ x_13 [ Info: cost = best_cost = 11.0 [ Info: Compute costs: selected var(s) x_15 ⇆ x_16 [ Info: cost = best_cost = 11.0 [ Info: Compute costs: selected var(s) x_15 ⇆ x_7 [ Info: cost = best_cost = 11.0 [ Info: Compute costs: selected var(s) x_15 ⇆ x_11 [ Info: cost = best_cost = 11.0 [ Info: Compute costs: selected var(s) x_15 ⇆ x_12 [ Info: cost = best_cost = 11.0 [ Info: Compute costs: selected var(s) x_15 ⇆ x_14 [ Info: Compute costs: selected var(s) x_15 ⇆ x_3 [ Info: cost = best_cost = 11.0 [ Info: Tabu list: {10 = 3, 15 = 8} [ Info: best_values: [4, 1, 2, 3] [ Info: vals: {1 = 3, 2 = 3, 3 = 1, 4 = 2, 5 = 3, 6 = 3, 7 = 1, 8 = 4, 9 = 2, 10 = 3, 11 = 2, 12 = 4, 13 = 4, 14 = 1, 15 = 3, 16 = 4} ┌ Info: └ Loop 3 (satisfaction) [ Info: Selected x = 5 [ Info: Compute costs: selected var(s) x_5 = 1 [ Info: cost = 10.0 < 11.0 [ Info: Compute costs: selected var(s) x_5 = 2 [ Info: cost = best_cost = 10.0 [ Info: Compute costs: selected var(s) x_5 = 4 [ Info: Tabu list: {10 = 2, 15 = 7, 5 = 4} [ Info: best_values: [1, 2] [ Info: vals: {1 = 3, 2 = 3, 3 = 1, 4 = 2, 5 = 1, 6 = 3, 7 = 1, 8 = 4, 9 = 2, 10 = 3, 11 = 2, 12 = 4, 13 = 4, 14 = 1, 15 = 3, 16 = 4} ┌ Info: └ Loop 4 (satisfaction) [ Info: Selected x = 4 [ Info: Compute costs: selected var(s) x_4 = 1 [ Info: cost = best_cost = 10.0 [ Info: Compute costs: selected var(s) x_4 = 3 [ Info: cost = best_cost = 10.0 [ Info: Compute costs: selected var(s) x_4 = 4 [ Info: cost = best_cost = 10.0 [ Info: Compute costs: selected var(s) x_4 ⇆ x_16 [ Info: cost = 9.0 < 10.0 [ Info: Compute costs: selected var(s) x_4 ⇆ x_7 [ Info: cost = best_cost = 9.0 [ Info: Compute costs: selected var(s) x_4 ⇆ x_2 [ Info: Compute costs: selected var(s) x_4 ⇆ x_12 [ Info: Compute costs: selected var(s) x_4 ⇆ x_8 [ Info: Compute costs: selected var(s) x_4 ⇆ x_3 [ Info: Compute costs: selected var(s) x_4 ⇆ x_1 [ Info: Tabu list: {10 = 1, 15 = 6, 5 = 3, 4 = 4} [ Info: best_swap : [16, 7] [ Info: vals: {1 = 3, 2 = 3, 3 = 1, 4 = 1, 5 = 1, 6 = 3, 7 = 2, 8 = 4, 9 = 2, 10 = 3, 11 = 2, 12 = 4, 13 = 4, 14 = 1, 15 = 3, 16 = 4} ┌ Info: └ Loop 5 (satisfaction) [ Info: Selected x = 3 [ Info: Compute costs: selected var(s) x_3 = 2 [ Info: cost = best_cost = 9.0 [ Info: Compute costs: selected var(s) x_3 = 3 [ Info: cost = 8.0 < 9.0 [ Info: Compute costs: selected var(s) x_3 = 4 [ Info: Tabu list: {15 = 5, 5 = 2, 4 = 3, 3 = 4} [ Info: best_values: [3] [ Info: vals: {1 = 3, 2 = 3, 3 = 3, 4 = 1, 5 = 1, 6 = 3, 7 = 2, 8 = 4, 9 = 2, 10 = 3, 11 = 2, 12 = 4, 13 = 4, 14 = 1, 15 = 3, 16 = 4} ┌ Info: └ Loop 6 (satisfaction) [ Info: Selected x = 16 [ Info: Compute costs: selected var(s) x_16 = 1 [ Info: cost = 7.0 < 8.0 [ Info: Compute costs: selected var(s) x_16 = 2 [ Info: cost = best_cost = 7.0 [ Info: Compute costs: selected var(s) x_16 = 3 [ Info: Tabu list: {15 = 4, 5 = 1, 4 = 2, 3 = 3, 16 = 4} [ Info: best_values: [1, 2] [ Info: vals: {1 = 3, 2 = 3, 3 = 3, 4 = 1, 5 = 1, 6 = 3, 7 = 2, 8 = 4, 9 = 2, 10 = 3, 11 = 2, 12 = 4, 13 = 4, 14 = 1, 15 = 3, 16 = 1} ┌ Info: └ Loop 7 (satisfaction) [ Info: Selected x = 2 [ Info: Compute costs: selected var(s) x_2 = 1 [ Info: cost = best_cost = 7.0 [ Info: Compute costs: selected var(s) x_2 = 2 [ Info: cost = best_cost = 7.0 [ Info: Compute costs: selected var(s) x_2 = 4 [ Info: cost = best_cost = 7.0 [ Info: Compute costs: selected var(s) x_2 ⇆ x_5 [ Info: Compute costs: selected var(s) x_2 ⇆ x_4 [ Info: Compute costs: selected var(s) x_2 ⇆ x_6 [ Info: cost = best_cost = 7.0 [ Info: Compute costs: selected var(s) x_2 ⇆ x_10 [ Info: cost = best_cost = 7.0 [ Info: Compute costs: selected var(s) x_2 ⇆ x_14 [ Info: Compute costs: selected var(s) x_2 ⇆ x_3 [ Info: cost = best_cost = 7.0 [ Info: Compute costs: selected var(s) x_2 ⇆ x_1 [ Info: cost = best_cost = 7.0 [ Info: Tabu list: {15 = 3, 4 = 2, 3 = 3, 16 = 3, 2 = 8} [ Info: best_values: [3, 1, 2, 4] [ Info: vals: {1 = 3, 2 = 4, 3 = 3, 4 = 1, 5 = 1, 6 = 3, 7 = 2, 8 = 4, 9 = 2, 10 = 3, 11 = 2, 12 = 4, 13 = 4, 14 = 1, 15 = 3, 16 = 1} ┌ Info: └ Loop 8 (satisfaction) [ Info: Selected x = 12 [ Info: Compute costs: selected var(s) x_12 = 1 [ Info: Compute costs: selected var(s) x_12 = 2 [ Info: Compute costs: selected var(s) x_12 = 3 [ Info: Compute costs: selected var(s) x_12 ⇆ x_4 [ Info: Compute costs: selected var(s) x_12 ⇆ x_16 [ Info: cost = best_cost = 7.0 [ Info: Compute costs: selected var(s) x_12 ⇆ x_15 [ Info: cost = best_cost = 7.0 [ Info: Compute costs: selected var(s) x_12 ⇆ x_11 [ Info: cost = best_cost = 7.0 [ Info: Compute costs: selected var(s) x_12 ⇆ x_10 [ Info: Compute costs: selected var(s) x_12 ⇆ x_9 [ Info: Compute costs: selected var(s) x_12 ⇆ x_8 [ Info: cost = best_cost = 7.0 [ Info: Tabu list: {15 = 2, 4 = 1, 3 = 2, 16 = 2, 2 = 7, 12 = 8} [ Info: best_values: [4] [ Info: vals: {1 = 3, 2 = 4, 3 = 3, 4 = 1, 5 = 1, 6 = 3, 7 = 2, 8 = 4, 9 = 2, 10 = 3, 11 = 2, 12 = 4, 13 = 4, 14 = 1, 15 = 3, 16 = 1} ┌ Info: └ Loop 9 (satisfaction) [ Info: Selected x = 6 [ Info: Compute costs: selected var(s) x_6 = 1 [ Info: Compute costs: selected var(s) x_6 = 2 [ Info: cost = 6.0 < 7.0 [ Info: Compute costs: selected var(s) x_6 = 4 [ Info: Tabu list: {15 = 1, 3 = 1, 16 = 1, 2 = 6, 12 = 7, 6 = 4} [ Info: best_values: [2] [ Info: vals: {1 = 3, 2 = 4, 3 = 3, 4 = 1, 5 = 1, 6 = 2, 7 = 2, 8 = 4, 9 = 2, 10 = 3, 11 = 2, 12 = 4, 13 = 4, 14 = 1, 15 = 3, 16 = 1} ┌ Info: └ Loop 10 (satisfaction) [ Info: Selected x = 8 [ Info: Compute costs: selected var(s) x_8 = 1 [ Info: Compute costs: selected var(s) x_8 = 2 [ Info: Compute costs: selected var(s) x_8 = 3 [ Info: Compute costs: selected var(s) x_8 ⇆ x_5 [ Info: Compute costs: selected var(s) x_8 ⇆ x_4 [ Info: cost = best_cost = 6.0 [ Info: Compute costs: selected var(s) x_8 ⇆ x_6 [ Info: Compute costs: selected var(s) x_8 ⇆ x_7 [ Info: cost = best_cost = 6.0 [ Info: Compute costs: selected var(s) x_8 ⇆ x_16 [ Info: Compute costs: selected var(s) x_8 ⇆ x_12 [ Info: cost = best_cost = 6.0 [ Info: Compute costs: selected var(s) x_8 ⇆ x_3 [ Info: cost = best_cost = 6.0 [ Info: Tabu list: {3 = 1, 2 = 5, 12 = 6, 6 = 3, 8 = 8} [ Info: best_values: [4] [ Info: vals: {1 = 3, 2 = 4, 3 = 3, 4 = 1, 5 = 1, 6 = 2, 7 = 2, 8 = 4, 9 = 2, 10 = 3, 11 = 2, 12 = 4, 13 = 4, 14 = 1, 15 = 3, 16 = 1} ┌ Info: └ Loop 11 (satisfaction) [ Info: Selected x = 16 [ Info: Compute costs: selected var(s) x_16 = 2 [ Info: cost = best_cost = 6.0 [ Info: Compute costs: selected var(s) x_16 = 3 [ Info: Compute costs: selected var(s) x_16 = 4 [ Info: Compute costs: selected var(s) x_16 ⇆ x_13 [ Info: Compute costs: selected var(s) x_16 ⇆ x_15 [ Info: cost = best_cost = 6.0 [ Info: Compute costs: selected var(s) x_16 ⇆ x_4 [ Info: cost = best_cost = 6.0 [ Info: Compute costs: selected var(s) x_16 ⇆ x_11 [ Info: cost = 4.0 < 6.0 [ Info: Compute costs: selected var(s) x_16 ⇆ x_12 [ Info: Compute costs: selected var(s) x_16 ⇆ x_14 [ Info: Compute costs: selected var(s) x_16 ⇆ x_8 [ Info: Tabu list: {2 = 5, 12 = 5, 6 = 2, 8 = 7, 16 = 4} [ Info: best_swap : [11] [ Info: vals: {1 = 3, 2 = 4, 3 = 3, 4 = 1, 5 = 1, 6 = 2, 7 = 2, 8 = 4, 9 = 2, 10 = 3, 11 = 1, 12 = 4, 13 = 4, 14 = 1, 15 = 3, 16 = 2} ┌ Info: └ Loop 12 (satisfaction) [ Info: Selected x = 7 [ Info: Compute costs: selected var(s) x_7 = 1 [ Info: Compute costs: selected var(s) x_7 = 3 [ Info: cost = best_cost = 4.0 [ Info: Compute costs: selected var(s) x_7 = 4 [ Info: Compute costs: selected var(s) x_7 ⇆ x_5 [ Info: Compute costs: selected var(s) x_7 ⇆ x_4 [ Info: cost = best_cost = 4.0 [ Info: Compute costs: selected var(s) x_7 ⇆ x_6 [ Info: cost = best_cost = 4.0 [ Info: Compute costs: selected var(s) x_7 ⇆ x_11 [ Info: Compute costs: selected var(s) x_7 ⇆ x_15 [ Info: Compute costs: selected var(s) x_7 ⇆ x_8 [ Info: cost = best_cost = 4.0 [ Info: Compute costs: selected var(s) x_7 ⇆ x_3 [ Info: cost = 2.0 < 4.0 [ Info: Tabu list: {2 = 4, 12 = 4, 6 = 1, 8 = 6, 16 = 3, 7 = 4} [ Info: best_swap : [3] [ Info: vals: {1 = 3, 2 = 4, 3 = 2, 4 = 1, 5 = 1, 6 = 2, 7 = 3, 8 = 4, 9 = 2, 10 = 3, 11 = 1, 12 = 4, 13 = 4, 14 = 1, 15 = 3, 16 = 2} ┌ Info: └ Loop 13 (satisfaction) [ Info: Selected x = 4 [ Info: Compute costs: selected var(s) x_4 = 2 [ Info: Compute costs: selected var(s) x_4 = 3 [ Info: Compute costs: selected var(s) x_4 = 4 [ Info: Compute costs: selected var(s) x_4 ⇆ x_16 [ Info: Compute costs: selected var(s) x_4 ⇆ x_7 [ Info: Compute costs: selected var(s) x_4 ⇆ x_2 [ Info: Compute costs: selected var(s) x_4 ⇆ x_12 [ Info: Compute costs: selected var(s) x_4 ⇆ x_8 [ Info: Compute costs: selected var(s) x_4 ⇆ x_3 [ Info: cost = best_cost = 2.0 [ Info: Compute costs: selected var(s) x_4 ⇆ x_1 [ Info: Tabu list: {2 = 3, 12 = 3, 8 = 5, 16 = 2, 7 = 3, 4 = 8} [ Info: best_values: [1] [ Info: vals: {1 = 3, 2 = 4, 3 = 2, 4 = 1, 5 = 1, 6 = 2, 7 = 3, 8 = 4, 9 = 2, 10 = 3, 11 = 1, 12 = 4, 13 = 4, 14 = 1, 15 = 3, 16 = 2} ┌ Info: └ Loop 14 (satisfaction) [ Info: Selected x = 15 [ Info: Compute costs: selected var(s) x_15 = 1 [ Info: Compute costs: selected var(s) x_15 = 2 [ Info: Compute costs: selected var(s) x_15 = 4 [ Info: Compute costs: selected var(s) x_15 ⇆ x_13 [ Info: Compute costs: selected var(s) x_15 ⇆ x_16 [ Info: cost = best_cost = 2.0 [ Info: Compute costs: selected var(s) x_15 ⇆ x_7 [ Info: cost = best_cost = 2.0 [ Info: Compute costs: selected var(s) x_15 ⇆ x_11 [ Info: Compute costs: selected var(s) x_15 ⇆ x_12 [ Info: cost = best_cost = 2.0 [ Info: Compute costs: selected var(s) x_15 ⇆ x_14 [ Info: Compute costs: selected var(s) x_15 ⇆ x_3 [ Info: Tabu list: {2 = 2, 12 = 2, 8 = 4, 16 = 1, 7 = 2, 4 = 7, 15 = 8} [ Info: best_values: [3] ┌ Info: └ ============== RESTART!!!!================ [ Info: vals: {1 = 1, 2 = 1, 3 = 3, 4 = 2, 5 = 3, 6 = 2, 7 = 2, 8 = 3, 9 = 1, 10 = 3, 11 = 1, 12 = 3, 13 = 3, 14 = 3, 15 = 1, 16 = 2} ┌ Info: └ Loop 15 (satisfaction) [ Info: Selected x = 1 [ Info: Compute costs: selected var(s) x_1 = 2 [ Info: cost = best_cost = 12.0 [ Info: Compute costs: selected var(s) x_1 = 3 [ Info: cost = best_cost = 12.0 [ Info: Compute costs: selected var(s) x_1 = 4 [ Info: cost = 10.0 < 12.0 [ Info: Tabu list: {1 = 4} [ Info: best_values: [4] [ Info: vals: {1 = 4, 2 = 1, 3 = 3, 4 = 2, 5 = 3, 6 = 2, 7 = 2, 8 = 3, 9 = 1, 10 = 3, 11 = 1, 12 = 3, 13 = 3, 14 = 3, 15 = 1, 16 = 2} ┌ Info: └ Loop 16 (satisfaction) [ Info: Selected x = 10 [ Info: Compute costs: selected var(s) x_10 = 1 [ Info: cost = best_cost = 10.0 [ Info: Compute costs: selected var(s) x_10 = 2 [ Info: cost = best_cost = 10.0 [ Info: Compute costs: selected var(s) x_10 = 4 [ Info: cost = 9.0 < 10.0 [ Info: Tabu list: {1 = 3, 10 = 4} [ Info: best_values: [4] [ Info: vals: {1 = 4, 2 = 1, 3 = 3, 4 = 2, 5 = 3, 6 = 2, 7 = 2, 8 = 3, 9 = 1, 10 = 4, 11 = 1, 12 = 3, 13 = 3, 14 = 3, 15 = 1, 16 = 2} ┌ Info: └ Loop 17 (satisfaction) [ Info: Selected x = 16 [ Info: Compute costs: selected var(s) x_16 = 1 [ Info: cost = best_cost = 9.0 [ Info: Compute costs: selected var(s) x_16 = 3 [ Info: cost = best_cost = 9.0 [ Info: Compute costs: selected var(s) x_16 = 4 [ Info: cost = best_cost = 9.0 [ Info: Compute costs: selected var(s) x_16 ⇆ x_13 [ Info: cost = 7.0 < 9.0 [ Info: Compute costs: selected var(s) x_16 ⇆ x_15 [ Info: Compute costs: selected var(s) x_16 ⇆ x_4 [ Info: Compute costs: selected var(s) x_16 ⇆ x_11 [ Info: Compute costs: selected var(s) x_16 ⇆ x_12 [ Info: Compute costs: selected var(s) x_16 ⇆ x_14 [ Info: Compute costs: selected var(s) x_16 ⇆ x_8 [ Info: Tabu list: {1 = 2, 10 = 3, 16 = 4} [ Info: best_swap : [13] [ Info: vals: {1 = 4, 2 = 1, 3 = 3, 4 = 2, 5 = 3, 6 = 2, 7 = 2, 8 = 3, 9 = 1, 10 = 4, 11 = 1, 12 = 3, 13 = 2, 14 = 3, 15 = 1, 16 = 3} ┌ Info: └ Loop 18 (satisfaction) [ Info: Selected x = 12 [ Info: Compute costs: selected var(s) x_12 = 1 [ Info: cost = best_cost = 7.0 [ Info: Compute costs: selected var(s) x_12 = 2 [ Info: cost = best_cost = 7.0 [ Info: Compute costs: selected var(s) x_12 = 4 [ Info: cost = best_cost = 7.0 [ Info: Compute costs: selected var(s) x_12 ⇆ x_4 [ Info: Compute costs: selected var(s) x_12 ⇆ x_16 [ Info: cost = best_cost = 7.0 [ Info: Compute costs: selected var(s) x_12 ⇆ x_15 [ Info: cost = best_cost = 7.0 [ Info: Compute costs: selected var(s) x_12 ⇆ x_11 [ Info: cost = best_cost = 7.0 [ Info: Compute costs: selected var(s) x_12 ⇆ x_10 [ Info: Compute costs: selected var(s) x_12 ⇆ x_9 [ Info: Compute costs: selected var(s) x_12 ⇆ x_8 [ Info: cost = best_cost = 7.0 [ Info: Tabu list: {1 = 1, 10 = 2, 16 = 3, 12 = 8} [ Info: best_values: [3, 1, 2, 4] [ Info: vals: {1 = 4, 2 = 1, 3 = 3, 4 = 2, 5 = 3, 6 = 2, 7 = 2, 8 = 3, 9 = 1, 10 = 4, 11 = 1, 12 = 3, 13 = 2, 14 = 3, 15 = 1, 16 = 3} ┌ Info: └ Loop 19 (satisfaction) [ Info: Selected x = 11 [ Info: Compute costs: selected var(s) x_11 = 2 [ Info: cost = 6.0 < 7.0 [ Info: Compute costs: selected var(s) x_11 = 3 [ Info: Compute costs: selected var(s) x_11 = 4 [ Info: cost = best_cost = 6.0 [ Info: Tabu list: {10 = 1, 16 = 2, 12 = 7, 11 = 4} [ Info: best_values: [2, 4] [ Info: vals: {1 = 4, 2 = 1, 3 = 3, 4 = 2, 5 = 3, 6 = 2, 7 = 2, 8 = 3, 9 = 1, 10 = 4, 11 = 2, 12 = 3, 13 = 2, 14 = 3, 15 = 1, 16 = 3} ┌ Info: └ Loop 20 (satisfaction) [ Info: Selected x = 8 [ Info: Compute costs: selected var(s) x_8 = 1 [ Info: cost = best_cost = 6.0 [ Info: Compute costs: selected var(s) x_8 = 2 [ Info: cost = best_cost = 6.0 [ Info: Compute costs: selected var(s) x_8 = 4 [ Info: cost = best_cost = 6.0 [ Info: Compute costs: selected var(s) x_8 ⇆ x_5 [ Info: cost = best_cost = 6.0 [ Info: Compute costs: selected var(s) x_8 ⇆ x_4 [ Info: Compute costs: selected var(s) x_8 ⇆ x_6 [ Info: Compute costs: selected var(s) x_8 ⇆ x_7 [ Info: cost = best_cost = 6.0 [ Info: Compute costs: selected var(s) x_8 ⇆ x_16 [ Info: cost = best_cost = 6.0 [ Info: Compute costs: selected var(s) x_8 ⇆ x_12 [ Info: cost = best_cost = 6.0 [ Info: Compute costs: selected var(s) x_8 ⇆ x_3 [ Info: cost = best_cost = 6.0 [ Info: Tabu list: {16 = 2, 12 = 7, 11 = 3, 8 = 8} [ Info: best_values: [3, 1, 2, 4] [ Info: vals: {1 = 4, 2 = 1, 3 = 3, 4 = 2, 5 = 3, 6 = 2, 7 = 2, 8 = 4, 9 = 1, 10 = 4, 11 = 2, 12 = 3, 13 = 2, 14 = 3, 15 = 1, 16 = 3} ┌ Info: └ Loop 21 (satisfaction) [ Info: Selected x = 7 [ Info: Compute costs: selected var(s) x_7 = 1 [ Info: cost = 4.0 < 6.0 [ Info: Compute costs: selected var(s) x_7 = 3 [ Info: Compute costs: selected var(s) x_7 = 4 [ Info: Tabu list: {16 = 1, 12 = 6, 11 = 2, 8 = 7, 7 = 4} [ Info: best_values: [1] [ Info: vals: {1 = 4, 2 = 1, 3 = 3, 4 = 2, 5 = 3, 6 = 2, 7 = 1, 8 = 4, 9 = 1, 10 = 4, 11 = 2, 12 = 3, 13 = 2, 14 = 3, 15 = 1, 16 = 3} ┌ Info: └ Loop 22 (satisfaction) [ Info: Selected x = 15 [ Info: Compute costs: selected var(s) x_15 = 2 [ Info: cost = best_cost = 4.0 [ Info: Compute costs: selected var(s) x_15 = 3 [ Info: cost = best_cost = 4.0 [ Info: Compute costs: selected var(s) x_15 = 4 [ Info: cost = 3.0 < 4.0 [ Info: Tabu list: {12 = 5, 11 = 1, 8 = 6, 7 = 3, 15 = 4} [ Info: best_values: [4] [ Info: vals: {1 = 4, 2 = 1, 3 = 3, 4 = 2, 5 = 3, 6 = 2, 7 = 1, 8 = 4, 9 = 1, 10 = 4, 11 = 2, 12 = 3, 13 = 2, 14 = 3, 15 = 4, 16 = 3} ┌ Info: └ Loop 23 (satisfaction) [ Info: Selected x = 16 [ Info: Compute costs: selected var(s) x_16 = 1 [ Info: cost = 0.0 < 3.0 [ Info: Tabu list: {12 = 4, 8 = 5, 7 = 2, 15 = 3, 16 = 4} [ Info: best_values: [1] ┌ Info: Remote stop: report main pool │ best_values(s.pool) = │ 16-element Dictionary{Int64, Int64}: │ 1 │ 4 │ ⋮ │ ⋮ │ 16 │ 1 │ has_solution(s) = true │ s.rc_report = RemoteChannel{Channel{Nothing}}(1, 1, 4) │ s.rc_sol = RemoteChannel{Channel{Union{LocalSearchSolvers.EmptyPool, LocalSearchSolvers._Pool}}}(1, 1, 5) │ s.rc_stop = RemoteChannel{Channel{Nothing}}(1, 1, 6) └ length(s.remotes) = 0 ┌ Info: Remote stop: report best pool │ best_values(s.pool) = │ 16-element Dictionary{Int64, Int64}: │ 1 │ 4 │ 2 │ 1 │ ⋮ │ ⋮ │ 16 │ 1 └ length(s.remotes) = 0 [ Info: Dict(:model_and_run => 13.432925939559937, :remote_stop => 1.0853328704833984, :total_run => 13.432925939559937, :init => 5.820732116699219, :threads_start => 4.943482875823975, :model => 0.0, :local_run => 1.5756640434265137, :remote_start => 0.007714033126831055) 81-element Dictionary{Int64, Int64}: 1 │ 9 2 │ 0 3 │ 8 4 │ 0 5 │ 0 6 │ 0 7 │ 0 8 │ 0 9 │ 0 10 │ 3 11 │ 0 12 │ 0 13 │ 0 14 │ 2 15 │ 0 16 │ 0 17 │ 9 18 │ 7 19 │ 0 20 │ 0 21 │ 0 22 │ 0 23 │ 0 24 │ 0 25 │ 8 26 │ 0 27 │ 0 28 │ 0 29 │ 0 30 │ 1 31 │ 4 32 │ 0 33 │ 0 34 │ 5 35 │ 2 36 │ 0 37 │ 0 38 │ 4 39 │ 9 40 │ 7 41 │ 0 42 │ 2 43 │ 3 44 │ 8 45 │ 0 46 │ 0 47 │ 2 48 │ 6 49 │ 0 50 │ 0 51 │ 3 52 │ 1 53 │ 0 54 │ 0 55 │ 0 56 │ 0 57 │ 7 58 │ 0 59 │ 0 60 │ 0 61 │ 0 62 │ 0 63 │ 0 64 │ 4 65 │ 9 66 │ 0 67 │ 0 68 │ 6 69 │ 0 70 │ 0 71 │ 0 72 │ 5 73 │ 0 74 │ 0 75 │ 0 76 │ 0 77 │ 0 78 │ 0 79 │ 2 80 │ 0 81 │ 3 ┌ Info: Remote stop: report main pool │ best_values(s.pool) = │ 81-element Dictionary{Int64, Int64}: │ 1 │ 9 │ ⋮ │ ⋮ │ 81 │ 3 │ has_solution(s) = false │ s.rc_report = RemoteChannel{Channel{Nothing}}(1, 1, 7) │ s.rc_sol = RemoteChannel{Channel{Union{LocalSearchSolvers.EmptyPool, LocalSearchSolvers._Pool}}}(1, 1, 8) │ s.rc_stop = RemoteChannel{Channel{Nothing}}(1, 1, 9) └ length(s.remotes) = 0 ┌ Warning: debugging remote stop │ nworkers() = 1 │ length(s.remotes) = 0 └ @ LocalSearchSolvers ~/.julia/packages/LocalSearchSolvers/SFF5k/src/solvers/main.jl:125 ┌ Info: Remote stop: report best pool │ best_values(s.pool) = │ 81-element Dictionary{Int64, Int64}: │ 1 │ 9 │ 2 │ 8 │ ⋮ │ ⋮ │ 81 │ 3 └ length(s.remotes) = 0 81-element Dictionary{Int64, Int64}: 1 │ 9 2 │ 1 3 │ 8 4 │ 8 5 │ 3 6 │ 9 7 │ 3 8 │ 8 9 │ 4 10 │ 3 11 │ 7 12 │ 1 13 │ 6 14 │ 2 15 │ 4 16 │ 4 17 │ 9 18 │ 7 19 │ 4 20 │ 5 21 │ 8 22 │ 7 23 │ 9 24 │ 1 25 │ 8 26 │ 1 27 │ 8 28 │ 2 29 │ 9 30 │ 1 31 │ 4 32 │ 4 33 │ 8 34 │ 5 35 │ 2 36 │ 9 37 │ 2 38 │ 4 39 │ 9 40 │ 7 41 │ 9 42 │ 2 43 │ 3 44 │ 8 45 │ 7 46 │ 4 47 │ 2 48 │ 6 49 │ 1 50 │ 4 51 │ 3 52 │ 1 53 │ 5 54 │ 5 55 │ 4 56 │ 1 57 │ 7 58 │ 1 59 │ 6 60 │ 1 61 │ 3 62 │ 2 63 │ 2 64 │ 4 65 │ 9 66 │ 6 67 │ 6 68 │ 6 69 │ 1 70 │ 3 71 │ 4 72 │ 5 73 │ 5 74 │ 5 75 │ 2 76 │ 1 77 │ 2 78 │ 5 79 │ 2 80 │ 8 81 │ 3 LocalSearchSolvers.TimeStamps(1.740710895451324e9, 1.740710897918128e9, 1.740710898776194e9, 1.74071089877634e9, 1.740710898776345e9, 1.74071090792299e9, 1.740710907953616e9) ┌ Info: Remote stop: report main pool │ best_values(s.pool) = │ 5-element Dictionary{Int64, Int64}: │ 1 │ 20 │ ⋮ │ ⋮ │ 5 │ 1 │ has_solution(s) = false │ s.rc_report = RemoteChannel{Channel{Nothing}}(1, 1, 10) │ s.rc_sol = RemoteChannel{Channel{Union{LocalSearchSolvers.EmptyPool, LocalSearchSolvers._Pool}}}(1, 1, 11) │ s.rc_stop = RemoteChannel{Channel{Nothing}}(1, 1, 12) └ length(s.remotes) = 0 ┌ Warning: debugging remote stop │ nworkers() = 1 │ length(s.remotes) = 0 └ @ LocalSearchSolvers ~/.julia/packages/LocalSearchSolvers/SFF5k/src/solvers/main.jl:125 ┌ Info: Remote stop: report best pool │ best_values(s.pool) = │ 5-element Dictionary{Int64, Int64}: │ 1 │ 20 │ 2 │ 20 │ ⋮ │ ⋮ │ 5 │ 1 └ length(s.remotes) = 0 [ Info: Results golomb! [ Info: Values: {1 = 20, 2 = 20, 3 = 5, 4 = 13, 5 = 1} [ Info: Sol (val): 2.0 [ Info: Sol (vals): {1 = 20, 2 = 20, 3 = 5, 4 = 13, 5 = 1} ┌ Info: Remote stop: report main pool │ best_values(s.pool) = │ 6-element Dictionary{Int64, Int64}: │ 1 │ 4 │ ⋮ │ ⋮ │ 6 │ 0 │ has_solution(s) = false │ s.rc_report = RemoteChannel{Channel{Nothing}}(1, 1, 13) │ s.rc_sol = RemoteChannel{Channel{Union{LocalSearchSolvers.EmptyPool, LocalSearchSolvers._Pool}}}(1, 1, 14) │ s.rc_stop = RemoteChannel{Channel{Nothing}}(1, 1, 15) └ length(s.remotes) = 0 ┌ Warning: debugging remote stop │ nworkers() = 1 │ length(s.remotes) = 0 └ @ LocalSearchSolvers ~/.julia/packages/LocalSearchSolvers/SFF5k/src/solvers/main.jl:125 ┌ Info: Remote stop: report best pool │ best_values(s.pool) = │ 6-element Dictionary{Int64, Int64}: │ 1 │ 4 │ 2 │ 1 │ ⋮ │ ⋮ │ 6 │ 0 └ length(s.remotes) = 0 [ Info: Results mincut! [ Info: Values: {1 = 4, 2 = 1, 3 = 3, 4 = 0, 5 = 1, 6 = 0} [ Info: Sol (val): 2.0 [ Info: Sol (vals): {1 = 4, 2 = 1, 3 = 3, 4 = 0, 5 = 1, 6 = 0} ┌ Info: Remote stop: report main pool │ best_values(s.pool) = │ 6-element Dictionary{Int64, Int64}: │ 1 │ 3 │ ⋮ │ ⋮ │ 6 │ 1 │ has_solution(s) = false │ s.rc_report = RemoteChannel{Channel{Nothing}}(1, 1, 16) │ s.rc_sol = RemoteChannel{Channel{Union{LocalSearchSolvers.EmptyPool, LocalSearchSolvers._Pool}}}(1, 1, 17) │ s.rc_stop = RemoteChannel{Channel{Nothing}}(1, 1, 18) └ length(s.remotes) = 0 ┌ Warning: debugging remote stop │ nworkers() = 1 │ length(s.remotes) = 0 └ @ LocalSearchSolvers ~/.julia/packages/LocalSearchSolvers/SFF5k/src/solvers/main.jl:125 ┌ Info: Remote stop: report best pool │ best_values(s.pool) = │ 6-element Dictionary{Int64, Int64}: │ 1 │ 3 │ 2 │ 0 │ ⋮ │ ⋮ │ 6 │ 1 └ length(s.remotes) = 0 [ Info: Results 1-mincut! [ Info: Values: {1 = 0, 2 = 2, 3 = 5, 4 = 4, 5 = 3, 6 = 1} [ Info: Sol (val): 2.0 [ Info: Sol (vals): {1 = 3, 2 = 0, 3 = 5, 4 = 4, 5 = 0, 6 = 1} ┌ Info: Remote stop: report main pool │ best_values(s.pool) = │ 6-element Dictionary{Int64, Int64}: │ 1 │ 0 │ ⋮ │ ⋮ │ 6 │ 4 │ has_solution(s) = false │ s.rc_report = RemoteChannel{Channel{Nothing}}(1, 1, 19) │ s.rc_sol = RemoteChannel{Channel{Union{LocalSearchSolvers.EmptyPool, LocalSearchSolvers._Pool}}}(1, 1, 20) │ s.rc_stop = RemoteChannel{Channel{Nothing}}(1, 1, 21) └ length(s.remotes) = 0 ┌ Warning: debugging remote stop │ nworkers() = 1 │ length(s.remotes) = 0 └ @ LocalSearchSolvers ~/.julia/packages/LocalSearchSolvers/SFF5k/src/solvers/main.jl:125 ┌ Info: Remote stop: report best pool │ best_values(s.pool) = │ 6-element Dictionary{Int64, Int64}: │ 1 │ 0 │ 2 │ 5 │ ⋮ │ ⋮ │ 6 │ 4 └ length(s.remotes) = 0 [ Info: Results 2-mincut! [ Info: Values: {1 = 1, 2 = 5, 3 = 0, 4 = 0, 5 = 5, 6 = 1} [ Info: Sol (val): 1.0 [ Info: Sol (vals): {1 = 0, 2 = 5, 3 = 2, 4 = 4, 5 = 2, 6 = 4} [ Info: Dict(:model_and_run => 15.010031938552856, :remote_stop => 0.006514787673950195, :total_run => 15.010031938552856, :init => 0.0006740093231201172, :threads_start => 7.200241088867188e-5, :model => 0.0, :local_run => 15.002767086029053, :remote_start => 4.0531158447265625e-6) Test Summary: | Pass Broken Total Time LocalSearchSolvers.jl | 211 1 212 4m17.8s Testing LocalSearchSolvers tests passed Testing completed after 289.54s PkgEval succeeded after 355.33s