0.00/0.04 YES 0.00/0.04 0.00/0.04 Solver Timeout: 4 0.00/0.04 Global Timeout: 300 0.00/0.04 No parsing errors! 0.00/0.04 Init Location: 0 0.00/0.04 Transitions: 0.00/0.04 0.00/0.04 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2, arg3 -> undef3}> 0.00/0.04 arg1, arg3 -> arg1}> 0.00/0.04 0) /\ (arg2 > 99) /\ (arg2 = arg3), par{arg1 -> (arg1 - 1), arg2 -> undef8, arg3 -> undef9}> 0.00/0.04 0) /\ (arg2 < 100) /\ (arg2 = arg3), par{arg1 -> arg2, arg2 -> undef11, arg3 -> undef12}> 0.00/0.04 0) /\ (arg2 = arg3), par{arg1 -> arg2, arg2 -> undef14, arg3 -> undef15}> 0.00/0.04 0) /\ (arg2 = arg3), par{arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}> 0.00/0.04 0) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg2 -> undef20, arg3 -> undef21}> 0.00/0.04 undef22, arg2 -> undef23, arg3 -> undef24}> 0.00/0.04 0.00/0.04 Fresh variables: 0.00/0.04 undef2, undef3, undef8, undef9, undef11, undef12, undef14, undef15, undef20, undef21, undef22, undef23, undef24, 0.00/0.04 0.00/0.04 Undef variables: 0.00/0.04 undef2, undef3, undef8, undef9, undef11, undef12, undef14, undef15, undef20, undef21, undef22, undef23, undef24, 0.00/0.04 0.00/0.04 Abstraction variables: 0.00/0.04 0.00/0.04 Exit nodes: 0.00/0.04 0.00/0.04 Accepting locations: 0.00/0.04 0.00/0.04 Asserts: 0.00/0.04 0.00/0.04 Preprocessed LLVMGraph 0.00/0.04 Init Location: 0 0.00/0.04 Transitions: 0.00/0.04 0) /\ (undef23 > ~(1))> 0.00/0.04 0) /\ (arg2 > 99) /\ (arg2 = arg3), par{arg1 -> (arg1 - 1), arg2 -> (arg1 - 1), arg3 -> (arg1 - 1)}> 0.00/0.04 0) /\ (arg2 < 100) /\ (arg2 = arg3), par{arg1 -> arg2, arg2 -> undef11, arg3 -> undef12}> 0.00/0.04 0) /\ (arg2 = arg3), par{arg1 -> arg2, arg2 -> undef14, arg3 -> undef15}> 0.00/0.04 0) /\ (arg2 = arg3), par{arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}> 0.00/0.04 0) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg2 -> undef20, arg3 -> undef21}> 0.00/0.04 0.00/0.04 Fresh variables: 0.00/0.04 undef2, undef3, undef8, undef9, undef11, undef12, undef14, undef15, undef20, undef21, undef22, undef23, undef24, 0.00/0.04 0.00/0.04 Undef variables: 0.00/0.04 undef2, undef3, undef8, undef9, undef11, undef12, undef14, undef15, undef20, undef21, undef22, undef23, undef24, 0.00/0.04 0.00/0.04 Abstraction variables: 0.00/0.04 0.00/0.04 Exit nodes: 0.00/0.04 0.00/0.04 Accepting locations: 0.00/0.04 0.00/0.04 Asserts: 0.00/0.04 0.00/0.04 ************************************************************* 0.00/0.04 ******************************************************************************************* 0.00/0.04 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.04 ******************************************************************************************* 0.00/0.04 0.00/0.04 Init Location: 0 0.00/0.04 Graph 0: 0.00/0.04 Transitions: 0.00/0.04 Variables: 0.00/0.04 0.00/0.04 Graph 1: 0.00/0.04 Transitions: 0.00/0.04 -1 + arg1, arg2 -> -1 + arg1, arg3 -> -1 + arg1, rest remain the same}> 0.00/0.04 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> 0.00/0.04 Variables: 0.00/0.04 arg1, arg2, arg3 0.00/0.04 0.00/0.04 Graph 2: 0.00/0.04 Transitions: 0.00/0.04 -1 + arg1, arg2 -> undef20, arg3 -> undef21, rest remain the same}> 0.00/0.04 Variables: 0.00/0.04 arg1, arg2, arg3 0.00/0.04 0.00/0.04 Precedence: 0.00/0.04 Graph 0 0.00/0.04 0.00/0.04 Graph 1 0.00/0.04 0.00/0.04 0.00/0.04 Graph 2 0.00/0.04 arg2, arg2 -> undef11, arg3 -> undef12, rest remain the same}> 0.00/0.04 arg2, arg2 -> undef14, arg3 -> undef15, rest remain the same}> 0.00/0.04 0.00/0.04 Map Locations to Subgraph: 0.00/0.04 ( 0 , 0 ) 0.00/0.04 ( 3 , 1 ) 0.00/0.04 ( 4 , 2 ) 0.00/0.04 0.00/0.04 ******************************************************************************************* 0.00/0.04 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.04 ******************************************************************************************* 0.00/0.04 0.00/0.04 Proving termination of subgraph 0 0.00/0.04 Proving termination of subgraph 1 0.00/0.04 Checking unfeasibility... 0.00/0.04 Time used: 0.007769 0.00/0.04 0.00/0.04 Checking conditional termination of SCC {l3}... 0.00/0.04 0.00/0.04 LOG: CALL solveLinear 0.00/0.04 0.00/0.04 LOG: RETURN solveLinear - Elapsed time: 0.001561s 0.00/0.04 Ranking function: -297 + 297*arg1 + arg2 - arg3 0.00/0.04 New Graphs: 0.00/0.04 Transitions: 0.00/0.04 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> 0.00/0.04 Variables: 0.00/0.04 arg2, arg3 0.00/0.04 Checking conditional termination of SCC {l3}... 0.00/0.04 0.00/0.04 LOG: CALL solveLinear 0.00/0.04 0.00/0.04 LOG: RETURN solveLinear - Elapsed time: 0.000718s 0.00/0.04 Ranking function: 99 - arg2 0.00/0.04 New Graphs: 0.00/0.04 Proving termination of subgraph 2 0.00/0.04 Checking unfeasibility... 0.00/0.04 Time used: 0.00248 0.00/0.04 0.00/0.04 Checking conditional termination of SCC {l4}... 0.00/0.04 0.00/0.04 LOG: CALL solveLinear 0.00/0.04 0.00/0.04 LOG: RETURN solveLinear - Elapsed time: 0.000712s 0.00/0.04 Ranking function: -1 + arg1 0.00/0.04 New Graphs: 0.00/0.04 Program Terminates 0.00/0.04 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 0.00/0.04 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 0.00/0.04 EOF