Package evaluation of SpatialAccessTrees on Julia 1.10.9 (96dc2d8c45*) started at 2025-06-06T16:31:27.240


################################################################################
# Set-up
#

Installing PkgEval dependencies (TestEnv)...

Set-up completed after 5.19s


################################################################################
# Installation
#

Installing SpatialAccessTrees...
   Resolving package versions...
    Updating `~/.julia/environments/v1.10/Project.toml`
  [c0867ef0] + SpatialAccessTrees v0.3.3
    Updating `~/.julia/environments/v1.10/Manifest.toml`
⌅ [79e6a3ab] + Adapt v3.7.2
⌅ [4fba245c] + ArrayInterface v6.0.25
  [30b0a656] + ArrayInterfaceCore v0.1.29
  [015c0d05] + ArrayInterfaceOffsetArrays v0.1.7
  [b0d46f97] + ArrayInterfaceStaticArrays v0.1.5
  [dd5226c6] + ArrayInterfaceStaticArraysCore v0.1.4
  [62783981] + BitTwiddlingConvenienceFunctions v0.1.6
⌅ [2a0fbf3d] + CPUSummary v0.1.30
⌃ [fb6a15b2] + CloseOpenIntervals v0.1.11
  [34da2185] + Compat v4.16.0
  [adafc99b] + CpuId v0.3.1
  [9a962f9c] + DataAPI v1.16.0
  [864edb3b] + DataStructures v0.18.22
  [b4f34e82] + Distances v0.10.12
  [ffbed154] + DocStringExtensions v0.9.4
  [5789e2e9] + FileIO v1.17.0
  [3e5b6fbb] + HostCPUFeatures v0.1.17
  [615f187c] + IfElse v0.1.1
  [92d709cd] + IrrationalConstants v0.2.4
⌅ [033835bb] + JLD2 v0.4.54
⌃ [10f19ff3] + LayoutPointers v0.1.13
  [2ab3a3ac] + LogExpFunctions v0.3.29
⌃ [bdcacae8] + LoopVectorization v0.12.150
  [1914dd2f] + MacroTools v0.5.16
  [d125e4d3] + ManualMemory v0.1.8
  [e1d29d7a] + Missings v1.2.0
  [6fe1bfb0] + OffsetArrays v1.17.0
  [bac558e1] + OrderedCollections v1.8.1
  [d96e819e] + Parameters v0.12.3
⌅ [f517fe37] + Polyester v0.6.20
⌅ [1d0040c9] + PolyesterWeave v0.1.13
⌅ [aea7be01] + PrecompileTools v1.2.1
  [21216c6a] + Preferences v1.4.3
  [ae029012] + Requires v1.3.1
  [94e857df] + SIMDTypes v0.1.0
  [476501e8] + SLEEFPirates v0.6.43
⌅ [0e966ebe] + SearchModels v0.3.3
⌅ [053f045d] + SimilaritySearch v0.10.12
  [66db9d55] + SnoopPrecompile v1.0.3
  [a2af1166] + SortingAlgorithms v1.2.1
  [c0867ef0] + SpatialAccessTrees v0.3.3
⌅ [aedffcd0] + Static v0.8.10
  [90137ffa] + StaticArrays v1.9.13
  [1e83bf80] + StaticArraysCore v1.4.3
  [82ae8749] + StatsAPI v1.7.1
⌅ [2913bbd2] + StatsBase v0.33.21
⌅ [7792a7ef] + StrideArraysCore v0.4.7
  [8290d209] + ThreadingUtilities v0.5.4
  [3bb67fe8] + TranscodingStreams v0.11.3
  [3a884ed6] + UnPack v1.0.2
⌃ [3d5dd08c] + VectorizationBase v0.21.58
  [0dad84c5] + ArgTools v1.1.1
  [56f22d72] + Artifacts
  [2a0f44e3] + Base64
  [ade2ca70] + Dates
  [8ba89e20] + Distributed
  [f43a241f] + Downloads v1.6.0
  [7b1f6079] + FileWatching
  [b77e0a4c] + InteractiveUtils
  [b27032c2] + LibCURL v0.6.4
  [76f85450] + LibGit2
  [8f399da3] + Libdl
  [37e2e46d] + LinearAlgebra
  [56ddb016] + Logging
  [d6f4376e] + Markdown
  [a63ad114] + Mmap
  [ca575930] + NetworkOptions v1.2.0
  [44cfe95a] + Pkg v1.10.0
  [de0858da] + Printf
  [3fa0cd96] + REPL
  [9a3f8284] + Random
  [ea8e919c] + SHA v0.7.0
  [9e88b42a] + Serialization
  [6462fe0b] + Sockets
  [2f01184e] + SparseArrays v1.10.0
  [10745b16] + Statistics v1.10.0
  [4607b0f0] + SuiteSparse
  [fa267f1f] + TOML v1.0.3
  [a4e569a6] + Tar v1.10.0
  [cf7118a7] + UUIDs
  [4ec0a83e] + Unicode
  [e66e0078] + CompilerSupportLibraries_jll v1.1.1+0
  [deac9b47] + LibCURL_jll v8.4.0+0
  [e37daf67] + LibGit2_jll v1.6.4+0
  [29816b5a] + LibSSH2_jll v1.11.0+1
  [c8ffd9c3] + MbedTLS_jll v2.28.2+1
  [14a3606d] + MozillaCACerts_jll v2023.1.10
  [4536629a] + OpenBLAS_jll v0.3.23+4
  [bea87d4a] + SuiteSparse_jll v7.2.1+1
  [83775a58] + Zlib_jll v1.2.13+1
  [8e850b90] + libblastrampoline_jll v5.11.0+0
  [8e850ede] + nghttp2_jll v1.52.0+1
  [3f19e933] + p7zip_jll v17.4.0+2
        Info Packages marked with ⌃ and ⌅ have new versions available. Those with ⌃ may be upgradable, but those with ⌅ are restricted by compatibility constraints from upgrading. To see why use `status --outdated -m`

Installation completed after 8.0s


################################################################################
# Precompilation
#

Precompiling PkgEval dependencies...

Precompiling package dependencies...

Precompilation completed after 131.16s


################################################################################
# Testing
#

     Testing SpatialAccessTrees
      Status `/tmp/jl_zeAKVw/Project.toml`
  [d96e819e] Parameters v0.12.3
⌅ [f517fe37] Polyester v0.6.20
⌅ [0e966ebe] SearchModels v0.3.3
⌅ [053f045d] SimilaritySearch v0.10.12
  [c0867ef0] SpatialAccessTrees v0.3.3
  [9a3f8284] Random
  [8dfed614] Test
      Status `/tmp/jl_zeAKVw/Manifest.toml`
⌅ [79e6a3ab] Adapt v3.7.2
⌅ [4fba245c] ArrayInterface v6.0.25
  [30b0a656] ArrayInterfaceCore v0.1.29
  [015c0d05] ArrayInterfaceOffsetArrays v0.1.7
  [b0d46f97] ArrayInterfaceStaticArrays v0.1.5
  [dd5226c6] ArrayInterfaceStaticArraysCore v0.1.4
  [62783981] BitTwiddlingConvenienceFunctions v0.1.6
⌅ [2a0fbf3d] CPUSummary v0.1.30
⌃ [fb6a15b2] CloseOpenIntervals v0.1.11
  [34da2185] Compat v4.16.0
  [adafc99b] CpuId v0.3.1
  [9a962f9c] DataAPI v1.16.0
  [864edb3b] DataStructures v0.18.22
  [b4f34e82] Distances v0.10.12
  [ffbed154] DocStringExtensions v0.9.4
  [5789e2e9] FileIO v1.17.0
  [3e5b6fbb] HostCPUFeatures v0.1.17
  [615f187c] IfElse v0.1.1
  [92d709cd] IrrationalConstants v0.2.4
⌅ [033835bb] JLD2 v0.4.54
⌃ [10f19ff3] LayoutPointers v0.1.13
  [2ab3a3ac] LogExpFunctions v0.3.29
⌃ [bdcacae8] LoopVectorization v0.12.150
  [1914dd2f] MacroTools v0.5.16
  [d125e4d3] ManualMemory v0.1.8
  [e1d29d7a] Missings v1.2.0
  [6fe1bfb0] OffsetArrays v1.17.0
  [bac558e1] OrderedCollections v1.8.1
  [d96e819e] Parameters v0.12.3
⌅ [f517fe37] Polyester v0.6.20
⌅ [1d0040c9] PolyesterWeave v0.1.13
⌅ [aea7be01] PrecompileTools v1.2.1
  [21216c6a] Preferences v1.4.3
  [ae029012] Requires v1.3.1
  [94e857df] SIMDTypes v0.1.0
  [476501e8] SLEEFPirates v0.6.43
⌅ [0e966ebe] SearchModels v0.3.3
⌅ [053f045d] SimilaritySearch v0.10.12
  [66db9d55] SnoopPrecompile v1.0.3
  [a2af1166] SortingAlgorithms v1.2.1
  [c0867ef0] SpatialAccessTrees v0.3.3
⌅ [aedffcd0] Static v0.8.10
  [90137ffa] StaticArrays v1.9.13
  [1e83bf80] StaticArraysCore v1.4.3
  [82ae8749] StatsAPI v1.7.1
⌅ [2913bbd2] StatsBase v0.33.21
⌅ [7792a7ef] StrideArraysCore v0.4.7
  [8290d209] ThreadingUtilities v0.5.4
  [3bb67fe8] TranscodingStreams v0.11.3
  [3a884ed6] UnPack v1.0.2
⌃ [3d5dd08c] VectorizationBase v0.21.58
  [0dad84c5] ArgTools v1.1.1
  [56f22d72] Artifacts
  [2a0f44e3] Base64
  [ade2ca70] Dates
  [8ba89e20] Distributed
  [f43a241f] Downloads v1.6.0
  [7b1f6079] FileWatching
  [b77e0a4c] InteractiveUtils
  [b27032c2] LibCURL v0.6.4
  [76f85450] LibGit2
  [8f399da3] Libdl
  [37e2e46d] LinearAlgebra
  [56ddb016] Logging
  [d6f4376e] Markdown
  [a63ad114] Mmap
  [ca575930] NetworkOptions v1.2.0
  [44cfe95a] Pkg v1.10.0
  [de0858da] Printf
  [3fa0cd96] REPL
  [9a3f8284] Random
  [ea8e919c] SHA v0.7.0
  [9e88b42a] Serialization
  [6462fe0b] Sockets
  [2f01184e] SparseArrays v1.10.0
  [10745b16] Statistics v1.10.0
  [4607b0f0] SuiteSparse
  [fa267f1f] TOML v1.0.3
  [a4e569a6] Tar v1.10.0
  [8dfed614] Test
  [cf7118a7] UUIDs
  [4ec0a83e] Unicode
  [e66e0078] CompilerSupportLibraries_jll v1.1.1+0
  [deac9b47] LibCURL_jll v8.4.0+0
  [e37daf67] LibGit2_jll v1.6.4+0
  [29816b5a] LibSSH2_jll v1.11.0+1
  [c8ffd9c3] MbedTLS_jll v2.28.2+1
  [14a3606d] MozillaCACerts_jll v2023.1.10
  [4536629a] OpenBLAS_jll v0.3.23+4
  [bea87d4a] SuiteSparse_jll v7.2.1+1
  [83775a58] Zlib_jll v1.2.13+1
  [8e850b90] libblastrampoline_jll v5.11.0+0
  [8e850ede] nghttp2_jll v1.52.0+1
  [3f19e933] p7zip_jll v17.4.0+2
        Info Packages marked with ⌃ and ⌅ have new versions available. Those with ⌃ may be upgradable, but those with ⌅ are restricted by compatibility constraints from upgrading.
     Testing Running tests...
WARNING: Method definition boundscheck() in module StrideArraysCore at /home/pkgeval/.julia/packages/StrideArraysCore/lUhTe/src/ptr_array.jl:886 overwritten at /home/pkgeval/.julia/packages/StrideArraysCore/lUhTe/src/StrideArraysCore.jl:72.
[ Info: ============================= SatInitialPartition() -- ProximalSortSat() -- minleaf=4 ================
[ Info: Sat
sum((c !== nothing for c = sat.children)) = 2240
[ Info: SearchGraph
  4.455225 seconds (2.48 M allocations: 164.198 MiB, 9.08% gc time, 90.88% compilation time)
[ Info: ------------ brute force: 0.016474749 -- sort sat: ProximalSortSat -- brute-force searchtime: 0.016474749, buildtime: 1.539886899
┌ Info:  exact sat:
│   recall = 1.0
│   searchtime = 0.010507568
└   bruteforcesearchtime / searchtime = 1.5678936362819635
┌ Info:  permuted exact sat:
│   precall = 1.0
│   psearchtime = 0.014860015
└   bruteforcesearchtime / psearchtime = 1.108663012789691
┌ Info:  sat with probabilistic spell:
│   arecall = 0.9140000000000001
│   asearchtime = 0.005826883
│   bruteforcesearchtime / asearchtime = 2.827369109693811
└   first(alist) = SpatialAccessTrees.PruningSatFactor(0.17468774f0) => (visited = (700.0, 1667.0, 2380.0), radius = (0.11036776006221771, 0.13073424845933915, 0.21284009516239166), recall = 0.9000000000000001, searchtime = 5.69304e-5)
┌ Info:  perm sat with probabilistic spell:
│   parecall = 0.9140000000000001
│   pasearchtime = 0.005210319
│   bruteforcesearchtime / pasearchtime = 3.1619463222885202
└   first(palist) = SpatialAccessTrees.PruningSatFactor(0.17468774f0) => (visited = (700.0, 1667.0, 2380.0), radius = (0.11036776006221771, 0.13073424845933915, 0.21284009516239166), recall = 0.9000000000000001, searchtime = 5.12805e-5)
┌ Info:  sat with beam search:
│   brecall = 0.8079999999999999
│   bsearchtime = 0.002258658
│   bruteforcesearchtime / bsearchtime = 7.2940431884774055
│   first(blist) =
│    BeamSearch
│      bsize: Int32 16
│      Δ: Float32 3.0f0
│      maxvisits: Int64 1000000
└     => (visited = (205.0, 370.7, 527.0), radius = (0.1140252873301506, 0.12821611613035203, 0.17226386070251465), recall = 0.89, searchtime = 1.80099e-5)
┌ Info:  search graph:
│   grecall = 0.9310000000000003
│   gsearchtime = 0.000685733
│   bruteforcesearchtime / gsearchtime = 24.02501994216408
│   first(glist) =
│    BeamSearch
│      bsize: Int32 2
│      Δ: Float32 0.93457943f0
│      maxvisits: Int64 1000000
└     => (visited = (115.0, 139.1, 168.0), radius = (0.1140252873301506, 0.12491903603076934, 0.16277530789375305), recall = 0.9, searchtime = 6.9619e-6)
[ Info: ============================= SatInitialPartition() -- DistalSortSat() -- minleaf=4 ================
[ Info: Sat
sum((c !== nothing for c = sat.children)) = 2403
[ Info: SearchGraph
  0.365424 seconds (364.21 k allocations: 23.692 MiB)
[ Info: ------------ brute force: 0.016474749 -- sort sat: DistalSortSat -- brute-force searchtime: 0.016474749, buildtime: 0.526321069
┌ Info:  exact sat:
│   recall = 1.0
│   searchtime = 0.005571085
└   bruteforcesearchtime / searchtime = 2.957188590732326
┌ Info:  permuted exact sat:
│   precall = 1.0
│   psearchtime = 0.005098
└   bruteforcesearchtime / psearchtime = 3.231610239309533
┌ Info:  sat with probabilistic spell:
│   arecall = 0.9100000000000001
│   asearchtime = 0.002176009
│   bruteforcesearchtime / asearchtime = 7.571084954152304
└   first(alist) = SpatialAccessTrees.PruningSatFactor(0.3493755f0) => (visited = (283.0, 541.4, 749.0), radius = (0.11146368086338043, 0.1251197449862957, 0.16277530789375305), recall = 0.9199999999999999, searchtime = 1.96608e-5)
┌ Info:  perm sat with probabilistic spell:
│   parecall = 0.9120000000000001
│   pasearchtime = 0.002044661
│   bruteforcesearchtime / pasearchtime = 8.057447664918536
└   first(palist) = SpatialAccessTrees.PruningSatFactor(0.3564931f0) => (visited = (283.0, 552.1, 749.0), radius = (0.11146368086338043, 0.1251197449862957, 0.16277530789375305), recall = 0.9199999999999999, searchtime = 1.9009800000000002e-5)
┌ Info:  sat with beam search:
│   brecall = 0.9229999999999999
│   bsearchtime = 0.003167289
│   bruteforcesearchtime / bsearchtime = 5.201530078246727
│   first(blist) =
│    BeamSearch
│      bsize: Int32 42
│      Δ: Float32 2.4408f0
│      maxvisits: Int64 1000000
└     => (visited = (548.0, 766.1, 1228.0), radius = (0.11146368086338043, 0.12607315555214882, 0.16277530789375305), recall = 0.9400000000000001, searchtime = 3.36696e-5)
┌ Info:  search graph:
│   grecall = 0.9400000000000002
│   gsearchtime = 0.000723683
│   bruteforcesearchtime / gsearchtime = 22.765145788971136
│   first(glist) =
│    BeamSearch
│      bsize: Int32 2
│      Δ: Float32 0.9374871f0
│      maxvisits: Int64 1000000
└     => (visited = (120.0, 142.0, 155.0), radius = (0.11052349954843521, 0.12548448592424394, 0.16277530789375305), recall = 0.9200000000000002, searchtime = 5.225e-6)
[ Info: ============================= RandomInitialPartition(64, false) -- RandomSortSat() -- minleaf=4 ================
[ Info: Sat
sum((c !== nothing for c = sat.children)) = 2357
[ Info: SearchGraph
  0.609385 seconds (376.75 k allocations: 25.006 MiB, 7.79% gc time)
[ Info: ------------ brute force: 0.016474749 -- sort sat: RandomSortSat -- brute-force searchtime: 0.016474749, buildtime: 1.118060659
┌ Info:  exact sat:
│   recall = 1.0
│   searchtime = 0.020601879
└   bruteforcesearchtime / searchtime = 0.7996721561174105
┌ Info:  permuted exact sat:
│   precall = 1.0
│   psearchtime = 0.021291872
└   bruteforcesearchtime / psearchtime = 0.7737576573821222
┌ Info:  sat with probabilistic spell:
│   arecall = 0.8940000000000002
│   asearchtime = 0.018029434
│   bruteforcesearchtime / asearchtime = 0.9137696169497057
└   first(alist) = SpatialAccessTrees.PruningSatFactor(0.10878673f0) => (visited = (1858.0, 3879.9, 5190.0), radius = (0.11052349954843521, 0.12587499395012855, 0.16983501613140106), recall = 0.9100000000000001, searchtime = 0.0001966121)
┌ Info:  perm sat with probabilistic spell:
│   parecall = 0.8880000000000001
│   pasearchtime = 0.017301251
│   bruteforcesearchtime / pasearchtime = 0.9522287723587156
└   first(palist) = SpatialAccessTrees.PruningSatFactor(0.10166984f0) => (visited = (1839.0, 3869.5, 5190.0), radius = (0.11052349954843521, 0.12587499395012855, 0.16983501613140106), recall = 0.9100000000000001, searchtime = 0.00018131429999999999)
┌ Info:  sat with beam search:
│   brecall = 0.5479999999999998
│   bsearchtime = 0.015783606
│   bruteforcesearchtime / bsearchtime = 1.0437886627428485
│   first(blist) =
│    BeamSearch
│      bsize: Int32 140
│      Δ: Float32 2.9903998f0
│      maxvisits: Int64 1000000
└     => (visited = (1557.0, 2098.2, 2533.0), radius = (0.11804287135601044, 0.1468297101557255, 0.19125668704509735), recall = 0.5900000000000001, searchtime = 0.0001626124)
┌ Info:  search graph:
│   grecall = 0.9440000000000001
│   gsearchtime = 0.00098839
│   bruteforcesearchtime / gsearchtime = 16.66826758668137
│   first(glist) =
│    BeamSearch
│      bsize: Int32 2
│      Δ: Float32 0.8996498f0
│      maxvisits: Int64 1000000
└     => (visited = (118.0, 137.4, 162.0), radius = (0.11052349954843521, 0.12436227574944496, 0.16277530789375305), recall = 0.93, searchtime = 8.1189e-6)
[ Info: ============================= RandomInitialPartition(64, true) -- RandomSortSat() -- minleaf=4 ================
[ Info: Sat
sum((c !== nothing for c = sat.children)) = 2365
[ Info: SearchGraph
  0.568520 seconds (380.34 k allocations: 25.033 MiB, 2.56% gc time)
[ Info: ------------ brute force: 0.016474749 -- sort sat: RandomSortSat -- brute-force searchtime: 0.016474749, buildtime: 0.007842783
┌ Info:  exact sat:
│   recall = 1.0
│   searchtime = 0.025075475
└   bruteforcesearchtime / searchtime = 0.657006457504793
┌ Info:  permuted exact sat:
│   precall = 1.0
│   psearchtime = 0.022396692
└   bruteforcesearchtime / psearchtime = 0.735588496729785
┌ Info:  sat with probabilistic spell:
│   arecall = 0.9360000000000003
│   asearchtime = 0.02153241
│   bruteforcesearchtime / asearchtime = 0.7651140304313359
└   first(alist) = SpatialAccessTrees.PruningSatFactor(0.2f0) => (visited = (1916.0, 4041.6, 5416.0), radius = (0.11036776006221771, 0.13072706535458564, 0.21894565224647522), recall = 0.9, searchtime = 0.00022164979999999998)
┌ Info:  perm sat with probabilistic spell:
│   parecall = 0.9360000000000003
│   pasearchtime = 0.018431639
│   bruteforcesearchtime / pasearchtime = 0.8938298433470838
└   first(palist) = SpatialAccessTrees.PruningSatFactor(0.2f0) => (visited = (1916.0, 4041.6, 5416.0), radius = (0.11036776006221771, 0.13072706535458564, 0.21894565224647522), recall = 0.9, searchtime = 0.000201584)
┌ Info:  sat with beam search:
│   brecall = 0.5730000000000001
│   bsearchtime = 0.016317951
│   bruteforcesearchtime / bsearchtime = 1.0096089270031512
│   first(blist) =
│    BeamSearch
│      bsize: Int32 162
│      Δ: Float32 2.9865599f0
│      maxvisits: Int64 1000000
└     => (visited = (1618.0, 2148.8, 2901.0), radius = (0.11804287135601044, 0.14344561770558356, 0.2017085701227188), recall = 0.6, searchtime = 0.0001713444)
┌ Info:  search graph:
│   grecall = 0.8980000000000002
│   gsearchtime = 0.000946671
│   bruteforcesearchtime / gsearchtime = 17.40282421242438
│   first(glist) =
│    BeamSearch
│      bsize: Int32 2
│      Δ: Float32 0.79917186f0
│      maxvisits: Int64 1000000
└     => (visited = (115.0, 142.1, 164.0), radius = (0.11146368086338043, 0.12439158484339714, 0.16277530789375305), recall = 0.93, searchtime = 8.9929e-6)
[ Info: ============================= SatInitialPartition() -- RandomSortSat() -- minleaf=4 ================
[ Info: Sat
sum((c !== nothing for c = sat.children)) = 2358
[ Info: SearchGraph
  0.562071 seconds (372.84 k allocations: 24.827 MiB, 2.72% gc time)
[ Info: ------------ brute force: 0.016474749 -- sort sat: RandomSortSat -- brute-force searchtime: 0.016474749, buildtime: 0.030184045
┌ Info:  exact sat:
│   recall = 1.0
│   searchtime = 0.008970672
└   bruteforcesearchtime / searchtime = 1.836512247911862
┌ Info:  permuted exact sat:
│   precall = 1.0
│   psearchtime = 0.008324869
└   bruteforcesearchtime / psearchtime = 1.9789799695346557
┌ Info:  sat with probabilistic spell:
│   arecall = 0.89
│   asearchtime = 0.004424767
│   bruteforcesearchtime / asearchtime = 3.7233031705398276
└   first(alist) = SpatialAccessTrees.PruningSatFactor(0.3f0) => (visited = (383.0, 772.9, 1112.0), radius = (0.11146368086338043, 0.12744346633553505, 0.18883255124092102), recall = 0.9099999999999999, searchtime = 4.6725500000000005e-5)
┌ Info:  perm sat with probabilistic spell:
│   parecall = 0.89
│   pasearchtime = 0.003932092
│   bruteforcesearchtime / pasearchtime = 4.189817786562472
└   first(palist) = SpatialAccessTrees.PruningSatFactor(0.3f0) => (visited = (383.0, 772.9, 1112.0), radius = (0.11146368086338043, 0.12744346633553505, 0.18883255124092102), recall = 0.9099999999999999, searchtime = 4.26125e-5)
┌ Info:  sat with beam search:
│   brecall = 0.8580000000000001
│   bsearchtime = 0.002177839
│   bruteforcesearchtime / bsearchtime = 7.564723103957639
│   first(blist) =
│    BeamSearch
│      bsize: Int32 14
│      Δ: Float32 2.9267995f0
│      maxvisits: Int64 1000000
└     => (visited = (238.0, 287.5, 403.0), radius = (0.11036776006221771, 0.12657908275723456, 0.16277530789375305), recall = 0.9, searchtime = 2.11658e-5)
┌ Info:  search graph:
│   grecall = 0.9129999999999999
│   gsearchtime = 0.000671054
│   bruteforcesearchtime / gsearchtime = 24.550556289061685
│   first(glist) =
│    BeamSearch
│      bsize: Int32 2
│      Δ: Float32 0.7607477f0
│      maxvisits: Int64 1000000
└     => (visited = (115.0, 141.0, 160.0), radius = (0.11052349954843521, 0.1253785654902458, 0.16277530789375305), recall = 0.93, searchtime = 5.6739e-6)
Test Summary:      | Pass  Total   Time
SpatialAccessTrees |   45     45  30.6s
================= PrunParSat ================
SpatialAccessTrees.PrunParSatConfig(15, 0.3814476f0) => (visited = (1203.0, 1778.625, 2864.0), radius = (0.3506699800491333, 0.4149819239974022, 0.504944920539856), recall = 0.9000000000000001, searchtime = 0.0001297)
bruteforcesearchtime = 2.90448269
bruteforcesearchtime / searchtime = 1.9343716848899961
searchtime = 1.501512203
buildtime = 0.024963626
macrorecall(Igold, I) = 0.9243733333333335
================= BeamSearchParSat ================
SpatialAccessTrees.BeamSearchParSatConfig(15, BeamSearch
  bsize: Int32 60
  Δ: Float32 1.8f0
  maxvisits: Int64 1000000
) => (visited = (636.0, 956.0625, 1232.0), radius = (0.34324729442596436, 0.401460500434041, 0.45251426100730896), recall = 0.9000000000000001, searchtime = 7.7193e-5)
bruteforcesearchtime = 2.90448269
bruteforcesearchtime / searchtime = 3.072650521490403
searchtime = 0.945269457
buildtime = 0.025151554
macrorecall(Igold, I) = 0.9276466666666693
Test Summary:      | Time
SpatialAccessTrees | None  12.7s
     Testing SpatialAccessTrees tests passed 

Testing completed after 61.27s

PkgEval succeeded after 232.46s