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