Package evaluation to load GenericArpack on Julia 1.14.0-DEV.2309 (6e1a27e459*) started at 2026-06-06T02:45:15.164 ################################################################################ # Set-up # Set-up completed after 0.14s ################################################################################ # Installation # Installing GenericArpack... Resolving package versions... Installed GenericArpack ─ v0.2.1 Updating `~/.julia/environments/v1.14/Project.toml` [408c25d7] + GenericArpack v0.2.1 Updating `~/.julia/environments/v1.14/Manifest.toml` [408c25d7] + GenericArpack v0.2.1 [56f22d72] + Artifacts v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.14.0 [e66e0078] + CompilerSupportLibraries_jll v1.5.2+0 [4536629a] + OpenBLAS_jll v0.3.33+0 [8e850b90] + libblastrampoline_jll v5.15.0+0 Installation completed after 5.48s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Project No packages added to or removed from `~/.julia/environments/pkgeval/Project.toml` Manifest No packages added to or removed from `~/.julia/environments/pkgeval/Manifest.toml` Precompiling package dependencies... Precompiling project... ┌ Info: JuliaLowering threw given input: │ code = │ :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 =# Core.@doc "Sort the array X1 in the order specified by WHICH and optionally\napplies the permutation to the array X2.\n\nUsage:\ncall dsortr\n ( WHICH, APPLY, N, X1, X2 )\n\nArguments\nWHICH Character*2. (Input)\n 'LM' -> X1 is sorted into increasing order of magnitude.\n 'SM' -> X1 is sorted into decreasing order of magnitude.\n 'LA' -> X1 is sorted into increasing order of algebraic.\n 'SA' -> X1 is sorted into decreasing order of algebraic.\n\nAPPLY Logical. (Input)\n APPLY = .TRUE. -> apply the sorted order to X2.\n APPLY = .FALSE. -> do not apply the sorted order to X2.\n\nN Integer. (INPUT)\n Size of the arrays.\n\nX1 Double precision array of length N. (INPUT/OUTPUT)\n The array to be sorted.\n\nX2 Double precision array of length N. (INPUT/OUTPUT)\n Only referenced if APPLY = .TRUE.\n\nReturns: nothing\n\n" function dsortr(which::Symbol, apply::Bool, n::Int, x1::AbstractVector{T}, x2::AbstractVecOrMat) where T <: AbstractFloat │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:255 =# │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:263 =# │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:263 =# @jl_arpack_check_length x1 n │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:264 =# │ if apply │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:265 =# │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:265 =# @jl_arpack_check_length x2 n │ end │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:270 =# │ if which == :SA │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271 =# │ _dsortr_loop(((x::T, y::T)->begin │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271 =# │ x < y │ end), apply, n, x1, x2) │ elseif #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:272 =# which == :SM │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:273 =# │ _dsortr_loop(((x::T, y::T)->begin │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:273 =# │ abs(x) < abs(y) │ end), apply, n, x1, x2) │ elseif #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:274 =# which == :LA │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:275 =# │ _dsortr_loop(((x::T, y::T)->begin │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:275 =# │ x > y │ end), apply, n, x1, x2) │ elseif #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:276 =# which == :LM │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:277 =# │ _dsortr_loop(((x::T, y::T)->begin │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:277 =# │ abs(x) > abs(y) │ end), apply, n, x1, x2) │ end │ end) │ st0 = │ SyntaxTree with attributes mod,kind,var_id,toplevel_pure,scope_type,macro_source,name_val,syntax_flags,meta,scope_layer,value,jl_source,is_toplevel_thunk,source,__macro_ctx__ │ [macrocall] │ │ @doc :: Identifier │ mod │ :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 =#) :: Value │ │ "Sort the array X1 in the order specified by WHICH and optionally\napplies the permutation to the array X2.\n\nUsage:\ncall dsortr\n ( WHICH, APPLY, N, X1, X2 )\n\nArguments\nWHICH Character*2. (Input)\n 'LM' -> X1 is sorted into increasing order of magnitude.\n 'SM' -> X1 is sorted into decreasing order of magnitude.\n 'LA' -> X1 is sorted into increasing order of algebraic.\n 'SA' -> X1 is sorted into decreasing order of algebraic.\n\nAPPLY Logical. (Input)\n APPLY = .TRUE. -> apply the sorted order to X2.\n APPLY = .FALSE. -> do not apply the sorted order to X2.\n\nN Integer. (INPUT)\n Size of the arrays.\n\nX1 Double precision array of length N. (INPUT/OUTPUT)\n The array to be sorted.\n\nX2 Double precision array of length N. (INPUT/OUTPUT)\n Only referenced if APPLY = .TRUE.\n\nReturns: nothing\n\n" :: Value │ │ [function] │ │ [where] │ │ [call] │ │ dsortr :: Identifier │ │ [::] │ │ which :: Identifier │ │ Symbol :: Identifier │ │ [::] │ │ apply :: Identifier │ │ Bool :: Identifier │ │ [::] │ │ n :: Identifier │ │ Int :: Identifier │ │ [::] │ │ x1 :: Identifier │ │ [curly] │ │ AbstractVector :: Identifier │ │ T :: Identifier │ │ [::] │ │ x2 :: Identifier │ │ AbstractVecOrMat :: Identifier │ │ [<:] │ │ T :: Identifier │ │ AbstractFloat :: Identifier │ │ [block] │ │ [macrocall] │ │ @jl_arpack_check_length :: Identifier │ │ :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:263 =#) :: Value │ │ x1 :: Identifier │ │ n :: Identifier │ │ [if] │ │ apply :: Identifier │ │ [block] │ │ [macrocall] │ │ @jl_arpack_check_length :: Identifier │ │ :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:265 =#) :: Value │ │ x2 :: Identifier │ │ n :: Identifier │ │ [if] │ │ [call] │ │ == :: Identifier │ │ which :: Identifier │ │ [inert] │ │ SA :: Identifier │ │ [block] │ │ [call] │ │ _dsortr_loop :: Identifier │ │ [->] │ │ [tuple] │ │ [::] │ │ x :: Identifier │ │ T :: Identifier │ │ [::] │ │ y :: Identifier │ │ T :: Identifier │ │ [block] │ │ [call] │ │ < :: Identifier │ │ x :: Identifier │ │ y :: Identifier │ │ apply :: Identifier │ │ n :: Identifier │ │ x1 :: Identifier │ │ x2 :: Identifier │ │ [elseif] │ │ [block] │ │ [call] │ │ == :: Identifier │ │ which :: Identifier │ │ [inert] │ │ SM :: Identifier │ │ [block] │ │ [call] │ │ _dsortr_loop :: Identifier │ │ [->] │ │ [tuple] │ │ [::] │ │ x :: Identifier │ │ T :: Identifier │ │ [::] │ │ y :: Identifier │ │ T :: Identifier │ │ [block] │ │ [call] │ │ < :: Identifier │ │ [call] │ │ abs :: Identifier │ │ x :: Identifier │ │ [call] │ │ abs :: Identifier │ │ y :: Identifier │ │ apply :: Identifier │ │ n :: Identifier │ │ x1 :: Identifier │ │ x2 :: Identifier │ │ [elseif] │ │ [block] │ │ [call] │ │ == :: Identifier │ │ which :: Identifier │ │ [inert] │ │ LA :: Identifier │ │ [block] │ │ [call] │ │ _dsortr_loop :: Identifier │ │ [->] │ │ [tuple] │ │ [::] │ │ x :: Identifier │ │ T :: Identifier │ │ [::] │ │ y :: Identifier │ │ T :: Identifier │ │ [block] │ │ [call] │ │ > :: Identifier │ │ x :: Identifier │ │ y :: Identifier │ │ apply :: Identifier │ │ n :: Identifier │ │ x1 :: Identifier │ │ x2 :: Identifier │ │ [elseif] │ │ [block] │ │ [call] │ │ == :: Identifier │ │ which :: Identifier │ │ [inert] │ │ LM :: Identifier │ │ [block] │ │ [call] │ │ _dsortr_loop :: Identifier │ │ [->] │ │ [tuple] │ │ [::] │ │ x :: Identifier │ │ T :: Identifier │ │ [::] │ │ y :: Identifier │ │ T :: Identifier │ │ [block] │ │ [call] │ │ > :: Identifier │ │ [call] │ │ abs :: Identifier │ │ x :: Identifier │ │ [call] │ │ abs :: Identifier │ │ y :: Identifier │ │ apply :: Identifier │ │ n :: Identifier │ │ x1 :: Identifier │ │ x2 :: Identifier │ │ │ st1 = │ SyntaxTree with attributes mod,kind,var_id,toplevel_pure,scope_type,macro_source,name_val,syntax_flags,meta,scope_layer,value,jl_source,is_toplevel_thunk,source │ [block] │ │ [=] │ │ val :: Identifier │ scope_layer=3 │ [function] │ │ [where] │ │ [call] │ │ dsortr :: Identifier │ scope_layer=1 │ [::] │ │ which :: Identifier │ scope_layer=1 │ Symbol :: Identifier │ scope_layer=1 │ [::] │ │ apply :: Identifier │ scope_layer=1 │ Bool :: Identifier │ scope_layer=1 │ [::] │ │ n :: Identifier │ scope_layer=1 │ Int :: Identifier │ scope_layer=1 │ [::] │ │ x1 :: Identifier │ scope_layer=1 │ [curly] │ │ AbstractVector :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [::] │ │ x2 :: Identifier │ scope_layer=1 │ AbstractVecOrMat :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ AbstractFloat :: Identifier │ scope_layer=1 │ [block] │ │ [block] │ │ [if] │ │ [call] │ │ > :: Identifier │ scope_layer=1 │ n :: Identifier │ scope_layer=1 │ [call] │ │ length :: Identifier │ scope_layer=1 │ x1 :: Identifier │ scope_layer=1 │ [block] │ │ [call] │ │ throw :: Identifier │ scope_layer=1 │ [call] │ │ ArgumentError :: Identifier │ scope_layer=1 │ [call] │ │ string :: Identifier │ scope_layer=1 │ "range 1:n=" :: Value │ macro_source=157 │ n :: Identifier │ scope_layer=1 │ " out of bounds for x1 of length " :: Value │ macro_source=157 │ [call] │ │ length :: Identifier │ scope_layer=1 │ x1 :: Identifier │ scope_layer=1 │ [if] │ │ apply :: Identifier │ scope_layer=1 │ [block] │ │ [block] │ │ [if] │ │ [call] │ │ > :: Identifier │ scope_layer=1 │ n :: Identifier │ scope_layer=1 │ [call] │ │ length :: Identifier │ scope_layer=1 │ x2 :: Identifier │ scope_layer=1 │ [block] │ │ [call] │ │ throw :: Identifier │ scope_layer=1 │ [call] │ │ ArgumentError :: Identifier │ scope_layer=1 │ [call] │ │ string :: Identifier │ scope_layer=1 │ "range 1:n=" :: Value │ macro_source=157 │ n :: Identifier │ scope_layer=1 │ " out of bounds for x2 of length " :: Value │ macro_source=157 │ [call] │ │ length :: Identifier │ scope_layer=1 │ x2 :: Identifier │ scope_layer=1 │ [if] │ │ [call] │ │ == :: Identifier │ scope_layer=1 │ which :: Identifier │ scope_layer=1 │ [inert] │ │ SA :: Identifier │ │ [block] │ │ [call] │ │ _dsortr_loop :: Identifier │ scope_layer=1 │ [->] │ │ [tuple] │ │ [::] │ │ x :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [::] │ │ y :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [block] │ │ [call] │ │ < :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ y :: Identifier │ scope_layer=1 │ apply :: Identifier │ scope_layer=1 │ n :: Identifier │ scope_layer=1 │ x1 :: Identifier │ scope_layer=1 │ x2 :: Identifier │ scope_layer=1 │ [elseif] │ │ [block] │ │ [call] │ │ == :: Identifier │ scope_layer=1 │ which :: Identifier │ scope_layer=1 │ [inert] │ │ SM :: Identifier │ │ [block] │ │ [call] │ │ _dsortr_loop :: Identifier │ scope_layer=1 │ [->] │ │ [tuple] │ │ [::] │ │ x :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [::] │ │ y :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [block] │ │ [call] │ │ < :: Identifier │ scope_layer=1 │ [call] │ │ abs :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [call] │ │ abs :: Identifier │ scope_layer=1 │ y :: Identifier │ scope_layer=1 │ apply :: Identifier │ scope_layer=1 │ n :: Identifier │ scope_layer=1 │ x1 :: Identifier │ scope_layer=1 │ x2 :: Identifier │ scope_layer=1 │ [elseif] │ │ [block] │ │ [call] │ │ == :: Identifier │ scope_layer=1 │ which :: Identifier │ scope_layer=1 │ [inert] │ │ LA :: Identifier │ │ [block] │ │ [call] │ │ _dsortr_loop :: Identifier │ scope_layer=1 │ [->] │ │ [tuple] │ │ [::] │ │ x :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [::] │ │ y :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [block] │ │ [call] │ │ > :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ y :: Identifier │ scope_layer=1 │ apply :: Identifier │ scope_layer=1 │ n :: Identifier │ scope_layer=1 │ x1 :: Identifier │ scope_layer=1 │ x2 :: Identifier │ scope_layer=1 │ [elseif] │ │ [block] │ │ [call] │ │ == :: Identifier │ scope_layer=1 │ which :: Identifier │ scope_layer=1 │ [inert] │ │ LM :: Identifier │ │ [block] │ │ [call] │ │ _dsortr_loop :: Identifier │ scope_layer=1 │ [->] │ │ [tuple] │ │ [::] │ │ x :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [::] │ │ y :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [block] │ │ [call] │ │ > :: Identifier │ scope_layer=1 │ [call] │ │ abs :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [call] │ │ abs :: Identifier │ scope_layer=1 │ y :: Identifier │ scope_layer=1 │ apply :: Identifier │ scope_layer=1 │ n :: Identifier │ scope_layer=1 │ x1 :: Identifier │ scope_layer=1 │ x2 :: Identifier │ scope_layer=1 │ [call] │ │ Base.Docs.doc! :: Value │ macro_source=157 │ GenericArpack :: Value │ macro_source=157 │ [call] │ │ Base.Docs.Binding :: Value │ macro_source=157 │ GenericArpack :: Value │ │ [inert] │ jl_source=L65 │ dsortr :: Identifier │ │ [call] │ macro_source=157 │ Base.Docs.docstr :: Value │ macro_source=157 │ [call] │ macro_source=157 │ Core.svec :: Value │ macro_source=157 │ "Sort the array X1 in the order specified by WHICH and optionally\napplies the permutation to the array X2.\n\nUsage:\ncall dsortr\n ( WHICH, APPLY, N, X1, X2 )\n\nArguments\nWHICH Character*2. (Input)\n 'LM' -> X1 is sorted into increasing order of magnitude.\n 'SM' -> X1 is sorted into decreasing order of magnitude.\n 'LA' -> X1 is sorted into increasing order of algebraic.\n 'SA' -> X1 is sorted into decreasing order of algebraic.\n\nAPPLY Logical. (Input)\n APPLY = .TRUE. -> apply the sorted order to X2.\n APPLY = .FALSE. -> do not apply the sorted order to X2.\n\nN Integer. (INPUT)\n Size of the arrays.\n\nX1 Double precision array of length N. (INPUT/OUTPUT)\n The array to be sorted.\n\nX2 Double precision array of length N. (INPUT/OUTPUT)\n Only referenced if APPLY = .TRUE.\n\nReturns: nothing\n\n" :: Value │ macro_source=157 │ [call] │ macro_source=157 │ Dict{Symbol, Any} :: Value │ macro_source=157 │ :path => "/home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl" :: Value │ macro_source=157 │ :linenumber => 224 :: Value │ macro_source=157 │ :module => GenericArpack :: Value │ macro_source=157 │ [where] │ │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ Symbol :: Identifier │ scope_layer=1 │ Bool :: Identifier │ scope_layer=1 │ Int :: Identifier │ scope_layer=1 │ [curly] │ │ AbstractVector :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ AbstractVecOrMat :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ AbstractFloat :: Identifier │ scope_layer=1 │ val :: Identifier │ scope_layer=3 │ │ file = "/home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl" │ line = 224 └ mod = GenericArpack ERROR: LoadError: LoweringError: #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271 =# - Found unexpected binding of kind static_parameter Expression:  #₂₃/T Containing expressions:  (= #₆₇/T #₂₃/T)  (= #₃ (call core.svec (call core.svec #₅₂/#dsortr##->###0 #₂₃/T #₂₃/T) (call core.svec) SourceLocation:/home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271:0))  (= #₃ (call core.svec (call core.svec (function_type #₂₄/#->#) #₂₃/T #₂₃/T) (call core.svec) SourceLocation:/home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271:0))  Detailed provenance:  #₂₃/T  └─ T  └─ T  ├─ @ /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 =#) "Sort the array X1 in the order specified by WHICH and optionally\napplies the permutation to the array X2.\n\nUsage:\ncall dsortr\n ( WHICH, APPLY, N, X1, X2 )\n\nArguments\nWHICH Character*2. (Input)\n 'LM' -> X1 is sorted into increasing order of magnitude.\n 'SM' -> X1 is sorted into decreasing order of magnitude.\n 'LA' -> X1 is sorted into increasing order of algebraic.\n 'SA' -> X1 is sorted into decreasing order of algebraic.\n\nAPPLY Logical. (Input)\n APPLY = .TRUE. -> apply the sorted order to X2.\n APPLY = .FALSE. -> do not apply the sorted order to X2.\n\nN Integer. (INPUT)\n Size of the arrays.\n\nX1 Double precision array of length N. (INPUT/OUTPUT)\n The array to be sorted.\n\nX2 Double precision array of length N. (INPUT/OUTPUT)\n Only referenced if APPLY = .TRUE.\n\nReturns: nothing\n\n" (function (where (call dsortr (:: which Symbol) (:: apply Bool) (:: n Int) (:: x1 (curly AbstractVector T)) (:: x2 AbstractVecOrMat)) (<: T AbstractFloat)) (block (macrocall @jl_arpack_check_length :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:263 =#) x1 n) (if apply (block (macrocall @jl_arpack_check_length :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:265 =#) x2 n))) (if (call == which (inert SA)) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call < x y))) apply n x1 x2)) (elseif (block (call == which (inert SM))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call < (call abs x) (call abs y)))) apply n x1 x2)) (elseif (block (call == which (inert LA))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call > x y))) apply n x1 x2)) (elseif (block (call == which (inert LM))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call > (call abs x) (call abs y)))) apply n x1 x2)))))))))  └─ @ /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224  Stacktrace:  [1] _renumber(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ssa_rewrites::Dict{Int64, Int64}, slot_rewrites::Dict{Int64, Int64}, label_table::Dict{Int64, Int64}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1091  [2] renumber_body(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, input_code::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}, slot_rewrites::Dict{Int64, Int64})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1156  [3] compile_lambda(outer_ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1251  [4] linearize_ir(ctx::Base.JuliaLowering.ClosureConversionCtx{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1281  [5] core_lowering_hook(code::Any, mod::Module, file::String, line::UInt64, world::UInt64, _warn::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/hooks.jl:33  [6] include(mapexpr::Function, mod::Module, _path::String)  @ Base Base.jl:327  [7] top-level scope  @ ~/.julia/packages/GenericArpack/p8u6Z/src/GenericArpack.jl:16  [8] include(mod::Module, _path::String)  @ Base Base.jl:326  [9] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base loading.jl:3296  [10] top-level scope  @ stdin:5  [11] eval(m::Module, e::Any)  @ Core boot.jl:521  [12] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [13] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [14] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [15] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 in expression starting at /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/GenericArpack.jl:1 in expression starting at stdin:5 ✗ GenericArpack Precompilation completed after 29.51s ################################################################################ # Loading # Loading GenericArpack... ┌ Info: JuliaLowering threw given input: │ code = │ :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 =# Core.@doc "Sort the array X1 in the order specified by WHICH and optionally\napplies the permutation to the array X2.\n\nUsage:\ncall dsortr\n ( WHICH, APPLY, N, X1, X2 )\n\nArguments\nWHICH Character*2. (Input)\n 'LM' -> X1 is sorted into increasing order of magnitude.\n 'SM' -> X1 is sorted into decreasing order of magnitude.\n 'LA' -> X1 is sorted into increasing order of algebraic.\n 'SA' -> X1 is sorted into decreasing order of algebraic.\n\nAPPLY Logical. (Input)\n APPLY = .TRUE. -> apply the sorted order to X2.\n APPLY = .FALSE. -> do not apply the sorted order to X2.\n\nN Integer. (INPUT)\n Size of the arrays.\n\nX1 Double precision array of length N. (INPUT/OUTPUT)\n The array to be sorted.\n\nX2 Double precision array of length N. (INPUT/OUTPUT)\n Only referenced if APPLY = .TRUE.\n\nReturns: nothing\n\n" function dsortr(which::Symbol, apply::Bool, n::Int, x1::AbstractVector{T}, x2::AbstractVecOrMat) where T <: AbstractFloat │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:255 =# │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:263 =# │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:263 =# @jl_arpack_check_length x1 n │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:264 =# │ if apply │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:265 =# │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:265 =# @jl_arpack_check_length x2 n │ end │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:270 =# │ if which == :SA │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271 =# │ _dsortr_loop(((x::T, y::T)->begin │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271 =# │ x < y │ end), apply, n, x1, x2) │ elseif #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:272 =# which == :SM │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:273 =# │ _dsortr_loop(((x::T, y::T)->begin │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:273 =# │ abs(x) < abs(y) │ end), apply, n, x1, x2) │ elseif #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:274 =# which == :LA │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:275 =# │ _dsortr_loop(((x::T, y::T)->begin │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:275 =# │ x > y │ end), apply, n, x1, x2) │ elseif #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:276 =# which == :LM │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:277 =# │ _dsortr_loop(((x::T, y::T)->begin │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:277 =# │ abs(x) > abs(y) │ end), apply, n, x1, x2) │ end │ end) │ st0 = │ SyntaxTree with attributes mod,kind,var_id,toplevel_pure,scope_type,macro_source,name_val,syntax_flags,meta,scope_layer,value,jl_source,is_toplevel_thunk,source,__macro_ctx__ │ [macrocall] │ │ @doc :: Identifier │ mod │ :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 =#) :: Value │ │ "Sort the array X1 in the order specified by WHICH and optionally\napplies the permutation to the array X2.\n\nUsage:\ncall dsortr\n ( WHICH, APPLY, N, X1, X2 )\n\nArguments\nWHICH Character*2. (Input)\n 'LM' -> X1 is sorted into increasing order of magnitude.\n 'SM' -> X1 is sorted into decreasing order of magnitude.\n 'LA' -> X1 is sorted into increasing order of algebraic.\n 'SA' -> X1 is sorted into decreasing order of algebraic.\n\nAPPLY Logical. (Input)\n APPLY = .TRUE. -> apply the sorted order to X2.\n APPLY = .FALSE. -> do not apply the sorted order to X2.\n\nN Integer. (INPUT)\n Size of the arrays.\n\nX1 Double precision array of length N. (INPUT/OUTPUT)\n The array to be sorted.\n\nX2 Double precision array of length N. (INPUT/OUTPUT)\n Only referenced if APPLY = .TRUE.\n\nReturns: nothing\n\n" :: Value │ │ [function] │ │ [where] │ │ [call] │ │ dsortr :: Identifier │ │ [::] │ │ which :: Identifier │ │ Symbol :: Identifier │ │ [::] │ │ apply :: Identifier │ │ Bool :: Identifier │ │ [::] │ │ n :: Identifier │ │ Int :: Identifier │ │ [::] │ │ x1 :: Identifier │ │ [curly] │ │ AbstractVector :: Identifier │ │ T :: Identifier │ │ [::] │ │ x2 :: Identifier │ │ AbstractVecOrMat :: Identifier │ │ [<:] │ │ T :: Identifier │ │ AbstractFloat :: Identifier │ │ [block] │ │ [macrocall] │ │ @jl_arpack_check_length :: Identifier │ │ :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:263 =#) :: Value │ │ x1 :: Identifier │ │ n :: Identifier │ │ [if] │ │ apply :: Identifier │ │ [block] │ │ [macrocall] │ │ @jl_arpack_check_length :: Identifier │ │ :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:265 =#) :: Value │ │ x2 :: Identifier │ │ n :: Identifier │ │ [if] │ │ [call] │ │ == :: Identifier │ │ which :: Identifier │ │ [inert] │ │ SA :: Identifier │ │ [block] │ │ [call] │ │ _dsortr_loop :: Identifier │ │ [->] │ │ [tuple] │ │ [::] │ │ x :: Identifier │ │ T :: Identifier │ │ [::] │ │ y :: Identifier │ │ T :: Identifier │ │ [block] │ │ [call] │ │ < :: Identifier │ │ x :: Identifier │ │ y :: Identifier │ │ apply :: Identifier │ │ n :: Identifier │ │ x1 :: Identifier │ │ x2 :: Identifier │ │ [elseif] │ │ [block] │ │ [call] │ │ == :: Identifier │ │ which :: Identifier │ │ [inert] │ │ SM :: Identifier │ │ [block] │ │ [call] │ │ _dsortr_loop :: Identifier │ │ [->] │ │ [tuple] │ │ [::] │ │ x :: Identifier │ │ T :: Identifier │ │ [::] │ │ y :: Identifier │ │ T :: Identifier │ │ [block] │ │ [call] │ │ < :: Identifier │ │ [call] │ │ abs :: Identifier │ │ x :: Identifier │ │ [call] │ │ abs :: Identifier │ │ y :: Identifier │ │ apply :: Identifier │ │ n :: Identifier │ │ x1 :: Identifier │ │ x2 :: Identifier │ │ [elseif] │ │ [block] │ │ [call] │ │ == :: Identifier │ │ which :: Identifier │ │ [inert] │ │ LA :: Identifier │ │ [block] │ │ [call] │ │ _dsortr_loop :: Identifier │ │ [->] │ │ [tuple] │ │ [::] │ │ x :: Identifier │ │ T :: Identifier │ │ [::] │ │ y :: Identifier │ │ T :: Identifier │ │ [block] │ │ [call] │ │ > :: Identifier │ │ x :: Identifier │ │ y :: Identifier │ │ apply :: Identifier │ │ n :: Identifier │ │ x1 :: Identifier │ │ x2 :: Identifier │ │ [elseif] │ │ [block] │ │ [call] │ │ == :: Identifier │ │ which :: Identifier │ │ [inert] │ │ LM :: Identifier │ │ [block] │ │ [call] │ │ _dsortr_loop :: Identifier │ │ [->] │ │ [tuple] │ │ [::] │ │ x :: Identifier │ │ T :: Identifier │ │ [::] │ │ y :: Identifier │ │ T :: Identifier │ │ [block] │ │ [call] │ │ > :: Identifier │ │ [call] │ │ abs :: Identifier │ │ x :: Identifier │ │ [call] │ │ abs :: Identifier │ │ y :: Identifier │ │ apply :: Identifier │ │ n :: Identifier │ │ x1 :: Identifier │ │ x2 :: Identifier │ │ │ st1 = │ SyntaxTree with attributes mod,kind,var_id,toplevel_pure,scope_type,macro_source,name_val,syntax_flags,meta,scope_layer,value,jl_source,is_toplevel_thunk,source │ [block] │ │ [=] │ │ val :: Identifier │ scope_layer=3 │ [function] │ │ [where] │ │ [call] │ │ dsortr :: Identifier │ scope_layer=1 │ [::] │ │ which :: Identifier │ scope_layer=1 │ Symbol :: Identifier │ scope_layer=1 │ [::] │ │ apply :: Identifier │ scope_layer=1 │ Bool :: Identifier │ scope_layer=1 │ [::] │ │ n :: Identifier │ scope_layer=1 │ Int :: Identifier │ scope_layer=1 │ [::] │ │ x1 :: Identifier │ scope_layer=1 │ [curly] │ │ AbstractVector :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [::] │ │ x2 :: Identifier │ scope_layer=1 │ AbstractVecOrMat :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ AbstractFloat :: Identifier │ scope_layer=1 │ [block] │ │ [block] │ │ [if] │ │ [call] │ │ > :: Identifier │ scope_layer=1 │ n :: Identifier │ scope_layer=1 │ [call] │ │ length :: Identifier │ scope_layer=1 │ x1 :: Identifier │ scope_layer=1 │ [block] │ │ [call] │ │ throw :: Identifier │ scope_layer=1 │ [call] │ │ ArgumentError :: Identifier │ scope_layer=1 │ [call] │ │ string :: Identifier │ scope_layer=1 │ "range 1:n=" :: Value │ macro_source=157 │ n :: Identifier │ scope_layer=1 │ " out of bounds for x1 of length " :: Value │ macro_source=157 │ [call] │ │ length :: Identifier │ scope_layer=1 │ x1 :: Identifier │ scope_layer=1 │ [if] │ │ apply :: Identifier │ scope_layer=1 │ [block] │ │ [block] │ │ [if] │ │ [call] │ │ > :: Identifier │ scope_layer=1 │ n :: Identifier │ scope_layer=1 │ [call] │ │ length :: Identifier │ scope_layer=1 │ x2 :: Identifier │ scope_layer=1 │ [block] │ │ [call] │ │ throw :: Identifier │ scope_layer=1 │ [call] │ │ ArgumentError :: Identifier │ scope_layer=1 │ [call] │ │ string :: Identifier │ scope_layer=1 │ "range 1:n=" :: Value │ macro_source=157 │ n :: Identifier │ scope_layer=1 │ " out of bounds for x2 of length " :: Value │ macro_source=157 │ [call] │ │ length :: Identifier │ scope_layer=1 │ x2 :: Identifier │ scope_layer=1 │ [if] │ │ [call] │ │ == :: Identifier │ scope_layer=1 │ which :: Identifier │ scope_layer=1 │ [inert] │ │ SA :: Identifier │ │ [block] │ │ [call] │ │ _dsortr_loop :: Identifier │ scope_layer=1 │ [->] │ │ [tuple] │ │ [::] │ │ x :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [::] │ │ y :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [block] │ │ [call] │ │ < :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ y :: Identifier │ scope_layer=1 │ apply :: Identifier │ scope_layer=1 │ n :: Identifier │ scope_layer=1 │ x1 :: Identifier │ scope_layer=1 │ x2 :: Identifier │ scope_layer=1 │ [elseif] │ │ [block] │ │ [call] │ │ == :: Identifier │ scope_layer=1 │ which :: Identifier │ scope_layer=1 │ [inert] │ │ SM :: Identifier │ │ [block] │ │ [call] │ │ _dsortr_loop :: Identifier │ scope_layer=1 │ [->] │ │ [tuple] │ │ [::] │ │ x :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [::] │ │ y :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [block] │ │ [call] │ │ < :: Identifier │ scope_layer=1 │ [call] │ │ abs :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [call] │ │ abs :: Identifier │ scope_layer=1 │ y :: Identifier │ scope_layer=1 │ apply :: Identifier │ scope_layer=1 │ n :: Identifier │ scope_layer=1 │ x1 :: Identifier │ scope_layer=1 │ x2 :: Identifier │ scope_layer=1 │ [elseif] │ │ [block] │ │ [call] │ │ == :: Identifier │ scope_layer=1 │ which :: Identifier │ scope_layer=1 │ [inert] │ │ LA :: Identifier │ │ [block] │ │ [call] │ │ _dsortr_loop :: Identifier │ scope_layer=1 │ [->] │ │ [tuple] │ │ [::] │ │ x :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [::] │ │ y :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [block] │ │ [call] │ │ > :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ y :: Identifier │ scope_layer=1 │ apply :: Identifier │ scope_layer=1 │ n :: Identifier │ scope_layer=1 │ x1 :: Identifier │ scope_layer=1 │ x2 :: Identifier │ scope_layer=1 │ [elseif] │ │ [block] │ │ [call] │ │ == :: Identifier │ scope_layer=1 │ which :: Identifier │ scope_layer=1 │ [inert] │ │ LM :: Identifier │ │ [block] │ │ [call] │ │ _dsortr_loop :: Identifier │ scope_layer=1 │ [->] │ │ [tuple] │ │ [::] │ │ x :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [::] │ │ y :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [block] │ │ [call] │ │ > :: Identifier │ scope_layer=1 │ [call] │ │ abs :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [call] │ │ abs :: Identifier │ scope_layer=1 │ y :: Identifier │ scope_layer=1 │ apply :: Identifier │ scope_layer=1 │ n :: Identifier │ scope_layer=1 │ x1 :: Identifier │ scope_layer=1 │ x2 :: Identifier │ scope_layer=1 │ [call] │ │ Base.Docs.doc! :: Value │ macro_source=157 │ GenericArpack :: Value │ macro_source=157 │ [call] │ │ Base.Docs.Binding :: Value │ macro_source=157 │ GenericArpack :: Value │ │ [inert] │ jl_source=L65 │ dsortr :: Identifier │ │ [call] │ macro_source=157 │ Base.Docs.docstr :: Value │ macro_source=157 │ [call] │ macro_source=157 │ Core.svec :: Value │ macro_source=157 │ "Sort the array X1 in the order specified by WHICH and optionally\napplies the permutation to the array X2.\n\nUsage:\ncall dsortr\n ( WHICH, APPLY, N, X1, X2 )\n\nArguments\nWHICH Character*2. (Input)\n 'LM' -> X1 is sorted into increasing order of magnitude.\n 'SM' -> X1 is sorted into decreasing order of magnitude.\n 'LA' -> X1 is sorted into increasing order of algebraic.\n 'SA' -> X1 is sorted into decreasing order of algebraic.\n\nAPPLY Logical. (Input)\n APPLY = .TRUE. -> apply the sorted order to X2.\n APPLY = .FALSE. -> do not apply the sorted order to X2.\n\nN Integer. (INPUT)\n Size of the arrays.\n\nX1 Double precision array of length N. (INPUT/OUTPUT)\n The array to be sorted.\n\nX2 Double precision array of length N. (INPUT/OUTPUT)\n Only referenced if APPLY = .TRUE.\n\nReturns: nothing\n\n" :: Value │ macro_source=157 │ [call] │ macro_source=157 │ Dict{Symbol, Any} :: Value │ macro_source=157 │ :path => "/home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl" :: Value │ macro_source=157 │ :linenumber => 224 :: Value │ macro_source=157 │ :module => GenericArpack :: Value │ macro_source=157 │ [where] │ │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ Symbol :: Identifier │ scope_layer=1 │ Bool :: Identifier │ scope_layer=1 │ Int :: Identifier │ scope_layer=1 │ [curly] │ │ AbstractVector :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ AbstractVecOrMat :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ AbstractFloat :: Identifier │ scope_layer=1 │ val :: Identifier │ scope_layer=3 │ │ file = "/home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl" │ line = 224 └ mod = GenericArpack ERROR: LoadError: LoweringError: #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271 =# - Found unexpected binding of kind static_parameter Expression:  #₂₃/T Containing expressions:  (= #₆₇/T #₂₃/T)  (= #₃ (call core.svec (call core.svec #₅₂/#dsortr##->###0 #₂₃/T #₂₃/T) (call core.svec) SourceLocation:/home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271:0))  (= #₃ (call core.svec (call core.svec (function_type #₂₄/#->#) #₂₃/T #₂₃/T) (call core.svec) SourceLocation:/home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271:0))  Detailed provenance:  #₂₃/T  └─ T  └─ T  ├─ @ /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 =#) "Sort the array X1 in the order specified by WHICH and optionally\napplies the permutation to the array X2.\n\nUsage:\ncall dsortr\n ( WHICH, APPLY, N, X1, X2 )\n\nArguments\nWHICH Character*2. (Input)\n 'LM' -> X1 is sorted into increasing order of magnitude.\n 'SM' -> X1 is sorted into decreasing order of magnitude.\n 'LA' -> X1 is sorted into increasing order of algebraic.\n 'SA' -> X1 is sorted into decreasing order of algebraic.\n\nAPPLY Logical. (Input)\n APPLY = .TRUE. -> apply the sorted order to X2.\n APPLY = .FALSE. -> do not apply the sorted order to X2.\n\nN Integer. (INPUT)\n Size of the arrays.\n\nX1 Double precision array of length N. (INPUT/OUTPUT)\n The array to be sorted.\n\nX2 Double precision array of length N. (INPUT/OUTPUT)\n Only referenced if APPLY = .TRUE.\n\nReturns: nothing\n\n" (function (where (call dsortr (:: which Symbol) (:: apply Bool) (:: n Int) (:: x1 (curly AbstractVector T)) (:: x2 AbstractVecOrMat)) (<: T AbstractFloat)) (block (macrocall @jl_arpack_check_length :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:263 =#) x1 n) (if apply (block (macrocall @jl_arpack_check_length :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:265 =#) x2 n))) (if (call == which (inert SA)) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call < x y))) apply n x1 x2)) (elseif (block (call == which (inert SM))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call < (call abs x) (call abs y)))) apply n x1 x2)) (elseif (block (call == which (inert LA))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call > x y))) apply n x1 x2)) (elseif (block (call == which (inert LM))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call > (call abs x) (call abs y)))) apply n x1 x2)))))))))  └─ @ /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224  Stacktrace:  [1] _renumber(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ssa_rewrites::Dict{Int64, Int64}, slot_rewrites::Dict{Int64, Int64}, label_table::Dict{Int64, Int64}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1091  [2] renumber_body(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, input_code::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}, slot_rewrites::Dict{Int64, Int64})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1156  [3] compile_lambda(outer_ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1251  [4] linearize_ir(ctx::Base.JuliaLowering.ClosureConversionCtx{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1281  [5] core_lowering_hook(code::Any, mod::Module, file::String, line::UInt64, world::UInt64, _warn::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/hooks.jl:33  [6] include(mapexpr::Function, mod::Module, _path::String)  @ Base Base.jl:327  [7] top-level scope  @ ~/.julia/packages/GenericArpack/p8u6Z/src/GenericArpack.jl:16  [8] include(mod::Module, _path::String)  @ Base Base.jl:326  [9] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base loading.jl:3296  [10] top-level scope  @ stdin:5  [11] eval(m::Module, e::Any)  @ Core boot.jl:521  [12] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [13] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [14] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [15] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 in expression starting at /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/GenericArpack.jl:1 in expression starting at stdin:5 1 dependency had output during precompilation: ┌ GenericArpack │ [Output was shown above] └ ERROR: The following 1 package failed to precompile: GenericArpack Failed to precompile GenericArpack [408c25d7-97fa-4992-8bd9-ce15f1a09fe9] to "/home/pkgeval/.julia/compiled/v1.14/GenericArpack/jl_OEqBfR" (ProcessExited(1)). Loading failed after 17.01s ERROR: LoadError: failed process: Process(`/opt/julia/bin/julia -C native -J/opt/julia/lib/julia/sys.so -g1 --check-bounds=yes --inline=yes --check-bounds=yes --pkgimages=existing -e 'using GenericArpack'`, ProcessExited(1)) [1] Stacktrace: [1] pipeline_error(proc::Base.Process) @ Base process.jl:612 [inlined] [2] run(::Cmd; wait::Bool) @ Base process.jl:525 [3] run(::Cmd) @ Base process.jl:522 [4] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:197 [5] include(mod::Module, _path::String) @ Base Base.jl:326 [6] exec_options(opts::Base.JLOptions) @ Base client.jl:355 [7] _start() @ Base client.jl:596 in expression starting at /PkgEval.jl/scripts/evaluate.jl:188 PkgEval failed after 73.57s: package fails to precompile