47.47/47.49 NO 47.47/47.49 47.47/47.50 Solver Timeout: 4 47.47/47.50 Global Timeout: 300 47.47/47.50 No parsing errors! 47.47/47.50 Init Location: 0 47.47/47.50 Transitions: 47.47/47.50 47.47/47.50 0) /\ (arg2 > ~(1)), par{arg1 -> 0, arg2 -> 0, arg3 -> arg2}> 47.47/47.50 0) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> (arg3 - 1)}> 47.47/47.50 0, arg2 -> 0, arg3 -> 9}> 47.47/47.50 0) /\ (arg3 < 10) /\ (arg1 < 2) /\ (1 = arg2), par{arg1 -> 1, arg2 -> 1, arg3 -> (arg3 + 1)}> 47.47/47.50 1, arg2 -> 1, arg3 -> 1}> 47.47/47.50 0) /\ (0 = arg2), par{arg2 -> 0, arg3 -> (arg3 - 1)}> 47.47/47.50 0, arg3 -> 9}> 47.47/47.50 0) /\ (arg3 < 10) /\ (arg1 < 2) /\ (1 = arg2), par{arg2 -> 1, arg3 -> (arg3 + 1)}> 47.47/47.50 1, arg3 -> 1}> 47.47/47.50 undef28, arg2 -> undef29, arg3 -> undef30}> 47.47/47.50 47.47/47.50 Fresh variables: 47.47/47.50 undef28, undef29, undef30, 47.47/47.50 47.47/47.50 Undef variables: 47.47/47.50 undef28, undef29, undef30, 47.47/47.50 47.47/47.50 Abstraction variables: 47.47/47.50 47.47/47.50 Exit nodes: 47.47/47.50 47.47/47.50 Accepting locations: 47.47/47.50 47.47/47.50 Asserts: 47.47/47.50 47.47/47.50 Preprocessed LLVMGraph 47.47/47.50 Init Location: 0 47.47/47.50 Transitions: 47.47/47.50 0) /\ (undef29 > ~(1))> 47.47/47.50 0) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> (arg3 - 1)}> 47.47/47.50 0, arg2 -> 0, arg3 -> 9}> 47.47/47.50 0) /\ (arg3 < 10) /\ (arg1 < 2) /\ (1 = arg2), par{arg1 -> 1, arg2 -> 1, arg3 -> (arg3 + 1)}> 47.47/47.50 1, arg2 -> 1, arg3 -> 1}> 47.47/47.50 0) /\ (0 = arg2), par{arg2 -> 0, arg3 -> (arg3 - 1)}> 47.47/47.50 0, arg3 -> 9}> 47.47/47.50 0) /\ (arg3 < 10) /\ (arg1 < 2) /\ (1 = arg2), par{arg2 -> 1, arg3 -> (arg3 + 1)}> 47.47/47.50 1, arg3 -> 1}> 47.47/47.50 47.47/47.50 Fresh variables: 47.47/47.50 undef28, undef29, undef30, 47.47/47.50 47.47/47.50 Undef variables: 47.47/47.50 undef28, undef29, undef30, 47.47/47.50 47.47/47.50 Abstraction variables: 47.47/47.50 47.47/47.50 Exit nodes: 47.47/47.50 47.47/47.50 Accepting locations: 47.47/47.50 47.47/47.50 Asserts: 47.47/47.50 47.47/47.50 ************************************************************* 47.47/47.50 ******************************************************************************************* 47.47/47.50 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 47.47/47.50 ******************************************************************************************* 47.47/47.50 47.47/47.50 Init Location: 0 47.47/47.50 Graph 0: 47.47/47.50 Transitions: 47.47/47.50 Variables: 47.47/47.50 47.47/47.50 Graph 1: 47.47/47.50 Transitions: 47.47/47.50 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> 47.47/47.50 0, arg2 -> 0, arg3 -> 9, rest remain the same}> 47.47/47.50 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}> 47.47/47.50 1, arg2 -> 1, arg3 -> 1, rest remain the same}> 47.47/47.50 0, arg3 -> -1 + arg3, rest remain the same}> 47.47/47.50 0, arg3 -> 9, rest remain the same}> 47.47/47.50 1, arg3 -> 1 + arg3, rest remain the same}> 47.47/47.50 1, arg3 -> 1, rest remain the same}> 47.47/47.50 Variables: 47.47/47.50 arg1, arg2, arg3 47.47/47.50 47.47/47.50 Precedence: 47.47/47.50 Graph 0 47.47/47.50 47.47/47.50 Graph 1 47.47/47.50 47.47/47.50 47.47/47.50 Map Locations to Subgraph: 47.47/47.50 ( 0 , 0 ) 47.47/47.50 ( 2 , 1 ) 47.47/47.50 47.47/47.50 ******************************************************************************************* 47.47/47.50 ******************************** CHECKING ASSERTIONS ******************************** 47.47/47.50 ******************************************************************************************* 47.47/47.50 47.47/47.50 Proving termination of subgraph 0 47.47/47.50 Proving termination of subgraph 1 47.47/47.50 Checking unfeasibility... 47.47/47.50 Time used: 0.662884 47.47/47.50 47.47/47.50 Checking conditional termination of SCC {l2}... 47.47/47.50 47.47/47.50 LOG: CALL solveLinear 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear - Elapsed time: 0.009115s 47.47/47.50 47.47/47.50 LOG: CALL solveLinear 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear - Elapsed time: 0.195031s 47.47/47.50 Trying to remove transition: 1, arg3 -> 1, rest remain the same}> 47.47/47.50 Solving with 1 template(s). 47.47/47.50 47.47/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.47/47.50 47.47/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.656140s 47.47/47.50 Time used: 1.65396 47.47/47.50 Trying to remove transition: 1, arg3 -> 1 + arg3, rest remain the same}> 47.47/47.50 Solving with 1 template(s). 47.47/47.50 47.47/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.47/47.50 47.47/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.022975s 47.47/47.50 Time used: 4.00178 47.47/47.50 Trying to remove transition: 0, arg3 -> 9, rest remain the same}> 47.47/47.50 Solving with 1 template(s). 47.47/47.50 47.47/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.47/47.50 47.47/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.043489s 47.47/47.50 Time used: 4.00306 47.47/47.50 Trying to remove transition: 0, arg3 -> -1 + arg3, rest remain the same}> 47.47/47.50 Solving with 1 template(s). 47.47/47.50 47.47/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.47/47.50 47.47/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.008885s 47.47/47.50 Time used: 4.00218 47.47/47.50 Trying to remove transition: 1, arg2 -> 1, arg3 -> 1, rest remain the same}> 47.47/47.50 Solving with 1 template(s). 47.47/47.50 47.47/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.47/47.50 47.47/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.946478s 47.47/47.50 Time used: 2.94033 47.47/47.50 Trying to remove transition: 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}> 47.47/47.50 Solving with 1 template(s). 47.47/47.50 47.47/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.47/47.50 47.47/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.026800s 47.47/47.50 Time used: 4.003 47.47/47.50 Trying to remove transition: 0, arg2 -> 0, arg3 -> 9, rest remain the same}> 47.47/47.50 Solving with 1 template(s). 47.47/47.50 47.47/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.47/47.50 47.47/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.048675s 47.47/47.50 Time used: 4.00256 47.47/47.50 Trying to remove transition: 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> 47.47/47.50 Solving with 1 template(s). 47.47/47.50 47.47/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.47/47.50 47.47/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.010379s 47.47/47.50 Time used: 4.00278 47.47/47.50 Solving with 1 template(s). 47.47/47.50 47.47/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.47/47.50 47.47/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.009470s 47.47/47.50 Time used: 4.00155 47.47/47.50 Solving with 2 template(s). 47.47/47.50 47.47/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.47/47.50 47.47/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.030929s 47.47/47.50 Time used: 4.00264 47.47/47.50 Solving with 3 template(s). 47.47/47.50 47.47/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.47/47.50 47.47/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006639s 47.47/47.50 Time used: 1.00016 47.47/47.50 Solving with 1 template(s). 47.47/47.50 47.47/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.47/47.50 47.47/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.110151s 47.47/47.50 Time used: 4.097 47.47/47.50 Termination failed. Trying to show unreachability... 47.47/47.50 Proving unreachability of entry: 47.47/47.50 47.47/47.50 LOG: CALL check - Post:1 <= 0 - Process 1 47.47/47.50 * Exit transition: 47.47/47.50 * Postcondition : 1 <= 0 47.47/47.50 47.47/47.50 LOG: CALL solveLinear 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear - Elapsed time: 0.037569s 47.47/47.50 > Postcondition is not implied! 47.47/47.50 47.47/47.50 LOG: RETURN check - Elapsed time: 0.037727s 47.47/47.50 Cannot prove unreachability 47.47/47.50 47.47/47.50 Proving non-termination of subgraph 1 47.47/47.50 Transitions: 47.47/47.50 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> 47.47/47.50 0, arg2 -> 0, arg3 -> 9, rest remain the same}> 47.47/47.50 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}> 47.47/47.50 1, arg2 -> 1, arg3 -> 1, rest remain the same}> 47.47/47.50 0, arg3 -> -1 + arg3, rest remain the same}> 47.47/47.50 0, arg3 -> 9, rest remain the same}> 47.47/47.50 1, arg3 -> 1 + arg3, rest remain the same}> 47.47/47.50 1, arg3 -> 1, rest remain the same}> 47.47/47.50 Variables: 47.47/47.50 arg1, arg2, arg3 47.47/47.50 47.47/47.50 Checking conditional non-termination of SCC {l2}... 47.47/47.50 EXIT TRANSITIONS: 47.47/47.50 47.47/47.50 47.47/47.50 47.47/47.50 47.47/47.50 47.47/47.50 47.47/47.50 47.47/47.50 47.47/47.50 47.47/47.50 47.47/47.50 47.47/47.50 47.47/47.50 47.47/47.50 Solving with 1 template(s). 47.47/47.50 47.47/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.47/47.50 47.47/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.182518s 47.47/47.50 Time used: 0.181994 47.47/47.50 Improving Solution with cost 10 ... 47.47/47.50 47.47/47.50 LOG: CALL solveNonLinearGetNextSolution 47.47/47.50 47.47/47.50 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001674s 47.47/47.50 Time used: 1.00159 47.47/47.50 47.47/47.50 LOG: SAT solveNonLinear - Elapsed time: 1.184192s 47.47/47.50 Cost: 10; Total time: 1.18359 47.47/47.50 Non-termination implied by a set of quasi-invariant(s): 47.47/47.50 Quasi-invariant at l2: arg1 <= 1 47.47/47.50 47.47/47.50 Strengthening and disabling EXIT transitions... 47.47/47.50 Closed exits from l2: 6 47.47/47.50 Strengthening exit transition (result): 47.47/47.50 47.47/47.50 Strengthening exit transition (result): 47.47/47.50 47.47/47.50 Strengthening exit transition (result): 47.47/47.50 47.47/47.50 Strengthening exit transition (result): 47.47/47.50 47.47/47.50 Strengthening exit transition (result): 47.47/47.50 47.47/47.50 Strengthening exit transition (result): 47.47/47.50 47.47/47.50 47.47/47.50 Strengthening and disabling transitions... 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 0, arg2 -> 0, arg3 -> 9, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 1, arg2 -> 1, arg3 -> 1, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 0, arg3 -> -1 + arg3, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 0, arg3 -> 9, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 1, arg3 -> 1 + arg3, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 1, arg3 -> 1, rest remain the same}> 47.47/47.50 47.47/47.50 Checking conditional non-termination of SCC {l2}... 47.47/47.50 EXIT TRANSITIONS: 47.47/47.50 47.47/47.50 47.47/47.50 47.47/47.50 47.47/47.50 47.47/47.50 47.47/47.50 47.47/47.50 Solving with 1 template(s). 47.47/47.50 47.47/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.47/47.50 47.47/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.138633s 47.47/47.50 Time used: 0.138232 47.47/47.50 Improving Solution with cost 6 ... 47.47/47.50 47.47/47.50 LOG: CALL solveNonLinearGetNextSolution 47.47/47.50 47.47/47.50 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001829s 47.47/47.50 Time used: 1.00187 47.47/47.50 47.47/47.50 LOG: SAT solveNonLinear - Elapsed time: 1.140462s 47.47/47.50 Cost: 6; Total time: 1.1401 47.47/47.50 Non-termination implied by a set of quasi-invariant(s): 47.47/47.50 Quasi-invariant at l2: 0 <= arg3 47.47/47.50 47.47/47.50 Strengthening and disabling EXIT transitions... 47.47/47.50 Closed exits from l2: 2 47.47/47.50 Strengthening exit transition (result): 47.47/47.50 47.47/47.50 Strengthening exit transition (result): 47.47/47.50 47.47/47.50 Strengthening exit transition (result): 47.47/47.50 47.47/47.50 Strengthening exit transition (result): 47.47/47.50 47.47/47.50 47.47/47.50 Strengthening and disabling transitions... 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 0, arg2 -> 0, arg3 -> 9, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 1, arg2 -> 1, arg3 -> 1, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 0, arg3 -> -1 + arg3, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 0, arg3 -> 9, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 1, arg3 -> 1 + arg3, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 1, arg3 -> 1, rest remain the same}> 47.47/47.50 47.47/47.50 Checking conditional non-termination of SCC {l2}... 47.47/47.50 EXIT TRANSITIONS: 47.47/47.50 47.47/47.50 47.47/47.50 47.47/47.50 47.47/47.50 47.47/47.50 Solving with 1 template(s). 47.47/47.50 47.47/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.47/47.50 47.47/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.060975s 47.47/47.50 Time used: 0.06058 47.47/47.50 Improving Solution with cost 5 ... 47.47/47.50 47.47/47.50 LOG: CALL solveNonLinearGetNextSolution 47.47/47.50 47.47/47.50 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.690176s 47.47/47.50 Time used: 0.690079 47.47/47.50 Improving Solution with cost 3 ... 47.47/47.50 47.47/47.50 LOG: CALL solveNonLinearGetNextSolution 47.47/47.50 47.47/47.50 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.963519s 47.47/47.50 Time used: 0.963567 47.47/47.50 47.47/47.50 LOG: SAT solveNonLinear - Elapsed time: 1.714670s 47.47/47.50 Cost: 3; Total time: 1.71423 47.47/47.50 Failed at location 2: arg3 <= 10 47.47/47.50 Before Improving: 47.47/47.50 Quasi-invariant at l2: arg3 <= 10 47.47/47.50 Optimizing invariants... 47.47/47.50 47.47/47.50 LOG: CALL solveLinear 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear - Elapsed time: 0.008698s 47.47/47.50 Remaining time after improvement: 0.996386 47.47/47.50 Non-termination implied by a set of quasi-invariant(s): 47.47/47.50 Quasi-invariant at l2: arg3 <= 10 47.47/47.50 47.47/47.50 Strengthening and disabling EXIT transitions... 47.47/47.50 Closed exits from l2: 2 47.47/47.50 Strengthening exit transition (result): 47.47/47.50 47.47/47.50 Strengthening exit transition (result): 47.47/47.50 47.47/47.50 47.47/47.50 Strengthening and disabling transitions... 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 0, arg2 -> 0, arg3 -> 9, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 1, arg2 -> 1, arg3 -> 1, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 0, arg3 -> -1 + arg3, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 0, arg3 -> 9, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 1, arg3 -> 1 + arg3, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 1, arg3 -> 1, rest remain the same}> 47.47/47.50 47.47/47.50 Checking conditional non-termination of SCC {l2}... 47.47/47.50 EXIT TRANSITIONS: 47.47/47.50 47.47/47.50 47.47/47.50 47.47/47.50 Solving with 1 template(s). 47.47/47.50 47.47/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.47/47.50 47.47/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.047716s 47.47/47.50 Time used: 0.047338 47.47/47.50 Improving Solution with cost 1 ... 47.47/47.50 47.47/47.50 LOG: CALL solveNonLinearGetNextSolution 47.47/47.50 47.47/47.50 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.104127s 47.47/47.50 Time used: 0.104126 47.47/47.50 47.47/47.50 LOG: SAT solveNonLinear - Elapsed time: 0.151842s 47.47/47.50 Cost: 1; Total time: 0.151464 47.47/47.50 Non-termination implied by a set of quasi-invariant(s): 47.47/47.50 Quasi-invariant at l2: arg2 <= 1 47.47/47.50 47.47/47.50 Strengthening and disabling EXIT transitions... 47.47/47.50 Closed exits from l2: 1 47.47/47.50 Strengthening exit transition (result): 47.47/47.50 47.47/47.50 47.47/47.50 Strengthening and disabling transitions... 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 0, arg2 -> 0, arg3 -> 9, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 1, arg2 -> 1, arg3 -> 1, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 0, arg3 -> -1 + arg3, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 0, arg3 -> 9, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 1, arg3 -> 1 + arg3, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 1, arg3 -> 1, rest remain the same}> 47.47/47.50 47.47/47.50 Checking conditional non-termination of SCC {l2}... 47.47/47.50 EXIT TRANSITIONS: 47.47/47.50 47.47/47.50 47.47/47.50 Solving with 1 template(s). 47.47/47.50 47.47/47.50 LOG: CALL solveNonLinearGetFirstSolution 47.47/47.50 47.47/47.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.041877s 47.47/47.50 Time used: 0.041759 47.47/47.50 47.47/47.50 LOG: SAT solveNonLinear - Elapsed time: 0.041877s 47.47/47.50 Cost: 0; Total time: 0.041759 47.47/47.50 Non-termination implied by a set of quasi-invariant(s): 47.47/47.50 Quasi-invariant at l2: 0 <= arg2 47.47/47.50 47.47/47.50 Strengthening and disabling EXIT transitions... 47.47/47.50 Closed exits from l2: 1 47.47/47.50 47.47/47.50 Strengthening and disabling transitions... 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 0, arg2 -> 0, arg3 -> 9, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 1, arg2 -> 1, arg3 -> 1, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 0, arg3 -> -1 + arg3, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 0, arg3 -> 9, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 1, arg3 -> 1 + arg3, rest remain the same}> 47.47/47.50 47.47/47.50 LOG: CALL solverLinear in Graph for feasibility 47.47/47.50 47.47/47.50 LOG: RETURN solveLinear in Graph for feasibility 47.47/47.50 Strengthening transition (result): 47.47/47.50 1, arg3 -> 1, rest remain the same}> 47.47/47.50 47.47/47.50 Calling reachability with... 47.47/47.50 Transition: 47.47/47.50 Conditions: arg1 <= 1, 0 <= arg3, arg3 <= 10, arg2 <= 1, 0 <= arg2, 47.47/47.50 OPEN EXITS: 47.47/47.50 47.47/47.50 47.47/47.50 --- Reachability graph --- 47.47/47.50 > Graph without transitions. 47.47/47.50 47.47/47.50 Calling reachability with... 47.47/47.50 Transition: 47.47/47.50 Conditions: 0 <= arg2, 0 <= arg3, arg1 <= 1, arg2 <= 1, arg3 <= 10, 47.47/47.50 OPEN EXITS: 47.47/47.50 47.47/47.50 47.47/47.50 > Conditions are reachable! 47.47/47.50 47.47/47.50 Program does NOT terminate 47.47/47.50 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 47.47/47.50 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 47.47/47.50 EOF