23.31/23.38 NO 23.31/23.38 23.31/23.38 Solver Timeout: 4 23.31/23.38 Global Timeout: 300 23.31/23.38 No parsing errors! 23.31/23.38 Init Location: 0 23.31/23.38 Transitions: 23.31/23.38 23.31/23.38 (~(1) + x^0)}> 23.31/23.38 23.31/23.38 23.31/23.38 23.31/23.38 100}> 23.31/23.38 23.31/23.38 23.31/23.38 Fresh variables: 23.31/23.38 23.31/23.38 Undef variables: 23.31/23.38 23.31/23.38 Abstraction variables: 23.31/23.38 23.31/23.38 Exit nodes: 23.31/23.38 23.31/23.38 Accepting locations: 23.31/23.38 23.31/23.38 Asserts: 23.31/23.38 23.31/23.38 Preprocessed LLVMGraph 23.31/23.38 Init Location: 0 23.31/23.38 Transitions: 23.31/23.38 23.31/23.38 (~(1) + x^0)}> 23.31/23.38 (~(1) + x^0)}> 23.31/23.38 23.31/23.38 Fresh variables: 23.31/23.38 23.31/23.38 Undef variables: 23.31/23.38 23.31/23.38 Abstraction variables: 23.31/23.38 23.31/23.38 Exit nodes: 23.31/23.38 23.31/23.38 Accepting locations: 23.31/23.38 23.31/23.38 Asserts: 23.31/23.38 23.31/23.38 ************************************************************* 23.31/23.38 ******************************************************************************************* 23.31/23.38 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 23.31/23.38 ******************************************************************************************* 23.31/23.38 23.31/23.38 Init Location: 0 23.31/23.39 Graph 0: 23.31/23.39 Transitions: 23.31/23.39 Variables: 23.31/23.39 23.31/23.39 Graph 1: 23.31/23.39 Transitions: 23.31/23.39 -1 + x^0, rest remain the same}> 23.31/23.39 -1 + x^0, rest remain the same}> 23.31/23.39 Variables: 23.31/23.39 x^0 23.31/23.39 23.31/23.39 Precedence: 23.31/23.39 Graph 0 23.31/23.39 23.31/23.39 Graph 1 23.31/23.39 23.31/23.39 23.31/23.39 Map Locations to Subgraph: 23.31/23.39 ( 0 , 0 ) 23.31/23.39 ( 1 , 1 ) 23.31/23.39 23.31/23.39 ******************************************************************************************* 23.31/23.39 ******************************** CHECKING ASSERTIONS ******************************** 23.31/23.39 ******************************************************************************************* 23.31/23.39 23.31/23.39 Proving termination of subgraph 0 23.31/23.39 Proving termination of subgraph 1 23.31/23.39 Checking unfeasibility... 23.31/23.39 Time used: 0.098031 23.31/23.39 Some transition disabled by a set of invariant(s): 23.31/23.39 Invariant at l1: x^0 <= 101 23.31/23.39 23.31/23.39 Strengthening and disabling transitions... 23.31/23.39 > It's unfeasible. Removing transition: 23.31/23.39 -1 + x^0, rest remain the same}> 23.31/23.39 23.31/23.39 LOG: CALL solverLinear in Graph for feasibility 23.31/23.39 23.31/23.39 LOG: RETURN solveLinear in Graph for feasibility 23.31/23.39 Strengthening transition (result): 23.31/23.39 -1 + x^0, rest remain the same}> 23.31/23.39 Checking unfeasibility... 23.31/23.39 Time used: 0.107351 23.31/23.39 23.31/23.39 Checking conditional termination of SCC {l1}... 23.31/23.39 23.31/23.39 LOG: CALL solveLinear 23.31/23.39 23.31/23.39 LOG: RETURN solveLinear - Elapsed time: 0.001650s 23.31/23.39 23.31/23.39 LOG: CALL solveLinear 23.31/23.39 23.31/23.39 LOG: RETURN solveLinear - Elapsed time: 0.001168s 23.31/23.39 Trying to remove transition: -1 + x^0, rest remain the same}> 23.31/23.39 Solving with 1 template(s). 23.31/23.39 23.31/23.39 LOG: CALL solveNonLinearGetFirstSolution 23.31/23.39 23.31/23.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002914s 23.31/23.39 Time used: 0.002789 23.31/23.39 Solving with 1 template(s). 23.31/23.39 23.31/23.39 LOG: CALL solveNonLinearGetFirstSolution 23.31/23.39 23.31/23.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001030s 23.31/23.39 Time used: 4.00057 23.31/23.39 Solving with 2 template(s). 23.31/23.39 23.31/23.39 LOG: CALL solveNonLinearGetFirstSolution 23.31/23.39 23.31/23.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.010766s 23.31/23.39 Time used: 4.00092 23.31/23.39 Solving with 3 template(s). 23.31/23.39 23.31/23.39 LOG: CALL solveNonLinearGetFirstSolution 23.31/23.39 23.31/23.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.019007s 23.31/23.39 Time used: 1.00603 23.31/23.39 Solving with 1 template(s). 23.31/23.39 23.31/23.39 LOG: CALL solveNonLinearGetFirstSolution 23.31/23.39 23.31/23.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008455s 23.31/23.39 Time used: 0.005298 23.31/23.39 Improving Solution with cost 1 ... 23.31/23.39 23.31/23.39 LOG: CALL solveNonLinearGetNextSolution 23.31/23.39 23.31/23.39 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000718s 23.31/23.39 Time used: 1.00063 23.31/23.39 23.31/23.39 LOG: SAT solveNonLinear - Elapsed time: 1.009172s 23.31/23.39 Cost: 1; Total time: 1.00593 23.31/23.39 Quasi-ranking function: 50000 + x^0 23.31/23.39 New Graphs: 23.31/23.39 Transitions: 23.31/23.39 -1 + x^0, rest remain the same}> 23.31/23.39 Variables: 23.31/23.39 x^0 23.31/23.39 Checking conditional termination of SCC {l1}... 23.31/23.39 23.31/23.39 LOG: CALL solveLinear 23.31/23.39 23.31/23.39 LOG: RETURN solveLinear - Elapsed time: 0.000434s 23.31/23.39 23.31/23.39 LOG: CALL solveLinear 23.31/23.39 23.31/23.39 LOG: RETURN solveLinear - Elapsed time: 0.001294s 23.31/23.39 Trying to remove transition: -1 + x^0, rest remain the same}> 23.31/23.39 Solving with 1 template(s). 23.31/23.39 23.31/23.39 LOG: CALL solveNonLinearGetFirstSolution 23.31/23.39 23.31/23.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003822s 23.31/23.39 Time used: 0.003688 23.31/23.39 Solving with 1 template(s). 23.31/23.39 23.31/23.39 LOG: CALL solveNonLinearGetFirstSolution 23.31/23.39 23.31/23.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001502s 23.31/23.39 Time used: 4.00104 23.31/23.39 Solving with 2 template(s). 23.31/23.39 23.31/23.39 LOG: CALL solveNonLinearGetFirstSolution 23.31/23.39 23.31/23.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.010876s 23.31/23.39 Time used: 4.00125 23.31/23.39 Solving with 3 template(s). 23.31/23.39 23.31/23.39 LOG: CALL solveNonLinearGetFirstSolution 23.31/23.39 23.31/23.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.010521s 23.31/23.39 Time used: 1.00062 23.31/23.39 Solving with 1 template(s). 23.31/23.39 23.31/23.39 LOG: CALL solveNonLinearGetFirstSolution 23.31/23.39 23.31/23.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004123s 23.31/23.39 Time used: 4.00114 23.31/23.39 Termination failed. Trying to show unreachability... 23.31/23.39 Proving unreachability of entry: 23.31/23.39 23.31/23.39 LOG: CALL check - Post:1 <= 0 - Process 1 23.31/23.39 * Exit transition: 23.31/23.39 * Postcondition : 1 <= 0 23.31/23.39 23.31/23.39 LOG: CALL solveLinear 23.31/23.39 23.31/23.39 LOG: RETURN solveLinear - Elapsed time: 0.012643s 23.31/23.39 > Postcondition is not implied! 23.31/23.39 23.31/23.39 LOG: RETURN check - Elapsed time: 0.012748s 23.31/23.39 Cannot prove unreachability 23.31/23.39 23.31/23.39 Proving non-termination of subgraph 1 23.31/23.39 Transitions: 23.31/23.39 -1 + x^0, rest remain the same}> 23.31/23.39 Variables: 23.31/23.39 x^0 23.31/23.39 23.31/23.39 Checking conditional non-termination of SCC {l1}... 23.31/23.39 > No exit transition to close. 23.31/23.39 Calling reachability with... 23.31/23.39 Transition: 23.31/23.39 Conditions: 23.31/23.39 OPEN EXITS: 23.31/23.39 23.31/23.39 23.31/23.39 --- Reachability graph --- 23.31/23.39 > Graph without transitions. 23.31/23.39 23.31/23.39 Calling reachability with... 23.31/23.39 Transition: 23.31/23.39 Conditions: 23.31/23.39 OPEN EXITS: 23.31/23.39 23.31/23.39 23.31/23.39 > Conditions are reachable! 23.31/23.39 23.31/23.39 Program does NOT terminate 23.31/23.39 /export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 23.31/23.39 /export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 23.31/23.39 EOF