5.20/5.23 NO 5.20/5.23 5.20/5.23 Solver Timeout: 4 5.20/5.23 Global Timeout: 300 5.20/5.23 No parsing errors! 5.20/5.23 Init Location: 0 5.20/5.23 Transitions: 5.20/5.23 5.20/5.23 ~(1)) /\ (undef1 > ~(1)), par{arg1 -> undef1, arg2 -> undef2}> 5.20/5.23 0) /\ (undef3 > ~(1)), par{arg1 -> undef3, arg2 -> undef4}> 5.20/5.23 0) /\ (arg1 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg2 -> undef6}> 5.20/5.23 ~(1)) /\ (undef8 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef8, arg2 -> 1}> 5.20/5.23 0) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1)}> 5.20/5.23 undef12, arg2 -> undef13}> 5.20/5.23 5.20/5.23 Fresh variables: 5.20/5.23 undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef12, undef13, 5.20/5.23 5.20/5.23 Undef variables: 5.20/5.23 undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef12, undef13, 5.20/5.23 5.20/5.23 Abstraction variables: 5.20/5.23 5.20/5.23 Exit nodes: 5.20/5.23 5.20/5.23 Accepting locations: 5.20/5.23 5.20/5.23 Asserts: 5.20/5.23 5.20/5.23 Preprocessed LLVMGraph 5.20/5.23 Init Location: 0 5.20/5.23 Transitions: 5.20/5.23 0) /\ (undef3 > ~(1)), par{arg1 -> undef3, arg2 -> undef4}> 5.20/5.23 ~(1)) /\ (undef8 > ~(1)) /\ (undef12 > 0), par{arg1 -> undef8, arg2 -> 1}> 5.20/5.23 0) /\ (arg1 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg2 -> undef6}> 5.20/5.23 0) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1)}> 5.20/5.23 5.20/5.23 Fresh variables: 5.20/5.23 undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef12, undef13, 5.20/5.23 5.20/5.23 Undef variables: 5.20/5.23 undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef12, undef13, 5.20/5.23 5.20/5.23 Abstraction variables: 5.20/5.23 5.20/5.23 Exit nodes: 5.20/5.23 5.20/5.23 Accepting locations: 5.20/5.23 5.20/5.23 Asserts: 5.20/5.23 5.20/5.23 ************************************************************* 5.20/5.23 ******************************************************************************************* 5.20/5.23 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.20/5.23 ******************************************************************************************* 5.20/5.23 5.20/5.23 Init Location: 0 5.20/5.23 Graph 0: 5.20/5.23 Transitions: 5.20/5.23 Variables: 5.20/5.23 5.20/5.23 Graph 1: 5.20/5.23 Transitions: 5.20/5.23 -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> 5.20/5.23 Variables: 5.20/5.23 arg1, arg2 5.20/5.23 5.20/5.23 Graph 2: 5.20/5.23 Transitions: 5.20/5.23 undef5, arg2 -> undef6, rest remain the same}> 5.20/5.23 Variables: 5.20/5.23 arg1, arg2 5.20/5.23 5.20/5.23 Precedence: 5.20/5.23 Graph 0 5.20/5.23 5.20/5.23 Graph 1 5.20/5.23 undef8, arg2 -> 1, rest remain the same}> 5.20/5.23 5.20/5.23 Graph 2 5.20/5.23 undef3, arg2 -> undef4, rest remain the same}> 5.20/5.23 5.20/5.23 Map Locations to Subgraph: 5.20/5.23 ( 0 , 0 ) 5.20/5.23 ( 2 , 2 ) 5.20/5.23 ( 4 , 1 ) 5.20/5.23 5.20/5.23 ******************************************************************************************* 5.20/5.23 ******************************** CHECKING ASSERTIONS ******************************** 5.20/5.23 ******************************************************************************************* 5.20/5.23 5.20/5.23 Proving termination of subgraph 0 5.20/5.23 Proving termination of subgraph 1 5.20/5.23 Checking unfeasibility... 5.20/5.23 Time used: 0.002451 5.20/5.23 5.20/5.23 Checking conditional termination of SCC {l4}... 5.20/5.23 5.20/5.23 LOG: CALL solveLinear 5.20/5.23 5.20/5.23 LOG: RETURN solveLinear - Elapsed time: 0.000685s 5.20/5.23 Ranking function: -1 + arg1 5.20/5.23 New Graphs: 5.20/5.23 Proving termination of subgraph 2 5.20/5.23 Checking unfeasibility... 5.20/5.23 Time used: 0.0021 5.20/5.23 5.20/5.23 Checking conditional termination of SCC {l2}... 5.20/5.23 5.20/5.23 LOG: CALL solveLinear 5.20/5.23 5.20/5.23 LOG: RETURN solveLinear - Elapsed time: 0.000732s 5.20/5.23 5.20/5.23 LOG: CALL solveLinear 5.20/5.23 5.20/5.23 LOG: RETURN solveLinear - Elapsed time: 0.002625s 5.20/5.23 Trying to remove transition: undef5, arg2 -> undef6, rest remain the same}> 5.20/5.23 Solving with 1 template(s). 5.20/5.23 5.20/5.23 LOG: CALL solveNonLinearGetFirstSolution 5.20/5.23 5.20/5.23 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006019s 5.20/5.23 Time used: 0.005826 5.20/5.23 Solving with 1 template(s). 5.20/5.23 5.20/5.23 LOG: CALL solveNonLinearGetFirstSolution 5.20/5.23 5.20/5.23 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008745s 5.20/5.23 Time used: 0.008326 5.20/5.23 Improving Solution with cost 1 ... 5.20/5.23 5.20/5.23 LOG: CALL solveNonLinearGetNextSolution 5.20/5.23 5.20/5.23 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013273s 5.20/5.23 Time used: 0.013267 5.20/5.23 5.20/5.23 LOG: SAT solveNonLinear - Elapsed time: 0.022019s 5.20/5.23 Cost: 1; Total time: 0.021593 5.20/5.23 Failed at location 2: arg1 <= 0 5.20/5.23 Before Improving: 5.20/5.23 Quasi-invariant at l2: arg1 <= 0 5.20/5.23 Optimizing invariants... 5.20/5.23 5.20/5.23 LOG: CALL solveLinear 5.20/5.23 5.20/5.23 LOG: RETURN solveLinear - Elapsed time: 0.002261s 5.20/5.23 Remaining time after improvement: 0.99876 5.20/5.23 Termination implied by a set of quasi-invariant(s): 5.20/5.23 Quasi-invariant at l2: arg1 <= 0 5.20/5.23 [ Invariant Graph ] 5.20/5.23 Strengthening and disabling transitions... 5.20/5.23 5.20/5.23 LOG: CALL solverLinear in Graph for feasibility 5.20/5.23 5.20/5.23 LOG: RETURN solveLinear in Graph for feasibility 5.20/5.23 It's unfeasible. Removing transition: 5.20/5.23 undef5, arg2 -> undef6, rest remain the same}> 5.20/5.23 [ Termination Graph ] 5.20/5.23 Strengthening and disabling transitions... 5.20/5.23 > It's unfeasible. Removing transition: 5.20/5.23 undef5, arg2 -> undef6, rest remain the same}> 5.20/5.23 New Graphs: 5.20/5.23 Calling Safety with literal arg1 <= 0 and entry undef3, arg2 -> undef4, rest remain the same}> 5.20/5.23 5.20/5.23 LOG: CALL check - Post:arg1 <= 0 - Process 1 5.20/5.23 * Exit transition: undef3, arg2 -> undef4, rest remain the same}> 5.20/5.23 * Postcondition : arg1 <= 0 5.20/5.23 5.20/5.23 LOG: CALL solveLinear 5.20/5.23 5.20/5.23 LOG: RETURN solveLinear - Elapsed time: 0.000437s 5.20/5.23 > Postcondition is not implied! 5.20/5.23 5.20/5.23 LOG: RETURN check - Elapsed time: 0.000525s 5.20/5.23 INVARIANTS: 5.20/5.23 2: 5.20/5.23 Quasi-INVARIANTS to narrow Graph: 5.20/5.23 2: arg1 <= 0 , 5.20/5.23 Narrowing transition: 5.20/5.23 undef5, arg2 -> undef6, rest remain the same}> 5.20/5.23 5.20/5.23 LOG: Narrow transition size 1 5.20/5.23 invGraph after Narrowing: 5.20/5.23 Transitions: 5.20/5.23 undef5, arg2 -> undef6, rest remain the same}> 5.20/5.23 Variables: 5.20/5.23 arg1, arg2 5.20/5.23 Checking conditional termination of SCC {l2}... 5.20/5.23 5.20/5.23 LOG: CALL solveLinear 5.20/5.23 5.20/5.23 LOG: RETURN solveLinear - Elapsed time: 0.000690s 5.20/5.23 5.20/5.23 LOG: CALL solveLinear 5.20/5.23 5.20/5.23 LOG: RETURN solveLinear - Elapsed time: 0.002515s 5.20/5.23 Trying to remove transition: undef5, arg2 -> undef6, rest remain the same}> 5.20/5.23 Solving with 1 template(s). 5.20/5.23 5.20/5.23 LOG: CALL solveNonLinearGetFirstSolution 5.20/5.23 5.20/5.23 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005455s 5.20/5.23 Time used: 0.0053 5.20/5.23 Solving with 1 template(s). 5.20/5.23 5.20/5.23 LOG: CALL solveNonLinearGetFirstSolution 5.20/5.23 5.20/5.23 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007818s 5.20/5.23 Time used: 0.007439 5.20/5.23 Solving with 2 template(s). 5.20/5.23 5.20/5.23 LOG: CALL solveNonLinearGetFirstSolution 5.20/5.23 5.20/5.23 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000930s 5.20/5.23 Time used: 4.00031 5.20/5.23 Solving with 3 template(s). 5.20/5.23 5.20/5.23 LOG: CALL solveNonLinearGetFirstSolution 5.20/5.23 5.20/5.23 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.020080s 5.20/5.23 Time used: 1.01711 5.20/5.23 Solving with 1 template(s). 5.20/5.23 5.20/5.23 LOG: CALL solveNonLinearGetFirstSolution 5.20/5.23 5.20/5.23 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009077s 5.20/5.23 Time used: 0.005946 5.20/5.23 5.20/5.23 Proving non-termination of subgraph 2 5.20/5.23 Transitions: 5.20/5.23 undef5, arg2 -> undef6, rest remain the same}> 5.20/5.23 Variables: 5.20/5.23 arg1, arg2 5.20/5.23 5.20/5.23 Checking that every undef value has an assignment... 5.20/5.23 5.20/5.23 LOG: CALL solveLinear 5.20/5.23 5.20/5.23 LOG: RETURN solveLinear - Elapsed time: 0.000937s 5.20/5.23 Checking conditional non-termination of SCC {l2}... 5.20/5.23 EXIT TRANSITIONS: 5.20/5.23 5.20/5.23 5.20/5.23 Solving with 1 template(s). 5.20/5.23 5.20/5.23 LOG: CALL solveNonLinearGetFirstSolution 5.20/5.23 5.20/5.23 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018579s 5.20/5.23 Time used: 0.018298 5.20/5.23 Improving Solution with cost 1 ... 5.20/5.23 5.20/5.23 LOG: CALL solveNonLinearGetNextSolution 5.20/5.23 5.20/5.23 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.059485s 5.20/5.23 Time used: 0.059475 5.20/5.23 5.20/5.23 LOG: SAT solveNonLinear - Elapsed time: 0.078063s 5.20/5.23 Cost: 1; Total time: 0.077773 5.20/5.23 Failed at location 2: 1 <= arg1 5.20/5.23 Before Improving: 5.20/5.23 Quasi-invariant at l2: 1 <= arg1 5.20/5.23 Optimizing invariants... 5.20/5.23 5.20/5.23 LOG: CALL solveLinear 5.20/5.23 5.20/5.23 LOG: RETURN solveLinear - Elapsed time: 0.010467s 5.20/5.23 Remaining time after improvement: 0.998124 5.20/5.23 Minimizing number of undef constraints... 5.20/5.23 5.20/5.23 LOG: CALL solveNonLinear 5.20/5.23 5.20/5.23 LOG: RETURN solveNonLinear - Elapsed time: 0.003058s 5.20/5.23 Number of undef constraints reduced! 5.20/5.23 5.20/5.23 Non-termination implied by a set of quasi-invariant(s): 5.20/5.23 Quasi-invariant at l2: 1 <= arg1 5.20/5.23 5.20/5.23 Strengthening and disabling EXIT transitions... 5.20/5.23 Closed exits from l2: 1 5.20/5.23 5.20/5.23 Strengthening and disabling transitions... 5.20/5.23 5.20/5.23 LOG: CALL solverLinear in Graph for feasibility 5.20/5.23 5.20/5.23 LOG: RETURN solveLinear in Graph for feasibility 5.20/5.23 Strengthening transition (result): 5.20/5.23 undef5, arg2 -> undef6, rest remain the same}> 5.20/5.23 5.20/5.23 Calling reachability with... 5.20/5.23 Transition: 5.20/5.23 Conditions: 1 <= arg1, 5.20/5.23 OPEN EXITS: 5.20/5.23 5.20/5.23 5.20/5.23 --- Reachability graph --- 5.20/5.23 > Graph without transitions. 5.20/5.23 5.20/5.23 Calling reachability with... 5.20/5.23 Transition: undef3, arg2 -> undef4, rest remain the same}> 5.20/5.23 Conditions: 1 <= arg1, 5.20/5.23 OPEN EXITS: 5.20/5.23 undef3, arg2 -> undef4, rest remain the same}> 5.20/5.23 5.20/5.23 > Conditions are reachable! 5.20/5.23 5.20/5.23 Program does NOT terminate 5.20/5.23 /export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 5.20/5.23 /export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 5.20/5.23 EOF