21.39/21.44 NO 21.39/21.44 21.39/21.44 Solver Timeout: 4 21.39/21.44 Global Timeout: 300 21.39/21.44 No parsing errors! 21.39/21.44 Init Location: 0 21.39/21.44 Transitions: 21.39/21.44 21.39/21.44 undef1, __cil_tmp2_7^0 -> undef2, __retres1_6^0 -> undef4, lt_13^0 -> undef10, tmp_11^0 -> (0 + undef15)}> 21.39/21.44 undef17, __cil_tmp2_7^0 -> undef18, __retres1_6^0 -> undef20, lt_12^0 -> undef25, lt_13^0 -> undef26, tmp_11^0 -> (0 + undef31)}> 21.39/21.44 undef34}> 21.39/21.44 21.39/21.44 21.39/21.44 undef76, __cil_tmp2_7^0 -> undef77, __retres1_6^0 -> undef79, lt_12^0 -> undef84, lt_13^0 -> undef85, tmp_11^0 -> (0 + undef90)}> 21.39/21.44 (1 + x_8^0)}> 21.39/21.44 undef109}> 21.39/21.44 (1 + y_9^0)}> 21.39/21.44 undef135, __cil_tmp2_7^0 -> undef136, __retres1_6^0 -> undef138, lt_12^0 -> undef143, lt_13^0 -> undef144, tmp_11^0 -> (0 + undef149)}> 21.39/21.44 (1 + x_8^0)}> 21.39/21.44 undef173}> 21.39/21.44 undef180, __cil_tmp2_7^0 -> undef181, __retres1_6^0 -> undef183, b_51^0 -> 2, lt_12^0 -> undef188, lt_13^0 -> undef189, tmp_11^0 -> (0 + undef194)}> 21.39/21.44 undef197, __cil_tmp2_7^0 -> undef198, __retres1_6^0 -> undef200, b_76^0 -> (1 + b_51^0), lt_12^0 -> undef205, lt_13^0 -> undef206, tmp_11^0 -> (0 + undef211)}> 21.39/21.44 undef214, __cil_tmp2_7^0 -> undef215, __retres1_6^0 -> undef217, lt_13^0 -> undef223, tmp_11^0 -> (0 + undef228)}> 21.39/21.44 undef230, __cil_tmp2_7^0 -> undef231, __retres1_6^0 -> undef233, b_128^0 -> 2, lt_12^0 -> undef238, lt_13^0 -> undef239, tmp_11^0 -> (0 + undef244)}> 21.39/21.44 21.39/21.44 21.39/21.44 Fresh variables: 21.39/21.44 undef1, undef2, undef4, undef10, undef15, undef16, undef17, undef18, undef20, undef25, undef26, undef31, undef32, undef33, undef34, undef76, undef77, undef79, undef84, undef85, undef90, undef91, undef92, undef109, undef135, undef136, undef138, undef143, undef144, undef149, undef150, undef151, undef173, undef180, undef181, undef183, undef188, undef189, undef194, undef195, undef196, undef197, undef198, undef200, undef205, undef206, undef211, undef212, undef213, undef214, undef215, undef217, undef223, undef228, undef229, undef230, undef231, undef233, undef238, undef239, undef244, undef245, undef246, 21.39/21.44 21.39/21.44 Undef variables: 21.39/21.44 undef1, undef2, undef4, undef10, undef15, undef16, undef17, undef18, undef20, undef25, undef26, undef31, undef32, undef33, undef34, undef76, undef77, undef79, undef84, undef85, undef90, undef91, undef92, undef109, undef135, undef136, undef138, undef143, undef144, undef149, undef150, undef151, undef173, undef180, undef181, undef183, undef188, undef189, undef194, undef195, undef196, undef197, undef198, undef200, undef205, undef206, undef211, undef212, undef213, undef214, undef215, undef217, undef223, undef228, undef229, undef230, undef231, undef233, undef238, undef239, undef244, undef245, undef246, 21.39/21.44 21.39/21.44 Abstraction variables: 21.39/21.44 21.39/21.44 Exit nodes: 21.39/21.44 21.39/21.44 Accepting locations: 21.39/21.44 21.39/21.44 Asserts: 21.39/21.44 21.39/21.44 Preprocessed LLVMGraph 21.39/21.44 Init Location: 0 21.39/21.44 Transitions: 21.39/21.44 21.39/21.44 undef109, tmp_11^0 -> (0 + undef90), y_9^0 -> (1 + y_9^0)}> 21.39/21.44 undef109, tmp_11^0 -> (0 + undef15), x_8^0 -> (1 + x_8^0), y_9^0 -> (1 + y_9^0)}> 21.39/21.44 (0 + undef31)}> 21.39/21.44 21.39/21.44 (0 + undef149)}> 21.39/21.44 (1 + x_8^0)}> 21.39/21.44 21.39/21.44 Fresh variables: 21.39/21.44 undef1, undef2, undef4, undef10, undef15, undef16, undef17, undef18, undef20, undef25, undef26, undef31, undef32, undef33, undef34, undef76, undef77, undef79, undef84, undef85, undef90, undef91, undef92, undef109, undef135, undef136, undef138, undef143, undef144, undef149, undef150, undef151, undef173, undef180, undef181, undef183, undef188, undef189, undef194, undef195, undef196, undef197, undef198, undef200, undef205, undef206, undef211, undef212, undef213, undef214, undef215, undef217, undef223, undef228, undef229, undef230, undef231, undef233, undef238, undef239, undef244, undef245, undef246, 21.39/21.44 21.39/21.44 Undef variables: 21.39/21.44 undef1, undef2, undef4, undef10, undef15, undef16, undef17, undef18, undef20, undef25, undef26, undef31, undef32, undef33, undef34, undef76, undef77, undef79, undef84, undef85, undef90, undef91, undef92, undef109, undef135, undef136, undef138, undef143, undef144, undef149, undef150, undef151, undef173, undef180, undef181, undef183, undef188, undef189, undef194, undef195, undef196, undef197, undef198, undef200, undef205, undef206, undef211, undef212, undef213, undef214, undef215, undef217, undef223, undef228, undef229, undef230, undef231, undef233, undef238, undef239, undef244, undef245, undef246, 21.39/21.44 21.39/21.44 Abstraction variables: 21.39/21.44 21.39/21.44 Exit nodes: 21.39/21.44 21.39/21.44 Accepting locations: 21.39/21.44 21.39/21.44 Asserts: 21.39/21.44 21.39/21.44 ************************************************************* 21.39/21.44 ******************************************************************************************* 21.39/21.44 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 21.39/21.44 ******************************************************************************************* 21.39/21.44 21.39/21.44 Init Location: 0 21.39/21.44 Graph 0: 21.39/21.44 Transitions: 21.39/21.44 Variables: 21.39/21.44 21.39/21.44 Graph 1: 21.39/21.44 Transitions: 21.39/21.44 undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 undef149, rest remain the same}> 21.39/21.44 1 + x_8^0, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 __disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0 21.39/21.44 21.39/21.44 Graph 2: 21.39/21.44 Transitions: 21.39/21.44 Variables: 21.39/21.44 21.39/21.44 Precedence: 21.39/21.44 Graph 0 21.39/21.44 21.39/21.44 Graph 1 21.39/21.44 21.39/21.44 21.39/21.44 Graph 2 21.39/21.44 21.39/21.44 21.39/21.44 Map Locations to Subgraph: 21.39/21.44 ( 0 , 0 ) 21.39/21.44 ( 3 , 1 ) 21.39/21.44 ( 4 , 1 ) 21.39/21.44 ( 5 , 2 ) 21.39/21.44 21.39/21.44 ******************************************************************************************* 21.39/21.44 ******************************** CHECKING ASSERTIONS ******************************** 21.39/21.44 ******************************************************************************************* 21.39/21.44 21.39/21.44 Proving termination of subgraph 0 21.39/21.44 Proving termination of subgraph 1 21.39/21.44 Checking unfeasibility... 21.39/21.44 Time used: 0.034873 21.39/21.44 21.39/21.44 Checking conditional termination of SCC {l3, l4}... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.008523s 21.39/21.44 Ranking function: -35 + b_128^0 - 15*y_9^0 + 15*z_10^0 21.39/21.44 New Graphs: 21.39/21.44 Transitions: 21.39/21.44 undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 undef149, rest remain the same}> 21.39/21.44 1 + x_8^0, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 __disjvr_0^0, b_128^0, tmp_11^0, x_8^0, y_9^0, z_10^0 21.39/21.44 Checking conditional termination of SCC {l3, l4}... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.004035s 21.39/21.44 Ranking function: -71 + 14*b_128^0 - y_9^0 + z_10^0 21.39/21.44 New Graphs: 21.39/21.44 Transitions: 21.39/21.44 1 + x_8^0, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 x_8^0, y_9^0, z_10^0 21.39/21.44 Transitions: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 b_128^0, tmp_11^0, y_9^0, z_10^0 21.39/21.44 Checking conditional termination of SCC {l4}... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.001068s 21.39/21.44 Ranking function: -1 - x_8^0 + y_9^0 21.39/21.44 New Graphs: 21.39/21.44 Transitions: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 b_128^0, tmp_11^0, y_9^0, z_10^0 21.39/21.44 Checking conditional termination of SCC {l3}... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.000937s 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.004026s 21.39/21.44 Trying to remove transition: undef31, rest remain the same}> 21.39/21.44 Solving with 1 template(s). 21.39/21.44 21.39/21.44 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.44 21.39/21.44 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007829s 21.39/21.44 Time used: 0.007487 21.39/21.44 Solving with 1 template(s). 21.39/21.44 21.39/21.44 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.44 21.39/21.44 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.059545s 21.39/21.44 Time used: 0.058653 21.39/21.44 Improving Solution with cost 1 ... 21.39/21.44 21.39/21.44 LOG: CALL solveNonLinearGetNextSolution 21.39/21.44 21.39/21.44 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.091644s 21.39/21.44 Time used: 0.091639 21.39/21.44 21.39/21.44 LOG: SAT solveNonLinear - Elapsed time: 0.151189s 21.39/21.44 Cost: 1; Total time: 0.150292 21.39/21.44 Failed at location 4: 1 + z_10^0 <= x_8^0 21.39/21.44 Before Improving: 21.39/21.44 Quasi-invariant at l3: 1 + tmp_11^0 <= 0 21.39/21.44 Quasi-invariant at l4: 1 + z_10^0 <= x_8^0 21.39/21.44 Optimizing invariants... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.014302s 21.39/21.44 Remaining time after improvement: 0.994722 21.39/21.44 Termination implied by a set of quasi-invariant(s): 21.39/21.44 Quasi-invariant at l3: 1 + tmp_11^0 <= 0 21.39/21.44 Quasi-invariant at l4: 1 + z_10^0 <= x_8^0 21.39/21.44 [ Invariant Graph ] 21.39/21.44 Strengthening and disabling transitions... 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef149, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 Strengthening transition (result): 21.39/21.44 1 + x_8^0, rest remain the same}> 21.39/21.44 [ Termination Graph ] 21.39/21.44 Strengthening and disabling transitions... 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 New Graphs: 21.39/21.44 Calling Safety with literal 1 + z_10^0 <= x_8^0 and entry 21.39/21.44 21.39/21.44 LOG: CALL check - Post:1 + z_10^0 <= x_8^0 - Process 1 21.39/21.44 * Exit transition: 21.39/21.44 * Postcondition : 1 + z_10^0 <= x_8^0 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.000625s 21.39/21.44 > Postcondition is not implied! 21.39/21.44 21.39/21.44 LOG: RETURN check - Elapsed time: 0.000698s 21.39/21.44 INVARIANTS: 21.39/21.44 3: 21.39/21.44 4: 21.39/21.44 Quasi-INVARIANTS to narrow Graph: 21.39/21.44 3: 1 + tmp_11^0 <= 0 , 21.39/21.44 4: 1 + z_10^0 <= x_8^0 , 21.39/21.44 Narrowing transition: 21.39/21.44 undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 Narrowing transition: 21.39/21.44 undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 Narrowing transition: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 Narrowing transition: 21.39/21.44 undef149, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 Narrowing transition: 21.39/21.44 1 + x_8^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 invGraph after Narrowing: 21.39/21.44 Transitions: 21.39/21.44 undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 undef149, rest remain the same}> 21.39/21.44 1 + x_8^0, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 __disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0 21.39/21.44 Checking conditional termination of SCC {l3, l4}... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.006578s 21.39/21.44 Ranking function: -73 + 14*b_128^0 - 3*y_9^0 + 3*z_10^0 21.39/21.44 New Graphs: 21.39/21.44 Transitions: 21.39/21.44 1 + x_8^0, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 x_8^0, y_9^0, z_10^0 21.39/21.44 Transitions: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 b_128^0, tmp_11^0, y_9^0, z_10^0 21.39/21.44 Checking conditional termination of SCC {l4}... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.001204s 21.39/21.44 Ranking function: -x_8^0 + z_10^0 21.39/21.44 New Graphs: 21.39/21.44 Transitions: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 b_128^0, tmp_11^0, y_9^0, z_10^0 21.39/21.44 Checking conditional termination of SCC {l3}... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.000949s 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.004042s 21.39/21.44 Trying to remove transition: undef31, rest remain the same}> 21.39/21.44 Solving with 1 template(s). 21.39/21.44 21.39/21.44 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.44 21.39/21.44 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007993s 21.39/21.44 Time used: 0.007649 21.39/21.44 Solving with 1 template(s). 21.39/21.44 21.39/21.44 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.44 21.39/21.44 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.045579s 21.39/21.44 Time used: 0.044532 21.39/21.44 Improving Solution with cost 1 ... 21.39/21.44 21.39/21.44 LOG: CALL solveNonLinearGetNextSolution 21.39/21.44 21.39/21.44 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.067731s 21.39/21.44 Time used: 0.067726 21.39/21.44 21.39/21.44 LOG: SAT solveNonLinear - Elapsed time: 0.113310s 21.39/21.44 Cost: 1; Total time: 0.112258 21.39/21.44 Failed at location 4: 1 + y_9^0 <= x_8^0 21.39/21.44 Before Improving: 21.39/21.44 Quasi-invariant at l3: 1 <= tmp_11^0 21.39/21.44 Quasi-invariant at l4: 1 + y_9^0 <= x_8^0 21.39/21.44 Optimizing invariants... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.014362s 21.39/21.44 Remaining time after improvement: 0.994532 21.39/21.44 Termination implied by a set of quasi-invariant(s): 21.39/21.44 Quasi-invariant at l3: 1 <= tmp_11^0 21.39/21.44 Quasi-invariant at l4: 1 + y_9^0 <= x_8^0 21.39/21.44 [ Invariant Graph ] 21.39/21.44 Strengthening and disabling transitions... 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef149, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 1 + x_8^0, rest remain the same}> 21.39/21.44 [ Termination Graph ] 21.39/21.44 Strengthening and disabling transitions... 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 New Graphs: 21.39/21.44 Calling Safety with literal 1 + y_9^0 <= x_8^0 and entry 21.39/21.44 21.39/21.44 LOG: CALL check - Post:1 + y_9^0 <= x_8^0 - Process 2 21.39/21.44 * Exit transition: 21.39/21.44 * Postcondition : 1 + y_9^0 <= x_8^0 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.001021s 21.39/21.44 > Postcondition is not implied! 21.39/21.44 21.39/21.44 LOG: RETURN check - Elapsed time: 0.001110s 21.39/21.44 INVARIANTS: 21.39/21.44 3: 21.39/21.44 4: 21.39/21.44 Quasi-INVARIANTS to narrow Graph: 21.39/21.44 3: 1 <= tmp_11^0 , 21.39/21.44 4: 1 + y_9^0 <= x_8^0 , 21.39/21.44 Narrowing transition: 21.39/21.44 undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 Narrowing transition: 21.39/21.44 undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 Narrowing transition: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 Narrowing transition: 21.39/21.44 undef149, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 Narrowing transition: 21.39/21.44 1 + x_8^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 invGraph after Narrowing: 21.39/21.44 Transitions: 21.39/21.44 undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 undef149, rest remain the same}> 21.39/21.44 1 + x_8^0, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 __disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0 21.39/21.44 Checking conditional termination of SCC {l3, l4}... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.006653s 21.39/21.44 Ranking function: -73 + 14*b_128^0 - 3*y_9^0 + 3*z_10^0 21.39/21.44 New Graphs: 21.39/21.44 Transitions: 21.39/21.44 1 + x_8^0, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 x_8^0, y_9^0, z_10^0 21.39/21.44 Transitions: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 b_128^0, tmp_11^0, y_9^0, z_10^0 21.39/21.44 Checking conditional termination of SCC {l4}... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.001249s 21.39/21.44 Ranking function: -x_8^0 + z_10^0 21.39/21.44 New Graphs: 21.39/21.44 Transitions: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 b_128^0, tmp_11^0, y_9^0, z_10^0 21.39/21.44 Checking conditional termination of SCC {l3}... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.000960s 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.004157s 21.39/21.44 Trying to remove transition: undef31, rest remain the same}> 21.39/21.44 Solving with 1 template(s). 21.39/21.44 21.39/21.44 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.44 21.39/21.44 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008253s 21.39/21.44 Time used: 0.007818 21.39/21.44 Solving with 1 template(s). 21.39/21.44 21.39/21.44 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.44 21.39/21.44 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.052089s 21.39/21.44 Time used: 0.050941 21.39/21.44 Improving Solution with cost 1 ... 21.39/21.44 21.39/21.44 LOG: CALL solveNonLinearGetNextSolution 21.39/21.44 21.39/21.44 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.082596s 21.39/21.44 Time used: 0.082591 21.39/21.44 21.39/21.44 LOG: SAT solveNonLinear - Elapsed time: 0.134685s 21.39/21.44 Cost: 1; Total time: 0.133532 21.39/21.44 Failed at location 4: y_9^0 <= x_8^0 21.39/21.44 Before Improving: 21.39/21.44 Quasi-invariant at l3: 1 + tmp_11^0 <= 0 21.39/21.44 Quasi-invariant at l4: y_9^0 <= x_8^0 21.39/21.44 Optimizing invariants... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.013971s 21.39/21.44 Remaining time after improvement: 0.994983 21.39/21.44 Termination implied by a set of quasi-invariant(s): 21.39/21.44 Quasi-invariant at l3: 1 + tmp_11^0 <= 0 21.39/21.44 Quasi-invariant at l4: y_9^0 <= x_8^0 21.39/21.44 [ Invariant Graph ] 21.39/21.44 Strengthening and disabling transitions... 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef149, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 1 + x_8^0, rest remain the same}> 21.39/21.44 [ Termination Graph ] 21.39/21.44 Strengthening and disabling transitions... 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 New Graphs: 21.39/21.44 Calling Safety with literal y_9^0 <= x_8^0 and entry 21.39/21.44 21.39/21.44 LOG: CALL check - Post:y_9^0 <= x_8^0 - Process 3 21.39/21.44 * Exit transition: 21.39/21.44 * Postcondition : y_9^0 <= x_8^0 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.001086s 21.39/21.44 > Postcondition is not implied! 21.39/21.44 21.39/21.44 LOG: RETURN check - Elapsed time: 0.001175s 21.39/21.44 INVARIANTS: 21.39/21.44 3: 21.39/21.44 4: 21.39/21.44 Quasi-INVARIANTS to narrow Graph: 21.39/21.44 3: 1 + tmp_11^0 <= 0 , 21.39/21.44 4: y_9^0 <= x_8^0 , 21.39/21.44 Narrowing transition: 21.39/21.44 undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 Narrowing transition: 21.39/21.44 undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 Narrowing transition: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 Narrowing transition: 21.39/21.44 undef149, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 Narrowing transition: 21.39/21.44 1 + x_8^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 invGraph after Narrowing: 21.39/21.44 Transitions: 21.39/21.44 undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 undef149, rest remain the same}> 21.39/21.44 1 + x_8^0, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 __disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0 21.39/21.44 Checking conditional termination of SCC {l3, l4}... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.006666s 21.39/21.44 Ranking function: -73 + 14*b_128^0 - 3*y_9^0 + 3*z_10^0 21.39/21.44 New Graphs: 21.39/21.44 Transitions: 21.39/21.44 1 + x_8^0, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 x_8^0, y_9^0, z_10^0 21.39/21.44 Transitions: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 b_128^0, tmp_11^0, y_9^0, z_10^0 21.39/21.44 Checking conditional termination of SCC {l4}... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.001261s 21.39/21.44 Ranking function: -x_8^0 + z_10^0 21.39/21.44 New Graphs: 21.39/21.44 Transitions: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 b_128^0, tmp_11^0, y_9^0, z_10^0 21.39/21.44 Checking conditional termination of SCC {l3}... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.000966s 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.004104s 21.39/21.44 Trying to remove transition: undef31, rest remain the same}> 21.39/21.44 Solving with 1 template(s). 21.39/21.44 21.39/21.44 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.44 21.39/21.44 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008216s 21.39/21.44 Time used: 0.007952 21.39/21.44 Solving with 1 template(s). 21.39/21.44 21.39/21.44 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.44 21.39/21.44 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.058695s 21.39/21.44 Time used: 0.057538 21.39/21.44 Improving Solution with cost 1 ... 21.39/21.44 21.39/21.44 LOG: CALL solveNonLinearGetNextSolution 21.39/21.44 21.39/21.44 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.115871s 21.39/21.44 Time used: 0.115866 21.39/21.44 21.39/21.44 LOG: SAT solveNonLinear - Elapsed time: 0.174566s 21.39/21.44 Cost: 1; Total time: 0.173404 21.39/21.44 Failed at location 4: z_10^0 <= x_8^0 21.39/21.44 Before Improving: 21.39/21.44 Quasi-invariant at l3: 1 <= tmp_11^0 21.39/21.44 Quasi-invariant at l4: z_10^0 <= x_8^0 21.39/21.44 Optimizing invariants... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.015988s 21.39/21.44 Quasi-invariant improved 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.005638s 21.39/21.44 Remaining time after improvement: 0.987826 21.39/21.44 Termination implied by a set of quasi-invariant(s): 21.39/21.44 Quasi-invariant at l3: 1 <= tmp_11^0 21.39/21.44 Quasi-invariant at l4: z_10^0 <= 1 + x_8^0 21.39/21.44 [ Invariant Graph ] 21.39/21.44 Strengthening and disabling transitions... 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef149, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 Strengthening transition (result): 21.39/21.44 1 + x_8^0, rest remain the same}> 21.39/21.44 [ Termination Graph ] 21.39/21.44 Strengthening and disabling transitions... 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 New Graphs: 21.39/21.44 Calling Safety with literal z_10^0 <= 1 + x_8^0 and entry 21.39/21.44 21.39/21.44 LOG: CALL check - Post:z_10^0 <= 1 + x_8^0 - Process 4 21.39/21.44 * Exit transition: 21.39/21.44 * Postcondition : z_10^0 <= 1 + x_8^0 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.000796s 21.39/21.44 > Postcondition is not implied! 21.39/21.44 21.39/21.44 LOG: RETURN check - Elapsed time: 0.000895s 21.39/21.44 INVARIANTS: 21.39/21.44 3: 21.39/21.44 4: 21.39/21.44 Quasi-INVARIANTS to narrow Graph: 21.39/21.44 3: 1 <= tmp_11^0 , 21.39/21.44 4: z_10^0 <= 1 + x_8^0 , 21.39/21.44 Narrowing transition: 21.39/21.44 undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 Narrowing transition: 21.39/21.44 undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 Narrowing transition: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 Narrowing transition: 21.39/21.44 undef149, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 Narrowing transition: 21.39/21.44 1 + x_8^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 invGraph after Narrowing: 21.39/21.44 Transitions: 21.39/21.44 undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 undef149, rest remain the same}> 21.39/21.44 1 + x_8^0, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 __disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0 21.39/21.44 Checking conditional termination of SCC {l3, l4}... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.006775s 21.39/21.44 Ranking function: -71 + 14*b_128^0 - y_9^0 + z_10^0 21.39/21.44 New Graphs: 21.39/21.44 Transitions: 21.39/21.44 1 + x_8^0, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 x_8^0, y_9^0, z_10^0 21.39/21.44 Transitions: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 b_128^0, tmp_11^0, y_9^0, z_10^0 21.39/21.44 Checking conditional termination of SCC {l4}... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.001269s 21.39/21.44 Ranking function: -1 - x_8^0 + y_9^0 21.39/21.44 New Graphs: 21.39/21.44 Transitions: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 b_128^0, tmp_11^0, y_9^0, z_10^0 21.39/21.44 Checking conditional termination of SCC {l3}... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.000960s 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.004102s 21.39/21.44 Trying to remove transition: undef31, rest remain the same}> 21.39/21.44 Solving with 1 template(s). 21.39/21.44 21.39/21.44 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.44 21.39/21.44 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008230s 21.39/21.44 Time used: 0.007963 21.39/21.44 Solving with 1 template(s). 21.39/21.44 21.39/21.44 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.44 21.39/21.44 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.052161s 21.39/21.44 Time used: 0.051001 21.39/21.44 Improving Solution with cost 1 ... 21.39/21.44 21.39/21.44 LOG: CALL solveNonLinearGetNextSolution 21.39/21.44 21.39/21.44 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.104456s 21.39/21.44 Time used: 0.104452 21.39/21.44 21.39/21.44 LOG: SAT solveNonLinear - Elapsed time: 0.156617s 21.39/21.44 Cost: 1; Total time: 0.155453 21.39/21.44 Failed at location 4: 1 + z_10^0 <= y_9^0 21.39/21.44 Before Improving: 21.39/21.44 Quasi-invariant at l3: z_10^0 <= y_9^0 21.39/21.44 Quasi-invariant at l4: 1 + z_10^0 <= y_9^0 21.39/21.44 Optimizing invariants... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.014148s 21.39/21.44 Remaining time after improvement: 0.994505 21.39/21.44 Termination implied by a set of quasi-invariant(s): 21.39/21.44 Quasi-invariant at l3: z_10^0 <= y_9^0 21.39/21.44 Quasi-invariant at l4: 1 + z_10^0 <= y_9^0 21.39/21.44 [ Invariant Graph ] 21.39/21.44 Strengthening and disabling transitions... 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef149, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 Strengthening transition (result): 21.39/21.44 1 + x_8^0, rest remain the same}> 21.39/21.44 [ Termination Graph ] 21.39/21.44 Strengthening and disabling transitions... 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 New Graphs: 21.39/21.44 Calling Safety with literal 1 + z_10^0 <= y_9^0 and entry 21.39/21.44 21.39/21.44 LOG: CALL check - Post:1 + z_10^0 <= y_9^0 - Process 5 21.39/21.44 * Exit transition: 21.39/21.44 * Postcondition : 1 + z_10^0 <= y_9^0 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.000839s 21.39/21.44 > Postcondition is not implied! 21.39/21.44 21.39/21.44 LOG: RETURN check - Elapsed time: 0.000929s 21.39/21.44 INVARIANTS: 21.39/21.44 3: 21.39/21.44 4: 21.39/21.44 Quasi-INVARIANTS to narrow Graph: 21.39/21.44 3: z_10^0 <= y_9^0 , 21.39/21.44 4: 1 + z_10^0 <= y_9^0 , 21.39/21.44 Narrowing transition: 21.39/21.44 undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 Narrowing transition: 21.39/21.44 undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 Narrowing transition: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 Narrowing transition: 21.39/21.44 undef149, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 Narrowing transition: 21.39/21.44 1 + x_8^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 invGraph after Narrowing: 21.39/21.44 Transitions: 21.39/21.44 undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 undef149, rest remain the same}> 21.39/21.44 1 + x_8^0, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 __disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0 21.39/21.44 Checking conditional termination of SCC {l3, l4}... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.006738s 21.39/21.44 Ranking function: -35 + b_128^0 - 15*y_9^0 + 15*z_10^0 21.39/21.44 New Graphs: 21.39/21.44 Transitions: 21.39/21.44 undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 undef149, rest remain the same}> 21.39/21.44 1 + x_8^0, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 __disjvr_0^0, b_128^0, tmp_11^0, x_8^0, y_9^0, z_10^0 21.39/21.44 Checking conditional termination of SCC {l3, l4}... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.004578s 21.39/21.44 Ranking function: -5 + b_128^0 - y_9^0 + z_10^0 21.39/21.44 New Graphs: 21.39/21.44 Transitions: 21.39/21.44 1 + x_8^0, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 x_8^0, y_9^0, z_10^0 21.39/21.44 Transitions: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 b_128^0, tmp_11^0, y_9^0, z_10^0 21.39/21.44 Checking conditional termination of SCC {l4}... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.001293s 21.39/21.44 Ranking function: -1 - x_8^0 + y_9^0 21.39/21.44 New Graphs: 21.39/21.44 Transitions: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 b_128^0, tmp_11^0, y_9^0, z_10^0 21.39/21.44 Checking conditional termination of SCC {l3}... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.000967s 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.004165s 21.39/21.44 Trying to remove transition: undef31, rest remain the same}> 21.39/21.44 Solving with 1 template(s). 21.39/21.44 21.39/21.44 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.44 21.39/21.44 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008264s 21.39/21.44 Time used: 0.007997 21.39/21.44 Solving with 1 template(s). 21.39/21.44 21.39/21.44 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.44 21.39/21.44 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.066845s 21.39/21.44 Time used: 0.065709 21.39/21.44 Improving Solution with cost 1 ... 21.39/21.44 21.39/21.44 LOG: CALL solveNonLinearGetNextSolution 21.39/21.44 21.39/21.44 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.072234s 21.39/21.44 Time used: 0.072228 21.39/21.44 21.39/21.44 LOG: SAT solveNonLinear - Elapsed time: 0.139079s 21.39/21.44 Cost: 1; Total time: 0.137937 21.39/21.44 Failed at location 4: z_10^0 <= y_9^0 21.39/21.44 Before Improving: 21.39/21.44 Quasi-invariant at l3: 1 <= 0 21.39/21.44 Quasi-invariant at l4: z_10^0 <= y_9^0 21.39/21.44 Optimizing invariants... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.015606s 21.39/21.44 Remaining time after improvement: 0.993455 21.39/21.44 Termination implied by a set of quasi-invariant(s): 21.39/21.44 Quasi-invariant at l3: 1 <= 0 21.39/21.44 Quasi-invariant at l4: z_10^0 <= y_9^0 21.39/21.44 [ Invariant Graph ] 21.39/21.44 Strengthening and disabling transitions... 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef149, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 Strengthening transition (result): 21.39/21.44 1 + x_8^0, rest remain the same}> 21.39/21.44 [ Termination Graph ] 21.39/21.44 Strengthening and disabling transitions... 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 New Graphs: 21.39/21.44 Calling Safety with literal z_10^0 <= y_9^0 and entry 21.39/21.44 21.39/21.44 LOG: CALL check - Post:z_10^0 <= y_9^0 - Process 6 21.39/21.44 * Exit transition: 21.39/21.44 * Postcondition : z_10^0 <= y_9^0 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.000903s 21.39/21.44 > Postcondition is not implied! 21.39/21.44 21.39/21.44 LOG: RETURN check - Elapsed time: 0.001004s 21.39/21.44 INVARIANTS: 21.39/21.44 3: 21.39/21.44 4: 21.39/21.44 Quasi-INVARIANTS to narrow Graph: 21.39/21.44 3: 1 <= 0 , 21.39/21.44 4: z_10^0 <= y_9^0 , 21.39/21.44 Narrowing transition: 21.39/21.44 undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 Narrowing transition: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 Narrowing transition: 21.39/21.44 undef149, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 1 + x_8^0, rest remain the same}> 21.39/21.44 invGraph after Narrowing: 21.39/21.44 Transitions: 21.39/21.44 undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 undef149, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 __disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0 21.39/21.44 Checking conditional termination of SCC {l3}... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.003466s 21.39/21.44 Ranking function: -1 - y_9^0 + z_10^0 21.39/21.44 New Graphs: 21.39/21.44 Transitions: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 b_128^0, tmp_11^0, y_9^0, z_10^0 21.39/21.44 Checking conditional termination of SCC {l3}... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.001021s 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.004356s 21.39/21.44 Trying to remove transition: undef31, rest remain the same}> 21.39/21.44 Solving with 1 template(s). 21.39/21.44 21.39/21.44 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.44 21.39/21.44 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008393s 21.39/21.44 Time used: 0.008113 21.39/21.44 Solving with 1 template(s). 21.39/21.44 21.39/21.44 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.44 21.39/21.44 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.292311s 21.39/21.44 Time used: 0.29127 21.39/21.44 Improving Solution with cost 1 ... 21.39/21.44 21.39/21.44 LOG: CALL solveNonLinearGetNextSolution 21.39/21.44 21.39/21.44 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.062283s 21.39/21.44 Time used: 0.062278 21.39/21.44 21.39/21.44 LOG: SAT solveNonLinear - Elapsed time: 0.354594s 21.39/21.44 Cost: 1; Total time: 0.353548 21.39/21.44 Failed at location 4: 3 + z_10^0 <= b_128^0 + x_8^0 21.39/21.44 Before Improving: 21.39/21.44 Quasi-invariant at l3: 4 + tmp_11^0 + z_10^0 <= b_128^0 + y_9^0 21.39/21.44 Quasi-invariant at l4: 3 + z_10^0 <= b_128^0 + x_8^0 21.39/21.44 Optimizing invariants... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.010793s 21.39/21.44 Remaining time after improvement: 0.994903 21.39/21.44 Termination implied by a set of quasi-invariant(s): 21.39/21.44 Quasi-invariant at l3: 4 + tmp_11^0 + z_10^0 <= b_128^0 + y_9^0 21.39/21.44 Quasi-invariant at l4: 3 + z_10^0 <= b_128^0 + x_8^0 21.39/21.44 [ Invariant Graph ] 21.39/21.44 Strengthening and disabling transitions... 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 Strengthening transition (result): 21.39/21.44 undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 Strengthening transition (result): 21.39/21.44 undef149, rest remain the same}> 21.39/21.44 [ Termination Graph ] 21.39/21.44 Strengthening and disabling transitions... 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 New Graphs: 21.39/21.44 Calling Safety with literal 3 + z_10^0 <= b_128^0 + x_8^0 and entry 21.39/21.44 21.39/21.44 LOG: CALL check - Post:3 + z_10^0 <= b_128^0 + x_8^0 - Process 7 21.39/21.44 * Exit transition: 21.39/21.44 * Postcondition : 3 + z_10^0 <= b_128^0 + x_8^0 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.001043s 21.39/21.44 > Postcondition is not implied! 21.39/21.44 21.39/21.44 LOG: RETURN check - Elapsed time: 0.001150s 21.39/21.44 INVARIANTS: 21.39/21.44 3: 21.39/21.44 4: 21.39/21.44 Quasi-INVARIANTS to narrow Graph: 21.39/21.44 3: 4 + tmp_11^0 + z_10^0 <= b_128^0 + y_9^0 , 21.39/21.44 4: 3 + z_10^0 <= b_128^0 + x_8^0 , 21.39/21.44 Narrowing transition: 21.39/21.44 undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 Narrowing transition: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 Narrowing transition: 21.39/21.44 undef149, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 invGraph after Narrowing: 21.39/21.44 Transitions: 21.39/21.44 undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 undef149, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 __disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0 21.39/21.44 Checking conditional termination of SCC {l3, l4}... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.005232s 21.39/21.44 Ranking function: -67 + 13*b_128^0 - y_9^0 + z_10^0 21.39/21.44 New Graphs: 21.39/21.44 Transitions: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 b_128^0, tmp_11^0, y_9^0, z_10^0 21.39/21.44 Checking conditional termination of SCC {l3}... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.001161s 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.005498s 21.39/21.44 Trying to remove transition: undef31, rest remain the same}> 21.39/21.44 Solving with 1 template(s). 21.39/21.44 21.39/21.44 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.44 21.39/21.44 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009383s 21.39/21.44 Time used: 0.008851 21.39/21.44 Solving with 1 template(s). 21.39/21.44 21.39/21.44 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.44 21.39/21.44 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.458746s 21.39/21.44 Time used: 0.457728 21.39/21.44 Improving Solution with cost 1 ... 21.39/21.44 21.39/21.44 LOG: CALL solveNonLinearGetNextSolution 21.39/21.44 21.39/21.44 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.076140s 21.39/21.44 Time used: 0.076129 21.39/21.44 21.39/21.44 LOG: SAT solveNonLinear - Elapsed time: 0.534886s 21.39/21.44 Cost: 1; Total time: 0.533857 21.39/21.44 Failed at location 4: 4 + z_10^0 <= b_128^0 + y_9^0 21.39/21.44 Before Improving: 21.39/21.44 Quasi-invariant at l3: 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 21.39/21.44 Quasi-invariant at l4: 4 + z_10^0 <= b_128^0 + y_9^0 21.39/21.44 Optimizing invariants... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.011047s 21.39/21.44 Remaining time after improvement: 0.99513 21.39/21.44 Termination implied by a set of quasi-invariant(s): 21.39/21.44 Quasi-invariant at l3: 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 21.39/21.44 Quasi-invariant at l4: 4 + z_10^0 <= b_128^0 + y_9^0 21.39/21.44 [ Invariant Graph ] 21.39/21.44 Strengthening and disabling transitions... 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 It's unfeasible. Removing transition: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.44 Strengthening transition (result): 21.39/21.44 undef149, rest remain the same}> 21.39/21.44 [ Termination Graph ] 21.39/21.44 Strengthening and disabling transitions... 21.39/21.44 > It's unfeasible. Removing transition: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 New Graphs: 21.39/21.44 Calling Safety with literal 4 + z_10^0 <= b_128^0 + y_9^0 and entry 21.39/21.44 21.39/21.44 LOG: CALL check - Post:4 + z_10^0 <= b_128^0 + y_9^0 - Process 8 21.39/21.44 * Exit transition: 21.39/21.44 * Postcondition : 4 + z_10^0 <= b_128^0 + y_9^0 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.001383s 21.39/21.44 > Postcondition is not implied! 21.39/21.44 21.39/21.44 LOG: RETURN check - Elapsed time: 0.001503s 21.39/21.44 INVARIANTS: 21.39/21.44 3: 21.39/21.44 4: 21.39/21.44 Quasi-INVARIANTS to narrow Graph: 21.39/21.44 3: 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 , 21.39/21.44 4: 4 + z_10^0 <= b_128^0 + y_9^0 , 21.39/21.44 Narrowing transition: 21.39/21.44 undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 Narrowing transition: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 Narrowing transition: 21.39/21.44 undef149, rest remain the same}> 21.39/21.44 21.39/21.44 LOG: Narrow transition size 1 21.39/21.44 invGraph after Narrowing: 21.39/21.44 Transitions: 21.39/21.44 undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 undef149, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 __disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0 21.39/21.44 Checking conditional termination of SCC {l3, l4}... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.005641s 21.39/21.44 Ranking function: -19 + b_128^0 - 7*y_9^0 + 7*z_10^0 21.39/21.44 New Graphs: 21.39/21.44 Transitions: 21.39/21.44 undef31, rest remain the same}> 21.39/21.44 Variables: 21.39/21.44 b_128^0, tmp_11^0, y_9^0, z_10^0 21.39/21.44 Checking conditional termination of SCC {l3}... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.001280s 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.006240s 21.39/21.44 Trying to remove transition: undef31, rest remain the same}> 21.39/21.44 Solving with 1 template(s). 21.39/21.44 21.39/21.44 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.44 21.39/21.44 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009541s 21.39/21.44 Time used: 0.009066 21.39/21.44 Solving with 1 template(s). 21.39/21.44 21.39/21.44 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.44 21.39/21.44 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.517947s 21.39/21.44 Time used: 0.516755 21.39/21.44 Improving Solution with cost 1 ... 21.39/21.44 21.39/21.44 LOG: CALL solveNonLinearGetNextSolution 21.39/21.44 21.39/21.44 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.063211s 21.39/21.44 Time used: 0.063204 21.39/21.44 21.39/21.44 LOG: SAT solveNonLinear - Elapsed time: 0.581158s 21.39/21.44 Cost: 1; Total time: 0.579959 21.39/21.44 Failed at location 4: 4 + y_9^0 <= b_128^0 + x_8^0 21.39/21.44 Before Improving: 21.39/21.44 Quasi-invariant at l3: 5 <= b_128^0 + tmp_11^0 21.39/21.44 Quasi-invariant at l4: 4 + y_9^0 <= b_128^0 + x_8^0 21.39/21.44 Optimizing invariants... 21.39/21.44 21.39/21.44 LOG: CALL solveLinear 21.39/21.44 21.39/21.44 LOG: RETURN solveLinear - Elapsed time: 0.013060s 21.39/21.44 Remaining time after improvement: 0.993326 21.39/21.44 Termination implied by a set of quasi-invariant(s): 21.39/21.44 Quasi-invariant at l3: 5 <= b_128^0 + tmp_11^0 21.39/21.44 Quasi-invariant at l4: 4 + y_9^0 <= b_128^0 + x_8^0 21.39/21.44 [ Invariant Graph ] 21.39/21.44 Strengthening and disabling transitions... 21.39/21.44 21.39/21.44 LOG: CALL solverLinear in Graph for feasibility 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.45 Strengthening transition (result): 21.39/21.45 undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.45 21.39/21.45 LOG: CALL solverLinear in Graph for feasibility 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.45 It's unfeasible. Removing transition: 21.39/21.45 undef31, rest remain the same}> 21.39/21.45 21.39/21.45 LOG: CALL solverLinear in Graph for feasibility 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.45 Strengthening transition (result): 21.39/21.45 undef149, rest remain the same}> 21.39/21.45 [ Termination Graph ] 21.39/21.45 Strengthening and disabling transitions... 21.39/21.45 21.39/21.45 LOG: CALL solverLinear in Graph for feasibility 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.45 It's unfeasible. Removing transition: 21.39/21.45 undef31, rest remain the same}> 21.39/21.45 New Graphs: 21.39/21.45 Calling Safety with literal 4 + y_9^0 <= b_128^0 + x_8^0 and entry 21.39/21.45 21.39/21.45 LOG: CALL check - Post:4 + y_9^0 <= b_128^0 + x_8^0 - Process 9 21.39/21.45 * Exit transition: 21.39/21.45 * Postcondition : 4 + y_9^0 <= b_128^0 + x_8^0 21.39/21.45 21.39/21.45 LOG: CALL solveLinear 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear - Elapsed time: 0.001265s 21.39/21.45 > Postcondition is not implied! 21.39/21.45 21.39/21.45 LOG: RETURN check - Elapsed time: 0.001397s 21.39/21.45 INVARIANTS: 21.39/21.45 3: 21.39/21.45 4: 21.39/21.45 Quasi-INVARIANTS to narrow Graph: 21.39/21.45 3: 5 <= b_128^0 + tmp_11^0 , 21.39/21.45 4: 4 + y_9^0 <= b_128^0 + x_8^0 , 21.39/21.45 It's unfeasible. Removing transition: 21.39/21.45 undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}> 21.39/21.45 Narrowing transition: 21.39/21.45 undef31, rest remain the same}> 21.39/21.45 21.39/21.45 LOG: Narrow transition size 1 21.39/21.45 Narrowing transition: 21.39/21.45 undef149, rest remain the same}> 21.39/21.45 21.39/21.45 LOG: Narrow transition size 1 21.39/21.45 invGraph after Narrowing: 21.39/21.45 Transitions: 21.39/21.45 undef31, rest remain the same}> 21.39/21.45 undef149, rest remain the same}> 21.39/21.45 Variables: 21.39/21.45 __disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0 21.39/21.45 Checking conditional termination of SCC {l3}... 21.39/21.45 21.39/21.45 LOG: CALL solveLinear 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear - Elapsed time: 0.001392s 21.39/21.45 21.39/21.45 LOG: CALL solveLinear 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear - Elapsed time: 0.007140s 21.39/21.45 Trying to remove transition: undef31, rest remain the same}> 21.39/21.45 Solving with 1 template(s). 21.39/21.45 21.39/21.45 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.45 21.39/21.45 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010351s 21.39/21.45 Time used: 0.009838 21.39/21.45 Solving with 1 template(s). 21.39/21.45 21.39/21.45 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.45 21.39/21.45 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.542148s 21.39/21.45 Time used: 0.540934 21.39/21.45 Improving Solution with cost 1 ... 21.39/21.45 21.39/21.45 LOG: CALL solveNonLinearGetNextSolution 21.39/21.45 21.39/21.45 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.072568s 21.39/21.45 Time used: 0.072563 21.39/21.45 21.39/21.45 LOG: SAT solveNonLinear - Elapsed time: 0.614716s 21.39/21.45 Cost: 1; Total time: 0.613497 21.39/21.45 Failed at location 4: 5 <= b_128^0 21.39/21.45 Before Improving: 21.39/21.45 Quasi-invariant at l3: 5 <= b_128^0 21.39/21.45 Quasi-invariant at l4: 5 <= b_128^0 21.39/21.45 Optimizing invariants... 21.39/21.45 21.39/21.45 LOG: CALL solveLinear 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear - Elapsed time: 0.009658s 21.39/21.45 Remaining time after improvement: 0.995516 21.39/21.45 Termination implied by a set of quasi-invariant(s): 21.39/21.45 Quasi-invariant at l3: 5 <= b_128^0 21.39/21.45 Quasi-invariant at l4: 5 <= b_128^0 21.39/21.45 [ Invariant Graph ] 21.39/21.45 Strengthening and disabling transitions... 21.39/21.45 21.39/21.45 LOG: CALL solverLinear in Graph for feasibility 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.45 It's unfeasible. Removing transition: 21.39/21.45 undef31, rest remain the same}> 21.39/21.45 21.39/21.45 LOG: CALL solverLinear in Graph for feasibility 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.45 Strengthening transition (result): 21.39/21.45 undef149, rest remain the same}> 21.39/21.45 [ Termination Graph ] 21.39/21.45 Strengthening and disabling transitions... 21.39/21.45 21.39/21.45 LOG: CALL solverLinear in Graph for feasibility 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.45 It's unfeasible. Removing transition: 21.39/21.45 undef31, rest remain the same}> 21.39/21.45 New Graphs: 21.39/21.45 Calling Safety with literal 5 <= b_128^0 and entry 21.39/21.45 21.39/21.45 LOG: CALL check - Post:5 <= b_128^0 - Process 10 21.39/21.45 * Exit transition: 21.39/21.45 * Postcondition : 5 <= b_128^0 21.39/21.45 21.39/21.45 LOG: CALL solveLinear 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear - Elapsed time: 0.001353s 21.39/21.45 > Postcondition is not implied! 21.39/21.45 21.39/21.45 LOG: RETURN check - Elapsed time: 0.001480s 21.39/21.45 INVARIANTS: 21.39/21.45 3: 21.39/21.45 4: 21.39/21.45 Quasi-INVARIANTS to narrow Graph: 21.39/21.45 3: 5 <= b_128^0 , 21.39/21.45 4: 5 <= b_128^0 , 21.39/21.45 Narrowing transition: 21.39/21.45 undef31, rest remain the same}> 21.39/21.45 21.39/21.45 LOG: Narrow transition size 1 21.39/21.45 Narrowing transition: 21.39/21.45 undef149, rest remain the same}> 21.39/21.45 21.39/21.45 LOG: Narrow transition size 1 21.39/21.45 invGraph after Narrowing: 21.39/21.45 Transitions: 21.39/21.45 undef31, rest remain the same}> 21.39/21.45 undef149, rest remain the same}> 21.39/21.45 Variables: 21.39/21.45 __disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0 21.39/21.45 Checking conditional termination of SCC {l3, l4}... 21.39/21.45 21.39/21.45 LOG: CALL solveLinear 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear - Elapsed time: 0.002926s 21.39/21.45 21.39/21.45 LOG: CALL solveLinear 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear - Elapsed time: 0.015359s 21.39/21.45 Trying to remove transition: undef149, rest remain the same}> 21.39/21.45 Solving with 1 template(s). 21.39/21.45 21.39/21.45 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.45 21.39/21.45 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019531s 21.39/21.45 Time used: 0.018054 21.39/21.45 Trying to remove transition: undef31, rest remain the same}> 21.39/21.45 Solving with 1 template(s). 21.39/21.45 21.39/21.45 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.45 21.39/21.45 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016439s 21.39/21.45 Time used: 0.014552 21.39/21.45 Solving with 1 template(s). 21.39/21.45 21.39/21.45 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.45 21.39/21.45 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.064159s 21.39/21.45 Time used: 0.062113 21.39/21.45 Improving Solution with cost 1 ... 21.39/21.45 21.39/21.45 LOG: CALL solveNonLinearGetNextSolution 21.39/21.45 21.39/21.45 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.080237s 21.39/21.45 Time used: 0.080233 21.39/21.45 21.39/21.45 LOG: SAT solveNonLinear - Elapsed time: 0.144397s 21.39/21.45 Cost: 1; Total time: 0.142346 21.39/21.45 Failed at location 4: 1 <= tmp_11^0 21.39/21.45 Before Improving: 21.39/21.45 Quasi-invariant at l3: y_9^0 <= tmp_11^0 + z_10^0 21.39/21.45 Quasi-invariant at l4: 1 <= tmp_11^0 21.39/21.45 Optimizing invariants... 21.39/21.45 21.39/21.45 LOG: CALL solveLinear 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear - Elapsed time: 0.014970s 21.39/21.45 Remaining time after improvement: 0.992786 21.39/21.45 Termination implied by a set of quasi-invariant(s): 21.39/21.45 Quasi-invariant at l3: y_9^0 <= tmp_11^0 + z_10^0 21.39/21.45 Quasi-invariant at l4: 1 <= tmp_11^0 21.39/21.45 [ Invariant Graph ] 21.39/21.45 Strengthening and disabling transitions... 21.39/21.45 21.39/21.45 LOG: CALL solverLinear in Graph for feasibility 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.45 Strengthening transition (result): 21.39/21.45 undef31, rest remain the same}> 21.39/21.45 21.39/21.45 LOG: CALL solverLinear in Graph for feasibility 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.45 Strengthening transition (result): 21.39/21.45 undef149, rest remain the same}> 21.39/21.45 [ Termination Graph ] 21.39/21.45 Strengthening and disabling transitions... 21.39/21.45 21.39/21.45 LOG: CALL solverLinear in Graph for feasibility 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.45 Strengthening transition (result): 21.39/21.45 undef31, rest remain the same}> 21.39/21.45 21.39/21.45 LOG: CALL solverLinear in Graph for feasibility 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.45 Strengthening transition (result): 21.39/21.45 undef149, rest remain the same}> 21.39/21.45 Ranking function: tmp_11^0 21.39/21.45 New Graphs: 21.39/21.45 Transitions: 21.39/21.45 undef31, rest remain the same}> 21.39/21.45 Variables: 21.39/21.45 b_128^0, tmp_11^0, y_9^0, z_10^0 21.39/21.45 Checking conditional termination of SCC {l3}... 21.39/21.45 21.39/21.45 LOG: CALL solveLinear 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear - Elapsed time: 0.001557s 21.39/21.45 21.39/21.45 LOG: CALL solveLinear 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear - Elapsed time: 0.007791s 21.39/21.45 Trying to remove transition: undef31, rest remain the same}> 21.39/21.45 Solving with 1 template(s). 21.39/21.45 21.39/21.45 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.45 21.39/21.45 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010869s 21.39/21.45 Time used: 0.010183 21.39/21.45 Solving with 1 template(s). 21.39/21.45 21.39/21.45 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.45 21.39/21.45 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.633610s 21.39/21.45 Time used: 0.632707 21.39/21.45 Solving with 2 template(s). 21.39/21.45 21.39/21.45 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.45 21.39/21.45 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002780s 21.39/21.45 Time used: 4.00007 21.39/21.45 Solving with 3 template(s). 21.39/21.45 21.39/21.45 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.45 21.39/21.45 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.013603s 21.39/21.45 Time used: 1.00006 21.39/21.45 Solving with 1 template(s). 21.39/21.45 21.39/21.45 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.45 21.39/21.45 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.064457s 21.39/21.45 Time used: 0.028488 21.39/21.45 21.39/21.45 Proving non-termination of subgraph 1 21.39/21.45 Transitions: 21.39/21.45 undef31, rest remain the same}> 21.39/21.45 undef149, rest remain the same}> 21.39/21.45 Variables: 21.39/21.45 __disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0 21.39/21.45 21.39/21.45 Checking that every undef value has an assignment... 21.39/21.45 21.39/21.45 LOG: CALL solveLinear 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear - Elapsed time: 0.011372s 21.39/21.45 Checking conditional non-termination of SCC {l3, l4}... 21.39/21.45 EXIT TRANSITIONS: 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 Solving with 1 template(s). 21.39/21.45 21.39/21.45 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.45 21.39/21.45 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.050437s 21.39/21.45 Time used: 4.04736 21.39/21.45 Improving Solution with cost 39 ... 21.39/21.45 21.39/21.45 LOG: CALL solveNonLinearGetNextSolution 21.39/21.45 21.39/21.45 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.955387s 21.39/21.45 Time used: 0.955375 21.39/21.45 21.39/21.45 LOG: SAT solveNonLinear - Elapsed time: 5.005824s 21.39/21.45 Cost: 39; Total time: 5.00274 21.39/21.45 Failed at location 4: 1 + x_8^0 <= y_9^0 21.39/21.45 Before Improving: 21.39/21.45 Quasi-invariant at l3: 1 + y_9^0 <= z_10^0 21.39/21.45 Quasi-invariant at l4: 1 + x_8^0 <= y_9^0 21.39/21.45 Optimizing invariants... 21.39/21.45 21.39/21.45 LOG: CALL solveLinear 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear - Elapsed time: 0.035616s 21.39/21.45 Remaining time after improvement: 0.975693 21.39/21.45 Minimizing number of undef constraints... 21.39/21.45 21.39/21.45 LOG: CALL solveNonLinear 21.39/21.45 21.39/21.45 LOG: RETURN solveNonLinear - Elapsed time: 0.050076s 21.39/21.45 Number of undef constraints reduced! 21.39/21.45 21.39/21.45 Non-termination implied by a set of quasi-invariant(s): 21.39/21.45 Quasi-invariant at l3: 1 + y_9^0 <= z_10^0 21.39/21.45 Quasi-invariant at l4: 1 + x_8^0 <= y_9^0 21.39/21.45 21.39/21.45 Strengthening and disabling EXIT transitions... 21.39/21.45 Closed exits from l3: 11 21.39/21.45 Closed exits from l4: 9 21.39/21.45 Strengthening exit transition (result): 21.39/21.45 21.39/21.45 Strengthening exit transition (result): 21.39/21.45 21.39/21.45 Strengthening exit transition (result): 21.39/21.45 21.39/21.45 Strengthening exit transition (result): 21.39/21.45 21.39/21.45 Strengthening exit transition (result): 21.39/21.45 21.39/21.45 Strengthening exit transition (result): 21.39/21.45 21.39/21.45 Strengthening exit transition (result): 21.39/21.45 21.39/21.45 Strengthening exit transition (result): 21.39/21.45 21.39/21.45 Strengthening exit transition (result): 21.39/21.45 21.39/21.45 Strengthening exit transition (result): 21.39/21.45 21.39/21.45 Strengthening exit transition (result): 21.39/21.45 21.39/21.45 Strengthening exit transition (result): 21.39/21.45 21.39/21.45 Strengthening exit transition (result): 21.39/21.45 21.39/21.45 Strengthening exit transition (result): 21.39/21.45 21.39/21.45 Strengthening exit transition (result): 21.39/21.45 21.39/21.45 Strengthening exit transition (result): 21.39/21.45 21.39/21.45 Strengthening exit transition (result): 21.39/21.45 21.39/21.45 Strengthening exit transition (result): 21.39/21.45 21.39/21.45 Strengthening exit transition (result): 21.39/21.45 21.39/21.45 21.39/21.45 Strengthening and disabling transitions... 21.39/21.45 21.39/21.45 LOG: CALL solverLinear in Graph for feasibility 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.45 Strengthening transition (result): 21.39/21.45 undef31, rest remain the same}> 21.39/21.45 21.39/21.45 LOG: CALL solverLinear in Graph for feasibility 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.45 Strengthening transition (result): 21.39/21.45 undef149, rest remain the same}> 21.39/21.45 21.39/21.45 Checking conditional non-termination of SCC {l3, l4}... 21.39/21.45 EXIT TRANSITIONS: 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 Solving with 1 template(s). 21.39/21.45 21.39/21.45 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.45 21.39/21.45 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.997238s 21.39/21.45 Time used: 2.99388 21.39/21.45 Improving Solution with cost 15 ... 21.39/21.45 21.39/21.45 LOG: CALL solveNonLinearGetNextSolution 21.39/21.45 21.39/21.45 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002435s 21.39/21.45 Time used: 1.00245 21.39/21.45 21.39/21.45 LOG: SAT solveNonLinear - Elapsed time: 3.999673s 21.39/21.45 Cost: 15; Total time: 3.99633 21.39/21.45 Failed at location 4: 1 + b_128^0 <= 0 21.39/21.45 Before Improving: 21.39/21.45 Quasi-invariant at l3: 1 + b_128^0 + tmp_11^0 <= 0 21.39/21.45 Quasi-invariant at l4: 1 + b_128^0 <= 0 21.39/21.45 Optimizing invariants... 21.39/21.45 21.39/21.45 LOG: CALL solveLinear 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear - Elapsed time: 0.043891s 21.39/21.45 Quasi-invariant improved 21.39/21.45 21.39/21.45 LOG: CALL solveLinear 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear - Elapsed time: 0.023194s 21.39/21.45 Remaining time after improvement: 0.949919 21.39/21.45 Minimizing number of undef constraints... 21.39/21.45 21.39/21.45 LOG: CALL solveNonLinear 21.39/21.45 21.39/21.45 LOG: RETURN solveNonLinear - Elapsed time: 0.037744s 21.39/21.45 Number of undef constraints reduced! 21.39/21.45 21.39/21.45 Non-termination implied by a set of quasi-invariant(s): 21.39/21.45 Quasi-invariant at l3: b_128^0 + tmp_11^0 <= 0 21.39/21.45 Quasi-invariant at l4: b_128^0 <= 0 21.39/21.45 21.39/21.45 Strengthening and disabling EXIT transitions... 21.39/21.45 Closed exits from l3: 7 21.39/21.45 Closed exits from l4: 5 21.39/21.45 Strengthening exit transition (result): 21.39/21.45 21.39/21.45 Strengthening exit transition (result): 21.39/21.45 21.39/21.45 Strengthening exit transition (result): 21.39/21.45 21.39/21.45 Strengthening exit transition (result): 21.39/21.45 21.39/21.45 Strengthening exit transition (result): 21.39/21.45 21.39/21.45 Strengthening exit transition (result): 21.39/21.45 21.39/21.45 Strengthening exit transition (result): 21.39/21.45 21.39/21.45 21.39/21.45 Strengthening and disabling transitions... 21.39/21.45 21.39/21.45 LOG: CALL solverLinear in Graph for feasibility 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.45 Strengthening transition (result): 21.39/21.45 undef31, rest remain the same}> 21.39/21.45 21.39/21.45 LOG: CALL solverLinear in Graph for feasibility 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.45 Strengthening transition (result): 21.39/21.45 undef149, rest remain the same}> 21.39/21.45 21.39/21.45 Checking conditional non-termination of SCC {l3, l4}... 21.39/21.45 EXIT TRANSITIONS: 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 21.39/21.45 Solving with 1 template(s). 21.39/21.45 21.39/21.45 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.45 21.39/21.45 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.574231s 21.39/21.45 Time used: 0.572193 21.39/21.45 Improving Solution with cost 3 ... 21.39/21.45 21.39/21.45 LOG: CALL solveNonLinearGetNextSolution 21.39/21.45 21.39/21.45 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002996s 21.39/21.45 Time used: 1.00301 21.39/21.45 21.39/21.45 LOG: SAT solveNonLinear - Elapsed time: 1.577227s 21.39/21.45 Cost: 3; Total time: 1.5752 21.39/21.45 Failed at location 4: 1 + y_9^0 <= b_128^0 + z_10^0 21.39/21.45 Before Improving: 21.39/21.45 Quasi-invariant at l3: 0 <= tmp_11^0 21.39/21.45 Quasi-invariant at l4: 1 + y_9^0 <= b_128^0 + z_10^0 21.39/21.45 Optimizing invariants... 21.39/21.45 21.39/21.45 LOG: CALL solveLinear 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear - Elapsed time: 0.030831s 21.39/21.45 Remaining time after improvement: 0.981977 21.39/21.45 Minimizing number of undef constraints... 21.39/21.45 21.39/21.45 LOG: CALL solveNonLinear 21.39/21.45 21.39/21.45 LOG: RETURN solveNonLinear - Elapsed time: 0.031172s 21.39/21.45 Number of undef constraints reduced! 21.39/21.45 21.39/21.45 Non-termination implied by a set of quasi-invariant(s): 21.39/21.45 Quasi-invariant at l3: 0 <= tmp_11^0 21.39/21.45 Quasi-invariant at l4: 1 + y_9^0 <= b_128^0 + z_10^0 21.39/21.45 21.39/21.45 Strengthening and disabling EXIT transitions... 21.39/21.45 Closed exits from l3: 3 21.39/21.45 Closed exits from l4: 3 21.39/21.45 Strengthening exit transition (result): 21.39/21.45 21.39/21.45 21.39/21.45 Strengthening and disabling transitions... 21.39/21.45 21.39/21.45 LOG: CALL solverLinear in Graph for feasibility 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.45 Strengthening transition (result): 21.39/21.45 undef31, rest remain the same}> 21.39/21.45 21.39/21.45 LOG: CALL solverLinear in Graph for feasibility 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.45 Strengthening transition (result): 21.39/21.45 undef149, rest remain the same}> 21.39/21.45 21.39/21.45 Checking conditional non-termination of SCC {l3, l4}... 21.39/21.45 EXIT TRANSITIONS: 21.39/21.45 21.39/21.45 21.39/21.45 Solving with 1 template(s). 21.39/21.45 21.39/21.45 LOG: CALL solveNonLinearGetFirstSolution 21.39/21.45 21.39/21.45 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.442474s 21.39/21.45 Time used: 0.442344 21.39/21.45 21.39/21.45 LOG: SAT solveNonLinear - Elapsed time: 0.442474s 21.39/21.45 Cost: 0; Total time: 0.442344 21.39/21.45 Minimizing number of undef constraints... 21.39/21.45 21.39/21.45 LOG: CALL solveNonLinear 21.39/21.45 21.39/21.45 LOG: RETURN solveNonLinear - Elapsed time: 0.033778s 21.39/21.45 Number of undef constraints reduced! 21.39/21.45 21.39/21.45 Non-termination implied by a set of quasi-invariant(s): 21.39/21.45 Quasi-invariant at l3: tmp_11^0 <= 0 21.39/21.45 21.39/21.45 Strengthening and disabling EXIT transitions... 21.39/21.45 Closed exits from l3: 1 21.39/21.45 21.39/21.45 Strengthening and disabling transitions... 21.39/21.45 21.39/21.45 LOG: CALL solverLinear in Graph for feasibility 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.45 Strengthening transition (result): 21.39/21.45 undef31, rest remain the same}> 21.39/21.45 21.39/21.45 LOG: CALL solverLinear in Graph for feasibility 21.39/21.45 21.39/21.45 LOG: RETURN solveLinear in Graph for feasibility 21.39/21.45 Strengthening transition (result): 21.39/21.45 undef149, rest remain the same}> 21.39/21.45 21.39/21.45 Calling reachability with... 21.39/21.45 Transition: 21.39/21.45 Conditions: 1 + x_8^0 <= y_9^0, b_128^0 <= 0, 1 + y_9^0 <= b_128^0 + z_10^0, 21.39/21.45 OPEN EXITS: 21.39/21.45 (condsUp: b_128^0 <= 0) 21.39/21.45 21.39/21.45 --- Reachability graph --- 21.39/21.45 > Graph without transitions. 21.39/21.45 21.39/21.45 Calling reachability with... 21.39/21.45 Transition: 21.39/21.45 Conditions: 1 + y_9^0 <= b_128^0 + z_10^0, 1 + x_8^0 <= y_9^0, b_128^0 <= 0, 21.39/21.45 OPEN EXITS: 21.39/21.45 21.39/21.45 21.39/21.45 > Conditions are reachable! 21.39/21.45 21.39/21.45 Program does NOT terminate 21.39/21.45 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 21.39/21.45 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 21.39/21.45 EOF