0.00/0.09 YES 0.00/0.09 0.00/0.09 Solver Timeout: 4 0.00/0.09 Global Timeout: 300 0.00/0.09 No parsing errors! 0.00/0.09 Init Location: 0 0.00/0.09 Transitions: 0.00/0.09 0.00/0.09 0) /\ (undef2 > 0) /\ ((arg2 + 2) <= arg1), par{arg1 -> 0, arg2 -> undef2}> 0.00/0.09 ~(1)) /\ (arg2 > 0) /\ (arg1 > 0) /\ (undef4 > 0), par{arg1 -> 0, arg2 -> undef4}> 0.00/0.09 6) /\ (undef7 > ~(1)) /\ (0 = arg1), par{arg1 -> 1, arg2 -> undef7}> 0.00/0.09 = (undef9 - 2)) /\ (arg2 > 0) /\ (undef9 > 2) /\ (1 = arg1), par{arg1 -> 2, arg2 -> undef9}> 0.00/0.09 0) /\ (undef11 > 4) /\ (2 = arg1), par{arg1 -> 0, arg2 -> undef11}> 0.00/0.09 ~(1)) /\ (arg2 > 0) /\ (arg1 > 0), par{arg1 -> undef12, arg2 -> undef13}> 0.00/0.09 0), par{arg1 -> (arg1 - 1), arg2 -> undef15}> 0.00/0.09 undef16, arg2 -> undef17}> 0.00/0.09 0.00/0.09 Fresh variables: 0.00/0.09 undef2, undef4, undef5, undef7, undef9, undef11, undef12, undef13, undef15, undef16, undef17, 0.00/0.09 0.00/0.09 Undef variables: 0.00/0.09 undef2, undef4, undef5, undef7, undef9, undef11, undef12, undef13, undef15, undef16, undef17, 0.00/0.09 0.00/0.09 Abstraction variables: 0.00/0.09 0.00/0.09 Exit nodes: 0.00/0.09 0.00/0.09 Accepting locations: 0.00/0.09 0.00/0.09 Asserts: 0.00/0.09 0.00/0.09 Preprocessed LLVMGraph 0.00/0.09 Init Location: 0 0.00/0.09 Transitions: 0.00/0.09 ~(1)) /\ (undef17 > 0) /\ (undef16 > 0) /\ (undef4 > 0), par{arg1 -> 0, arg2 -> undef4}> 0.00/0.09 ~(1)) /\ (undef17 > 0) /\ (undef16 > 0), par{arg1 -> undef12, arg2 -> undef13}> 0.00/0.09 6) /\ (undef7 > ~(1)) /\ (0 = arg1), par{arg1 -> 1, arg2 -> undef7}> 0.00/0.09 = (undef9 - 2)) /\ (arg2 > 0) /\ (undef9 > 2) /\ (1 = arg1), par{arg1 -> 2, arg2 -> undef9}> 0.00/0.09 0) /\ (undef11 > 4) /\ (2 = arg1), par{arg1 -> 0, arg2 -> undef11}> 0.00/0.09 0), par{arg1 -> (arg1 - 1), arg2 -> undef15}> 0.00/0.09 0.00/0.09 Fresh variables: 0.00/0.09 undef2, undef4, undef5, undef7, undef9, undef11, undef12, undef13, undef15, undef16, undef17, 0.00/0.09 0.00/0.09 Undef variables: 0.00/0.09 undef2, undef4, undef5, undef7, undef9, undef11, undef12, undef13, undef15, undef16, undef17, 0.00/0.09 0.00/0.09 Abstraction variables: 0.00/0.09 0.00/0.09 Exit nodes: 0.00/0.09 0.00/0.09 Accepting locations: 0.00/0.09 0.00/0.09 Asserts: 0.00/0.09 0.00/0.09 ************************************************************* 0.00/0.09 ******************************************************************************************* 0.00/0.09 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.09 ******************************************************************************************* 0.00/0.09 0.00/0.09 Init Location: 0 0.00/0.09 Graph 0: 0.00/0.09 Transitions: 0.00/0.09 Variables: 0.00/0.09 0.00/0.09 Graph 1: 0.00/0.09 Transitions: 0.00/0.09 -1 + arg1, arg2 -> undef15, rest remain the same}> 0.00/0.09 Variables: 0.00/0.09 arg1, arg2 0.00/0.09 0.00/0.09 Graph 2: 0.00/0.09 Transitions: 0.00/0.09 1, arg2 -> undef7, rest remain the same}> 0.00/0.09 2, arg2 -> undef9, rest remain the same}> 0.00/0.09 0, arg2 -> undef11, rest remain the same}> 0.00/0.09 Variables: 0.00/0.09 arg1, arg2 0.00/0.09 0.00/0.09 Precedence: 0.00/0.09 Graph 0 0.00/0.09 0.00/0.09 Graph 1 0.00/0.09 undef12, arg2 -> undef13, rest remain the same}> 0.00/0.09 0.00/0.09 Graph 2 0.00/0.09 0, arg2 -> undef4, rest remain the same}> 0.00/0.09 0.00/0.09 Map Locations to Subgraph: 0.00/0.09 ( 0 , 0 ) 0.00/0.09 ( 2 , 2 ) 0.00/0.09 ( 4 , 1 ) 0.00/0.09 0.00/0.09 ******************************************************************************************* 0.00/0.09 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.09 ******************************************************************************************* 0.00/0.09 0.00/0.09 Proving termination of subgraph 0 0.00/0.09 Proving termination of subgraph 1 0.00/0.09 Checking unfeasibility... 0.00/0.09 Time used: 0.0021 0.00/0.09 0.00/0.09 Checking conditional termination of SCC {l4}... 0.00/0.09 0.00/0.09 LOG: CALL solveLinear 0.00/0.09 0.00/0.09 LOG: RETURN solveLinear - Elapsed time: 0.000597s 0.00/0.09 Ranking function: -1 + arg1 0.00/0.09 New Graphs: 0.00/0.09 Proving termination of subgraph 2 0.00/0.09 Checking unfeasibility... 0.00/0.09 Time used: 0.02587 0.00/0.09 0.00/0.09 Checking conditional termination of SCC {l2}... 0.00/0.09 0.00/0.09 LOG: CALL solveLinear 0.00/0.09 0.00/0.09 LOG: RETURN solveLinear - Elapsed time: 0.002008s 0.00/0.09 0.00/0.09 LOG: CALL solveLinear 0.00/0.09 0.00/0.09 LOG: RETURN solveLinear - Elapsed time: 0.016295s 0.00/0.09 Piecewise ranking function: min(-122 + 132*arg1 + 19*arg2,66 - 47*arg1 + 19*arg2) 0.00/0.09 New Graphs: 0.00/0.09 Transitions: 0.00/0.09 2, arg2 -> undef9, rest remain the same}> 0.00/0.09 0, arg2 -> undef11, rest remain the same}> 0.00/0.09 Variables: 0.00/0.09 arg1, arg2 0.00/0.09 Checking conditional termination of SCC {l2}... 0.00/0.09 0.00/0.09 LOG: CALL solveLinear 0.00/0.09 0.00/0.09 LOG: RETURN solveLinear - Elapsed time: 0.001217s 0.00/0.09 0.00/0.09 LOG: CALL solveLinear 0.00/0.09 0.00/0.09 LOG: RETURN solveLinear - Elapsed time: 0.006949s 0.00/0.09 Piecewise ranking function: min(8 - 9*arg1 + arg2,-14 + 19*arg1 + arg2) 0.00/0.09 New Graphs: 0.00/0.09 Transitions: 0.00/0.09 0, arg2 -> undef11, rest remain the same}> 0.00/0.09 Variables: 0.00/0.09 arg1, arg2 0.00/0.09 Checking conditional termination of SCC {l2}... 0.00/0.09 0.00/0.09 LOG: CALL solveLinear 0.00/0.09 0.00/0.09 LOG: RETURN solveLinear - Elapsed time: 0.001047s 0.00/0.09 Ranking function: -1 + (1 / 2)*arg1 0.00/0.09 New Graphs: 0.00/0.09 Program Terminates 0.00/0.09 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 0.00/0.09 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 0.00/0.09 EOF