0.00/0.02 YES 0.00/0.02 0.00/0.03 Solver Timeout: 4 0.00/0.03 Global Timeout: 300 0.00/0.03 No parsing errors! 0.00/0.03 Init Location: 0 0.00/0.03 Transitions: 0.00/0.03 0.00/0.03 0.00/0.03 0.00/0.03 (1 + i13^0)}> 0.00/0.03 0.00/0.03 0, n12^0 -> (0 + n^0), tmp___0^0 -> undef35}> 0.00/0.03 (1 + i10^0)}> 0.00/0.03 0, n9^0 -> undef46, n^0 -> undef47, tmp^0 -> undef48}> 0.00/0.03 0.00/0.03 0.00/0.03 Fresh variables: 0.00/0.03 undef35, undef46, undef47, undef48, 0.00/0.03 0.00/0.03 Undef variables: 0.00/0.03 undef35, undef46, undef47, undef48, 0.00/0.03 0.00/0.03 Abstraction variables: 0.00/0.03 0.00/0.03 Exit nodes: 0.00/0.03 0.00/0.03 Accepting locations: 0.00/0.03 0.00/0.03 Asserts: 0.00/0.03 0.00/0.03 Preprocessed LLVMGraph 0.00/0.03 Init Location: 0 0.00/0.03 Transitions: 0.00/0.03 0.00/0.03 0, n12^0 -> (0 + n^0)}> 0.00/0.03 (1 + i10^0)}> 0.00/0.03 0.00/0.03 (1 + i13^0)}> 0.00/0.03 0.00/0.03 Fresh variables: 0.00/0.03 undef35, undef46, undef47, undef48, 0.00/0.03 0.00/0.03 Undef variables: 0.00/0.03 undef35, undef46, undef47, undef48, 0.00/0.03 0.00/0.03 Abstraction variables: 0.00/0.03 0.00/0.03 Exit nodes: 0.00/0.03 0.00/0.03 Accepting locations: 0.00/0.03 0.00/0.03 Asserts: 0.00/0.03 0.00/0.03 ************************************************************* 0.00/0.03 ******************************************************************************************* 0.00/0.03 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.03 ******************************************************************************************* 0.00/0.03 0.00/0.03 Init Location: 0 0.00/0.03 Graph 0: 0.00/0.03 Transitions: 0.00/0.03 Variables: 0.00/0.03 0.00/0.03 Graph 1: 0.00/0.03 Transitions: 0.00/0.03 1 + i10^0, rest remain the same}> 0.00/0.03 Variables: 0.00/0.03 i10^0, n9^0 0.00/0.03 0.00/0.03 Graph 2: 0.00/0.03 Transitions: 0.00/0.03 1 + i13^0, rest remain the same}> 0.00/0.03 Variables: 0.00/0.03 i13^0, n12^0 0.00/0.03 0.00/0.03 Graph 3: 0.00/0.03 Transitions: 0.00/0.03 Variables: 0.00/0.03 0.00/0.03 Precedence: 0.00/0.03 Graph 0 0.00/0.03 0.00/0.03 Graph 1 0.00/0.03 0.00/0.03 0.00/0.03 Graph 2 0.00/0.03 0, n12^0 -> n^0, rest remain the same}> 0.00/0.03 0.00/0.03 Graph 3 0.00/0.03 0.00/0.03 0.00/0.03 Map Locations to Subgraph: 0.00/0.03 ( 0 , 0 ) 0.00/0.03 ( 1 , 1 ) 0.00/0.03 ( 4 , 3 ) 0.00/0.03 ( 5 , 2 ) 0.00/0.03 0.00/0.03 ******************************************************************************************* 0.00/0.03 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.03 ******************************************************************************************* 0.00/0.03 0.00/0.03 Proving termination of subgraph 0 0.00/0.03 Proving termination of subgraph 1 0.00/0.03 Checking unfeasibility... 0.00/0.03 Time used: 0.00217 0.00/0.03 0.00/0.03 Checking conditional termination of SCC {l1}... 0.00/0.03 0.00/0.03 LOG: CALL solveLinear 0.00/0.03 0.00/0.03 LOG: RETURN solveLinear - Elapsed time: 0.000797s 0.00/0.03 Ranking function: -1 - i10^0 + n9^0 0.00/0.03 New Graphs: 0.00/0.03 Proving termination of subgraph 2 0.00/0.03 Checking unfeasibility... 0.00/0.03 Time used: 0.001646 0.00/0.03 0.00/0.03 Checking conditional termination of SCC {l5}... 0.00/0.03 0.00/0.03 LOG: CALL solveLinear 0.00/0.03 0.00/0.03 LOG: RETURN solveLinear - Elapsed time: 0.000818s 0.00/0.03 Ranking function: -1 - i13^0 + n12^0 0.00/0.03 New Graphs: 0.00/0.03 Proving termination of subgraph 3 0.00/0.03 Analyzing SCC {l4}... 0.00/0.03 No cycles found. 0.00/0.03 0.00/0.03 Program Terminates 0.00/0.03 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 0.00/0.03 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 0.00/0.03 EOF