12.48/12.51 NO 12.48/12.51 12.48/12.52 Solver Timeout: 4 12.48/12.52 Global Timeout: 300 12.48/12.52 No parsing errors! 12.48/12.52 Init Location: 0 12.48/12.52 Transitions: 12.48/12.52 12.48/12.52 12.48/12.52 undef18}> 12.48/12.52 (0 + y^0)}> 12.48/12.52 undef58}> 12.48/12.52 undef76}> 12.48/12.52 undef94}> 12.48/12.52 undef112}> 12.48/12.52 undef130}> 12.48/12.52 undef148}> 12.48/12.52 undef166}> 12.48/12.52 undef184}> 12.48/12.52 undef202}> 12.48/12.52 undef206}> 12.48/12.52 undef224}> 12.48/12.52 undef242}> 12.48/12.52 undef260}> 12.48/12.52 undef278}> 12.48/12.52 12.48/12.52 12.48/12.52 12.48/12.52 Fresh variables: 12.48/12.52 undef18, undef58, undef76, undef94, undef112, undef130, undef148, undef166, undef184, undef202, undef206, undef224, undef242, undef260, undef278, 12.48/12.52 12.48/12.52 Undef variables: 12.48/12.52 undef18, undef58, undef76, undef94, undef112, undef130, undef148, undef166, undef184, undef202, undef206, undef224, undef242, undef260, undef278, 12.48/12.52 12.48/12.52 Abstraction variables: 12.48/12.52 12.48/12.52 Exit nodes: 12.48/12.52 12.48/12.52 Accepting locations: 12.48/12.52 12.48/12.52 Asserts: 12.48/12.52 12.48/12.52 Preprocessed LLVMGraph 12.48/12.52 Init Location: 0 12.48/12.52 Transitions: 12.48/12.52 12.48/12.52 undef18, __disjvr_10^0 -> undef206, __disjvr_11^0 -> undef224, __disjvr_12^0 -> undef242, __disjvr_13^0 -> undef260, __disjvr_14^0 -> undef278, __disjvr_1^0 -> undef58, __disjvr_2^0 -> undef76, __disjvr_3^0 -> undef94, __disjvr_4^0 -> undef112, __disjvr_5^0 -> undef130, __disjvr_6^0 -> undef148, __disjvr_7^0 -> undef166, __disjvr_8^0 -> undef184, __disjvr_9^0 -> undef202, x^0 -> (0 + y^0)}> 12.48/12.52 12.48/12.52 Fresh variables: 12.48/12.52 undef18, undef58, undef76, undef94, undef112, undef130, undef148, undef166, undef184, undef202, undef206, undef224, undef242, undef260, undef278, 12.48/12.52 12.48/12.52 Undef variables: 12.48/12.52 undef18, undef58, undef76, undef94, undef112, undef130, undef148, undef166, undef184, undef202, undef206, undef224, undef242, undef260, undef278, 12.48/12.52 12.48/12.52 Abstraction variables: 12.48/12.52 12.48/12.52 Exit nodes: 12.48/12.52 12.48/12.52 Accepting locations: 12.48/12.52 12.48/12.52 Asserts: 12.48/12.52 12.48/12.52 ************************************************************* 12.48/12.52 ******************************************************************************************* 12.48/12.52 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 12.48/12.52 ******************************************************************************************* 12.48/12.52 12.48/12.52 Init Location: 0 12.48/12.52 Graph 0: 12.48/12.52 Transitions: 12.48/12.52 Variables: 12.48/12.52 12.48/12.52 Graph 1: 12.48/12.52 Transitions: 12.48/12.52 undef18, __disjvr_10^0 -> undef206, __disjvr_11^0 -> undef224, __disjvr_12^0 -> undef242, __disjvr_13^0 -> undef260, __disjvr_14^0 -> undef278, __disjvr_1^0 -> undef58, __disjvr_2^0 -> undef76, __disjvr_3^0 -> undef94, __disjvr_4^0 -> undef112, __disjvr_5^0 -> undef130, __disjvr_6^0 -> undef148, __disjvr_7^0 -> undef166, __disjvr_8^0 -> undef184, __disjvr_9^0 -> undef202, x^0 -> y^0, rest remain the same}> 12.48/12.52 Variables: 12.48/12.52 __disjvr_0^0, __disjvr_10^0, __disjvr_11^0, __disjvr_12^0, __disjvr_13^0, __disjvr_14^0, __disjvr_1^0, __disjvr_2^0, __disjvr_3^0, __disjvr_4^0, __disjvr_5^0, __disjvr_6^0, __disjvr_7^0, __disjvr_8^0, __disjvr_9^0, x^0, y^0 12.48/12.52 12.48/12.52 Precedence: 12.48/12.52 Graph 0 12.48/12.52 12.48/12.52 Graph 1 12.48/12.52 12.48/12.52 12.48/12.52 Map Locations to Subgraph: 12.48/12.52 ( 0 , 0 ) 12.48/12.52 ( 2 , 1 ) 12.48/12.52 12.48/12.52 ******************************************************************************************* 12.48/12.52 ******************************** CHECKING ASSERTIONS ******************************** 12.48/12.52 ******************************************************************************************* 12.48/12.52 12.48/12.52 Proving termination of subgraph 0 12.48/12.52 Proving termination of subgraph 1 12.48/12.52 Checking unfeasibility... 12.48/12.52 Time used: 0.011832 12.48/12.52 12.48/12.52 Checking conditional termination of SCC {l2}... 12.48/12.52 12.48/12.52 LOG: CALL solveLinear 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear - Elapsed time: 0.002695s 12.48/12.52 12.48/12.52 LOG: CALL solveLinear 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear - Elapsed time: 0.016123s 12.48/12.52 Trying to remove transition: undef18, __disjvr_10^0 -> undef206, __disjvr_11^0 -> undef224, __disjvr_12^0 -> undef242, __disjvr_13^0 -> undef260, __disjvr_14^0 -> undef278, __disjvr_1^0 -> undef58, __disjvr_2^0 -> undef76, __disjvr_3^0 -> undef94, __disjvr_4^0 -> undef112, __disjvr_5^0 -> undef130, __disjvr_6^0 -> undef148, __disjvr_7^0 -> undef166, __disjvr_8^0 -> undef184, __disjvr_9^0 -> undef202, x^0 -> y^0, rest remain the same}> 12.48/12.52 Solving with 1 template(s). 12.48/12.52 12.48/12.52 LOG: CALL solveNonLinearGetFirstSolution 12.48/12.52 12.48/12.52 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.038041s 12.48/12.52 Time used: 0.03637 12.48/12.52 Solving with 1 template(s). 12.48/12.52 12.48/12.52 LOG: CALL solveNonLinearGetFirstSolution 12.48/12.52 12.48/12.52 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.055465s 12.48/12.52 Time used: 0.050428 12.48/12.52 Improving Solution with cost 1 ... 12.48/12.52 12.48/12.52 LOG: CALL solveNonLinearGetNextSolution 12.48/12.52 12.48/12.52 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.045644s 12.48/12.52 Time used: 0.045636 12.48/12.52 12.48/12.52 LOG: SAT solveNonLinear - Elapsed time: 0.101109s 12.48/12.52 Cost: 1; Total time: 0.096064 12.48/12.52 Failed at location 2: 1 + x^0 <= 0 12.48/12.52 Before Improving: 12.48/12.52 Quasi-invariant at l2: 1 + x^0 <= 0 12.48/12.52 Optimizing invariants... 12.48/12.52 12.48/12.52 LOG: CALL solveLinear 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear - Elapsed time: 0.015350s 12.48/12.52 Remaining time after improvement: 0.992459 12.48/12.52 Termination implied by a set of quasi-invariant(s): 12.48/12.52 Quasi-invariant at l2: 1 + x^0 <= 0 12.48/12.52 [ Invariant Graph ] 12.48/12.52 Strengthening and disabling transitions... 12.48/12.52 12.48/12.52 LOG: CALL solverLinear in Graph for feasibility 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear in Graph for feasibility 12.48/12.52 It's unfeasible. Removing transition: 12.48/12.52 undef18, __disjvr_10^0 -> undef206, __disjvr_11^0 -> undef224, __disjvr_12^0 -> undef242, __disjvr_13^0 -> undef260, __disjvr_14^0 -> undef278, __disjvr_1^0 -> undef58, __disjvr_2^0 -> undef76, __disjvr_3^0 -> undef94, __disjvr_4^0 -> undef112, __disjvr_5^0 -> undef130, __disjvr_6^0 -> undef148, __disjvr_7^0 -> undef166, __disjvr_8^0 -> undef184, __disjvr_9^0 -> undef202, x^0 -> y^0, rest remain the same}> 12.48/12.52 [ Termination Graph ] 12.48/12.52 Strengthening and disabling transitions... 12.48/12.52 12.48/12.52 LOG: CALL solverLinear in Graph for feasibility 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear in Graph for feasibility 12.48/12.52 It's unfeasible. Removing transition: 12.48/12.52 undef18, __disjvr_10^0 -> undef206, __disjvr_11^0 -> undef224, __disjvr_12^0 -> undef242, __disjvr_13^0 -> undef260, __disjvr_14^0 -> undef278, __disjvr_1^0 -> undef58, __disjvr_2^0 -> undef76, __disjvr_3^0 -> undef94, __disjvr_4^0 -> undef112, __disjvr_5^0 -> undef130, __disjvr_6^0 -> undef148, __disjvr_7^0 -> undef166, __disjvr_8^0 -> undef184, __disjvr_9^0 -> undef202, x^0 -> y^0, rest remain the same}> 12.48/12.52 New Graphs: 12.48/12.52 Calling Safety with literal 1 + x^0 <= 0 and entry 12.48/12.52 12.48/12.52 LOG: CALL check - Post:1 + x^0 <= 0 - Process 1 12.48/12.52 * Exit transition: 12.48/12.52 * Postcondition : 1 + x^0 <= 0 12.48/12.52 12.48/12.52 LOG: CALL solveLinear 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear - Elapsed time: 0.001033s 12.48/12.52 > Postcondition is not implied! 12.48/12.52 12.48/12.52 LOG: RETURN check - Elapsed time: 0.001097s 12.48/12.52 INVARIANTS: 12.48/12.52 2: 12.48/12.52 Quasi-INVARIANTS to narrow Graph: 12.48/12.52 2: 1 + x^0 <= 0 , 12.48/12.52 Narrowing transition: 12.48/12.52 undef18, __disjvr_10^0 -> undef206, __disjvr_11^0 -> undef224, __disjvr_12^0 -> undef242, __disjvr_13^0 -> undef260, __disjvr_14^0 -> undef278, __disjvr_1^0 -> undef58, __disjvr_2^0 -> undef76, __disjvr_3^0 -> undef94, __disjvr_4^0 -> undef112, __disjvr_5^0 -> undef130, __disjvr_6^0 -> undef148, __disjvr_7^0 -> undef166, __disjvr_8^0 -> undef184, __disjvr_9^0 -> undef202, x^0 -> y^0, rest remain the same}> 12.48/12.52 12.48/12.52 LOG: Narrow transition size 1 12.48/12.52 invGraph after Narrowing: 12.48/12.52 Transitions: 12.48/12.52 undef18, __disjvr_10^0 -> undef206, __disjvr_11^0 -> undef224, __disjvr_12^0 -> undef242, __disjvr_13^0 -> undef260, __disjvr_14^0 -> undef278, __disjvr_1^0 -> undef58, __disjvr_2^0 -> undef76, __disjvr_3^0 -> undef94, __disjvr_4^0 -> undef112, __disjvr_5^0 -> undef130, __disjvr_6^0 -> undef148, __disjvr_7^0 -> undef166, __disjvr_8^0 -> undef184, __disjvr_9^0 -> undef202, x^0 -> y^0, rest remain the same}> 12.48/12.52 Variables: 12.48/12.52 __disjvr_0^0, __disjvr_10^0, __disjvr_11^0, __disjvr_12^0, __disjvr_13^0, __disjvr_14^0, __disjvr_1^0, __disjvr_2^0, __disjvr_3^0, __disjvr_4^0, __disjvr_5^0, __disjvr_6^0, __disjvr_7^0, __disjvr_8^0, __disjvr_9^0, x^0, y^0 12.48/12.52 Checking conditional termination of SCC {l2}... 12.48/12.52 12.48/12.52 LOG: CALL solveLinear 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear - Elapsed time: 0.002214s 12.48/12.52 12.48/12.52 LOG: CALL solveLinear 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear - Elapsed time: 0.012521s 12.48/12.52 Trying to remove transition: undef18, __disjvr_10^0 -> undef206, __disjvr_11^0 -> undef224, __disjvr_12^0 -> undef242, __disjvr_13^0 -> undef260, __disjvr_14^0 -> undef278, __disjvr_1^0 -> undef58, __disjvr_2^0 -> undef76, __disjvr_3^0 -> undef94, __disjvr_4^0 -> undef112, __disjvr_5^0 -> undef130, __disjvr_6^0 -> undef148, __disjvr_7^0 -> undef166, __disjvr_8^0 -> undef184, __disjvr_9^0 -> undef202, x^0 -> y^0, rest remain the same}> 12.48/12.52 Solving with 1 template(s). 12.48/12.52 12.48/12.52 LOG: CALL solveNonLinearGetFirstSolution 12.48/12.52 12.48/12.52 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.027115s 12.48/12.52 Time used: 0.025403 12.48/12.52 Solving with 1 template(s). 12.48/12.52 12.48/12.52 LOG: CALL solveNonLinearGetFirstSolution 12.48/12.52 12.48/12.52 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.068220s 12.48/12.52 Time used: 0.062849 12.48/12.52 Improving Solution with cost 1 ... 12.48/12.52 12.48/12.52 LOG: CALL solveNonLinearGetNextSolution 12.48/12.52 12.48/12.52 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.037011s 12.48/12.52 Time used: 0.037004 12.48/12.52 12.48/12.52 LOG: SAT solveNonLinear - Elapsed time: 0.105232s 12.48/12.52 Cost: 1; Total time: 0.099853 12.48/12.52 Failed at location 2: 1 + y^0 <= 0 12.48/12.52 Before Improving: 12.48/12.52 Quasi-invariant at l2: 1 + y^0 <= 0 12.48/12.52 Optimizing invariants... 12.48/12.52 12.48/12.52 LOG: CALL solveLinear 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear - Elapsed time: 0.015304s 12.48/12.52 Remaining time after improvement: 0.992437 12.48/12.52 Termination implied by a set of quasi-invariant(s): 12.48/12.52 Quasi-invariant at l2: 1 + y^0 <= 0 12.48/12.52 [ Invariant Graph ] 12.48/12.52 Strengthening and disabling transitions... 12.48/12.52 12.48/12.52 LOG: CALL solverLinear in Graph for feasibility 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear in Graph for feasibility 12.48/12.52 Strengthening transition (result): 12.48/12.52 undef18, __disjvr_10^0 -> undef206, __disjvr_11^0 -> undef224, __disjvr_12^0 -> undef242, __disjvr_13^0 -> undef260, __disjvr_14^0 -> undef278, __disjvr_1^0 -> undef58, __disjvr_2^0 -> undef76, __disjvr_3^0 -> undef94, __disjvr_4^0 -> undef112, __disjvr_5^0 -> undef130, __disjvr_6^0 -> undef148, __disjvr_7^0 -> undef166, __disjvr_8^0 -> undef184, __disjvr_9^0 -> undef202, x^0 -> y^0, rest remain the same}> 12.48/12.52 [ Termination Graph ] 12.48/12.52 Strengthening and disabling transitions... 12.48/12.52 12.48/12.52 LOG: CALL solverLinear in Graph for feasibility 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear in Graph for feasibility 12.48/12.52 Strengthening transition (result): 12.48/12.52 undef18, __disjvr_10^0 -> undef206, __disjvr_11^0 -> undef224, __disjvr_12^0 -> undef242, __disjvr_13^0 -> undef260, __disjvr_14^0 -> undef278, __disjvr_1^0 -> undef58, __disjvr_2^0 -> undef76, __disjvr_3^0 -> undef94, __disjvr_4^0 -> undef112, __disjvr_5^0 -> undef130, __disjvr_6^0 -> undef148, __disjvr_7^0 -> undef166, __disjvr_8^0 -> undef184, __disjvr_9^0 -> undef202, x^0 -> y^0, rest remain the same}> 12.48/12.52 Ranking function: x^0 12.48/12.52 New Graphs: 12.48/12.52 Calling Safety with literal 1 + y^0 <= 0 and entry 12.48/12.52 12.48/12.52 LOG: CALL check - Post:1 + y^0 <= 0 - Process 2 12.48/12.52 * Exit transition: 12.48/12.52 * Postcondition : 1 + y^0 <= 0 12.48/12.52 12.48/12.52 LOG: CALL solveLinear 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear - Elapsed time: 0.000792s 12.48/12.52 > Postcondition is not implied! 12.48/12.52 12.48/12.52 LOG: RETURN check - Elapsed time: 0.000860s 12.48/12.52 INVARIANTS: 12.48/12.52 2: 12.48/12.52 Quasi-INVARIANTS to narrow Graph: 12.48/12.52 2: 1 + y^0 <= 0 , 12.48/12.52 Narrowing transition: 12.48/12.52 undef18, __disjvr_10^0 -> undef206, __disjvr_11^0 -> undef224, __disjvr_12^0 -> undef242, __disjvr_13^0 -> undef260, __disjvr_14^0 -> undef278, __disjvr_1^0 -> undef58, __disjvr_2^0 -> undef76, __disjvr_3^0 -> undef94, __disjvr_4^0 -> undef112, __disjvr_5^0 -> undef130, __disjvr_6^0 -> undef148, __disjvr_7^0 -> undef166, __disjvr_8^0 -> undef184, __disjvr_9^0 -> undef202, x^0 -> y^0, rest remain the same}> 12.48/12.52 12.48/12.52 LOG: Narrow transition size 1 12.48/12.52 invGraph after Narrowing: 12.48/12.52 Transitions: 12.48/12.52 undef18, __disjvr_10^0 -> undef206, __disjvr_11^0 -> undef224, __disjvr_12^0 -> undef242, __disjvr_13^0 -> undef260, __disjvr_14^0 -> undef278, __disjvr_1^0 -> undef58, __disjvr_2^0 -> undef76, __disjvr_3^0 -> undef94, __disjvr_4^0 -> undef112, __disjvr_5^0 -> undef130, __disjvr_6^0 -> undef148, __disjvr_7^0 -> undef166, __disjvr_8^0 -> undef184, __disjvr_9^0 -> undef202, x^0 -> y^0, rest remain the same}> 12.48/12.52 Variables: 12.48/12.52 __disjvr_0^0, __disjvr_10^0, __disjvr_11^0, __disjvr_12^0, __disjvr_13^0, __disjvr_14^0, __disjvr_1^0, __disjvr_2^0, __disjvr_3^0, __disjvr_4^0, __disjvr_5^0, __disjvr_6^0, __disjvr_7^0, __disjvr_8^0, __disjvr_9^0, x^0, y^0 12.48/12.52 Checking conditional termination of SCC {l2}... 12.48/12.52 12.48/12.52 LOG: CALL solveLinear 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear - Elapsed time: 0.002288s 12.48/12.52 12.48/12.52 LOG: CALL solveLinear 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear - Elapsed time: 0.013800s 12.48/12.52 Trying to remove transition: undef18, __disjvr_10^0 -> undef206, __disjvr_11^0 -> undef224, __disjvr_12^0 -> undef242, __disjvr_13^0 -> undef260, __disjvr_14^0 -> undef278, __disjvr_1^0 -> undef58, __disjvr_2^0 -> undef76, __disjvr_3^0 -> undef94, __disjvr_4^0 -> undef112, __disjvr_5^0 -> undef130, __disjvr_6^0 -> undef148, __disjvr_7^0 -> undef166, __disjvr_8^0 -> undef184, __disjvr_9^0 -> undef202, x^0 -> y^0, rest remain the same}> 12.48/12.52 Solving with 1 template(s). 12.48/12.52 12.48/12.52 LOG: CALL solveNonLinearGetFirstSolution 12.48/12.52 12.48/12.52 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.025254s 12.48/12.52 Time used: 0.02347 12.48/12.52 Solving with 1 template(s). 12.48/12.52 12.48/12.52 LOG: CALL solveNonLinearGetFirstSolution 12.48/12.52 12.48/12.52 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.053001s 12.48/12.52 Time used: 0.0479 12.48/12.52 Improving Solution with cost 1 ... 12.48/12.52 12.48/12.52 LOG: CALL solveNonLinearGetNextSolution 12.48/12.52 12.48/12.52 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.032059s 12.48/12.52 Time used: 0.032052 12.48/12.52 12.48/12.52 LOG: SAT solveNonLinear - Elapsed time: 0.085060s 12.48/12.52 Cost: 1; Total time: 0.079952 12.48/12.52 Failed at location 2: 1 <= x^0 12.48/12.52 Before Improving: 12.48/12.52 Quasi-invariant at l2: 1 <= x^0 12.48/12.52 Optimizing invariants... 12.48/12.52 12.48/12.52 LOG: CALL solveLinear 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear - Elapsed time: 0.015722s 12.48/12.52 Remaining time after improvement: 0.991959 12.48/12.52 Termination implied by a set of quasi-invariant(s): 12.48/12.52 Quasi-invariant at l2: 1 <= x^0 12.48/12.52 [ Invariant Graph ] 12.48/12.52 Strengthening and disabling transitions... 12.48/12.52 12.48/12.52 LOG: CALL solverLinear in Graph for feasibility 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear in Graph for feasibility 12.48/12.52 It's unfeasible. Removing transition: 12.48/12.52 undef18, __disjvr_10^0 -> undef206, __disjvr_11^0 -> undef224, __disjvr_12^0 -> undef242, __disjvr_13^0 -> undef260, __disjvr_14^0 -> undef278, __disjvr_1^0 -> undef58, __disjvr_2^0 -> undef76, __disjvr_3^0 -> undef94, __disjvr_4^0 -> undef112, __disjvr_5^0 -> undef130, __disjvr_6^0 -> undef148, __disjvr_7^0 -> undef166, __disjvr_8^0 -> undef184, __disjvr_9^0 -> undef202, x^0 -> y^0, rest remain the same}> 12.48/12.52 [ Termination Graph ] 12.48/12.52 Strengthening and disabling transitions... 12.48/12.52 > It's unfeasible. Removing transition: 12.48/12.52 undef18, __disjvr_10^0 -> undef206, __disjvr_11^0 -> undef224, __disjvr_12^0 -> undef242, __disjvr_13^0 -> undef260, __disjvr_14^0 -> undef278, __disjvr_1^0 -> undef58, __disjvr_2^0 -> undef76, __disjvr_3^0 -> undef94, __disjvr_4^0 -> undef112, __disjvr_5^0 -> undef130, __disjvr_6^0 -> undef148, __disjvr_7^0 -> undef166, __disjvr_8^0 -> undef184, __disjvr_9^0 -> undef202, x^0 -> y^0, rest remain the same}> 12.48/12.52 New Graphs: 12.48/12.52 Calling Safety with literal 1 <= x^0 and entry 12.48/12.52 12.48/12.52 LOG: CALL check - Post:1 <= x^0 - Process 3 12.48/12.52 * Exit transition: 12.48/12.52 * Postcondition : 1 <= x^0 12.48/12.52 12.48/12.52 LOG: CALL solveLinear 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear - Elapsed time: 0.001334s 12.48/12.52 > Postcondition is not implied! 12.48/12.52 12.48/12.52 LOG: RETURN check - Elapsed time: 0.001413s 12.48/12.52 INVARIANTS: 12.48/12.52 2: 12.48/12.52 Quasi-INVARIANTS to narrow Graph: 12.48/12.52 2: 1 <= x^0 , 12.48/12.52 Narrowing transition: 12.48/12.52 undef18, __disjvr_10^0 -> undef206, __disjvr_11^0 -> undef224, __disjvr_12^0 -> undef242, __disjvr_13^0 -> undef260, __disjvr_14^0 -> undef278, __disjvr_1^0 -> undef58, __disjvr_2^0 -> undef76, __disjvr_3^0 -> undef94, __disjvr_4^0 -> undef112, __disjvr_5^0 -> undef130, __disjvr_6^0 -> undef148, __disjvr_7^0 -> undef166, __disjvr_8^0 -> undef184, __disjvr_9^0 -> undef202, x^0 -> y^0, rest remain the same}> 12.48/12.52 12.48/12.52 LOG: Narrow transition size 1 12.48/12.52 invGraph after Narrowing: 12.48/12.52 Transitions: 12.48/12.52 undef18, __disjvr_10^0 -> undef206, __disjvr_11^0 -> undef224, __disjvr_12^0 -> undef242, __disjvr_13^0 -> undef260, __disjvr_14^0 -> undef278, __disjvr_1^0 -> undef58, __disjvr_2^0 -> undef76, __disjvr_3^0 -> undef94, __disjvr_4^0 -> undef112, __disjvr_5^0 -> undef130, __disjvr_6^0 -> undef148, __disjvr_7^0 -> undef166, __disjvr_8^0 -> undef184, __disjvr_9^0 -> undef202, x^0 -> y^0, rest remain the same}> 12.48/12.52 Variables: 12.48/12.52 __disjvr_0^0, __disjvr_10^0, __disjvr_11^0, __disjvr_12^0, __disjvr_13^0, __disjvr_14^0, __disjvr_1^0, __disjvr_2^0, __disjvr_3^0, __disjvr_4^0, __disjvr_5^0, __disjvr_6^0, __disjvr_7^0, __disjvr_8^0, __disjvr_9^0, x^0, y^0 12.48/12.52 Checking conditional termination of SCC {l2}... 12.48/12.52 12.48/12.52 LOG: CALL solveLinear 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear - Elapsed time: 0.002331s 12.48/12.52 12.48/12.52 LOG: CALL solveLinear 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear - Elapsed time: 0.013257s 12.48/12.52 Trying to remove transition: undef18, __disjvr_10^0 -> undef206, __disjvr_11^0 -> undef224, __disjvr_12^0 -> undef242, __disjvr_13^0 -> undef260, __disjvr_14^0 -> undef278, __disjvr_1^0 -> undef58, __disjvr_2^0 -> undef76, __disjvr_3^0 -> undef94, __disjvr_4^0 -> undef112, __disjvr_5^0 -> undef130, __disjvr_6^0 -> undef148, __disjvr_7^0 -> undef166, __disjvr_8^0 -> undef184, __disjvr_9^0 -> undef202, x^0 -> y^0, rest remain the same}> 12.48/12.52 Solving with 1 template(s). 12.48/12.52 12.48/12.52 LOG: CALL solveNonLinearGetFirstSolution 12.48/12.52 12.48/12.52 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026514s 12.48/12.52 Time used: 0.024623 12.48/12.52 Solving with 1 template(s). 12.48/12.52 12.48/12.52 LOG: CALL solveNonLinearGetFirstSolution 12.48/12.52 12.48/12.52 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.062747s 12.48/12.52 Time used: 0.057293 12.48/12.52 Improving Solution with cost 1 ... 12.48/12.52 12.48/12.52 LOG: CALL solveNonLinearGetNextSolution 12.48/12.52 12.48/12.52 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.036913s 12.48/12.52 Time used: 0.036905 12.48/12.52 12.48/12.52 LOG: SAT solveNonLinear - Elapsed time: 0.099660s 12.48/12.52 Cost: 1; Total time: 0.094198 12.48/12.52 Failed at location 2: 1 <= y^0 12.48/12.52 Before Improving: 12.48/12.52 Quasi-invariant at l2: 1 <= y^0 12.48/12.52 Optimizing invariants... 12.48/12.52 12.48/12.52 LOG: CALL solveLinear 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear - Elapsed time: 0.015918s 12.48/12.52 Remaining time after improvement: 0.992008 12.48/12.52 Termination implied by a set of quasi-invariant(s): 12.48/12.52 Quasi-invariant at l2: 1 <= y^0 12.48/12.52 [ Invariant Graph ] 12.48/12.52 Strengthening and disabling transitions... 12.48/12.52 12.48/12.52 LOG: CALL solverLinear in Graph for feasibility 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear in Graph for feasibility 12.48/12.52 Strengthening transition (result): 12.48/12.52 undef18, __disjvr_10^0 -> undef206, __disjvr_11^0 -> undef224, __disjvr_12^0 -> undef242, __disjvr_13^0 -> undef260, __disjvr_14^0 -> undef278, __disjvr_1^0 -> undef58, __disjvr_2^0 -> undef76, __disjvr_3^0 -> undef94, __disjvr_4^0 -> undef112, __disjvr_5^0 -> undef130, __disjvr_6^0 -> undef148, __disjvr_7^0 -> undef166, __disjvr_8^0 -> undef184, __disjvr_9^0 -> undef202, x^0 -> y^0, rest remain the same}> 12.48/12.52 [ Termination Graph ] 12.48/12.52 Strengthening and disabling transitions... 12.48/12.52 12.48/12.52 LOG: CALL solverLinear in Graph for feasibility 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear in Graph for feasibility 12.48/12.52 Strengthening transition (result): 12.48/12.52 undef18, __disjvr_10^0 -> undef206, __disjvr_11^0 -> undef224, __disjvr_12^0 -> undef242, __disjvr_13^0 -> undef260, __disjvr_14^0 -> undef278, __disjvr_1^0 -> undef58, __disjvr_2^0 -> undef76, __disjvr_3^0 -> undef94, __disjvr_4^0 -> undef112, __disjvr_5^0 -> undef130, __disjvr_6^0 -> undef148, __disjvr_7^0 -> undef166, __disjvr_8^0 -> undef184, __disjvr_9^0 -> undef202, x^0 -> y^0, rest remain the same}> 12.48/12.52 Ranking function: -x^0 12.48/12.52 New Graphs: 12.48/12.52 Calling Safety with literal 1 <= y^0 and entry 12.48/12.52 12.48/12.52 LOG: CALL check - Post:1 <= y^0 - Process 4 12.48/12.52 * Exit transition: 12.48/12.52 * Postcondition : 1 <= y^0 12.48/12.52 12.48/12.52 LOG: CALL solveLinear 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear - Elapsed time: 0.001019s 12.48/12.52 > Postcondition is not implied! 12.48/12.52 12.48/12.52 LOG: RETURN check - Elapsed time: 0.001097s 12.48/12.52 INVARIANTS: 12.48/12.52 2: 12.48/12.52 Quasi-INVARIANTS to narrow Graph: 12.48/12.52 2: 1 <= y^0 , 12.48/12.52 Narrowing transition: 12.48/12.52 undef18, __disjvr_10^0 -> undef206, __disjvr_11^0 -> undef224, __disjvr_12^0 -> undef242, __disjvr_13^0 -> undef260, __disjvr_14^0 -> undef278, __disjvr_1^0 -> undef58, __disjvr_2^0 -> undef76, __disjvr_3^0 -> undef94, __disjvr_4^0 -> undef112, __disjvr_5^0 -> undef130, __disjvr_6^0 -> undef148, __disjvr_7^0 -> undef166, __disjvr_8^0 -> undef184, __disjvr_9^0 -> undef202, x^0 -> y^0, rest remain the same}> 12.48/12.52 12.48/12.52 LOG: Narrow transition size 1 12.48/12.52 invGraph after Narrowing: 12.48/12.52 Transitions: 12.48/12.52 undef18, __disjvr_10^0 -> undef206, __disjvr_11^0 -> undef224, __disjvr_12^0 -> undef242, __disjvr_13^0 -> undef260, __disjvr_14^0 -> undef278, __disjvr_1^0 -> undef58, __disjvr_2^0 -> undef76, __disjvr_3^0 -> undef94, __disjvr_4^0 -> undef112, __disjvr_5^0 -> undef130, __disjvr_6^0 -> undef148, __disjvr_7^0 -> undef166, __disjvr_8^0 -> undef184, __disjvr_9^0 -> undef202, x^0 -> y^0, rest remain the same}> 12.48/12.52 Variables: 12.48/12.52 __disjvr_0^0, __disjvr_10^0, __disjvr_11^0, __disjvr_12^0, __disjvr_13^0, __disjvr_14^0, __disjvr_1^0, __disjvr_2^0, __disjvr_3^0, __disjvr_4^0, __disjvr_5^0, __disjvr_6^0, __disjvr_7^0, __disjvr_8^0, __disjvr_9^0, x^0, y^0 12.48/12.52 Checking conditional termination of SCC {l2}... 12.48/12.52 12.48/12.52 LOG: CALL solveLinear 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear - Elapsed time: 0.002298s 12.48/12.52 12.48/12.52 LOG: CALL solveLinear 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear - Elapsed time: 0.013474s 12.48/12.52 Trying to remove transition: undef18, __disjvr_10^0 -> undef206, __disjvr_11^0 -> undef224, __disjvr_12^0 -> undef242, __disjvr_13^0 -> undef260, __disjvr_14^0 -> undef278, __disjvr_1^0 -> undef58, __disjvr_2^0 -> undef76, __disjvr_3^0 -> undef94, __disjvr_4^0 -> undef112, __disjvr_5^0 -> undef130, __disjvr_6^0 -> undef148, __disjvr_7^0 -> undef166, __disjvr_8^0 -> undef184, __disjvr_9^0 -> undef202, x^0 -> y^0, rest remain the same}> 12.48/12.52 Solving with 1 template(s). 12.48/12.52 12.48/12.52 LOG: CALL solveNonLinearGetFirstSolution 12.48/12.52 12.48/12.52 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.025876s 12.48/12.52 Time used: 0.023888 12.48/12.52 Solving with 1 template(s). 12.48/12.52 12.48/12.52 LOG: CALL solveNonLinearGetFirstSolution 12.48/12.52 12.48/12.52 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.068791s 12.48/12.52 Time used: 0.063858 12.48/12.52 Solving with 2 template(s). 12.48/12.52 12.48/12.52 LOG: CALL solveNonLinearGetFirstSolution 12.48/12.52 12.48/12.52 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005399s 12.48/12.52 Time used: 4.00003 12.48/12.52 Solving with 3 template(s). 12.48/12.52 12.48/12.52 LOG: CALL solveNonLinearGetFirstSolution 12.48/12.52 12.48/12.52 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.040880s 12.48/12.52 Time used: 1.00013 12.48/12.52 Solving with 1 template(s). 12.48/12.52 12.48/12.52 LOG: CALL solveNonLinearGetFirstSolution 12.48/12.52 12.48/12.52 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.029489s 12.48/12.52 Time used: 0.025692 12.48/12.52 12.48/12.52 Proving non-termination of subgraph 1 12.48/12.52 Transitions: 12.48/12.52 undef18, __disjvr_10^0 -> undef206, __disjvr_11^0 -> undef224, __disjvr_12^0 -> undef242, __disjvr_13^0 -> undef260, __disjvr_14^0 -> undef278, __disjvr_1^0 -> undef58, __disjvr_2^0 -> undef76, __disjvr_3^0 -> undef94, __disjvr_4^0 -> undef112, __disjvr_5^0 -> undef130, __disjvr_6^0 -> undef148, __disjvr_7^0 -> undef166, __disjvr_8^0 -> undef184, __disjvr_9^0 -> undef202, x^0 -> y^0, rest remain the same}> 12.48/12.52 Variables: 12.48/12.52 __disjvr_0^0, __disjvr_10^0, __disjvr_11^0, __disjvr_12^0, __disjvr_13^0, __disjvr_14^0, __disjvr_1^0, __disjvr_2^0, __disjvr_3^0, __disjvr_4^0, __disjvr_5^0, __disjvr_6^0, __disjvr_7^0, __disjvr_8^0, __disjvr_9^0, x^0, y^0 12.48/12.52 12.48/12.52 Checking that every undef value has an assignment... 12.48/12.52 12.48/12.52 LOG: CALL solveLinear 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear - Elapsed time: 0.016547s 12.48/12.52 Checking conditional non-termination of SCC {l2}... 12.48/12.52 EXIT TRANSITIONS: 12.48/12.52 12.48/12.52 12.48/12.52 12.48/12.52 12.48/12.52 12.48/12.52 12.48/12.52 12.48/12.52 Solving with 1 template(s). 12.48/12.52 12.48/12.52 LOG: CALL solveNonLinearGetFirstSolution 12.48/12.52 12.48/12.52 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.521456s 12.48/12.52 Time used: 1.51747 12.48/12.52 Improving Solution with cost 4 ... 12.48/12.52 12.48/12.52 LOG: CALL solveNonLinearGetNextSolution 12.48/12.52 12.48/12.52 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.004576s 12.48/12.52 Time used: 1.00453 12.48/12.52 12.48/12.52 LOG: SAT solveNonLinear - Elapsed time: 2.526032s 12.48/12.52 Cost: 4; Total time: 2.522 12.48/12.52 Failed at location 2: y^0 <= 0 12.48/12.52 Before Improving: 12.48/12.52 Quasi-invariant at l2: y^0 <= 0 12.48/12.52 Optimizing invariants... 12.48/12.52 12.48/12.52 LOG: CALL solveLinear 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear - Elapsed time: 0.057530s 12.48/12.52 Remaining time after improvement: 0.979367 12.48/12.52 Minimizing number of undef constraints... 12.48/12.52 12.48/12.52 LOG: CALL solveNonLinear 12.48/12.52 12.48/12.52 LOG: RETURN solveNonLinear - Elapsed time: 0.035129s 12.48/12.52 Number of undef constraints reduced! 12.48/12.52 12.48/12.52 Non-termination implied by a set of quasi-invariant(s): 12.48/12.52 Quasi-invariant at l2: y^0 <= 0 12.48/12.52 12.48/12.52 Strengthening and disabling EXIT transitions... 12.48/12.52 Closed exits from l2: 3 12.48/12.52 Strengthening exit transition (result): 12.48/12.52 12.48/12.52 Strengthening exit transition (result): 12.48/12.52 12.48/12.52 Strengthening exit transition (result): 12.48/12.52 12.48/12.52 12.48/12.52 Strengthening and disabling transitions... 12.48/12.52 12.48/12.52 LOG: CALL solverLinear in Graph for feasibility 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear in Graph for feasibility 12.48/12.52 Strengthening transition (result): 12.48/12.52 undef18, __disjvr_10^0 -> undef206, __disjvr_11^0 -> undef224, __disjvr_12^0 -> undef242, __disjvr_13^0 -> undef260, __disjvr_14^0 -> undef278, __disjvr_1^0 -> undef58, __disjvr_2^0 -> undef76, __disjvr_3^0 -> undef94, __disjvr_4^0 -> undef112, __disjvr_5^0 -> undef130, __disjvr_6^0 -> undef148, __disjvr_7^0 -> undef166, __disjvr_8^0 -> undef184, __disjvr_9^0 -> undef202, x^0 -> y^0, rest remain the same}> 12.48/12.52 12.48/12.52 Checking conditional non-termination of SCC {l2}... 12.48/12.52 EXIT TRANSITIONS: 12.48/12.52 12.48/12.52 12.48/12.52 12.48/12.52 12.48/12.52 Solving with 1 template(s). 12.48/12.52 12.48/12.52 LOG: CALL solveNonLinearGetFirstSolution 12.48/12.52 12.48/12.52 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.199095s 12.48/12.52 Time used: 1.19509 12.48/12.52 Improving Solution with cost 2 ... 12.48/12.52 12.48/12.52 LOG: CALL solveNonLinearGetNextSolution 12.48/12.52 12.48/12.52 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.004084s 12.48/12.52 Time used: 1.00404 12.48/12.52 12.48/12.52 LOG: SAT solveNonLinear - Elapsed time: 2.203179s 12.48/12.52 Cost: 2; Total time: 2.19914 12.48/12.52 Failed at location 2: x^0 <= y^0 12.48/12.52 Before Improving: 12.48/12.52 Quasi-invariant at l2: x^0 <= y^0 12.48/12.52 Optimizing invariants... 12.48/12.52 12.48/12.52 LOG: CALL solveLinear 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear - Elapsed time: 0.060475s 12.48/12.52 Remaining time after improvement: 0.976643 12.48/12.52 Minimizing number of undef constraints... 12.48/12.52 12.48/12.52 LOG: CALL solveNonLinear 12.48/12.52 12.48/12.52 LOG: RETURN solveNonLinear - Elapsed time: 0.036020s 12.48/12.52 Number of undef constraints reduced! 12.48/12.52 12.48/12.52 Non-termination implied by a set of quasi-invariant(s): 12.48/12.52 Quasi-invariant at l2: x^0 <= y^0 12.48/12.52 12.48/12.52 Strengthening and disabling EXIT transitions... 12.48/12.52 Closed exits from l2: 2 12.48/12.52 Strengthening exit transition (result): 12.48/12.52 12.48/12.52 12.48/12.52 Strengthening and disabling transitions... 12.48/12.52 12.48/12.52 LOG: CALL solverLinear in Graph for feasibility 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear in Graph for feasibility 12.48/12.52 Strengthening transition (result): 12.48/12.52 undef18, __disjvr_10^0 -> undef206, __disjvr_11^0 -> undef224, __disjvr_12^0 -> undef242, __disjvr_13^0 -> undef260, __disjvr_14^0 -> undef278, __disjvr_1^0 -> undef58, __disjvr_2^0 -> undef76, __disjvr_3^0 -> undef94, __disjvr_4^0 -> undef112, __disjvr_5^0 -> undef130, __disjvr_6^0 -> undef148, __disjvr_7^0 -> undef166, __disjvr_8^0 -> undef184, __disjvr_9^0 -> undef202, x^0 -> y^0, rest remain the same}> 12.48/12.52 12.48/12.52 Checking conditional non-termination of SCC {l2}... 12.48/12.52 EXIT TRANSITIONS: 12.48/12.52 12.48/12.52 12.48/12.52 Solving with 1 template(s). 12.48/12.52 12.48/12.52 LOG: CALL solveNonLinearGetFirstSolution 12.48/12.52 12.48/12.52 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.920086s 12.48/12.52 Time used: 0.916753 12.48/12.52 Improving Solution with cost 1 ... 12.48/12.52 12.48/12.52 LOG: CALL solveNonLinearGetNextSolution 12.48/12.52 12.48/12.52 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.385359s 12.48/12.52 Time used: 0.385337 12.48/12.52 12.48/12.52 LOG: SAT solveNonLinear - Elapsed time: 1.305444s 12.48/12.52 Cost: 1; Total time: 1.30209 12.48/12.52 Failed at location 2: 0 <= x^0 12.48/12.52 Before Improving: 12.48/12.52 Quasi-invariant at l2: 0 <= x^0 12.48/12.52 Optimizing invariants... 12.48/12.52 12.48/12.52 LOG: CALL solveLinear 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear - Elapsed time: 0.060870s 12.48/12.52 Remaining time after improvement: 0.974722 12.48/12.52 Minimizing number of undef constraints... 12.48/12.52 12.48/12.52 LOG: CALL solveNonLinear 12.48/12.52 12.48/12.52 LOG: RETURN solveNonLinear - Elapsed time: 0.036906s 12.48/12.52 Number of undef constraints reduced! 12.48/12.52 12.48/12.52 Non-termination implied by a set of quasi-invariant(s): 12.48/12.52 Quasi-invariant at l2: 0 <= x^0 12.48/12.52 12.48/12.52 Strengthening and disabling EXIT transitions... 12.48/12.52 Closed exits from l2: 1 12.48/12.52 12.48/12.52 Strengthening and disabling transitions... 12.48/12.52 12.48/12.52 LOG: CALL solverLinear in Graph for feasibility 12.48/12.52 12.48/12.52 LOG: RETURN solveLinear in Graph for feasibility 12.48/12.52 Strengthening transition (result): 12.48/12.52 undef18, __disjvr_10^0 -> undef206, __disjvr_11^0 -> undef224, __disjvr_12^0 -> undef242, __disjvr_13^0 -> undef260, __disjvr_14^0 -> undef278, __disjvr_1^0 -> undef58, __disjvr_2^0 -> undef76, __disjvr_3^0 -> undef94, __disjvr_4^0 -> undef112, __disjvr_5^0 -> undef130, __disjvr_6^0 -> undef148, __disjvr_7^0 -> undef166, __disjvr_8^0 -> undef184, __disjvr_9^0 -> undef202, x^0 -> y^0, rest remain the same}> 12.48/12.52 12.48/12.52 Calling reachability with... 12.48/12.52 Transition: 12.48/12.52 Conditions: y^0 <= 0, x^0 <= y^0, 0 <= x^0, 12.48/12.52 OPEN EXITS: 12.48/12.52 (condsUp: y^0 <= 0) 12.48/12.52 12.48/12.52 --- Reachability graph --- 12.48/12.52 > Graph without transitions. 12.48/12.52 12.48/12.52 Calling reachability with... 12.48/12.52 Transition: 12.48/12.52 Conditions: x^0 <= y^0, 0 <= x^0, y^0 <= 0, 12.48/12.52 OPEN EXITS: 12.48/12.52 12.48/12.52 12.48/12.52 > Conditions are reachable! 12.48/12.52 12.48/12.52 Program does NOT terminate 12.48/12.52 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 12.48/12.52 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 12.48/12.52 EOF