5.32/5.33 NO 5.32/5.33 5.32/5.33 Solver Timeout: 4 5.32/5.33 Global Timeout: 300 5.32/5.33 No parsing errors! 5.32/5.33 Init Location: 0 5.32/5.33 Transitions: 5.32/5.33 5.32/5.33 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}> 5.32/5.33 0), par{arg2 -> undef4}> 5.32/5.33 0) /\ ((arg1 - (2 * undef8)) = 0) /\ ((arg1 - (2 * undef8)) < 2) /\ ((arg1 - (2 * undef8)) >= 0), par{arg1 -> (arg1 - 1), arg2 -> undef7}> 5.32/5.33 0) /\ ((arg1 - (2 * undef11)) = 1), par{arg2 -> undef10}> 5.32/5.33 0) /\ ((arg1 - (2 * undef14)) < 2) /\ ((arg1 - (2 * undef14)) >= 0), par{arg1 -> (arg1 + 3), arg2 -> undef13}> 5.32/5.33 undef15, arg2 -> undef16}> 5.32/5.33 5.32/5.33 Fresh variables: 5.32/5.33 undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, undef16, 5.32/5.33 5.32/5.33 Undef variables: 5.32/5.33 undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, undef16, 5.32/5.33 5.32/5.33 Abstraction variables: 5.32/5.33 5.32/5.33 Exit nodes: 5.32/5.33 5.32/5.33 Accepting locations: 5.32/5.33 5.32/5.33 Asserts: 5.32/5.33 5.32/5.33 Preprocessed LLVMGraph 5.32/5.33 Init Location: 0 5.32/5.33 Transitions: 5.32/5.33 0) /\ (undef16 > ~(1))> 5.32/5.33 0) /\ (arg1 > 0) /\ ((arg1 - (2 * undef8)) = 0) /\ ((arg1 - (2 * undef8)) < 2) /\ ((arg1 - (2 * undef8)) >= 0), par{arg1 -> (arg1 - 1)}> 5.32/5.33 0) /\ ((arg1 - (2 * undef11)) = 1) /\ ((arg1 - (2 * undef14)) = 1) /\ (arg1 > 0) /\ ((arg1 - (2 * undef14)) < 2) /\ ((arg1 - (2 * undef14)) >= 0), par{arg1 -> (arg1 + 3)}> 5.32/5.33 5.32/5.33 Fresh variables: 5.32/5.33 undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, undef16, 5.32/5.33 5.32/5.33 Undef variables: 5.32/5.33 undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, undef16, 5.32/5.33 5.32/5.33 Abstraction variables: 5.32/5.33 5.32/5.33 Exit nodes: 5.32/5.33 5.32/5.33 Accepting locations: 5.32/5.33 5.32/5.33 Asserts: 5.32/5.33 5.32/5.33 ************************************************************* 5.32/5.33 ******************************************************************************************* 5.32/5.33 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.32/5.33 ******************************************************************************************* 5.32/5.33 5.32/5.33 Init Location: 0 5.32/5.33 Graph 0: 5.32/5.33 Transitions: 5.32/5.33 Variables: 5.32/5.33 5.32/5.33 Graph 1: 5.32/5.33 Transitions: 5.32/5.33 -1 + arg1, rest remain the same}> 5.32/5.33 3 + arg1, rest remain the same}> 5.32/5.33 Variables: 5.32/5.33 arg1 5.32/5.33 5.32/5.33 Precedence: 5.32/5.33 Graph 0 5.32/5.33 5.32/5.33 Graph 1 5.32/5.33 5.32/5.33 5.32/5.33 Map Locations to Subgraph: 5.32/5.33 ( 0 , 0 ) 5.32/5.33 ( 2 , 1 ) 5.32/5.33 5.32/5.33 ******************************************************************************************* 5.32/5.33 ******************************** CHECKING ASSERTIONS ******************************** 5.32/5.33 ******************************************************************************************* 5.32/5.33 5.32/5.33 Proving termination of subgraph 0 5.32/5.33 Proving termination of subgraph 1 5.32/5.33 Checking unfeasibility... 5.32/5.33 Time used: 0.003887 5.32/5.33 5.32/5.33 Checking conditional termination of SCC {l2}... 5.32/5.33 5.32/5.33 LOG: CALL solveLinear 5.32/5.33 5.32/5.33 LOG: RETURN solveLinear - Elapsed time: 0.001000s 5.32/5.33 5.32/5.33 LOG: CALL solveLinear 5.32/5.33 5.32/5.33 LOG: RETURN solveLinear - Elapsed time: 0.005249s 5.32/5.33 Trying to remove transition: 3 + arg1, rest remain the same}> 5.32/5.33 Solving with 1 template(s). 5.32/5.33 5.32/5.33 LOG: CALL solveNonLinearGetFirstSolution 5.32/5.33 5.32/5.33 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007731s 5.32/5.33 Time used: 0.007562 5.32/5.33 Trying to remove transition: -1 + arg1, rest remain the same}> 5.32/5.33 Solving with 1 template(s). 5.32/5.33 5.32/5.33 LOG: CALL solveNonLinearGetFirstSolution 5.32/5.33 5.32/5.33 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012828s 5.32/5.33 Time used: 0.012415 5.32/5.33 Solving with 1 template(s). 5.32/5.33 5.32/5.33 LOG: CALL solveNonLinearGetFirstSolution 5.32/5.33 5.32/5.33 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016369s 5.32/5.33 Time used: 0.015804 5.32/5.33 Improving Solution with cost 1 ... 5.32/5.33 5.32/5.33 LOG: CALL solveNonLinearGetNextSolution 5.32/5.33 5.32/5.33 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.043227s 5.32/5.33 Time used: 0.043219 5.32/5.33 5.32/5.33 LOG: SAT solveNonLinear - Elapsed time: 0.059596s 5.32/5.33 Cost: 1; Total time: 0.059023 5.32/5.33 Failed at location 2: arg1 <= 0 5.32/5.33 Before Improving: 5.32/5.33 Quasi-invariant at l2: arg1 <= 0 5.32/5.33 Optimizing invariants... 5.32/5.33 5.32/5.33 LOG: CALL solveLinear 5.32/5.33 5.32/5.33 LOG: RETURN solveLinear - Elapsed time: 0.005225s 5.32/5.33 Remaining time after improvement: 0.998108 5.32/5.33 Termination implied by a set of quasi-invariant(s): 5.32/5.33 Quasi-invariant at l2: arg1 <= 0 5.32/5.33 [ Invariant Graph ] 5.32/5.33 Strengthening and disabling transitions... 5.32/5.33 5.32/5.33 LOG: CALL solverLinear in Graph for feasibility 5.32/5.33 5.32/5.33 LOG: RETURN solveLinear in Graph for feasibility 5.32/5.33 It's unfeasible. Removing transition: 5.32/5.33 -1 + arg1, rest remain the same}> 5.32/5.33 5.32/5.33 LOG: CALL solverLinear in Graph for feasibility 5.32/5.33 5.32/5.33 LOG: RETURN solveLinear in Graph for feasibility 5.32/5.33 It's unfeasible. Removing transition: 5.32/5.33 3 + arg1, rest remain the same}> 5.32/5.33 [ Termination Graph ] 5.32/5.33 Strengthening and disabling transitions... 5.32/5.33 5.32/5.33 LOG: CALL solverLinear in Graph for feasibility 5.32/5.33 5.32/5.33 LOG: RETURN solveLinear in Graph for feasibility 5.32/5.33 It's unfeasible. Removing transition: 5.32/5.33 -1 + arg1, rest remain the same}> 5.32/5.33 5.32/5.33 LOG: CALL solverLinear in Graph for feasibility 5.32/5.33 5.32/5.33 LOG: RETURN solveLinear in Graph for feasibility 5.32/5.33 It's unfeasible. Removing transition: 5.32/5.33 3 + arg1, rest remain the same}> 5.32/5.33 New Graphs: 5.32/5.33 Calling Safety with literal arg1 <= 0 and entry 5.32/5.33 5.32/5.33 LOG: CALL check - Post:arg1 <= 0 - Process 1 5.32/5.33 * Exit transition: 5.32/5.33 * Postcondition : arg1 <= 0 5.32/5.33 5.32/5.33 LOG: CALL solveLinear 5.32/5.33 5.32/5.33 LOG: RETURN solveLinear - Elapsed time: 0.000572s 5.32/5.33 > Postcondition is not implied! 5.32/5.33 5.32/5.33 LOG: RETURN check - Elapsed time: 0.000668s 5.32/5.33 INVARIANTS: 5.32/5.33 2: 5.32/5.33 Quasi-INVARIANTS to narrow Graph: 5.32/5.33 2: arg1 <= 0 , 5.32/5.33 Narrowing transition: 5.32/5.33 -1 + arg1, rest remain the same}> 5.32/5.33 5.32/5.33 LOG: Narrow transition size 1 5.32/5.33 Narrowing transition: 5.32/5.33 3 + arg1, rest remain the same}> 5.32/5.33 5.32/5.33 LOG: Narrow transition size 1 5.32/5.33 invGraph after Narrowing: 5.32/5.33 Transitions: 5.32/5.33 -1 + arg1, rest remain the same}> 5.32/5.33 3 + arg1, rest remain the same}> 5.32/5.33 Variables: 5.32/5.33 arg1 5.32/5.33 Checking conditional termination of SCC {l2}... 5.32/5.33 5.32/5.33 LOG: CALL solveLinear 5.32/5.33 5.32/5.33 LOG: RETURN solveLinear - Elapsed time: 0.000948s 5.32/5.33 5.32/5.33 LOG: CALL solveLinear 5.32/5.33 5.32/5.33 LOG: RETURN solveLinear - Elapsed time: 0.005185s 5.32/5.33 Trying to remove transition: 3 + arg1, rest remain the same}> 5.32/5.33 Solving with 1 template(s). 5.32/5.33 5.32/5.33 LOG: CALL solveNonLinearGetFirstSolution 5.32/5.33 5.32/5.33 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007024s 5.32/5.33 Time used: 0.006848 5.32/5.33 Trying to remove transition: -1 + arg1, rest remain the same}> 5.32/5.33 Solving with 1 template(s). 5.32/5.33 5.32/5.33 LOG: CALL solveNonLinearGetFirstSolution 5.32/5.33 5.32/5.33 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012844s 5.32/5.33 Time used: 0.012392 5.32/5.33 Solving with 1 template(s). 5.32/5.33 5.32/5.33 LOG: CALL solveNonLinearGetFirstSolution 5.32/5.33 5.32/5.33 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.104585s 5.32/5.33 Time used: 0.104113 5.32/5.33 Solving with 2 template(s). 5.32/5.33 5.32/5.33 LOG: CALL solveNonLinearGetFirstSolution 5.32/5.33 5.32/5.33 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002047s 5.32/5.33 Time used: 4.00047 5.32/5.33 Solving with 3 template(s). 5.32/5.33 5.32/5.33 LOG: CALL solveNonLinearGetFirstSolution 5.32/5.33 5.32/5.33 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006879s 5.32/5.33 Time used: 1.00064 5.32/5.33 Solving with 1 template(s). 5.32/5.33 5.32/5.33 LOG: CALL solveNonLinearGetFirstSolution 5.32/5.33 5.32/5.33 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.028823s 5.32/5.33 Time used: 0.021309 5.32/5.33 5.32/5.33 Proving non-termination of subgraph 1 5.32/5.33 Transitions: 5.32/5.33 -1 + arg1, rest remain the same}> 5.32/5.33 3 + arg1, rest remain the same}> 5.32/5.33 Variables: 5.32/5.33 arg1 5.32/5.33 5.32/5.33 Checking that every undef value has an assignment... 5.32/5.33 5.32/5.33 LOG: CALL solveLinear 5.32/5.33 5.32/5.33 LOG: RETURN solveLinear - Elapsed time: 0.001124s 5.32/5.33 Checking conditional non-termination of SCC {l2}... 5.32/5.33 > No assignment for some undef value. 5.32/5.33 > Checking if the negation of the conditions of every pending exit is quasi-invariant... YES 5.32/5.33 Calling reachability with... 5.32/5.33 Transition: 5.32/5.33 Conditions: 1 <= arg1, 5.32/5.33 OPEN EXITS: 5.32/5.33 5.32/5.33 5.32/5.33 --- Reachability graph --- 5.32/5.33 > Graph without transitions. 5.32/5.33 5.32/5.33 Calling reachability with... 5.32/5.33 Transition: 5.32/5.33 Conditions: 1 <= arg1, 5.32/5.33 OPEN EXITS: 5.32/5.33 5.32/5.33 5.32/5.33 > Conditions are reachable! 5.32/5.33 5.32/5.33 Program does NOT terminate 5.32/5.33 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 5.32/5.33 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 5.32/5.33 EOF