30.24/30.42 NO 30.24/30.42 30.24/30.42 Solver Timeout: 4 30.24/30.42 Global Timeout: 300 30.24/30.42 No parsing errors! 30.24/30.42 Init Location: 0 30.24/30.42 Transitions: 30.24/30.42 30.24/30.42 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}> 30.24/30.42 ~(1)) /\ (arg1 < 10) /\ ((arg1 + 1) > arg1), par{arg1 -> (arg1 + 1), arg2 -> undef4}> 30.24/30.42 undef6}> 30.24/30.42 5) /\ ((arg1 + 1) > arg1), par{arg1 -> (arg1 + 1), arg2 -> undef8}> 30.24/30.42 undef9, arg2 -> undef10}> 30.24/30.42 30.24/30.42 Fresh variables: 30.24/30.42 undef2, undef4, undef6, undef8, undef9, undef10, 30.24/30.42 30.24/30.42 Undef variables: 30.24/30.42 undef2, undef4, undef6, undef8, undef9, undef10, 30.24/30.42 30.24/30.42 Abstraction variables: 30.24/30.42 30.24/30.42 Exit nodes: 30.24/30.42 30.24/30.42 Accepting locations: 30.24/30.42 30.24/30.42 Asserts: 30.24/30.42 30.24/30.42 Preprocessed LLVMGraph 30.24/30.42 Init Location: 0 30.24/30.42 Transitions: 30.24/30.42 0) /\ (undef10 > ~(1))> 30.24/30.42 ~(1)) /\ (arg1 < 10) /\ ((arg1 + 1) > arg1), par{arg1 -> (arg1 + 1)}> 30.24/30.42 30.24/30.42 5) /\ ((arg1 + 1) > arg1), par{arg1 -> (arg1 + 1)}> 30.24/30.42 30.24/30.42 Fresh variables: 30.24/30.42 undef2, undef4, undef6, undef8, undef9, undef10, 30.24/30.42 30.24/30.42 Undef variables: 30.24/30.42 undef2, undef4, undef6, undef8, undef9, undef10, 30.24/30.42 30.24/30.42 Abstraction variables: 30.24/30.42 30.24/30.42 Exit nodes: 30.24/30.42 30.24/30.42 Accepting locations: 30.24/30.42 30.24/30.42 Asserts: 30.24/30.42 30.24/30.42 ************************************************************* 30.24/30.42 ******************************************************************************************* 30.24/30.42 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 30.24/30.42 ******************************************************************************************* 30.24/30.42 30.24/30.42 Init Location: 0 30.24/30.42 Graph 0: 30.24/30.42 Transitions: 30.24/30.42 Variables: 30.24/30.42 30.24/30.42 Graph 1: 30.24/30.42 Transitions: 30.24/30.42 1 + arg1, rest remain the same}> 30.24/30.42 Variables: 30.24/30.42 arg1 30.24/30.42 30.24/30.42 Graph 2: 30.24/30.42 Transitions: 30.24/30.42 1 + arg1, rest remain the same}> 30.24/30.42 Variables: 30.24/30.42 arg1 30.24/30.42 30.24/30.42 Precedence: 30.24/30.42 Graph 0 30.24/30.42 30.24/30.42 Graph 1 30.24/30.42 30.24/30.42 30.24/30.42 Graph 2 30.24/30.42 30.24/30.42 30.24/30.42 Map Locations to Subgraph: 30.24/30.42 ( 0 , 0 ) 30.24/30.42 ( 2 , 1 ) 30.24/30.42 ( 3 , 2 ) 30.24/30.42 30.24/30.42 ******************************************************************************************* 30.24/30.42 ******************************** CHECKING ASSERTIONS ******************************** 30.24/30.42 ******************************************************************************************* 30.24/30.42 30.24/30.42 Proving termination of subgraph 0 30.24/30.42 Proving termination of subgraph 1 30.24/30.42 Checking unfeasibility... 30.24/30.42 Time used: 0.00165 30.24/30.42 30.24/30.42 Checking conditional termination of SCC {l2}... 30.24/30.42 30.24/30.42 LOG: CALL solveLinear 30.24/30.42 30.24/30.42 LOG: RETURN solveLinear - Elapsed time: 0.000592s 30.24/30.42 Ranking function: 9 - arg1 30.24/30.42 New Graphs: 30.24/30.42 Proving termination of subgraph 2 30.24/30.42 Checking unfeasibility... 30.24/30.42 Time used: 0.00324 30.24/30.42 30.24/30.42 Checking conditional termination of SCC {l3}... 30.24/30.42 30.24/30.42 LOG: CALL solveLinear 30.24/30.42 30.24/30.42 LOG: RETURN solveLinear - Elapsed time: 0.000473s 30.24/30.42 30.24/30.42 LOG: CALL solveLinear 30.24/30.42 30.24/30.42 LOG: RETURN solveLinear - Elapsed time: 0.001137s 30.24/30.42 Trying to remove transition: 1 + arg1, rest remain the same}> 30.24/30.42 Solving with 1 template(s). 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetFirstSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003542s 30.24/30.42 Time used: 0.003421 30.24/30.42 Solving with 1 template(s). 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetFirstSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004653s 30.24/30.42 Time used: 0.004405 30.24/30.42 Improving Solution with cost 1 ... 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetNextSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.013680s 30.24/30.42 Time used: 1.01353 30.24/30.42 30.24/30.42 LOG: SAT solveNonLinear - Elapsed time: 1.018332s 30.24/30.42 Cost: 1; Total time: 1.01794 30.24/30.42 Failed at location 3: arg1 <= 0 30.24/30.42 Before Improving: 30.24/30.42 Quasi-invariant at l3: arg1 <= 0 30.24/30.42 Optimizing invariants... 30.24/30.42 30.24/30.42 LOG: CALL solveLinear 30.24/30.42 30.24/30.42 LOG: RETURN solveLinear - Elapsed time: 0.004528s 30.24/30.42 Remaining time after improvement: 0.999113 30.24/30.42 Termination implied by a set of quasi-invariant(s): 30.24/30.42 Quasi-invariant at l3: arg1 <= 0 30.24/30.42 [ Invariant Graph ] 30.24/30.42 Strengthening and disabling transitions... 30.24/30.42 30.24/30.42 LOG: CALL solverLinear in Graph for feasibility 30.24/30.42 30.24/30.42 LOG: RETURN solveLinear in Graph for feasibility 30.24/30.42 It's unfeasible. Removing transition: 30.24/30.42 1 + arg1, rest remain the same}> 30.24/30.42 [ Termination Graph ] 30.24/30.42 Strengthening and disabling transitions... 30.24/30.42 > It's unfeasible. Removing transition: 30.24/30.42 1 + arg1, rest remain the same}> 30.24/30.42 New Graphs: 30.24/30.42 Calling Safety with literal arg1 <= 0 and entry 30.24/30.42 30.24/30.42 LOG: CALL check - Post:arg1 <= 0 - Process 1 30.24/30.42 * Exit transition: 30.24/30.42 * Postcondition : arg1 <= 0 30.24/30.42 30.24/30.42 FIXED: Entro call 30.24/30.42 FIXED (try DiffLogic): 0 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetFirstSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003410s 30.24/30.42 Time used: 0.00331 30.24/30.42 FIXED (FARKAS): fail 30.24/30.42 FIXED (FARKAS): 0.003729 30.24/30.42 30.24/30.42 FIXED: Entro call 30.24/30.42 FIXED (try DiffLogic): 0 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetFirstSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006887s 30.24/30.42 Time used: 0.00671 30.24/30.42 FIXED (FARKAS): fail 30.24/30.42 FIXED (FARKAS): 0.007291 30.24/30.42 30.24/30.42 LOG: Try proving POST 30.24/30.42 Solving with 1 template(s). 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetFirstSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.047000s 30.24/30.42 Time used: 0.046562 30.24/30.42 Improving Solution with cost 1 ... 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetNextSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012294s 30.24/30.42 Time used: 0.012287 30.24/30.42 30.24/30.42 LOG: SAT solveNonLinear - Elapsed time: 0.059293s 30.24/30.42 Cost: 1; Total time: 0.058849 30.24/30.42 Failed at location 2: 10 <= arg1 30.24/30.42 Before Improving: 30.24/30.42 Quasi-invariant at l2: 10 <= arg1 30.24/30.42 Optimizing invariants... 30.24/30.42 30.24/30.42 LOG: CALL solveLinear 30.24/30.42 30.24/30.42 LOG: RETURN solveLinear - Elapsed time: 0.001351s 30.24/30.42 Remaining time after improvement: 0.999314 30.24/30.42 Postcondition implied by a set of quasi-invariant(s): 30.24/30.42 Quasi-invariant at l2: 10 <= arg1 30.24/30.42 Postcondition: 10 <= arg1 30.24/30.42 30.24/30.42 LOG: CALL check - Post:10 <= arg1 - Process 2 30.24/30.42 * Exit transition: 30.24/30.42 * Postcondition : 10 <= arg1 30.24/30.42 30.24/30.42 LOG: CALL solveLinear 30.24/30.42 30.24/30.42 LOG: RETURN solveLinear - Elapsed time: 0.000553s 30.24/30.42 > Postcondition is not implied! 30.24/30.42 30.24/30.42 LOG: RETURN check - Elapsed time: 0.000646s 30.24/30.42 30.24/30.42 LOG: NarrowEntry size 1 30.24/30.42 INVARIANTS: 30.24/30.42 2: 30.24/30.42 Quasi-INVARIANTS to narrow Graph: 30.24/30.42 2: 10 <= arg1 , 30.24/30.42 Narrowing transition: 30.24/30.42 1 + arg1, rest remain the same}> 30.24/30.42 30.24/30.42 LOG: Narrow transition size 1 30.24/30.42 ENTRIES: 30.24/30.42 30.24/30.42 END ENTRIES: 30.24/30.42 GRAPH: 30.24/30.42 1 + arg1, rest remain the same}> 30.24/30.42 END GRAPH: 30.24/30.42 EXIT: 30.24/30.42 POST: arg1 <= 0 30.24/30.42 30.24/30.42 30.24/30.42 LOG: Try proving POST 30.24/30.42 Solving with 1 template(s). 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetFirstSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.043597s 30.24/30.42 Time used: 0.043497 30.24/30.42 Solving with 2 template(s). 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetFirstSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.519557s 30.24/30.42 Time used: 0.519229 30.24/30.42 Solving with 3 template(s). 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetFirstSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.002181s 30.24/30.42 Time used: 1.00041 30.24/30.42 30.24/30.42 LOG: Postcondition is not implied - no solution 30.24/30.42 > Postcondition is not implied! 30.24/30.42 30.24/30.42 LOG: RETURN check - Elapsed time: 1.643983s 30.24/30.42 INVARIANTS: 30.24/30.42 3: 30.24/30.42 Quasi-INVARIANTS to narrow Graph: 30.24/30.42 3: arg1 <= 0 , 30.24/30.42 Narrowing transition: 30.24/30.42 1 + arg1, rest remain the same}> 30.24/30.42 30.24/30.42 LOG: Narrow transition size 1 30.24/30.42 invGraph after Narrowing: 30.24/30.42 Transitions: 30.24/30.42 1 + arg1, rest remain the same}> 30.24/30.42 Variables: 30.24/30.42 arg1 30.24/30.42 Checking conditional termination of SCC {l3}... 30.24/30.42 30.24/30.42 LOG: CALL solveLinear 30.24/30.42 30.24/30.42 LOG: RETURN solveLinear - Elapsed time: 0.000423s 30.24/30.42 30.24/30.42 LOG: CALL solveLinear 30.24/30.42 30.24/30.42 LOG: RETURN solveLinear - Elapsed time: 0.001253s 30.24/30.42 Trying to remove transition: 1 + arg1, rest remain the same}> 30.24/30.42 Solving with 1 template(s). 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetFirstSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003563s 30.24/30.42 Time used: 0.003438 30.24/30.42 Solving with 1 template(s). 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetFirstSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004893s 30.24/30.42 Time used: 0.00464 30.24/30.42 Improving Solution with cost 1 ... 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetNextSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000506s 30.24/30.42 Time used: 1.00048 30.24/30.42 30.24/30.42 LOG: SAT solveNonLinear - Elapsed time: 1.005399s 30.24/30.42 Cost: 1; Total time: 1.00512 30.24/30.42 Failed at location 3: arg1 <= 1 30.24/30.42 Before Improving: 30.24/30.42 Quasi-invariant at l3: arg1 <= 1 30.24/30.42 Optimizing invariants... 30.24/30.42 30.24/30.42 LOG: CALL solveLinear 30.24/30.42 30.24/30.42 LOG: RETURN solveLinear - Elapsed time: 0.004909s 30.24/30.42 Quasi-invariant improved 30.24/30.42 30.24/30.42 LOG: CALL solveLinear 30.24/30.42 30.24/30.42 LOG: RETURN solveLinear - Elapsed time: 0.001180s 30.24/30.42 Quasi-invariant improved 30.24/30.42 30.24/30.42 LOG: CALL solveLinear 30.24/30.42 30.24/30.42 LOG: RETURN solveLinear - Elapsed time: 0.001131s 30.24/30.42 Quasi-invariant improved 30.24/30.42 30.24/30.42 LOG: CALL solveLinear 30.24/30.42 30.24/30.42 LOG: RETURN solveLinear - Elapsed time: 0.001109s 30.24/30.42 Quasi-invariant improved 30.24/30.42 30.24/30.42 LOG: CALL solveLinear 30.24/30.42 30.24/30.42 LOG: RETURN solveLinear - Elapsed time: 0.000823s 30.24/30.42 Remaining time after improvement: 0.994807 30.24/30.42 Termination implied by a set of quasi-invariant(s): 30.24/30.42 Quasi-invariant at l3: arg1 <= 5 30.24/30.42 [ Invariant Graph ] 30.24/30.42 Strengthening and disabling transitions... 30.24/30.42 30.24/30.42 LOG: CALL solverLinear in Graph for feasibility 30.24/30.42 30.24/30.42 LOG: RETURN solveLinear in Graph for feasibility 30.24/30.42 It's unfeasible. Removing transition: 30.24/30.42 1 + arg1, rest remain the same}> 30.24/30.42 [ Termination Graph ] 30.24/30.42 Strengthening and disabling transitions... 30.24/30.42 30.24/30.42 LOG: CALL solverLinear in Graph for feasibility 30.24/30.42 30.24/30.42 LOG: RETURN solveLinear in Graph for feasibility 30.24/30.42 It's unfeasible. Removing transition: 30.24/30.42 1 + arg1, rest remain the same}> 30.24/30.42 New Graphs: 30.24/30.42 Calling Safety with literal arg1 <= 5 and entry 30.24/30.42 30.24/30.42 LOG: CALL check - Post:arg1 <= 5 - Process 3 30.24/30.42 * Exit transition: 30.24/30.42 * Postcondition : arg1 <= 5 30.24/30.42 30.24/30.42 FIXED: Entro call 30.24/30.42 FIXED (try DiffLogic): 0 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetFirstSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010823s 30.24/30.42 Time used: 0.010722 30.24/30.42 FIXED (FARKAS): fail 30.24/30.42 FIXED (FARKAS): 0.011192 30.24/30.42 30.24/30.42 FIXED: Entro call 30.24/30.42 FIXED (try DiffLogic): 0 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetFirstSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010869s 30.24/30.42 Time used: 0.010579 30.24/30.42 FIXED (FARKAS): fail 30.24/30.42 FIXED (FARKAS): 0.011198 30.24/30.42 30.24/30.42 LOG: Try proving POST 30.24/30.42 Solving with 1 template(s). 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetFirstSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.054730s 30.24/30.42 Time used: 0.054374 30.24/30.42 Improving Solution with cost 1 ... 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetNextSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.007052s 30.24/30.42 Time used: 0.007047 30.24/30.42 30.24/30.42 LOG: SAT solveNonLinear - Elapsed time: 0.061782s 30.24/30.42 Cost: 1; Total time: 0.061421 30.24/30.42 Failed at location 2: 10 <= arg1 30.24/30.42 Before Improving: 30.24/30.42 Quasi-invariant at l2: 10 <= arg1 30.24/30.42 Optimizing invariants... 30.24/30.42 30.24/30.42 LOG: CALL solveLinear 30.24/30.42 30.24/30.42 LOG: RETURN solveLinear - Elapsed time: 0.001433s 30.24/30.42 Remaining time after improvement: 0.999254 30.24/30.42 Postcondition implied by a set of quasi-invariant(s): 30.24/30.42 Quasi-invariant at l2: 10 <= arg1 30.24/30.42 Postcondition: 10 <= arg1 30.24/30.42 30.24/30.42 LOG: Postcondition is not implied - Post: 10 <= arg1 - Already checked 30.24/30.42 Already checked with failure 30.24/30.42 30.24/30.42 LOG: NarrowEntry size 1 30.24/30.42 INVARIANTS: 30.24/30.42 2: 30.24/30.42 Quasi-INVARIANTS to narrow Graph: 30.24/30.42 2: 10 <= arg1 , 30.24/30.42 Narrowing transition: 30.24/30.42 1 + arg1, rest remain the same}> 30.24/30.42 30.24/30.42 LOG: Narrow transition size 1 30.24/30.42 ENTRIES: 30.24/30.42 30.24/30.42 END ENTRIES: 30.24/30.42 GRAPH: 30.24/30.42 1 + arg1, rest remain the same}> 30.24/30.42 END GRAPH: 30.24/30.42 EXIT: 30.24/30.42 POST: arg1 <= 5 30.24/30.42 30.24/30.42 30.24/30.42 LOG: Try proving POST 30.24/30.42 Solving with 1 template(s). 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetFirstSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.102315s 30.24/30.42 Time used: 0.1022 30.24/30.42 Solving with 2 template(s). 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetFirstSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.248486s 30.24/30.42 Time used: 2.24783 30.24/30.42 Solving with 3 template(s). 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetFirstSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.002296s 30.24/30.42 Time used: 1.00033 30.24/30.42 30.24/30.42 LOG: Postcondition is not implied - no solution 30.24/30.42 > Postcondition is not implied! 30.24/30.42 30.24/30.42 LOG: RETURN check - Elapsed time: 3.457876s 30.24/30.42 INVARIANTS: 30.24/30.42 3: 30.24/30.42 Quasi-INVARIANTS to narrow Graph: 30.24/30.42 3: arg1 <= 5 , 30.24/30.42 Narrowing transition: 30.24/30.42 1 + arg1, rest remain the same}> 30.24/30.42 30.24/30.42 LOG: Narrow transition size 1 30.24/30.42 invGraph after Narrowing: 30.24/30.42 Transitions: 30.24/30.42 1 + arg1, rest remain the same}> 30.24/30.42 Variables: 30.24/30.42 arg1 30.24/30.42 Checking conditional termination of SCC {l3}... 30.24/30.42 30.24/30.42 LOG: CALL solveLinear 30.24/30.42 30.24/30.42 LOG: RETURN solveLinear - Elapsed time: 0.000421s 30.24/30.42 30.24/30.42 LOG: CALL solveLinear 30.24/30.42 30.24/30.42 LOG: RETURN solveLinear - Elapsed time: 0.001267s 30.24/30.42 Trying to remove transition: 1 + arg1, rest remain the same}> 30.24/30.42 Solving with 1 template(s). 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetFirstSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003763s 30.24/30.42 Time used: 0.003636 30.24/30.42 Solving with 1 template(s). 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetFirstSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002733s 30.24/30.42 Time used: 4.00214 30.24/30.42 Solving with 2 template(s). 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetFirstSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006532s 30.24/30.42 Time used: 4.001 30.24/30.42 Solving with 3 template(s). 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetFirstSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007587s 30.24/30.42 Time used: 1.0011 30.24/30.42 Solving with 1 template(s). 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetFirstSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009934s 30.24/30.42 Time used: 0.006213 30.24/30.42 Improving Solution with cost 1 ... 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetNextSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001355s 30.24/30.42 Time used: 1.00119 30.24/30.42 30.24/30.42 LOG: SAT solveNonLinear - Elapsed time: 1.011289s 30.24/30.42 Cost: 1; Total time: 1.0074 30.24/30.42 Termination implied by a set of invariant(s): 30.24/30.42 Invariant at l3: 0 <= 1 + arg1 30.24/30.42 [ Invariant Graph ] 30.24/30.42 Strengthening and disabling transitions... 30.24/30.42 30.24/30.42 LOG: CALL solverLinear in Graph for feasibility 30.24/30.42 30.24/30.42 LOG: RETURN solveLinear in Graph for feasibility 30.24/30.42 Strengthening transition (result): 30.24/30.42 1 + arg1, rest remain the same}> 30.24/30.42 [ Termination Graph ] 30.24/30.42 Strengthening and disabling transitions... 30.24/30.42 30.24/30.42 LOG: CALL solverLinear in Graph for feasibility 30.24/30.42 30.24/30.42 LOG: RETURN solveLinear in Graph for feasibility 30.24/30.42 Strengthening transition (result): 30.24/30.42 1 + arg1, rest remain the same}> 30.24/30.42 Quasi-ranking function: 50000 - arg1 30.24/30.42 New Graphs: 30.24/30.42 Transitions: 30.24/30.42 1 + arg1, rest remain the same}> 30.24/30.42 Variables: 30.24/30.42 arg1 30.24/30.42 Checking conditional termination of SCC {l3}... 30.24/30.42 30.24/30.42 LOG: CALL solveLinear 30.24/30.42 30.24/30.42 LOG: RETURN solveLinear - Elapsed time: 0.000439s 30.24/30.42 30.24/30.42 LOG: CALL solveLinear 30.24/30.42 30.24/30.42 LOG: RETURN solveLinear - Elapsed time: 0.001405s 30.24/30.42 Trying to remove transition: 1 + arg1, rest remain the same}> 30.24/30.42 Solving with 1 template(s). 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetFirstSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004181s 30.24/30.42 Time used: 0.004052 30.24/30.42 Solving with 1 template(s). 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetFirstSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002654s 30.24/30.42 Time used: 4.00208 30.24/30.42 Solving with 2 template(s). 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetFirstSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006012s 30.24/30.42 Time used: 4.00117 30.24/30.42 Solving with 3 template(s). 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetFirstSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007640s 30.24/30.42 Time used: 1.00127 30.24/30.42 Solving with 1 template(s). 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetFirstSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006320s 30.24/30.42 Time used: 4.00289 30.24/30.42 30.24/30.42 Proving non-termination of subgraph 2 30.24/30.42 Transitions: 30.24/30.42 1 + arg1, rest remain the same}> 30.24/30.42 Variables: 30.24/30.42 arg1 30.24/30.42 30.24/30.42 Checking conditional non-termination of SCC {l3}... 30.24/30.42 EXIT TRANSITIONS: 30.24/30.42 30.24/30.42 30.24/30.42 Solving with 1 template(s). 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetFirstSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021113s 30.24/30.42 Time used: 0.020959 30.24/30.42 Improving Solution with cost 1 ... 30.24/30.42 30.24/30.42 LOG: CALL solveNonLinearGetNextSolution 30.24/30.42 30.24/30.42 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.004792s 30.24/30.42 Time used: 0.004787 30.24/30.42 30.24/30.42 LOG: SAT solveNonLinear - Elapsed time: 0.025905s 30.24/30.42 Cost: 1; Total time: 0.025746 30.24/30.42 Failed at location 3: 6 <= arg1 30.24/30.42 Before Improving: 30.24/30.42 Quasi-invariant at l3: 6 <= arg1 30.24/30.42 Optimizing invariants... 30.24/30.42 30.24/30.42 LOG: CALL solveLinear 30.24/30.42 30.24/30.42 LOG: RETURN solveLinear - Elapsed time: 0.001300s 30.24/30.42 Remaining time after improvement: 0.999228 30.24/30.42 Non-termination implied by a set of quasi-invariant(s): 30.24/30.42 Quasi-invariant at l3: 6 <= arg1 30.24/30.42 30.24/30.42 Strengthening and disabling EXIT transitions... 30.24/30.42 Closed exits from l3: 1 30.24/30.42 30.24/30.42 Strengthening and disabling transitions... 30.24/30.42 30.24/30.42 LOG: CALL solverLinear in Graph for feasibility 30.24/30.42 30.24/30.42 LOG: RETURN solveLinear in Graph for feasibility 30.24/30.42 Strengthening transition (result): 30.24/30.42 1 + arg1, rest remain the same}> 30.24/30.42 30.24/30.42 Calling reachability with... 30.24/30.42 Transition: 30.24/30.42 Conditions: 6 <= arg1, 30.24/30.42 OPEN EXITS: 30.24/30.42 30.24/30.42 30.24/30.42 --- Reachability graph --- 30.24/30.42 > Graph without transitions. 30.24/30.42 30.24/30.42 Calling reachability with... 30.24/30.42 Transition: 30.24/30.42 Conditions: 6 <= arg1, 30.24/30.42 OPEN EXITS: 30.24/30.42 30.24/30.42 30.24/30.42 --- Reachability graph --- 30.24/30.42 > Graph without transitions. 30.24/30.42 30.24/30.42 Calling reachability with... 30.24/30.42 Transition: 30.24/30.42 Conditions: arg1 <= 9, 6 <= arg1, 30.24/30.42 OPEN EXITS: 30.24/30.42 30.24/30.42 30.24/30.42 > Conditions are reachable! 30.24/30.42 30.24/30.42 Program does NOT terminate 30.24/30.42 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 30.24/30.42 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 30.24/30.42 EOF