29.47/29.54 NO 29.47/29.54 29.47/29.54 Solver Timeout: 4 29.47/29.54 Global Timeout: 300 29.47/29.54 No parsing errors! 29.47/29.54 Init Location: 0 29.47/29.54 Transitions: 29.47/29.54 29.47/29.54 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}> 29.47/29.54 10, arg2 -> undef4}> 29.47/29.54 5) /\ (arg1 < 10), par{arg1 -> (arg1 - 1), arg2 -> undef6}> 29.47/29.54 10), par{arg1 -> (arg1 - 1), arg2 -> undef8}> 29.47/29.54 undef9, arg2 -> undef10}> 29.47/29.54 29.47/29.54 Fresh variables: 29.47/29.54 undef2, undef4, undef6, undef8, undef9, undef10, 29.47/29.54 29.47/29.54 Undef variables: 29.47/29.54 undef2, undef4, undef6, undef8, undef9, undef10, 29.47/29.54 29.47/29.54 Abstraction variables: 29.47/29.54 29.47/29.54 Exit nodes: 29.47/29.54 29.47/29.54 Accepting locations: 29.47/29.54 29.47/29.54 Asserts: 29.47/29.54 29.47/29.54 Preprocessed LLVMGraph 29.47/29.54 Init Location: 0 29.47/29.54 Transitions: 29.47/29.54 0) /\ (undef10 > ~(1))> 29.47/29.54 10}> 29.47/29.54 5) /\ (arg1 < 10), par{arg1 -> (arg1 - 1)}> 29.47/29.54 10), par{arg1 -> (arg1 - 1)}> 29.47/29.54 29.47/29.54 Fresh variables: 29.47/29.54 undef2, undef4, undef6, undef8, undef9, undef10, 29.47/29.54 29.47/29.54 Undef variables: 29.47/29.54 undef2, undef4, undef6, undef8, undef9, undef10, 29.47/29.54 29.47/29.54 Abstraction variables: 29.47/29.54 29.47/29.54 Exit nodes: 29.47/29.54 29.47/29.54 Accepting locations: 29.47/29.54 29.47/29.54 Asserts: 29.47/29.54 29.47/29.54 ************************************************************* 29.47/29.54 ******************************************************************************************* 29.47/29.54 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 29.47/29.54 ******************************************************************************************* 29.47/29.54 29.47/29.54 Init Location: 0 29.47/29.54 Graph 0: 29.47/29.54 Transitions: 29.47/29.54 Variables: 29.47/29.54 29.47/29.54 Graph 1: 29.47/29.54 Transitions: 29.47/29.54 10, rest remain the same}> 29.47/29.54 -1 + arg1, rest remain the same}> 29.47/29.54 -1 + arg1, rest remain the same}> 29.47/29.54 Variables: 29.47/29.54 arg1 29.47/29.54 29.47/29.54 Precedence: 29.47/29.54 Graph 0 29.47/29.54 29.47/29.54 Graph 1 29.47/29.54 29.47/29.54 29.47/29.54 Map Locations to Subgraph: 29.47/29.54 ( 0 , 0 ) 29.47/29.54 ( 2 , 1 ) 29.47/29.54 29.47/29.54 ******************************************************************************************* 29.47/29.54 ******************************** CHECKING ASSERTIONS ******************************** 29.47/29.54 ******************************************************************************************* 29.47/29.54 29.47/29.54 Proving termination of subgraph 0 29.47/29.54 Proving termination of subgraph 1 29.47/29.54 Checking unfeasibility... 29.47/29.54 Time used: 0.004939 29.47/29.54 29.47/29.54 Checking conditional termination of SCC {l2}... 29.47/29.54 29.47/29.54 LOG: CALL solveLinear 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear - Elapsed time: 0.001173s 29.47/29.54 Ranking function: -1 + arg1 29.47/29.54 New Graphs: 29.47/29.54 Transitions: 29.47/29.54 10, rest remain the same}> 29.47/29.54 Variables: 29.47/29.54 arg1 29.47/29.54 Checking conditional termination of SCC {l2}... 29.47/29.54 29.47/29.54 LOG: CALL solveLinear 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear - Elapsed time: 0.000358s 29.47/29.54 29.47/29.54 LOG: CALL solveLinear 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear - Elapsed time: 0.001001s 29.47/29.54 Trying to remove transition: 10, rest remain the same}> 29.47/29.54 Solving with 1 template(s). 29.47/29.54 29.47/29.54 LOG: CALL solveNonLinearGetFirstSolution 29.47/29.54 29.47/29.54 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.528714s 29.47/29.54 Time used: 3.52779 29.47/29.54 Solving with 1 template(s). 29.47/29.54 29.47/29.54 LOG: CALL solveNonLinearGetFirstSolution 29.47/29.54 29.47/29.54 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.033618s 29.47/29.54 Time used: 0.00892 29.47/29.54 Improving Solution with cost 1 ... 29.47/29.54 29.47/29.54 LOG: CALL solveNonLinearGetNextSolution 29.47/29.54 29.47/29.54 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.037043s 29.47/29.54 Time used: 0.037031 29.47/29.54 29.47/29.54 LOG: SAT solveNonLinear - Elapsed time: 0.070660s 29.47/29.54 Cost: 1; Total time: 0.045951 29.47/29.54 Failed at location 2: arg1 <= 0 29.47/29.54 Before Improving: 29.47/29.54 Quasi-invariant at l2: arg1 <= 0 29.47/29.54 Optimizing invariants... 29.47/29.54 29.47/29.54 LOG: CALL solveLinear 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear - Elapsed time: 0.005722s 29.47/29.54 Remaining time after improvement: 0.99876 29.47/29.54 Termination implied by a set of quasi-invariant(s): 29.47/29.54 Quasi-invariant at l2: arg1 <= 0 29.47/29.54 [ Invariant Graph ] 29.47/29.54 Strengthening and disabling transitions... 29.47/29.54 29.47/29.54 LOG: CALL solverLinear in Graph for feasibility 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear in Graph for feasibility 29.47/29.54 It's unfeasible. Removing transition: 29.47/29.54 10, rest remain the same}> 29.47/29.54 29.47/29.54 LOG: CALL solverLinear in Graph for feasibility 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear in Graph for feasibility 29.47/29.54 It's unfeasible. Removing transition: 29.47/29.54 -1 + arg1, rest remain the same}> 29.47/29.54 29.47/29.54 LOG: CALL solverLinear in Graph for feasibility 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear in Graph for feasibility 29.47/29.54 It's unfeasible. Removing transition: 29.47/29.54 -1 + arg1, rest remain the same}> 29.47/29.54 [ Termination Graph ] 29.47/29.54 Strengthening and disabling transitions... 29.47/29.54 > It's unfeasible. Removing transition: 29.47/29.54 10, rest remain the same}> 29.47/29.54 New Graphs: 29.47/29.54 Calling Safety with literal arg1 <= 0 and entry 29.47/29.54 29.47/29.54 LOG: CALL check - Post:arg1 <= 0 - Process 1 29.47/29.54 * Exit transition: 29.47/29.54 * Postcondition : arg1 <= 0 29.47/29.54 29.47/29.54 LOG: CALL solveLinear 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear - Elapsed time: 0.000609s 29.47/29.54 > Postcondition is not implied! 29.47/29.54 29.47/29.54 LOG: RETURN check - Elapsed time: 0.000699s 29.47/29.54 INVARIANTS: 29.47/29.54 2: 29.47/29.54 Quasi-INVARIANTS to narrow Graph: 29.47/29.54 2: arg1 <= 0 , 29.47/29.54 Narrowing transition: 29.47/29.54 10, rest remain the same}> 29.47/29.54 29.47/29.54 LOG: Narrow transition size 1 29.47/29.54 Narrowing transition: 29.47/29.54 -1 + arg1, rest remain the same}> 29.47/29.54 29.47/29.54 LOG: Narrow transition size 1 29.47/29.54 Narrowing transition: 29.47/29.54 -1 + arg1, rest remain the same}> 29.47/29.54 29.47/29.54 LOG: Narrow transition size 1 29.47/29.54 invGraph after Narrowing: 29.47/29.54 Transitions: 29.47/29.54 10, rest remain the same}> 29.47/29.54 -1 + arg1, rest remain the same}> 29.47/29.54 -1 + arg1, rest remain the same}> 29.47/29.54 Variables: 29.47/29.54 arg1 29.47/29.54 Checking conditional termination of SCC {l2}... 29.47/29.54 29.47/29.54 LOG: CALL solveLinear 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear - Elapsed time: 0.001094s 29.47/29.54 Ranking function: -1 + arg1 29.47/29.54 New Graphs: 29.47/29.54 Transitions: 29.47/29.54 10, rest remain the same}> 29.47/29.54 Variables: 29.47/29.54 arg1 29.47/29.54 Checking conditional termination of SCC {l2}... 29.47/29.54 29.47/29.54 LOG: CALL solveLinear 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear - Elapsed time: 0.000365s 29.47/29.54 29.47/29.54 LOG: CALL solveLinear 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear - Elapsed time: 0.001030s 29.47/29.54 Trying to remove transition: 10, rest remain the same}> 29.47/29.54 Solving with 1 template(s). 29.47/29.54 29.47/29.54 LOG: CALL solveNonLinearGetFirstSolution 29.47/29.54 29.47/29.54 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.470095s 29.47/29.54 Time used: 3.46916 29.47/29.54 Solving with 1 template(s). 29.47/29.54 29.47/29.54 LOG: CALL solveNonLinearGetFirstSolution 29.47/29.54 29.47/29.54 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.035210s 29.47/29.54 Time used: 0.010124 29.47/29.54 Improving Solution with cost 1 ... 29.47/29.54 29.47/29.54 LOG: CALL solveNonLinearGetNextSolution 29.47/29.54 29.47/29.54 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.041845s 29.47/29.54 Time used: 0.041833 29.47/29.54 29.47/29.54 LOG: SAT solveNonLinear - Elapsed time: 0.077055s 29.47/29.54 Cost: 1; Total time: 0.051957 29.47/29.54 Failed at location 2: arg1 <= 1 29.47/29.54 Before Improving: 29.47/29.54 Quasi-invariant at l2: arg1 <= 1 29.47/29.54 Optimizing invariants... 29.47/29.54 29.47/29.54 LOG: CALL solveLinear 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear - Elapsed time: 0.006524s 29.47/29.54 Quasi-invariant improved 29.47/29.54 29.47/29.54 LOG: CALL solveLinear 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear - Elapsed time: 0.001555s 29.47/29.54 Quasi-invariant improved 29.47/29.54 29.47/29.54 LOG: CALL solveLinear 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear - Elapsed time: 0.001133s 29.47/29.54 Remaining time after improvement: 0.995721 29.47/29.54 Termination implied by a set of quasi-invariant(s): 29.47/29.54 Quasi-invariant at l2: arg1 <= 3 29.47/29.54 [ Invariant Graph ] 29.47/29.54 Strengthening and disabling transitions... 29.47/29.54 29.47/29.54 LOG: CALL solverLinear in Graph for feasibility 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear in Graph for feasibility 29.47/29.54 It's unfeasible. Removing transition: 29.47/29.54 10, rest remain the same}> 29.47/29.54 29.47/29.54 LOG: CALL solverLinear in Graph for feasibility 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear in Graph for feasibility 29.47/29.54 It's unfeasible. Removing transition: 29.47/29.54 -1 + arg1, rest remain the same}> 29.47/29.54 29.47/29.54 LOG: CALL solverLinear in Graph for feasibility 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear in Graph for feasibility 29.47/29.54 It's unfeasible. Removing transition: 29.47/29.54 -1 + arg1, rest remain the same}> 29.47/29.54 [ Termination Graph ] 29.47/29.54 Strengthening and disabling transitions... 29.47/29.54 29.47/29.54 LOG: CALL solverLinear in Graph for feasibility 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear in Graph for feasibility 29.47/29.54 It's unfeasible. Removing transition: 29.47/29.54 10, rest remain the same}> 29.47/29.54 New Graphs: 29.47/29.54 Calling Safety with literal arg1 <= 3 and entry 29.47/29.54 29.47/29.54 LOG: CALL check - Post:arg1 <= 3 - Process 2 29.47/29.54 * Exit transition: 29.47/29.54 * Postcondition : arg1 <= 3 29.47/29.54 29.47/29.54 LOG: CALL solveLinear 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear - Elapsed time: 0.000506s 29.47/29.54 > Postcondition is not implied! 29.47/29.54 29.47/29.54 LOG: RETURN check - Elapsed time: 0.000602s 29.47/29.54 INVARIANTS: 29.47/29.54 2: 29.47/29.54 Quasi-INVARIANTS to narrow Graph: 29.47/29.54 2: arg1 <= 3 , 29.47/29.54 Narrowing transition: 29.47/29.54 10, rest remain the same}> 29.47/29.54 29.47/29.54 LOG: Narrow transition size 1 29.47/29.54 Narrowing transition: 29.47/29.54 -1 + arg1, rest remain the same}> 29.47/29.54 29.47/29.54 LOG: Narrow transition size 1 29.47/29.54 Narrowing transition: 29.47/29.54 -1 + arg1, rest remain the same}> 29.47/29.54 29.47/29.54 LOG: Narrow transition size 1 29.47/29.54 invGraph after Narrowing: 29.47/29.54 Transitions: 29.47/29.54 10, rest remain the same}> 29.47/29.54 -1 + arg1, rest remain the same}> 29.47/29.54 -1 + arg1, rest remain the same}> 29.47/29.54 Variables: 29.47/29.54 arg1 29.47/29.54 Checking conditional termination of SCC {l2}... 29.47/29.54 29.47/29.54 LOG: CALL solveLinear 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear - Elapsed time: 0.001128s 29.47/29.54 Ranking function: -1 + arg1 29.47/29.54 New Graphs: 29.47/29.54 Transitions: 29.47/29.54 10, rest remain the same}> 29.47/29.54 Variables: 29.47/29.54 arg1 29.47/29.54 Checking conditional termination of SCC {l2}... 29.47/29.54 29.47/29.54 LOG: CALL solveLinear 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear - Elapsed time: 0.000376s 29.47/29.54 29.47/29.54 LOG: CALL solveLinear 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear - Elapsed time: 0.001046s 29.47/29.54 Trying to remove transition: 10, rest remain the same}> 29.47/29.54 Solving with 1 template(s). 29.47/29.54 29.47/29.54 LOG: CALL solveNonLinearGetFirstSolution 29.47/29.54 29.47/29.54 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.479236s 29.47/29.54 Time used: 3.47844 29.47/29.54 Solving with 1 template(s). 29.47/29.54 29.47/29.54 LOG: CALL solveNonLinearGetFirstSolution 29.47/29.54 29.47/29.54 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.124210s 29.47/29.54 Time used: 0.098602 29.47/29.54 Improving Solution with cost 1 ... 29.47/29.54 29.47/29.54 LOG: CALL solveNonLinearGetNextSolution 29.47/29.54 29.47/29.54 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.406328s 29.47/29.54 Time used: 0.406265 29.47/29.54 29.47/29.54 LOG: SAT solveNonLinear - Elapsed time: 0.530538s 29.47/29.54 Cost: 1; Total time: 0.504867 29.47/29.54 Failed at location 2: arg1 <= 8 29.47/29.54 Before Improving: 29.47/29.54 Quasi-invariant at l2: arg1 <= 8 29.47/29.54 Optimizing invariants... 29.47/29.54 29.47/29.54 LOG: CALL solveLinear 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear - Elapsed time: 0.011438s 29.47/29.54 Remaining time after improvement: 0.998696 29.47/29.54 Termination implied by a set of quasi-invariant(s): 29.47/29.54 Quasi-invariant at l2: arg1 <= 8 29.47/29.54 [ Invariant Graph ] 29.47/29.54 Strengthening and disabling transitions... 29.47/29.54 29.47/29.54 LOG: CALL solverLinear in Graph for feasibility 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear in Graph for feasibility 29.47/29.54 It's unfeasible. Removing transition: 29.47/29.54 10, rest remain the same}> 29.47/29.54 29.47/29.54 LOG: CALL solverLinear in Graph for feasibility 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear in Graph for feasibility 29.47/29.54 Strengthening transition (result): 29.47/29.54 -1 + arg1, rest remain the same}> 29.47/29.54 29.47/29.54 LOG: CALL solverLinear in Graph for feasibility 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear in Graph for feasibility 29.47/29.54 It's unfeasible. Removing transition: 29.47/29.54 -1 + arg1, rest remain the same}> 29.47/29.54 [ Termination Graph ] 29.47/29.54 Strengthening and disabling transitions... 29.47/29.54 > It's unfeasible. Removing transition: 29.47/29.54 10, rest remain the same}> 29.47/29.54 New Graphs: 29.47/29.54 Calling Safety with literal arg1 <= 8 and entry 29.47/29.54 29.47/29.54 LOG: CALL check - Post:arg1 <= 8 - Process 3 29.47/29.54 * Exit transition: 29.47/29.54 * Postcondition : arg1 <= 8 29.47/29.54 29.47/29.54 LOG: CALL solveLinear 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear - Elapsed time: 0.000510s 29.47/29.54 > Postcondition is not implied! 29.47/29.54 29.47/29.54 LOG: RETURN check - Elapsed time: 0.000605s 29.47/29.54 INVARIANTS: 29.47/29.54 2: 29.47/29.54 Quasi-INVARIANTS to narrow Graph: 29.47/29.54 2: arg1 <= 8 , 29.47/29.54 Narrowing transition: 29.47/29.54 10, rest remain the same}> 29.47/29.54 29.47/29.54 LOG: Narrow transition size 1 29.47/29.54 It's unfeasible. Removing transition: 29.47/29.54 -1 + arg1, rest remain the same}> 29.47/29.54 Narrowing transition: 29.47/29.54 -1 + arg1, rest remain the same}> 29.47/29.54 29.47/29.54 LOG: Narrow transition size 1 29.47/29.54 invGraph after Narrowing: 29.47/29.54 Transitions: 29.47/29.54 10, rest remain the same}> 29.47/29.54 -1 + arg1, rest remain the same}> 29.47/29.54 Variables: 29.47/29.54 arg1 29.47/29.54 Checking conditional termination of SCC {l2}... 29.47/29.54 29.47/29.54 LOG: CALL solveLinear 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear - Elapsed time: 0.000861s 29.47/29.54 Ranking function: -10 + arg1 29.47/29.54 New Graphs: 29.47/29.54 Transitions: 29.47/29.54 10, rest remain the same}> 29.47/29.54 Variables: 29.47/29.54 arg1 29.47/29.54 Checking conditional termination of SCC {l2}... 29.47/29.54 29.47/29.54 LOG: CALL solveLinear 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear - Elapsed time: 0.000378s 29.47/29.54 29.47/29.54 LOG: CALL solveLinear 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear - Elapsed time: 0.001082s 29.47/29.54 Trying to remove transition: 10, rest remain the same}> 29.47/29.54 Solving with 1 template(s). 29.47/29.54 29.47/29.54 LOG: CALL solveNonLinearGetFirstSolution 29.47/29.54 29.47/29.54 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.436809s 29.47/29.54 Time used: 3.43602 29.47/29.54 Solving with 1 template(s). 29.47/29.54 29.47/29.54 LOG: CALL solveNonLinearGetFirstSolution 29.47/29.54 29.47/29.54 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.143419s 29.47/29.54 Time used: 0.117759 29.47/29.54 Improving Solution with cost 1 ... 29.47/29.54 29.47/29.54 LOG: CALL solveNonLinearGetNextSolution 29.47/29.54 29.47/29.54 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000885s 29.47/29.54 Time used: 1.00073 29.47/29.54 29.47/29.54 LOG: SAT solveNonLinear - Elapsed time: 1.144304s 29.47/29.54 Cost: 1; Total time: 1.11849 29.47/29.54 Failed at location 2: arg1 <= 9 29.47/29.54 Before Improving: 29.47/29.54 Quasi-invariant at l2: arg1 <= 9 29.47/29.54 Optimizing invariants... 29.47/29.54 29.47/29.54 LOG: CALL solveLinear 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear - Elapsed time: 0.014378s 29.47/29.54 Remaining time after improvement: 0.998683 29.47/29.54 Termination implied by a set of quasi-invariant(s): 29.47/29.54 Quasi-invariant at l2: arg1 <= 9 29.47/29.54 [ Invariant Graph ] 29.47/29.54 Strengthening and disabling transitions... 29.47/29.54 29.47/29.54 LOG: CALL solverLinear in Graph for feasibility 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear in Graph for feasibility 29.47/29.54 It's unfeasible. Removing transition: 29.47/29.54 10, rest remain the same}> 29.47/29.54 29.47/29.54 LOG: CALL solverLinear in Graph for feasibility 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear in Graph for feasibility 29.47/29.54 It's unfeasible. Removing transition: 29.47/29.54 -1 + arg1, rest remain the same}> 29.47/29.54 [ Termination Graph ] 29.47/29.54 Strengthening and disabling transitions... 29.47/29.54 29.47/29.54 LOG: CALL solverLinear in Graph for feasibility 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear in Graph for feasibility 29.47/29.54 It's unfeasible. Removing transition: 29.47/29.54 10, rest remain the same}> 29.47/29.54 New Graphs: 29.47/29.54 Calling Safety with literal arg1 <= 9 and entry 29.47/29.54 29.47/29.54 LOG: CALL check - Post:arg1 <= 9 - Process 4 29.47/29.54 * Exit transition: 29.47/29.54 * Postcondition : arg1 <= 9 29.47/29.54 29.47/29.54 LOG: CALL solveLinear 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear - Elapsed time: 0.001131s 29.47/29.54 > Postcondition is not implied! 29.47/29.54 29.47/29.54 LOG: RETURN check - Elapsed time: 0.001229s 29.47/29.54 INVARIANTS: 29.47/29.54 2: 29.47/29.54 Quasi-INVARIANTS to narrow Graph: 29.47/29.54 2: arg1 <= 9 , 29.47/29.54 Narrowing transition: 29.47/29.54 10, rest remain the same}> 29.47/29.54 29.47/29.54 LOG: Narrow transition size 1 29.47/29.54 Narrowing transition: 29.47/29.54 -1 + arg1, rest remain the same}> 29.47/29.54 29.47/29.54 LOG: Narrow transition size 1 29.47/29.54 invGraph after Narrowing: 29.47/29.54 Transitions: 29.47/29.54 10, rest remain the same}> 29.47/29.54 -1 + arg1, rest remain the same}> 29.47/29.54 Variables: 29.47/29.54 arg1 29.47/29.54 Checking conditional termination of SCC {l2}... 29.47/29.54 29.47/29.54 LOG: CALL solveLinear 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear - Elapsed time: 0.000886s 29.47/29.54 Ranking function: -10 + arg1 29.47/29.54 New Graphs: 29.47/29.54 Transitions: 29.47/29.54 10, rest remain the same}> 29.47/29.54 Variables: 29.47/29.54 arg1 29.47/29.54 Checking conditional termination of SCC {l2}... 29.47/29.54 29.47/29.54 LOG: CALL solveLinear 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear - Elapsed time: 0.000380s 29.47/29.54 29.47/29.54 LOG: CALL solveLinear 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear - Elapsed time: 0.001115s 29.47/29.54 Trying to remove transition: 10, rest remain the same}> 29.47/29.54 Solving with 1 template(s). 29.47/29.54 29.47/29.54 LOG: CALL solveNonLinearGetFirstSolution 29.47/29.54 29.47/29.54 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.499744s 29.47/29.54 Time used: 3.49883 29.47/29.54 Solving with 1 template(s). 29.47/29.54 29.47/29.54 LOG: CALL solveNonLinearGetFirstSolution 29.47/29.54 29.47/29.54 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.027951s 29.47/29.54 Time used: 4.00137 29.47/29.54 Solving with 2 template(s). 29.47/29.54 29.47/29.54 LOG: CALL solveNonLinearGetFirstSolution 29.47/29.54 29.47/29.54 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.037456s 29.47/29.54 Time used: 4.0017 29.47/29.54 Solving with 3 template(s). 29.47/29.54 29.47/29.54 LOG: CALL solveNonLinearGetFirstSolution 29.47/29.54 29.47/29.54 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.010540s 29.47/29.54 Time used: 1.00091 29.47/29.54 Solving with 1 template(s). 29.47/29.54 29.47/29.54 LOG: CALL solveNonLinearGetFirstSolution 29.47/29.54 29.47/29.54 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.986733s 29.47/29.54 Time used: 0.978575 29.47/29.54 29.47/29.54 Proving non-termination of subgraph 1 29.47/29.54 Transitions: 29.47/29.54 10, rest remain the same}> 29.47/29.54 -1 + arg1, rest remain the same}> 29.47/29.54 Variables: 29.47/29.54 arg1 29.47/29.54 29.47/29.54 Checking conditional non-termination of SCC {l2}... 29.47/29.54 EXIT TRANSITIONS: 29.47/29.54 29.47/29.54 29.47/29.54 Solving with 1 template(s). 29.47/29.54 29.47/29.54 LOG: CALL solveNonLinearGetFirstSolution 29.47/29.54 29.47/29.54 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.027539s 29.47/29.54 Time used: 0.027356 29.47/29.54 Improving Solution with cost 1 ... 29.47/29.54 29.47/29.54 LOG: CALL solveNonLinearGetNextSolution 29.47/29.54 29.47/29.54 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011966s 29.47/29.54 Time used: 0.011959 29.47/29.54 29.47/29.54 LOG: SAT solveNonLinear - Elapsed time: 0.039505s 29.47/29.54 Cost: 1; Total time: 0.039315 29.47/29.54 Failed at location 2: 10 <= arg1 29.47/29.54 Before Improving: 29.47/29.54 Quasi-invariant at l2: 10 <= arg1 29.47/29.54 Optimizing invariants... 29.47/29.54 29.47/29.54 LOG: CALL solveLinear 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear - Elapsed time: 0.003703s 29.47/29.54 Remaining time after improvement: 0.999054 29.47/29.54 Non-termination implied by a set of quasi-invariant(s): 29.47/29.54 Quasi-invariant at l2: 10 <= arg1 29.47/29.54 29.47/29.54 Strengthening and disabling EXIT transitions... 29.47/29.54 Closed exits from l2: 1 29.47/29.54 29.47/29.54 Strengthening and disabling transitions... 29.47/29.54 29.47/29.54 LOG: CALL solverLinear in Graph for feasibility 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear in Graph for feasibility 29.47/29.54 Strengthening transition (result): 29.47/29.54 10, rest remain the same}> 29.47/29.54 29.47/29.54 LOG: CALL solverLinear in Graph for feasibility 29.47/29.54 29.47/29.54 LOG: RETURN solveLinear in Graph for feasibility 29.47/29.54 Strengthening transition (result): 29.47/29.54 -1 + arg1, rest remain the same}> 29.47/29.54 29.47/29.54 Calling reachability with... 29.47/29.54 Transition: 29.47/29.54 Conditions: 10 <= arg1, 29.47/29.54 OPEN EXITS: 29.47/29.54 29.47/29.54 29.47/29.54 --- Reachability graph --- 29.47/29.54 > Graph without transitions. 29.47/29.54 29.47/29.54 Calling reachability with... 29.47/29.54 Transition: 29.47/29.54 Conditions: 10 <= arg1, 29.47/29.54 OPEN EXITS: 29.47/29.54 29.47/29.54 29.47/29.54 > Conditions are reachable! 29.47/29.54 29.47/29.54 Program does NOT terminate 29.47/29.54 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 29.47/29.54 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 29.47/29.54 EOF