R Under development (unstable) (2025-11-30 r89082 ucrt) -- "Unsuffered Consequences" Copyright (C) 2025 The R Foundation for Statistical Computing Platform: x86_64-w64-mingw32/x64 R is free software and comes with ABSOLUTELY NO WARRANTY. You are welcome to redistribute it under certain conditions. Type 'license()' or 'licence()' for distribution details. R is a collaborative project with many contributors. Type 'contributors()' for more information and 'citation()' on how to cite R or R packages in publications. Type 'demo()' for some demos, 'help()' for on-line help, or 'help.start()' for an HTML browser interface to help. Type 'q()' to quit R. > # This file is part of the standard setup for testthat. > # It is recommended that you do not modify it. > # > # Where should you do additional test configuration? > # Learn more about the roles of various files in: > # * https://r-pkgs.org/testing-design.html#sec-tests-files-overview > # * https://testthat.r-lib.org/articles/special-files.html > > library(testthat) > library(rACMEMEEV) > > test_check("rACMEMEEV") Compiling model graph Resolving undeclared variables Allocating nodes Graph information: Observed stochastic nodes: 100 Unobserved stochastic nodes: 4 Total graph size: 166 Initializing model Compiling model graph Resolving undeclared variables Allocating nodes Graph information: Observed stochastic nodes: 100 Unobserved stochastic nodes: 4 Total graph size: 166 Initializing model SAMPLING FOR MODEL 'anon_model' NOW (CHAIN 1). Chain 1: Chain 1: Gradient evaluation took 0.000241 seconds Chain 1: 1000 transitions using 10 leapfrog steps per transition would take 2.41 seconds. Chain 1: Adjust your expectations accordingly! Chain 1: Chain 1: Chain 1: Iteration: 1 / 10000 [ 0%] (Warmup) Chain 1: Iteration: 1000 / 10000 [ 10%] (Warmup) Chain 1: Iteration: 1501 / 10000 [ 15%] (Sampling) Chain 1: Iteration: 2500 / 10000 [ 25%] (Sampling) Chain 1: Iteration: 3500 / 10000 [ 35%] (Sampling) Chain 1: Iteration: 4500 / 10000 [ 45%] (Sampling) Chain 1: Iteration: 5500 / 10000 [ 55%] (Sampling) Chain 1: Iteration: 6500 / 10000 [ 65%] (Sampling) Chain 1: Iteration: 7500 / 10000 [ 75%] (Sampling) Chain 1: Iteration: 8500 / 10000 [ 85%] (Sampling) Chain 1: Iteration: 9500 / 10000 [ 95%] (Sampling) Chain 1: Iteration: 10000 / 10000 [100%] (Sampling) Chain 1: Chain 1: Elapsed Time: 1.539 seconds (Warm-up) Chain 1: 9.302 seconds (Sampling) Chain 1: 10.841 seconds (Total) Chain 1: SAMPLING FOR MODEL 'anon_model' NOW (CHAIN 1). Chain 1: Chain 1: Gradient evaluation took 0.000242 seconds Chain 1: 1000 transitions using 10 leapfrog steps per transition would take 2.42 seconds. Chain 1: Adjust your expectations accordingly! Chain 1: Chain 1: Chain 1: Iteration: 1 / 10000 [ 0%] (Warmup) Chain 1: Iteration: 1000 / 10000 [ 10%] (Warmup) Chain 1: Iteration: 1501 / 10000 [ 15%] (Sampling) Chain 1: Iteration: 2500 / 10000 [ 25%] (Sampling) Chain 1: Iteration: 3500 / 10000 [ 35%] (Sampling) Chain 1: Iteration: 4500 / 10000 [ 45%] (Sampling) Chain 1: Iteration: 5500 / 10000 [ 55%] (Sampling) Chain 1: Iteration: 6500 / 10000 [ 65%] (Sampling) Chain 1: Iteration: 7500 / 10000 [ 75%] (Sampling) Chain 1: Iteration: 8500 / 10000 [ 85%] (Sampling) Chain 1: Iteration: 9500 / 10000 [ 95%] (Sampling) Chain 1: Iteration: 10000 / 10000 [100%] (Sampling) Chain 1: Chain 1: Elapsed Time: 1.422 seconds (Warm-up) Chain 1: 9.503 seconds (Sampling) Chain 1: 10.925 seconds (Total) Chain 1: Compiling model graph Resolving undeclared variables Allocating nodes Graph information: Observed stochastic nodes: 4 Unobserved stochastic nodes: 4 Total graph size: 70 Initializing model Compiling model graph Resolving undeclared variables Allocating nodes Graph information: Observed stochastic nodes: 4 Unobserved stochastic nodes: 4 Total graph size: 70 Initializing model Compiling model graph Resolving undeclared variables Allocating nodes Graph information: Observed stochastic nodes: 4 Unobserved stochastic nodes: 4 Total graph size: 70 Initializing model SAMPLING FOR MODEL 'anon_model' NOW (CHAIN 1). Chain 1: Chain 1: Gradient evaluation took 8.7e-05 seconds Chain 1: 1000 transitions using 10 leapfrog steps per transition would take 0.87 seconds. Chain 1: Adjust your expectations accordingly! Chain 1: Chain 1: Chain 1: Iteration: 1 / 10000 [ 0%] (Warmup) Chain 1: Iteration: 1000 / 10000 [ 10%] (Warmup) Chain 1: Iteration: 1501 / 10000 [ 15%] (Sampling) Chain 1: Iteration: 2500 / 10000 [ 25%] (Sampling) Chain 1: Iteration: 3500 / 10000 [ 35%] (Sampling) Chain 1: Iteration: 4500 / 10000 [ 45%] (Sampling) Chain 1: Iteration: 5500 / 10000 [ 55%] (Sampling) Chain 1: Iteration: 6500 / 10000 [ 65%] (Sampling) Chain 1: Iteration: 7500 / 10000 [ 75%] (Sampling) Chain 1: Iteration: 8500 / 10000 [ 85%] (Sampling) Chain 1: Iteration: 9500 / 10000 [ 95%] (Sampling) Chain 1: Iteration: 10000 / 10000 [100%] (Sampling) Chain 1: Chain 1: Elapsed Time: 14.263 seconds (Warm-up) Chain 1: 105.403 seconds (Sampling) Chain 1: 119.666 seconds (Total) Chain 1: Compiling model graph Resolving undeclared variables Allocating nodes Graph information: Observed stochastic nodes: 100 Unobserved stochastic nodes: 4 Total graph size: 166 Initializing model Compiling model graph Resolving undeclared variables Allocating nodes Graph information: Observed stochastic nodes: 4 Unobserved stochastic nodes: 3 Total graph size: 43 Initializing model Compiling model graph Resolving undeclared variables Allocating nodes Graph information: Observed stochastic nodes: 4 Unobserved stochastic nodes: 3 Total graph size: 43 Initializing model Compiling model graph Resolving undeclared variables Allocating nodes Graph information: Observed stochastic nodes: 4 Unobserved stochastic nodes: 4 Total graph size: 70 Initializing model Compiling model graph Resolving undeclared variables Allocating nodes Graph information: Observed stochastic nodes: 100 Unobserved stochastic nodes: 4 Total graph size: 166 Initializing model Compiling model graph Resolving undeclared variables Allocating nodes Graph information: Observed stochastic nodes: 100 Unobserved stochastic nodes: 4 Total graph size: 166 Initializing model Compiling model graph Resolving undeclared variables Allocating nodes Graph information: Observed stochastic nodes: 4 Unobserved stochastic nodes: 4 Total graph size: 70 Initializing model Compiling model graph Resolving undeclared variables Allocating nodes Graph information: Observed stochastic nodes: 100 Unobserved stochastic nodes: 4 Total graph size: 166 Initializing model Compiling model graph Resolving undeclared variables Allocating nodes Graph information: Observed stochastic nodes: 100 Unobserved stochastic nodes: 4 Total graph size: 166 Initializing model Compiling model graph Resolving undeclared variables Allocating nodes Graph information: Observed stochastic nodes: 100 Unobserved stochastic nodes: 4 Total graph size: 166 Initializing model No id variables; using all as measure variables No id variables; using all as measure variables No id variables; using all as measure variables starting worker for localhost:11502 starting worker for localhost:11502 | | | 0%Type: EXEC Loading required package: rACMEMEEV loaded rACMEMEEV and set parent environment Loading required package: coda Loading required package: MASS ## ## Markov Chain Monte Carlo Package (MCMCpack) ## Copyright (C) 2003-2025 Andrew D. Martin, Kevin M. Quinn, and Jong Hee Park ## ## Support provided by the U.S. National Science Foundation ## (Grants SES-0350646 and SES-0350613) ## Linked to JAGS 4.3.1 Loaded modules: basemod,bugs Loading required package: StanHeaders Type: EXEC Loading required package: rACMEMEEV loaded rACMEMEEV and set parent environment rstan version 2.32.7 (Stan version 2.32.2) Loading required package: coda For execution on a local, multicore CPU with excess RAM we recommend calling options(mc.cores = parallel::detectCores()). To avoid recompilation of unchanged Stan programs, we recommend calling rstan_options(auto_write = TRUE) For within-chain threading using `reduce_sum()` or `map_rect()` Stan functions, change `threads_per_chain` option: rstan_options(threads_per_chain = 1) Do not specify '-march=native' in 'LOCAL_CPPFLAGS' or a Makevars file Attaching package: 'rstan' The following object is masked from 'package:coda': traceplot Loading required package: MASS ## ## Markov Chain Monte Carlo Package (MCMCpack) ## Copyright (C) 2003-2025 Andrew D. Martin, Kevin M. Quinn, and Jong Hee Park ## ## Support provided by the U.S. National Science Foundation ## (Grants SES-0350646 and SES-0350613) ## Linked to JAGS 4.3.1 Loaded modules: basemod,bugs Loading required package: StanHeaders rstan version 2.32.7 (Stan version 2.32.2) For execution on a local, multicore CPU with excess RAM we recommend calling options(mc.cores = parallel::detectCores()). To avoid recompilation of unchanged Stan programs, we recommend calling rstan_options(auto_write = TRUE) For within-chain threading using `reduce_sum()` or `map_rect()` Stan functions, change `threads_per_chain` option: rstan_options(threads_per_chain = 1) Do not specify '-march=native' in 'LOCAL_CPPFLAGS' or a Makevars file Attaching package: 'rstan' The following object is masked from 'package:coda': traceplot Type: EXEC Compiling model graph Resolving undeclared variables Allocating nodes Graph information: Observed stochastic nodes: 100 Unobserved stochastic nodes: 4 Total graph size: 166 Initializing model | |======================================================================| 100%Type: DONE Type: DONE starting worker for localhost:11502 starting worker for localhost:11502 | | | 0%Type: EXEC Loading required package: rACMEMEEV loaded rACMEMEEV and set parent environment Loading required package: coda Loading required package: MASS ## ## Markov Chain Monte Carlo Package (MCMCpack) ## Copyright (C) 2003-2025 Andrew D. Martin, Kevin M. Quinn, and Jong Hee Park ## ## Support provided by the U.S. National Science Foundation ## (Grants SES-0350646 and SES-0350613) ## Linked to JAGS 4.3.1 Loaded modules: basemod,bugs Loading required package: StanHeaders rstan version 2.32.7 (Stan version 2.32.2) For execution on a local, multicore CPU with excess RAM we recommend calling options(mc.cores = parallel::detectCores()). To avoid recompilation of unchanged Stan programs, we recommend calling rstan_options(auto_write = TRUE) For within-chain threading using `reduce_sum()` or `map_rect()` Stan functions, change `threads_per_chain` option: rstan_options(threads_per_chain = 1) Do not specify '-march=native' in 'LOCAL_CPPFLAGS' or a Makevars file Attaching package: 'rstan' The following object is masked from 'package:coda': traceplot Type: EXEC Loading required package: rACMEMEEV loaded rACMEMEEV and set parent environment Loading required package: coda Loading required package: MASS ## ## Markov Chain Monte Carlo Package (MCMCpack) ## Copyright (C) 2003-2025 Andrew D. Martin, Kevin M. Quinn, and Jong Hee Park ## ## Support provided by the U.S. National Science Foundation ## (Grants SES-0350646 and SES-0350613) ## Linked to JAGS 4.3.1 Loaded modules: basemod,bugs Loading required package: StanHeaders rstan version 2.32.7 (Stan version 2.32.2) For execution on a local, multicore CPU with excess RAM we recommend calling options(mc.cores = parallel::detectCores()). To avoid recompilation of unchanged Stan programs, we recommend calling rstan_options(auto_write = TRUE) For within-chain threading using `reduce_sum()` or `map_rect()` Stan functions, change `threads_per_chain` option: rstan_options(threads_per_chain = 1) Do not specify '-march=native' in 'LOCAL_CPPFLAGS' or a Makevars file Attaching package: 'rstan' The following object is masked from 'package:coda': traceplot Type: EXEC WARNING: Rtools is required to build R packages, but is not currently installed. Please download and install the appropriate version of Rtools for 4.6.0 from https://cran.r-project.org/bin/windows/Rtools/. Trying to compile a simple C file Running "D:/RCompile/recent/R/bin/x64/Rcmd.exe" SHLIB foo.c using C compiler: 'gcc.exe (GCC) 14.3.0' make[1]: Entering directory '/d/temp/2025_12_01_10_50_17_499/Rtmp02umcu' gcc -I"D:/RCompile/recent/R/include" -DNDEBUG -I"D:/RCompile/CRANpkg/lib/4.6/Rcpp/include/" -I"D:/temp/2025_12_01_10_50_17_499/RtmpoZHYm1/RLIBS_7e7c704b66e0/RcppEigen/include/" -I"D:/temp/2025_12_01_10_50_17_499/RtmpoZHYm1/RLIBS_7e7c704b66e0/RcppEigen/include/unsupported" -I"D:/temp/2025_12_01_10_50_17_499/RtmpoZHYm1/RLIBS_7e7c704b66e0/BH/include" -I"D:/RCompile/CRANpkg/lib/4.6/StanHeaders/include/src/" -I"D:/RCompile/CRANpkg/lib/4.6/StanHeaders/include/" -I"D:/RCompile/CRANpkg/lib/4.6/RcppParallel/include/" -DRCPP_PARALLEL_USE_TBB=1 -I"D:/RCompile/CRANpkg/lib/4.6/rstan/include" -DEIGEN_NO_DEBUG -DBOOST_DISABLE_ASSERTS -DBOOST_PENDING_INTEGER_LOG2_HPP -DSTAN_THREADS -DUSE_STANC3 -DSTRICT_R_HEADERS -DBOOST_PHOENIX_NO_VARIADIC_EXPRESSION -D_HAS_AUTO_PTR_ETC=0 -include "D:/RCompile/CRANpkg/lib/4.6/StanHeaders/include/stan/math/prim/fun/Eigen.hpp" -std=c++1y -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -pedantic -Wstrict-prototypes -O2 -Wall -std=gnu2x -mfpmath=sse -msse2 -mstackrealign -c foo.c -o foo.o cc1.exe: warning: command-line option '-std=c++14' is valid for C++/ObjC++ but not for C In file included from D:/RCompile/CRANpkg/lib/4.6/RcppEigen/include/Eigen/Core:19, from D:/RCompile/CRANpkg/lib/4.6/RcppEigen/include/Eigen/Dense:1, from D:/RCompile/CRANpkg/lib/4.6/StanHeaders/include/stan/math/prim/fun/Eigen.hpp:22, from : D:/RCompile/CRANpkg/lib/4.6/RcppEigen/include/Eigen/src/Core/util/Macros.h:679:10: fatal error: cmath: No such file or directory 679 | #include | ^~~~~~~ compilation terminated. make[1]: *** [D:/RCompile/recent/R/etc/x64/Makeconf:289: foo.o] Error 1 make[1]: Leaving directory '/d/temp/2025_12_01_10_50_17_499/Rtmp02umcu' WARNING: Rtools is required to build R packages, but is not currently installed. Please download and install the appropriate version of Rtools for 4.6.0 from https://cran.r-project.org/bin/windows/Rtools/. SAMPLING FOR MODEL 'anon_model' NOW (CHAIN 1). Chain 1: Chain 1: Gradient evaluation took 0.000233 seconds Chain 1: 1000 transitions using 10 leapfrog steps per transition would take 2.33 seconds. Chain 1: Adjust your expectations accordingly! Chain 1: Chain 1: Chain 1: Iteration: 1 / 10000 [ 0%] (Warmup) Chain 1: Iteration: 1000 / 10000 [ 10%] (Warmup) Chain 1: Iteration: 1501 / 10000 [ 15%] (Sampling) Chain 1: Iteration: 2500 / 10000 [ 25%] (Sampling) Chain 1: Iteration: 3500 / 10000 [ 35%] (Sampling) Chain 1: Iteration: 4500 / 10000 [ 45%] (Sampling) Chain 1: Iteration: 5500 / 10000 [ 55%] (Sampling) Chain 1: Iteration: 6500 / 10000 [ 65%] (Sampling) Chain 1: Iteration: 7500 / 10000 [ 75%] (Sampling) Chain 1: Iteration: 8500 / 10000 [ 85%] (Sampling) Chain 1: Iteration: 9500 / 10000 [ 95%] (Sampling) Chain 1: Iteration: 10000 / 10000 [100%] (Sampling) Chain 1: Chain 1: Elapsed Time: 1.572 seconds (Warm-up) Chain 1: 9.456 seconds (Sampling) Chain 1: 11.028 seconds (Total) Chain 1: | |======================================================================| 100%Type: DONE Type: DONE Compiling model graph Resolving undeclared variables Allocating nodes Graph information: Observed stochastic nodes: 100 Unobserved stochastic nodes: 4 Total graph size: 166 Initializing model Compiling model graph Resolving undeclared variables Allocating nodes Graph information: Observed stochastic nodes: 100 Unobserved stochastic nodes: 4 Total graph size: 166 Initializing model SAMPLING FOR MODEL 'anon_model' NOW (CHAIN 1). Chain 1: Chain 1: Gradient evaluation took 0.000244 seconds Chain 1: 1000 transitions using 10 leapfrog steps per transition would take 2.44 seconds. Chain 1: Adjust your expectations accordingly! Chain 1: Chain 1: Chain 1: Iteration: 1 / 10000 [ 0%] (Warmup) Chain 1: Iteration: 1000 / 10000 [ 10%] (Warmup) Chain 1: Iteration: 1501 / 10000 [ 15%] (Sampling) Chain 1: Iteration: 2500 / 10000 [ 25%] (Sampling) Chain 1: Iteration: 3500 / 10000 [ 35%] (Sampling) Chain 1: Iteration: 4500 / 10000 [ 45%] (Sampling) Chain 1: Iteration: 5500 / 10000 [ 55%] (Sampling) Chain 1: Iteration: 6500 / 10000 [ 65%] (Sampling) Chain 1: Iteration: 7500 / 10000 [ 75%] (Sampling) Chain 1: Iteration: 8500 / 10000 [ 85%] (Sampling) Chain 1: Iteration: 9500 / 10000 [ 95%] (Sampling) Chain 1: Iteration: 10000 / 10000 [100%] (Sampling) Chain 1: Chain 1: Elapsed Time: 1.528 seconds (Warm-up) Chain 1: 9.334 seconds (Sampling) Chain 1: 10.862 seconds (Total) Chain 1: SAMPLING FOR MODEL 'anon_model' NOW (CHAIN 1). Chain 1: Chain 1: Gradient evaluation took 0.000339 seconds Chain 1: 1000 transitions using 10 leapfrog steps per transition would take 3.39 seconds. Chain 1: Adjust your expectations accordingly! Chain 1: Chain 1: Chain 1: Iteration: 1 / 10000 [ 0%] (Warmup) Chain 1: Iteration: 1000 / 10000 [ 10%] (Warmup) Chain 1: Iteration: 1501 / 10000 [ 15%] (Sampling) Chain 1: Iteration: 2500 / 10000 [ 25%] (Sampling) Chain 1: Iteration: 3500 / 10000 [ 35%] (Sampling) Chain 1: Iteration: 4500 / 10000 [ 45%] (Sampling) Chain 1: Iteration: 5500 / 10000 [ 55%] (Sampling) Chain 1: Iteration: 6500 / 10000 [ 65%] (Sampling) Chain 1: Iteration: 7500 / 10000 [ 75%] (Sampling) Chain 1: Iteration: 8500 / 10000 [ 85%] (Sampling) Chain 1: Iteration: 9500 / 10000 [ 95%] (Sampling) Chain 1: Iteration: 10000 / 10000 [100%] (Sampling) Chain 1: Chain 1: Elapsed Time: 1.594 seconds (Warm-up) Chain 1: 9.645 seconds (Sampling) Chain 1: 11.239 seconds (Total) Chain 1: [ FAIL 0 | WARN 14 | SKIP 0 | PASS 138 ] [ FAIL 0 | WARN 14 | SKIP 0 | PASS 138 ] > > proc.time() user system elapsed 185.01 1.70 667.89