/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: 0) /\ (arg2 > ~(1)), par{arg1 -> 20, arg2 -> ~(20), arg3 -> arg2}> = arg2), par{arg1 -> arg3, arg2 -> (~(1) * arg3), arg3 -> arg1}> = arg2) /\ ((arg1 - arg3) >= 5) /\ ((arg1 + arg3) < 5), par{arg1 -> arg3, arg2 -> (~(1) * arg3), arg3 -> arg1}> arg3, arg2 -> (0 - arg3), arg3 -> arg2}> = arg2) /\ ((arg1 - arg3) >= 5) /\ ((arg1 + arg3) >= 5) /\ (arg3 < 1) /\ (arg3 < (arg1 + 1)), par{arg1 -> (arg1 + 1), arg2 -> (0 - (arg1 + 1)), arg3 -> (arg3 - 1)}> = arg2) /\ ((arg1 - arg3) >= 5) /\ ((arg1 + arg3) >= 5) /\ (arg3 > 1) /\ (arg3 < (arg1 + 1)), par{arg1 -> (arg1 + 1), arg2 -> (0 - (arg1 + 1)), arg3 -> (arg3 - 1)}> 5) /\ (arg2 < 2) /\ (1 = arg3), par{arg1 -> ~(1), arg2 -> 1, arg3 -> 0}> undef22, arg2 -> undef23, arg3 -> undef24}> Fresh variables: undef22, undef23, undef24, Undef variables: undef22, undef23, undef24, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef23 > ~(1))> = arg2) /\ (arg3 <= arg1), par{arg1 -> arg1, arg2 -> (0 - arg1), arg3 -> (~(1) * arg3)}> = arg2) /\ ((arg1 - arg3) >= 5) /\ ((arg1 + arg3) < 5) /\ (arg3 <= arg1), par{arg1 -> arg1, arg2 -> (0 - arg1), arg3 -> (~(1) * arg3)}> = arg2) /\ ((arg1 - arg3) >= 5) /\ ((arg1 + arg3) >= 5) /\ (arg3 < 1) /\ (arg3 < (arg1 + 1)), par{arg1 -> (arg1 + 1), arg2 -> (0 - (arg1 + 1)), arg3 -> (arg3 - 1)}> = arg2) /\ ((arg1 - arg3) >= 5) /\ ((arg1 + arg3) >= 5) /\ (arg3 > 1) /\ (arg3 < (arg1 + 1)), par{arg1 -> (arg1 + 1), arg2 -> (0 - (arg1 + 1)), arg3 -> (arg3 - 1)}> 5) /\ (arg2 < 2) /\ (1 = arg3), par{arg1 -> ~(1), arg2 -> 1, arg3 -> 0}> Fresh variables: undef22, undef23, undef24, Undef variables: undef22, undef23, undef24, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -arg1, arg3 -> -arg3, rest remain the same}> -arg1, arg3 -> -arg3, rest remain the same}> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> -1, arg2 -> 1, arg3 -> 0, rest remain the same}> Variables: arg1, arg2, arg3 Precedence: Graph 0 Graph 1 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.081568 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005067s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.039974s Piecewise ranking function: min(1 + 10*arg1 - 10*arg3,0) New Graphs: Transitions: -arg1, arg3 -> -arg3, rest remain the same}> -arg1, arg3 -> -arg3, rest remain the same}> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002315s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.118673s [25556 : 25557] [25556 : 25558] Successful child: 25557 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -arg1, arg3 -> -arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -arg1, arg3 -> -arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1, arg2 -> 1, arg3 -> 0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -arg1, arg3 -> -arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -arg1, arg3 -> -arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> New Graphs: LOG: CALL check - Post:1 + arg1 <= arg3 - Process 1 * Exit transition: * Postcondition : 1 + arg1 <= arg3 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000828s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000948s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + arg1 <= arg3 , Narrowing transition: -arg1, arg3 -> -arg3, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -arg1, arg3 -> -arg3, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> LOG: Narrow transition size 1 It's unfeasible. Removing transition: -1, arg2 -> 1, arg3 -> 0, rest remain the same}> invGraph after Narrowing: Transitions: -arg1, arg3 -> -arg3, rest remain the same}> -arg1, arg3 -> -arg3, rest remain the same}> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002402s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.118512s [25556 : 25562] [25556 : 25563] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.083948s Time used: 0.081883 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.081196s Time used: 1.08122 LOG: SAT solveNonLinear - Elapsed time: 1.165144s Cost: 1; Total time: 1.1631 Termination implied by a set of invariant(s): Invariant at l2: arg2 <= 1 + arg3 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -arg1, arg3 -> -arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -arg1, arg3 -> -arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -arg1, arg3 -> -arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -arg1, arg3 -> -arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> Quasi-ranking function: 50000 - arg1 New Graphs: Transitions: -arg1, arg3 -> -arg3, rest remain the same}> -arg1, arg3 -> -arg3, rest remain the same}> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002612s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.206107s [25556 : 25567] [25556 : 25568] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.114247s Time used: 0.111562 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000817s Time used: 1.0007 LOG: SAT solveNonLinear - Elapsed time: 1.115064s Cost: 1; Total time: 1.11226 Termination implied by a set of invariant(s): Invariant at l2: arg1 + arg2 <= 0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -arg1, arg3 -> -arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -arg1, arg3 -> -arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -arg1, arg3 -> -arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -arg1, arg3 -> -arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> Quasi-ranking function: 50000 - 2*arg1 - arg2 New Graphs: Transitions: -arg1, arg3 -> -arg3, rest remain the same}> -arg1, arg3 -> -arg3, rest remain the same}> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003115s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.219764s [25556 : 25572] [25556 : 25573] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.086991s Time used: 0.084103 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002164s Time used: 1.00218 LOG: SAT solveNonLinear - Elapsed time: 1.089155s Cost: 1; Total time: 1.08628 Termination implied by a set of invariant(s): Invariant at l2: 0 <= arg1 + arg2 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -arg1, arg3 -> -arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -arg1, arg3 -> -arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -arg1, arg3 -> -arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -arg1, arg3 -> -arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> Quasi-ranking function: 50000 - arg1 + arg2 New Graphs: Transitions: -arg1, arg3 -> -arg3, rest remain the same}> -arg1, arg3 -> -arg3, rest remain the same}> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003084s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.189407s [25556 : 25577] [25556 : 25578] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.096996s Time used: 0.093963 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002605s Time used: 1.00263 LOG: SAT solveNonLinear - Elapsed time: 1.099601s Cost: 1; Total time: 1.09659 Termination implied by a set of invariant(s): Invariant at l2: 1 + arg2 <= 0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -arg1, arg3 -> -arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -arg1, arg3 -> -arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -arg1, arg3 -> -arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -arg1, arg3 -> -arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> Quasi-ranking function: 50000 + arg1 + 2*arg2 New Graphs: Transitions: -arg1, arg3 -> -arg3, rest remain the same}> -arg1, arg3 -> -arg3, rest remain the same}> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003458s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.263348s [25556 : 25582] [25556 : 25583] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.099208s Time used: 0.095578 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000935s Time used: 1.00095 LOG: SAT solveNonLinear - Elapsed time: 1.100143s Cost: 1; Total time: 1.09653 Termination implied by a set of invariant(s): Invariant at l2: arg3 <= 1 + arg1 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -arg1, arg3 -> -arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -arg1, arg3 -> -arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -arg1, arg3 -> -arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -arg1, arg3 -> -arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> Quasi-ranking function: 50000 + arg2 New Graphs: Transitions: -arg1, arg3 -> -arg3, rest remain the same}> -arg1, arg3 -> -arg3, rest remain the same}> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003574s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.179128s [25556 : 25587] [25556 : 25588] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.109625s Time used: 4.10597 [25556 : 25700] [25556 : 25704] Successful child: 25700 Program does NOT terminate