5.32/5.36 NO 5.32/5.36 5.32/5.37 Solver Timeout: 4 5.32/5.37 Global Timeout: 300 5.32/5.37 No parsing errors! 5.32/5.37 Init Location: 0 5.32/5.37 Transitions: 5.32/5.37 5.32/5.37 undef9, y_6^0 -> undef10}> 5.32/5.37 undef11, lt_10^0 -> undef15, lt_9^0 -> undef17}> 5.32/5.37 undef27, lt_9^0 -> undef29, tmp_7^0 -> undef30}> 5.32/5.37 5.32/5.37 undef49, lt_9^0 -> undef51, tmp_7^0 -> undef52}> 5.32/5.37 undef58}> 5.32/5.37 undef72}> 5.32/5.37 5.32/5.37 5.32/5.37 5.32/5.37 Fresh variables: 5.32/5.37 undef9, undef10, undef11, undef15, undef17, undef21, undef22, undef27, undef29, undef30, undef33, undef34, undef49, undef51, undef52, undef55, undef56, undef58, undef72, undef77, 5.32/5.37 5.32/5.37 Undef variables: 5.32/5.37 undef9, undef10, undef11, undef15, undef17, undef21, undef22, undef27, undef29, undef30, undef33, undef34, undef49, undef51, undef52, undef55, undef56, undef58, undef72, undef77, 5.32/5.37 5.32/5.37 Abstraction variables: 5.32/5.37 5.32/5.37 Exit nodes: 5.32/5.37 5.32/5.37 Accepting locations: 5.32/5.37 5.32/5.37 Asserts: 5.32/5.37 5.32/5.37 Preprocessed LLVMGraph 5.32/5.37 Init Location: 0 5.32/5.37 Transitions: 5.32/5.37 5.32/5.37 5.32/5.37 5.32/5.37 undef58}> 5.32/5.37 5.32/5.37 Fresh variables: 5.32/5.37 undef9, undef10, undef11, undef15, undef17, undef21, undef22, undef27, undef29, undef30, undef33, undef34, undef49, undef51, undef52, undef55, undef56, undef58, undef72, undef77, 5.32/5.37 5.32/5.37 Undef variables: 5.32/5.37 undef9, undef10, undef11, undef15, undef17, undef21, undef22, undef27, undef29, undef30, undef33, undef34, undef49, undef51, undef52, undef55, undef56, undef58, undef72, undef77, 5.32/5.37 5.32/5.37 Abstraction variables: 5.32/5.37 5.32/5.37 Exit nodes: 5.32/5.37 5.32/5.37 Accepting locations: 5.32/5.37 5.32/5.37 Asserts: 5.32/5.37 5.32/5.37 ************************************************************* 5.32/5.37 ******************************************************************************************* 5.32/5.37 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.32/5.37 ******************************************************************************************* 5.32/5.37 5.32/5.37 Init Location: 0 5.32/5.37 Graph 0: 5.32/5.37 Transitions: 5.32/5.37 Variables: 5.32/5.37 5.32/5.37 Graph 1: 5.32/5.37 Transitions: 5.32/5.37 5.32/5.37 undef58, rest remain the same}> 5.32/5.37 Variables: 5.32/5.37 cnt_16^0, cnt_21^0, __disjvr_0^0 5.32/5.37 5.32/5.37 Graph 2: 5.32/5.37 Transitions: 5.32/5.37 Variables: 5.32/5.37 5.32/5.37 Precedence: 5.32/5.37 Graph 0 5.32/5.37 5.32/5.37 Graph 1 5.32/5.37 5.32/5.37 5.32/5.37 Graph 2 5.32/5.37 5.32/5.37 5.32/5.37 Map Locations to Subgraph: 5.32/5.37 ( 0 , 0 ) 5.32/5.37 ( 2 , 1 ) 5.32/5.37 ( 3 , 2 ) 5.32/5.37 5.32/5.37 ******************************************************************************************* 5.32/5.37 ******************************** CHECKING ASSERTIONS ******************************** 5.32/5.37 ******************************************************************************************* 5.32/5.37 5.32/5.37 Proving termination of subgraph 0 5.32/5.37 Proving termination of subgraph 1 5.32/5.37 Checking unfeasibility... 5.32/5.37 Time used: 0.004364 5.32/5.37 5.32/5.37 Checking conditional termination of SCC {l2}... 5.32/5.37 5.32/5.37 LOG: CALL solveLinear 5.32/5.37 5.32/5.37 LOG: RETURN solveLinear - Elapsed time: 0.000892s 5.32/5.37 5.32/5.37 LOG: CALL solveLinear 5.32/5.37 5.32/5.37 LOG: RETURN solveLinear - Elapsed time: 0.002994s 5.32/5.37 Trying to remove transition: undef58, rest remain the same}> 5.32/5.37 Solving with 1 template(s). 5.32/5.37 5.32/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.32/5.37 5.32/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010357s 5.32/5.37 Time used: 0.010098 5.32/5.37 Solving with 1 template(s). 5.32/5.37 5.32/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.32/5.37 5.32/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013634s 5.32/5.37 Time used: 0.012899 5.32/5.37 Improving Solution with cost 1 ... 5.32/5.37 5.32/5.37 LOG: CALL solveNonLinearGetNextSolution 5.32/5.37 5.32/5.37 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.026824s 5.32/5.37 Time used: 0.026815 5.32/5.37 5.32/5.37 LOG: SAT solveNonLinear - Elapsed time: 0.040458s 5.32/5.37 Cost: 1; Total time: 0.039714 5.32/5.37 Failed at location 2: cnt_21^0 <= cnt_16^0 5.32/5.37 Before Improving: 5.32/5.37 Quasi-invariant at l2: cnt_21^0 <= cnt_16^0 5.32/5.37 Optimizing invariants... 5.32/5.37 5.32/5.37 LOG: CALL solveLinear 5.32/5.37 5.32/5.37 LOG: RETURN solveLinear - Elapsed time: 0.004962s 5.32/5.37 Remaining time after improvement: 0.997941 5.32/5.37 Termination implied by a set of quasi-invariant(s): 5.32/5.37 Quasi-invariant at l2: cnt_21^0 <= cnt_16^0 5.32/5.37 [ Invariant Graph ] 5.32/5.37 Strengthening and disabling transitions... 5.32/5.37 5.32/5.37 LOG: CALL solverLinear in Graph for feasibility 5.32/5.37 5.32/5.37 LOG: RETURN solveLinear in Graph for feasibility 5.32/5.37 It's unfeasible. Removing transition: 5.32/5.37 5.32/5.37 5.32/5.37 LOG: CALL solverLinear in Graph for feasibility 5.32/5.37 5.32/5.37 LOG: RETURN solveLinear in Graph for feasibility 5.32/5.37 It's unfeasible. Removing transition: 5.32/5.37 undef58, rest remain the same}> 5.32/5.37 [ Termination Graph ] 5.32/5.37 Strengthening and disabling transitions... 5.32/5.37 > It's unfeasible. Removing transition: 5.32/5.37 undef58, rest remain the same}> 5.32/5.37 5.32/5.37 LOG: CALL solverLinear in Graph for feasibility 5.32/5.37 5.32/5.37 LOG: RETURN solveLinear in Graph for feasibility 5.32/5.37 It's unfeasible. Removing transition: 5.32/5.37 5.32/5.37 New Graphs: 5.32/5.37 Calling Safety with literal cnt_21^0 <= cnt_16^0 and entry 5.32/5.37 5.32/5.37 LOG: CALL check - Post:cnt_21^0 <= cnt_16^0 - Process 1 5.32/5.37 * Exit transition: 5.32/5.37 * Postcondition : cnt_21^0 <= cnt_16^0 5.32/5.37 5.32/5.37 LOG: CALL solveLinear 5.32/5.37 5.32/5.37 LOG: RETURN solveLinear - Elapsed time: 0.000490s 5.32/5.37 > Postcondition is not implied! 5.32/5.37 5.32/5.37 LOG: RETURN check - Elapsed time: 0.000563s 5.32/5.37 INVARIANTS: 5.32/5.37 2: 5.32/5.37 Quasi-INVARIANTS to narrow Graph: 5.32/5.37 2: cnt_21^0 <= cnt_16^0 , 5.32/5.37 Narrowing transition: 5.32/5.37 5.32/5.37 5.32/5.37 LOG: Narrow transition size 1 5.32/5.37 Narrowing transition: 5.32/5.37 undef58, rest remain the same}> 5.32/5.37 5.32/5.37 LOG: Narrow transition size 1 5.32/5.37 invGraph after Narrowing: 5.32/5.37 Transitions: 5.32/5.37 5.32/5.37 undef58, rest remain the same}> 5.32/5.37 Variables: 5.32/5.37 cnt_16^0, cnt_21^0, __disjvr_0^0 5.32/5.37 Checking conditional termination of SCC {l2}... 5.32/5.37 5.32/5.37 LOG: CALL solveLinear 5.32/5.37 5.32/5.37 LOG: RETURN solveLinear - Elapsed time: 0.000826s 5.32/5.37 5.32/5.37 LOG: CALL solveLinear 5.32/5.37 5.32/5.37 LOG: RETURN solveLinear - Elapsed time: 0.003380s 5.32/5.37 Trying to remove transition: undef58, rest remain the same}> 5.32/5.37 Solving with 1 template(s). 5.32/5.37 5.32/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.32/5.37 5.32/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008532s 5.32/5.37 Time used: 0.008223 5.32/5.37 Solving with 1 template(s). 5.32/5.37 5.32/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.32/5.37 5.32/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016271s 5.32/5.37 Time used: 0.015616 5.32/5.37 Solving with 2 template(s). 5.32/5.37 5.32/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.32/5.37 5.32/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002047s 5.32/5.37 Time used: 4.00058 5.32/5.37 Solving with 3 template(s). 5.32/5.37 5.32/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.32/5.37 5.32/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005286s 5.32/5.37 Time used: 1.0003 5.32/5.37 Solving with 1 template(s). 5.32/5.37 5.32/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.32/5.37 5.32/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026679s 5.32/5.37 Time used: 0.01116 5.32/5.37 5.32/5.37 Proving non-termination of subgraph 1 5.32/5.37 Transitions: 5.32/5.37 5.32/5.37 undef58, rest remain the same}> 5.32/5.37 Variables: 5.32/5.37 cnt_16^0, cnt_21^0, __disjvr_0^0 5.32/5.37 5.32/5.37 Checking that every undef value has an assignment... 5.32/5.37 5.32/5.37 LOG: CALL solveLinear 5.32/5.37 5.32/5.37 LOG: RETURN solveLinear - Elapsed time: 0.003561s 5.32/5.37 Checking conditional non-termination of SCC {l2}... 5.32/5.37 EXIT TRANSITIONS: 5.32/5.37 5.32/5.37 5.32/5.37 Solving with 1 template(s). 5.32/5.37 5.32/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.32/5.37 5.32/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.082492s 5.32/5.37 Time used: 0.08176 5.32/5.37 Improving Solution with cost 1 ... 5.32/5.37 5.32/5.37 LOG: CALL solveNonLinearGetNextSolution 5.32/5.37 5.32/5.37 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.066875s 5.32/5.37 Time used: 0.066862 5.32/5.37 5.32/5.37 LOG: SAT solveNonLinear - Elapsed time: 0.149366s 5.32/5.37 Cost: 1; Total time: 0.148622 5.32/5.37 Failed at location 2: 1 + cnt_16^0 <= cnt_21^0 5.32/5.37 Before Improving: 5.32/5.37 Quasi-invariant at l2: 1 + cnt_16^0 <= cnt_21^0 5.32/5.37 Optimizing invariants... 5.32/5.37 5.32/5.37 LOG: CALL solveLinear 5.32/5.37 5.32/5.37 LOG: RETURN solveLinear - Elapsed time: 0.008017s 5.32/5.37 Remaining time after improvement: 0.995845 5.32/5.37 Minimizing number of undef constraints... 5.32/5.37 5.32/5.37 LOG: CALL solveNonLinear 5.32/5.37 5.32/5.37 LOG: RETURN solveNonLinear - Elapsed time: 0.008252s 5.32/5.37 Number of undef constraints reduced! 5.32/5.37 5.32/5.37 Non-termination implied by a set of quasi-invariant(s): 5.32/5.37 Quasi-invariant at l2: 1 + cnt_16^0 <= cnt_21^0 5.32/5.37 5.32/5.37 Strengthening and disabling EXIT transitions... 5.32/5.37 Closed exits from l2: 1 5.32/5.37 5.32/5.37 Strengthening and disabling transitions... 5.32/5.37 5.32/5.37 LOG: CALL solverLinear in Graph for feasibility 5.32/5.37 5.32/5.37 LOG: RETURN solveLinear in Graph for feasibility 5.32/5.37 Strengthening transition (result): 5.32/5.37 5.32/5.37 5.32/5.37 LOG: CALL solverLinear in Graph for feasibility 5.32/5.37 5.32/5.37 LOG: RETURN solveLinear in Graph for feasibility 5.32/5.37 Strengthening transition (result): 5.32/5.37 undef58, rest remain the same}> 5.32/5.37 5.32/5.37 Calling reachability with... 5.32/5.37 Transition: 5.32/5.37 Conditions: 1 + cnt_16^0 <= cnt_21^0, 5.32/5.37 OPEN EXITS: 5.32/5.37 (condsUp: 1 + cnt_16^0 <= cnt_21^0) 5.32/5.37 5.32/5.37 --- Reachability graph --- 5.32/5.37 > Graph without transitions. 5.32/5.37 5.32/5.37 Calling reachability with... 5.32/5.37 Transition: 5.32/5.37 Conditions: 1 + cnt_16^0 <= cnt_21^0, 5.32/5.37 OPEN EXITS: 5.32/5.37 5.32/5.37 5.32/5.37 > Conditions are reachable! 5.32/5.37 5.32/5.37 Program does NOT terminate 5.32/5.37 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 5.32/5.37 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 5.32/5.37 EOF