7.29/7.35 NO 7.29/7.35 7.29/7.35 Solver Timeout: 4 7.29/7.35 Global Timeout: 300 7.29/7.35 No parsing errors! 7.29/7.35 Init Location: 0 7.29/7.35 Transitions: 7.29/7.35 7.29/7.35 ~(1)) /\ (arg1 > 0) /\ (undef2 > 1), par{arg1 -> (arg2 - 1), arg2 -> undef2, arg3 -> arg2}> 7.29/7.35 0) /\ (arg2 > 0) /\ (undef5 > 2), par{arg1 -> (arg1 - 1), arg2 -> undef5, arg3 -> arg1}> 7.29/7.35 0) /\ (arg3 < 1) /\ (undef7 > 0), par{arg1 -> undef7, arg2 -> undef8, arg3 -> undef9}> 7.29/7.35 1) /\ (undef10 > 2), par{arg1 -> undef10, arg2 -> undef11, arg3 -> undef12}> 7.29/7.35 0) /\ (undef13 > ~(1)), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15}> 7.29/7.35 undef16, arg2 -> undef17, arg3 -> undef18}> 7.29/7.35 7.29/7.35 Fresh variables: 7.29/7.35 undef2, undef5, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, 7.29/7.35 7.29/7.35 Undef variables: 7.29/7.35 undef2, undef5, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, 7.29/7.35 7.29/7.35 Abstraction variables: 7.29/7.35 7.29/7.35 Exit nodes: 7.29/7.35 7.29/7.35 Accepting locations: 7.29/7.35 7.29/7.35 Asserts: 7.29/7.35 7.29/7.35 Preprocessed LLVMGraph 7.29/7.35 Init Location: 0 7.29/7.35 Transitions: 7.29/7.35 ~(1)) /\ (undef16 > 0) /\ (undef2 > 1)> 7.29/7.35 0) /\ (arg2 > 0) /\ (undef5 > 2), par{arg1 -> (arg1 - 1), arg2 -> undef5, arg3 -> arg1}> 7.29/7.35 0) /\ (arg3 < 1) /\ (undef7 > 0), par{arg1 -> undef7, arg2 -> undef8, arg3 -> undef9}> 7.29/7.35 1) /\ (undef10 > 2), par{arg1 -> undef10, arg2 -> undef11, arg3 -> undef12}> 7.29/7.35 0) /\ (undef13 > ~(1)), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15}> 7.29/7.35 7.29/7.35 Fresh variables: 7.29/7.35 undef2, undef5, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, 7.29/7.35 7.29/7.35 Undef variables: 7.29/7.35 undef2, undef5, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, 7.29/7.35 7.29/7.35 Abstraction variables: 7.29/7.35 7.29/7.35 Exit nodes: 7.29/7.35 7.29/7.35 Accepting locations: 7.29/7.35 7.29/7.35 Asserts: 7.29/7.35 7.29/7.35 ************************************************************* 7.29/7.35 ******************************************************************************************* 7.29/7.35 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 7.29/7.35 ******************************************************************************************* 7.29/7.35 7.29/7.35 Init Location: 0 7.29/7.35 Graph 0: 7.29/7.35 Transitions: 7.29/7.35 Variables: 7.29/7.35 7.29/7.35 Graph 1: 7.29/7.35 Transitions: 7.29/7.35 -1 + arg1, arg2 -> undef5, arg3 -> arg1, rest remain the same}> 7.29/7.35 Variables: 7.29/7.35 arg1, arg2, arg3 7.29/7.35 7.29/7.35 Graph 2: 7.29/7.35 Transitions: 7.29/7.35 undef13, arg2 -> undef14, arg3 -> undef15, rest remain the same}> 7.29/7.35 Variables: 7.29/7.35 arg1, arg2, arg3 7.29/7.35 7.29/7.35 Precedence: 7.29/7.35 Graph 0 7.29/7.35 7.29/7.35 Graph 1 7.29/7.35 7.29/7.35 7.29/7.35 Graph 2 7.29/7.35 undef7, arg2 -> undef8, arg3 -> undef9, rest remain the same}> 7.29/7.35 undef10, arg2 -> undef11, arg3 -> undef12, rest remain the same}> 7.29/7.35 7.29/7.35 Map Locations to Subgraph: 7.29/7.35 ( 0 , 0 ) 7.29/7.35 ( 2 , 1 ) 7.29/7.35 ( 3 , 2 ) 7.29/7.35 7.29/7.35 ******************************************************************************************* 7.29/7.35 ******************************** CHECKING ASSERTIONS ******************************** 7.29/7.35 ******************************************************************************************* 7.29/7.35 7.29/7.35 Proving termination of subgraph 0 7.29/7.35 Proving termination of subgraph 1 7.29/7.35 Checking unfeasibility... 7.29/7.35 Time used: 0.003835 7.29/7.35 7.29/7.35 Checking conditional termination of SCC {l2}... 7.29/7.35 7.29/7.35 LOG: CALL solveLinear 7.29/7.35 7.29/7.35 LOG: RETURN solveLinear - Elapsed time: 0.000872s 7.29/7.35 7.29/7.35 LOG: CALL solveLinear 7.29/7.35 7.29/7.35 LOG: RETURN solveLinear - Elapsed time: 0.003351s 7.29/7.35 Trying to remove transition: -1 + arg1, arg2 -> undef5, arg3 -> arg1, rest remain the same}> 7.29/7.35 Solving with 1 template(s). 7.29/7.35 7.29/7.35 LOG: CALL solveNonLinearGetFirstSolution 7.29/7.35 7.29/7.35 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010436s 7.29/7.35 Time used: 0.010214 7.29/7.35 Solving with 1 template(s). 7.29/7.35 7.29/7.35 LOG: CALL solveNonLinearGetFirstSolution 7.29/7.35 7.29/7.35 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010549s 7.29/7.35 Time used: 0.01012 7.29/7.35 7.29/7.35 LOG: SAT solveNonLinear - Elapsed time: 0.010549s 7.29/7.35 Cost: 0; Total time: 0.01012 7.29/7.35 Termination implied by a set of invariant(s): 7.29/7.35 Invariant at l2: 1 + arg1 <= arg3 7.29/7.35 [ Invariant Graph ] 7.29/7.35 Strengthening and disabling transitions... 7.29/7.35 7.29/7.35 LOG: CALL solverLinear in Graph for feasibility 7.29/7.35 7.29/7.35 LOG: RETURN solveLinear in Graph for feasibility 7.29/7.35 Strengthening transition (result): 7.29/7.35 -1 + arg1, arg2 -> undef5, arg3 -> arg1, rest remain the same}> 7.29/7.35 [ Termination Graph ] 7.29/7.35 Strengthening and disabling transitions... 7.29/7.35 7.29/7.35 LOG: CALL solverLinear in Graph for feasibility 7.29/7.35 7.29/7.35 LOG: RETURN solveLinear in Graph for feasibility 7.29/7.35 Strengthening transition (result): 7.29/7.35 -1 + arg1, arg2 -> undef5, arg3 -> arg1, rest remain the same}> 7.29/7.35 Ranking function: -arg1 + 2*arg3 7.29/7.35 New Graphs: 7.29/7.35 INVARIANTS: 7.29/7.35 2: 1 + arg1 <= arg3 , 7.29/7.35 Quasi-INVARIANTS to narrow Graph: 7.29/7.35 2: 7.29/7.35 Proving termination of subgraph 2 7.29/7.35 Checking unfeasibility... 7.29/7.35 Time used: 0.0026 7.29/7.35 7.29/7.35 Checking conditional termination of SCC {l3}... 7.29/7.35 7.29/7.35 LOG: CALL solveLinear 7.29/7.35 7.29/7.35 LOG: RETURN solveLinear - Elapsed time: 0.000837s 7.29/7.35 7.29/7.35 LOG: CALL solveLinear 7.29/7.35 7.29/7.35 LOG: RETURN solveLinear - Elapsed time: 0.002148s 7.29/7.35 Trying to remove transition: undef13, arg2 -> undef14, arg3 -> undef15, rest remain the same}> 7.29/7.35 Solving with 1 template(s). 7.29/7.35 7.29/7.35 LOG: CALL solveNonLinearGetFirstSolution 7.29/7.35 7.29/7.35 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005713s 7.29/7.35 Time used: 0.005577 7.29/7.35 Solving with 1 template(s). 7.29/7.35 7.29/7.35 LOG: CALL solveNonLinearGetFirstSolution 7.29/7.35 7.29/7.35 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011586s 7.29/7.35 Time used: 0.011193 7.29/7.35 Solving with 2 template(s). 7.29/7.35 7.29/7.35 LOG: CALL solveNonLinearGetFirstSolution 7.29/7.35 7.29/7.35 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001772s 7.29/7.35 Time used: 4.00071 7.29/7.35 Solving with 3 template(s). 7.29/7.35 7.29/7.35 LOG: CALL solveNonLinearGetFirstSolution 7.29/7.35 7.29/7.35 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003659s 7.29/7.35 Time used: 1.00003 7.29/7.35 Solving with 1 template(s). 7.29/7.35 7.29/7.35 LOG: CALL solveNonLinearGetFirstSolution 7.29/7.35 7.29/7.35 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015679s 7.29/7.35 Time used: 0.007787 7.29/7.35 Termination failed. Trying to show unreachability... 7.29/7.35 Proving unreachability of entry: undef7, arg2 -> undef8, arg3 -> undef9, rest remain the same}> 7.29/7.35 7.29/7.35 LOG: CALL check - Post:1 <= 0 - Process 1 7.29/7.35 * Exit transition: undef7, arg2 -> undef8, arg3 -> undef9, rest remain the same}> 7.29/7.35 * Postcondition : 1 <= 0 7.29/7.35 Postcodition moved up: 1 <= 0 7.29/7.35 7.29/7.35 LOG: Try proving POST 7.29/7.35 Postcondition: 1 <= 0 7.29/7.35 7.29/7.35 LOG: CALL check - Post:1 <= 0 - Process 2 7.29/7.35 * Exit transition: 7.29/7.35 * Postcondition : 1 <= 0 7.29/7.35 7.29/7.35 LOG: CALL solveLinear 7.29/7.35 7.29/7.35 LOG: RETURN solveLinear - Elapsed time: 0.000863s 7.29/7.35 > Postcondition is not implied! 7.29/7.35 7.29/7.35 LOG: RETURN check - Elapsed time: 0.001000s 7.29/7.35 7.29/7.35 LOG: NarrowEntry size 1 7.29/7.35 Narrowing transition: 7.29/7.35 -1 + arg1, arg2 -> undef5, arg3 -> arg1, rest remain the same}> 7.29/7.35 7.29/7.35 LOG: Narrow transition size 1 7.29/7.35 ENTRIES: 7.29/7.35 7.29/7.35 END ENTRIES: 7.29/7.35 GRAPH: 7.29/7.35 -1 + arg1, arg2 -> undef5, arg3 -> arg1, rest remain the same}> 7.29/7.35 END GRAPH: 7.29/7.35 EXIT: undef7, arg2 -> undef8, arg3 -> undef9, rest remain the same}> 7.29/7.35 POST: 1 <= 0 7.29/7.35 7.29/7.35 7.29/7.35 LOG: Try proving POST 7.29/7.35 Solving with 1 template(s). 7.29/7.35 7.29/7.35 LOG: CALL solveNonLinearGetFirstSolution 7.29/7.35 7.29/7.35 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014770s 7.29/7.35 Time used: 0.014581 7.29/7.35 Improving Solution with cost 51 ... 7.29/7.35 7.29/7.35 LOG: CALL solveNonLinearGetNextSolution 7.29/7.35 7.29/7.35 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.028205s 7.29/7.35 Time used: 0.028198 7.29/7.35 7.29/7.35 LOG: SAT solveNonLinear - Elapsed time: 0.042976s 7.29/7.35 Cost: 51; Total time: 0.042779 7.29/7.35 Failed at location 2: arg3 <= 0 7.29/7.35 Before Improving: 7.29/7.35 Quasi-invariant at l2: arg3 <= 0 7.29/7.35 Optimizing invariants... 7.29/7.35 7.29/7.35 LOG: CALL solveLinear 7.29/7.35 7.29/7.35 LOG: RETURN solveLinear - Elapsed time: 0.001999s 7.29/7.35 Remaining time after improvement: 0.99883 7.29/7.35 Some transition disabled by a set of quasi-invariant(s): 7.29/7.35 Quasi-invariant at l2: arg3 <= 0 7.29/7.35 7.29/7.35 LOG: NEXT CALL check - disable 7.29/7.35 7.29/7.35 LOG: CALL check - Post:arg3 <= 0 - Process 3 7.29/7.35 * Exit transition: 7.29/7.35 * Postcondition : arg3 <= 0 7.29/7.35 7.29/7.35 LOG: CALL solveLinear 7.29/7.35 7.29/7.35 LOG: RETURN solveLinear - Elapsed time: 0.001025s 7.29/7.35 > Postcondition is not implied! 7.29/7.35 7.29/7.35 LOG: RETURN check - Elapsed time: 0.001177s 7.29/7.35 Solving with 2 template(s). 7.29/7.35 7.29/7.35 LOG: CALL solveNonLinearGetFirstSolution 7.29/7.35 7.29/7.35 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.119182s 7.29/7.35 Time used: 0.118941 7.29/7.35 Improving Solution with cost 51 ... 7.29/7.35 7.29/7.35 LOG: CALL solveNonLinearGetNextSolution 7.29/7.35 7.29/7.35 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000640s 7.29/7.35 Time used: 1.00043 7.29/7.35 7.29/7.35 LOG: SAT solveNonLinear - Elapsed time: 1.119822s 7.29/7.35 Cost: 51; Total time: 1.11937 7.29/7.35 Failed at location 2: arg1 + arg3 <= 0 7.29/7.35 Before Improving: 7.29/7.35 Quasi-invariant at l2: arg3 <= 1 + arg1 7.29/7.35 Quasi-invariant at l2: arg1 + arg3 <= 0 7.29/7.35 Optimizing invariants... 7.29/7.35 7.29/7.35 LOG: CALL solveLinear 7.29/7.35 7.29/7.35 LOG: RETURN solveLinear - Elapsed time: 0.005867s 7.29/7.35 Remaining time after improvement: 0.997978 7.29/7.35 Some transition disabled by a set of quasi-invariant(s): 7.29/7.35 Quasi-invariant at l2: arg3 <= 1 + arg1 7.29/7.35 Quasi-invariant at l2: arg1 + arg3 <= 0 7.29/7.35 7.29/7.35 LOG: NEXT CALL check - disable 7.29/7.35 7.29/7.35 LOG: CALL check - Post:arg1 + arg3 <= 0 - Process 4 7.29/7.35 * Exit transition: 7.29/7.35 * Postcondition : arg1 + arg3 <= 0 7.29/7.35 7.29/7.35 LOG: CALL solveLinear 7.29/7.35 7.29/7.35 LOG: RETURN solveLinear - Elapsed time: 0.001191s 7.29/7.35 > Postcondition is not implied! 7.29/7.35 7.29/7.35 LOG: RETURN check - Elapsed time: 0.001347s 7.29/7.35 Solving with 3 template(s). 7.29/7.35 7.29/7.35 LOG: CALL solveNonLinearGetFirstSolution 7.29/7.35 7.29/7.35 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.000345s 7.29/7.35 Time used: 1.00017 7.29/7.35 7.29/7.35 LOG: Postcondition is not implied - no solution 7.29/7.35 > Postcondition is not implied! 7.29/7.35 7.29/7.35 LOG: RETURN check - Elapsed time: 2.185814s 7.29/7.35 Cannot prove unreachability 7.29/7.35 7.29/7.35 Proving non-termination of subgraph 2 7.29/7.35 Transitions: 7.29/7.35 undef13, arg2 -> undef14, arg3 -> undef15, rest remain the same}> 7.29/7.35 Variables: 7.29/7.35 arg1, arg2, arg3 7.29/7.35 7.29/7.35 Checking conditional non-termination of SCC {l3}... 7.29/7.35 EXIT TRANSITIONS: 7.29/7.35 7.29/7.35 7.29/7.35 Solving with 1 template(s). 7.29/7.35 7.29/7.35 LOG: CALL solveNonLinearGetFirstSolution 7.29/7.35 7.29/7.35 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016661s 7.29/7.35 Time used: 0.016558 7.29/7.35 7.29/7.35 LOG: SAT solveNonLinear - Elapsed time: 0.016661s 7.29/7.35 Cost: 0; Total time: 0.016558 7.29/7.35 Minimizing number of undef constraints... 7.29/7.35 7.29/7.35 LOG: CALL solveNonLinear 7.29/7.35 7.29/7.35 LOG: RETURN solveNonLinear - Elapsed time: 0.003498s 7.29/7.35 Non-termination implied by a set of quasi-invariant(s): 7.29/7.35 Quasi-invariant at l3: 1 <= arg1 7.29/7.35 Constraint over undef '1 <= undef13' in transition: 7.29/7.35 undef13, arg2 -> undef14, arg3 -> undef15, rest remain the same}> 7.29/7.35 7.29/7.35 Strengthening and disabling EXIT transitions... 7.29/7.35 Closed exits from l3: 1 7.29/7.35 7.29/7.35 Strengthening and disabling transitions... 7.29/7.35 7.29/7.35 LOG: CALL solverLinear in Graph for feasibility 7.29/7.35 7.29/7.35 LOG: RETURN solveLinear in Graph for feasibility 7.29/7.35 Strengthening transition (result): 7.29/7.35 undef13, arg2 -> undef14, arg3 -> undef15, rest remain the same}> 7.29/7.35 7.29/7.35 Calling reachability with... 7.29/7.35 Transition: 7.29/7.35 Conditions: 1 <= arg1, 7.29/7.35 Transition: 7.29/7.35 Conditions: 1 <= arg1, 7.29/7.35 OPEN EXITS: 7.29/7.35 7.29/7.35 7.29/7.35 7.29/7.35 --- Reachability graph --- 7.29/7.35 > Graph without transitions. 7.29/7.35 7.29/7.35 Calling reachability with... 7.29/7.35 Transition: undef7, arg2 -> undef8, arg3 -> undef9, rest remain the same}> 7.29/7.35 Conditions: 1 <= arg1, 7.29/7.35 Transition: undef10, arg2 -> undef11, arg3 -> undef12, rest remain the same}> 7.29/7.35 Conditions: 1 <= arg1, 7.29/7.35 Transition: undef7, arg2 -> undef8, arg3 -> undef9, rest remain the same}> 7.29/7.35 Conditions: 1 <= arg1, 7.29/7.35 Transition: undef10, arg2 -> undef11, arg3 -> undef12, rest remain the same}> 7.29/7.35 Conditions: 1 <= arg1, 7.29/7.35 OPEN EXITS: 7.29/7.35 undef7, arg2 -> undef8, arg3 -> undef9, rest remain the same}> (condsUp: 1 <= undef7, 1 <= undef7) 7.29/7.35 undef10, arg2 -> undef11, arg3 -> undef12, rest remain the same}> (condsUp: 3 <= undef10, 1 <= undef10) 7.29/7.35 undef7, arg2 -> undef8, arg3 -> undef9, rest remain the same}> (condsUp: 1 <= undef7, 1 <= undef7) 7.29/7.35 undef10, arg2 -> undef11, arg3 -> undef12, rest remain the same}> (condsUp: 3 <= undef10, 1 <= undef10) 7.29/7.35 7.29/7.35 --- Reachability graph --- 7.29/7.35 > Graph without transitions. 7.29/7.35 7.29/7.35 Calling reachability with... 7.29/7.35 Transition: 7.29/7.35 Conditions: 1 <= arg2, arg3 <= 0, 1 <= undef7, 1 <= undef7, 7.29/7.35 Transition: 7.29/7.35 Conditions: undef10 <= 1 + arg2, arg3 <= 0, 2 <= arg2, 3 <= undef10, 1 <= undef10, 7.29/7.35 Transition: 7.29/7.35 Conditions: 1 <= arg2, arg3 <= 0, 1 <= undef7, 1 <= undef7, 7.29/7.35 Transition: 7.29/7.35 Conditions: undef10 <= 1 + arg2, arg3 <= 0, 2 <= arg2, 3 <= undef10, 1 <= undef10, 7.29/7.35 OPEN EXITS: 7.29/7.35 7.29/7.35 7.29/7.35 7.29/7.35 7.29/7.35 7.29/7.35 > Conditions are reachable! 7.29/7.35 7.29/7.35 Program does NOT terminate 7.29/7.35 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 7.29/7.35 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 7.29/7.35 EOF