49.55/49.63 NO 49.55/49.63 49.55/49.63 Solver Timeout: 4 49.55/49.63 Global Timeout: 300 49.55/49.63 No parsing errors! 49.55/49.63 Init Location: 0 49.55/49.63 Transitions: 49.55/49.63 49.55/49.63 0) /\ (arg2 > ~(1)), par{arg1 -> 5}> 49.55/49.63 (arg1 + 1), arg2 -> ((~(1) * arg2) + 1)}> 49.55/49.63 0) /\ (arg2 < (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> ((~(1) * arg2) + 1)}> 49.55/49.63 = (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> 0}> 49.55/49.63 0) /\ (arg2 >= (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> 0}> 49.55/49.63 arg1) /\ (arg2 < 0) /\ (arg2 >= (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> ((~(1) * arg2) - 1)}> 49.55/49.63 arg1) /\ (arg2 > 0) /\ (arg2 >= (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> ((~(1) * arg2) - 1)}> 49.55/49.63 undef15, arg2 -> undef16}> 49.55/49.63 49.55/49.63 Fresh variables: 49.55/49.63 undef15, undef16, 49.55/49.63 49.55/49.63 Undef variables: 49.55/49.63 undef15, undef16, 49.55/49.63 49.55/49.63 Abstraction variables: 49.55/49.63 49.55/49.63 Exit nodes: 49.55/49.63 49.55/49.63 Accepting locations: 49.55/49.63 49.55/49.63 Asserts: 49.55/49.63 49.55/49.63 Preprocessed LLVMGraph 49.55/49.63 Init Location: 0 49.55/49.63 Transitions: 49.55/49.63 0) /\ (undef16 > ~(1))> 49.55/49.63 (arg1 + 1), arg2 -> ((~(1) * arg2) + 1)}> 49.55/49.63 0) /\ (arg2 < (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> ((~(1) * arg2) + 1)}> 49.55/49.63 = (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> 0}> 49.55/49.63 0) /\ (arg2 >= (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> 0}> 49.55/49.63 arg1) /\ (arg2 > 0) /\ (arg2 >= (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> ((~(1) * arg2) - 1)}> 49.55/49.63 49.55/49.63 Fresh variables: 49.55/49.63 undef15, undef16, 49.55/49.63 49.55/49.63 Undef variables: 49.55/49.63 undef15, undef16, 49.55/49.63 49.55/49.63 Abstraction variables: 49.55/49.63 49.55/49.63 Exit nodes: 49.55/49.63 49.55/49.63 Accepting locations: 49.55/49.63 49.55/49.63 Asserts: 49.55/49.63 49.55/49.63 ************************************************************* 49.55/49.63 ******************************************************************************************* 49.55/49.63 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 49.55/49.63 ******************************************************************************************* 49.55/49.63 49.55/49.63 Init Location: 0 49.55/49.63 Graph 0: 49.55/49.63 Transitions: 49.55/49.63 Variables: 49.55/49.63 49.55/49.63 Graph 1: 49.55/49.63 Transitions: 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 1 + arg1, arg2 -> 0, rest remain the same}> 49.55/49.63 1 + arg1, arg2 -> 0, rest remain the same}> 49.55/49.63 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> 49.55/49.63 Variables: 49.55/49.63 arg1, arg2 49.55/49.63 49.55/49.63 Precedence: 49.55/49.63 Graph 0 49.55/49.63 49.55/49.63 Graph 1 49.55/49.63 49.55/49.63 49.55/49.63 Map Locations to Subgraph: 49.55/49.63 ( 0 , 0 ) 49.55/49.63 ( 2 , 1 ) 49.55/49.63 49.55/49.63 ******************************************************************************************* 49.55/49.63 ******************************** CHECKING ASSERTIONS ******************************** 49.55/49.63 ******************************************************************************************* 49.55/49.63 49.55/49.63 Proving termination of subgraph 0 49.55/49.63 Proving termination of subgraph 1 49.55/49.63 Checking unfeasibility... 49.55/49.63 Time used: 0.01264 49.55/49.63 Some transition disabled by a set of invariant(s): 49.55/49.63 Invariant at l2: 0 <= 1 + arg1 49.55/49.63 49.55/49.63 Strengthening and disabling transitions... 49.55/49.63 > It's unfeasible. Removing transition: 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 49.55/49.63 LOG: CALL solverLinear in Graph for feasibility 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear in Graph for feasibility 49.55/49.63 Strengthening transition (result): 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 49.55/49.63 LOG: CALL solverLinear in Graph for feasibility 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear in Graph for feasibility 49.55/49.63 Strengthening transition (result): 49.55/49.63 1 + arg1, arg2 -> 0, rest remain the same}> 49.55/49.63 49.55/49.63 LOG: CALL solverLinear in Graph for feasibility 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear in Graph for feasibility 49.55/49.63 Strengthening transition (result): 49.55/49.63 1 + arg1, arg2 -> 0, rest remain the same}> 49.55/49.63 49.55/49.63 LOG: CALL solverLinear in Graph for feasibility 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear in Graph for feasibility 49.55/49.63 Strengthening transition (result): 49.55/49.63 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> 49.55/49.63 Checking unfeasibility... 49.55/49.63 Time used: 0.009697 49.55/49.63 49.55/49.63 Checking conditional termination of SCC {l2}... 49.55/49.63 49.55/49.63 LOG: CALL solveLinear 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear - Elapsed time: 0.002407s 49.55/49.63 49.55/49.63 LOG: CALL solveLinear 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear - Elapsed time: 0.300167s 49.55/49.63 Trying to remove transition: 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> 49.55/49.63 Solving with 1 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017105s 49.55/49.63 Time used: 0.016487 49.55/49.63 Trying to remove transition: 1 + arg1, arg2 -> 0, rest remain the same}> 49.55/49.63 Solving with 1 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017870s 49.55/49.63 Time used: 0.016811 49.55/49.63 Trying to remove transition: 1 + arg1, arg2 -> 0, rest remain the same}> 49.55/49.63 Solving with 1 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018052s 49.55/49.63 Time used: 0.017116 49.55/49.63 Trying to remove transition: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 Solving with 1 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014657s 49.55/49.63 Time used: 0.01371 49.55/49.63 Solving with 1 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.024755s 49.55/49.63 Time used: 4.02339 49.55/49.63 Solving with 2 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.141669s 49.55/49.63 Time used: 0.120993 49.55/49.63 Improving Solution with cost 1 ... 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetNextSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001252s 49.55/49.63 Time used: 1.00119 49.55/49.63 49.55/49.63 LOG: SAT solveNonLinear - Elapsed time: 1.142922s 49.55/49.63 Cost: 1; Total time: 1.12218 49.55/49.63 Failed at location 2: arg2 <= 0 49.55/49.63 Before Improving: 49.55/49.63 Quasi-invariant at l2: 0 <= arg2 49.55/49.63 Quasi-invariant at l2: arg2 <= 0 49.55/49.63 Optimizing invariants... 49.55/49.63 49.55/49.63 LOG: CALL solveLinear 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear - Elapsed time: 0.010318s 49.55/49.63 Remaining time after improvement: 0.994488 49.55/49.63 Termination implied by a set of quasi-invariant(s): 49.55/49.63 Quasi-invariant at l2: 0 <= arg2 49.55/49.63 Quasi-invariant at l2: arg2 <= 0 49.55/49.63 [ Invariant Graph ] 49.55/49.63 Strengthening and disabling transitions... 49.55/49.63 49.55/49.63 LOG: CALL solverLinear in Graph for feasibility 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear in Graph for feasibility 49.55/49.63 It's unfeasible. Removing transition: 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 49.55/49.63 LOG: CALL solverLinear in Graph for feasibility 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear in Graph for feasibility 49.55/49.63 It's unfeasible. Removing transition: 49.55/49.63 1 + arg1, arg2 -> 0, rest remain the same}> 49.55/49.63 49.55/49.63 LOG: CALL solverLinear in Graph for feasibility 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear in Graph for feasibility 49.55/49.63 It's unfeasible. Removing transition: 49.55/49.63 1 + arg1, arg2 -> 0, rest remain the same}> 49.55/49.63 49.55/49.63 LOG: CALL solverLinear in Graph for feasibility 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear in Graph for feasibility 49.55/49.63 It's unfeasible. Removing transition: 49.55/49.63 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> 49.55/49.63 [ Termination Graph ] 49.55/49.63 Strengthening and disabling transitions... 49.55/49.63 49.55/49.63 LOG: CALL solverLinear in Graph for feasibility 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear in Graph for feasibility 49.55/49.63 It's unfeasible. Removing transition: 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 49.55/49.63 LOG: CALL solverLinear in Graph for feasibility 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear in Graph for feasibility 49.55/49.63 It's unfeasible. Removing transition: 49.55/49.63 1 + arg1, arg2 -> 0, rest remain the same}> 49.55/49.63 49.55/49.63 LOG: CALL solverLinear in Graph for feasibility 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear in Graph for feasibility 49.55/49.63 It's unfeasible. Removing transition: 49.55/49.63 1 + arg1, arg2 -> 0, rest remain the same}> 49.55/49.63 49.55/49.63 LOG: CALL solverLinear in Graph for feasibility 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear in Graph for feasibility 49.55/49.63 It's unfeasible. Removing transition: 49.55/49.63 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> 49.55/49.63 New Graphs: 49.55/49.63 Calling Safety with literal arg2 <= 0 and entry 49.55/49.63 49.55/49.63 LOG: CALL check - Post:arg2 <= 0 - Process 1 49.55/49.63 * Exit transition: 49.55/49.63 * Postcondition : arg2 <= 0 49.55/49.63 49.55/49.63 LOG: CALL solveLinear 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear - Elapsed time: 0.001300s 49.55/49.63 > Postcondition is not implied! 49.55/49.63 49.55/49.63 LOG: RETURN check - Elapsed time: 0.001403s 49.55/49.63 INVARIANTS: 49.55/49.63 2: 49.55/49.63 Quasi-INVARIANTS to narrow Graph: 49.55/49.63 2: arg2 <= 0 , 0 <= arg2 , 49.55/49.63 Narrowing transition: 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 49.55/49.63 LOG: Narrow transition size 2 49.55/49.63 It's unfeasible. Removing transition: 49.55/49.63 1 + arg1, arg2 -> 0, rest remain the same}> 49.55/49.63 It's unfeasible. Removing transition: 49.55/49.63 1 + arg1, arg2 -> 0, rest remain the same}> 49.55/49.63 Narrowing transition: 49.55/49.63 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> 49.55/49.63 49.55/49.63 LOG: Narrow transition size 2 49.55/49.63 invGraph after Narrowing: 49.55/49.63 Transitions: 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> 49.55/49.63 Variables: 49.55/49.63 arg1, arg2 49.55/49.63 Checking conditional termination of SCC {l2}... 49.55/49.63 49.55/49.63 LOG: CALL solveLinear 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear - Elapsed time: 0.001211s 49.55/49.63 49.55/49.63 LOG: CALL solveLinear 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear - Elapsed time: 0.026362s 49.55/49.63 Trying to remove transition: 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> 49.55/49.63 Solving with 1 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010889s 49.55/49.63 Time used: 0.010653 49.55/49.63 Trying to remove transition: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 Solving with 1 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011686s 49.55/49.63 Time used: 0.011175 49.55/49.63 Solving with 1 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002414s 49.55/49.63 Time used: 4.00142 49.55/49.63 Solving with 2 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.070565s 49.55/49.63 Time used: 0.059599 49.55/49.63 Improving Solution with cost 1 ... 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetNextSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002140s 49.55/49.63 Time used: 1.00079 49.55/49.63 49.55/49.63 LOG: SAT solveNonLinear - Elapsed time: 1.072706s 49.55/49.63 Cost: 1; Total time: 1.06039 49.55/49.63 Failed at location 2: 1 + arg2 <= arg1 49.55/49.63 Before Improving: 49.55/49.63 Quasi-invariant at l2: 1 + arg2 <= arg1 49.55/49.63 Quasi-invariant at l2: 1 <= arg2 49.55/49.63 Optimizing invariants... 49.55/49.63 49.55/49.63 LOG: CALL solveLinear 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear - Elapsed time: 0.017827s 49.55/49.63 Remaining time after improvement: 0.996824 49.55/49.63 Termination implied by a set of quasi-invariant(s): 49.55/49.63 Quasi-invariant at l2: 1 + arg2 <= arg1 49.55/49.63 Quasi-invariant at l2: 1 <= arg2 49.55/49.63 [ Invariant Graph ] 49.55/49.63 Strengthening and disabling transitions... 49.55/49.63 49.55/49.63 LOG: CALL solverLinear in Graph for feasibility 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear in Graph for feasibility 49.55/49.63 It's unfeasible. Removing transition: 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 49.55/49.63 LOG: CALL solverLinear in Graph for feasibility 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear in Graph for feasibility 49.55/49.63 It's unfeasible. Removing transition: 49.55/49.63 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> 49.55/49.63 [ Termination Graph ] 49.55/49.63 Strengthening and disabling transitions... 49.55/49.63 > It's unfeasible. Removing transition: 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 49.55/49.63 LOG: CALL solverLinear in Graph for feasibility 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear in Graph for feasibility 49.55/49.63 It's unfeasible. Removing transition: 49.55/49.63 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> 49.55/49.63 New Graphs: 49.55/49.63 Calling Safety with literal 1 + arg2 <= arg1 and entry 49.55/49.63 49.55/49.63 LOG: CALL check - Post:1 + arg2 <= arg1 - Process 2 49.55/49.63 * Exit transition: 49.55/49.63 * Postcondition : 1 + arg2 <= arg1 49.55/49.63 49.55/49.63 LOG: CALL solveLinear 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear - Elapsed time: 0.001112s 49.55/49.63 > Postcondition is not implied! 49.55/49.63 49.55/49.63 LOG: RETURN check - Elapsed time: 0.001227s 49.55/49.63 INVARIANTS: 49.55/49.63 2: 49.55/49.63 Quasi-INVARIANTS to narrow Graph: 49.55/49.63 2: 1 + arg2 <= arg1 , 1 <= arg2 , 49.55/49.63 Narrowing transition: 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 49.55/49.63 LOG: Narrow transition size 2 49.55/49.63 Narrowing transition: 49.55/49.63 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> 49.55/49.63 49.55/49.63 LOG: Narrow transition size 2 49.55/49.63 invGraph after Narrowing: 49.55/49.63 Transitions: 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> 49.55/49.63 Variables: 49.55/49.63 arg1, arg2 49.55/49.63 Checking conditional termination of SCC {l2}... 49.55/49.63 49.55/49.63 LOG: CALL solveLinear 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear - Elapsed time: 0.002586s 49.55/49.63 Ranking function: -arg1 49.55/49.63 New Graphs: 49.55/49.63 Transitions: 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> 49.55/49.63 Variables: 49.55/49.63 arg1, arg2 49.55/49.63 Checking conditional termination of SCC {l2}... 49.55/49.63 49.55/49.63 LOG: CALL solveLinear 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear - Elapsed time: 0.001363s 49.55/49.63 49.55/49.63 LOG: CALL solveLinear 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear - Elapsed time: 0.036591s 49.55/49.63 Trying to remove transition: 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> 49.55/49.63 Solving with 1 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011993s 49.55/49.63 Time used: 0.011756 49.55/49.63 Trying to remove transition: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 Solving with 1 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010327s 49.55/49.63 Time used: 0.009771 49.55/49.63 Solving with 1 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.013527s 49.55/49.63 Time used: 4.0079 49.55/49.63 Solving with 2 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.078924s 49.55/49.63 Time used: 0.066513 49.55/49.63 Improving Solution with cost 1 ... 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetNextSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002212s 49.55/49.63 Time used: 1.00125 49.55/49.63 49.55/49.63 LOG: SAT solveNonLinear - Elapsed time: 1.081137s 49.55/49.63 Cost: 1; Total time: 1.06776 49.55/49.63 Failed at location 2: arg2 <= arg1 49.55/49.63 Before Improving: 49.55/49.63 Quasi-invariant at l2: 0 <= arg2 49.55/49.63 Quasi-invariant at l2: arg2 <= arg1 49.55/49.63 Optimizing invariants... 49.55/49.63 49.55/49.63 LOG: CALL solveLinear 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear - Elapsed time: 0.024826s 49.55/49.63 Remaining time after improvement: 0.995989 49.55/49.63 Termination implied by a set of quasi-invariant(s): 49.55/49.63 Quasi-invariant at l2: 0 <= arg2 49.55/49.63 Quasi-invariant at l2: arg2 <= arg1 49.55/49.63 [ Invariant Graph ] 49.55/49.63 Strengthening and disabling transitions... 49.55/49.63 49.55/49.63 LOG: CALL solverLinear in Graph for feasibility 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear in Graph for feasibility 49.55/49.63 It's unfeasible. Removing transition: 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 49.55/49.63 LOG: CALL solverLinear in Graph for feasibility 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear in Graph for feasibility 49.55/49.63 It's unfeasible. Removing transition: 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 49.55/49.63 LOG: CALL solverLinear in Graph for feasibility 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear in Graph for feasibility 49.55/49.63 It's unfeasible. Removing transition: 49.55/49.63 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> 49.55/49.63 [ Termination Graph ] 49.55/49.63 Strengthening and disabling transitions... 49.55/49.63 > It's unfeasible. Removing transition: 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 49.55/49.63 LOG: CALL solverLinear in Graph for feasibility 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear in Graph for feasibility 49.55/49.63 It's unfeasible. Removing transition: 49.55/49.63 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> 49.55/49.63 New Graphs: 49.55/49.63 Calling Safety with literal arg2 <= arg1 and entry 49.55/49.63 49.55/49.63 LOG: CALL check - Post:arg2 <= arg1 - Process 3 49.55/49.63 * Exit transition: 49.55/49.63 * Postcondition : arg2 <= arg1 49.55/49.63 49.55/49.63 LOG: CALL solveLinear 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear - Elapsed time: 0.001383s 49.55/49.63 > Postcondition is not implied! 49.55/49.63 49.55/49.63 LOG: RETURN check - Elapsed time: 0.001507s 49.55/49.63 INVARIANTS: 49.55/49.63 2: 49.55/49.63 Quasi-INVARIANTS to narrow Graph: 49.55/49.63 2: arg2 <= arg1 , 0 <= arg2 , 49.55/49.63 Narrowing transition: 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 49.55/49.63 LOG: Narrow transition size 2 49.55/49.63 Narrowing transition: 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 49.55/49.63 LOG: Narrow transition size 2 49.55/49.63 Narrowing transition: 49.55/49.63 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> 49.55/49.63 49.55/49.63 LOG: Narrow transition size 2 49.55/49.63 invGraph after Narrowing: 49.55/49.63 Transitions: 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> 49.55/49.63 Variables: 49.55/49.63 arg1, arg2 49.55/49.63 Checking conditional termination of SCC {l2}... 49.55/49.63 49.55/49.63 LOG: CALL solveLinear 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear - Elapsed time: 0.002581s 49.55/49.63 Ranking function: -arg1 49.55/49.63 New Graphs: 49.55/49.63 Transitions: 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> 49.55/49.63 Variables: 49.55/49.63 arg1, arg2 49.55/49.63 Checking conditional termination of SCC {l2}... 49.55/49.63 49.55/49.63 LOG: CALL solveLinear 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear - Elapsed time: 0.001412s 49.55/49.63 49.55/49.63 LOG: CALL solveLinear 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear - Elapsed time: 0.036549s 49.55/49.63 Trying to remove transition: 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> 49.55/49.63 Solving with 1 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012249s 49.55/49.63 Time used: 0.012006 49.55/49.63 Trying to remove transition: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 Solving with 1 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010618s 49.55/49.63 Time used: 0.009991 49.55/49.63 Solving with 1 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003831s 49.55/49.63 Time used: 4.00162 49.55/49.63 Solving with 2 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.013673s 49.55/49.63 Time used: 4.00102 49.55/49.63 Solving with 3 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.013358s 49.55/49.63 Time used: 1.00087 49.55/49.63 Solving with 1 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.032677s 49.55/49.63 Time used: 0.020583 49.55/49.63 Improving Solution with cost 1 ... 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetNextSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001667s 49.55/49.63 Time used: 1.00159 49.55/49.63 49.55/49.63 LOG: SAT solveNonLinear - Elapsed time: 1.034344s 49.55/49.63 Cost: 1; Total time: 1.02217 49.55/49.63 Termination implied by a set of invariant(s): 49.55/49.63 Invariant at l2: 0 <= 1 + arg1 49.55/49.63 [ Invariant Graph ] 49.55/49.63 Strengthening and disabling transitions... 49.55/49.63 49.55/49.63 LOG: CALL solverLinear in Graph for feasibility 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear in Graph for feasibility 49.55/49.63 Strengthening transition (result): 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 49.55/49.63 LOG: CALL solverLinear in Graph for feasibility 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear in Graph for feasibility 49.55/49.63 Strengthening transition (result): 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 49.55/49.63 LOG: CALL solverLinear in Graph for feasibility 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear in Graph for feasibility 49.55/49.63 Strengthening transition (result): 49.55/49.63 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> 49.55/49.63 [ Termination Graph ] 49.55/49.63 Strengthening and disabling transitions... 49.55/49.63 49.55/49.63 LOG: CALL solverLinear in Graph for feasibility 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear in Graph for feasibility 49.55/49.63 Strengthening transition (result): 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 49.55/49.63 LOG: CALL solverLinear in Graph for feasibility 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear in Graph for feasibility 49.55/49.63 Strengthening transition (result): 49.55/49.63 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> 49.55/49.63 Quasi-ranking function: 50000 - arg1 49.55/49.63 New Graphs: 49.55/49.63 Transitions: 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> 49.55/49.63 Variables: 49.55/49.63 arg1, arg2 49.55/49.63 Checking conditional termination of SCC {l2}... 49.55/49.63 49.55/49.63 LOG: CALL solveLinear 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear - Elapsed time: 0.001577s 49.55/49.63 49.55/49.63 LOG: CALL solveLinear 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear - Elapsed time: 0.103969s 49.55/49.63 Trying to remove transition: 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> 49.55/49.63 Solving with 1 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015214s 49.55/49.63 Time used: 0.014964 49.55/49.63 Trying to remove transition: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 Solving with 1 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015609s 49.55/49.63 Time used: 0.014838 49.55/49.63 Solving with 1 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002361s 49.55/49.63 Time used: 4.00147 49.55/49.63 Solving with 2 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.013212s 49.55/49.63 Time used: 4.00112 49.55/49.63 Solving with 3 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.028940s 49.55/49.63 Time used: 1.01687 49.55/49.63 Solving with 1 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.014777s 49.55/49.63 Time used: 4.00258 49.55/49.63 49.55/49.63 Proving non-termination of subgraph 1 49.55/49.63 Transitions: 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> 49.55/49.63 Variables: 49.55/49.63 arg1, arg2 49.55/49.63 49.55/49.63 Checking conditional non-termination of SCC {l2}... 49.55/49.63 EXIT TRANSITIONS: 49.55/49.63 49.55/49.63 49.55/49.63 49.55/49.63 49.55/49.63 49.55/49.63 Solving with 1 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019939s 49.55/49.63 Time used: 0.019671 49.55/49.63 Improving Solution with cost 3 ... 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetNextSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.046626s 49.55/49.63 Time used: 0.046617 49.55/49.63 49.55/49.63 LOG: SAT solveNonLinear - Elapsed time: 0.066565s 49.55/49.63 Cost: 3; Total time: 0.066288 49.55/49.63 Non-termination implied by a set of quasi-invariant(s): 49.55/49.63 Quasi-invariant at l2: 0 <= arg1 49.55/49.63 49.55/49.63 Strengthening and disabling EXIT transitions... 49.55/49.63 Closed exits from l2: 1 49.55/49.63 Strengthening exit transition (result): 49.55/49.63 49.55/49.63 Strengthening exit transition (result): 49.55/49.63 49.55/49.63 Strengthening exit transition (result): 49.55/49.63 49.55/49.63 49.55/49.63 Strengthening and disabling transitions... 49.55/49.63 49.55/49.63 LOG: CALL solverLinear in Graph for feasibility 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear in Graph for feasibility 49.55/49.63 Strengthening transition (result): 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 49.55/49.63 LOG: CALL solverLinear in Graph for feasibility 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear in Graph for feasibility 49.55/49.63 It's unfeasible. Removing transition: 49.55/49.63 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 49.55/49.63 49.55/49.63 LOG: CALL solverLinear in Graph for feasibility 49.55/49.63 49.55/49.63 LOG: RETURN solveLinear in Graph for feasibility 49.55/49.63 Strengthening transition (result): 49.55/49.63 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> 49.55/49.63 49.55/49.63 Checking conditional non-termination of SCC {l2}... 49.55/49.63 EXIT TRANSITIONS: 49.55/49.63 49.55/49.63 49.55/49.63 49.55/49.63 49.55/49.63 Solving with 1 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017415s 49.55/49.63 Time used: 0.01731 49.55/49.63 Solving with 2 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.002615s 49.55/49.63 Time used: 5.0016 49.55/49.63 Solving with 3 template(s). 49.55/49.63 49.55/49.63 LOG: CALL solveNonLinearGetFirstSolution 49.55/49.63 49.55/49.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.024167s 49.55/49.63 Time used: 5.01806 49.55/49.63 > Checking if the negation of the conditions of every pending exit is quasi-invariant... YES 49.55/49.63 Calling reachability with... 49.55/49.63 Transition: 49.55/49.63 Conditions: 0 <= arg1 + arg2, 0 <= arg2, arg1 <= arg2, 1 + arg1 <= arg2, 0 <= arg1, 49.55/49.63 Transition: 49.55/49.63 Conditions: 1 + arg1 + arg2 <= 0, 1 + arg2 <= 0, 1 + arg2 <= arg1, arg2 <= arg1, 0 <= arg1, 49.55/49.63 OPEN EXITS: 49.55/49.63 49.55/49.63 49.55/49.63 49.55/49.63 --- Reachability graph --- 49.55/49.63 > Graph without transitions. 49.55/49.63 49.55/49.63 Calling reachability with... 49.55/49.63 Transition: 49.55/49.63 Conditions: 0 <= arg1, 0 <= arg1 + arg2, 0 <= arg2, 1 + arg1 <= arg2, 49.55/49.63 Transition: 49.55/49.63 Conditions: 0 <= arg1, 1 + arg1 + arg2 <= 0, 1 + arg2 <= arg1, 1 + arg2 <= 0, 49.55/49.63 OPEN EXITS: 49.55/49.63 49.55/49.63 49.55/49.63 > Conditions are reachable! 49.55/49.63 49.55/49.63 Program does NOT terminate 49.55/49.63 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 49.55/49.63 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 49.55/49.63 EOF