5.62/5.72 NO 5.62/5.72 5.62/5.72 Solver Timeout: 4 5.62/5.72 Global Timeout: 300 5.62/5.72 No parsing errors! 5.62/5.72 Init Location: 0 5.62/5.72 Transitions: 5.62/5.72 5.62/5.72 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}> 5.62/5.72 3, arg2 -> undef4}> 5.62/5.72 ~(1)) /\ (arg1 < 3) /\ (arg1 < 10), par{arg1 -> (arg1 + 1), arg2 -> undef6}> 5.62/5.72 3) /\ (arg1 < 10), par{arg1 -> (arg1 + 1), arg2 -> undef8}> 5.62/5.72 undef9, arg2 -> undef10}> 5.62/5.72 5.62/5.72 Fresh variables: 5.62/5.72 undef2, undef4, undef6, undef8, undef9, undef10, 5.62/5.72 5.62/5.72 Undef variables: 5.62/5.72 undef2, undef4, undef6, undef8, undef9, undef10, 5.62/5.72 5.62/5.72 Abstraction variables: 5.62/5.72 5.62/5.72 Exit nodes: 5.62/5.72 5.62/5.72 Accepting locations: 5.62/5.72 5.62/5.72 Asserts: 5.62/5.72 5.62/5.72 Preprocessed LLVMGraph 5.62/5.72 Init Location: 0 5.62/5.72 Transitions: 5.62/5.72 0) /\ (undef10 > ~(1))> 5.62/5.72 3}> 5.62/5.72 ~(1)) /\ (arg1 < 3) /\ (arg1 < 10), par{arg1 -> (arg1 + 1)}> 5.62/5.72 3) /\ (arg1 < 10), par{arg1 -> (arg1 + 1)}> 5.62/5.72 5.62/5.72 Fresh variables: 5.62/5.72 undef2, undef4, undef6, undef8, undef9, undef10, 5.62/5.72 5.62/5.72 Undef variables: 5.62/5.72 undef2, undef4, undef6, undef8, undef9, undef10, 5.62/5.72 5.62/5.72 Abstraction variables: 5.62/5.72 5.62/5.72 Exit nodes: 5.62/5.72 5.62/5.72 Accepting locations: 5.62/5.72 5.62/5.72 Asserts: 5.62/5.72 5.62/5.72 ************************************************************* 5.62/5.72 ******************************************************************************************* 5.62/5.72 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.62/5.72 ******************************************************************************************* 5.62/5.72 5.62/5.72 Init Location: 0 5.62/5.72 Graph 0: 5.62/5.72 Transitions: 5.62/5.72 Variables: 5.62/5.72 5.62/5.72 Graph 1: 5.62/5.72 Transitions: 5.62/5.72 3, rest remain the same}> 5.62/5.72 1 + arg1, rest remain the same}> 5.62/5.72 1 + arg1, rest remain the same}> 5.62/5.72 Variables: 5.62/5.72 arg1 5.62/5.72 5.62/5.72 Precedence: 5.62/5.72 Graph 0 5.62/5.72 5.62/5.72 Graph 1 5.62/5.72 5.62/5.72 5.62/5.72 Map Locations to Subgraph: 5.62/5.72 ( 0 , 0 ) 5.62/5.72 ( 2 , 1 ) 5.62/5.72 5.62/5.72 ******************************************************************************************* 5.62/5.72 ******************************** CHECKING ASSERTIONS ******************************** 5.62/5.72 ******************************************************************************************* 5.62/5.72 5.62/5.72 Proving termination of subgraph 0 5.62/5.72 Proving termination of subgraph 1 5.62/5.72 Checking unfeasibility... 5.62/5.72 Time used: 0.004727 5.62/5.72 5.62/5.72 Checking conditional termination of SCC {l2}... 5.62/5.72 5.62/5.72 LOG: CALL solveLinear 5.62/5.72 5.62/5.72 LOG: RETURN solveLinear - Elapsed time: 0.001175s 5.62/5.72 Ranking function: 10 - 5*arg1 5.62/5.72 New Graphs: 5.62/5.72 Transitions: 5.62/5.72 3, rest remain the same}> 5.62/5.72 1 + arg1, rest remain the same}> 5.62/5.72 Variables: 5.62/5.72 arg1 5.62/5.72 Checking conditional termination of SCC {l2}... 5.62/5.72 5.62/5.72 LOG: CALL solveLinear 5.62/5.72 5.62/5.72 LOG: RETURN solveLinear - Elapsed time: 0.000791s 5.62/5.72 Ranking function: 9 - arg1 5.62/5.72 New Graphs: 5.62/5.72 Transitions: 5.62/5.72 3, rest remain the same}> 5.62/5.72 Variables: 5.62/5.72 arg1 5.62/5.72 Checking conditional termination of SCC {l2}... 5.62/5.72 5.62/5.72 LOG: CALL solveLinear 5.62/5.72 5.62/5.72 LOG: RETURN solveLinear - Elapsed time: 0.000362s 5.62/5.72 5.62/5.72 LOG: CALL solveLinear 5.62/5.72 5.62/5.72 LOG: RETURN solveLinear - Elapsed time: 0.001001s 5.62/5.72 Trying to remove transition: 3, rest remain the same}> 5.62/5.72 Solving with 1 template(s). 5.62/5.72 5.62/5.72 LOG: CALL solveNonLinearGetFirstSolution 5.62/5.72 5.62/5.72 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.112152s 5.62/5.72 Time used: 0.112026 5.62/5.72 Solving with 1 template(s). 5.62/5.72 5.62/5.72 LOG: CALL solveNonLinearGetFirstSolution 5.62/5.72 5.62/5.72 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.036098s 5.62/5.72 Time used: 0.035409 5.62/5.72 Improving Solution with cost 1 ... 5.62/5.72 5.62/5.72 LOG: CALL solveNonLinearGetNextSolution 5.62/5.72 5.62/5.72 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.029952s 5.62/5.72 Time used: 0.029807 5.62/5.72 5.62/5.72 LOG: SAT solveNonLinear - Elapsed time: 0.066050s 5.62/5.72 Cost: 1; Total time: 0.065216 5.62/5.72 Failed at location 2: 4 <= arg1 5.62/5.72 Before Improving: 5.62/5.72 Quasi-invariant at l2: 4 <= arg1 5.62/5.72 Optimizing invariants... 5.62/5.72 5.62/5.72 LOG: CALL solveLinear 5.62/5.72 5.62/5.72 LOG: RETURN solveLinear - Elapsed time: 0.003939s 5.62/5.72 Remaining time after improvement: 0.998837 5.62/5.72 Termination implied by a set of quasi-invariant(s): 5.62/5.72 Quasi-invariant at l2: 4 <= arg1 5.62/5.73 [ Invariant Graph ] 5.62/5.73 Strengthening and disabling transitions... 5.62/5.73 5.62/5.73 LOG: CALL solverLinear in Graph for feasibility 5.62/5.73 5.62/5.73 LOG: RETURN solveLinear in Graph for feasibility 5.62/5.73 It's unfeasible. Removing transition: 5.62/5.73 3, rest remain the same}> 5.62/5.73 5.62/5.73 LOG: CALL solverLinear in Graph for feasibility 5.62/5.73 5.62/5.73 LOG: RETURN solveLinear in Graph for feasibility 5.62/5.73 It's unfeasible. Removing transition: 5.62/5.73 1 + arg1, rest remain the same}> 5.62/5.73 5.62/5.73 LOG: CALL solverLinear in Graph for feasibility 5.62/5.73 5.62/5.73 LOG: RETURN solveLinear in Graph for feasibility 5.62/5.73 Strengthening transition (result): 5.62/5.73 1 + arg1, rest remain the same}> 5.62/5.73 [ Termination Graph ] 5.62/5.73 Strengthening and disabling transitions... 5.62/5.73 5.62/5.73 LOG: CALL solverLinear in Graph for feasibility 5.62/5.73 5.62/5.73 LOG: RETURN solveLinear in Graph for feasibility 5.62/5.73 It's unfeasible. Removing transition: 5.62/5.73 3, rest remain the same}> 5.62/5.73 New Graphs: 5.62/5.73 Calling Safety with literal 4 <= arg1 and entry 5.62/5.73 5.62/5.73 LOG: CALL check - Post:4 <= arg1 - Process 1 5.62/5.73 * Exit transition: 5.62/5.73 * Postcondition : 4 <= arg1 5.62/5.73 5.62/5.73 LOG: CALL solveLinear 5.62/5.73 5.62/5.73 LOG: RETURN solveLinear - Elapsed time: 0.000439s 5.62/5.73 > Postcondition is not implied! 5.62/5.73 5.62/5.73 LOG: RETURN check - Elapsed time: 0.000533s 5.62/5.73 INVARIANTS: 5.62/5.73 2: 5.62/5.73 Quasi-INVARIANTS to narrow Graph: 5.62/5.73 2: 4 <= arg1 , 5.62/5.73 Narrowing transition: 5.62/5.73 3, rest remain the same}> 5.62/5.73 5.62/5.73 LOG: Narrow transition size 1 5.62/5.73 Narrowing transition: 5.62/5.73 1 + arg1, rest remain the same}> 5.62/5.73 5.62/5.73 LOG: Narrow transition size 1 5.62/5.73 It's unfeasible. Removing transition: 5.62/5.73 1 + arg1, rest remain the same}> 5.62/5.73 invGraph after Narrowing: 5.62/5.73 Transitions: 5.62/5.73 3, rest remain the same}> 5.62/5.73 1 + arg1, rest remain the same}> 5.62/5.73 Variables: 5.62/5.73 arg1 5.62/5.73 Checking conditional termination of SCC {l2}... 5.62/5.73 5.62/5.73 LOG: CALL solveLinear 5.62/5.73 5.62/5.73 LOG: RETURN solveLinear - Elapsed time: 0.000826s 5.62/5.73 Ranking function: 8 - 4*arg1 5.62/5.73 New Graphs: 5.62/5.73 Transitions: 5.62/5.73 3, rest remain the same}> 5.62/5.73 Variables: 5.62/5.73 arg1 5.62/5.73 Checking conditional termination of SCC {l2}... 5.62/5.73 5.62/5.73 LOG: CALL solveLinear 5.62/5.73 5.62/5.73 LOG: RETURN solveLinear - Elapsed time: 0.000363s 5.62/5.73 5.62/5.73 LOG: CALL solveLinear 5.62/5.73 5.62/5.73 LOG: RETURN solveLinear - Elapsed time: 0.001030s 5.62/5.73 Trying to remove transition: 3, rest remain the same}> 5.62/5.73 Solving with 1 template(s). 5.62/5.73 5.62/5.73 LOG: CALL solveNonLinearGetFirstSolution 5.62/5.73 5.62/5.73 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.111382s 5.62/5.73 Time used: 0.111248 5.62/5.73 Solving with 1 template(s). 5.62/5.73 5.62/5.73 LOG: CALL solveNonLinearGetFirstSolution 5.62/5.73 5.62/5.73 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.259586s 5.62/5.73 Time used: 0.258944 5.62/5.73 Solving with 2 template(s). 5.62/5.73 5.62/5.73 LOG: CALL solveNonLinearGetFirstSolution 5.62/5.73 5.62/5.73 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001841s 5.62/5.73 Time used: 4.00039 5.62/5.73 Solving with 3 template(s). 5.62/5.73 5.62/5.73 LOG: CALL solveNonLinearGetFirstSolution 5.62/5.73 5.62/5.73 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005805s 5.62/5.73 Time used: 1.00036 5.62/5.73 Solving with 1 template(s). 5.62/5.73 5.62/5.73 LOG: CALL solveNonLinearGetFirstSolution 5.62/5.73 5.62/5.73 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.047334s 5.62/5.73 Time used: 0.041859 5.62/5.73 5.62/5.73 Proving non-termination of subgraph 1 5.62/5.73 Transitions: 5.62/5.73 3, rest remain the same}> 5.62/5.73 1 + arg1, rest remain the same}> 5.62/5.73 Variables: 5.62/5.73 arg1 5.62/5.73 5.62/5.73 Checking conditional non-termination of SCC {l2}... 5.62/5.73 EXIT TRANSITIONS: 5.62/5.73 5.62/5.73 5.62/5.73 5.62/5.73 Solving with 1 template(s). 5.62/5.73 5.62/5.73 LOG: CALL solveNonLinearGetFirstSolution 5.62/5.73 5.62/5.73 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006207s 5.62/5.73 Time used: 0.006026 5.62/5.73 Improving Solution with cost 1 ... 5.62/5.73 5.62/5.73 LOG: CALL solveNonLinearGetNextSolution 5.62/5.73 5.62/5.73 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009905s 5.62/5.73 Time used: 0.009899 5.62/5.73 5.62/5.73 LOG: SAT solveNonLinear - Elapsed time: 0.016112s 5.62/5.73 Cost: 1; Total time: 0.015925 5.62/5.73 Non-termination implied by a set of quasi-invariant(s): 5.62/5.73 Quasi-invariant at l2: 0 <= arg1 5.62/5.73 5.62/5.73 Strengthening and disabling EXIT transitions... 5.62/5.73 Closed exits from l2: 1 5.62/5.73 Strengthening exit transition (result): 5.62/5.73 5.62/5.73 5.62/5.73 Strengthening and disabling transitions... 5.62/5.73 5.62/5.73 LOG: CALL solverLinear in Graph for feasibility 5.62/5.73 5.62/5.73 LOG: RETURN solveLinear in Graph for feasibility 5.62/5.73 Strengthening transition (result): 5.62/5.73 3, rest remain the same}> 5.62/5.73 5.62/5.73 LOG: CALL solverLinear in Graph for feasibility 5.62/5.73 5.62/5.73 LOG: RETURN solveLinear in Graph for feasibility 5.62/5.73 Strengthening transition (result): 5.62/5.73 1 + arg1, rest remain the same}> 5.62/5.73 5.62/5.73 Checking conditional non-termination of SCC {l2}... 5.62/5.73 EXIT TRANSITIONS: 5.62/5.73 5.62/5.73 5.62/5.73 Solving with 1 template(s). 5.62/5.73 5.62/5.73 LOG: CALL solveNonLinearGetFirstSolution 5.62/5.73 5.62/5.73 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011190s 5.62/5.73 Time used: 0.011019 5.62/5.73 Improving Solution with cost 1 ... 5.62/5.73 5.62/5.73 LOG: CALL solveNonLinearGetNextSolution 5.62/5.73 5.62/5.73 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.007509s 5.62/5.73 Time used: 0.007504 5.62/5.73 5.62/5.73 LOG: SAT solveNonLinear - Elapsed time: 0.018699s 5.62/5.73 Cost: 1; Total time: 0.018523 5.62/5.73 Failed at location 2: arg1 <= 3 5.62/5.73 Before Improving: 5.62/5.73 Quasi-invariant at l2: arg1 <= 3 5.62/5.73 Optimizing invariants... 5.62/5.73 5.62/5.73 LOG: CALL solveLinear 5.62/5.73 5.62/5.73 LOG: RETURN solveLinear - Elapsed time: 0.001680s 5.62/5.73 Remaining time after improvement: 0.999209 5.62/5.73 Non-termination implied by a set of quasi-invariant(s): 5.62/5.73 Quasi-invariant at l2: arg1 <= 3 5.62/5.73 5.62/5.73 Strengthening and disabling EXIT transitions... 5.62/5.73 Closed exits from l2: 1 5.62/5.73 5.62/5.73 Strengthening and disabling transitions... 5.62/5.73 5.62/5.73 LOG: CALL solverLinear in Graph for feasibility 5.62/5.73 5.62/5.73 LOG: RETURN solveLinear in Graph for feasibility 5.62/5.73 Strengthening transition (result): 5.62/5.73 3, rest remain the same}> 5.62/5.73 5.62/5.73 LOG: CALL solverLinear in Graph for feasibility 5.62/5.73 5.62/5.73 LOG: RETURN solveLinear in Graph for feasibility 5.62/5.73 Strengthening transition (result): 5.62/5.73 1 + arg1, rest remain the same}> 5.62/5.73 5.62/5.73 Calling reachability with... 5.62/5.73 Transition: 5.62/5.73 Conditions: 0 <= arg1, arg1 <= 3, 5.62/5.73 OPEN EXITS: 5.62/5.73 5.62/5.73 5.62/5.73 --- Reachability graph --- 5.62/5.73 > Graph without transitions. 5.62/5.73 5.62/5.73 Calling reachability with... 5.62/5.73 Transition: 5.62/5.73 Conditions: 0 <= arg1, arg1 <= 3, 5.62/5.73 OPEN EXITS: 5.62/5.73 5.62/5.73 5.62/5.73 > Conditions are reachable! 5.62/5.73 5.62/5.73 Program does NOT terminate 5.62/5.73 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 5.62/5.73 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 5.62/5.73 EOF