0.00/0.25 YES 0.00/0.25 0.00/0.25 Solver Timeout: 4 0.00/0.25 Global Timeout: 300 0.00/0.25 No parsing errors! 0.00/0.25 Init Location: 0 0.00/0.25 Transitions: 0.00/0.25 0.00/0.25 undef1, c2^0 -> undef2, m^0 -> (~(1) + undef20), pi^0 -> (~(1) + undef22), pos^0 -> undef7, seq^0 -> undef8, wpos^0 -> 0, z^0 -> undef10}> 0.00/0.25 0.00/0.25 undef41, m^0 -> undef43, max^0 -> undef44, n^0 -> undef45, pi^0 -> (0 + undef48), pos^0 -> (1 + undef51), seq^0 -> undef48, wpos^0 -> 0, z^0 -> undef50}> 0.00/0.25 0.00/0.25 0.00/0.25 Fresh variables: 0.00/0.25 undef1, undef2, undef7, undef8, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef41, undef43, undef44, undef45, undef48, undef50, undef51, 0.00/0.25 0.00/0.25 Undef variables: 0.00/0.25 undef1, undef2, undef7, undef8, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef41, undef43, undef44, undef45, undef48, undef50, undef51, 0.00/0.25 0.00/0.25 Abstraction variables: 0.00/0.25 0.00/0.25 Exit nodes: 0.00/0.25 0.00/0.25 Accepting locations: 0.00/0.25 0.00/0.25 Asserts: 0.00/0.25 0.00/0.25 Preprocessed LLVMGraph 0.00/0.25 Init Location: 0 0.00/0.25 Transitions: 0.00/0.25 0.00/0.25 (~(1) + undef20), pi^0 -> (~(1) + undef22), pos^0 -> undef7, seq^0 -> undef8, wpos^0 -> 0, z^0 -> undef10}> 0.00/0.25 0.00/0.25 Fresh variables: 0.00/0.25 undef1, undef2, undef7, undef8, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef41, undef43, undef44, undef45, undef48, undef50, undef51, 0.00/0.25 0.00/0.25 Undef variables: 0.00/0.25 undef1, undef2, undef7, undef8, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef41, undef43, undef44, undef45, undef48, undef50, undef51, 0.00/0.25 0.00/0.25 Abstraction variables: 0.00/0.25 0.00/0.25 Exit nodes: 0.00/0.25 0.00/0.25 Accepting locations: 0.00/0.25 0.00/0.25 Asserts: 0.00/0.25 0.00/0.25 ************************************************************* 0.00/0.25 ******************************************************************************************* 0.00/0.25 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.25 ******************************************************************************************* 0.24/0.25 0.24/0.25 Init Location: 0 0.24/0.25 Graph 0: 0.24/0.25 Transitions: 0.24/0.25 Variables: 0.24/0.25 0.24/0.25 Graph 1: 0.24/0.25 Transitions: 0.24/0.25 -1 + undef20, pi^0 -> -1 + undef22, pos^0 -> undef7, seq^0 -> undef8, wpos^0 -> 0, z^0 -> undef10, rest remain the same}> 0.24/0.25 Variables: 0.24/0.25 m^0, max^0, pi^0, pos^0, seq^0, wpos^0, z^0 0.24/0.25 0.24/0.25 Precedence: 0.24/0.25 Graph 0 0.24/0.25 0.24/0.25 Graph 1 0.24/0.25 0.24/0.25 0.24/0.25 Map Locations to Subgraph: 0.24/0.25 ( 0 , 0 ) 0.24/0.25 ( 1 , 1 ) 0.24/0.25 0.24/0.25 ******************************************************************************************* 0.24/0.25 ******************************** CHECKING ASSERTIONS ******************************** 0.24/0.25 ******************************************************************************************* 0.24/0.25 0.24/0.25 Proving termination of subgraph 0 0.24/0.25 Proving termination of subgraph 1 0.24/0.25 Checking unfeasibility... 0.24/0.25 Time used: 0.023052 0.24/0.25 0.24/0.25 Checking conditional termination of SCC {l1}... 0.24/0.25 0.24/0.25 LOG: CALL solveLinear 0.24/0.25 0.24/0.25 LOG: RETURN solveLinear - Elapsed time: 0.003801s 0.24/0.25 0.24/0.25 LOG: CALL solveLinear 0.24/0.25 0.24/0.25 LOG: RETURN solveLinear - Elapsed time: 0.029542s 0.24/0.25 Trying to remove transition: -1 + undef20, pi^0 -> -1 + undef22, pos^0 -> undef7, seq^0 -> undef8, wpos^0 -> 0, z^0 -> undef10, rest remain the same}> 0.24/0.25 Solving with 1 template(s). 0.24/0.25 0.24/0.25 LOG: CALL solveNonLinearGetFirstSolution 0.24/0.25 0.24/0.25 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.074211s 0.24/0.25 Time used: 0.071484 0.24/0.25 Solving with 1 template(s). 0.24/0.25 0.24/0.25 LOG: CALL solveNonLinearGetFirstSolution 0.24/0.25 0.24/0.25 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.042319s 0.24/0.25 Time used: 0.03967 0.24/0.25 0.24/0.25 LOG: SAT solveNonLinear - Elapsed time: 0.042319s 0.24/0.25 Cost: 0; Total time: 0.03967 0.24/0.25 Termination implied by a set of invariant(s): 0.24/0.25 Invariant at l1: seq^0 + wpos^0 <= 1 + pi^0 0.24/0.25 [ Invariant Graph ] 0.24/0.25 Strengthening and disabling transitions... 0.24/0.25 0.24/0.25 LOG: CALL solverLinear in Graph for feasibility 0.24/0.25 0.24/0.25 LOG: RETURN solveLinear in Graph for feasibility 0.24/0.25 Strengthening transition (result): 0.24/0.25 -1 + undef20, pi^0 -> -1 + undef22, pos^0 -> undef7, seq^0 -> undef8, wpos^0 -> 0, z^0 -> undef10, rest remain the same}> 0.24/0.25 [ Termination Graph ] 0.24/0.25 Strengthening and disabling transitions... 0.24/0.25 0.24/0.25 LOG: CALL solverLinear in Graph for feasibility 0.24/0.25 0.24/0.25 LOG: RETURN solveLinear in Graph for feasibility 0.24/0.25 Strengthening transition (result): 0.24/0.25 -1 + undef20, pi^0 -> -1 + undef22, pos^0 -> undef7, seq^0 -> undef8, wpos^0 -> 0, z^0 -> undef10, rest remain the same}> 0.24/0.25 Ranking function: max^0 - seq^0 0.24/0.25 New Graphs: 0.24/0.25 INVARIANTS: 0.24/0.25 1: seq^0 + wpos^0 <= 1 + pi^0 , 0.24/0.25 Quasi-INVARIANTS to narrow Graph: 0.24/0.25 1: 0.24/0.25 Program Terminates 0.24/0.25 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 0.24/0.25 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 0.24/0.25 EOF