MKL v. 2019.0.1 
Processor optimization:  Intel(R) Advanced Vector Extensions 2 (Intel(R) AVX2) enabled processors

...phase == 11...

=== PARDISO: solving a symmetric indefinite system ===
1-based array indexing is turned ON
PARDISO double precision computation is turned ON
Parallel METIS algorithm at reorder step is turned ON


Summary: ( reordering phase )
================

Times:
======
Time spent in calculations of symmetric matrix portrait (fulladj): 0.225354 s
Time spent in reordering of the initial matrix (reorder)         : 3.881221 s
Time spent in symbolic factorization (symbfct)                   : 0.459823 s
Time spent in data preparations for factorization (parlist)      : 0.018974 s
Time spent in allocation of internal data structures (malloc)    : 0.062180 s
Time spent in additional calculations                            : 0.469179 s
Total time spent                                                 : 5.116731 s

Statistics:
===========
Parallel Direct Factorization is running on 4 OpenMP

< Linear system Ax = b >
             number of equations:           1096299
             number of non-zeros in A:      10792217
             number of non-zeros in A (%): 0.000898

             number of right-hand sides:    1

< Factors L and U >
             number of columns for each panel: 112
             number of independent subgraphs:  0
             number of supernodes:                    1083362
             size of largest supernode:               13052
             number of non-zeros in L:                96783110
             number of non-zeros in U:                1
             number of non-zeros in L+U:              96783111
...phase == 22...
=== PARDISO is running in In-Core mode, because iparam(60)=0 ===

Percentage of computed non-zeros for LL^T factorization
 1 %  2 %  3 %  4 %  5 %  6 %  7 %  8 %  9 %  10 %  11 %  14 %  20 %  25 %  31 %  36 %  41 %  46 %  50 %  55 %  59 %  63 %  67 %  70 %  74 %  77 %  80 %  83 %  85 %  88 %  90 %  92 %  93 %  95 %  96 %  97 %  98 %  99 %  100 % 

=== PARDISO: solving a symmetric indefinite system ===
Single-level factorization algorithm is turned ON


Summary: ( factorization phase )
================

Times:
======
Time spent in copying matrix to internal data structure (A to LU): 0.000000 s
Time spent in factorization step (numfct)                        : 17.704715 s
Time spent in allocation of internal data structures (malloc)    : 0.001030 s
Time spent in additional calculations                            : 0.000001 s
Total time spent                                                 : 17.705746 s

Statistics:
===========
Parallel Direct Factorization is running on 4 OpenMP

< Linear system Ax = b >
             number of equations:           1096299
             number of non-zeros in A:      10792217
             number of non-zeros in A (%): 0.000898

             number of right-hand sides:    1

< Factors L and U >
             number of columns for each panel: 112
             number of independent subgraphs:  0
             number of supernodes:                    1083362
             size of largest supernode:               13052
             number of non-zeros in L:                96783110
             number of non-zeros in U:                1
             number of non-zeros in L+U:              96783111
             gflop   for the numerical factorization: 859.844041

             gflop/s for the numerical factorization: 48.565823

...phase == -1...
...test finished...