1TS Object: 1 MPI processes 2 type: alpha2 3 Alpha_m=0.5, Alpha_f=0.5, Gamma=0.5, Beta=0.25 4 maximum steps=10 5 maximum time=31.4159 6 total number of nonlinear solver iterations=12 7 total number of linear solver iterations=12 8 total number of nonlinear solve failures=0 9 total number of rejected steps=0 10 using relative error tolerance of 0.0001, using absolute error tolerance of 0.0001 11 TSAdapt Object: 1 MPI processes 12 type: none 13 SNES Object: 1 MPI processes 14 type: newtonls 15 maximum iterations=50, maximum function evaluations=10000 16 tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 17 total number of linear solver iterations=1 18 total number of function evaluations=2 19 norm schedule ALWAYS 20 SNESLineSearch Object: 1 MPI processes 21 type: bt 22 interpolation: cubic 23 alpha=1.000000e-04 24 maxstep=1.000000e+08, minlambda=1.000000e-12 25 tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 26 maximum iterations=40 27 KSP Object: 1 MPI processes 28 type: gmres 29 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 30 happy breakdown tolerance 1e-30 31 maximum iterations=10000, initial guess is zero 32 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 33 left preconditioning 34 using PRECONDITIONED norm type for convergence test 35 PC Object: 1 MPI processes 36 type: ilu 37 out-of-place factorization 38 0 levels of fill 39 tolerance for zero pivot 2.22045e-14 40 matrix ordering: external 41 factor fill ratio given 0., needed 0. 42 Factored matrix follows: 43 Mat Object: 1 MPI processes 44 type: seqdense 45 rows=1, cols=1 46 package used to perform factorization: petsc 47 total: nonzeros=1, allocated nonzeros=1 48 linear system matrix = precond matrix: 49 Mat Object: 1 MPI processes 50 type: seqdense 51 rows=1, cols=1 52 total: nonzeros=1, allocated nonzeros=1 53 total number of mallocs used during MatSetValues calls=0 54