0.00/0.21 YES 0.00/0.21 0.00/0.21 Solver Timeout: 4 0.00/0.21 Global Timeout: 300 0.00/0.21 No parsing errors! 0.00/0.21 Init Location: 0 0.00/0.21 Transitions: 0.00/0.21 0.00/0.21 13), par{arg1 -> undef1, arg2 -> 0, arg3 -> 10}> 0.00/0.21 ~(1)) /\ (arg3 > 0) /\ (undef4 <= arg1) /\ (arg1 > 2) /\ (undef4 > 2) /\ ((arg3 + 4) <= arg1), par{arg1 -> undef4, arg2 -> (arg2 + 10), arg3 -> (arg3 - 1)}> 0.00/0.21 undef7, arg2 -> undef8, arg3 -> undef9}> 0.00/0.21 0.00/0.21 Fresh variables: 0.00/0.21 undef1, undef4, undef7, undef8, undef9, 0.00/0.21 0.00/0.21 Undef variables: 0.00/0.21 undef1, undef4, undef7, undef8, undef9, 0.00/0.21 0.00/0.21 Abstraction variables: 0.00/0.21 0.00/0.21 Exit nodes: 0.00/0.21 0.00/0.21 Accepting locations: 0.00/0.21 0.00/0.21 Asserts: 0.00/0.21 0.00/0.21 Preprocessed LLVMGraph 0.00/0.21 Init Location: 0 0.00/0.21 Transitions: 0.00/0.21 13)> 0.00/0.21 ~(1)) /\ (arg3 > 0) /\ (undef4 <= arg1) /\ (arg1 > 2) /\ (undef4 > 2) /\ ((arg3 + 4) <= arg1), par{arg1 -> undef4, arg2 -> (arg2 + 10), arg3 -> (arg3 - 1)}> 0.00/0.21 0.00/0.21 Fresh variables: 0.00/0.21 undef1, undef4, undef7, undef8, undef9, 0.00/0.21 0.00/0.21 Undef variables: 0.00/0.21 undef1, undef4, undef7, undef8, undef9, 0.00/0.21 0.00/0.21 Abstraction variables: 0.00/0.21 0.00/0.21 Exit nodes: 0.00/0.21 0.00/0.21 Accepting locations: 0.00/0.21 0.00/0.21 Asserts: 0.00/0.21 0.00/0.21 ************************************************************* 0.00/0.21 ******************************************************************************************* 0.00/0.21 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.21 ******************************************************************************************* 0.00/0.21 0.00/0.21 Init Location: 0 0.00/0.21 Graph 0: 0.00/0.21 Transitions: 0.00/0.21 Variables: 0.00/0.21 0.00/0.21 Graph 1: 0.00/0.21 Transitions: 0.00/0.21 undef4, arg2 -> 10 + arg2, arg3 -> -1 + arg3, rest remain the same}> 0.00/0.21 Variables: 0.00/0.21 arg1, arg2, arg3 0.00/0.21 0.00/0.21 Precedence: 0.00/0.21 Graph 0 0.00/0.21 0.00/0.21 Graph 1 0.00/0.21 0.00/0.21 0.00/0.21 Map Locations to Subgraph: 0.00/0.21 ( 0 , 0 ) 0.00/0.21 ( 2 , 1 ) 0.00/0.21 0.00/0.21 ******************************************************************************************* 0.00/0.21 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.21 ******************************************************************************************* 0.00/0.21 0.00/0.21 Proving termination of subgraph 0 0.00/0.21 Proving termination of subgraph 1 0.00/0.21 Checking unfeasibility... 0.00/0.21 Time used: 0.187523 0.00/0.21 0.00/0.21 Checking conditional termination of SCC {l2}... 0.00/0.21 0.00/0.21 LOG: CALL solveLinear 0.00/0.21 0.00/0.21 LOG: RETURN solveLinear - Elapsed time: 0.002306s 0.00/0.21 Ranking function: -1 + arg3 0.00/0.21 New Graphs: 0.00/0.21 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