11.78/11.81 NO 11.78/11.81 11.78/11.81 Solver Timeout: 4 11.78/11.81 Global Timeout: 300 11.78/11.81 No parsing errors! 11.78/11.81 Init Location: 0 11.78/11.81 Transitions: 11.78/11.81 11.78/11.81 ~(1)) /\ (undef1 > ~(1)), par{arg1 -> undef1, arg2 -> undef2}> 11.78/11.81 0) /\ (undef3 > ~(1)), par{arg1 -> undef3, arg2 -> undef4}> 11.78/11.81 0) /\ (arg1 > ~(1)) /\ (undef5 > ~(1)), par{arg1 -> undef5, arg2 -> undef6}> 11.78/11.81 1) /\ (undef8 > ~(1)), par{arg1 -> undef8, arg2 -> undef9}> 11.78/11.81 0) /\ (arg1 > 0) /\ (undef11 > 0), par{arg1 -> undef11, arg2 -> undef12}> 11.78/11.81 2) /\ (undef14 > 0), par{arg1 -> undef14, arg2 -> undef15}> 11.78/11.81 ~(1)) /\ (undef17 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef17, arg2 -> 1}> 11.78/11.81 0) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1)}> 11.78/11.81 undef21, arg2 -> undef22}> 11.78/11.81 11.78/11.81 Fresh variables: 11.78/11.81 undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef21, undef22, 11.78/11.81 11.78/11.81 Undef variables: 11.78/11.81 undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef21, undef22, 11.78/11.81 11.78/11.81 Abstraction variables: 11.78/11.81 11.78/11.81 Exit nodes: 11.78/11.81 11.78/11.81 Accepting locations: 11.78/11.81 11.78/11.81 Asserts: 11.78/11.81 11.78/11.81 Preprocessed LLVMGraph 11.78/11.81 Init Location: 0 11.78/11.81 Transitions: 11.78/11.81 0) /\ (undef3 > ~(1)) /\ (undef5 <= undef3) /\ (undef7 > 0) /\ (undef3 > ~(1)) /\ (undef5 > ~(1)), par{arg1 -> undef5, arg2 -> undef6}> 11.78/11.81 ~(1)) /\ (undef17 > ~(1)) /\ (undef21 > 0), par{arg1 -> undef17, arg2 -> 1}> 11.78/11.81 1) /\ (undef8 > ~(1)), par{arg1 -> undef8, arg2 -> undef9}> 11.78/11.81 0) /\ (arg1 > 0) /\ (undef11 > 0), par{arg1 -> undef11, arg2 -> undef12}> 11.78/11.81 2) /\ (undef14 > 0), par{arg1 -> undef14, arg2 -> undef15}> 11.78/11.81 0) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1)}> 11.78/11.81 11.78/11.81 Fresh variables: 11.78/11.81 undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef21, undef22, 11.78/11.81 11.78/11.81 Undef variables: 11.78/11.81 undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef21, undef22, 11.78/11.81 11.78/11.81 Abstraction variables: 11.78/11.81 11.78/11.81 Exit nodes: 11.78/11.81 11.78/11.81 Accepting locations: 11.78/11.81 11.78/11.81 Asserts: 11.78/11.81 11.78/11.81 ************************************************************* 11.78/11.81 ******************************************************************************************* 11.78/11.81 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 11.78/11.81 ******************************************************************************************* 11.78/11.81 11.78/11.81 Init Location: 0 11.78/11.81 Graph 0: 11.78/11.81 Transitions: 11.78/11.81 Variables: 11.78/11.81 11.78/11.81 Graph 1: 11.78/11.81 Transitions: 11.78/11.81 -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> 11.78/11.81 Variables: 11.78/11.81 arg1, arg2 11.78/11.81 11.78/11.81 Graph 2: 11.78/11.81 Transitions: 11.78/11.81 undef8, arg2 -> undef9, rest remain the same}> 11.78/11.81 undef11, arg2 -> undef12, rest remain the same}> 11.78/11.81 undef14, arg2 -> undef15, rest remain the same}> 11.78/11.81 Variables: 11.78/11.81 arg1, arg2 11.78/11.81 11.78/11.81 Precedence: 11.78/11.81 Graph 0 11.78/11.81 11.78/11.81 Graph 1 11.78/11.81 undef17, arg2 -> 1, rest remain the same}> 11.78/11.81 11.78/11.81 Graph 2 11.78/11.81 undef5, arg2 -> undef6, rest remain the same}> 11.78/11.81 11.78/11.81 Map Locations to Subgraph: 11.78/11.81 ( 0 , 0 ) 11.78/11.81 ( 4 , 2 ) 11.78/11.81 ( 5 , 1 ) 11.78/11.81 11.78/11.81 ******************************************************************************************* 11.78/11.81 ******************************** CHECKING ASSERTIONS ******************************** 11.78/11.81 ******************************************************************************************* 11.78/11.81 11.78/11.81 Proving termination of subgraph 0 11.78/11.81 Proving termination of subgraph 1 11.78/11.81 Checking unfeasibility... 11.78/11.81 Time used: 0.002496 11.78/11.81 11.78/11.81 Checking conditional termination of SCC {l5}... 11.78/11.81 11.78/11.81 LOG: CALL solveLinear 11.78/11.81 11.78/11.81 LOG: RETURN solveLinear - Elapsed time: 0.000705s 11.78/11.81 Ranking function: -1 + arg1 11.78/11.81 New Graphs: 11.78/11.81 Proving termination of subgraph 2 11.78/11.81 Checking unfeasibility... 11.78/11.81 Time used: 0.006906 11.78/11.81 11.78/11.81 Checking conditional termination of SCC {l4}... 11.78/11.81 11.78/11.81 LOG: CALL solveLinear 11.78/11.81 11.78/11.81 LOG: RETURN solveLinear - Elapsed time: 0.002193s 11.78/11.81 Ranking function: -8 + 4*arg1 11.78/11.81 New Graphs: 11.78/11.81 Transitions: 11.78/11.81 undef11, arg2 -> undef12, rest remain the same}> 11.78/11.81 Variables: 11.78/11.81 arg1, arg2 11.78/11.81 Checking conditional termination of SCC {l4}... 11.78/11.81 11.78/11.81 LOG: CALL solveLinear 11.78/11.81 11.78/11.81 LOG: RETURN solveLinear - Elapsed time: 0.000683s 11.78/11.81 11.78/11.81 LOG: CALL solveLinear 11.78/11.81 11.78/11.81 LOG: RETURN solveLinear - Elapsed time: 0.002508s 11.78/11.81 Trying to remove transition: undef11, arg2 -> undef12, rest remain the same}> 11.78/11.81 Solving with 1 template(s). 11.78/11.81 11.78/11.81 LOG: CALL solveNonLinearGetFirstSolution 11.78/11.81 11.78/11.81 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005527s 11.78/11.81 Time used: 0.00533 11.78/11.81 Solving with 1 template(s). 11.78/11.81 11.78/11.81 LOG: CALL solveNonLinearGetFirstSolution 11.78/11.81 11.78/11.81 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013779s 11.78/11.81 Time used: 0.013364 11.78/11.81 Improving Solution with cost 1 ... 11.78/11.81 11.78/11.81 LOG: CALL solveNonLinearGetNextSolution 11.78/11.81 11.78/11.81 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.028564s 11.78/11.81 Time used: 0.028555 11.78/11.81 11.78/11.81 LOG: SAT solveNonLinear - Elapsed time: 0.042344s 11.78/11.81 Cost: 1; Total time: 0.041919 11.78/11.81 Failed at location 4: arg1 <= 0 11.78/11.81 Before Improving: 11.78/11.81 Quasi-invariant at l4: arg1 <= 0 11.78/11.81 Optimizing invariants... 11.78/11.81 11.78/11.81 LOG: CALL solveLinear 11.78/11.81 11.78/11.81 LOG: RETURN solveLinear - Elapsed time: 0.004632s 11.78/11.81 Remaining time after improvement: 0.997969 11.78/11.81 Termination implied by a set of quasi-invariant(s): 11.78/11.81 Quasi-invariant at l4: arg1 <= 0 11.78/11.81 [ Invariant Graph ] 11.78/11.81 Strengthening and disabling transitions... 11.78/11.81 11.78/11.81 LOG: CALL solverLinear in Graph for feasibility 11.78/11.81 11.78/11.81 LOG: RETURN solveLinear in Graph for feasibility 11.78/11.81 It's unfeasible. Removing transition: 11.78/11.81 undef8, arg2 -> undef9, rest remain the same}> 11.78/11.81 11.78/11.81 LOG: CALL solverLinear in Graph for feasibility 11.78/11.81 11.78/11.81 LOG: RETURN solveLinear in Graph for feasibility 11.78/11.81 It's unfeasible. Removing transition: 11.78/11.81 undef11, arg2 -> undef12, rest remain the same}> 11.78/11.81 11.78/11.81 LOG: CALL solverLinear in Graph for feasibility 11.78/11.81 11.78/11.81 LOG: RETURN solveLinear in Graph for feasibility 11.78/11.81 It's unfeasible. Removing transition: 11.78/11.81 undef14, arg2 -> undef15, rest remain the same}> 11.78/11.81 [ Termination Graph ] 11.78/11.81 Strengthening and disabling transitions... 11.78/11.81 > It's unfeasible. Removing transition: 11.78/11.81 undef11, arg2 -> undef12, rest remain the same}> 11.78/11.81 New Graphs: 11.78/11.81 Calling Safety with literal arg1 <= 0 and entry undef5, arg2 -> undef6, rest remain the same}> 11.78/11.81 11.78/11.81 LOG: CALL check - Post:arg1 <= 0 - Process 1 11.78/11.81 * Exit transition: undef5, arg2 -> undef6, rest remain the same}> 11.78/11.81 * Postcondition : arg1 <= 0 11.78/11.81 11.78/11.81 LOG: CALL solveLinear 11.78/11.81 11.78/11.81 LOG: RETURN solveLinear - Elapsed time: 0.000632s 11.78/11.81 > Postcondition is not implied! 11.78/11.81 11.78/11.81 LOG: RETURN check - Elapsed time: 0.000750s 11.78/11.81 INVARIANTS: 11.78/11.81 4: 11.78/11.81 Quasi-INVARIANTS to narrow Graph: 11.78/11.81 4: arg1 <= 0 , 11.78/11.81 Narrowing transition: 11.78/11.81 undef8, arg2 -> undef9, rest remain the same}> 11.78/11.81 11.78/11.81 LOG: Narrow transition size 1 11.78/11.81 Narrowing transition: 11.78/11.81 undef11, arg2 -> undef12, rest remain the same}> 11.78/11.81 11.78/11.81 LOG: Narrow transition size 1 11.78/11.81 Narrowing transition: 11.78/11.81 undef14, arg2 -> undef15, rest remain the same}> 11.78/11.81 11.78/11.81 LOG: Narrow transition size 1 11.78/11.81 invGraph after Narrowing: 11.78/11.81 Transitions: 11.78/11.81 undef8, arg2 -> undef9, rest remain the same}> 11.78/11.81 undef11, arg2 -> undef12, rest remain the same}> 11.78/11.81 undef14, arg2 -> undef15, rest remain the same}> 11.78/11.81 Variables: 11.78/11.81 arg1, arg2 11.78/11.81 Checking conditional termination of SCC {l4}... 11.78/11.81 11.78/11.81 LOG: CALL solveLinear 11.78/11.81 11.78/11.81 LOG: RETURN solveLinear - Elapsed time: 0.002092s 11.78/11.81 Ranking function: -8 + 4*arg1 11.78/11.81 New Graphs: 11.78/11.81 Transitions: 11.78/11.81 undef11, arg2 -> undef12, rest remain the same}> 11.78/11.81 Variables: 11.78/11.81 arg1, arg2 11.78/11.81 Checking conditional termination of SCC {l4}... 11.78/11.81 11.78/11.81 LOG: CALL solveLinear 11.78/11.81 11.78/11.81 LOG: RETURN solveLinear - Elapsed time: 0.000693s 11.78/11.81 11.78/11.81 LOG: CALL solveLinear 11.78/11.81 11.78/11.81 LOG: RETURN solveLinear - Elapsed time: 0.002550s 11.78/11.81 Trying to remove transition: undef11, arg2 -> undef12, rest remain the same}> 11.78/11.81 Solving with 1 template(s). 11.78/11.81 11.78/11.81 LOG: CALL solveNonLinearGetFirstSolution 11.78/11.81 11.78/11.81 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005530s 11.78/11.81 Time used: 0.005374 11.78/11.81 Solving with 1 template(s). 11.78/11.81 11.78/11.81 LOG: CALL solveNonLinearGetFirstSolution 11.78/11.81 11.78/11.81 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012191s 11.78/11.81 Time used: 0.011802 11.78/11.81 Solving with 2 template(s). 11.78/11.81 11.78/11.81 LOG: CALL solveNonLinearGetFirstSolution 11.78/11.81 11.78/11.81 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001748s 11.78/11.81 Time used: 4.00059 11.78/11.81 Solving with 3 template(s). 11.78/11.81 11.78/11.81 LOG: CALL solveNonLinearGetFirstSolution 11.78/11.81 11.78/11.81 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007363s 11.78/11.82 Time used: 1.00061 11.78/11.82 Solving with 1 template(s). 11.78/11.82 11.78/11.82 LOG: CALL solveNonLinearGetFirstSolution 11.78/11.82 11.78/11.82 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018388s 11.78/11.82 Time used: 0.01041 11.78/11.82 11.78/11.82 Proving non-termination of subgraph 2 11.78/11.82 Transitions: 11.78/11.82 undef8, arg2 -> undef9, rest remain the same}> 11.78/11.82 undef11, arg2 -> undef12, rest remain the same}> 11.78/11.82 undef14, arg2 -> undef15, rest remain the same}> 11.78/11.82 Variables: 11.78/11.82 arg1, arg2 11.78/11.82 11.78/11.82 Checking that every undef value has an assignment... 11.78/11.82 11.78/11.82 LOG: CALL solveLinear 11.78/11.82 11.78/11.82 LOG: RETURN solveLinear - Elapsed time: 0.002198s 11.78/11.82 Checking conditional non-termination of SCC {l4}... 11.78/11.82 EXIT TRANSITIONS: 11.78/11.82 11.78/11.82 11.78/11.82 Solving with 1 template(s). 11.78/11.82 11.78/11.82 LOG: CALL solveNonLinearGetFirstSolution 11.78/11.82 11.78/11.82 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.001720s 11.78/11.82 Time used: 5.00099 11.78/11.82 Solving with 2 template(s). 11.78/11.82 11.78/11.82 LOG: CALL solveNonLinearGetFirstSolution 11.78/11.82 11.78/11.82 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.569627s 11.78/11.82 Time used: 0.559769 11.78/11.82 Improving Solution with cost 2 ... 11.78/11.82 11.78/11.82 LOG: CALL solveNonLinearGetNextSolution 11.78/11.82 11.78/11.82 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000917s 11.78/11.82 Time used: 1.00084 11.78/11.82 11.78/11.82 LOG: SAT solveNonLinear - Elapsed time: 1.570544s 11.78/11.82 Cost: 2; Total time: 1.56061 11.78/11.82 Failed at location 4: arg1 <= 1 11.78/11.82 Failed at location 4: 1 <= arg1 11.78/11.82 Before Improving: 11.78/11.82 Quasi-invariant at l4: arg1 <= 1 11.78/11.82 Quasi-invariant at l4: 1 <= arg1 11.78/11.82 Optimizing invariants... 11.78/11.82 11.78/11.82 LOG: CALL solveLinear 11.78/11.82 11.78/11.82 LOG: RETURN solveLinear - Elapsed time: 0.013154s 11.78/11.82 Remaining time after improvement: 0.99517 11.78/11.82 Minimizing number of undef constraints... 11.78/11.82 11.78/11.82 LOG: CALL solveNonLinear 11.78/11.82 11.78/11.82 LOG: RETURN solveNonLinear - Elapsed time: 0.011360s 11.78/11.82 Number of undef constraints reduced! 11.78/11.82 11.78/11.82 Non-termination implied by a set of quasi-invariant(s): 11.78/11.82 Quasi-invariant at l4: arg1 <= 1 11.78/11.82 Quasi-invariant at l4: 1 <= arg1 11.78/11.82 11.78/11.82 Strengthening and disabling EXIT transitions... 11.78/11.82 Closed exits from l4: 1 11.78/11.82 11.78/11.82 Strengthening and disabling transitions... 11.78/11.82 11.78/11.82 LOG: CALL solverLinear in Graph for feasibility 11.78/11.82 11.78/11.82 LOG: RETURN solveLinear in Graph for feasibility 11.78/11.82 It's unfeasible. Removing transition: 11.78/11.82 undef8, arg2 -> undef9, rest remain the same}> 11.78/11.82 11.78/11.82 LOG: CALL solverLinear in Graph for feasibility 11.78/11.82 11.78/11.82 LOG: RETURN solveLinear in Graph for feasibility 11.78/11.82 Strengthening transition (result): 11.78/11.82 undef11, arg2 -> undef12, rest remain the same}> 11.78/11.82 11.78/11.82 LOG: CALL solverLinear in Graph for feasibility 11.78/11.82 11.78/11.82 LOG: RETURN solveLinear in Graph for feasibility 11.78/11.82 It's unfeasible. Removing transition: 11.78/11.82 undef14, arg2 -> undef15, rest remain the same}> 11.78/11.82 11.78/11.82 Calling reachability with... 11.78/11.82 Transition: 11.78/11.82 Conditions: arg1 <= 1, 1 <= arg1, 11.78/11.82 OPEN EXITS: 11.78/11.82 11.78/11.82 11.78/11.82 --- Reachability graph --- 11.78/11.82 > Graph without transitions. 11.78/11.82 11.78/11.82 Calling reachability with... 11.78/11.82 Transition: undef5, arg2 -> undef6, rest remain the same}> 11.78/11.82 Conditions: arg1 = 1, 11.78/11.82 OPEN EXITS: 11.78/11.82 undef5, arg2 -> undef6, rest remain the same}> 11.78/11.82 11.78/11.82 > Conditions are reachable! 11.78/11.82 11.78/11.82 Program does NOT terminate 11.78/11.82 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 11.78/11.82 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 11.78/11.82 EOF