27.19/27.28 NO 27.19/27.28 27.19/27.28 Solver Timeout: 4 27.19/27.28 Global Timeout: 300 27.19/27.28 No parsing errors! 27.19/27.28 Init Location: 0 27.19/27.28 Transitions: 27.19/27.28 27.19/27.28 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> (arg2 + 1)}> 27.19/27.28 ~(1)) /\ (arg1 > 0) /\ (undef4 > 0), par{arg1 -> undef4, arg2 -> (arg2 + 1), arg3 -> arg2}> 27.19/27.28 undef7, arg2 -> undef8, arg3 -> undef9}> 27.19/27.28 27.19/27.28 Fresh variables: 27.19/27.28 undef1, undef4, undef7, undef8, undef9, 27.19/27.28 27.19/27.28 Undef variables: 27.19/27.28 undef1, undef4, undef7, undef8, undef9, 27.19/27.28 27.19/27.28 Abstraction variables: 27.19/27.28 27.19/27.28 Exit nodes: 27.19/27.28 27.19/27.28 Accepting locations: 27.19/27.28 27.19/27.28 Asserts: 27.19/27.28 27.19/27.28 Preprocessed LLVMGraph 27.19/27.28 Init Location: 0 27.19/27.28 Transitions: 27.19/27.28 ~(1)) /\ (undef7 > 0) /\ (undef4 > 0)> 27.19/27.28 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> (arg2 + 1)}> 27.19/27.28 27.19/27.28 Fresh variables: 27.19/27.28 undef1, undef4, undef7, undef8, undef9, 27.19/27.28 27.19/27.28 Undef variables: 27.19/27.28 undef1, undef4, undef7, undef8, undef9, 27.19/27.28 27.19/27.28 Abstraction variables: 27.19/27.28 27.19/27.28 Exit nodes: 27.19/27.28 27.19/27.28 Accepting locations: 27.19/27.28 27.19/27.28 Asserts: 27.19/27.28 27.19/27.28 ************************************************************* 27.19/27.28 ******************************************************************************************* 27.19/27.28 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 27.19/27.28 ******************************************************************************************* 27.19/27.28 27.19/27.28 Init Location: 0 27.19/27.28 Graph 0: 27.19/27.28 Transitions: 27.19/27.28 Variables: 27.19/27.28 27.19/27.28 Graph 1: 27.19/27.28 Transitions: 27.19/27.28 undef1, arg2 -> 1 + arg2, rest remain the same}> 27.19/27.28 Variables: 27.19/27.28 arg1, arg2 27.19/27.28 27.19/27.28 Precedence: 27.19/27.28 Graph 0 27.19/27.28 27.19/27.28 Graph 1 27.19/27.28 27.19/27.28 27.19/27.28 Map Locations to Subgraph: 27.19/27.28 ( 0 , 0 ) 27.19/27.28 ( 1 , 1 ) 27.19/27.28 27.19/27.28 ******************************************************************************************* 27.19/27.28 ******************************** CHECKING ASSERTIONS ******************************** 27.19/27.28 ******************************************************************************************* 27.19/27.28 27.19/27.28 Proving termination of subgraph 0 27.19/27.28 Proving termination of subgraph 1 27.19/27.28 Checking unfeasibility... 27.19/27.28 Time used: 0.002571 27.19/27.28 27.19/27.28 Checking conditional termination of SCC {l1}... 27.19/27.28 27.19/27.28 LOG: CALL solveLinear 27.19/27.28 27.19/27.28 LOG: RETURN solveLinear - Elapsed time: 0.000654s 27.19/27.28 27.19/27.28 LOG: CALL solveLinear 27.19/27.28 27.19/27.28 LOG: RETURN solveLinear - Elapsed time: 0.002209s 27.19/27.28 Trying to remove transition: undef1, arg2 -> 1 + arg2, rest remain the same}> 27.19/27.28 Solving with 1 template(s). 27.19/27.28 27.19/27.28 LOG: CALL solveNonLinearGetFirstSolution 27.19/27.28 27.19/27.28 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006023s 27.19/27.28 Time used: 0.005845 27.19/27.28 Solving with 1 template(s). 27.19/27.28 27.19/27.28 LOG: CALL solveNonLinearGetFirstSolution 27.19/27.28 27.19/27.28 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001384s 27.19/27.28 Time used: 4.00066 27.19/27.28 Solving with 2 template(s). 27.19/27.28 27.19/27.28 LOG: CALL solveNonLinearGetFirstSolution 27.19/27.28 27.19/27.28 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.028697s 27.19/27.28 Time used: 4.0006 27.19/27.28 Solving with 3 template(s). 27.19/27.28 27.19/27.28 LOG: CALL solveNonLinearGetFirstSolution 27.19/27.28 27.19/27.28 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004908s 27.19/27.28 Time used: 1.00053 27.19/27.28 Solving with 1 template(s). 27.19/27.28 27.19/27.28 LOG: CALL solveNonLinearGetFirstSolution 27.19/27.28 27.19/27.28 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012163s 27.19/27.28 Time used: 0.008523 27.19/27.28 Improving Solution with cost 1 ... 27.19/27.28 27.19/27.28 LOG: CALL solveNonLinearGetNextSolution 27.19/27.28 27.19/27.28 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014911s 27.19/27.28 Time used: 0.014905 27.19/27.28 27.19/27.28 LOG: SAT solveNonLinear - Elapsed time: 0.027074s 27.19/27.28 Cost: 1; Total time: 0.023428 27.19/27.28 Termination implied by a set of invariant(s): 27.19/27.28 Invariant at l1: 1 <= arg2 27.19/27.28 [ Invariant Graph ] 27.19/27.28 Strengthening and disabling transitions... 27.19/27.28 27.19/27.28 LOG: CALL solverLinear in Graph for feasibility 27.19/27.28 27.19/27.28 LOG: RETURN solveLinear in Graph for feasibility 27.19/27.28 Strengthening transition (result): 27.19/27.28 undef1, arg2 -> 1 + arg2, rest remain the same}> 27.19/27.28 [ Termination Graph ] 27.19/27.28 Strengthening and disabling transitions... 27.19/27.28 27.19/27.28 LOG: CALL solverLinear in Graph for feasibility 27.19/27.28 27.19/27.28 LOG: RETURN solveLinear in Graph for feasibility 27.19/27.28 Strengthening transition (result): 27.19/27.28 undef1, arg2 -> 1 + arg2, rest remain the same}> 27.19/27.28 Quasi-ranking function: 50000 - arg2 27.19/27.28 New Graphs: 27.19/27.28 Transitions: 27.19/27.28 undef1, arg2 -> 1 + arg2, rest remain the same}> 27.19/27.28 Variables: 27.19/27.28 arg1, arg2 27.19/27.28 Checking conditional termination of SCC {l1}... 27.19/27.28 27.19/27.28 LOG: CALL solveLinear 27.19/27.28 27.19/27.28 LOG: RETURN solveLinear - Elapsed time: 0.000703s 27.19/27.28 27.19/27.28 LOG: CALL solveLinear 27.19/27.28 27.19/27.28 LOG: RETURN solveLinear - Elapsed time: 0.002693s 27.19/27.28 Trying to remove transition: undef1, arg2 -> 1 + arg2, rest remain the same}> 27.19/27.28 Solving with 1 template(s). 27.19/27.28 27.19/27.28 LOG: CALL solveNonLinearGetFirstSolution 27.19/27.28 27.19/27.28 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007071s 27.19/27.28 Time used: 0.006895 27.19/27.28 Solving with 1 template(s). 27.19/27.28 27.19/27.28 LOG: CALL solveNonLinearGetFirstSolution 27.19/27.28 27.19/27.28 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001824s 27.19/27.28 Time used: 4.001 27.19/27.28 Solving with 2 template(s). 27.19/27.28 27.19/27.28 LOG: CALL solveNonLinearGetFirstSolution 27.19/27.28 27.19/27.28 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006224s 27.19/27.28 Time used: 4.00078 27.19/27.28 Solving with 3 template(s). 27.19/27.28 27.19/27.28 LOG: CALL solveNonLinearGetFirstSolution 27.19/27.28 27.19/27.28 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004537s 27.19/27.28 Time used: 1.00048 27.19/27.28 Solving with 1 template(s). 27.19/27.28 27.19/27.28 LOG: CALL solveNonLinearGetFirstSolution 27.19/27.28 27.19/27.28 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013776s 27.19/27.28 Time used: 0.009772 27.19/27.28 Improving Solution with cost 1 ... 27.19/27.28 27.19/27.28 LOG: CALL solveNonLinearGetNextSolution 27.19/27.28 27.19/27.28 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014552s 27.19/27.28 Time used: 0.014545 27.19/27.28 27.19/27.28 LOG: SAT solveNonLinear - Elapsed time: 0.028328s 27.19/27.28 Cost: 1; Total time: 0.024317 27.19/27.28 Termination implied by a set of invariant(s): 27.19/27.28 Invariant at l1: 0 <= arg2 27.19/27.28 [ Invariant Graph ] 27.19/27.28 Strengthening and disabling transitions... 27.19/27.28 27.19/27.28 LOG: CALL solverLinear in Graph for feasibility 27.19/27.28 27.19/27.28 LOG: RETURN solveLinear in Graph for feasibility 27.19/27.28 Strengthening transition (result): 27.19/27.28 undef1, arg2 -> 1 + arg2, rest remain the same}> 27.19/27.28 [ Termination Graph ] 27.19/27.28 Strengthening and disabling transitions... 27.19/27.28 27.19/27.28 LOG: CALL solverLinear in Graph for feasibility 27.19/27.28 27.19/27.28 LOG: RETURN solveLinear in Graph for feasibility 27.19/27.28 Strengthening transition (result): 27.19/27.28 undef1, arg2 -> 1 + arg2, rest remain the same}> 27.19/27.28 Quasi-ranking function: 50000 + arg1 - arg2 27.19/27.28 New Graphs: 27.19/27.28 Transitions: 27.19/27.28 undef1, arg2 -> 1 + arg2, rest remain the same}> 27.19/27.28 Variables: 27.19/27.28 arg1, arg2 27.19/27.28 Checking conditional termination of SCC {l1}... 27.19/27.28 27.19/27.28 LOG: CALL solveLinear 27.19/27.28 27.19/27.28 LOG: RETURN solveLinear - Elapsed time: 0.000832s 27.19/27.28 27.19/27.28 LOG: CALL solveLinear 27.19/27.28 27.19/27.28 LOG: RETURN solveLinear - Elapsed time: 0.003585s 27.19/27.28 Trying to remove transition: undef1, arg2 -> 1 + arg2, rest remain the same}> 27.19/27.28 Solving with 1 template(s). 27.19/27.28 27.19/27.28 LOG: CALL solveNonLinearGetFirstSolution 27.19/27.28 27.19/27.28 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008177s 27.19/27.28 Time used: 0.007988 27.19/27.28 Solving with 1 template(s). 27.19/27.28 27.19/27.28 LOG: CALL solveNonLinearGetFirstSolution 27.19/27.28 27.19/27.28 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004996s 27.19/27.28 Time used: 4.00175 27.19/27.28 Solving with 2 template(s). 27.19/27.28 27.19/27.28 LOG: CALL solveNonLinearGetFirstSolution 27.19/27.28 27.19/27.28 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005397s 27.19/27.28 Time used: 4.00095 27.19/27.28 Solving with 3 template(s). 27.19/27.28 27.19/27.28 LOG: CALL solveNonLinearGetFirstSolution 27.19/27.28 27.19/27.28 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004103s 27.19/27.28 Time used: 1.0005 27.19/27.28 Solving with 1 template(s). 27.19/27.28 27.19/27.28 LOG: CALL solveNonLinearGetFirstSolution 27.19/27.28 27.19/27.28 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013090s 27.19/27.28 Time used: 0.009399 27.19/27.28 Termination failed. Trying to show unreachability... 27.19/27.28 Proving unreachability of entry: 27.19/27.28 27.19/27.28 LOG: CALL check - Post:1 <= 0 - Process 1 27.19/27.28 * Exit transition: 27.19/27.28 * Postcondition : 1 <= 0 27.19/27.28 27.19/27.28 LOG: CALL solveLinear 27.19/27.28 27.19/27.28 LOG: RETURN solveLinear - Elapsed time: 0.001604s 27.19/27.28 > Postcondition is not implied! 27.19/27.28 27.19/27.28 LOG: RETURN check - Elapsed time: 0.001727s 27.19/27.28 Cannot prove unreachability 27.19/27.28 27.19/27.28 Proving non-termination of subgraph 1 27.19/27.28 Transitions: 27.19/27.28 undef1, arg2 -> 1 + arg2, rest remain the same}> 27.19/27.28 Variables: 27.19/27.28 arg1, arg2 27.19/27.28 27.19/27.28 Checking that every undef value has an assignment... 27.19/27.28 27.19/27.28 LOG: CALL solveLinear 27.19/27.28 27.19/27.28 LOG: RETURN solveLinear - Elapsed time: 0.001045s 27.19/27.28 Checking conditional non-termination of SCC {l1}... 27.19/27.28 EXIT TRANSITIONS: 27.19/27.28 27.19/27.28 27.19/27.28 Solving with 1 template(s). 27.19/27.28 27.19/27.28 LOG: CALL solveNonLinearGetFirstSolution 27.19/27.28 27.19/27.28 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018077s 27.19/27.28 Time used: 0.017966 27.19/27.28 27.19/27.28 LOG: SAT solveNonLinear - Elapsed time: 0.018077s 27.19/27.28 Cost: 0; Total time: 0.017966 27.19/27.28 Minimizing number of undef constraints... 27.19/27.28 27.19/27.28 LOG: CALL solveNonLinear 27.19/27.28 27.19/27.28 LOG: RETURN solveNonLinear - Elapsed time: 0.003870s 27.19/27.28 Number of undef constraints reduced! 27.19/27.28 27.19/27.28 Non-termination implied by a set of quasi-invariant(s): 27.19/27.28 Quasi-invariant at l1: 1 <= arg1 27.19/27.28 27.19/27.28 Strengthening and disabling EXIT transitions... 27.19/27.28 Closed exits from l1: 1 27.19/27.28 27.19/27.28 Strengthening and disabling transitions... 27.19/27.28 27.19/27.28 LOG: CALL solverLinear in Graph for feasibility 27.19/27.28 27.19/27.28 LOG: RETURN solveLinear in Graph for feasibility 27.19/27.28 Strengthening transition (result): 27.19/27.28 undef1, arg2 -> 1 + arg2, rest remain the same}> 27.19/27.28 27.19/27.28 Calling reachability with... 27.19/27.28 Transition: 27.19/27.28 Conditions: 1 <= arg1, 27.19/27.28 OPEN EXITS: 27.19/27.28 27.19/27.28 27.19/27.28 --- Reachability graph --- 27.19/27.28 > Graph without transitions. 27.19/27.28 27.19/27.28 Calling reachability with... 27.19/27.28 Transition: 27.19/27.28 Conditions: 1 <= arg1, 27.19/27.28 OPEN EXITS: 27.19/27.28 27.19/27.28 27.19/27.28 > Conditions are reachable! 27.19/27.28 27.19/27.28 Program does NOT terminate 27.19/27.28 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 27.19/27.28 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 27.19/27.28 EOF