0.00/0.07 YES 0.00/0.07 0.00/0.07 Solver Timeout: 4 0.00/0.07 Global Timeout: 300 0.00/0.07 No parsing errors! 0.00/0.07 Init Location: 0 0.00/0.07 Transitions: 0.00/0.07 0.00/0.07 ~(1)) /\ (arg2 > ~(1)) /\ (undef2 > ~(1)) /\ (arg1 > 0), par{arg1 -> 0, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4, arg5 -> undef5}> 0.00/0.07 0), par{arg1 -> arg3, arg2 -> arg1, arg3 -> arg2, arg4 -> arg3, arg5 -> arg3}> 0.00/0.07 (arg3 + 1), arg4 -> (arg4 + 1), arg5 -> (arg4 + 1)}> 0.00/0.07 0) /\ (arg4 < 1) /\ (arg4 = arg5), par{arg3 -> (arg3 + 1), arg4 -> (arg4 + 1), arg5 -> (arg4 + 1)}> 0.00/0.07 0) /\ (arg4 = arg5), par{arg3 -> (arg3 - 1), arg4 -> (arg4 - 1), arg5 -> (arg4 - 1)}> 0.00/0.07 ~(1)) /\ (0 = arg4) /\ (0 = arg5), par{arg1 -> (arg2 + 1), arg2 -> arg3, arg3 -> arg1, arg4 -> undef29, arg5 -> undef30}> 0.00/0.07 undef31, arg2 -> undef32, arg3 -> undef33, arg4 -> undef34, arg5 -> undef35}> 0.00/0.07 0.00/0.07 Fresh variables: 0.00/0.07 undef2, undef3, undef4, undef5, undef29, undef30, undef31, undef32, undef33, undef34, undef35, 0.00/0.07 0.00/0.07 Undef variables: 0.00/0.07 undef2, undef3, undef4, undef5, undef29, undef30, undef31, undef32, undef33, undef34, undef35, 0.00/0.07 0.00/0.07 Abstraction variables: 0.00/0.07 0.00/0.07 Exit nodes: 0.00/0.07 0.00/0.07 Accepting locations: 0.00/0.07 0.00/0.07 Asserts: 0.00/0.07 0.00/0.07 Preprocessed LLVMGraph 0.00/0.07 Init Location: 0 0.00/0.07 Transitions: 0.00/0.07 ~(1)) /\ (undef32 > ~(1)) /\ (undef2 > ~(1)) /\ (undef31 > 0) /\ (undef3 <= undef2) /\ (undef3 > 0)> 0.00/0.07 (arg3 + 1), arg4 -> (arg4 + 1), arg5 -> (arg4 + 1)}> 0.00/0.07 0) /\ (arg4 = arg5), par{arg3 -> (arg3 - 1), arg4 -> (arg4 - 1), arg5 -> (arg4 - 1)}> 0.00/0.07 ~(1)) /\ (0 = arg4) /\ (0 = arg5) /\ (arg1 <= arg3) /\ (arg1 > 0), par{arg1 -> arg1, arg2 -> (arg2 + 1), arg3 -> arg3, arg4 -> arg1, arg5 -> arg1}> 0.00/0.07 0.00/0.07 Fresh variables: 0.00/0.07 undef2, undef3, undef4, undef5, undef29, undef30, undef31, undef32, undef33, undef34, undef35, 0.00/0.07 0.00/0.07 Undef variables: 0.00/0.07 undef2, undef3, undef4, undef5, undef29, undef30, undef31, undef32, undef33, undef34, undef35, 0.00/0.07 0.00/0.07 Abstraction variables: 0.00/0.07 0.00/0.07 Exit nodes: 0.00/0.07 0.00/0.07 Accepting locations: 0.00/0.07 0.00/0.07 Asserts: 0.00/0.07 0.00/0.07 ************************************************************* 0.00/0.07 ******************************************************************************************* 0.00/0.07 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.07 ******************************************************************************************* 0.00/0.07 0.00/0.07 Init Location: 0 0.00/0.07 Graph 0: 0.00/0.07 Transitions: 0.00/0.07 Variables: 0.00/0.07 0.00/0.07 Graph 1: 0.00/0.07 Transitions: 0.00/0.07 1 + arg3, arg4 -> 1 + arg4, arg5 -> 1 + arg4, rest remain the same}> 0.00/0.07 -1 + arg3, arg4 -> -1 + arg4, arg5 -> -1 + arg4, rest remain the same}> 0.00/0.07 1 + arg2, arg4 -> arg1, arg5 -> arg1, rest remain the same}> 0.00/0.07 Variables: 0.00/0.07 arg3, arg4, arg5, arg1, arg2 0.00/0.07 0.00/0.07 Precedence: 0.00/0.07 Graph 0 0.00/0.07 0.00/0.07 Graph 1 0.00/0.07 0.00/0.07 0.00/0.07 Map Locations to Subgraph: 0.00/0.07 ( 0 , 0 ) 0.00/0.07 ( 3 , 1 ) 0.00/0.07 0.00/0.07 ******************************************************************************************* 0.00/0.07 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.07 ******************************************************************************************* 0.00/0.07 0.00/0.07 Proving termination of subgraph 0 0.00/0.07 Proving termination of subgraph 1 0.00/0.07 Checking unfeasibility... 0.00/0.07 Time used: 0.019065 0.00/0.07 Some transition disabled by a set of invariant(s): 0.00/0.07 Invariant at l3: 0 <= arg5 0.00/0.07 0.00/0.07 Strengthening and disabling transitions... 0.00/0.07 > It's unfeasible. Removing transition: 0.00/0.07 1 + arg3, arg4 -> 1 + arg4, arg5 -> 1 + arg4, rest remain the same}> 0.00/0.07 0.00/0.07 LOG: CALL solverLinear in Graph for feasibility 0.00/0.07 0.00/0.07 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.07 Strengthening transition (result): 0.00/0.07 -1 + arg3, arg4 -> -1 + arg4, arg5 -> -1 + arg4, rest remain the same}> 0.00/0.07 0.00/0.07 LOG: CALL solverLinear in Graph for feasibility 0.00/0.07 0.00/0.07 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.07 Strengthening transition (result): 0.00/0.07 1 + arg2, arg4 -> arg1, arg5 -> arg1, rest remain the same}> 0.00/0.07 Checking unfeasibility... 0.00/0.07 Time used: 0.024005 0.00/0.07 0.00/0.07 Checking conditional termination of SCC {l3}... 0.00/0.07 0.00/0.07 LOG: CALL solveLinear 0.00/0.07 0.00/0.07 LOG: RETURN solveLinear - Elapsed time: 0.001875s 0.00/0.07 Ranking function: 1 + 2*arg3 - arg4 0.00/0.07 New Graphs: 0.00/0.07 Transitions: 0.00/0.07 -1 + arg3, arg4 -> -1 + arg4, arg5 -> -1 + arg4, rest remain the same}> 0.00/0.07 Variables: 0.00/0.07 arg3, arg4, arg5 0.00/0.07 Checking conditional termination of SCC {l3}... 0.00/0.07 0.00/0.07 LOG: CALL solveLinear 0.00/0.07 0.00/0.07 LOG: RETURN solveLinear - Elapsed time: 0.000785s 0.00/0.07 Ranking function: -1 + arg4 0.00/0.07 New Graphs: 0.00/0.07 Program Terminates 0.00/0.07 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 0.00/0.07 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 0.00/0.07 EOF