0.00/0.20 YES 0.00/0.20 0.00/0.20 Solver Timeout: 4 0.00/0.20 Global Timeout: 300 0.00/0.20 No parsing errors! 0.00/0.20 Init Location: 0 0.00/0.20 Transitions: 0.00/0.20 0.00/0.20 (1 + e^0), n^0 -> (11 + n^0)}> 0.00/0.20 0.00/0.20 (~(1) + e^0), n^0 -> (~(10) + n^0)}> 0.00/0.20 0.00/0.20 1, n^0 -> undef10}> 0.00/0.20 0.00/0.20 0.00/0.20 Fresh variables: 0.00/0.20 undef10, 0.00/0.20 0.00/0.20 Undef variables: 0.00/0.20 undef10, 0.00/0.20 0.00/0.20 Abstraction variables: 0.00/0.20 0.00/0.20 Exit nodes: 0.00/0.20 0.00/0.20 Accepting locations: 0.00/0.20 0.00/0.20 Asserts: 0.00/0.20 0.00/0.20 Preprocessed LLVMGraph 0.00/0.20 Init Location: 0 0.00/0.20 Transitions: 0.00/0.20 0.00/0.20 (1 + e^0), n^0 -> (11 + n^0)}> 0.00/0.20 (~(1) + e^0), n^0 -> (~(10) + n^0)}> 0.00/0.20 0.00/0.20 Fresh variables: 0.00/0.20 undef10, 0.00/0.20 0.00/0.20 Undef variables: 0.00/0.20 undef10, 0.00/0.20 0.00/0.20 Abstraction variables: 0.00/0.20 0.00/0.20 Exit nodes: 0.00/0.20 0.00/0.20 Accepting locations: 0.00/0.20 0.00/0.20 Asserts: 0.00/0.20 0.00/0.20 ************************************************************* 0.00/0.20 ******************************************************************************************* 0.00/0.20 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.20 ******************************************************************************************* 0.00/0.20 0.00/0.20 Init Location: 0 0.00/0.20 Graph 0: 0.00/0.20 Transitions: 0.00/0.20 Variables: 0.00/0.20 0.00/0.20 Graph 1: 0.00/0.20 Transitions: 0.00/0.20 1 + e^0, n^0 -> 11 + n^0, rest remain the same}> 0.00/0.20 -1 + e^0, n^0 -> -10 + n^0, rest remain the same}> 0.00/0.20 Variables: 0.00/0.20 e^0, n^0 0.00/0.20 0.00/0.20 Precedence: 0.00/0.20 Graph 0 0.00/0.20 0.00/0.20 Graph 1 0.00/0.20 0.00/0.20 0.00/0.20 Map Locations to Subgraph: 0.00/0.20 ( 0 , 0 ) 0.00/0.20 ( 1 , 1 ) 0.00/0.20 0.00/0.20 ******************************************************************************************* 0.00/0.20 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.20 ******************************************************************************************* 0.00/0.20 0.00/0.20 Proving termination of subgraph 0 0.00/0.20 Proving termination of subgraph 1 0.00/0.20 Checking unfeasibility... 0.00/0.20 Time used: 0.183024 0.00/0.20 0.00/0.20 Checking conditional termination of SCC {l1}... 0.00/0.20 0.00/0.20 LOG: CALL solveLinear 0.00/0.20 0.00/0.20 LOG: RETURN solveLinear - Elapsed time: 0.001572s 0.00/0.20 Ranking function: 181 + 21*e^0 - 2*n^0 0.00/0.20 New Graphs: 0.00/0.20 Transitions: 0.00/0.20 -1 + e^0, n^0 -> -10 + n^0, rest remain the same}> 0.00/0.20 Variables: 0.00/0.20 e^0, n^0 0.00/0.20 Checking conditional termination of SCC {l1}... 0.00/0.20 0.00/0.20 LOG: CALL solveLinear 0.00/0.20 0.00/0.20 LOG: RETURN solveLinear - Elapsed time: 0.000619s 0.00/0.20 Ranking function: -1 + e^0 0.00/0.20 New Graphs: 0.00/0.20 Program Terminates 0.00/0.21 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 0.00/0.21 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 0.00/0.21 EOF