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 ~(1)) /\ (arg2 > ~(1)) /\ (undef1 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef1, arg4 -> undef2, arg5 -> undef1}> 0.00/0.13 0) /\ (arg4 > 0) /\ (arg3 = arg5), par{arg3 -> (arg3 - 1), arg4 -> (arg4 - 1), arg5 -> (arg3 - 1)}> 0.00/0.13 0) /\ (0 = arg4) /\ (arg3 = arg5), par{arg2 -> (arg2 + 1), arg3 -> arg1, arg4 -> (arg2 + 1), arg5 -> arg1}> 0.00/0.13 undef16, arg2 -> undef17, arg3 -> undef18, arg4 -> undef19, arg5 -> undef20}> 0.00/0.13 0.00/0.13 Fresh variables: 0.00/0.13 undef1, undef2, undef16, undef17, undef18, undef19, undef20, 0.00/0.13 0.00/0.13 Undef variables: 0.00/0.13 undef1, undef2, undef16, undef17, undef18, undef19, undef20, 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 ~(1)) /\ (undef17 > ~(1)) /\ (undef1 > ~(1)) /\ (undef16 > 0)> 0.00/0.13 0) /\ (arg4 > 0) /\ (arg3 = arg5), par{arg3 -> (arg3 - 1), arg4 -> (arg4 - 1), arg5 -> (arg3 - 1)}> 0.00/0.13 0) /\ (0 = arg4) /\ (arg3 = arg5), par{arg2 -> (arg2 + 1), arg3 -> arg1, arg4 -> (arg2 + 1), arg5 -> arg1}> 0.00/0.13 0.00/0.13 Fresh variables: 0.00/0.13 undef1, undef2, undef16, undef17, undef18, undef19, undef20, 0.00/0.13 0.00/0.13 Undef variables: 0.00/0.13 undef1, undef2, undef16, undef17, undef18, undef19, undef20, 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 + arg3, arg4 -> -1 + arg4, arg5 -> -1 + arg3, rest remain the same}> 0.00/0.13 1 + arg2, arg3 -> arg1, arg4 -> 1 + arg2, arg5 -> arg1, rest remain the same}> 0.00/0.13 Variables: 0.00/0.13 arg3, arg4, arg5, arg1, arg2 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 Map Locations to Subgraph: 0.00/0.13 ( 0 , 0 ) 0.00/0.13 ( 2 , 1 ) 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.010474 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.001464s 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.005674s 0.00/0.13 Trying to remove transition: 1 + arg2, arg3 -> arg1, arg4 -> 1 + arg2, arg5 -> arg1, 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.020369s 0.00/0.13 Time used: 0.020034 0.00/0.13 Trying to remove transition: -1 + arg3, arg4 -> -1 + arg4, arg5 -> -1 + arg3, 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.013318s 0.00/0.13 Time used: 0.012169 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.042512s 0.00/0.13 Time used: 0.041698 0.00/0.13 0.00/0.13 LOG: SAT solveNonLinear - Elapsed time: 0.042512s 0.00/0.13 Cost: 0; Total time: 0.041698 0.00/0.13 Termination implied by a set of invariant(s): 0.00/0.13 Invariant at l2: arg2 + arg3 <= arg1 + arg4 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 + arg3, arg4 -> -1 + arg4, arg5 -> -1 + arg3, 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 + arg2, arg3 -> arg1, arg4 -> 1 + arg2, arg5 -> arg1, 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 + arg3, arg4 -> -1 + arg4, arg5 -> -1 + arg3, 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 + arg2, arg3 -> arg1, arg4 -> 1 + arg2, arg5 -> arg1, rest remain the same}> 0.00/0.13 Ranking function: 2*arg1 - 2*arg2 + arg4 - arg5 0.00/0.13 New Graphs: 0.00/0.13 Transitions: 0.00/0.13 -1 + arg3, arg4 -> -1 + arg4, arg5 -> -1 + arg3, rest remain the same}> 0.00/0.13 Variables: 0.00/0.13 arg1, arg2, arg3, arg4, arg5 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.001135s 0.00/0.13 Ranking function: -1 + arg3 0.00/0.13 New Graphs: 0.00/0.13 INVARIANTS: 0.00/0.13 2: arg2 + arg3 <= arg1 + arg4 , 0.00/0.13 Quasi-INVARIANTS to narrow Graph: 0.00/0.13 2: 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