5.28/5.28 NO 5.28/5.28 5.28/5.29 Solver Timeout: 4 5.28/5.29 Global Timeout: 300 5.28/5.29 No parsing errors! 5.28/5.29 Init Location: 0 5.28/5.29 Transitions: 5.28/5.29 5.28/5.29 (0 + p^0)}> 5.28/5.29 (0 + p^0)}> 5.28/5.29 5.28/5.29 undef14}> 5.28/5.29 5.28/5.29 (0 + N^0), r^0 -> 1}> 5.28/5.29 5.28/5.29 5.28/5.29 Fresh variables: 5.28/5.29 undef14, 5.28/5.29 5.28/5.29 Undef variables: 5.28/5.29 undef14, 5.28/5.29 5.28/5.29 Abstraction variables: 5.28/5.29 5.28/5.29 Exit nodes: 5.28/5.29 5.28/5.29 Accepting locations: 5.28/5.29 5.28/5.29 Asserts: 5.28/5.29 5.28/5.29 Preprocessed LLVMGraph 5.28/5.29 Init Location: 0 5.28/5.29 Transitions: 5.28/5.29 5.28/5.29 5.28/5.29 (0 + undef14)}> 5.28/5.29 (0 + undef14)}> 5.28/5.29 5.28/5.29 Fresh variables: 5.28/5.29 undef14, 5.28/5.29 5.28/5.29 Undef variables: 5.28/5.29 undef14, 5.28/5.29 5.28/5.29 Abstraction variables: 5.28/5.29 5.28/5.29 Exit nodes: 5.28/5.29 5.28/5.29 Accepting locations: 5.28/5.29 5.28/5.29 Asserts: 5.28/5.29 5.28/5.29 ************************************************************* 5.28/5.29 ******************************************************************************************* 5.28/5.29 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.28/5.29 ******************************************************************************************* 5.28/5.29 5.28/5.29 Init Location: 0 5.28/5.29 Graph 0: 5.28/5.29 Transitions: 5.28/5.29 Variables: 5.28/5.29 5.28/5.29 Graph 1: 5.28/5.29 Transitions: 5.28/5.29 undef14, rest remain the same}> 5.28/5.29 undef14, rest remain the same}> 5.28/5.29 Variables: 5.28/5.29 q^0, r^0 5.28/5.29 5.28/5.29 Graph 2: 5.28/5.29 Transitions: 5.28/5.29 Variables: 5.28/5.29 5.28/5.29 Precedence: 5.28/5.29 Graph 0 5.28/5.29 5.28/5.29 Graph 1 5.28/5.29 5.28/5.29 5.28/5.29 Graph 2 5.28/5.29 5.28/5.29 5.28/5.29 Map Locations to Subgraph: 5.28/5.29 ( 0 , 0 ) 5.28/5.29 ( 2 , 1 ) 5.28/5.29 ( 4 , 2 ) 5.28/5.29 5.28/5.29 ******************************************************************************************* 5.28/5.29 ******************************** CHECKING ASSERTIONS ******************************** 5.28/5.29 ******************************************************************************************* 5.28/5.29 5.28/5.29 Proving termination of subgraph 0 5.28/5.29 Proving termination of subgraph 1 5.28/5.29 Checking unfeasibility... 5.28/5.29 Time used: 0.003231 5.28/5.29 5.28/5.29 Checking conditional termination of SCC {l2}... 5.28/5.29 5.28/5.29 LOG: CALL solveLinear 5.28/5.29 5.28/5.29 LOG: RETURN solveLinear - Elapsed time: 0.000941s 5.28/5.29 5.28/5.29 LOG: CALL solveLinear 5.28/5.29 5.28/5.29 LOG: RETURN solveLinear - Elapsed time: 0.003328s 5.28/5.29 Trying to remove transition: undef14, rest remain the same}> 5.28/5.29 Solving with 1 template(s). 5.28/5.29 5.28/5.29 LOG: CALL solveNonLinearGetFirstSolution 5.28/5.29 5.28/5.29 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007283s 5.28/5.29 Time used: 0.007076 5.28/5.29 Trying to remove transition: undef14, rest remain the same}> 5.28/5.29 Solving with 1 template(s). 5.28/5.29 5.28/5.29 LOG: CALL solveNonLinearGetFirstSolution 5.28/5.29 5.28/5.29 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006331s 5.28/5.29 Time used: 0.005879 5.28/5.29 Solving with 1 template(s). 5.28/5.29 5.28/5.29 LOG: CALL solveNonLinearGetFirstSolution 5.28/5.29 5.28/5.29 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015004s 5.28/5.29 Time used: 0.014443 5.28/5.29 Improving Solution with cost 1 ... 5.28/5.29 5.28/5.29 LOG: CALL solveNonLinearGetNextSolution 5.28/5.29 5.28/5.29 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.040323s 5.28/5.29 Time used: 0.04032 5.28/5.29 5.28/5.29 LOG: SAT solveNonLinear - Elapsed time: 0.055327s 5.28/5.29 Cost: 1; Total time: 0.054763 5.28/5.29 Failed at location 2: q^0 <= 1 + r^0 5.28/5.29 Before Improving: 5.28/5.29 Quasi-invariant at l2: q^0 <= 1 + r^0 5.28/5.29 Optimizing invariants... 5.28/5.29 5.28/5.29 LOG: CALL solveLinear 5.28/5.29 5.28/5.29 LOG: RETURN solveLinear - Elapsed time: 0.004689s 5.28/5.29 Remaining time after improvement: 0.99862 5.28/5.29 Termination implied by a set of quasi-invariant(s): 5.28/5.29 Quasi-invariant at l2: q^0 <= 1 + r^0 5.28/5.29 [ Invariant Graph ] 5.28/5.29 Strengthening and disabling transitions... 5.28/5.29 5.28/5.29 LOG: CALL solverLinear in Graph for feasibility 5.28/5.29 5.28/5.29 LOG: RETURN solveLinear in Graph for feasibility 5.28/5.29 It's unfeasible. Removing transition: 5.28/5.29 undef14, rest remain the same}> 5.28/5.29 5.28/5.29 LOG: CALL solverLinear in Graph for feasibility 5.28/5.29 5.28/5.29 LOG: RETURN solveLinear in Graph for feasibility 5.28/5.29 It's unfeasible. Removing transition: 5.28/5.29 undef14, rest remain the same}> 5.28/5.29 [ Termination Graph ] 5.28/5.29 Strengthening and disabling transitions... 5.28/5.29 5.28/5.29 LOG: CALL solverLinear in Graph for feasibility 5.28/5.29 5.28/5.29 LOG: RETURN solveLinear in Graph for feasibility 5.28/5.29 It's unfeasible. Removing transition: 5.28/5.29 undef14, rest remain the same}> 5.28/5.29 5.28/5.29 LOG: CALL solverLinear in Graph for feasibility 5.28/5.29 5.28/5.29 LOG: RETURN solveLinear in Graph for feasibility 5.28/5.29 It's unfeasible. Removing transition: 5.28/5.29 undef14, rest remain the same}> 5.28/5.29 New Graphs: 5.28/5.29 Calling Safety with literal q^0 <= 1 + r^0 and entry 5.28/5.29 5.28/5.29 LOG: CALL check - Post:q^0 <= 1 + r^0 - Process 1 5.28/5.29 * Exit transition: 5.28/5.29 * Postcondition : q^0 <= 1 + r^0 5.28/5.29 5.28/5.29 LOG: CALL solveLinear 5.28/5.29 5.28/5.29 LOG: RETURN solveLinear - Elapsed time: 0.000577s 5.28/5.29 > Postcondition is not implied! 5.28/5.29 5.28/5.29 LOG: RETURN check - Elapsed time: 0.000669s 5.28/5.29 INVARIANTS: 5.28/5.29 2: 5.28/5.29 Quasi-INVARIANTS to narrow Graph: 5.28/5.29 2: q^0 <= 1 + r^0 , 5.28/5.29 Narrowing transition: 5.28/5.29 undef14, rest remain the same}> 5.28/5.29 5.28/5.29 LOG: Narrow transition size 1 5.28/5.29 Narrowing transition: 5.28/5.29 undef14, rest remain the same}> 5.28/5.29 5.28/5.29 LOG: Narrow transition size 1 5.28/5.29 invGraph after Narrowing: 5.28/5.29 Transitions: 5.28/5.29 undef14, rest remain the same}> 5.28/5.29 undef14, rest remain the same}> 5.28/5.29 Variables: 5.28/5.29 q^0, r^0 5.28/5.29 Checking conditional termination of SCC {l2}... 5.28/5.29 5.28/5.29 LOG: CALL solveLinear 5.28/5.29 5.28/5.29 LOG: RETURN solveLinear - Elapsed time: 0.000895s 5.28/5.29 5.28/5.29 LOG: CALL solveLinear 5.28/5.29 5.28/5.29 LOG: RETURN solveLinear - Elapsed time: 0.003393s 5.28/5.29 Trying to remove transition: undef14, rest remain the same}> 5.28/5.29 Solving with 1 template(s). 5.28/5.29 5.28/5.29 LOG: CALL solveNonLinearGetFirstSolution 5.28/5.29 5.28/5.29 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006328s 5.28/5.29 Time used: 0.006163 5.28/5.29 Trying to remove transition: undef14, rest remain the same}> 5.28/5.29 Solving with 1 template(s). 5.28/5.29 5.28/5.29 LOG: CALL solveNonLinearGetFirstSolution 5.28/5.29 5.28/5.29 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006418s 5.28/5.29 Time used: 0.005918 5.28/5.29 Solving with 1 template(s). 5.28/5.29 5.28/5.29 LOG: CALL solveNonLinearGetFirstSolution 5.28/5.29 5.28/5.29 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011682s 5.28/5.29 Time used: 0.011186 5.28/5.29 Solving with 2 template(s). 5.28/5.29 5.28/5.29 LOG: CALL solveNonLinearGetFirstSolution 5.28/5.29 5.28/5.29 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001413s 5.28/5.29 Time used: 4.00064 5.28/5.29 Solving with 3 template(s). 5.28/5.29 5.28/5.29 LOG: CALL solveNonLinearGetFirstSolution 5.28/5.29 5.28/5.29 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.012306s 5.28/5.29 Time used: 1.00063 5.28/5.29 Solving with 1 template(s). 5.28/5.29 5.28/5.29 LOG: CALL solveNonLinearGetFirstSolution 5.28/5.29 5.28/5.29 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021536s 5.28/5.29 Time used: 0.012676 5.28/5.29 5.28/5.29 Proving non-termination of subgraph 1 5.28/5.29 Transitions: 5.28/5.29 undef14, rest remain the same}> 5.28/5.29 undef14, rest remain the same}> 5.28/5.29 Variables: 5.28/5.29 q^0, r^0 5.28/5.29 5.28/5.29 Checking conditional non-termination of SCC {l2}... 5.28/5.29 EXIT TRANSITIONS: 5.28/5.29 5.28/5.29 5.28/5.29 Solving with 1 template(s). 5.28/5.29 5.28/5.29 LOG: CALL solveNonLinearGetFirstSolution 5.28/5.29 5.28/5.29 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.028939s 5.28/5.29 Time used: 0.028722 5.28/5.29 Improving Solution with cost 1 ... 5.28/5.29 5.28/5.29 LOG: CALL solveNonLinearGetNextSolution 5.28/5.29 5.28/5.29 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.036207s 5.28/5.29 Time used: 0.03619 5.28/5.29 5.28/5.29 LOG: SAT solveNonLinear - Elapsed time: 0.065146s 5.28/5.29 Cost: 1; Total time: 0.064912 5.28/5.29 Failed at location 2: 2 + r^0 <= q^0 5.28/5.29 Before Improving: 5.28/5.29 Quasi-invariant at l2: 2 + r^0 <= q^0 5.28/5.29 Optimizing invariants... 5.28/5.29 5.28/5.29 LOG: CALL solveLinear 5.28/5.29 5.28/5.29 LOG: RETURN solveLinear - Elapsed time: 0.007603s 5.28/5.29 Remaining time after improvement: 0.99861 5.28/5.29 Minimizing number of undef constraints... 5.28/5.29 5.28/5.29 LOG: CALL solveNonLinear 5.28/5.29 5.28/5.29 LOG: RETURN solveNonLinear - Elapsed time: 0.002694s 5.28/5.29 Non-termination implied by a set of quasi-invariant(s): 5.28/5.29 Quasi-invariant at l2: 2 + r^0 <= q^0 5.28/5.29 Constraint over undef 'undef14 <= r^0' in transition: 5.28/5.29 undef14, rest remain the same}> 5.28/5.29 Constraint over undef '1 + q^0 <= undef14' in transition: 5.28/5.29 undef14, rest remain the same}> 5.28/5.29 5.28/5.29 Strengthening and disabling EXIT transitions... 5.28/5.29 Closed exits from l2: 1 5.28/5.29 5.28/5.29 Strengthening and disabling transitions... 5.28/5.29 5.28/5.29 LOG: CALL solverLinear in Graph for feasibility 5.28/5.29 5.28/5.29 LOG: RETURN solveLinear in Graph for feasibility 5.28/5.29 Strengthening transition (result): 5.28/5.29 undef14, rest remain the same}> 5.28/5.29 5.28/5.29 LOG: CALL solverLinear in Graph for feasibility 5.28/5.29 5.28/5.29 LOG: RETURN solveLinear in Graph for feasibility 5.28/5.29 Strengthening transition (result): 5.28/5.29 undef14, rest remain the same}> 5.28/5.29 5.28/5.29 Calling reachability with... 5.28/5.29 Transition: 5.28/5.29 Conditions: 2 + r^0 <= q^0, 5.28/5.29 OPEN EXITS: 5.28/5.29 5.28/5.29 5.28/5.29 --- Reachability graph --- 5.28/5.29 > Graph without transitions. 5.28/5.29 5.28/5.29 Calling reachability with... 5.28/5.29 Transition: 5.28/5.29 Conditions: 2 + r^0 <= q^0, 5.28/5.29 OPEN EXITS: 5.28/5.29 5.28/5.29 5.28/5.29 > Conditions are reachable! 5.28/5.29 5.28/5.29 Program does NOT terminate 5.28/5.29 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 5.28/5.29 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 5.28/5.29 EOF