13.20/13.27 NO 13.20/13.27 13.20/13.27 Solver Timeout: 4 13.20/13.27 Global Timeout: 300 13.20/13.27 No parsing errors! 13.20/13.27 Init Location: 0 13.20/13.27 Transitions: 13.20/13.27 13.20/13.27 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2, arg3 -> undef3}> 13.20/13.27 arg1, arg3 -> arg1}> 13.20/13.27 (arg1 + 1), arg2 -> undef8, arg3 -> undef9}> 13.20/13.27 5) /\ (arg2 = arg3), par{arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}> 13.20/13.27 undef13, arg2 -> undef14, arg3 -> undef15}> 13.20/13.27 13.20/13.27 Fresh variables: 13.20/13.27 undef2, undef3, undef8, undef9, undef13, undef14, undef15, 13.20/13.27 13.20/13.27 Undef variables: 13.20/13.27 undef2, undef3, undef8, undef9, undef13, undef14, undef15, 13.20/13.27 13.20/13.27 Abstraction variables: 13.20/13.27 13.20/13.27 Exit nodes: 13.20/13.27 13.20/13.27 Accepting locations: 13.20/13.27 13.20/13.27 Asserts: 13.20/13.27 13.20/13.27 Preprocessed LLVMGraph 13.20/13.27 Init Location: 0 13.20/13.27 Transitions: 13.20/13.27 0) /\ (undef14 > ~(1)) /\ (undef14 < 10)> 13.20/13.27 (arg1 + 1), arg2 -> (arg1 + 1), arg3 -> (arg1 + 1)}> 13.20/13.27 5) /\ (arg2 = arg3), par{arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}> 13.20/13.27 13.20/13.27 Fresh variables: 13.20/13.27 undef2, undef3, undef8, undef9, undef13, undef14, undef15, 13.20/13.27 13.20/13.27 Undef variables: 13.20/13.27 undef2, undef3, undef8, undef9, undef13, undef14, undef15, 13.20/13.27 13.20/13.27 Abstraction variables: 13.20/13.27 13.20/13.27 Exit nodes: 13.20/13.27 13.20/13.27 Accepting locations: 13.20/13.27 13.20/13.27 Asserts: 13.20/13.27 13.20/13.27 ************************************************************* 13.20/13.27 ******************************************************************************************* 13.20/13.27 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 13.20/13.27 ******************************************************************************************* 13.20/13.27 13.20/13.27 Init Location: 0 13.20/13.27 Graph 0: 13.20/13.27 Transitions: 13.20/13.27 Variables: 13.20/13.27 13.20/13.27 Graph 1: 13.20/13.27 Transitions: 13.20/13.27 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> 13.20/13.27 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> 13.20/13.27 Variables: 13.20/13.27 arg1, arg2, arg3 13.20/13.27 13.20/13.27 Precedence: 13.20/13.27 Graph 0 13.20/13.27 13.20/13.27 Graph 1 13.20/13.27 13.20/13.27 13.20/13.27 Map Locations to Subgraph: 13.20/13.27 ( 0 , 0 ) 13.20/13.27 ( 3 , 1 ) 13.20/13.27 13.20/13.27 ******************************************************************************************* 13.20/13.27 ******************************** CHECKING ASSERTIONS ******************************** 13.20/13.27 ******************************************************************************************* 13.20/13.27 13.20/13.27 Proving termination of subgraph 0 13.20/13.27 Proving termination of subgraph 1 13.20/13.27 Checking unfeasibility... 13.20/13.27 Time used: 0.032012 13.20/13.27 13.20/13.27 Checking conditional termination of SCC {l3}... 13.20/13.27 13.20/13.27 LOG: CALL solveLinear 13.20/13.27 13.20/13.27 LOG: RETURN solveLinear - Elapsed time: 0.001748s 13.20/13.27 Ranking function: 8 - arg1 13.20/13.27 New Graphs: 13.20/13.27 Transitions: 13.20/13.27 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> 13.20/13.27 Variables: 13.20/13.27 arg2, arg3 13.20/13.27 Checking conditional termination of SCC {l3}... 13.20/13.27 13.20/13.27 LOG: CALL solveLinear 13.20/13.27 13.20/13.27 LOG: RETURN solveLinear - Elapsed time: 0.000503s 13.20/13.27 13.20/13.27 LOG: CALL solveLinear 13.20/13.27 13.20/13.27 LOG: RETURN solveLinear - Elapsed time: 0.001768s 13.20/13.27 Trying to remove transition: 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> 13.20/13.27 Solving with 1 template(s). 13.20/13.27 13.20/13.27 LOG: CALL solveNonLinearGetFirstSolution 13.20/13.27 13.20/13.27 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006236s 13.20/13.27 Time used: 0.006096 13.20/13.27 Solving with 1 template(s). 13.20/13.27 13.20/13.27 LOG: CALL solveNonLinearGetFirstSolution 13.20/13.27 13.20/13.27 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000927s 13.20/13.27 Time used: 4.00051 13.20/13.27 Solving with 2 template(s). 13.20/13.27 13.20/13.27 LOG: CALL solveNonLinearGetFirstSolution 13.20/13.27 13.20/13.27 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.009996s 13.20/13.27 Time used: 4.00107 13.20/13.27 Solving with 3 template(s). 13.20/13.27 13.20/13.27 LOG: CALL solveNonLinearGetFirstSolution 13.20/13.27 13.20/13.27 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.016990s 13.20/13.27 Time used: 1.00007 13.20/13.27 Solving with 1 template(s). 13.20/13.27 13.20/13.27 LOG: CALL solveNonLinearGetFirstSolution 13.20/13.27 13.20/13.27 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006716s 13.20/13.27 Time used: 4.00006 13.20/13.27 Termination failed. Trying to show unreachability... 13.20/13.27 Proving unreachability of entry: 13.20/13.27 13.20/13.27 LOG: CALL check - Post:1 <= 0 - Process 1 13.20/13.27 * Exit transition: 13.20/13.27 * Postcondition : 1 <= 0 13.20/13.27 13.20/13.27 LOG: CALL solveLinear 13.20/13.27 13.20/13.27 LOG: RETURN solveLinear - Elapsed time: 0.015309s 13.20/13.27 > Postcondition is not implied! 13.20/13.27 13.20/13.27 LOG: RETURN check - Elapsed time: 0.015460s 13.20/13.27 Cannot prove unreachability 13.20/13.27 13.20/13.27 Proving non-termination of subgraph 1 13.20/13.27 Transitions: 13.20/13.27 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> 13.20/13.27 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> 13.20/13.27 Variables: 13.20/13.27 arg1, arg2, arg3 13.20/13.27 13.20/13.27 Checking conditional non-termination of SCC {l3}... 13.20/13.27 EXIT TRANSITIONS: 13.20/13.27 13.20/13.27 13.20/13.27 13.20/13.27 13.20/13.27 13.20/13.27 13.20/13.27 13.20/13.27 Solving with 1 template(s). 13.20/13.27 13.20/13.27 LOG: CALL solveNonLinearGetFirstSolution 13.20/13.27 13.20/13.27 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021446s 13.20/13.27 Time used: 0.021167 13.20/13.27 Improving Solution with cost 4 ... 13.20/13.27 13.20/13.27 LOG: CALL solveNonLinearGetNextSolution 13.20/13.27 13.20/13.27 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.047707s 13.20/13.27 Time used: 0.047702 13.20/13.27 13.20/13.27 LOG: SAT solveNonLinear - Elapsed time: 0.069153s 13.20/13.27 Cost: 4; Total time: 0.068869 13.20/13.27 Non-termination implied by a set of quasi-invariant(s): 13.20/13.27 Quasi-invariant at l3: arg2 <= arg3 13.20/13.27 13.20/13.27 Strengthening and disabling EXIT transitions... 13.20/13.27 Closed exits from l3: 3 13.20/13.27 Strengthening exit transition (result): 13.20/13.27 13.20/13.27 Strengthening exit transition (result): 13.20/13.27 13.20/13.27 Strengthening exit transition (result): 13.20/13.27 13.20/13.27 13.20/13.27 Strengthening and disabling transitions... 13.20/13.27 13.20/13.27 LOG: CALL solverLinear in Graph for feasibility 13.20/13.27 13.20/13.27 LOG: RETURN solveLinear in Graph for feasibility 13.20/13.27 Strengthening transition (result): 13.20/13.27 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> 13.20/13.27 13.20/13.27 LOG: CALL solverLinear in Graph for feasibility 13.20/13.27 13.20/13.27 LOG: RETURN solveLinear in Graph for feasibility 13.20/13.27 Strengthening transition (result): 13.20/13.27 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> 13.20/13.27 13.20/13.27 Checking conditional non-termination of SCC {l3}... 13.20/13.27 EXIT TRANSITIONS: 13.20/13.27 13.20/13.27 13.20/13.27 13.20/13.27 13.20/13.27 Solving with 1 template(s). 13.20/13.27 13.20/13.27 LOG: CALL solveNonLinearGetFirstSolution 13.20/13.27 13.20/13.27 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011493s 13.20/13.27 Time used: 0.011235 13.20/13.27 Improving Solution with cost 1 ... 13.20/13.27 13.20/13.27 LOG: CALL solveNonLinearGetNextSolution 13.20/13.27 13.20/13.27 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011836s 13.20/13.27 Time used: 0.01183 13.20/13.27 13.20/13.27 LOG: SAT solveNonLinear - Elapsed time: 0.023330s 13.20/13.27 Cost: 1; Total time: 0.023065 13.20/13.27 Non-termination implied by a set of quasi-invariant(s): 13.20/13.27 Quasi-invariant at l3: arg3 <= arg2 13.20/13.27 13.20/13.27 Strengthening and disabling EXIT transitions... 13.20/13.27 Closed exits from l3: 2 13.20/13.27 Strengthening exit transition (result): 13.20/13.27 13.20/13.27 13.20/13.27 Strengthening and disabling transitions... 13.20/13.27 13.20/13.27 LOG: CALL solverLinear in Graph for feasibility 13.20/13.27 13.20/13.27 LOG: RETURN solveLinear in Graph for feasibility 13.20/13.27 Strengthening transition (result): 13.20/13.27 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> 13.20/13.27 13.20/13.27 LOG: CALL solverLinear in Graph for feasibility 13.20/13.27 13.20/13.27 LOG: RETURN solveLinear in Graph for feasibility 13.20/13.27 Strengthening transition (result): 13.20/13.27 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> 13.20/13.27 13.20/13.27 Checking conditional non-termination of SCC {l3}... 13.20/13.27 EXIT TRANSITIONS: 13.20/13.27 13.20/13.27 13.20/13.27 Solving with 1 template(s). 13.20/13.27 13.20/13.27 LOG: CALL solveNonLinearGetFirstSolution 13.20/13.27 13.20/13.27 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012393s 13.20/13.27 Time used: 0.012292 13.20/13.27 13.20/13.27 LOG: SAT solveNonLinear - Elapsed time: 0.012393s 13.20/13.27 Cost: 0; Total time: 0.012292 13.20/13.27 Non-termination implied by a set of quasi-invariant(s): 13.20/13.27 Quasi-invariant at l3: arg1 <= arg3 13.20/13.27 13.20/13.27 Strengthening and disabling EXIT transitions... 13.20/13.27 Closed exits from l3: 1 13.20/13.27 13.20/13.27 Strengthening and disabling transitions... 13.20/13.27 13.20/13.27 LOG: CALL solverLinear in Graph for feasibility 13.20/13.27 13.20/13.27 LOG: RETURN solveLinear in Graph for feasibility 13.20/13.27 Strengthening transition (result): 13.20/13.27 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> 13.20/13.27 13.20/13.27 LOG: CALL solverLinear in Graph for feasibility 13.20/13.27 13.20/13.27 LOG: RETURN solveLinear in Graph for feasibility 13.20/13.27 Strengthening transition (result): 13.20/13.27 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> 13.20/13.27 13.20/13.27 Calling reachability with... 13.20/13.27 Transition: 13.20/13.27 Conditions: arg2 <= arg3, arg3 <= arg2, arg1 <= arg3, 13.20/13.27 OPEN EXITS: 13.20/13.27 13.20/13.27 13.20/13.27 --- Reachability graph --- 13.20/13.27 > Graph without transitions. 13.20/13.27 13.20/13.27 Calling reachability with... 13.20/13.27 Transition: 13.20/13.27 Conditions: arg1 <= arg3, arg2 = arg3, 13.20/13.27 OPEN EXITS: 13.20/13.27 13.20/13.27 13.20/13.27 > Conditions are reachable! 13.20/13.27 13.20/13.27 Program does NOT terminate 13.20/13.27 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 13.20/13.27 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 13.20/13.27 EOF