25.20/25.39 NO 25.20/25.39 25.20/25.39 Solver Timeout: 4 25.20/25.39 Global Timeout: 300 25.20/25.39 No parsing errors! 25.20/25.39 Init Location: 0 25.20/25.39 Transitions: 25.20/25.39 25.20/25.39 ~(1)) /\ (arg1 > 0), par{arg1 -> (arg2 - 5), arg2 -> undef2}> 25.20/25.39 (arg1 - 1), arg2 -> undef4}> 25.20/25.39 1) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg2 -> undef6}> 25.20/25.39 (arg1 - 1), arg2 -> undef8}> 25.20/25.39 1) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg2 -> undef10}> 25.20/25.39 undef11, arg2 -> undef12}> 25.20/25.39 25.20/25.39 Fresh variables: 25.20/25.39 undef2, undef4, undef6, undef8, undef10, undef11, undef12, 25.20/25.39 25.20/25.39 Undef variables: 25.20/25.39 undef2, undef4, undef6, undef8, undef10, undef11, undef12, 25.20/25.39 25.20/25.39 Abstraction variables: 25.20/25.39 25.20/25.39 Exit nodes: 25.20/25.39 25.20/25.39 Accepting locations: 25.20/25.39 25.20/25.39 Asserts: 25.20/25.39 25.20/25.39 Preprocessed LLVMGraph 25.20/25.39 Init Location: 0 25.20/25.39 Transitions: 25.20/25.39 ~(1)) /\ (undef11 > 0)> 25.20/25.39 ((arg1 - 1) - 1)}> 25.20/25.39 1) /\ ((arg1 - 1) < arg1) /\ ((arg1 - 1) > 1) /\ (((arg1 - 1) - 1) < (arg1 - 1)), par{arg1 -> ((arg1 - 1) - 1)}> 25.20/25.39 25.20/25.39 Fresh variables: 25.20/25.39 undef2, undef4, undef6, undef8, undef10, undef11, undef12, 25.20/25.39 25.20/25.39 Undef variables: 25.20/25.39 undef2, undef4, undef6, undef8, undef10, undef11, undef12, 25.20/25.39 25.20/25.39 Abstraction variables: 25.20/25.39 25.20/25.39 Exit nodes: 25.20/25.39 25.20/25.39 Accepting locations: 25.20/25.39 25.20/25.39 Asserts: 25.20/25.39 25.20/25.39 ************************************************************* 25.20/25.39 ******************************************************************************************* 25.20/25.39 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 25.20/25.39 ******************************************************************************************* 25.20/25.39 25.20/25.39 Init Location: 0 25.20/25.39 Graph 0: 25.20/25.39 Transitions: 25.20/25.39 Variables: 25.20/25.39 25.20/25.39 Graph 1: 25.20/25.39 Transitions: 25.20/25.39 -2 + arg1, rest remain the same}> 25.20/25.39 -2 + arg1, rest remain the same}> 25.20/25.39 Variables: 25.20/25.39 arg1 25.20/25.39 25.20/25.39 Precedence: 25.20/25.39 Graph 0 25.20/25.39 25.20/25.39 Graph 1 25.20/25.39 25.20/25.39 25.20/25.39 Map Locations to Subgraph: 25.20/25.39 ( 0 , 0 ) 25.20/25.39 ( 2 , 1 ) 25.20/25.39 25.20/25.39 ******************************************************************************************* 25.20/25.39 ******************************** CHECKING ASSERTIONS ******************************** 25.20/25.39 ******************************************************************************************* 25.20/25.39 25.20/25.39 Proving termination of subgraph 0 25.20/25.39 Proving termination of subgraph 1 25.20/25.39 Checking unfeasibility... 25.20/25.39 Time used: 0.009535 25.20/25.39 25.20/25.39 Checking conditional termination of SCC {l2}... 25.20/25.39 25.20/25.39 LOG: CALL solveLinear 25.20/25.39 25.20/25.39 LOG: RETURN solveLinear - Elapsed time: 0.000903s 25.20/25.39 Ranking function: (~(3) / 2) + (1 / 2)*arg1 25.20/25.39 New Graphs: 25.20/25.39 Transitions: 25.20/25.39 -2 + arg1, rest remain the same}> 25.20/25.39 Variables: 25.20/25.39 arg1 25.20/25.39 Checking conditional termination of SCC {l2}... 25.20/25.39 25.20/25.39 LOG: CALL solveLinear 25.20/25.39 25.20/25.39 LOG: RETURN solveLinear - Elapsed time: 0.000372s 25.20/25.39 25.20/25.39 LOG: CALL solveLinear 25.20/25.39 25.20/25.39 LOG: RETURN solveLinear - Elapsed time: 0.001123s 25.20/25.39 Trying to remove transition: -2 + arg1, rest remain the same}> 25.20/25.39 Solving with 1 template(s). 25.20/25.39 25.20/25.39 LOG: CALL solveNonLinearGetFirstSolution 25.20/25.39 25.20/25.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004024s 25.20/25.39 Time used: 0.003901 25.20/25.39 Solving with 1 template(s). 25.20/25.39 25.20/25.39 LOG: CALL solveNonLinearGetFirstSolution 25.20/25.39 25.20/25.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009287s 25.20/25.39 Time used: 0.008971 25.20/25.39 Improving Solution with cost 1 ... 25.20/25.39 25.20/25.39 LOG: CALL solveNonLinearGetNextSolution 25.20/25.39 25.20/25.39 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000884s 25.20/25.39 Time used: 1.00047 25.20/25.39 25.20/25.39 LOG: SAT solveNonLinear - Elapsed time: 1.010171s 25.20/25.39 Cost: 1; Total time: 1.00944 25.20/25.39 Failed at location 2: 1 <= arg1 25.20/25.39 Before Improving: 25.20/25.39 Quasi-invariant at l2: 1 <= arg1 25.20/25.39 Optimizing invariants... 25.20/25.39 25.20/25.39 LOG: CALL solveLinear 25.20/25.39 25.20/25.39 LOG: RETURN solveLinear - Elapsed time: 0.007650s 25.20/25.39 Remaining time after improvement: 0.998813 25.20/25.39 Termination implied by a set of quasi-invariant(s): 25.20/25.39 Quasi-invariant at l2: 1 <= arg1 25.20/25.39 [ Invariant Graph ] 25.20/25.39 Strengthening and disabling transitions... 25.20/25.39 25.20/25.39 LOG: CALL solverLinear in Graph for feasibility 25.20/25.39 25.20/25.39 LOG: RETURN solveLinear in Graph for feasibility 25.20/25.39 It's unfeasible. Removing transition: 25.20/25.39 -2 + arg1, rest remain the same}> 25.20/25.39 25.20/25.39 LOG: CALL solverLinear in Graph for feasibility 25.20/25.39 25.20/25.39 LOG: RETURN solveLinear in Graph for feasibility 25.20/25.39 Strengthening transition (result): 25.20/25.39 -2 + arg1, rest remain the same}> 25.20/25.39 [ Termination Graph ] 25.20/25.39 Strengthening and disabling transitions... 25.20/25.39 > It's unfeasible. Removing transition: 25.20/25.39 -2 + arg1, rest remain the same}> 25.20/25.39 New Graphs: 25.20/25.39 Calling Safety with literal 1 <= arg1 and entry 25.20/25.39 25.20/25.39 LOG: CALL check - Post:1 <= arg1 - Process 1 25.20/25.39 * Exit transition: 25.20/25.39 * Postcondition : 1 <= arg1 25.20/25.39 25.20/25.39 LOG: CALL solveLinear 25.20/25.39 25.20/25.39 LOG: RETURN solveLinear - Elapsed time: 0.000478s 25.20/25.39 > Postcondition is not implied! 25.20/25.39 25.20/25.39 LOG: RETURN check - Elapsed time: 0.000571s 25.20/25.39 INVARIANTS: 25.20/25.39 2: 25.20/25.39 Quasi-INVARIANTS to narrow Graph: 25.20/25.39 2: 1 <= arg1 , 25.20/25.39 Narrowing transition: 25.20/25.39 -2 + arg1, rest remain the same}> 25.20/25.39 25.20/25.39 LOG: Narrow transition size 1 25.20/25.39 It's unfeasible. Removing transition: 25.20/25.39 -2 + arg1, rest remain the same}> 25.20/25.39 invGraph after Narrowing: 25.20/25.39 Transitions: 25.20/25.39 -2 + arg1, rest remain the same}> 25.20/25.39 Variables: 25.20/25.39 arg1 25.20/25.39 Checking conditional termination of SCC {l2}... 25.20/25.39 25.20/25.39 LOG: CALL solveLinear 25.20/25.39 25.20/25.39 LOG: RETURN solveLinear - Elapsed time: 0.000381s 25.20/25.39 25.20/25.39 LOG: CALL solveLinear 25.20/25.39 25.20/25.39 LOG: RETURN solveLinear - Elapsed time: 0.001145s 25.20/25.39 Trying to remove transition: -2 + arg1, rest remain the same}> 25.20/25.39 Solving with 1 template(s). 25.20/25.39 25.20/25.39 LOG: CALL solveNonLinearGetFirstSolution 25.20/25.39 25.20/25.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004153s 25.20/25.39 Time used: 0.004028 25.20/25.39 Solving with 1 template(s). 25.20/25.39 25.20/25.39 LOG: CALL solveNonLinearGetFirstSolution 25.20/25.39 25.20/25.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005154s 25.20/25.39 Time used: 0.004891 25.20/25.39 Improving Solution with cost 1 ... 25.20/25.39 25.20/25.39 LOG: CALL solveNonLinearGetNextSolution 25.20/25.39 25.20/25.39 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000536s 25.20/25.39 Time used: 1.00042 25.20/25.39 25.20/25.39 LOG: SAT solveNonLinear - Elapsed time: 1.005690s 25.20/25.39 Cost: 1; Total time: 1.00531 25.20/25.39 Failed at location 2: 0 <= arg1 25.20/25.39 Before Improving: 25.20/25.39 Quasi-invariant at l2: 0 <= arg1 25.20/25.39 Optimizing invariants... 25.20/25.39 25.20/25.39 LOG: CALL solveLinear 25.20/25.39 25.20/25.39 LOG: RETURN solveLinear - Elapsed time: 0.006339s 25.20/25.39 Remaining time after improvement: 0.998818 25.20/25.39 Termination implied by a set of quasi-invariant(s): 25.20/25.39 Quasi-invariant at l2: 0 <= arg1 25.20/25.39 [ Invariant Graph ] 25.20/25.39 Strengthening and disabling transitions... 25.20/25.39 25.20/25.39 LOG: CALL solverLinear in Graph for feasibility 25.20/25.39 25.20/25.39 LOG: RETURN solveLinear in Graph for feasibility 25.20/25.39 It's unfeasible. Removing transition: 25.20/25.39 -2 + arg1, rest remain the same}> 25.20/25.39 [ Termination Graph ] 25.20/25.39 Strengthening and disabling transitions... 25.20/25.39 > It's unfeasible. Removing transition: 25.20/25.39 -2 + arg1, rest remain the same}> 25.20/25.39 New Graphs: 25.20/25.39 Calling Safety with literal 0 <= arg1 and entry 25.20/25.39 25.20/25.39 LOG: CALL check - Post:0 <= arg1 - Process 2 25.20/25.39 * Exit transition: 25.20/25.39 * Postcondition : 0 <= arg1 25.20/25.39 25.20/25.39 LOG: CALL solveLinear 25.20/25.39 25.20/25.39 LOG: RETURN solveLinear - Elapsed time: 0.000625s 25.20/25.39 > Postcondition is not implied! 25.20/25.39 25.20/25.39 LOG: RETURN check - Elapsed time: 0.000723s 25.20/25.39 INVARIANTS: 25.20/25.39 2: 25.20/25.39 Quasi-INVARIANTS to narrow Graph: 25.20/25.39 2: 0 <= arg1 , 25.20/25.39 Narrowing transition: 25.20/25.39 -2 + arg1, rest remain the same}> 25.20/25.39 25.20/25.39 LOG: Narrow transition size 1 25.20/25.39 invGraph after Narrowing: 25.20/25.39 Transitions: 25.20/25.39 -2 + arg1, rest remain the same}> 25.20/25.39 Variables: 25.20/25.39 arg1 25.20/25.39 Checking conditional termination of SCC {l2}... 25.20/25.39 25.20/25.39 LOG: CALL solveLinear 25.20/25.39 25.20/25.39 LOG: RETURN solveLinear - Elapsed time: 0.000407s 25.20/25.39 25.20/25.39 LOG: CALL solveLinear 25.20/25.39 25.20/25.39 LOG: RETURN solveLinear - Elapsed time: 0.001198s 25.20/25.39 Trying to remove transition: -2 + arg1, rest remain the same}> 25.20/25.39 Solving with 1 template(s). 25.20/25.39 25.20/25.39 LOG: CALL solveNonLinearGetFirstSolution 25.20/25.39 25.20/25.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004324s 25.20/25.39 Time used: 0.0042 25.20/25.39 Solving with 1 template(s). 25.20/25.39 25.20/25.39 LOG: CALL solveNonLinearGetFirstSolution 25.20/25.39 25.20/25.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.130016s 25.20/25.39 Time used: 4.00091 25.20/25.39 Solving with 2 template(s). 25.20/25.39 25.20/25.39 LOG: CALL solveNonLinearGetFirstSolution 25.20/25.39 25.20/25.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005910s 25.20/25.39 Time used: 4.00082 25.20/25.39 Solving with 3 template(s). 25.20/25.39 25.20/25.39 LOG: CALL solveNonLinearGetFirstSolution 25.20/25.39 25.20/25.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.008960s 25.20/25.39 Time used: 1.00069 25.20/25.39 Solving with 1 template(s). 25.20/25.39 25.20/25.39 LOG: CALL solveNonLinearGetFirstSolution 25.20/25.39 25.20/25.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010461s 25.20/25.39 Time used: 0.006091 25.20/25.39 Improving Solution with cost 1 ... 25.20/25.39 25.20/25.39 LOG: CALL solveNonLinearGetNextSolution 25.20/25.39 25.20/25.39 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000892s 25.20/25.39 Time used: 1.00076 25.20/25.39 25.20/25.39 LOG: SAT solveNonLinear - Elapsed time: 1.011353s 25.20/25.39 Cost: 1; Total time: 1.00685 25.20/25.39 Termination implied by a set of invariant(s): 25.20/25.39 Invariant at l2: arg1 <= 0 25.20/25.39 [ Invariant Graph ] 25.20/25.39 Strengthening and disabling transitions... 25.20/25.39 25.20/25.39 LOG: CALL solverLinear in Graph for feasibility 25.20/25.39 25.20/25.39 LOG: RETURN solveLinear in Graph for feasibility 25.20/25.39 Strengthening transition (result): 25.20/25.39 -2 + arg1, rest remain the same}> 25.20/25.39 [ Termination Graph ] 25.20/25.39 Strengthening and disabling transitions... 25.20/25.39 25.20/25.39 LOG: CALL solverLinear in Graph for feasibility 25.20/25.39 25.20/25.39 LOG: RETURN solveLinear in Graph for feasibility 25.20/25.39 Strengthening transition (result): 25.20/25.39 -2 + arg1, rest remain the same}> 25.20/25.39 Quasi-ranking function: 50000 + arg1 25.20/25.39 New Graphs: 25.20/25.39 Transitions: 25.20/25.39 -2 + arg1, rest remain the same}> 25.20/25.39 Variables: 25.20/25.39 arg1 25.20/25.39 Checking conditional termination of SCC {l2}... 25.20/25.39 25.20/25.39 LOG: CALL solveLinear 25.20/25.39 25.20/25.39 LOG: RETURN solveLinear - Elapsed time: 0.000458s 25.20/25.39 25.20/25.39 LOG: CALL solveLinear 25.20/25.39 25.20/25.39 LOG: RETURN solveLinear - Elapsed time: 0.001394s 25.20/25.39 Trying to remove transition: -2 + arg1, rest remain the same}> 25.20/25.39 Solving with 1 template(s). 25.20/25.39 25.20/25.39 LOG: CALL solveNonLinearGetFirstSolution 25.20/25.39 25.20/25.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005326s 25.20/25.39 Time used: 0.005197 25.20/25.39 Solving with 1 template(s). 25.20/25.39 25.20/25.39 LOG: CALL solveNonLinearGetFirstSolution 25.20/25.39 25.20/25.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006506s 25.20/25.39 Time used: 4.00527 25.20/25.39 Solving with 2 template(s). 25.20/25.39 25.20/25.39 LOG: CALL solveNonLinearGetFirstSolution 25.20/25.39 25.20/25.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007467s 25.20/25.39 Time used: 4.00111 25.20/25.39 Solving with 3 template(s). 25.20/25.39 25.20/25.39 LOG: CALL solveNonLinearGetFirstSolution 25.20/25.39 25.20/25.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.009960s 25.20/25.39 Time used: 1.00126 25.20/25.39 Solving with 1 template(s). 25.20/25.39 25.20/25.39 LOG: CALL solveNonLinearGetFirstSolution 25.20/25.39 25.20/25.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007463s 25.20/25.39 Time used: 4.00201 25.20/25.39 25.20/25.39 Proving non-termination of subgraph 1 25.20/25.39 Transitions: 25.20/25.39 -2 + arg1, rest remain the same}> 25.20/25.39 Variables: 25.20/25.39 arg1 25.20/25.39 25.20/25.39 Checking conditional non-termination of SCC {l2}... 25.20/25.39 EXIT TRANSITIONS: 25.20/25.39 25.20/25.39 25.20/25.39 Solving with 1 template(s). 25.20/25.39 25.20/25.39 LOG: CALL solveNonLinearGetFirstSolution 25.20/25.39 25.20/25.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004134s 25.20/25.39 Time used: 0.003977 25.20/25.39 Improving Solution with cost 1 ... 25.20/25.39 25.20/25.39 LOG: CALL solveNonLinearGetNextSolution 25.20/25.39 25.20/25.39 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.005284s 25.20/25.39 Time used: 0.005278 25.20/25.39 25.20/25.39 LOG: SAT solveNonLinear - Elapsed time: 0.009418s 25.20/25.39 Cost: 1; Total time: 0.009255 25.20/25.39 Failed at location 2: 1 + arg1 <= 0 25.20/25.39 Before Improving: 25.20/25.39 Quasi-invariant at l2: 1 + arg1 <= 0 25.20/25.39 Optimizing invariants... 25.20/25.39 25.20/25.39 LOG: CALL solveLinear 25.20/25.39 25.20/25.39 LOG: RETURN solveLinear - Elapsed time: 0.001734s 25.20/25.39 Remaining time after improvement: 0.998983 25.20/25.39 Non-termination implied by a set of quasi-invariant(s): 25.20/25.39 Quasi-invariant at l2: 1 + arg1 <= 0 25.20/25.39 25.20/25.39 Strengthening and disabling EXIT transitions... 25.20/25.39 Closed exits from l2: 1 25.20/25.39 25.20/25.39 Strengthening and disabling transitions... 25.20/25.39 25.20/25.39 LOG: CALL solverLinear in Graph for feasibility 25.20/25.39 25.20/25.39 LOG: RETURN solveLinear in Graph for feasibility 25.20/25.39 Strengthening transition (result): 25.20/25.39 -2 + arg1, rest remain the same}> 25.20/25.39 25.20/25.39 Calling reachability with... 25.20/25.39 Transition: 25.20/25.39 Conditions: 1 + arg1 <= 0, 25.20/25.39 OPEN EXITS: 25.20/25.39 25.20/25.39 25.20/25.39 --- Reachability graph --- 25.20/25.39 > Graph without transitions. 25.20/25.39 25.20/25.39 Calling reachability with... 25.20/25.39 Transition: 25.20/25.39 Conditions: 1 + arg1 <= 0, 25.20/25.39 OPEN EXITS: 25.20/25.39 25.20/25.39 25.20/25.39 > Conditions are reachable! 25.20/25.39 25.20/25.39 Program does NOT terminate 25.20/25.39 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 25.20/25.39 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 25.20/25.39 EOF