0.00/0.05 YES 0.00/0.05 0.00/0.05 Solver Timeout: 4 0.00/0.05 Global Timeout: 300 0.00/0.05 No parsing errors! 0.00/0.05 Init Location: 0 0.00/0.05 Transitions: 0.00/0.05 0.00/0.05 (0 + x0^0), oldX1^0 -> undef2, x0^0 -> (0 + undef2)}> 0.00/0.05 undef4, x0^0 -> (~(2) + undef4)}> 0.00/0.05 undef7, x0^0 -> (~(1) + undef7)}> 0.00/0.05 undef10, x0^0 -> (0 + undef10)}> 0.00/0.05 undef13, x0^0 -> (0 + undef13)}> 0.00/0.05 undef16, x0^0 -> (0 + undef16)}> 0.00/0.05 (0 + x0^0), oldX1^0 -> undef20, x0^0 -> (0 + undef20)}> 0.00/0.05 undef22, x0^0 -> (0 + undef22)}> 0.00/0.05 undef25, x0^0 -> (0 + undef25)}> 0.00/0.05 undef28, x0^0 -> (0 + undef28)}> 0.00/0.05 0.00/0.05 0.00/0.05 0.00/0.05 0.00/0.05 0.00/0.05 0.00/0.05 0.00/0.05 0.00/0.05 Fresh variables: 0.00/0.05 undef2, undef4, undef7, undef10, undef13, undef16, undef20, undef22, undef25, undef28, 0.00/0.05 0.00/0.05 Undef variables: 0.00/0.05 undef2, undef4, undef7, undef10, undef13, undef16, undef20, undef22, undef25, undef28, 0.00/0.05 0.00/0.05 Abstraction variables: 0.00/0.05 0.00/0.05 Exit nodes: 0.00/0.05 0.00/0.05 Accepting locations: 0.00/0.05 0.00/0.05 Asserts: 0.00/0.05 0.00/0.05 Preprocessed LLVMGraph 0.00/0.05 Init Location: 0 0.00/0.05 Transitions: 0.00/0.05 0.00/0.05 0.00/0.05 (0 + undef10)}> 0.00/0.05 (0 + undef13)}> 0.00/0.05 (0 + undef20)}> 0.00/0.05 (0 + undef20)}> 0.00/0.05 (0 + undef10)}> 0.00/0.05 (0 + undef20)}> 0.00/0.05 (0 + undef20)}> 0.00/0.05 (0 + undef10)}> 0.00/0.05 (0 + undef20)}> 0.00/0.05 (0 + undef20)}> 0.00/0.05 (0 + undef2)}> 0.00/0.05 (0 + undef10)}> 0.00/0.05 (0 + undef20)}> 0.00/0.05 (0 + undef20)}> 0.00/0.05 (0 + undef10)}> 0.00/0.05 (0 + undef20)}> 0.00/0.05 (0 + undef20)}> 0.00/0.05 0.00/0.05 Fresh variables: 0.00/0.05 undef2, undef4, undef7, undef10, undef13, undef16, undef20, undef22, undef25, undef28, 0.00/0.05 0.00/0.05 Undef variables: 0.00/0.05 undef2, undef4, undef7, undef10, undef13, undef16, undef20, undef22, undef25, undef28, 0.00/0.05 0.00/0.05 Abstraction variables: 0.00/0.05 0.00/0.05 Exit nodes: 0.00/0.05 0.00/0.05 Accepting locations: 0.00/0.05 0.00/0.05 Asserts: 0.00/0.05 0.00/0.05 ************************************************************* 0.00/0.05 ******************************************************************************************* 0.00/0.05 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.05 ******************************************************************************************* 0.00/0.05 0.00/0.05 Init Location: 0 0.00/0.05 Graph 0: 0.00/0.05 Transitions: 0.00/0.05 Variables: 0.00/0.05 0.00/0.05 Graph 1: 0.00/0.05 Transitions: 0.00/0.05 undef10, rest remain the same}> 0.00/0.05 undef10, rest remain the same}> 0.00/0.05 Variables: 0.00/0.05 x0^0 0.00/0.05 0.00/0.05 Graph 2: 0.00/0.05 Transitions: 0.00/0.05 Variables: 0.00/0.05 0.00/0.05 Precedence: 0.00/0.05 Graph 0 0.00/0.05 0.00/0.05 Graph 1 0.00/0.05 0.00/0.05 undef10, rest remain the same}> 0.00/0.05 undef13, rest remain the same}> 0.00/0.05 undef10, rest remain the same}> 0.00/0.05 undef10, rest remain the same}> 0.00/0.05 0.00/0.05 Graph 2 0.00/0.05 0.00/0.05 undef20, rest remain the same}> 0.00/0.05 undef20, rest remain the same}> 0.00/0.05 undef20, rest remain the same}> 0.00/0.05 undef20, rest remain the same}> 0.00/0.05 undef20, rest remain the same}> 0.00/0.05 undef20, rest remain the same}> 0.00/0.05 undef2, rest remain the same}> 0.00/0.05 undef20, rest remain the same}> 0.00/0.05 undef20, rest remain the same}> 0.00/0.05 undef20, rest remain the same}> 0.00/0.05 undef20, rest remain the same}> 0.00/0.05 0.00/0.05 Map Locations to Subgraph: 0.00/0.05 ( 0 , 0 ) 0.00/0.05 ( 1 , 1 ) 0.00/0.05 ( 2 , 2 ) 0.00/0.05 0.00/0.05 ******************************************************************************************* 0.00/0.05 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.05 ******************************************************************************************* 0.00/0.05 0.00/0.05 Proving termination of subgraph 0 0.00/0.05 Proving termination of subgraph 1 0.00/0.05 Checking unfeasibility... 0.00/0.05 Time used: 0.003788 0.00/0.05 0.00/0.05 Checking conditional termination of SCC {l1}... 0.00/0.05 0.00/0.05 LOG: CALL solveLinear 0.00/0.05 0.00/0.05 LOG: RETURN solveLinear - Elapsed time: 0.001954s 0.00/0.05 Ranking function: -56 + 14*x0^0 0.00/0.05 New Graphs: 0.00/0.05 Transitions: 0.00/0.05 undef10, rest remain the same}> 0.00/0.05 Variables: 0.00/0.05 x0^0 0.00/0.05 Checking conditional termination of SCC {l1}... 0.00/0.05 0.00/0.05 LOG: CALL solveLinear 0.00/0.05 0.00/0.05 LOG: RETURN solveLinear - Elapsed time: 0.000964s 0.00/0.05 Ranking function: -2 + x0^0 0.00/0.05 New Graphs: 0.00/0.05 Proving termination of subgraph 2 0.00/0.05 Analyzing SCC {l2}... 0.00/0.05 No cycles found. 0.00/0.05 0.00/0.05 Program Terminates 0.00/0.05 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 0.00/0.05 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 0.00/0.05 EOF