19.56/19.59 NO 19.56/19.59 19.56/19.59 Solver Timeout: 4 19.56/19.59 Global Timeout: 300 19.56/19.59 No parsing errors! 19.56/19.59 Init Location: 0 19.56/19.59 Transitions: 19.56/19.59 19.56/19.59 ~(1)) /\ (arg2 > 1) /\ (undef5 > ~(1)) /\ (arg1 > 0), par{arg1 -> (undef4 - undef5), arg2 -> undef2, arg3 -> undef3}> 19.56/19.59 0), par{arg1 -> (arg1 + 1), arg2 -> (arg1 + 1), arg3 -> (arg1 + 1)}> 19.56/19.59 undef10, arg3 -> undef11}> 19.56/19.59 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> 19.56/19.59 undef15, arg2 -> undef16, arg3 -> undef17}> 19.56/19.59 19.56/19.59 Fresh variables: 19.56/19.59 undef2, undef3, undef4, undef5, undef10, undef11, undef15, undef16, undef17, 19.56/19.59 19.56/19.59 Undef variables: 19.56/19.59 undef2, undef3, undef4, undef5, undef10, undef11, undef15, undef16, undef17, 19.56/19.59 19.56/19.59 Abstraction variables: 19.56/19.59 19.56/19.59 Exit nodes: 19.56/19.59 19.56/19.59 Accepting locations: 19.56/19.59 19.56/19.59 Asserts: 19.56/19.59 19.56/19.59 Preprocessed LLVMGraph 19.56/19.59 Init Location: 0 19.56/19.59 Transitions: 19.56/19.59 ~(1)) /\ (undef16 > 1) /\ (undef5 > ~(1)) /\ (undef15 > 0) /\ ((undef4 - undef5) > 0)> 19.56/19.59 0), par{arg1 -> (arg1 + 1), arg2 -> (arg1 + 1), arg3 -> (arg1 + 1)}> 19.56/19.59 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> 19.56/19.59 19.56/19.59 Fresh variables: 19.56/19.59 undef2, undef3, undef4, undef5, undef10, undef11, undef15, undef16, undef17, 19.56/19.59 19.56/19.59 Undef variables: 19.56/19.59 undef2, undef3, undef4, undef5, undef10, undef11, undef15, undef16, undef17, 19.56/19.59 19.56/19.59 Abstraction variables: 19.56/19.59 19.56/19.59 Exit nodes: 19.56/19.59 19.56/19.59 Accepting locations: 19.56/19.59 19.56/19.59 Asserts: 19.56/19.59 19.56/19.59 ************************************************************* 19.56/19.59 ******************************************************************************************* 19.56/19.59 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 19.56/19.59 ******************************************************************************************* 19.56/19.59 19.56/19.59 Init Location: 0 19.56/19.59 Graph 0: 19.56/19.59 Transitions: 19.56/19.59 Variables: 19.56/19.59 19.56/19.59 Graph 1: 19.56/19.59 Transitions: 19.56/19.59 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> 19.56/19.59 -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> 19.56/19.59 Variables: 19.56/19.59 arg1, arg2, arg3 19.56/19.59 19.56/19.59 Precedence: 19.56/19.59 Graph 0 19.56/19.59 19.56/19.59 Graph 1 19.56/19.59 19.56/19.59 19.56/19.59 Map Locations to Subgraph: 19.56/19.59 ( 0 , 0 ) 19.56/19.59 ( 3 , 1 ) 19.56/19.59 19.56/19.59 ******************************************************************************************* 19.56/19.59 ******************************** CHECKING ASSERTIONS ******************************** 19.56/19.59 ******************************************************************************************* 19.56/19.59 19.56/19.59 Proving termination of subgraph 0 19.56/19.59 Proving termination of subgraph 1 19.56/19.59 Checking unfeasibility... 19.56/19.59 Time used: 0.032013 19.56/19.59 19.56/19.59 Checking conditional termination of SCC {l3}... 19.56/19.59 19.56/19.59 LOG: CALL solveLinear 19.56/19.59 19.56/19.59 LOG: RETURN solveLinear - Elapsed time: 0.001205s 19.56/19.59 19.56/19.59 LOG: CALL solveLinear 19.56/19.59 19.56/19.59 LOG: RETURN solveLinear - Elapsed time: 0.009315s 19.56/19.59 Trying to remove transition: -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> 19.56/19.59 Solving with 1 template(s). 19.56/19.59 19.56/19.59 LOG: CALL solveNonLinearGetFirstSolution 19.56/19.59 19.56/19.59 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020823s 19.56/19.59 Time used: 0.020602 19.56/19.59 Trying to remove transition: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> 19.56/19.59 Solving with 1 template(s). 19.56/19.59 19.56/19.59 LOG: CALL solveNonLinearGetFirstSolution 19.56/19.59 19.56/19.59 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001000s 19.56/19.59 Time used: 4.0001 19.56/19.59 Solving with 1 template(s). 19.56/19.59 19.56/19.59 LOG: CALL solveNonLinearGetFirstSolution 19.56/19.59 19.56/19.59 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.014041s 19.56/19.59 Time used: 4.00021 19.56/19.59 Solving with 2 template(s). 19.56/19.59 19.56/19.59 LOG: CALL solveNonLinearGetFirstSolution 19.56/19.59 19.56/19.59 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.016534s 19.56/19.59 Time used: 4.00013 19.56/19.59 Solving with 3 template(s). 19.56/19.59 19.56/19.59 LOG: CALL solveNonLinearGetFirstSolution 19.56/19.59 19.56/19.59 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.021654s 19.56/19.59 Time used: 1.00005 19.56/19.59 Solving with 1 template(s). 19.56/19.59 19.56/19.59 LOG: CALL solveNonLinearGetFirstSolution 19.56/19.59 19.56/19.59 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.011404s 19.56/19.59 Time used: 4.00013 19.56/19.59 Termination failed. Trying to show unreachability... 19.56/19.59 Proving unreachability of entry: 19.56/19.59 19.56/19.59 LOG: CALL check - Post:1 <= 0 - Process 1 19.56/19.59 * Exit transition: 19.56/19.59 * Postcondition : 1 <= 0 19.56/19.59 19.56/19.59 LOG: CALL solveLinear 19.56/19.59 19.56/19.59 LOG: RETURN solveLinear - Elapsed time: 0.020748s 19.56/19.59 > Postcondition is not implied! 19.56/19.59 19.56/19.59 LOG: RETURN check - Elapsed time: 0.020949s 19.56/19.59 Cannot prove unreachability 19.56/19.59 19.56/19.59 Proving non-termination of subgraph 1 19.56/19.59 Transitions: 19.56/19.59 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> 19.56/19.59 -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> 19.56/19.59 Variables: 19.56/19.59 arg1, arg2, arg3 19.56/19.59 19.56/19.59 Checking conditional non-termination of SCC {l3}... 19.56/19.59 EXIT TRANSITIONS: 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 Solving with 1 template(s). 19.56/19.59 19.56/19.59 LOG: CALL solveNonLinearGetFirstSolution 19.56/19.59 19.56/19.59 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.134686s 19.56/19.59 Time used: 0.134171 19.56/19.59 Improving Solution with cost 9 ... 19.56/19.59 19.56/19.59 LOG: CALL solveNonLinearGetNextSolution 19.56/19.59 19.56/19.59 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000741s 19.56/19.59 Time used: 1.00069 19.56/19.59 19.56/19.59 LOG: SAT solveNonLinear - Elapsed time: 1.135427s 19.56/19.59 Cost: 9; Total time: 1.13487 19.56/19.59 Non-termination implied by a set of quasi-invariant(s): 19.56/19.59 Quasi-invariant at l3: 1 <= arg1 19.56/19.59 19.56/19.59 Strengthening and disabling EXIT transitions... 19.56/19.59 Closed exits from l3: 10 19.56/19.59 Strengthening exit transition (result): 19.56/19.59 19.56/19.59 Strengthening exit transition (result): 19.56/19.59 19.56/19.59 Strengthening exit transition (result): 19.56/19.59 19.56/19.59 Strengthening exit transition (result): 19.56/19.59 19.56/19.59 Strengthening exit transition (result): 19.56/19.59 19.56/19.59 Strengthening exit transition (result): 19.56/19.59 19.56/19.59 Strengthening exit transition (result): 19.56/19.59 19.56/19.59 Strengthening exit transition (result): 19.56/19.59 19.56/19.59 Strengthening exit transition (result): 19.56/19.59 19.56/19.59 19.56/19.59 Strengthening and disabling transitions... 19.56/19.59 19.56/19.59 LOG: CALL solverLinear in Graph for feasibility 19.56/19.59 19.56/19.59 LOG: RETURN solveLinear in Graph for feasibility 19.56/19.59 Strengthening transition (result): 19.56/19.59 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> 19.56/19.59 19.56/19.59 LOG: CALL solverLinear in Graph for feasibility 19.56/19.59 19.56/19.59 LOG: RETURN solveLinear in Graph for feasibility 19.56/19.59 Strengthening transition (result): 19.56/19.59 -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> 19.56/19.59 19.56/19.59 Checking conditional non-termination of SCC {l3}... 19.56/19.59 EXIT TRANSITIONS: 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 Solving with 1 template(s). 19.56/19.59 19.56/19.59 LOG: CALL solveNonLinearGetFirstSolution 19.56/19.59 19.56/19.59 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.094086s 19.56/19.59 Time used: 0.09372 19.56/19.59 Improving Solution with cost 5 ... 19.56/19.59 19.56/19.59 LOG: CALL solveNonLinearGetNextSolution 19.56/19.59 19.56/19.59 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000674s 19.56/19.59 Time used: 1.00051 19.56/19.59 19.56/19.59 LOG: SAT solveNonLinear - Elapsed time: 1.094759s 19.56/19.59 Cost: 5; Total time: 1.09423 19.56/19.59 Non-termination implied by a set of quasi-invariant(s): 19.56/19.59 Quasi-invariant at l3: arg2 <= arg3 19.56/19.59 19.56/19.59 Strengthening and disabling EXIT transitions... 19.56/19.59 Closed exits from l3: 4 19.56/19.59 Strengthening exit transition (result): 19.56/19.59 19.56/19.59 Strengthening exit transition (result): 19.56/19.59 19.56/19.59 Strengthening exit transition (result): 19.56/19.59 19.56/19.59 Strengthening exit transition (result): 19.56/19.59 19.56/19.59 Strengthening exit transition (result): 19.56/19.59 19.56/19.59 19.56/19.59 Strengthening and disabling transitions... 19.56/19.59 19.56/19.59 LOG: CALL solverLinear in Graph for feasibility 19.56/19.59 19.56/19.59 LOG: RETURN solveLinear in Graph for feasibility 19.56/19.59 Strengthening transition (result): 19.56/19.59 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> 19.56/19.59 19.56/19.59 LOG: CALL solverLinear in Graph for feasibility 19.56/19.59 19.56/19.59 LOG: RETURN solveLinear in Graph for feasibility 19.56/19.59 Strengthening transition (result): 19.56/19.59 -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> 19.56/19.59 19.56/19.59 Checking conditional non-termination of SCC {l3}... 19.56/19.59 EXIT TRANSITIONS: 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 19.56/19.59 Solving with 1 template(s). 19.56/19.59 19.56/19.59 LOG: CALL solveNonLinearGetFirstSolution 19.56/19.59 19.56/19.59 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.025301s 19.56/19.59 Time used: 0.024974 19.56/19.59 Improving Solution with cost 1 ... 19.56/19.59 19.56/19.59 LOG: CALL solveNonLinearGetNextSolution 19.56/19.59 19.56/19.59 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.033926s 19.56/19.59 Time used: 0.03392 19.56/19.59 19.56/19.59 LOG: SAT solveNonLinear - Elapsed time: 0.059227s 19.56/19.59 Cost: 1; Total time: 0.058894 19.56/19.59 Non-termination implied by a set of quasi-invariant(s): 19.56/19.59 Quasi-invariant at l3: arg3 <= arg2 19.56/19.59 19.56/19.59 Strengthening and disabling EXIT transitions... 19.56/19.59 Closed exits from l3: 4 19.56/19.59 Strengthening exit transition (result): 19.56/19.59 19.56/19.59 19.56/19.59 Strengthening and disabling transitions... 19.56/19.59 19.56/19.59 LOG: CALL solverLinear in Graph for feasibility 19.56/19.59 19.56/19.59 LOG: RETURN solveLinear in Graph for feasibility 19.56/19.59 Strengthening transition (result): 19.56/19.59 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> 19.56/19.59 19.56/19.59 LOG: CALL solverLinear in Graph for feasibility 19.56/19.59 19.56/19.59 LOG: RETURN solveLinear in Graph for feasibility 19.56/19.59 Strengthening transition (result): 19.56/19.59 -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> 19.56/19.59 19.56/19.59 Checking conditional non-termination of SCC {l3}... 19.56/19.59 EXIT TRANSITIONS: 19.56/19.59 19.56/19.59 19.56/19.59 Solving with 1 template(s). 19.56/19.59 19.56/19.59 LOG: CALL solveNonLinearGetFirstSolution 19.56/19.59 19.56/19.59 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008896s 19.56/19.59 Time used: 0.008793 19.56/19.59 19.56/19.59 LOG: SAT solveNonLinear - Elapsed time: 0.008896s 19.56/19.59 Cost: 0; Total time: 0.008793 19.56/19.59 Non-termination implied by a set of quasi-invariant(s): 19.56/19.59 Quasi-invariant at l3: 0 <= arg2 + arg3 19.56/19.59 19.56/19.59 Strengthening and disabling EXIT transitions... 19.56/19.59 Closed exits from l3: 1 19.56/19.59 19.56/19.59 Strengthening and disabling transitions... 19.56/19.59 19.56/19.59 LOG: CALL solverLinear in Graph for feasibility 19.56/19.59 19.56/19.59 LOG: RETURN solveLinear in Graph for feasibility 19.56/19.59 Strengthening transition (result): 19.56/19.59 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> 19.56/19.59 19.56/19.59 LOG: CALL solverLinear in Graph for feasibility 19.56/19.59 19.56/19.59 LOG: RETURN solveLinear in Graph for feasibility 19.56/19.59 Strengthening transition (result): 19.56/19.59 -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> 19.56/19.59 19.56/19.59 Calling reachability with... 19.56/19.59 Transition: 19.56/19.59 Conditions: 1 <= arg1, arg2 <= arg3, arg3 <= arg2, 0 <= arg2 + arg3, 19.56/19.59 OPEN EXITS: 19.56/19.59 19.56/19.59 19.56/19.59 --- Reachability graph --- 19.56/19.59 > Graph without transitions. 19.56/19.59 19.56/19.59 Calling reachability with... 19.56/19.59 Transition: 19.56/19.59 Conditions: 1 <= arg1, 0 <= arg2 + arg3, arg2 = arg3, 19.56/19.59 OPEN EXITS: 19.56/19.59 19.56/19.59 19.56/19.59 > Conditions are reachable! 19.56/19.59 19.56/19.59 Program does NOT terminate 19.56/19.59 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 19.56/19.59 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 19.56/19.59 EOF