0.00/0.23 YES 0.00/0.23 0.00/0.23 Solver Timeout: 4 0.00/0.23 Global Timeout: 300 0.00/0.23 No parsing errors! 0.00/0.23 Init Location: 0 0.00/0.23 Transitions: 0.00/0.23 0.00/0.23 0) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> 0, arg4 -> 0}> 0.00/0.23 0) /\ (undef5 > ~(1)) /\ (1 = arg2), par{arg1 -> undef5, arg2 -> 0, arg3 -> 1, arg4 -> 1}> 0.00/0.23 ~(1)) /\ (arg2 > 1) /\ (undef9 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef9, arg2 -> undef10, arg3 -> arg2, arg4 -> 2}> 0.00/0.23 ~(1)) /\ ((arg1 - 1) < arg1) /\ (arg4 >= arg3) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg1 - 1)}> 0.00/0.23 0) /\ (arg3 > 0) /\ (arg4 > ~(1)) /\ (arg4 < arg3) /\ ((arg4 + 1) <= arg3) /\ (undef21 > ~(1)), par{arg1 -> ((arg1 - 1) - undef21), arg2 -> ((arg1 - 1) - undef21), arg4 -> (arg4 + 1)}> 0.00/0.23 undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> undef25}> 0.00/0.23 0.00/0.23 Fresh variables: 0.00/0.23 undef5, undef9, undef10, undef21, undef22, undef23, undef24, undef25, 0.00/0.23 0.00/0.23 Undef variables: 0.00/0.23 undef5, undef9, undef10, undef21, undef22, undef23, undef24, undef25, 0.00/0.23 0.00/0.23 Abstraction variables: 0.00/0.23 0.00/0.23 Exit nodes: 0.00/0.23 0.00/0.23 Accepting locations: 0.00/0.23 0.00/0.23 Asserts: 0.00/0.23 0.00/0.23 Preprocessed LLVMGraph 0.00/0.23 Init Location: 0 0.00/0.23 Transitions: 0.00/0.23 0) /\ (0 = undef23), par{arg1 -> 0, arg2 -> 0, arg3 -> 0, arg4 -> 0}> 0.00/0.23 0) /\ (undef5 > ~(1)) /\ (1 = undef23), par{arg1 -> undef5, arg2 -> 0, arg3 -> 1, arg4 -> 1}> 0.00/0.23 ~(1)) /\ (undef23 > 1) /\ (undef9 > ~(1)) /\ (undef22 > 0), par{arg1 -> undef9, arg2 -> undef10, arg3 -> undef23, arg4 -> 2}> 0.00/0.23 ~(1)) /\ ((arg1 - 1) < arg1) /\ (arg4 >= arg3) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg1 - 1)}> 0.00/0.23 0) /\ (arg3 > 0) /\ (arg4 > ~(1)) /\ (arg4 < arg3) /\ ((arg4 + 1) <= arg3) /\ (undef21 > ~(1)), par{arg1 -> ((arg1 - 1) - undef21), arg2 -> ((arg1 - 1) - undef21), arg4 -> (arg4 + 1)}> 0.00/0.23 0.00/0.23 Fresh variables: 0.00/0.23 undef5, undef9, undef10, undef21, undef22, undef23, undef24, undef25, 0.00/0.23 0.00/0.23 Undef variables: 0.00/0.23 undef5, undef9, undef10, undef21, undef22, undef23, undef24, undef25, 0.00/0.23 0.00/0.23 Abstraction variables: 0.00/0.23 0.00/0.23 Exit nodes: 0.00/0.23 0.00/0.23 Accepting locations: 0.00/0.23 0.00/0.23 Asserts: 0.00/0.23 0.00/0.23 ************************************************************* 0.00/0.23 ******************************************************************************************* 0.00/0.23 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.23 ******************************************************************************************* 0.00/0.23 0.00/0.23 Init Location: 0 0.00/0.23 Graph 0: 0.00/0.23 Transitions: 0.00/0.23 Variables: 0.00/0.23 0.00/0.23 Graph 1: 0.00/0.23 Transitions: 0.00/0.23 -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> 0.00/0.23 -1 + arg1 - undef21, arg2 -> -1 + arg1 - undef21, arg4 -> 1 + arg4, rest remain the same}> 0.00/0.23 Variables: 0.00/0.23 arg1, arg2, arg3, arg4 0.00/0.23 0.00/0.23 Precedence: 0.00/0.23 Graph 0 0.00/0.23 0.00/0.23 Graph 1 0.00/0.23 0, arg2 -> 0, arg3 -> 0, arg4 -> 0, rest remain the same}> 0.00/0.23 undef5, arg2 -> 0, arg3 -> 1, arg4 -> 1, rest remain the same}> 0.00/0.23 undef9, arg2 -> undef10, arg3 -> undef23, arg4 -> 2, rest remain the same}> 0.00/0.23 0.00/0.23 Map Locations to Subgraph: 0.00/0.23 ( 0 , 0 ) 0.00/0.23 ( 2 , 1 ) 0.00/0.23 0.00/0.23 ******************************************************************************************* 0.00/0.23 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.23 ******************************************************************************************* 0.00/0.23 0.00/0.23 Proving termination of subgraph 0 0.00/0.23 Proving termination of subgraph 1 0.00/0.23 Checking unfeasibility... 0.00/0.23 Time used: 0.007046 0.00/0.23 0.00/0.23 Checking conditional termination of SCC {l2}... 0.00/0.23 0.00/0.23 LOG: CALL solveLinear 0.00/0.23 0.00/0.23 LOG: RETURN solveLinear - Elapsed time: 0.001876s 0.00/0.23 Ranking function: -2 + 2*arg3 - 2*arg4 0.00/0.23 New Graphs: 0.00/0.23 Transitions: 0.00/0.23 -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> 0.00/0.23 Variables: 0.00/0.23 arg1, arg2, arg3, arg4 0.00/0.23 Checking conditional termination of SCC {l2}... 0.00/0.23 0.00/0.23 LOG: CALL solveLinear 0.00/0.23 0.00/0.23 LOG: RETURN solveLinear - Elapsed time: 0.000648s 0.00/0.23 0.00/0.23 LOG: CALL solveLinear 0.00/0.23 0.00/0.23 LOG: RETURN solveLinear - Elapsed time: 0.002588s 0.00/0.23 Trying to remove transition: -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> 0.00/0.23 Solving with 1 template(s). 0.00/0.23 0.00/0.23 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.23 0.00/0.23 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010462s 0.00/0.23 Time used: 0.010256 0.00/0.23 Solving with 1 template(s). 0.00/0.23 0.00/0.23 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.23 0.00/0.23 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020210s 0.00/0.23 Time used: 0.019489 0.00/0.23 Improving Solution with cost 1 ... 0.00/0.23 0.00/0.23 LOG: CALL solveNonLinearGetNextSolution 0.00/0.23 0.00/0.23 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.038607s 0.00/0.23 Time used: 0.0386 0.00/0.23 0.00/0.23 LOG: SAT solveNonLinear - Elapsed time: 0.058816s 0.00/0.23 Cost: 1; Total time: 0.058089 0.00/0.23 Failed at location 2: arg2 <= 0 0.00/0.23 Before Improving: 0.00/0.23 Quasi-invariant at l2: arg2 <= 0 0.00/0.23 Optimizing invariants... 0.00/0.23 0.00/0.23 LOG: CALL solveLinear 0.00/0.23 0.00/0.23 LOG: RETURN solveLinear - Elapsed time: 0.004572s 0.00/0.23 Remaining time after improvement: 0.998116 0.00/0.23 Termination implied by a set of quasi-invariant(s): 0.00/0.23 Quasi-invariant at l2: arg2 <= 0 0.00/0.23 [ Invariant Graph ] 0.00/0.23 Strengthening and disabling transitions... 0.00/0.23 0.00/0.23 LOG: CALL solverLinear in Graph for feasibility 0.00/0.23 0.00/0.23 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.23 It's unfeasible. Removing transition: 0.00/0.23 -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> 0.00/0.23 0.00/0.23 LOG: CALL solverLinear in Graph for feasibility 0.00/0.23 0.00/0.23 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.23 It's unfeasible. Removing transition: 0.00/0.23 -1 + arg1 - undef21, arg2 -> -1 + arg1 - undef21, arg4 -> 1 + arg4, rest remain the same}> 0.00/0.23 [ Termination Graph ] 0.00/0.23 Strengthening and disabling transitions... 0.00/0.23 0.00/0.23 LOG: CALL solverLinear in Graph for feasibility 0.00/0.23 0.00/0.23 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.23 It's unfeasible. Removing transition: 0.00/0.23 -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> 0.00/0.23 New Graphs: 0.00/0.23 Calling Safety with literal arg2 <= 0 and entry undef9, arg2 -> undef10, arg3 -> undef23, arg4 -> 2, rest remain the same}> 0.00/0.23 0.00/0.23 LOG: CALL check - Post:arg2 <= 0 - Process 1 0.00/0.23 * Exit transition: undef9, arg2 -> undef10, arg3 -> undef23, arg4 -> 2, rest remain the same}> 0.00/0.23 * Postcondition : arg2 <= 0 0.00/0.23 0.00/0.23 LOG: CALL solveLinear 0.00/0.23 0.00/0.23 LOG: RETURN solveLinear - Elapsed time: 0.000605s 0.00/0.23 > Postcondition is not implied! 0.00/0.23 0.00/0.23 LOG: RETURN check - Elapsed time: 0.000716s 0.00/0.23 INVARIANTS: 0.00/0.23 2: 0.00/0.23 Quasi-INVARIANTS to narrow Graph: 0.00/0.23 2: arg2 <= 0 , 0.00/0.23 Narrowing transition: 0.00/0.23 -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> 0.00/0.23 0.00/0.23 LOG: Narrow transition size 1 0.00/0.23 Narrowing transition: 0.00/0.23 -1 + arg1 - undef21, arg2 -> -1 + arg1 - undef21, arg4 -> 1 + arg4, rest remain the same}> 0.00/0.23 0.00/0.23 LOG: Narrow transition size 1 0.00/0.23 invGraph after Narrowing: 0.00/0.23 Transitions: 0.00/0.23 -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> 0.00/0.23 -1 + arg1 - undef21, arg2 -> -1 + arg1 - undef21, arg4 -> 1 + arg4, rest remain the same}> 0.00/0.23 Variables: 0.00/0.23 arg1, arg2, arg3, arg4 0.00/0.23 Checking conditional termination of SCC {l2}... 0.00/0.23 0.00/0.23 LOG: CALL solveLinear 0.00/0.23 0.00/0.23 LOG: RETURN solveLinear - Elapsed time: 0.001675s 0.00/0.23 Ranking function: -2 + 2*arg3 - 2*arg4 0.00/0.23 New Graphs: 0.00/0.23 Transitions: 0.00/0.23 -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> 0.00/0.23 Variables: 0.00/0.23 arg1, arg2, arg3, arg4 0.00/0.23 Checking conditional termination of SCC {l2}... 0.00/0.23 0.00/0.23 LOG: CALL solveLinear 0.00/0.23 0.00/0.23 LOG: RETURN solveLinear - Elapsed time: 0.000649s 0.00/0.23 0.00/0.23 LOG: CALL solveLinear 0.00/0.23 0.00/0.23 LOG: RETURN solveLinear - Elapsed time: 0.002760s 0.00/0.23 Trying to remove transition: -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> 0.00/0.23 Solving with 1 template(s). 0.00/0.23 0.00/0.23 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.23 0.00/0.23 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009745s 0.00/0.23 Time used: 0.009555 0.00/0.23 Solving with 1 template(s). 0.00/0.23 0.00/0.23 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.23 0.00/0.23 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021910s 0.00/0.23 Time used: 0.02122 0.00/0.23 Improving Solution with cost 1 ... 0.00/0.23 0.00/0.23 LOG: CALL solveNonLinearGetNextSolution 0.00/0.23 0.00/0.23 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.040344s 0.00/0.23 Time used: 0.040337 0.00/0.23 0.00/0.23 LOG: SAT solveNonLinear - Elapsed time: 0.062255s 0.00/0.23 Cost: 1; Total time: 0.061557 0.00/0.23 Failed at location 2: 1 + arg1 + arg4 <= arg3 0.00/0.23 Before Improving: 0.00/0.23 Quasi-invariant at l2: 1 + arg1 + arg4 <= arg3 0.00/0.23 Optimizing invariants... 0.00/0.23 0.00/0.23 LOG: CALL solveLinear 0.00/0.23 0.00/0.23 LOG: RETURN solveLinear - Elapsed time: 0.005459s 0.00/0.23 Quasi-invariant improved 0.00/0.23 0.00/0.23 LOG: CALL solveLinear 0.00/0.23 0.00/0.23 LOG: RETURN solveLinear - Elapsed time: 0.002892s 0.00/0.23 Quasi-invariant improved 0.00/0.23 0.00/0.23 LOG: CALL solveLinear 0.00/0.23 0.00/0.23 LOG: RETURN solveLinear - Elapsed time: 0.002295s 0.00/0.23 Remaining time after improvement: 0.992316 0.00/0.23 Termination implied by a set of quasi-invariant(s): 0.00/0.23 Quasi-invariant at l2: arg1 + arg4 <= 1 + arg3 0.00/0.23 [ Invariant Graph ] 0.00/0.23 Strengthening and disabling transitions... 0.00/0.23 0.00/0.23 LOG: CALL solverLinear in Graph for feasibility 0.00/0.23 0.00/0.23 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.23 Strengthening transition (result): 0.00/0.23 -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> 0.00/0.23 0.00/0.23 LOG: CALL solverLinear in Graph for feasibility 0.00/0.23 0.00/0.23 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.23 Strengthening transition (result): 0.00/0.23 -1 + arg1 - undef21, arg2 -> -1 + arg1 - undef21, arg4 -> 1 + arg4, rest remain the same}> 0.00/0.23 [ Termination Graph ] 0.00/0.23 Strengthening and disabling transitions... 0.00/0.23 0.00/0.23 LOG: CALL solverLinear in Graph for feasibility 0.00/0.23 0.00/0.23 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.23 Strengthening transition (result): 0.00/0.23 -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> 0.00/0.23 Ranking function: arg2 0.00/0.23 New Graphs: 0.00/0.23 Calling Safety with literal arg1 + arg4 <= 1 + arg3 and entry undef9, arg2 -> undef10, arg3 -> undef23, arg4 -> 2, rest remain the same}> 0.00/0.23 0.00/0.23 LOG: CALL check - Post:arg1 + arg4 <= 1 + arg3 - Process 2 0.00/0.23 * Exit transition: undef9, arg2 -> undef10, arg3 -> undef23, arg4 -> 2, rest remain the same}> 0.00/0.23 * Postcondition : arg1 + arg4 <= 1 + arg3 0.00/0.23 0.00/0.23 LOG: CALL solveLinear 0.00/0.23 0.00/0.23 LOG: RETURN solveLinear - Elapsed time: 0.000536s 0.00/0.23 > Postcondition is not implied! 0.00/0.23 0.00/0.23 LOG: RETURN check - Elapsed time: 0.000656s 0.00/0.23 INVARIANTS: 0.00/0.23 2: 0.00/0.23 Quasi-INVARIANTS to narrow Graph: 0.00/0.23 2: arg1 + arg4 <= 1 + arg3 , 0.00/0.23 Narrowing transition: 0.00/0.23 -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> 0.00/0.23 0.00/0.23 LOG: Narrow transition size 1 0.00/0.23 Narrowing transition: 0.00/0.23 -1 + arg1 - undef21, arg2 -> -1 + arg1 - undef21, arg4 -> 1 + arg4, rest remain the same}> 0.00/0.23 0.00/0.23 LOG: Narrow transition size 1 0.00/0.23 invGraph after Narrowing: 0.00/0.23 Transitions: 0.00/0.23 -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> 0.00/0.23 -1 + arg1 - undef21, arg2 -> -1 + arg1 - undef21, arg4 -> 1 + arg4, rest remain the same}> 0.00/0.23 Variables: 0.00/0.23 arg1, arg2, arg3, arg4 0.00/0.23 Checking conditional termination of SCC {l2}... 0.00/0.23 0.00/0.23 LOG: CALL solveLinear 0.00/0.23 0.00/0.23 LOG: RETURN solveLinear - Elapsed time: 0.002211s 0.00/0.23 Ranking function: -2 + arg1 - arg3 + arg4 0.00/0.23 New Graphs: 0.00/0.23 Transitions: 0.00/0.23 -1 + arg1 - undef21, arg2 -> -1 + arg1 - undef21, arg4 -> 1 + arg4, rest remain the same}> 0.00/0.23 Variables: 0.00/0.23 arg1, arg2, arg3, arg4 0.00/0.23 Checking conditional termination of SCC {l2}... 0.00/0.23 0.00/0.23 LOG: CALL solveLinear 0.00/0.23 0.00/0.23 LOG: RETURN solveLinear - Elapsed time: 0.001334s 0.00/0.23 Ranking function: -1 + arg3 - arg4 0.00/0.23 New Graphs: 0.00/0.23 Program Terminates 0.00/0.23 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 0.00/0.23 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 0.00/0.23 EOF