27.26/27.30 NO 27.26/27.30 27.26/27.30 Solver Timeout: 4 27.26/27.30 Global Timeout: 300 27.26/27.30 No parsing errors! 27.26/27.30 Init Location: 0 27.26/27.30 Transitions: 27.26/27.30 27.26/27.30 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> (arg2 + 1)}> 27.26/27.30 ~(1)) /\ (arg1 > 0) /\ (undef4 > 0), par{arg1 -> undef4, arg2 -> (arg2 + 1), arg3 -> arg2}> 27.26/27.30 undef7, arg2 -> undef8, arg3 -> undef9}> 27.26/27.30 27.26/27.30 Fresh variables: 27.26/27.30 undef1, undef4, undef7, undef8, undef9, 27.26/27.30 27.26/27.30 Undef variables: 27.26/27.30 undef1, undef4, undef7, undef8, undef9, 27.26/27.30 27.26/27.30 Abstraction variables: 27.26/27.30 27.26/27.30 Exit nodes: 27.26/27.30 27.26/27.30 Accepting locations: 27.26/27.30 27.26/27.30 Asserts: 27.26/27.30 27.26/27.30 Preprocessed LLVMGraph 27.26/27.30 Init Location: 0 27.26/27.30 Transitions: 27.26/27.30 ~(1)) /\ (undef7 > 0) /\ (undef4 > 0)> 27.26/27.30 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> (arg2 + 1)}> 27.26/27.30 27.26/27.30 Fresh variables: 27.26/27.30 undef1, undef4, undef7, undef8, undef9, 27.26/27.30 27.26/27.30 Undef variables: 27.26/27.30 undef1, undef4, undef7, undef8, undef9, 27.26/27.30 27.26/27.30 Abstraction variables: 27.26/27.30 27.26/27.30 Exit nodes: 27.26/27.30 27.26/27.30 Accepting locations: 27.26/27.31 27.26/27.31 Asserts: 27.26/27.31 27.26/27.31 ************************************************************* 27.26/27.31 ******************************************************************************************* 27.26/27.31 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 27.26/27.31 ******************************************************************************************* 27.26/27.31 27.26/27.31 Init Location: 0 27.26/27.31 Graph 0: 27.26/27.31 Transitions: 27.26/27.31 Variables: 27.26/27.31 27.26/27.31 Graph 1: 27.26/27.31 Transitions: 27.26/27.31 undef1, arg2 -> 1 + arg2, rest remain the same}> 27.26/27.31 Variables: 27.26/27.31 arg1, arg2 27.26/27.31 27.26/27.31 Precedence: 27.26/27.31 Graph 0 27.26/27.31 27.26/27.31 Graph 1 27.26/27.31 27.26/27.31 27.26/27.31 Map Locations to Subgraph: 27.26/27.31 ( 0 , 0 ) 27.26/27.31 ( 1 , 1 ) 27.26/27.31 27.26/27.31 ******************************************************************************************* 27.26/27.31 ******************************** CHECKING ASSERTIONS ******************************** 27.26/27.31 ******************************************************************************************* 27.26/27.31 27.26/27.31 Proving termination of subgraph 0 27.26/27.31 Proving termination of subgraph 1 27.26/27.31 Checking unfeasibility... 27.26/27.31 Time used: 0.00252 27.26/27.31 27.26/27.31 Checking conditional termination of SCC {l1}... 27.26/27.31 27.26/27.31 LOG: CALL solveLinear 27.26/27.31 27.26/27.31 LOG: RETURN solveLinear - Elapsed time: 0.000655s 27.26/27.31 27.26/27.31 LOG: CALL solveLinear 27.26/27.31 27.26/27.31 LOG: RETURN solveLinear - Elapsed time: 0.002190s 27.26/27.31 Trying to remove transition: undef1, arg2 -> 1 + arg2, rest remain the same}> 27.26/27.31 Solving with 1 template(s). 27.26/27.31 27.26/27.31 LOG: CALL solveNonLinearGetFirstSolution 27.26/27.31 27.26/27.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006005s 27.26/27.31 Time used: 0.005826 27.26/27.31 Solving with 1 template(s). 27.26/27.31 27.26/27.31 LOG: CALL solveNonLinearGetFirstSolution 27.26/27.31 27.26/27.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001114s 27.26/27.31 Time used: 4.00055 27.26/27.31 Solving with 2 template(s). 27.26/27.31 27.26/27.31 LOG: CALL solveNonLinearGetFirstSolution 27.26/27.31 27.26/27.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.028234s 27.26/27.31 Time used: 4.00056 27.26/27.31 Solving with 3 template(s). 27.26/27.31 27.26/27.31 LOG: CALL solveNonLinearGetFirstSolution 27.26/27.31 27.26/27.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004189s 27.26/27.31 Time used: 1.00038 27.26/27.31 Solving with 1 template(s). 27.26/27.31 27.26/27.31 LOG: CALL solveNonLinearGetFirstSolution 27.26/27.31 27.26/27.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012101s 27.26/27.31 Time used: 0.008421 27.26/27.31 Improving Solution with cost 1 ... 27.26/27.31 27.26/27.31 LOG: CALL solveNonLinearGetNextSolution 27.26/27.31 27.26/27.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014815s 27.26/27.31 Time used: 0.01481 27.26/27.31 27.26/27.31 LOG: SAT solveNonLinear - Elapsed time: 0.026916s 27.26/27.31 Cost: 1; Total time: 0.023231 27.26/27.31 Termination implied by a set of invariant(s): 27.26/27.31 Invariant at l1: 1 <= arg2 27.26/27.31 [ Invariant Graph ] 27.26/27.31 Strengthening and disabling transitions... 27.26/27.31 27.26/27.31 LOG: CALL solverLinear in Graph for feasibility 27.26/27.31 27.26/27.31 LOG: RETURN solveLinear in Graph for feasibility 27.26/27.31 Strengthening transition (result): 27.26/27.31 undef1, arg2 -> 1 + arg2, rest remain the same}> 27.26/27.31 [ Termination Graph ] 27.26/27.31 Strengthening and disabling transitions... 27.26/27.31 27.26/27.31 LOG: CALL solverLinear in Graph for feasibility 27.26/27.31 27.26/27.31 LOG: RETURN solveLinear in Graph for feasibility 27.26/27.31 Strengthening transition (result): 27.26/27.31 undef1, arg2 -> 1 + arg2, rest remain the same}> 27.26/27.31 Quasi-ranking function: 50000 - arg2 27.26/27.31 New Graphs: 27.26/27.31 Transitions: 27.26/27.31 undef1, arg2 -> 1 + arg2, rest remain the same}> 27.26/27.31 Variables: 27.26/27.31 arg1, arg2 27.26/27.31 Checking conditional termination of SCC {l1}... 27.26/27.31 27.26/27.31 LOG: CALL solveLinear 27.26/27.31 27.26/27.31 LOG: RETURN solveLinear - Elapsed time: 0.000708s 27.26/27.31 27.26/27.31 LOG: CALL solveLinear 27.26/27.31 27.26/27.31 LOG: RETURN solveLinear - Elapsed time: 0.002653s 27.26/27.31 Trying to remove transition: undef1, arg2 -> 1 + arg2, rest remain the same}> 27.26/27.31 Solving with 1 template(s). 27.26/27.31 27.26/27.31 LOG: CALL solveNonLinearGetFirstSolution 27.26/27.31 27.26/27.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007027s 27.26/27.31 Time used: 0.006853 27.26/27.31 Solving with 1 template(s). 27.26/27.31 27.26/27.31 LOG: CALL solveNonLinearGetFirstSolution 27.26/27.31 27.26/27.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002820s 27.26/27.31 Time used: 4.00188 27.26/27.31 Solving with 2 template(s). 27.26/27.31 27.26/27.31 LOG: CALL solveNonLinearGetFirstSolution 27.26/27.31 27.26/27.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005917s 27.26/27.31 Time used: 4.00081 27.26/27.31 Solving with 3 template(s). 27.26/27.31 27.26/27.31 LOG: CALL solveNonLinearGetFirstSolution 27.26/27.31 27.26/27.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004677s 27.26/27.31 Time used: 1.00039 27.26/27.31 Solving with 1 template(s). 27.26/27.31 27.26/27.31 LOG: CALL solveNonLinearGetFirstSolution 27.26/27.31 27.26/27.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013688s 27.26/27.31 Time used: 0.009733 27.26/27.31 Improving Solution with cost 1 ... 27.26/27.31 27.26/27.31 LOG: CALL solveNonLinearGetNextSolution 27.26/27.31 27.26/27.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014367s 27.26/27.31 Time used: 0.014362 27.26/27.31 27.26/27.31 LOG: SAT solveNonLinear - Elapsed time: 0.028055s 27.26/27.31 Cost: 1; Total time: 0.024095 27.26/27.31 Termination implied by a set of invariant(s): 27.26/27.31 Invariant at l1: 0 <= arg2 27.26/27.31 [ Invariant Graph ] 27.26/27.31 Strengthening and disabling transitions... 27.26/27.31 27.26/27.31 LOG: CALL solverLinear in Graph for feasibility 27.26/27.31 27.26/27.31 LOG: RETURN solveLinear in Graph for feasibility 27.26/27.31 Strengthening transition (result): 27.26/27.31 undef1, arg2 -> 1 + arg2, rest remain the same}> 27.26/27.31 [ Termination Graph ] 27.26/27.31 Strengthening and disabling transitions... 27.26/27.31 27.26/27.31 LOG: CALL solverLinear in Graph for feasibility 27.26/27.31 27.26/27.31 LOG: RETURN solveLinear in Graph for feasibility 27.26/27.31 Strengthening transition (result): 27.26/27.31 undef1, arg2 -> 1 + arg2, rest remain the same}> 27.26/27.31 Quasi-ranking function: 50000 + arg1 - arg2 27.26/27.31 New Graphs: 27.26/27.31 Transitions: 27.26/27.31 undef1, arg2 -> 1 + arg2, rest remain the same}> 27.26/27.31 Variables: 27.26/27.31 arg1, arg2 27.26/27.31 Checking conditional termination of SCC {l1}... 27.26/27.31 27.26/27.31 LOG: CALL solveLinear 27.26/27.31 27.26/27.31 LOG: RETURN solveLinear - Elapsed time: 0.000831s 27.26/27.31 27.26/27.31 LOG: CALL solveLinear 27.26/27.31 27.26/27.31 LOG: RETURN solveLinear - Elapsed time: 0.003536s 27.26/27.31 Trying to remove transition: undef1, arg2 -> 1 + arg2, rest remain the same}> 27.26/27.31 Solving with 1 template(s). 27.26/27.31 27.26/27.31 LOG: CALL solveNonLinearGetFirstSolution 27.26/27.31 27.26/27.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008048s 27.26/27.31 Time used: 0.007862 27.26/27.31 Solving with 1 template(s). 27.26/27.31 27.26/27.31 LOG: CALL solveNonLinearGetFirstSolution 27.26/27.31 27.26/27.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004171s 27.26/27.31 Time used: 4.00358 27.26/27.31 Solving with 2 template(s). 27.26/27.31 27.26/27.31 LOG: CALL solveNonLinearGetFirstSolution 27.26/27.31 27.26/27.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005564s 27.26/27.31 Time used: 4.00081 27.26/27.31 Solving with 3 template(s). 27.26/27.31 27.26/27.31 LOG: CALL solveNonLinearGetFirstSolution 27.26/27.31 27.26/27.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004218s 27.26/27.31 Time used: 1.0006 27.26/27.31 Solving with 1 template(s). 27.26/27.31 27.26/27.31 LOG: CALL solveNonLinearGetFirstSolution 27.26/27.31 27.26/27.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013350s 27.26/27.31 Time used: 0.009457 27.26/27.31 Termination failed. Trying to show unreachability... 27.26/27.31 Proving unreachability of entry: 27.26/27.31 27.26/27.31 LOG: CALL check - Post:1 <= 0 - Process 1 27.26/27.31 * Exit transition: 27.26/27.31 * Postcondition : 1 <= 0 27.26/27.31 27.26/27.31 LOG: CALL solveLinear 27.26/27.31 27.26/27.31 LOG: RETURN solveLinear - Elapsed time: 0.001618s 27.26/27.31 > Postcondition is not implied! 27.26/27.31 27.26/27.31 LOG: RETURN check - Elapsed time: 0.001737s 27.26/27.31 Cannot prove unreachability 27.26/27.31 27.26/27.31 Proving non-termination of subgraph 1 27.26/27.31 Transitions: 27.26/27.31 undef1, arg2 -> 1 + arg2, rest remain the same}> 27.26/27.31 Variables: 27.26/27.31 arg1, arg2 27.26/27.31 27.26/27.31 Checking that every undef value has an assignment... 27.26/27.31 27.26/27.31 LOG: CALL solveLinear 27.26/27.31 27.26/27.31 LOG: RETURN solveLinear - Elapsed time: 0.001042s 27.26/27.31 Checking conditional non-termination of SCC {l1}... 27.26/27.31 EXIT TRANSITIONS: 27.26/27.31 27.26/27.31 27.26/27.31 Solving with 1 template(s). 27.26/27.31 27.26/27.31 LOG: CALL solveNonLinearGetFirstSolution 27.26/27.31 27.26/27.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018289s 27.26/27.31 Time used: 0.018178 27.26/27.31 27.26/27.31 LOG: SAT solveNonLinear - Elapsed time: 0.018289s 27.26/27.31 Cost: 0; Total time: 0.018178 27.26/27.31 Minimizing number of undef constraints... 27.26/27.31 27.26/27.31 LOG: CALL solveNonLinear 27.26/27.31 27.26/27.31 LOG: RETURN solveNonLinear - Elapsed time: 0.003925s 27.26/27.31 Number of undef constraints reduced! 27.26/27.31 27.26/27.31 Non-termination implied by a set of quasi-invariant(s): 27.26/27.31 Quasi-invariant at l1: 1 <= arg1 27.26/27.31 27.26/27.31 Strengthening and disabling EXIT transitions... 27.26/27.31 Closed exits from l1: 1 27.26/27.31 27.26/27.31 Strengthening and disabling transitions... 27.26/27.31 27.26/27.31 LOG: CALL solverLinear in Graph for feasibility 27.26/27.31 27.26/27.31 LOG: RETURN solveLinear in Graph for feasibility 27.26/27.31 Strengthening transition (result): 27.26/27.31 undef1, arg2 -> 1 + arg2, rest remain the same}> 27.26/27.31 27.26/27.31 Calling reachability with... 27.26/27.31 Transition: 27.26/27.31 Conditions: 1 <= arg1, 27.26/27.31 OPEN EXITS: 27.26/27.31 27.26/27.31 27.26/27.31 --- Reachability graph --- 27.26/27.31 > Graph without transitions. 27.26/27.31 27.26/27.31 Calling reachability with... 27.26/27.31 Transition: 27.26/27.31 Conditions: 1 <= arg1, 27.26/27.31 OPEN EXITS: 27.26/27.31 27.26/27.31 27.26/27.31 > Conditions are reachable! 27.26/27.31 27.26/27.31 Program does NOT terminate 27.26/27.31 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 27.26/27.31 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 27.26/27.31 EOF