0.00/0.13 YES 0.00/0.13 0.00/0.13 Solver Timeout: 4 0.00/0.13 Global Timeout: 300 0.00/0.13 No parsing errors! 0.00/0.13 Init Location: 0 0.00/0.13 Transitions: 0.00/0.13 0.00/0.13 0) /\ (arg2 > ~(1)), par{arg1 -> (arg2 - 1), arg3 -> 0, arg4 -> undef4}> 0.00/0.13 0) /\ (undef7 > arg3) /\ (arg3 > 0), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg3 -> undef7, arg4 -> undef8}> 0.00/0.13 0), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg3 -> 1, arg4 -> undef12}> 0.00/0.13 0), par{arg1 -> 0, arg2 -> arg3, arg4 -> 0}> 0.00/0.13 0) /\ (arg4 > 0) /\ (arg3 > 0) /\ (undef17 > arg1) /\ (arg2 > arg1) /\ (undef19 < arg3) /\ (undef20 < arg4) /\ (undef21 > arg1), par{arg1 -> undef17, arg3 -> undef19, arg4 -> undef20}> 0.00/0.13 0) /\ (undef26 > undef25) /\ (undef26 > ~(1)) /\ (arg2 = arg3), par{arg1 -> 1, arg2 -> undef23, arg3 -> undef24, arg4 -> undef25}> 0.00/0.13 undef27, arg2 -> undef28, arg3 -> undef29, arg4 -> undef30}> 0.00/0.13 0.00/0.13 Fresh variables: 0.00/0.13 undef4, undef7, undef8, undef12, undef17, undef19, undef20, undef21, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, 0.00/0.13 0.00/0.13 Undef variables: 0.00/0.13 undef4, undef7, undef8, undef12, undef17, undef19, undef20, undef21, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, 0.00/0.13 0.00/0.13 Abstraction variables: 0.00/0.13 0.00/0.13 Exit nodes: 0.00/0.13 0.00/0.13 Accepting locations: 0.00/0.13 0.00/0.13 Asserts: 0.00/0.13 0.00/0.13 Preprocessed LLVMGraph 0.00/0.13 Init Location: 0 0.00/0.13 Transitions: 0.00/0.13 0) /\ (undef28 > ~(1))> 0.00/0.13 0) /\ (undef7 > arg3) /\ (arg3 > 0), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg3 -> undef7, arg4 -> undef8}> 0.00/0.13 0), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg3 -> 1, arg4 -> undef12}> 0.00/0.13 0), par{arg1 -> 0, arg2 -> arg3, arg4 -> 0}> 0.00/0.13 0) /\ (arg4 > 0) /\ (arg3 > 0) /\ (undef17 > arg1) /\ (arg2 > arg1) /\ (undef19 < arg3) /\ (undef20 < arg4) /\ (undef21 > arg1), par{arg1 -> undef17, arg3 -> undef19, arg4 -> undef20}> 0.00/0.13 0) /\ (undef26 > undef25) /\ (undef26 > ~(1)) /\ (arg2 = arg3), par{arg1 -> 1, arg2 -> undef23, arg3 -> undef24, arg4 -> undef25}> 0.00/0.13 0.00/0.13 Fresh variables: 0.00/0.13 undef4, undef7, undef8, undef12, undef17, undef19, undef20, undef21, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, 0.00/0.13 0.00/0.13 Undef variables: 0.00/0.13 undef4, undef7, undef8, undef12, undef17, undef19, undef20, undef21, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, 0.00/0.13 0.00/0.13 Abstraction variables: 0.00/0.13 0.00/0.13 Exit nodes: 0.00/0.13 0.00/0.13 Accepting locations: 0.00/0.13 0.00/0.13 Asserts: 0.00/0.13 0.00/0.13 ************************************************************* 0.00/0.13 ******************************************************************************************* 0.00/0.13 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.13 ******************************************************************************************* 0.00/0.13 0.00/0.13 Init Location: 0 0.00/0.13 Graph 0: 0.00/0.13 Transitions: 0.00/0.13 Variables: 0.00/0.13 0.00/0.13 Graph 1: 0.00/0.13 Transitions: 0.00/0.13 -1 + arg1, arg2 -> arg1, arg3 -> undef7, arg4 -> undef8, rest remain the same}> 0.00/0.13 -1 + arg1, arg2 -> arg1, arg3 -> 1, arg4 -> undef12, rest remain the same}> 0.00/0.13 Variables: 0.00/0.13 arg1, arg2, arg3, arg4 0.00/0.13 0.00/0.13 Graph 2: 0.00/0.13 Transitions: 0.00/0.13 undef17, arg3 -> undef19, arg4 -> undef20, rest remain the same}> 0.00/0.13 1, arg2 -> undef23, arg3 -> undef24, arg4 -> undef25, rest remain the same}> 0.00/0.13 Variables: 0.00/0.13 arg1, arg2, arg3, arg4 0.00/0.13 0.00/0.13 Precedence: 0.00/0.13 Graph 0 0.00/0.13 0.00/0.13 Graph 1 0.00/0.13 0.00/0.13 0.00/0.13 Graph 2 0.00/0.13 0, arg2 -> arg3, arg4 -> 0, rest remain the same}> 0.00/0.13 0.00/0.13 Map Locations to Subgraph: 0.00/0.13 ( 0 , 0 ) 0.00/0.13 ( 2 , 1 ) 0.00/0.13 ( 3 , 2 ) 0.00/0.13 0.00/0.13 ******************************************************************************************* 0.00/0.13 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.13 ******************************************************************************************* 0.00/0.13 0.00/0.13 Proving termination of subgraph 0 0.00/0.13 Proving termination of subgraph 1 0.00/0.13 Checking unfeasibility... 0.00/0.13 Time used: 0.008274 0.00/0.13 0.00/0.13 Checking conditional termination of SCC {l2}... 0.00/0.13 0.00/0.13 LOG: CALL solveLinear 0.00/0.13 0.00/0.13 LOG: RETURN solveLinear - Elapsed time: 0.001266s 0.00/0.13 0.00/0.13 LOG: CALL solveLinear 0.00/0.13 0.00/0.13 LOG: RETURN solveLinear - Elapsed time: 0.005565s 0.00/0.13 Trying to remove transition: -1 + arg1, arg2 -> arg1, arg3 -> 1, arg4 -> undef12, rest remain the same}> 0.00/0.13 Solving with 1 template(s). 0.00/0.13 0.00/0.13 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.13 0.00/0.13 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016430s 0.00/0.13 Time used: 0.016228 0.00/0.13 Trying to remove transition: -1 + arg1, arg2 -> arg1, arg3 -> undef7, arg4 -> undef8, rest remain the same}> 0.00/0.13 Solving with 1 template(s). 0.00/0.13 0.00/0.13 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.13 0.00/0.13 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017375s 0.00/0.13 Time used: 0.016552 0.00/0.13 Solving with 1 template(s). 0.00/0.13 0.00/0.13 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.13 0.00/0.13 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.035202s 0.00/0.13 Time used: 0.034402 0.00/0.13 0.00/0.13 LOG: SAT solveNonLinear - Elapsed time: 0.035202s 0.00/0.13 Cost: 0; Total time: 0.034402 0.00/0.13 Termination implied by a set of invariant(s): 0.00/0.13 Invariant at l2: arg2 <= 1 + arg1 0.00/0.13 [ Invariant Graph ] 0.00/0.13 Strengthening and disabling transitions... 0.00/0.13 0.00/0.13 LOG: CALL solverLinear in Graph for feasibility 0.00/0.13 0.00/0.13 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.13 Strengthening transition (result): 0.00/0.13 -1 + arg1, arg2 -> arg1, arg3 -> undef7, arg4 -> undef8, rest remain the same}> 0.00/0.13 0.00/0.13 LOG: CALL solverLinear in Graph for feasibility 0.00/0.13 0.00/0.13 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.13 Strengthening transition (result): 0.00/0.13 -1 + arg1, arg2 -> arg1, arg3 -> 1, arg4 -> undef12, rest remain the same}> 0.00/0.13 [ Termination Graph ] 0.00/0.13 Strengthening and disabling transitions... 0.00/0.13 0.00/0.13 LOG: CALL solverLinear in Graph for feasibility 0.00/0.13 0.00/0.13 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.13 Strengthening transition (result): 0.00/0.13 -1 + arg1, arg2 -> arg1, arg3 -> undef7, arg4 -> undef8, rest remain the same}> 0.00/0.13 0.00/0.13 LOG: CALL solverLinear in Graph for feasibility 0.00/0.13 0.00/0.13 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.13 Strengthening transition (result): 0.00/0.13 -1 + arg1, arg2 -> arg1, arg3 -> 1, arg4 -> undef12, rest remain the same}> 0.00/0.13 Ranking function: arg1 0.00/0.13 New Graphs: 0.00/0.13 INVARIANTS: 0.00/0.13 2: arg2 <= 1 + arg1 , 0.00/0.13 Quasi-INVARIANTS to narrow Graph: 0.00/0.13 2: 0.00/0.13 Proving termination of subgraph 2 0.00/0.13 Checking unfeasibility... 0.00/0.13 Time used: 0.008758 0.00/0.13 0.00/0.13 Checking conditional termination of SCC {l3}... 0.00/0.13 0.00/0.13 LOG: CALL solveLinear 0.00/0.13 0.00/0.13 LOG: RETURN solveLinear - Elapsed time: 0.002831s 0.00/0.13 Ranking function: -1 + arg3 0.00/0.13 New Graphs: 0.00/0.13 Program Terminates 0.00/0.13 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 0.00/0.13 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 0.00/0.13 EOF