0.00/0.19 YES 0.00/0.19 0.00/0.19 Solver Timeout: 4 0.00/0.19 Global Timeout: 300 0.00/0.19 No parsing errors! 0.00/0.19 Init Location: 0 0.00/0.19 Transitions: 0.00/0.19 0.00/0.19 0) /\ (undef1 > 0) /\ (0 = arg2), par{arg1 -> undef1, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 0, arg7 -> 0, arg8 -> 0}> 0.00/0.19 ~(1)) /\ (arg1 > 0) /\ (undef9 > 0) /\ (1 = arg2), par{arg1 -> undef9, arg2 -> undef10, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 1, arg7 -> 1, arg8 -> 1}> 0.00/0.19 ~(1)) /\ (undef19 > ~(1)) /\ (undef17 <= arg1) /\ (arg1 > 0) /\ (undef17 > 0) /\ (2 = arg2), par{arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> 0, arg5 -> 0, arg6 -> 2, arg7 -> 2, arg8 -> 2}> 0.00/0.19 ~(1)) /\ (arg2 > 2) /\ (undef28 > ~(1)) /\ (undef27 > ~(1)) /\ (arg1 >= undef25) /\ (arg1 > 0) /\ (undef25 > 0), par{arg1 -> undef25, arg2 -> undef26, arg3 -> undef27, arg4 -> undef28, arg5 -> undef28, arg6 -> arg2, arg7 -> 3, arg8 -> arg2}> 0.00/0.19 ~(1)) /\ (arg6 > ~(1)) /\ (arg7 >= arg6) /\ (arg3 > ~(1)) /\ ((2 * arg2) >= 0) /\ (((2 * arg2) - arg3) > 0) /\ (undef33 <= arg1) /\ (arg1 > 0) /\ (undef33 > 0) /\ (arg4 = arg5) /\ (arg6 = arg8), par{arg1 -> undef33, arg2 -> 0, arg3 -> 0, arg5 -> arg4, arg8 -> arg6}> 0.00/0.19 ~(1)) /\ (arg6 > ~(1)) /\ (arg7 > ~(1)) /\ (arg7 < arg6) /\ (undef42 > ~(1)) /\ ((arg7 + 1) >= arg6) /\ (arg3 > ~(1)) /\ ((2 * arg2) >= 0) /\ ((2 * undef42) >= 0) /\ ((2 * undef42) < ((2 * arg2) - arg3)) /\ ((arg4 + (2 * undef42)) >= 0) /\ (undef41 <= arg1) /\ (arg1 > 0) /\ (undef41 > 0) /\ (arg4 = arg5) /\ (arg6 = arg8), par{arg1 -> undef41, arg2 -> undef42, arg3 -> 0, arg4 -> (arg4 + (2 * undef42)), arg5 -> (arg4 + (2 * undef42)), arg7 -> (arg7 + 1), arg8 -> arg6}> 0.00/0.19 ~(1)) /\ ((arg7 + 1) < arg6) /\ (arg4 > ~(1)) /\ (arg7 > ~(1)) /\ (undef50 > ~(1)) /\ (undef51 > ~(1)) /\ (arg3 > ~(1)) /\ ((2 * arg2) >= 0) /\ ((2 * undef50) >= 0) /\ (((2 * undef50) - undef51) < ((2 * arg2) - arg3)) /\ ((arg4 + (2 * undef50)) >= 0) /\ (undef49 <= arg1) /\ (arg1 > 0) /\ (undef49 > 0) /\ (arg4 = arg5) /\ (arg6 = arg8), par{arg1 -> undef49, arg2 -> undef50, arg3 -> undef51, arg4 -> ((arg4 + (2 * undef50)) - undef51), arg5 -> ((arg4 + (2 * undef50)) - undef51), arg7 -> (arg7 + 2), arg8 -> arg6}> 0.00/0.19 undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60, arg5 -> undef61, arg6 -> undef62, arg7 -> undef63, arg8 -> undef64}> 0.00/0.19 0.00/0.19 Fresh variables: 0.00/0.19 undef1, undef9, undef10, undef17, undef18, undef19, undef25, undef26, undef27, undef28, undef33, undef41, undef42, undef49, undef50, undef51, undef57, undef58, undef59, undef60, undef61, undef62, undef63, undef64, 0.00/0.19 0.00/0.19 Undef variables: 0.00/0.19 undef1, undef9, undef10, undef17, undef18, undef19, undef25, undef26, undef27, undef28, undef33, undef41, undef42, undef49, undef50, undef51, undef57, undef58, undef59, undef60, undef61, undef62, undef63, undef64, 0.00/0.19 0.00/0.19 Abstraction variables: 0.00/0.19 0.00/0.19 Exit nodes: 0.00/0.19 0.00/0.19 Accepting locations: 0.00/0.19 0.00/0.19 Asserts: 0.00/0.19 0.00/0.19 Preprocessed LLVMGraph 0.00/0.19 Init Location: 0 0.00/0.19 Transitions: 0.00/0.19 0) /\ (undef1 > 0) /\ (0 = undef58), par{arg1 -> undef1, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 0, arg7 -> 0, arg8 -> 0}> 0.00/0.19 ~(1)) /\ (undef57 > 0) /\ (undef9 > 0) /\ (1 = undef58), par{arg1 -> undef9, arg2 -> undef10, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 1, arg7 -> 1, arg8 -> 1}> 0.00/0.19 ~(1)) /\ (undef19 > ~(1)) /\ (undef17 <= undef57) /\ (undef57 > 0) /\ (undef17 > 0) /\ (2 = undef58), par{arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> 0, arg5 -> 0, arg6 -> 2, arg7 -> 2, arg8 -> 2}> 0.00/0.19 ~(1)) /\ (undef58 > 2) /\ (undef28 > ~(1)) /\ (undef27 > ~(1)) /\ (undef57 >= undef25) /\ (undef57 > 0) /\ (undef25 > 0), par{arg1 -> undef25, arg2 -> undef26, arg3 -> undef27, arg4 -> undef28, arg5 -> undef28, arg6 -> undef58, arg7 -> 3, arg8 -> undef58}> 0.00/0.19 ~(1)) /\ (arg6 > ~(1)) /\ (arg7 >= arg6) /\ (arg3 > ~(1)) /\ ((2 * arg2) >= 0) /\ (((2 * arg2) - arg3) > 0) /\ (undef33 <= arg1) /\ (arg1 > 0) /\ (undef33 > 0) /\ (arg4 = arg5) /\ (arg6 = arg8), par{arg1 -> undef33, arg2 -> 0, arg3 -> 0, arg5 -> arg4, arg8 -> arg6}> 0.00/0.19 ~(1)) /\ (arg6 > ~(1)) /\ (arg7 > ~(1)) /\ (arg7 < arg6) /\ (undef42 > ~(1)) /\ ((arg7 + 1) >= arg6) /\ (arg3 > ~(1)) /\ ((2 * arg2) >= 0) /\ ((2 * undef42) >= 0) /\ ((2 * undef42) < ((2 * arg2) - arg3)) /\ ((arg4 + (2 * undef42)) >= 0) /\ (undef41 <= arg1) /\ (arg1 > 0) /\ (undef41 > 0) /\ (arg4 = arg5) /\ (arg6 = arg8), par{arg1 -> undef41, arg2 -> undef42, arg3 -> 0, arg4 -> (arg4 + (2 * undef42)), arg5 -> (arg4 + (2 * undef42)), arg7 -> (arg7 + 1), arg8 -> arg6}> 0.00/0.19 ~(1)) /\ ((arg7 + 1) < arg6) /\ (arg4 > ~(1)) /\ (arg7 > ~(1)) /\ (undef50 > ~(1)) /\ (undef51 > ~(1)) /\ (arg3 > ~(1)) /\ ((2 * arg2) >= 0) /\ ((2 * undef50) >= 0) /\ (((2 * undef50) - undef51) < ((2 * arg2) - arg3)) /\ ((arg4 + (2 * undef50)) >= 0) /\ (undef49 <= arg1) /\ (arg1 > 0) /\ (undef49 > 0) /\ (arg4 = arg5) /\ (arg6 = arg8), par{arg1 -> undef49, arg2 -> undef50, arg3 -> undef51, arg4 -> ((arg4 + (2 * undef50)) - undef51), arg5 -> ((arg4 + (2 * undef50)) - undef51), arg7 -> (arg7 + 2), arg8 -> arg6}> 0.00/0.19 0.00/0.19 Fresh variables: 0.00/0.19 undef1, undef9, undef10, undef17, undef18, undef19, undef25, undef26, undef27, undef28, undef33, undef41, undef42, undef49, undef50, undef51, undef57, undef58, undef59, undef60, undef61, undef62, undef63, undef64, 0.00/0.19 0.00/0.19 Undef variables: 0.00/0.19 undef1, undef9, undef10, undef17, undef18, undef19, undef25, undef26, undef27, undef28, undef33, undef41, undef42, undef49, undef50, undef51, undef57, undef58, undef59, undef60, undef61, undef62, undef63, undef64, 0.00/0.19 0.00/0.19 Abstraction variables: 0.00/0.19 0.00/0.19 Exit nodes: 0.00/0.19 0.00/0.19 Accepting locations: 0.00/0.19 0.00/0.19 Asserts: 0.00/0.19 0.00/0.19 ************************************************************* 0.00/0.19 ******************************************************************************************* 0.00/0.19 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.19 ******************************************************************************************* 0.00/0.19 0.00/0.19 Init Location: 0 0.00/0.19 Graph 0: 0.00/0.19 Transitions: 0.00/0.19 Variables: 0.00/0.19 0.00/0.19 Graph 1: 0.00/0.19 Transitions: 0.00/0.19 undef33, arg2 -> 0, arg3 -> 0, arg5 -> arg4, arg8 -> arg6, rest remain the same}> 0.00/0.19 undef41, arg2 -> undef42, arg3 -> 0, arg4 -> arg4 + 2*undef42, arg5 -> arg4 + 2*undef42, arg7 -> 1 + arg7, arg8 -> arg6, rest remain the same}> 0.00/0.19 undef49, arg2 -> undef50, arg3 -> undef51, arg4 -> arg4 + 2*undef50 - undef51, arg5 -> arg4 + 2*undef50 - undef51, arg7 -> 2 + arg7, arg8 -> arg6, rest remain the same}> 0.00/0.19 Variables: 0.00/0.19 arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8 0.00/0.19 0.00/0.19 Precedence: 0.00/0.19 Graph 0 0.00/0.19 0.00/0.19 Graph 1 0.00/0.19 undef1, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 0, arg7 -> 0, arg8 -> 0, rest remain the same}> 0.00/0.19 undef9, arg2 -> undef10, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 1, arg7 -> 1, arg8 -> 1, rest remain the same}> 0.00/0.19 undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> 0, arg5 -> 0, arg6 -> 2, arg7 -> 2, arg8 -> 2, rest remain the same}> 0.00/0.19 undef25, arg2 -> undef26, arg3 -> undef27, arg4 -> undef28, arg5 -> undef28, arg6 -> undef58, arg7 -> 3, arg8 -> undef58, rest remain the same}> 0.00/0.19 0.00/0.19 Map Locations to Subgraph: 0.00/0.19 ( 0 , 0 ) 0.00/0.19 ( 2 , 1 ) 0.00/0.19 0.00/0.19 ******************************************************************************************* 0.00/0.19 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.19 ******************************************************************************************* 0.00/0.19 0.00/0.19 Proving termination of subgraph 0 0.00/0.19 Proving termination of subgraph 1 0.00/0.19 Checking unfeasibility... 0.00/0.19 Time used: 0.138612 0.00/0.19 0.00/0.19 Checking conditional termination of SCC {l2}... 0.00/0.19 0.00/0.19 LOG: CALL solveLinear 0.00/0.19 0.00/0.19 LOG: RETURN solveLinear - Elapsed time: 0.009371s 0.00/0.19 Ranking function: -2 + arg4 - arg5 + 3*arg6 - 2*arg7 - arg8 0.00/0.19 New Graphs: 0.00/0.19 Transitions: 0.00/0.19 undef33, arg2 -> 0, arg3 -> 0, arg5 -> arg4, arg8 -> arg6, rest remain the same}> 0.00/0.19 Variables: 0.00/0.19 arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8 0.00/0.19 Checking conditional termination of SCC {l2}... 0.00/0.19 0.00/0.19 LOG: CALL solveLinear 0.00/0.19 0.00/0.19 LOG: RETURN solveLinear - Elapsed time: 0.001805s 0.00/0.19 Ranking function: -1 + 2*arg2 - arg3 0.00/0.19 New Graphs: 0.00/0.19 Program Terminates 0.00/0.19 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 0.00/0.19 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 0.00/0.19 EOF