0.00/0.07 YES 0.00/0.07 0.00/0.07 Solver Timeout: 4 0.00/0.07 Global Timeout: 300 0.00/0.07 No parsing errors! 0.00/0.07 Init Location: 0 0.00/0.07 Transitions: 0.00/0.07 0.00/0.07 0}> 0.00/0.07 (arg1 + 2)}> 0.00/0.07 10) /\ (arg1 < 20), par{arg1 -> (arg1 + 2)}> 0.00/0.07 undef4}> 0.00/0.07 0.00/0.07 Fresh variables: 0.00/0.07 undef4, 0.00/0.07 0.00/0.07 Undef variables: 0.00/0.07 undef4, 0.00/0.07 0.00/0.07 Abstraction variables: 0.00/0.07 0.00/0.07 Exit nodes: 0.00/0.07 0.00/0.07 Accepting locations: 0.00/0.07 0.00/0.07 Asserts: 0.00/0.07 0.00/0.07 Preprocessed LLVMGraph 0.00/0.07 Init Location: 0 0.00/0.07 Transitions: 0.00/0.07 0.00/0.07 (arg1 + 2)}> 0.00/0.07 10) /\ (arg1 < 20), par{arg1 -> (arg1 + 2)}> 0.00/0.07 0.00/0.07 Fresh variables: 0.00/0.07 undef4, 0.00/0.07 0.00/0.07 Undef variables: 0.00/0.07 undef4, 0.00/0.07 0.00/0.07 Abstraction variables: 0.00/0.07 0.00/0.07 Exit nodes: 0.00/0.07 0.00/0.07 Accepting locations: 0.00/0.07 0.00/0.07 Asserts: 0.00/0.07 0.00/0.07 ************************************************************* 0.00/0.07 ******************************************************************************************* 0.00/0.07 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.07 ******************************************************************************************* 0.00/0.07 0.00/0.07 Init Location: 0 0.00/0.07 Graph 0: 0.00/0.07 Transitions: 0.00/0.07 Variables: 0.00/0.07 0.00/0.07 Graph 1: 0.00/0.07 Transitions: 0.00/0.07 2 + arg1, rest remain the same}> 0.00/0.07 2 + arg1, rest remain the same}> 0.00/0.07 Variables: 0.00/0.07 arg1 0.00/0.07 0.00/0.07 Precedence: 0.00/0.07 Graph 0 0.00/0.07 0.00/0.07 Graph 1 0.00/0.07 0.00/0.07 0.00/0.07 Map Locations to Subgraph: 0.00/0.07 ( 0 , 0 ) 0.00/0.07 ( 2 , 1 ) 0.00/0.07 0.00/0.07 ******************************************************************************************* 0.00/0.07 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.07 ******************************************************************************************* 0.00/0.07 0.00/0.07 Proving termination of subgraph 0 0.00/0.07 Proving termination of subgraph 1 0.00/0.07 Checking unfeasibility... 0.00/0.07 Time used: 0.054659 0.00/0.07 0.00/0.07 Checking conditional termination of SCC {l2}... 0.00/0.07 0.00/0.07 LOG: CALL solveLinear 0.00/0.07 0.00/0.07 LOG: RETURN solveLinear - Elapsed time: 0.001444s 0.00/0.07 Ranking function: 200 - 20*arg1 0.00/0.07 New Graphs: 0.00/0.07 Transitions: 0.00/0.07 2 + arg1, rest remain the same}> 0.00/0.08 Variables: 0.00/0.08 arg1 0.00/0.08 Checking conditional termination of SCC {l2}... 0.00/0.08 0.00/0.08 LOG: CALL solveLinear 0.00/0.08 0.00/0.08 LOG: RETURN solveLinear - Elapsed time: 0.000583s 0.00/0.08 Ranking function: (19 / 2) + (~(1) / 2)*arg1 0.00/0.08 New Graphs: 0.00/0.08 Program Terminates 0.00/0.08 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 0.00/0.08 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 0.00/0.08 EOF