($Id: cc523e423547ec1e335b86a2ead55e4b2e6b3040 $) using OpenMP (TM) compiled with gcc 12.2.0 < Millepede II-P starting ... Tue Nov 22 10:44:53 2022 ________________________________FILETC/X__________________________________ Command line options: --------------------- 1 -C 2 mp2str.txt --------------------- Listing of steering file: mp2str.txt ------------------------- 1 * *** Default test steering file *** 2 3 * Additinal files 4 fortranfiles ! following bin files are fortran 5 mp2con.txt ! constraints text file 6 mp2tst.bin ! binary data file 7 Cfiles ! following bin files are Cfiles 8 9 * Selection of variable global parameters 10 *entries 10 ! lower limit on number of entries/parameter 11 *entries 25 ! default limit on number of entries/parameter 12 *entries 50 ! higher limit on number of entries/parameter 13 14 * Initial parameter values, presigmas 15 *Parameter ! define parameter attributes (start of list) 16 *205 -0.01 0. ! start value 17 *206 0.01 0. ! start value 18 *215 0.01 -1. ! fix parameter at value 19 *216 0. -1. ! fix parameter at value 20 21 * Handling of outliers, tails etc 22 *hugecut 50.0 !cut factor in iteration 0 23 *chisqcut 30.0 6.0 ! cut factor in iterations 1 and 2 24 *outlierdownweighting 2 ! number of internal iterations (> 1) 25 *dwfractioncut 0.2 ! 0 < value < 0.5 26 *presigma 0.01 ! default value for presigma 27 *regularisation 1.0 ! regularisation factor 28 *regularisation 1.0 0.01 ! regularisation factor, pre-sigma 29 30 * Solution methods 31 method fullMINRES 3 0.01 ! (approximate) MINRES, full storage 32 method sparseMINRES 3 0.01 ! (approximate) MINRES, sparse storage 33 *mrestol 1.0D-8 ! epsilon for MINRES convergence 34 *bandwidth 0 ! width of MINRES precond. band matrix 35 method diagonalization 3 0.001 ! diagonalization (-> millepede.eve) 36 method decomposition 3 0.001 ! Cholesky decomposition 37 method inversion 3 0.001 ! Gauss matrix inversion 38 * last method is applied 39 40 * Additional output. monitoring 41 printcounts ! print number of entries 42 *monitorresiduals ! poor man's DMR (-> millepede.mon) 43 *printrecord 1 2 ! debug printout for records 44 *printrecord -1 -1 ! debug printout for bad data records 45 46 end ! optional for end-of-data end-statement after 46 text lines ------------------------- lun 11 0 1 binary files opened Processing text files ... File mp2str.txt end-statement after 46 text lines File mp2con.txt end-of-file after 24 text lines ... end of text file processing. Solution method and matrix-storage mode: METSOL = 1: matrix inversion with 3 iterations MATSTO = 1: full symmetric matrix, (n*n+n)/2 elements Iterations (solutions) with line search: All ______________________________FILETC/X-end________________________________ !!! Checking input only, no calculation of a solution !!! Number of processors available: 8 Maximum number of OpenMP threads: 1 Number of threads for processing: 1 Number of threads for reading: 1 _________________________________LOOP1____________________________________ Read all binary data files: PEREAD: file 1 read the first time, found 10000 records Record 1 Record 10 Record 100 Record 1000 Record 10000 PEREAD: file 1 with max record size 370 Read cache usage (#blocks, #records, min,max records/block 1 10000 10000 10000 SORT22 (quicksort): maxlevel used/available = 12 /64 LOOP1: 0 is number of pre-sigmas Warning: no pre-sigmas defined Default pre-sigma = 0.00E+00 (if no individual pre-sigma defined) Pre-sigma factor is 1.00000000 No regularization will be done NTGB = 700 = total number of parameters NVGB = 683 = number of variable parameters NREC = 10000 = number of records MREQENF = 25 = required number of entries (eqns in binary files) MREQENA = 10 = required number of entries (from accepted fits) NTGB = 700 = total number of parameters NVGB = 683 = number of variable parameters _______________________________LOOP1-end__________________________________ 0 h 0 min 0.1 sec total elapsed 0 h 0 min 0.1 sec _________________________________LOOP2____________________________________ constraint 1 : 5 parameters, 5 variable constraint 2 : 5 parameters, 5 variable constraint 3 : 5 parameters, 5 variable constraint 4 : 5 parameters, 5 variable PRPCON: 4 constraints accepted SORT2I (quicksort): maxlevel used/available = 2 /64 SORT2I (quicksort): maxlevel used/available = 2 /64 Cons. sorted index file: index, first line first label last label Cons. group index first cons. last cons. first label last label Cons. block index first group last group first label last label Cons. sorted 1 1 1 54 94 Cons. group 1 1 1 54 94 Cons. block 1 1 1 54 94 Cons. sorted 2 3 13 504 544 Cons. group 2 2 2 504 544 Cons. block 2 2 2 504 544 Cons. sorted 3 2 7 1054 1094 Cons. group 3 3 3 1054 1094 Cons. block 3 3 3 1054 1094 Cons. sorted 4 4 19 1504 1544 Cons. group 4 4 4 1504 1544 Cons. block 4 4 4 1504 1544 PRPCON: constraints split into 4 (disjoint) groups, groups combined into 4 (non overlapping) blocks max group size (cons., par.) 1 41 max block size (cons., par.) 1 41 total block matrix sizes 164 4 CLBMAP: dimension of bit-map 8437 (< 1 MB) Record 1 Record 10 Record 100 Record 1000 Record 10000 Read cache usage (#blocks, #records, min,max records/block 1 10000 10000 10000 NTGB = 700 = total number of parameters (all parameters, appearing in binary files) NVGB = 683 = number of variable parameters (appearing in fit matrix/vectors) NAGB = 683 = number of all parameters (including Lagrange multiplier or reduced) NTPGRP = 700 = total number of parameter groups NVPGRP = 683 = number of variable parameter groups NFGB = 679 = number of fit parameters NOFF = 232903 = max number of off-diagonal elements NCGB = 4 = number of constraints NAGBN = 18 = max number of global parameters in an event NALCN = 28 = max number of local parameters in an event NAEQN = 38 = max number of equations in an event NCACHE = 25000000 = number of words for caching cache splitting 56.7 % 3.0 % 40.2 % Solution method and matrix-storage mode: METSOL = 1: matrix inversion with 3 iterations MATSTO = 1: full symmetric matrix, (n*n+n)/2 elements Convergence assumed, if expected dF < 0.1000E-02 Constraints handled by elimination Constraint group, #con, rank 1 1 1 Constraint group, #con, rank 2 1 1 Constraint group, #con, rank 3 1 1 Constraint group, #con, rank 4 1 1 Rank of product matrix of constraints is 4 for 4 constraint equations QL decomposition of constraints matrix largest |eigenvalue| of L: -2.2360679774997898 smallest |eigenvalue| of L: -2.2360679774997898 Size of global matrix: 1 MB _______________________________LOOP2-end__________________________________ 0 h 0 min 0.2 sec total elapsed 0 h 0 min 0.1 sec < Millepede II-P ending ... Tue Nov 22 10:44:54 2022 Peak dynamic memory allocation: 0.100306 GB