TS Object: 1 MPI processes type: alpha2 Alpha_m=0.5, Alpha_f=0.5, Gamma=0.5, Beta=0.25 maximum steps=10 maximum time=31.4159 total number of I function evaluations=24 total number of I Jacobian evaluations=12 total number of nonlinear solver iterations=12 total number of linear solver iterations=12 total number of nonlinear solve failures=0 total number of rejected steps=0 using relative error tolerance of 0.0001, using absolute error tolerance of 0.0001 TSAdapt Object: 1 MPI processes type: none SNES Object: 1 MPI processes type: newtonls maximum iterations=50, maximum function evaluations=10000 tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 total number of linear solver iterations=1 total number of function evaluations=2 norm schedule ALWAYS SNESLineSearch Object: 1 MPI processes type: bt interpolation: cubic alpha=1.000000e-04 maxstep=1.000000e+08, minlambda=1.000000e-12 tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 maximum iterations=40 KSP Object: 1 MPI processes type: gmres restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement happy breakdown tolerance 1e-30 maximum iterations=10000, initial guess is zero tolerances: relative=1e-05, absolute=1e-50, divergence=10000. left preconditioning using PRECONDITIONED norm type for convergence test PC Object: 1 MPI processes type: ilu out-of-place factorization 0 levels of fill tolerance for zero pivot 2.22045e-14 matrix ordering: external factor fill ratio given 0., needed 0. Factored matrix follows: Mat Object: 1 MPI processes type: seqdense rows=1, cols=1 package used to perform factorization: petsc total: nonzeros=1, allocated nonzeros=1 linear system matrix = precond matrix: Mat Object: 1 MPI processes type: seqdense rows=1, cols=1 total: nonzeros=1, allocated nonzeros=1 total number of mallocs used during MatSetValues calls=0