Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r298-tajo-171654455200252.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBNT-COL-S10J20, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tajo-171654455200252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 8.2K Apr 12 11:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 11:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 12 11:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 11:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 13:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 13:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 92K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717104479324

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-COL-S10J20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:28:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-30 21:28:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:28:01] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-30 21:28:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 21:28:02] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1114 ms
[2024-05-30 21:28:02] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 494 PT places and 11822.0 transition bindings in 45 ms.
[2024-05-30 21:28:02] [INFO ] Unfolded HLPN to a Petri net with 494 places and 11780 transitions 111159 arcs in 223 ms.
[2024-05-30 21:28:02] [INFO ] Unfolded 38 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
[2024-05-30 21:28:02] [INFO ] Reduced 9285 identical enabling conditions.
[2024-05-30 21:28:02] [INFO ] Reduced 780 identical enabling conditions.
[2024-05-30 21:28:02] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 20 places in 32 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
RANDOM walk for 40000 steps (2235 resets) in 5925 ms. (6 steps per ms) remains 7/36 properties
BEST_FIRST walk for 40002 steps (416 resets) in 334 ms. (119 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (420 resets) in 315 ms. (126 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (417 resets) in 277 ms. (143 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (100 resets) in 569 ms. (70 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (418 resets) in 211 ms. (188 steps per ms) remains 4/4 properties
[2024-05-30 21:28:05] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2024-05-30 21:28:05] [INFO ] Computed 72 invariants in 69 ms
[2024-05-30 21:28:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 382/398 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 65/463 variables, 44/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/473 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 21:28:06] [INFO ] Deduced a trap composed of 213 places in 436 ms of which 30 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/474 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1641/2115 variables, 474/547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2115 variables, 1/548 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 21:28:09] [INFO ] Deduced a trap composed of 226 places in 832 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2115 variables, 1/549 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2115 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2115/2115 variables, and 549 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5064 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 474/474 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 382/398 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 65/463 variables, 44/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/473 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/474 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1641/2115 variables, 474/548 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2115 variables, 1/549 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2115 variables, 3/552 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2115 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/2115 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2115/2115 variables, and 552 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3570 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 474/474 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 8898ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 3 properties in 103 ms.
Support contains 1 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 464 transition count 1624
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 62 place count 438 transition count 1624
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 62 place count 438 transition count 1599
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 112 place count 413 transition count 1599
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 412 transition count 1598
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 412 transition count 1598
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 410 transition count 1596
Applied a total of 118 rules in 413 ms. Remains 410 /474 variables (removed 64) and now considering 1596/1650 (removed 54) transitions.
Running 1585 sub problems to find dead transitions.
[2024-05-30 21:28:14] [INFO ] Flow matrix only has 1587 transitions (discarded 9 similar events)
// Phase 1: matrix 1587 rows 410 cols
[2024-05-30 21:28:14] [INFO ] Computed 62 invariants in 65 ms
[2024-05-30 21:28:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1585 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1585 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1585 unsolved
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1359 is UNSAT
At refinement iteration 3 (OVERLAPS) 9/409 variables, 9/61 constraints. Problems are: Problem set: 558 solved, 1027 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 409/1997 variables, and 61 constraints, problems are : Problem set: 558 solved, 1027 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1585/585 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 558 solved, 1027 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 558 solved, 1027 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 558 solved, 1027 unsolved
[2024-05-30 21:28:56] [INFO ] Deduced a trap composed of 18 places in 339 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 1/53 constraints. Problems are: Problem set: 558 solved, 1027 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 0/53 constraints. Problems are: Problem set: 558 solved, 1027 unsolved
At refinement iteration 4 (OVERLAPS) 9/409 variables, 9/62 constraints. Problems are: Problem set: 558 solved, 1027 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 2)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 4)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 0)
(s146 1)
(s147 0)
(s148 9)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 0)
(s383 1)
(s384 1)
(s385 1)
(s386 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 409/1997 variables, and 62 constraints, problems are : Problem set: 558 solved, 1027 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 442/585 constraints, Known Traps: 1/1 constraints]
After SMT, in 59905ms problems are : Problem set: 558 solved, 1027 unsolved
Search for dead transitions found 558 dead transitions in 59934ms
Found 558 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 558 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 558 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 410/474 places, 1038/1650 transitions.
Applied a total of 0 rules in 58 ms. Remains 410 /410 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60455 ms. Remains : 410/474 places, 1038/1650 transitions.
RANDOM walk for 4000000 steps (290926 resets) in 37945 ms. (105 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (38809 resets) in 7156 ms. (558 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 6265139 steps, run timeout after 33001 ms. (steps per millisecond=189 ) properties seen :0 out of 1
Probabilistic random walk after 6265139 steps, saw 1088219 distinct states, run finished after 33007 ms. (steps per millisecond=189 ) properties seen :0
[2024-05-30 21:29:59] [INFO ] Flow matrix only has 1029 transitions (discarded 9 similar events)
// Phase 1: matrix 1029 rows 410 cols
[2024-05-30 21:29:59] [INFO ] Computed 62 invariants in 20 ms
[2024-05-30 21:29:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/409 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1029/1438 variables, 409/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1438 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1438 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1439 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1439 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1439 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1439/1439 variables, and 473 constraints, problems are : Problem set: 0 solved, 1 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 410/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/409 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1029/1438 variables, 409/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1438 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:30:00] [INFO ] Deduced a trap composed of 166 places in 397 ms of which 5 ms to minimize.
[2024-05-30 21:30:01] [INFO ] Deduced a trap composed of 162 places in 370 ms of which 3 ms to minimize.
[2024-05-30 21:30:01] [INFO ] Deduced a trap composed of 166 places in 308 ms of which 3 ms to minimize.
[2024-05-30 21:30:01] [INFO ] Deduced a trap composed of 162 places in 264 ms of which 3 ms to minimize.
[2024-05-30 21:30:02] [INFO ] Deduced a trap composed of 166 places in 314 ms of which 4 ms to minimize.
[2024-05-30 21:30:02] [INFO ] Deduced a trap composed of 162 places in 342 ms of which 3 ms to minimize.
[2024-05-30 21:30:02] [INFO ] Deduced a trap composed of 162 places in 346 ms of which 2 ms to minimize.
[2024-05-30 21:30:03] [INFO ] Deduced a trap composed of 162 places in 286 ms of which 3 ms to minimize.
[2024-05-30 21:30:03] [INFO ] Deduced a trap composed of 166 places in 344 ms of which 2 ms to minimize.
[2024-05-30 21:30:04] [INFO ] Deduced a trap composed of 173 places in 340 ms of which 2 ms to minimize.
[2024-05-30 21:30:04] [INFO ] Deduced a trap composed of 158 places in 329 ms of which 3 ms to minimize.
[2024-05-30 21:30:04] [INFO ] Deduced a trap composed of 164 places in 284 ms of which 3 ms to minimize.
[2024-05-30 21:30:05] [INFO ] Deduced a trap composed of 167 places in 290 ms of which 3 ms to minimize.
[2024-05-30 21:30:05] [INFO ] Deduced a trap composed of 166 places in 314 ms of which 2 ms to minimize.
[2024-05-30 21:30:05] [INFO ] Deduced a trap composed of 173 places in 263 ms of which 3 ms to minimize.
[2024-05-30 21:30:06] [INFO ] Deduced a trap composed of 170 places in 328 ms of which 2 ms to minimize.
[2024-05-30 21:30:06] [INFO ] Deduced a trap composed of 160 places in 244 ms of which 3 ms to minimize.
[2024-05-30 21:30:06] [INFO ] Deduced a trap composed of 162 places in 267 ms of which 3 ms to minimize.
[2024-05-30 21:30:07] [INFO ] Deduced a trap composed of 164 places in 300 ms of which 3 ms to minimize.
[2024-05-30 21:30:07] [INFO ] Deduced a trap composed of 164 places in 275 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1438 variables, 20/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:30:08] [INFO ] Deduced a trap composed of 154 places in 242 ms of which 3 ms to minimize.
[2024-05-30 21:30:08] [INFO ] Deduced a trap composed of 168 places in 270 ms of which 4 ms to minimize.
[2024-05-30 21:30:08] [INFO ] Deduced a trap composed of 160 places in 283 ms of which 4 ms to minimize.
[2024-05-30 21:30:09] [INFO ] Deduced a trap composed of 160 places in 276 ms of which 3 ms to minimize.
[2024-05-30 21:30:09] [INFO ] Deduced a trap composed of 158 places in 226 ms of which 3 ms to minimize.
[2024-05-30 21:30:09] [INFO ] Deduced a trap composed of 166 places in 316 ms of which 3 ms to minimize.
[2024-05-30 21:30:09] [INFO ] Deduced a trap composed of 164 places in 295 ms of which 3 ms to minimize.
[2024-05-30 21:30:10] [INFO ] Deduced a trap composed of 164 places in 297 ms of which 3 ms to minimize.
[2024-05-30 21:30:10] [INFO ] Deduced a trap composed of 158 places in 321 ms of which 3 ms to minimize.
[2024-05-30 21:30:10] [INFO ] Deduced a trap composed of 160 places in 234 ms of which 2 ms to minimize.
[2024-05-30 21:30:11] [INFO ] Deduced a trap composed of 154 places in 243 ms of which 4 ms to minimize.
[2024-05-30 21:30:11] [INFO ] Deduced a trap composed of 158 places in 253 ms of which 4 ms to minimize.
[2024-05-30 21:30:12] [INFO ] Deduced a trap composed of 166 places in 290 ms of which 3 ms to minimize.
[2024-05-30 21:30:12] [INFO ] Deduced a trap composed of 169 places in 296 ms of which 2 ms to minimize.
[2024-05-30 21:30:13] [INFO ] Deduced a trap composed of 152 places in 305 ms of which 3 ms to minimize.
[2024-05-30 21:30:13] [INFO ] Deduced a trap composed of 179 places in 293 ms of which 2 ms to minimize.
[2024-05-30 21:30:13] [INFO ] Deduced a trap composed of 164 places in 243 ms of which 3 ms to minimize.
[2024-05-30 21:30:14] [INFO ] Deduced a trap composed of 164 places in 351 ms of which 2 ms to minimize.
[2024-05-30 21:30:14] [INFO ] Deduced a trap composed of 162 places in 304 ms of which 3 ms to minimize.
[2024-05-30 21:30:14] [INFO ] Deduced a trap composed of 158 places in 243 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1438 variables, 20/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:30:15] [INFO ] Deduced a trap composed of 166 places in 311 ms of which 3 ms to minimize.
[2024-05-30 21:30:15] [INFO ] Deduced a trap composed of 158 places in 311 ms of which 3 ms to minimize.
[2024-05-30 21:30:15] [INFO ] Deduced a trap composed of 160 places in 280 ms of which 3 ms to minimize.
[2024-05-30 21:30:16] [INFO ] Deduced a trap composed of 158 places in 305 ms of which 3 ms to minimize.
[2024-05-30 21:30:16] [INFO ] Deduced a trap composed of 166 places in 308 ms of which 3 ms to minimize.
[2024-05-30 21:30:17] [INFO ] Deduced a trap composed of 164 places in 483 ms of which 4 ms to minimize.
[2024-05-30 21:30:18] [INFO ] Deduced a trap composed of 168 places in 495 ms of which 3 ms to minimize.
[2024-05-30 21:30:18] [INFO ] Deduced a trap composed of 170 places in 493 ms of which 4 ms to minimize.
[2024-05-30 21:30:19] [INFO ] Deduced a trap composed of 162 places in 374 ms of which 2 ms to minimize.
[2024-05-30 21:30:20] [INFO ] Deduced a trap composed of 160 places in 532 ms of which 4 ms to minimize.
[2024-05-30 21:30:20] [INFO ] Deduced a trap composed of 158 places in 504 ms of which 3 ms to minimize.
[2024-05-30 21:30:21] [INFO ] Deduced a trap composed of 156 places in 461 ms of which 3 ms to minimize.
[2024-05-30 21:30:22] [INFO ] Deduced a trap composed of 164 places in 554 ms of which 3 ms to minimize.
[2024-05-30 21:30:22] [INFO ] Deduced a trap composed of 166 places in 310 ms of which 3 ms to minimize.
[2024-05-30 21:30:22] [INFO ] Deduced a trap composed of 162 places in 350 ms of which 3 ms to minimize.
[2024-05-30 21:30:23] [INFO ] Deduced a trap composed of 160 places in 479 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1438/1439 variables, and 528 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29148 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 409/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 56/56 constraints]
After SMT, in 29743ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 1038/1038 transitions.
Applied a total of 0 rules in 56 ms. Remains 410 /410 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 410/410 places, 1038/1038 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 1038/1038 transitions.
Applied a total of 0 rules in 41 ms. Remains 410 /410 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
[2024-05-30 21:30:29] [INFO ] Flow matrix only has 1029 transitions (discarded 9 similar events)
[2024-05-30 21:30:29] [INFO ] Invariant cache hit.
[2024-05-30 21:30:29] [INFO ] Implicit Places using invariants in 554 ms returned []
[2024-05-30 21:30:29] [INFO ] Flow matrix only has 1029 transitions (discarded 9 similar events)
[2024-05-30 21:30:29] [INFO ] Invariant cache hit.
[2024-05-30 21:30:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 21:30:31] [INFO ] Implicit Places using invariants and state equation in 1614 ms returned []
Implicit Place search using SMT with State Equation took 2176 ms to find 0 implicit places.
[2024-05-30 21:30:31] [INFO ] Redundant transitions in 72 ms returned []
Running 1027 sub problems to find dead transitions.
[2024-05-30 21:30:31] [INFO ] Flow matrix only has 1029 transitions (discarded 9 similar events)
[2024-05-30 21:30:31] [INFO ] Invariant cache hit.
[2024-05-30 21:30:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-30 21:30:43] [INFO ] Deduced a trap composed of 116 places in 199 ms of which 3 ms to minimize.
[2024-05-30 21:30:44] [INFO ] Deduced a trap composed of 121 places in 256 ms of which 3 ms to minimize.
[2024-05-30 21:30:44] [INFO ] Deduced a trap composed of 126 places in 241 ms of which 3 ms to minimize.
[2024-05-30 21:30:44] [INFO ] Deduced a trap composed of 136 places in 193 ms of which 3 ms to minimize.
[2024-05-30 21:30:44] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 4 ms to minimize.
[2024-05-30 21:30:44] [INFO ] Deduced a trap composed of 121 places in 190 ms of which 3 ms to minimize.
[2024-05-30 21:30:45] [INFO ] Deduced a trap composed of 126 places in 157 ms of which 3 ms to minimize.
[2024-05-30 21:30:45] [INFO ] Deduced a trap composed of 121 places in 158 ms of which 3 ms to minimize.
[2024-05-30 21:30:45] [INFO ] Deduced a trap composed of 111 places in 250 ms of which 3 ms to minimize.
[2024-05-30 21:30:45] [INFO ] Deduced a trap composed of 106 places in 272 ms of which 3 ms to minimize.
[2024-05-30 21:30:46] [INFO ] Deduced a trap composed of 126 places in 240 ms of which 3 ms to minimize.
[2024-05-30 21:30:46] [INFO ] Deduced a trap composed of 126 places in 215 ms of which 4 ms to minimize.
[2024-05-30 21:30:46] [INFO ] Deduced a trap composed of 126 places in 229 ms of which 2 ms to minimize.
[2024-05-30 21:30:46] [INFO ] Deduced a trap composed of 126 places in 213 ms of which 2 ms to minimize.
[2024-05-30 21:30:47] [INFO ] Deduced a trap composed of 170 places in 207 ms of which 2 ms to minimize.
[2024-05-30 21:30:47] [INFO ] Deduced a trap composed of 126 places in 204 ms of which 3 ms to minimize.
[2024-05-30 21:30:47] [INFO ] Deduced a trap composed of 111 places in 236 ms of which 2 ms to minimize.
[2024-05-30 21:30:47] [INFO ] Deduced a trap composed of 121 places in 223 ms of which 2 ms to minimize.
[2024-05-30 21:30:48] [INFO ] Deduced a trap composed of 121 places in 223 ms of which 2 ms to minimize.
[2024-05-30 21:30:48] [INFO ] Deduced a trap composed of 116 places in 220 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-30 21:30:48] [INFO ] Deduced a trap composed of 111 places in 207 ms of which 2 ms to minimize.
[2024-05-30 21:30:49] [INFO ] Deduced a trap composed of 170 places in 217 ms of which 2 ms to minimize.
[2024-05-30 21:30:49] [INFO ] Deduced a trap composed of 136 places in 190 ms of which 3 ms to minimize.
[2024-05-30 21:30:49] [INFO ] Deduced a trap composed of 116 places in 202 ms of which 3 ms to minimize.
[2024-05-30 21:30:49] [INFO ] Deduced a trap composed of 111 places in 185 ms of which 3 ms to minimize.
[2024-05-30 21:30:50] [INFO ] Deduced a trap composed of 111 places in 208 ms of which 3 ms to minimize.
[2024-05-30 21:30:50] [INFO ] Deduced a trap composed of 121 places in 179 ms of which 3 ms to minimize.
[2024-05-30 21:30:50] [INFO ] Deduced a trap composed of 111 places in 195 ms of which 3 ms to minimize.
[2024-05-30 21:30:50] [INFO ] Deduced a trap composed of 136 places in 224 ms of which 3 ms to minimize.
[2024-05-30 21:30:50] [INFO ] Deduced a trap composed of 121 places in 161 ms of which 3 ms to minimize.
[2024-05-30 21:30:51] [INFO ] Deduced a trap composed of 111 places in 218 ms of which 3 ms to minimize.
[2024-05-30 21:30:51] [INFO ] Deduced a trap composed of 116 places in 197 ms of which 3 ms to minimize.
[2024-05-30 21:30:51] [INFO ] Deduced a trap composed of 111 places in 201 ms of which 3 ms to minimize.
[2024-05-30 21:30:51] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 2 ms to minimize.
[2024-05-30 21:30:52] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 3 ms to minimize.
[2024-05-30 21:30:52] [INFO ] Deduced a trap composed of 162 places in 183 ms of which 3 ms to minimize.
[2024-05-30 21:30:52] [INFO ] Deduced a trap composed of 162 places in 156 ms of which 3 ms to minimize.
[2024-05-30 21:30:52] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 3 ms to minimize.
[2024-05-30 21:30:52] [INFO ] Deduced a trap composed of 172 places in 185 ms of which 3 ms to minimize.
[2024-05-30 21:30:53] [INFO ] Deduced a trap composed of 146 places in 194 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 5 (OVERLAPS) 9/409 variables, 9/101 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-30 21:31:05] [INFO ] Deduced a trap composed of 13 places in 260 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 (/ 1.0 3.0))
(s49 0.0)
(s50 0.0)
(s51 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 409/1439 variables, and 102 constraints, problems are : Problem set: 0 solved, 1027 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1027/1027 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1027 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 41/93 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-30 21:31:09] [INFO ] Deduced a trap composed of 18 places in 216 ms of which 2 ms to minimize.
[2024-05-30 21:31:11] [INFO ] Deduced a trap composed of 175 places in 256 ms of which 3 ms to minimize.
[2024-05-30 21:31:11] [INFO ] Deduced a trap composed of 162 places in 239 ms of which 2 ms to minimize.
[2024-05-30 21:31:12] [INFO ] Deduced a trap composed of 93 places in 372 ms of which 3 ms to minimize.
[2024-05-30 21:31:12] [INFO ] Deduced a trap composed of 142 places in 270 ms of which 3 ms to minimize.
[2024-05-30 21:31:13] [INFO ] Deduced a trap composed of 151 places in 382 ms of which 4 ms to minimize.
[2024-05-30 21:31:13] [INFO ] Deduced a trap composed of 74 places in 348 ms of which 3 ms to minimize.
[2024-05-30 21:31:13] [INFO ] Deduced a trap composed of 79 places in 262 ms of which 2 ms to minimize.
[2024-05-30 21:31:14] [INFO ] Deduced a trap composed of 72 places in 364 ms of which 4 ms to minimize.
[2024-05-30 21:31:14] [INFO ] Deduced a trap composed of 95 places in 376 ms of which 3 ms to minimize.
[2024-05-30 21:31:14] [INFO ] Deduced a trap composed of 86 places in 288 ms of which 3 ms to minimize.
[2024-05-30 21:31:15] [INFO ] Deduced a trap composed of 79 places in 391 ms of which 3 ms to minimize.
[2024-05-30 21:31:15] [INFO ] Deduced a trap composed of 93 places in 365 ms of which 3 ms to minimize.
[2024-05-30 21:31:15] [INFO ] Deduced a trap composed of 121 places in 350 ms of which 3 ms to minimize.
[2024-05-30 21:31:16] [INFO ] Deduced a trap composed of 180 places in 328 ms of which 2 ms to minimize.
[2024-05-30 21:31:20] [INFO ] Deduced a trap composed of 164 places in 142 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 16/109 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-30 21:31:21] [INFO ] Deduced a trap composed of 141 places in 244 ms of which 3 ms to minimize.
[2024-05-30 21:31:22] [INFO ] Deduced a trap composed of 121 places in 261 ms of which 2 ms to minimize.
[2024-05-30 21:31:22] [INFO ] Deduced a trap composed of 130 places in 273 ms of which 2 ms to minimize.
[2024-05-30 21:31:22] [INFO ] Deduced a trap composed of 116 places in 237 ms of which 3 ms to minimize.
[2024-05-30 21:31:23] [INFO ] Deduced a trap composed of 116 places in 278 ms of which 3 ms to minimize.
[2024-05-30 21:31:23] [INFO ] Deduced a trap composed of 125 places in 352 ms of which 3 ms to minimize.
[2024-05-30 21:31:23] [INFO ] Deduced a trap composed of 126 places in 262 ms of which 4 ms to minimize.
[2024-05-30 21:31:24] [INFO ] Deduced a trap composed of 138 places in 256 ms of which 2 ms to minimize.
[2024-05-30 21:31:25] [INFO ] Deduced a trap composed of 120 places in 284 ms of which 2 ms to minimize.
[2024-05-30 21:31:25] [INFO ] Deduced a trap composed of 141 places in 402 ms of which 3 ms to minimize.
[2024-05-30 21:31:25] [INFO ] Deduced a trap composed of 117 places in 312 ms of which 3 ms to minimize.
[2024-05-30 21:31:26] [INFO ] Deduced a trap composed of 117 places in 322 ms of which 3 ms to minimize.
[2024-05-30 21:31:26] [INFO ] Deduced a trap composed of 150 places in 316 ms of which 3 ms to minimize.
[2024-05-30 21:31:27] [INFO ] Deduced a trap composed of 131 places in 414 ms of which 3 ms to minimize.
[2024-05-30 21:31:27] [INFO ] Deduced a trap composed of 145 places in 371 ms of which 3 ms to minimize.
[2024-05-30 21:31:27] [INFO ] Deduced a trap composed of 126 places in 358 ms of which 3 ms to minimize.
[2024-05-30 21:31:28] [INFO ] Deduced a trap composed of 116 places in 325 ms of which 4 ms to minimize.
[2024-05-30 21:31:28] [INFO ] Deduced a trap composed of 162 places in 361 ms of which 5 ms to minimize.
[2024-05-30 21:31:29] [INFO ] Deduced a trap composed of 146 places in 274 ms of which 3 ms to minimize.
[2024-05-30 21:31:29] [INFO ] Deduced a trap composed of 126 places in 306 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-30 21:31:31] [INFO ] Deduced a trap composed of 135 places in 207 ms of which 4 ms to minimize.
[2024-05-30 21:31:32] [INFO ] Deduced a trap composed of 177 places in 208 ms of which 3 ms to minimize.
[2024-05-30 21:31:32] [INFO ] Deduced a trap composed of 117 places in 236 ms of which 3 ms to minimize.
[2024-05-30 21:31:33] [INFO ] Deduced a trap composed of 123 places in 200 ms of which 3 ms to minimize.
[2024-05-30 21:31:33] [INFO ] Deduced a trap composed of 117 places in 220 ms of which 3 ms to minimize.
[2024-05-30 21:31:33] [INFO ] Deduced a trap composed of 123 places in 204 ms of which 3 ms to minimize.
[2024-05-30 21:31:34] [INFO ] Deduced a trap composed of 123 places in 210 ms of which 5 ms to minimize.
[2024-05-30 21:31:34] [INFO ] Deduced a trap composed of 123 places in 206 ms of which 3 ms to minimize.
[2024-05-30 21:31:34] [INFO ] Deduced a trap composed of 180 places in 168 ms of which 3 ms to minimize.
[2024-05-30 21:31:34] [INFO ] Deduced a trap composed of 123 places in 168 ms of which 3 ms to minimize.
[2024-05-30 21:31:34] [INFO ] Deduced a trap composed of 129 places in 169 ms of which 3 ms to minimize.
[2024-05-30 21:31:35] [INFO ] Deduced a trap composed of 123 places in 180 ms of which 2 ms to minimize.
[2024-05-30 21:31:35] [INFO ] Deduced a trap composed of 123 places in 196 ms of which 2 ms to minimize.
[2024-05-30 21:31:35] [INFO ] Deduced a trap composed of 141 places in 177 ms of which 2 ms to minimize.
[2024-05-30 21:31:35] [INFO ] Deduced a trap composed of 117 places in 329 ms of which 4 ms to minimize.
[2024-05-30 21:31:36] [INFO ] Deduced a trap composed of 141 places in 314 ms of which 3 ms to minimize.
[2024-05-30 21:31:36] [INFO ] Deduced a trap composed of 120 places in 267 ms of which 2 ms to minimize.
[2024-05-30 21:31:36] [INFO ] Deduced a trap composed of 117 places in 259 ms of which 3 ms to minimize.
[2024-05-30 21:31:37] [INFO ] Deduced a trap composed of 123 places in 262 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/1439 variables, and 148 constraints, problems are : Problem set: 0 solved, 1027 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1027 constraints, Known Traps: 96/96 constraints]
After SMT, in 65762ms problems are : Problem set: 0 solved, 1027 unsolved
Search for dead transitions found 0 dead transitions in 65775ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68166 ms. Remains : 410/410 places, 1038/1038 transitions.
RANDOM walk for 400000 steps (29060 resets) in 8335 ms. (47 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-30 21:31:39] [INFO ] Flow matrix only has 1029 transitions (discarded 9 similar events)
[2024-05-30 21:31:39] [INFO ] Invariant cache hit.
[2024-05-30 21:31:39] [INFO ] [Real]Absence check using 55 positive place invariants in 17 ms returned sat
[2024-05-30 21:31:39] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 13 ms returned sat
[2024-05-30 21:31:40] [INFO ] After 338ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-30 21:31:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 21:31:40] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 21:31:40] [INFO ] After 75ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 21:31:40] [INFO ] After 563ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 21:31:40] [INFO ] [Nat]Absence check using 55 positive place invariants in 13 ms returned sat
[2024-05-30 21:31:40] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-30 21:31:40] [INFO ] After 420ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-30 21:31:40] [INFO ] After 105ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 21:31:41] [INFO ] Deduced a trap composed of 162 places in 563 ms of which 3 ms to minimize.
[2024-05-30 21:31:41] [INFO ] Deduced a trap composed of 160 places in 320 ms of which 2 ms to minimize.
[2024-05-30 21:31:42] [INFO ] Deduced a trap composed of 160 places in 323 ms of which 3 ms to minimize.
[2024-05-30 21:31:42] [INFO ] Deduced a trap composed of 164 places in 285 ms of which 2 ms to minimize.
[2024-05-30 21:31:42] [INFO ] Deduced a trap composed of 158 places in 330 ms of which 3 ms to minimize.
[2024-05-30 21:31:43] [INFO ] Deduced a trap composed of 156 places in 285 ms of which 3 ms to minimize.
[2024-05-30 21:31:43] [INFO ] Deduced a trap composed of 164 places in 301 ms of which 3 ms to minimize.
[2024-05-30 21:31:43] [INFO ] Deduced a trap composed of 164 places in 278 ms of which 3 ms to minimize.
[2024-05-30 21:31:44] [INFO ] Deduced a trap composed of 160 places in 304 ms of which 3 ms to minimize.
[2024-05-30 21:31:44] [INFO ] Deduced a trap composed of 160 places in 285 ms of which 3 ms to minimize.
[2024-05-30 21:31:44] [INFO ] Deduced a trap composed of 168 places in 274 ms of which 3 ms to minimize.
[2024-05-30 21:31:45] [INFO ] Deduced a trap composed of 166 places in 319 ms of which 3 ms to minimize.
[2024-05-30 21:31:45] [INFO ] Deduced a trap composed of 162 places in 321 ms of which 3 ms to minimize.
[2024-05-30 21:31:45] [INFO ] Deduced a trap composed of 160 places in 295 ms of which 3 ms to minimize.
[2024-05-30 21:31:46] [INFO ] Deduced a trap composed of 156 places in 261 ms of which 2 ms to minimize.
[2024-05-30 21:31:46] [INFO ] Deduced a trap composed of 162 places in 347 ms of which 3 ms to minimize.
[2024-05-30 21:31:47] [INFO ] Deduced a trap composed of 164 places in 341 ms of which 3 ms to minimize.
[2024-05-30 21:31:47] [INFO ] Deduced a trap composed of 158 places in 311 ms of which 3 ms to minimize.
[2024-05-30 21:31:47] [INFO ] Deduced a trap composed of 164 places in 344 ms of which 3 ms to minimize.
[2024-05-30 21:31:48] [INFO ] Deduced a trap composed of 162 places in 300 ms of which 4 ms to minimize.
[2024-05-30 21:31:48] [INFO ] Deduced a trap composed of 156 places in 329 ms of which 3 ms to minimize.
[2024-05-30 21:31:49] [INFO ] Deduced a trap composed of 160 places in 303 ms of which 3 ms to minimize.
[2024-05-30 21:31:49] [INFO ] Deduced a trap composed of 162 places in 362 ms of which 3 ms to minimize.
[2024-05-30 21:31:49] [INFO ] Deduced a trap composed of 164 places in 322 ms of which 3 ms to minimize.
[2024-05-30 21:31:50] [INFO ] Deduced a trap composed of 160 places in 339 ms of which 3 ms to minimize.
[2024-05-30 21:31:50] [INFO ] Deduced a trap composed of 158 places in 321 ms of which 3 ms to minimize.
[2024-05-30 21:31:51] [INFO ] Deduced a trap composed of 156 places in 331 ms of which 3 ms to minimize.
[2024-05-30 21:31:51] [INFO ] Deduced a trap composed of 160 places in 327 ms of which 3 ms to minimize.
[2024-05-30 21:31:51] [INFO ] Deduced a trap composed of 170 places in 320 ms of which 3 ms to minimize.
[2024-05-30 21:31:52] [INFO ] Deduced a trap composed of 164 places in 298 ms of which 3 ms to minimize.
[2024-05-30 21:31:52] [INFO ] Deduced a trap composed of 166 places in 318 ms of which 3 ms to minimize.
[2024-05-30 21:31:53] [INFO ] Deduced a trap composed of 160 places in 323 ms of which 3 ms to minimize.
[2024-05-30 21:31:53] [INFO ] Deduced a trap composed of 164 places in 325 ms of which 3 ms to minimize.
[2024-05-30 21:31:53] [INFO ] Deduced a trap composed of 162 places in 280 ms of which 3 ms to minimize.
[2024-05-30 21:31:55] [INFO ] Deduced a trap composed of 158 places in 347 ms of which 3 ms to minimize.
[2024-05-30 21:31:55] [INFO ] Deduced a trap composed of 168 places in 327 ms of which 3 ms to minimize.
[2024-05-30 21:31:56] [INFO ] Deduced a trap composed of 164 places in 344 ms of which 5 ms to minimize.
[2024-05-30 21:31:58] [INFO ] Deduced a trap composed of 162 places in 337 ms of which 3 ms to minimize.
[2024-05-30 21:31:58] [INFO ] Deduced a trap composed of 172 places in 308 ms of which 3 ms to minimize.
[2024-05-30 21:31:58] [INFO ] Deduced a trap composed of 160 places in 279 ms of which 3 ms to minimize.
[2024-05-30 21:31:59] [INFO ] Deduced a trap composed of 156 places in 297 ms of which 2 ms to minimize.
[2024-05-30 21:31:59] [INFO ] Deduced a trap composed of 160 places in 304 ms of which 4 ms to minimize.
[2024-05-30 21:32:00] [INFO ] Deduced a trap composed of 164 places in 251 ms of which 3 ms to minimize.
[2024-05-30 21:32:00] [INFO ] Deduced a trap composed of 158 places in 342 ms of which 3 ms to minimize.
[2024-05-30 21:32:00] [INFO ] Deduced a trap composed of 160 places in 346 ms of which 3 ms to minimize.
[2024-05-30 21:32:01] [INFO ] Deduced a trap composed of 158 places in 344 ms of which 3 ms to minimize.
[2024-05-30 21:32:01] [INFO ] Deduced a trap composed of 168 places in 358 ms of which 3 ms to minimize.
[2024-05-30 21:32:02] [INFO ] Deduced a trap composed of 162 places in 335 ms of which 3 ms to minimize.
[2024-05-30 21:32:02] [INFO ] Deduced a trap composed of 162 places in 359 ms of which 3 ms to minimize.
[2024-05-30 21:32:03] [INFO ] Deduced a trap composed of 158 places in 325 ms of which 3 ms to minimize.
[2024-05-30 21:32:03] [INFO ] Deduced a trap composed of 166 places in 317 ms of which 3 ms to minimize.
[2024-05-30 21:32:03] [INFO ] Deduced a trap composed of 166 places in 312 ms of which 3 ms to minimize.
[2024-05-30 21:32:04] [INFO ] Deduced a trap composed of 154 places in 334 ms of which 3 ms to minimize.
[2024-05-30 21:32:05] [INFO ] Deduced a trap composed of 158 places in 328 ms of which 3 ms to minimize.
[2024-05-30 21:32:05] [INFO ] Deduced a trap composed of 166 places in 336 ms of which 3 ms to minimize.
[2024-05-30 21:32:06] [INFO ] Deduced a trap composed of 170 places in 320 ms of which 4 ms to minimize.
[2024-05-30 21:32:07] [INFO ] Deduced a trap composed of 158 places in 300 ms of which 3 ms to minimize.
[2024-05-30 21:32:07] [INFO ] Deduced a trap composed of 164 places in 329 ms of which 3 ms to minimize.
[2024-05-30 21:32:08] [INFO ] Deduced a trap composed of 158 places in 304 ms of which 3 ms to minimize.
[2024-05-30 21:32:08] [INFO ] Deduced a trap composed of 160 places in 283 ms of which 2 ms to minimize.
[2024-05-30 21:32:08] [INFO ] Deduced a trap composed of 162 places in 242 ms of which 2 ms to minimize.
[2024-05-30 21:32:09] [INFO ] Deduced a trap composed of 168 places in 297 ms of which 2 ms to minimize.
[2024-05-30 21:32:09] [INFO ] Deduced a trap composed of 160 places in 264 ms of which 3 ms to minimize.
[2024-05-30 21:32:10] [INFO ] Deduced a trap composed of 162 places in 314 ms of which 3 ms to minimize.
[2024-05-30 21:32:11] [INFO ] Deduced a trap composed of 162 places in 253 ms of which 3 ms to minimize.
[2024-05-30 21:32:12] [INFO ] Deduced a trap composed of 164 places in 299 ms of which 3 ms to minimize.
[2024-05-30 21:32:12] [INFO ] Deduced a trap composed of 162 places in 298 ms of which 3 ms to minimize.
[2024-05-30 21:32:13] [INFO ] Deduced a trap composed of 164 places in 301 ms of which 3 ms to minimize.
[2024-05-30 21:32:13] [INFO ] Deduced a trap composed of 158 places in 305 ms of which 3 ms to minimize.
[2024-05-30 21:32:14] [INFO ] Deduced a trap composed of 160 places in 283 ms of which 2 ms to minimize.
[2024-05-30 21:32:15] [INFO ] Deduced a trap composed of 158 places in 269 ms of which 2 ms to minimize.
[2024-05-30 21:32:17] [INFO ] Deduced a trap composed of 168 places in 332 ms of which 3 ms to minimize.
[2024-05-30 21:32:19] [INFO ] Deduced a trap composed of 158 places in 297 ms of which 3 ms to minimize.
[2024-05-30 21:32:20] [INFO ] Deduced a trap composed of 160 places in 327 ms of which 3 ms to minimize.
[2024-05-30 21:32:20] [INFO ] Deduced a trap composed of 160 places in 343 ms of which 3 ms to minimize.
[2024-05-30 21:32:21] [INFO ] Deduced a trap composed of 164 places in 259 ms of which 2 ms to minimize.
[2024-05-30 21:32:22] [INFO ] Deduced a trap composed of 160 places in 598 ms of which 4 ms to minimize.
[2024-05-30 21:32:22] [INFO ] Deduced a trap composed of 160 places in 462 ms of which 2 ms to minimize.
[2024-05-30 21:32:24] [INFO ] Deduced a trap composed of 160 places in 402 ms of which 3 ms to minimize.
[2024-05-30 21:32:25] [INFO ] Deduced a trap composed of 166 places in 383 ms of which 3 ms to minimize.
[2024-05-30 21:32:26] [INFO ] Deduced a trap composed of 162 places in 529 ms of which 3 ms to minimize.
[2024-05-30 21:32:27] [INFO ] Deduced a trap composed of 172 places in 487 ms of which 4 ms to minimize.
[2024-05-30 21:32:27] [INFO ] Deduced a trap composed of 160 places in 341 ms of which 3 ms to minimize.
[2024-05-30 21:32:28] [INFO ] Deduced a trap composed of 164 places in 470 ms of which 2 ms to minimize.
[2024-05-30 21:32:28] [INFO ] Deduced a trap composed of 166 places in 308 ms of which 3 ms to minimize.
[2024-05-30 21:32:29] [INFO ] Deduced a trap composed of 166 places in 295 ms of which 3 ms to minimize.
[2024-05-30 21:32:29] [INFO ] Deduced a trap composed of 160 places in 244 ms of which 3 ms to minimize.
[2024-05-30 21:32:30] [INFO ] Deduced a trap composed of 158 places in 307 ms of which 2 ms to minimize.
[2024-05-30 21:32:30] [INFO ] Deduced a trap composed of 160 places in 322 ms of which 3 ms to minimize.
[2024-05-30 21:32:31] [INFO ] Deduced a trap composed of 166 places in 334 ms of which 3 ms to minimize.
[2024-05-30 21:32:31] [INFO ] Deduced a trap composed of 164 places in 402 ms of which 3 ms to minimize.
[2024-05-30 21:32:32] [INFO ] Deduced a trap composed of 162 places in 371 ms of which 3 ms to minimize.
[2024-05-30 21:32:32] [INFO ] Deduced a trap composed of 164 places in 347 ms of which 3 ms to minimize.
[2024-05-30 21:32:33] [INFO ] Deduced a trap composed of 160 places in 343 ms of which 4 ms to minimize.
[2024-05-30 21:32:33] [INFO ] Deduced a trap composed of 162 places in 349 ms of which 3 ms to minimize.
[2024-05-30 21:32:33] [INFO ] Deduced a trap composed of 160 places in 349 ms of which 3 ms to minimize.
[2024-05-30 21:32:34] [INFO ] Deduced a trap composed of 156 places in 334 ms of which 3 ms to minimize.
[2024-05-30 21:32:36] [INFO ] Deduced a trap composed of 162 places in 304 ms of which 3 ms to minimize.
[2024-05-30 21:32:36] [INFO ] Deduced a trap composed of 168 places in 318 ms of which 3 ms to minimize.
[2024-05-30 21:32:37] [INFO ] Deduced a trap composed of 166 places in 342 ms of which 5 ms to minimize.
[2024-05-30 21:32:38] [INFO ] Deduced a trap composed of 160 places in 329 ms of which 9 ms to minimize.
[2024-05-30 21:32:39] [INFO ] Deduced a trap composed of 154 places in 325 ms of which 3 ms to minimize.
[2024-05-30 21:32:40] [INFO ] Deduced a trap composed of 160 places in 276 ms of which 2 ms to minimize.
[2024-05-30 21:32:40] [INFO ] Deduced a trap composed of 170 places in 288 ms of which 3 ms to minimize.
[2024-05-30 21:32:41] [INFO ] Deduced a trap composed of 162 places in 363 ms of which 3 ms to minimize.
[2024-05-30 21:32:42] [INFO ] Deduced a trap composed of 158 places in 328 ms of which 3 ms to minimize.
[2024-05-30 21:32:44] [INFO ] Deduced a trap composed of 158 places in 302 ms of which 3 ms to minimize.
[2024-05-30 21:32:48] [INFO ] Deduced a trap composed of 158 places in 324 ms of which 3 ms to minimize.
[2024-05-30 21:33:08] [INFO ] Trap strengthening (SAT) tested/added 108/108 trap constraints in 87819 ms
TRAPS : Iteration 1
[2024-05-30 21:33:09] [INFO ] After 88284ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-30 21:33:09] [INFO ] After 88805ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
RANDOM walk for 4000000 steps (290081 resets) in 37905 ms. (105 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (38917 resets) in 7324 ms. (546 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 6201148 steps, run timeout after 33001 ms. (steps per millisecond=187 ) properties seen :0 out of 1
Probabilistic random walk after 6201148 steps, saw 1077204 distinct states, run finished after 33001 ms. (steps per millisecond=187 ) properties seen :0
[2024-05-30 21:33:53] [INFO ] Flow matrix only has 1029 transitions (discarded 9 similar events)
[2024-05-30 21:33:53] [INFO ] Invariant cache hit.
[2024-05-30 21:33:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/409 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1029/1438 variables, 409/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1438 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1438 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1439 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1439 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1439 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1439/1439 variables, and 473 constraints, problems are : Problem set: 0 solved, 1 unsolved in 486 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 410/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/409 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1029/1438 variables, 409/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1438 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:33:54] [INFO ] Deduced a trap composed of 168 places in 257 ms of which 3 ms to minimize.
[2024-05-30 21:33:54] [INFO ] Deduced a trap composed of 163 places in 241 ms of which 3 ms to minimize.
[2024-05-30 21:33:55] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 3 ms to minimize.
[2024-05-30 21:33:55] [INFO ] Deduced a trap composed of 160 places in 246 ms of which 2 ms to minimize.
[2024-05-30 21:33:55] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 2 ms to minimize.
[2024-05-30 21:33:55] [INFO ] Deduced a trap composed of 170 places in 194 ms of which 3 ms to minimize.
[2024-05-30 21:33:56] [INFO ] Deduced a trap composed of 156 places in 226 ms of which 2 ms to minimize.
[2024-05-30 21:33:56] [INFO ] Deduced a trap composed of 174 places in 195 ms of which 3 ms to minimize.
[2024-05-30 21:33:56] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 3 ms to minimize.
[2024-05-30 21:33:56] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 2 ms to minimize.
[2024-05-30 21:33:57] [INFO ] Deduced a trap composed of 156 places in 188 ms of which 3 ms to minimize.
[2024-05-30 21:33:57] [INFO ] Deduced a trap composed of 171 places in 188 ms of which 3 ms to minimize.
[2024-05-30 21:33:57] [INFO ] Deduced a trap composed of 158 places in 237 ms of which 2 ms to minimize.
[2024-05-30 21:33:58] [INFO ] Deduced a trap composed of 168 places in 270 ms of which 3 ms to minimize.
[2024-05-30 21:33:58] [INFO ] Deduced a trap composed of 168 places in 277 ms of which 3 ms to minimize.
[2024-05-30 21:33:58] [INFO ] Deduced a trap composed of 171 places in 220 ms of which 3 ms to minimize.
[2024-05-30 21:33:58] [INFO ] Deduced a trap composed of 164 places in 238 ms of which 3 ms to minimize.
[2024-05-30 21:33:59] [INFO ] Deduced a trap composed of 158 places in 249 ms of which 3 ms to minimize.
[2024-05-30 21:33:59] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 3 ms to minimize.
[2024-05-30 21:33:59] [INFO ] Deduced a trap composed of 160 places in 243 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1438 variables, 20/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:34:00] [INFO ] Deduced a trap composed of 166 places in 266 ms of which 3 ms to minimize.
[2024-05-30 21:34:00] [INFO ] Deduced a trap composed of 158 places in 249 ms of which 3 ms to minimize.
[2024-05-30 21:34:00] [INFO ] Deduced a trap composed of 164 places in 231 ms of which 3 ms to minimize.
[2024-05-30 21:34:01] [INFO ] Deduced a trap composed of 164 places in 295 ms of which 3 ms to minimize.
[2024-05-30 21:34:02] [INFO ] Deduced a trap composed of 156 places in 299 ms of which 3 ms to minimize.
[2024-05-30 21:34:02] [INFO ] Deduced a trap composed of 160 places in 242 ms of which 3 ms to minimize.
[2024-05-30 21:34:02] [INFO ] Deduced a trap composed of 160 places in 274 ms of which 3 ms to minimize.
[2024-05-30 21:34:03] [INFO ] Deduced a trap composed of 156 places in 199 ms of which 3 ms to minimize.
[2024-05-30 21:34:03] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 2 ms to minimize.
[2024-05-30 21:34:03] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 2 ms to minimize.
[2024-05-30 21:34:04] [INFO ] Deduced a trap composed of 168 places in 231 ms of which 2 ms to minimize.
[2024-05-30 21:34:04] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 2 ms to minimize.
[2024-05-30 21:34:04] [INFO ] Deduced a trap composed of 154 places in 195 ms of which 2 ms to minimize.
[2024-05-30 21:34:05] [INFO ] Deduced a trap composed of 168 places in 244 ms of which 3 ms to minimize.
[2024-05-30 21:34:05] [INFO ] Deduced a trap composed of 164 places in 283 ms of which 3 ms to minimize.
[2024-05-30 21:34:05] [INFO ] Deduced a trap composed of 158 places in 243 ms of which 3 ms to minimize.
[2024-05-30 21:34:06] [INFO ] Deduced a trap composed of 166 places in 240 ms of which 3 ms to minimize.
[2024-05-30 21:34:06] [INFO ] Deduced a trap composed of 166 places in 229 ms of which 2 ms to minimize.
[2024-05-30 21:34:07] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 3 ms to minimize.
[2024-05-30 21:34:07] [INFO ] Deduced a trap composed of 162 places in 414 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1438 variables, 20/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:34:08] [INFO ] Deduced a trap composed of 166 places in 357 ms of which 3 ms to minimize.
[2024-05-30 21:34:08] [INFO ] Deduced a trap composed of 164 places in 303 ms of which 3 ms to minimize.
[2024-05-30 21:34:08] [INFO ] Deduced a trap composed of 178 places in 312 ms of which 3 ms to minimize.
[2024-05-30 21:34:09] [INFO ] Deduced a trap composed of 169 places in 323 ms of which 4 ms to minimize.
[2024-05-30 21:34:09] [INFO ] Deduced a trap composed of 166 places in 336 ms of which 2 ms to minimize.
[2024-05-30 21:34:10] [INFO ] Deduced a trap composed of 166 places in 345 ms of which 2 ms to minimize.
[2024-05-30 21:34:10] [INFO ] Deduced a trap composed of 173 places in 322 ms of which 3 ms to minimize.
[2024-05-30 21:34:10] [INFO ] Deduced a trap composed of 160 places in 274 ms of which 2 ms to minimize.
[2024-05-30 21:34:11] [INFO ] Deduced a trap composed of 171 places in 287 ms of which 3 ms to minimize.
[2024-05-30 21:34:11] [INFO ] Deduced a trap composed of 154 places in 256 ms of which 2 ms to minimize.
[2024-05-30 21:34:11] [INFO ] Deduced a trap composed of 164 places in 256 ms of which 3 ms to minimize.
[2024-05-30 21:34:12] [INFO ] Deduced a trap composed of 166 places in 323 ms of which 3 ms to minimize.
[2024-05-30 21:34:14] [INFO ] Deduced a trap composed of 166 places in 326 ms of which 3 ms to minimize.
[2024-05-30 21:34:14] [INFO ] Deduced a trap composed of 162 places in 316 ms of which 3 ms to minimize.
[2024-05-30 21:34:14] [INFO ] Deduced a trap composed of 162 places in 285 ms of which 3 ms to minimize.
[2024-05-30 21:34:15] [INFO ] Deduced a trap composed of 166 places in 275 ms of which 3 ms to minimize.
[2024-05-30 21:34:15] [INFO ] Deduced a trap composed of 171 places in 295 ms of which 3 ms to minimize.
[2024-05-30 21:34:15] [INFO ] Deduced a trap composed of 158 places in 302 ms of which 3 ms to minimize.
[2024-05-30 21:34:16] [INFO ] Deduced a trap composed of 158 places in 278 ms of which 3 ms to minimize.
[2024-05-30 21:34:16] [INFO ] Deduced a trap composed of 160 places in 314 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1438 variables, 20/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:34:16] [INFO ] Deduced a trap composed of 158 places in 329 ms of which 3 ms to minimize.
[2024-05-30 21:34:17] [INFO ] Deduced a trap composed of 162 places in 331 ms of which 5 ms to minimize.
[2024-05-30 21:34:17] [INFO ] Deduced a trap composed of 162 places in 330 ms of which 3 ms to minimize.
[2024-05-30 21:34:18] [INFO ] Deduced a trap composed of 158 places in 328 ms of which 3 ms to minimize.
[2024-05-30 21:34:18] [INFO ] Deduced a trap composed of 160 places in 264 ms of which 3 ms to minimize.
[2024-05-30 21:34:18] [INFO ] Deduced a trap composed of 169 places in 318 ms of which 3 ms to minimize.
[2024-05-30 21:34:19] [INFO ] Deduced a trap composed of 158 places in 276 ms of which 3 ms to minimize.
[2024-05-30 21:34:19] [INFO ] Deduced a trap composed of 158 places in 311 ms of which 3 ms to minimize.
[2024-05-30 21:34:20] [INFO ] Deduced a trap composed of 173 places in 289 ms of which 3 ms to minimize.
[2024-05-30 21:34:20] [INFO ] Deduced a trap composed of 160 places in 282 ms of which 3 ms to minimize.
[2024-05-30 21:34:20] [INFO ] Deduced a trap composed of 162 places in 265 ms of which 3 ms to minimize.
[2024-05-30 21:34:21] [INFO ] Deduced a trap composed of 177 places in 252 ms of which 2 ms to minimize.
[2024-05-30 21:34:21] [INFO ] Deduced a trap composed of 158 places in 253 ms of which 2 ms to minimize.
[2024-05-30 21:34:21] [INFO ] Deduced a trap composed of 166 places in 251 ms of which 2 ms to minimize.
[2024-05-30 21:34:22] [INFO ] Deduced a trap composed of 168 places in 249 ms of which 2 ms to minimize.
[2024-05-30 21:34:22] [INFO ] Deduced a trap composed of 164 places in 304 ms of which 3 ms to minimize.
[2024-05-30 21:34:22] [INFO ] Deduced a trap composed of 152 places in 251 ms of which 3 ms to minimize.
[2024-05-30 21:34:23] [INFO ] Deduced a trap composed of 164 places in 265 ms of which 3 ms to minimize.
[2024-05-30 21:34:23] [INFO ] Deduced a trap composed of 166 places in 216 ms of which 3 ms to minimize.
[2024-05-30 21:34:23] [INFO ] Deduced a trap composed of 158 places in 213 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1438 variables, 20/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:34:24] [INFO ] Deduced a trap composed of 162 places in 304 ms of which 3 ms to minimize.
[2024-05-30 21:34:24] [INFO ] Deduced a trap composed of 158 places in 289 ms of which 3 ms to minimize.
[2024-05-30 21:34:25] [INFO ] Deduced a trap composed of 162 places in 297 ms of which 3 ms to minimize.
[2024-05-30 21:34:25] [INFO ] Deduced a trap composed of 158 places in 250 ms of which 3 ms to minimize.
[2024-05-30 21:34:25] [INFO ] Deduced a trap composed of 166 places in 245 ms of which 3 ms to minimize.
[2024-05-30 21:34:26] [INFO ] Deduced a trap composed of 171 places in 263 ms of which 2 ms to minimize.
[2024-05-30 21:34:26] [INFO ] Deduced a trap composed of 170 places in 272 ms of which 2 ms to minimize.
[2024-05-30 21:34:26] [INFO ] Deduced a trap composed of 173 places in 280 ms of which 3 ms to minimize.
[2024-05-30 21:34:27] [INFO ] Deduced a trap composed of 156 places in 267 ms of which 3 ms to minimize.
[2024-05-30 21:34:27] [INFO ] Deduced a trap composed of 164 places in 286 ms of which 3 ms to minimize.
[2024-05-30 21:34:27] [INFO ] Deduced a trap composed of 162 places in 294 ms of which 3 ms to minimize.
[2024-05-30 21:34:28] [INFO ] Deduced a trap composed of 162 places in 318 ms of which 3 ms to minimize.
[2024-05-30 21:34:29] [INFO ] Deduced a trap composed of 160 places in 307 ms of which 3 ms to minimize.
[2024-05-30 21:34:29] [INFO ] Deduced a trap composed of 158 places in 329 ms of which 3 ms to minimize.
[2024-05-30 21:34:30] [INFO ] Deduced a trap composed of 158 places in 239 ms of which 3 ms to minimize.
[2024-05-30 21:34:30] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 3 ms to minimize.
[2024-05-30 21:34:31] [INFO ] Deduced a trap composed of 160 places in 291 ms of which 3 ms to minimize.
[2024-05-30 21:34:31] [INFO ] Deduced a trap composed of 160 places in 304 ms of which 2 ms to minimize.
[2024-05-30 21:34:32] [INFO ] Deduced a trap composed of 160 places in 287 ms of which 5 ms to minimize.
[2024-05-30 21:34:32] [INFO ] Deduced a trap composed of 158 places in 267 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1438 variables, 20/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:34:33] [INFO ] Deduced a trap composed of 156 places in 308 ms of which 3 ms to minimize.
[2024-05-30 21:34:33] [INFO ] Deduced a trap composed of 156 places in 321 ms of which 3 ms to minimize.
[2024-05-30 21:34:34] [INFO ] Deduced a trap composed of 160 places in 290 ms of which 3 ms to minimize.
[2024-05-30 21:34:34] [INFO ] Deduced a trap composed of 177 places in 322 ms of which 3 ms to minimize.
[2024-05-30 21:34:34] [INFO ] Deduced a trap composed of 166 places in 250 ms of which 3 ms to minimize.
[2024-05-30 21:34:35] [INFO ] Deduced a trap composed of 166 places in 264 ms of which 2 ms to minimize.
[2024-05-30 21:34:35] [INFO ] Deduced a trap composed of 164 places in 235 ms of which 2 ms to minimize.
[2024-05-30 21:34:35] [INFO ] Deduced a trap composed of 158 places in 229 ms of which 3 ms to minimize.
[2024-05-30 21:34:36] [INFO ] Deduced a trap composed of 169 places in 267 ms of which 2 ms to minimize.
[2024-05-30 21:34:36] [INFO ] Deduced a trap composed of 158 places in 214 ms of which 2 ms to minimize.
[2024-05-30 21:34:36] [INFO ] Deduced a trap composed of 160 places in 248 ms of which 3 ms to minimize.
[2024-05-30 21:34:37] [INFO ] Deduced a trap composed of 175 places in 289 ms of which 3 ms to minimize.
[2024-05-30 21:34:37] [INFO ] Deduced a trap composed of 160 places in 225 ms of which 3 ms to minimize.
[2024-05-30 21:34:37] [INFO ] Deduced a trap composed of 162 places in 274 ms of which 3 ms to minimize.
[2024-05-30 21:34:38] [INFO ] Deduced a trap composed of 160 places in 250 ms of which 3 ms to minimize.
[2024-05-30 21:34:38] [INFO ] Deduced a trap composed of 158 places in 283 ms of which 2 ms to minimize.
[2024-05-30 21:34:38] [INFO ] Deduced a trap composed of 164 places in 240 ms of which 2 ms to minimize.
[2024-05-30 21:34:39] [INFO ] Deduced a trap composed of 160 places in 266 ms of which 3 ms to minimize.
[2024-05-30 21:34:39] [INFO ] Deduced a trap composed of 158 places in 245 ms of which 3 ms to minimize.
[2024-05-30 21:34:40] [INFO ] Deduced a trap composed of 168 places in 257 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1438 variables, 20/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:34:40] [INFO ] Deduced a trap composed of 160 places in 231 ms of which 3 ms to minimize.
[2024-05-30 21:34:40] [INFO ] Deduced a trap composed of 169 places in 247 ms of which 3 ms to minimize.
[2024-05-30 21:34:41] [INFO ] Deduced a trap composed of 158 places in 257 ms of which 4 ms to minimize.
[2024-05-30 21:34:41] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 3 ms to minimize.
[2024-05-30 21:34:41] [INFO ] Deduced a trap composed of 162 places in 261 ms of which 3 ms to minimize.
[2024-05-30 21:34:42] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 2 ms to minimize.
[2024-05-30 21:34:42] [INFO ] Deduced a trap composed of 166 places in 258 ms of which 2 ms to minimize.
[2024-05-30 21:34:42] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 3 ms to minimize.
[2024-05-30 21:34:43] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 2 ms to minimize.
[2024-05-30 21:34:43] [INFO ] Deduced a trap composed of 162 places in 262 ms of which 3 ms to minimize.
[2024-05-30 21:34:43] [INFO ] Deduced a trap composed of 162 places in 285 ms of which 3 ms to minimize.
[2024-05-30 21:34:45] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 2 ms to minimize.
[2024-05-30 21:34:45] [INFO ] Deduced a trap composed of 164 places in 314 ms of which 3 ms to minimize.
[2024-05-30 21:34:46] [INFO ] Deduced a trap composed of 162 places in 356 ms of which 3 ms to minimize.
[2024-05-30 21:34:46] [INFO ] Deduced a trap composed of 156 places in 316 ms of which 3 ms to minimize.
[2024-05-30 21:34:47] [INFO ] Deduced a trap composed of 171 places in 276 ms of which 3 ms to minimize.
[2024-05-30 21:34:48] [INFO ] Deduced a trap composed of 164 places in 299 ms of which 3 ms to minimize.
[2024-05-30 21:34:48] [INFO ] Deduced a trap composed of 160 places in 244 ms of which 3 ms to minimize.
[2024-05-30 21:34:48] [INFO ] Deduced a trap composed of 164 places in 280 ms of which 3 ms to minimize.
[2024-05-30 21:34:50] [INFO ] Deduced a trap composed of 164 places in 283 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1438 variables, 20/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:34:51] [INFO ] Deduced a trap composed of 158 places in 272 ms of which 3 ms to minimize.
[2024-05-30 21:34:51] [INFO ] Deduced a trap composed of 168 places in 250 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1438/1439 variables, and 614 constraints, problems are : Problem set: 0 solved, 1 unsolved in 66351 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 409/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 142/142 constraints]
After SMT, in 66852ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 1038/1038 transitions.
Applied a total of 0 rules in 42 ms. Remains 410 /410 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 410/410 places, 1038/1038 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 1038/1038 transitions.
Applied a total of 0 rules in 34 ms. Remains 410 /410 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
[2024-05-30 21:35:00] [INFO ] Flow matrix only has 1029 transitions (discarded 9 similar events)
[2024-05-30 21:35:00] [INFO ] Invariant cache hit.
[2024-05-30 21:35:01] [INFO ] Implicit Places using invariants in 775 ms returned []
[2024-05-30 21:35:01] [INFO ] Flow matrix only has 1029 transitions (discarded 9 similar events)
[2024-05-30 21:35:01] [INFO ] Invariant cache hit.
[2024-05-30 21:35:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 21:35:03] [INFO ] Implicit Places using invariants and state equation in 1751 ms returned []
Implicit Place search using SMT with State Equation took 2531 ms to find 0 implicit places.
[2024-05-30 21:35:03] [INFO ] Redundant transitions in 12 ms returned []
Running 1027 sub problems to find dead transitions.
[2024-05-30 21:35:03] [INFO ] Flow matrix only has 1029 transitions (discarded 9 similar events)
[2024-05-30 21:35:03] [INFO ] Invariant cache hit.
[2024-05-30 21:35:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-30 21:35:14] [INFO ] Deduced a trap composed of 116 places in 266 ms of which 3 ms to minimize.
[2024-05-30 21:35:15] [INFO ] Deduced a trap composed of 121 places in 216 ms of which 3 ms to minimize.
[2024-05-30 21:35:15] [INFO ] Deduced a trap composed of 126 places in 182 ms of which 3 ms to minimize.
[2024-05-30 21:35:15] [INFO ] Deduced a trap composed of 136 places in 146 ms of which 2 ms to minimize.
[2024-05-30 21:35:15] [INFO ] Deduced a trap composed of 164 places in 185 ms of which 2 ms to minimize.
[2024-05-30 21:35:16] [INFO ] Deduced a trap composed of 121 places in 262 ms of which 3 ms to minimize.
[2024-05-30 21:35:16] [INFO ] Deduced a trap composed of 126 places in 254 ms of which 2 ms to minimize.
[2024-05-30 21:35:16] [INFO ] Deduced a trap composed of 121 places in 242 ms of which 2 ms to minimize.
[2024-05-30 21:35:16] [INFO ] Deduced a trap composed of 111 places in 214 ms of which 2 ms to minimize.
[2024-05-30 21:35:17] [INFO ] Deduced a trap composed of 106 places in 214 ms of which 2 ms to minimize.
[2024-05-30 21:35:17] [INFO ] Deduced a trap composed of 126 places in 167 ms of which 3 ms to minimize.
[2024-05-30 21:35:17] [INFO ] Deduced a trap composed of 126 places in 190 ms of which 2 ms to minimize.
[2024-05-30 21:35:17] [INFO ] Deduced a trap composed of 126 places in 156 ms of which 3 ms to minimize.
[2024-05-30 21:35:17] [INFO ] Deduced a trap composed of 126 places in 178 ms of which 2 ms to minimize.
[2024-05-30 21:35:17] [INFO ] Deduced a trap composed of 170 places in 203 ms of which 9 ms to minimize.
[2024-05-30 21:35:18] [INFO ] Deduced a trap composed of 126 places in 322 ms of which 3 ms to minimize.
[2024-05-30 21:35:18] [INFO ] Deduced a trap composed of 111 places in 163 ms of which 5 ms to minimize.
[2024-05-30 21:35:18] [INFO ] Deduced a trap composed of 121 places in 177 ms of which 3 ms to minimize.
[2024-05-30 21:35:18] [INFO ] Deduced a trap composed of 121 places in 169 ms of which 3 ms to minimize.
[2024-05-30 21:35:19] [INFO ] Deduced a trap composed of 116 places in 212 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-30 21:35:19] [INFO ] Deduced a trap composed of 111 places in 153 ms of which 3 ms to minimize.
[2024-05-30 21:35:19] [INFO ] Deduced a trap composed of 170 places in 160 ms of which 2 ms to minimize.
[2024-05-30 21:35:19] [INFO ] Deduced a trap composed of 136 places in 161 ms of which 2 ms to minimize.
[2024-05-30 21:35:20] [INFO ] Deduced a trap composed of 116 places in 192 ms of which 3 ms to minimize.
[2024-05-30 21:35:20] [INFO ] Deduced a trap composed of 111 places in 171 ms of which 3 ms to minimize.
[2024-05-30 21:35:20] [INFO ] Deduced a trap composed of 111 places in 163 ms of which 3 ms to minimize.
[2024-05-30 21:35:20] [INFO ] Deduced a trap composed of 121 places in 186 ms of which 3 ms to minimize.
[2024-05-30 21:35:20] [INFO ] Deduced a trap composed of 111 places in 207 ms of which 2 ms to minimize.
[2024-05-30 21:35:21] [INFO ] Deduced a trap composed of 136 places in 182 ms of which 3 ms to minimize.
[2024-05-30 21:35:21] [INFO ] Deduced a trap composed of 121 places in 166 ms of which 3 ms to minimize.
[2024-05-30 21:35:21] [INFO ] Deduced a trap composed of 111 places in 168 ms of which 3 ms to minimize.
[2024-05-30 21:35:21] [INFO ] Deduced a trap composed of 116 places in 172 ms of which 3 ms to minimize.
[2024-05-30 21:35:21] [INFO ] Deduced a trap composed of 111 places in 166 ms of which 2 ms to minimize.
[2024-05-30 21:35:22] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 3 ms to minimize.
[2024-05-30 21:35:22] [INFO ] Deduced a trap composed of 162 places in 169 ms of which 3 ms to minimize.
[2024-05-30 21:35:22] [INFO ] Deduced a trap composed of 162 places in 170 ms of which 2 ms to minimize.
[2024-05-30 21:35:22] [INFO ] Deduced a trap composed of 162 places in 169 ms of which 3 ms to minimize.
[2024-05-30 21:35:22] [INFO ] Deduced a trap composed of 166 places in 168 ms of which 3 ms to minimize.
[2024-05-30 21:35:23] [INFO ] Deduced a trap composed of 172 places in 184 ms of which 2 ms to minimize.
[2024-05-30 21:35:23] [INFO ] Deduced a trap composed of 146 places in 198 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 5 (OVERLAPS) 9/409 variables, 9/101 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-30 21:35:35] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 409/1439 variables, and 102 constraints, problems are : Problem set: 0 solved, 1027 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1027/1027 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1027 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 41/93 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-30 21:35:41] [INFO ] Deduced a trap composed of 18 places in 255 ms of which 2 ms to minimize.
[2024-05-30 21:35:43] [INFO ] Deduced a trap composed of 175 places in 313 ms of which 3 ms to minimize.
[2024-05-30 21:35:44] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 2 ms to minimize.
[2024-05-30 21:35:44] [INFO ] Deduced a trap composed of 93 places in 306 ms of which 2 ms to minimize.
[2024-05-30 21:35:44] [INFO ] Deduced a trap composed of 142 places in 283 ms of which 3 ms to minimize.
[2024-05-30 21:35:45] [INFO ] Deduced a trap composed of 151 places in 241 ms of which 3 ms to minimize.
[2024-05-30 21:35:45] [INFO ] Deduced a trap composed of 74 places in 308 ms of which 3 ms to minimize.
[2024-05-30 21:35:45] [INFO ] Deduced a trap composed of 79 places in 274 ms of which 3 ms to minimize.
[2024-05-30 21:35:45] [INFO ] Deduced a trap composed of 72 places in 305 ms of which 3 ms to minimize.
[2024-05-30 21:35:46] [INFO ] Deduced a trap composed of 95 places in 292 ms of which 3 ms to minimize.
[2024-05-30 21:35:46] [INFO ] Deduced a trap composed of 86 places in 294 ms of which 3 ms to minimize.
[2024-05-30 21:35:46] [INFO ] Deduced a trap composed of 79 places in 285 ms of which 2 ms to minimize.
[2024-05-30 21:35:47] [INFO ] Deduced a trap composed of 93 places in 282 ms of which 3 ms to minimize.
[2024-05-30 21:35:47] [INFO ] Deduced a trap composed of 121 places in 292 ms of which 3 ms to minimize.
[2024-05-30 21:35:47] [INFO ] Deduced a trap composed of 180 places in 261 ms of which 2 ms to minimize.
[2024-05-30 21:35:52] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 16/109 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-30 21:35:53] [INFO ] Deduced a trap composed of 141 places in 334 ms of which 3 ms to minimize.
[2024-05-30 21:35:53] [INFO ] Deduced a trap composed of 121 places in 315 ms of which 3 ms to minimize.
[2024-05-30 21:35:54] [INFO ] Deduced a trap composed of 130 places in 291 ms of which 2 ms to minimize.
[2024-05-30 21:35:54] [INFO ] Deduced a trap composed of 116 places in 293 ms of which 3 ms to minimize.
[2024-05-30 21:35:55] [INFO ] Deduced a trap composed of 116 places in 284 ms of which 3 ms to minimize.
[2024-05-30 21:35:55] [INFO ] Deduced a trap composed of 125 places in 283 ms of which 2 ms to minimize.
[2024-05-30 21:35:55] [INFO ] Deduced a trap composed of 126 places in 251 ms of which 2 ms to minimize.
[2024-05-30 21:35:56] [INFO ] Deduced a trap composed of 138 places in 300 ms of which 3 ms to minimize.
[2024-05-30 21:35:57] [INFO ] Deduced a trap composed of 120 places in 329 ms of which 3 ms to minimize.
[2024-05-30 21:35:57] [INFO ] Deduced a trap composed of 141 places in 281 ms of which 3 ms to minimize.
[2024-05-30 21:35:57] [INFO ] Deduced a trap composed of 117 places in 269 ms of which 2 ms to minimize.
[2024-05-30 21:35:58] [INFO ] Deduced a trap composed of 117 places in 306 ms of which 2 ms to minimize.
[2024-05-30 21:35:58] [INFO ] Deduced a trap composed of 150 places in 288 ms of which 2 ms to minimize.
[2024-05-30 21:35:58] [INFO ] Deduced a trap composed of 131 places in 262 ms of which 3 ms to minimize.
[2024-05-30 21:35:58] [INFO ] Deduced a trap composed of 145 places in 278 ms of which 3 ms to minimize.
[2024-05-30 21:35:59] [INFO ] Deduced a trap composed of 126 places in 268 ms of which 3 ms to minimize.
[2024-05-30 21:35:59] [INFO ] Deduced a trap composed of 116 places in 308 ms of which 3 ms to minimize.
[2024-05-30 21:35:59] [INFO ] Deduced a trap composed of 162 places in 247 ms of which 3 ms to minimize.
[2024-05-30 21:36:00] [INFO ] Deduced a trap composed of 146 places in 273 ms of which 2 ms to minimize.
[2024-05-30 21:36:00] [INFO ] Deduced a trap composed of 126 places in 244 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-30 21:36:02] [INFO ] Deduced a trap composed of 135 places in 170 ms of which 2 ms to minimize.
[2024-05-30 21:36:02] [INFO ] Deduced a trap composed of 177 places in 128 ms of which 3 ms to minimize.
[2024-05-30 21:36:02] [INFO ] Deduced a trap composed of 117 places in 182 ms of which 2 ms to minimize.
[2024-05-30 21:36:03] [INFO ] Deduced a trap composed of 123 places in 154 ms of which 2 ms to minimize.
[2024-05-30 21:36:03] [INFO ] Deduced a trap composed of 117 places in 170 ms of which 3 ms to minimize.
[2024-05-30 21:36:03] [INFO ] Deduced a trap composed of 123 places in 191 ms of which 3 ms to minimize.
[2024-05-30 21:36:03] [INFO ] Deduced a trap composed of 123 places in 206 ms of which 3 ms to minimize.
[2024-05-30 21:36:04] [INFO ] Deduced a trap composed of 123 places in 185 ms of which 3 ms to minimize.
[2024-05-30 21:36:04] [INFO ] Deduced a trap composed of 180 places in 156 ms of which 3 ms to minimize.
[2024-05-30 21:36:04] [INFO ] Deduced a trap composed of 123 places in 165 ms of which 2 ms to minimize.
[2024-05-30 21:36:04] [INFO ] Deduced a trap composed of 129 places in 173 ms of which 3 ms to minimize.
[2024-05-30 21:36:04] [INFO ] Deduced a trap composed of 123 places in 153 ms of which 3 ms to minimize.
[2024-05-30 21:36:05] [INFO ] Deduced a trap composed of 123 places in 150 ms of which 2 ms to minimize.
[2024-05-30 21:36:05] [INFO ] Deduced a trap composed of 141 places in 151 ms of which 2 ms to minimize.
[2024-05-30 21:36:05] [INFO ] Deduced a trap composed of 117 places in 299 ms of which 3 ms to minimize.
[2024-05-30 21:36:06] [INFO ] Deduced a trap composed of 141 places in 331 ms of which 3 ms to minimize.
[2024-05-30 21:36:06] [INFO ] Deduced a trap composed of 120 places in 309 ms of which 3 ms to minimize.
[2024-05-30 21:36:06] [INFO ] Deduced a trap composed of 117 places in 323 ms of which 3 ms to minimize.
[2024-05-30 21:36:07] [INFO ] Deduced a trap composed of 123 places in 279 ms of which 3 ms to minimize.
[2024-05-30 21:36:07] [INFO ] Deduced a trap composed of 117 places in 331 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-30 21:36:09] [INFO ] Deduced a trap composed of 177 places in 192 ms of which 3 ms to minimize.
[2024-05-30 21:36:09] [INFO ] Deduced a trap composed of 138 places in 320 ms of which 3 ms to minimize.
SMT process timed out in 66529ms, After SMT, problems are : Problem set: 0 solved, 1027 unsolved
Search for dead transitions found 0 dead transitions in 66539ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69141 ms. Remains : 410/410 places, 1038/1038 transitions.
RANDOM walk for 400000 steps (29037 resets) in 5382 ms. (74 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-30 21:36:11] [INFO ] Flow matrix only has 1029 transitions (discarded 9 similar events)
[2024-05-30 21:36:11] [INFO ] Invariant cache hit.
[2024-05-30 21:36:11] [INFO ] [Real]Absence check using 55 positive place invariants in 17 ms returned sat
[2024-05-30 21:36:11] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-30 21:36:11] [INFO ] After 277ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-30 21:36:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 21:36:11] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 21:36:11] [INFO ] After 56ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 21:36:11] [INFO ] After 468ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 21:36:11] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2024-05-30 21:36:11] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-30 21:36:12] [INFO ] After 262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-30 21:36:12] [INFO ] After 83ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 21:36:12] [INFO ] Deduced a trap composed of 162 places in 281 ms of which 3 ms to minimize.
[2024-05-30 21:36:12] [INFO ] Deduced a trap composed of 160 places in 292 ms of which 2 ms to minimize.
[2024-05-30 21:36:13] [INFO ] Deduced a trap composed of 160 places in 256 ms of which 3 ms to minimize.
[2024-05-30 21:36:13] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 2 ms to minimize.
[2024-05-30 21:36:13] [INFO ] Deduced a trap composed of 158 places in 299 ms of which 2 ms to minimize.
[2024-05-30 21:36:14] [INFO ] Deduced a trap composed of 156 places in 300 ms of which 3 ms to minimize.
[2024-05-30 21:36:14] [INFO ] Deduced a trap composed of 164 places in 283 ms of which 3 ms to minimize.
[2024-05-30 21:36:14] [INFO ] Deduced a trap composed of 164 places in 253 ms of which 4 ms to minimize.
[2024-05-30 21:36:15] [INFO ] Deduced a trap composed of 160 places in 330 ms of which 3 ms to minimize.
[2024-05-30 21:36:15] [INFO ] Deduced a trap composed of 160 places in 333 ms of which 2 ms to minimize.
[2024-05-30 21:36:15] [INFO ] Deduced a trap composed of 168 places in 337 ms of which 3 ms to minimize.
[2024-05-30 21:36:16] [INFO ] Deduced a trap composed of 166 places in 331 ms of which 3 ms to minimize.
[2024-05-30 21:36:16] [INFO ] Deduced a trap composed of 162 places in 285 ms of which 3 ms to minimize.
[2024-05-30 21:36:16] [INFO ] Deduced a trap composed of 160 places in 299 ms of which 3 ms to minimize.
[2024-05-30 21:36:17] [INFO ] Deduced a trap composed of 156 places in 286 ms of which 3 ms to minimize.
[2024-05-30 21:36:17] [INFO ] Deduced a trap composed of 162 places in 264 ms of which 3 ms to minimize.
[2024-05-30 21:36:17] [INFO ] Deduced a trap composed of 164 places in 261 ms of which 2 ms to minimize.
[2024-05-30 21:36:18] [INFO ] Deduced a trap composed of 158 places in 313 ms of which 3 ms to minimize.
[2024-05-30 21:36:18] [INFO ] Deduced a trap composed of 164 places in 319 ms of which 2 ms to minimize.
[2024-05-30 21:36:18] [INFO ] Deduced a trap composed of 162 places in 244 ms of which 3 ms to minimize.
[2024-05-30 21:36:19] [INFO ] Deduced a trap composed of 156 places in 218 ms of which 3 ms to minimize.
[2024-05-30 21:36:19] [INFO ] Deduced a trap composed of 160 places in 235 ms of which 3 ms to minimize.
[2024-05-30 21:36:19] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 3 ms to minimize.
[2024-05-30 21:36:20] [INFO ] Deduced a trap composed of 164 places in 258 ms of which 3 ms to minimize.
[2024-05-30 21:36:20] [INFO ] Deduced a trap composed of 160 places in 230 ms of which 2 ms to minimize.
[2024-05-30 21:36:20] [INFO ] Deduced a trap composed of 158 places in 276 ms of which 2 ms to minimize.
[2024-05-30 21:36:20] [INFO ] Deduced a trap composed of 156 places in 222 ms of which 3 ms to minimize.
[2024-05-30 21:36:21] [INFO ] Deduced a trap composed of 160 places in 291 ms of which 3 ms to minimize.
[2024-05-30 21:36:21] [INFO ] Deduced a trap composed of 170 places in 285 ms of which 2 ms to minimize.
[2024-05-30 21:36:22] [INFO ] Deduced a trap composed of 164 places in 333 ms of which 2 ms to minimize.
[2024-05-30 21:36:22] [INFO ] Deduced a trap composed of 166 places in 313 ms of which 3 ms to minimize.
[2024-05-30 21:36:22] [INFO ] Deduced a trap composed of 160 places in 293 ms of which 3 ms to minimize.
[2024-05-30 21:36:23] [INFO ] Deduced a trap composed of 164 places in 280 ms of which 2 ms to minimize.
[2024-05-30 21:36:23] [INFO ] Deduced a trap composed of 162 places in 302 ms of which 3 ms to minimize.
[2024-05-30 21:36:24] [INFO ] Deduced a trap composed of 158 places in 327 ms of which 3 ms to minimize.
[2024-05-30 21:36:24] [INFO ] Deduced a trap composed of 168 places in 269 ms of which 3 ms to minimize.
[2024-05-30 21:36:25] [INFO ] Deduced a trap composed of 164 places in 275 ms of which 3 ms to minimize.
[2024-05-30 21:36:27] [INFO ] Deduced a trap composed of 162 places in 263 ms of which 2 ms to minimize.
[2024-05-30 21:36:27] [INFO ] Deduced a trap composed of 172 places in 313 ms of which 4 ms to minimize.
[2024-05-30 21:36:28] [INFO ] Deduced a trap composed of 160 places in 297 ms of which 3 ms to minimize.
[2024-05-30 21:36:28] [INFO ] Deduced a trap composed of 156 places in 293 ms of which 3 ms to minimize.
[2024-05-30 21:36:29] [INFO ] Deduced a trap composed of 160 places in 339 ms of which 3 ms to minimize.
[2024-05-30 21:36:29] [INFO ] Deduced a trap composed of 164 places in 339 ms of which 3 ms to minimize.
[2024-05-30 21:36:29] [INFO ] Deduced a trap composed of 158 places in 269 ms of which 3 ms to minimize.
[2024-05-30 21:36:30] [INFO ] Deduced a trap composed of 160 places in 324 ms of which 3 ms to minimize.
[2024-05-30 21:36:30] [INFO ] Deduced a trap composed of 158 places in 260 ms of which 3 ms to minimize.
[2024-05-30 21:36:30] [INFO ] Deduced a trap composed of 168 places in 241 ms of which 2 ms to minimize.
[2024-05-30 21:36:31] [INFO ] Deduced a trap composed of 162 places in 252 ms of which 3 ms to minimize.
[2024-05-30 21:36:31] [INFO ] Deduced a trap composed of 162 places in 241 ms of which 2 ms to minimize.
[2024-05-30 21:36:31] [INFO ] Deduced a trap composed of 158 places in 254 ms of which 2 ms to minimize.
[2024-05-30 21:36:31] [INFO ] Deduced a trap composed of 166 places in 281 ms of which 3 ms to minimize.
[2024-05-30 21:36:32] [INFO ] Deduced a trap composed of 166 places in 334 ms of which 3 ms to minimize.
[2024-05-30 21:36:32] [INFO ] Deduced a trap composed of 154 places in 290 ms of which 3 ms to minimize.
[2024-05-30 21:36:33] [INFO ] Deduced a trap composed of 158 places in 333 ms of which 3 ms to minimize.
[2024-05-30 21:36:34] [INFO ] Deduced a trap composed of 166 places in 284 ms of which 3 ms to minimize.
[2024-05-30 21:36:35] [INFO ] Deduced a trap composed of 170 places in 268 ms of which 2 ms to minimize.
[2024-05-30 21:36:35] [INFO ] Deduced a trap composed of 158 places in 257 ms of which 2 ms to minimize.
[2024-05-30 21:36:35] [INFO ] Deduced a trap composed of 164 places in 242 ms of which 2 ms to minimize.
[2024-05-30 21:36:36] [INFO ] Deduced a trap composed of 158 places in 253 ms of which 2 ms to minimize.
[2024-05-30 21:36:36] [INFO ] Deduced a trap composed of 160 places in 261 ms of which 2 ms to minimize.
[2024-05-30 21:36:36] [INFO ] Deduced a trap composed of 162 places in 243 ms of which 3 ms to minimize.
[2024-05-30 21:36:36] [INFO ] Deduced a trap composed of 168 places in 226 ms of which 2 ms to minimize.
[2024-05-30 21:36:37] [INFO ] Deduced a trap composed of 160 places in 317 ms of which 2 ms to minimize.
[2024-05-30 21:36:38] [INFO ] Deduced a trap composed of 162 places in 289 ms of which 2 ms to minimize.
[2024-05-30 21:36:39] [INFO ] Deduced a trap composed of 162 places in 352 ms of which 3 ms to minimize.
[2024-05-30 21:36:40] [INFO ] Deduced a trap composed of 164 places in 308 ms of which 3 ms to minimize.
[2024-05-30 21:36:40] [INFO ] Deduced a trap composed of 162 places in 305 ms of which 3 ms to minimize.
[2024-05-30 21:36:41] [INFO ] Deduced a trap composed of 164 places in 340 ms of which 3 ms to minimize.
[2024-05-30 21:36:42] [INFO ] Deduced a trap composed of 158 places in 285 ms of which 3 ms to minimize.
[2024-05-30 21:36:42] [INFO ] Deduced a trap composed of 160 places in 336 ms of which 3 ms to minimize.
[2024-05-30 21:36:44] [INFO ] Deduced a trap composed of 158 places in 263 ms of which 2 ms to minimize.
[2024-05-30 21:36:46] [INFO ] Deduced a trap composed of 168 places in 283 ms of which 2 ms to minimize.
[2024-05-30 21:36:48] [INFO ] Deduced a trap composed of 158 places in 336 ms of which 3 ms to minimize.
[2024-05-30 21:36:48] [INFO ] Deduced a trap composed of 160 places in 289 ms of which 3 ms to minimize.
[2024-05-30 21:36:49] [INFO ] Deduced a trap composed of 160 places in 318 ms of which 3 ms to minimize.
[2024-05-30 21:36:50] [INFO ] Deduced a trap composed of 164 places in 313 ms of which 3 ms to minimize.
[2024-05-30 21:36:50] [INFO ] Deduced a trap composed of 160 places in 231 ms of which 3 ms to minimize.
[2024-05-30 21:36:50] [INFO ] Deduced a trap composed of 160 places in 313 ms of which 3 ms to minimize.
[2024-05-30 21:36:52] [INFO ] Deduced a trap composed of 160 places in 378 ms of which 2 ms to minimize.
[2024-05-30 21:36:53] [INFO ] Deduced a trap composed of 166 places in 341 ms of which 3 ms to minimize.
[2024-05-30 21:36:54] [INFO ] Deduced a trap composed of 162 places in 335 ms of which 3 ms to minimize.
[2024-05-30 21:36:54] [INFO ] Deduced a trap composed of 172 places in 324 ms of which 3 ms to minimize.
[2024-05-30 21:36:55] [INFO ] Deduced a trap composed of 160 places in 329 ms of which 3 ms to minimize.
[2024-05-30 21:36:55] [INFO ] Deduced a trap composed of 164 places in 300 ms of which 3 ms to minimize.
[2024-05-30 21:36:56] [INFO ] Deduced a trap composed of 166 places in 291 ms of which 3 ms to minimize.
[2024-05-30 21:36:56] [INFO ] Deduced a trap composed of 166 places in 331 ms of which 3 ms to minimize.
[2024-05-30 21:36:57] [INFO ] Deduced a trap composed of 160 places in 356 ms of which 3 ms to minimize.
[2024-05-30 21:36:57] [INFO ] Deduced a trap composed of 158 places in 307 ms of which 3 ms to minimize.
[2024-05-30 21:36:58] [INFO ] Deduced a trap composed of 160 places in 290 ms of which 3 ms to minimize.
[2024-05-30 21:36:58] [INFO ] Deduced a trap composed of 166 places in 285 ms of which 3 ms to minimize.
[2024-05-30 21:36:59] [INFO ] Deduced a trap composed of 164 places in 332 ms of which 2 ms to minimize.
[2024-05-30 21:36:59] [INFO ] Deduced a trap composed of 162 places in 260 ms of which 2 ms to minimize.
[2024-05-30 21:37:00] [INFO ] Deduced a trap composed of 164 places in 366 ms of which 3 ms to minimize.
[2024-05-30 21:37:00] [INFO ] Deduced a trap composed of 160 places in 368 ms of which 3 ms to minimize.
[2024-05-30 21:37:00] [INFO ] Deduced a trap composed of 162 places in 297 ms of which 3 ms to minimize.
[2024-05-30 21:37:01] [INFO ] Deduced a trap composed of 160 places in 287 ms of which 3 ms to minimize.
[2024-05-30 21:37:01] [INFO ] Deduced a trap composed of 156 places in 260 ms of which 3 ms to minimize.
[2024-05-30 21:37:02] [INFO ] Deduced a trap composed of 162 places in 281 ms of which 3 ms to minimize.
[2024-05-30 21:37:03] [INFO ] Deduced a trap composed of 168 places in 309 ms of which 3 ms to minimize.
[2024-05-30 21:37:04] [INFO ] Deduced a trap composed of 166 places in 348 ms of which 3 ms to minimize.
[2024-05-30 21:37:05] [INFO ] Deduced a trap composed of 160 places in 339 ms of which 3 ms to minimize.
[2024-05-30 21:37:06] [INFO ] Deduced a trap composed of 154 places in 304 ms of which 3 ms to minimize.
[2024-05-30 21:37:06] [INFO ] Deduced a trap composed of 160 places in 261 ms of which 2 ms to minimize.
[2024-05-30 21:37:07] [INFO ] Deduced a trap composed of 170 places in 262 ms of which 2 ms to minimize.
[2024-05-30 21:37:07] [INFO ] Deduced a trap composed of 162 places in 341 ms of which 2 ms to minimize.
[2024-05-30 21:37:08] [INFO ] Deduced a trap composed of 158 places in 342 ms of which 3 ms to minimize.
[2024-05-30 21:37:10] [INFO ] Deduced a trap composed of 158 places in 270 ms of which 3 ms to minimize.
[2024-05-30 21:37:14] [INFO ] Deduced a trap composed of 158 places in 323 ms of which 3 ms to minimize.
[2024-05-30 21:37:34] [INFO ] Trap strengthening (SAT) tested/added 108/108 trap constraints in 82430 ms
TRAPS : Iteration 1
[2024-05-30 21:37:34] [INFO ] After 82812ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-30 21:37:34] [INFO ] After 83165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
RANDOM walk for 40000 steps (2947 resets) in 554 ms. (72 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (391 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 476418 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :0 out of 1
Probabilistic random walk after 476418 steps, saw 77599 distinct states, run finished after 3001 ms. (steps per millisecond=158 ) properties seen :0
[2024-05-30 21:37:38] [INFO ] Flow matrix only has 1029 transitions (discarded 9 similar events)
[2024-05-30 21:37:38] [INFO ] Invariant cache hit.
[2024-05-30 21:37:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/409 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1029/1438 variables, 409/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1438 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1438 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1439 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1439 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1439 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1439/1439 variables, and 473 constraints, problems are : Problem set: 0 solved, 1 unsolved in 452 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 410/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/409 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1029/1438 variables, 409/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1438 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:37:39] [INFO ] Deduced a trap composed of 170 places in 279 ms of which 3 ms to minimize.
[2024-05-30 21:37:39] [INFO ] Deduced a trap composed of 162 places in 266 ms of which 3 ms to minimize.
[2024-05-30 21:37:39] [INFO ] Deduced a trap composed of 173 places in 254 ms of which 3 ms to minimize.
[2024-05-30 21:37:40] [INFO ] Deduced a trap composed of 162 places in 240 ms of which 3 ms to minimize.
[2024-05-30 21:37:40] [INFO ] Deduced a trap composed of 171 places in 251 ms of which 2 ms to minimize.
[2024-05-30 21:37:40] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 3 ms to minimize.
[2024-05-30 21:37:40] [INFO ] Deduced a trap composed of 162 places in 301 ms of which 3 ms to minimize.
[2024-05-30 21:37:41] [INFO ] Deduced a trap composed of 166 places in 254 ms of which 3 ms to minimize.
[2024-05-30 21:37:41] [INFO ] Deduced a trap composed of 162 places in 245 ms of which 2 ms to minimize.
[2024-05-30 21:37:41] [INFO ] Deduced a trap composed of 156 places in 235 ms of which 3 ms to minimize.
[2024-05-30 21:37:42] [INFO ] Deduced a trap composed of 158 places in 223 ms of which 3 ms to minimize.
[2024-05-30 21:37:42] [INFO ] Deduced a trap composed of 156 places in 220 ms of which 2 ms to minimize.
[2024-05-30 21:37:42] [INFO ] Deduced a trap composed of 158 places in 224 ms of which 2 ms to minimize.
[2024-05-30 21:37:42] [INFO ] Deduced a trap composed of 164 places in 239 ms of which 2 ms to minimize.
[2024-05-30 21:37:43] [INFO ] Deduced a trap composed of 160 places in 272 ms of which 2 ms to minimize.
[2024-05-30 21:37:43] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 2 ms to minimize.
[2024-05-30 21:37:43] [INFO ] Deduced a trap composed of 158 places in 218 ms of which 2 ms to minimize.
SMT process timed out in 5502ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 1038/1038 transitions.
Applied a total of 0 rules in 45 ms. Remains 410 /410 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
Running 1027 sub problems to find dead transitions.
[2024-05-30 21:37:43] [INFO ] Flow matrix only has 1029 transitions (discarded 9 similar events)
[2024-05-30 21:37:43] [INFO ] Invariant cache hit.
[2024-05-30 21:37:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-30 21:37:55] [INFO ] Deduced a trap composed of 116 places in 181 ms of which 3 ms to minimize.
[2024-05-30 21:37:55] [INFO ] Deduced a trap composed of 121 places in 166 ms of which 2 ms to minimize.
[2024-05-30 21:37:55] [INFO ] Deduced a trap composed of 126 places in 127 ms of which 2 ms to minimize.
[2024-05-30 21:37:55] [INFO ] Deduced a trap composed of 136 places in 121 ms of which 2 ms to minimize.
[2024-05-30 21:37:55] [INFO ] Deduced a trap composed of 164 places in 154 ms of which 2 ms to minimize.
[2024-05-30 21:37:56] [INFO ] Deduced a trap composed of 121 places in 149 ms of which 3 ms to minimize.
[2024-05-30 21:37:56] [INFO ] Deduced a trap composed of 126 places in 173 ms of which 2 ms to minimize.
[2024-05-30 21:37:56] [INFO ] Deduced a trap composed of 121 places in 140 ms of which 3 ms to minimize.
[2024-05-30 21:37:56] [INFO ] Deduced a trap composed of 111 places in 126 ms of which 2 ms to minimize.
[2024-05-30 21:37:56] [INFO ] Deduced a trap composed of 106 places in 186 ms of which 3 ms to minimize.
[2024-05-30 21:37:56] [INFO ] Deduced a trap composed of 126 places in 141 ms of which 2 ms to minimize.
[2024-05-30 21:37:57] [INFO ] Deduced a trap composed of 126 places in 146 ms of which 2 ms to minimize.
[2024-05-30 21:37:57] [INFO ] Deduced a trap composed of 126 places in 139 ms of which 2 ms to minimize.
[2024-05-30 21:37:57] [INFO ] Deduced a trap composed of 126 places in 171 ms of which 3 ms to minimize.
[2024-05-30 21:37:57] [INFO ] Deduced a trap composed of 170 places in 171 ms of which 5 ms to minimize.
[2024-05-30 21:37:57] [INFO ] Deduced a trap composed of 126 places in 198 ms of which 3 ms to minimize.
[2024-05-30 21:37:58] [INFO ] Deduced a trap composed of 111 places in 207 ms of which 3 ms to minimize.
[2024-05-30 21:37:58] [INFO ] Deduced a trap composed of 121 places in 186 ms of which 2 ms to minimize.
[2024-05-30 21:37:58] [INFO ] Deduced a trap composed of 121 places in 184 ms of which 3 ms to minimize.
[2024-05-30 21:37:58] [INFO ] Deduced a trap composed of 116 places in 159 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-30 21:37:59] [INFO ] Deduced a trap composed of 111 places in 127 ms of which 2 ms to minimize.
[2024-05-30 21:37:59] [INFO ] Deduced a trap composed of 170 places in 137 ms of which 2 ms to minimize.
[2024-05-30 21:37:59] [INFO ] Deduced a trap composed of 136 places in 134 ms of which 3 ms to minimize.
[2024-05-30 21:37:59] [INFO ] Deduced a trap composed of 116 places in 135 ms of which 2 ms to minimize.
[2024-05-30 21:37:59] [INFO ] Deduced a trap composed of 111 places in 129 ms of which 2 ms to minimize.
[2024-05-30 21:37:59] [INFO ] Deduced a trap composed of 111 places in 128 ms of which 2 ms to minimize.
[2024-05-30 21:38:00] [INFO ] Deduced a trap composed of 121 places in 279 ms of which 3 ms to minimize.
[2024-05-30 21:38:00] [INFO ] Deduced a trap composed of 111 places in 135 ms of which 3 ms to minimize.
[2024-05-30 21:38:00] [INFO ] Deduced a trap composed of 136 places in 198 ms of which 3 ms to minimize.
[2024-05-30 21:38:00] [INFO ] Deduced a trap composed of 121 places in 167 ms of which 3 ms to minimize.
[2024-05-30 21:38:00] [INFO ] Deduced a trap composed of 111 places in 162 ms of which 3 ms to minimize.
[2024-05-30 21:38:01] [INFO ] Deduced a trap composed of 116 places in 149 ms of which 2 ms to minimize.
[2024-05-30 21:38:01] [INFO ] Deduced a trap composed of 111 places in 144 ms of which 2 ms to minimize.
[2024-05-30 21:38:01] [INFO ] Deduced a trap composed of 162 places in 146 ms of which 2 ms to minimize.
[2024-05-30 21:38:01] [INFO ] Deduced a trap composed of 162 places in 124 ms of which 2 ms to minimize.
[2024-05-30 21:38:01] [INFO ] Deduced a trap composed of 162 places in 147 ms of which 2 ms to minimize.
[2024-05-30 21:38:01] [INFO ] Deduced a trap composed of 162 places in 146 ms of which 2 ms to minimize.
[2024-05-30 21:38:02] [INFO ] Deduced a trap composed of 166 places in 145 ms of which 2 ms to minimize.
[2024-05-30 21:38:02] [INFO ] Deduced a trap composed of 172 places in 147 ms of which 2 ms to minimize.
[2024-05-30 21:38:02] [INFO ] Deduced a trap composed of 146 places in 146 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
SMT process timed out in 25489ms, After SMT, problems are : Problem set: 0 solved, 1027 unsolved
Search for dead transitions found 0 dead transitions in 25508ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25559 ms. Remains : 410/410 places, 1038/1038 transitions.
RANDOM walk for 40000 steps (2875 resets) in 506 ms. (78 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (394 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 511313 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :0 out of 1
Probabilistic random walk after 511313 steps, saw 83261 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
[2024-05-30 21:38:12] [INFO ] Flow matrix only has 1029 transitions (discarded 9 similar events)
[2024-05-30 21:38:12] [INFO ] Invariant cache hit.
[2024-05-30 21:38:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/409 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1029/1438 variables, 409/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1438 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1438 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1439 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1439 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1439 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1439/1439 variables, and 473 constraints, problems are : Problem set: 0 solved, 1 unsolved in 446 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 410/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/409 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1029/1438 variables, 409/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1438 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:38:13] [INFO ] Deduced a trap composed of 170 places in 250 ms of which 2 ms to minimize.
[2024-05-30 21:38:13] [INFO ] Deduced a trap composed of 162 places in 278 ms of which 3 ms to minimize.
[2024-05-30 21:38:13] [INFO ] Deduced a trap composed of 173 places in 210 ms of which 2 ms to minimize.
[2024-05-30 21:38:14] [INFO ] Deduced a trap composed of 162 places in 257 ms of which 3 ms to minimize.
[2024-05-30 21:38:14] [INFO ] Deduced a trap composed of 171 places in 256 ms of which 3 ms to minimize.
[2024-05-30 21:38:14] [INFO ] Deduced a trap composed of 162 places in 238 ms of which 3 ms to minimize.
[2024-05-30 21:38:15] [INFO ] Deduced a trap composed of 162 places in 250 ms of which 2 ms to minimize.
[2024-05-30 21:38:15] [INFO ] Deduced a trap composed of 166 places in 250 ms of which 3 ms to minimize.
[2024-05-30 21:38:15] [INFO ] Deduced a trap composed of 162 places in 239 ms of which 2 ms to minimize.
[2024-05-30 21:38:15] [INFO ] Deduced a trap composed of 156 places in 217 ms of which 3 ms to minimize.
[2024-05-30 21:38:16] [INFO ] Deduced a trap composed of 158 places in 216 ms of which 2 ms to minimize.
[2024-05-30 21:38:16] [INFO ] Deduced a trap composed of 156 places in 215 ms of which 2 ms to minimize.
[2024-05-30 21:38:16] [INFO ] Deduced a trap composed of 158 places in 227 ms of which 2 ms to minimize.
[2024-05-30 21:38:16] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 2 ms to minimize.
[2024-05-30 21:38:17] [INFO ] Deduced a trap composed of 160 places in 238 ms of which 2 ms to minimize.
[2024-05-30 21:38:17] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 3 ms to minimize.
[2024-05-30 21:38:17] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 2 ms to minimize.
[2024-05-30 21:38:17] [INFO ] Deduced a trap composed of 158 places in 207 ms of which 3 ms to minimize.
[2024-05-30 21:38:18] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 2 ms to minimize.
[2024-05-30 21:38:18] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1438 variables, 20/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:38:18] [INFO ] Deduced a trap composed of 164 places in 246 ms of which 3 ms to minimize.
[2024-05-30 21:38:18] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 2 ms to minimize.
[2024-05-30 21:38:19] [INFO ] Deduced a trap composed of 160 places in 234 ms of which 3 ms to minimize.
[2024-05-30 21:38:19] [INFO ] Deduced a trap composed of 165 places in 236 ms of which 3 ms to minimize.
[2024-05-30 21:38:19] [INFO ] Deduced a trap composed of 162 places in 186 ms of which 2 ms to minimize.
[2024-05-30 21:38:19] [INFO ] Deduced a trap composed of 162 places in 184 ms of which 3 ms to minimize.
[2024-05-30 21:38:20] [INFO ] Deduced a trap composed of 156 places in 254 ms of which 3 ms to minimize.
[2024-05-30 21:38:20] [INFO ] Deduced a trap composed of 166 places in 181 ms of which 3 ms to minimize.
[2024-05-30 21:38:21] [INFO ] Deduced a trap composed of 168 places in 225 ms of which 2 ms to minimize.
[2024-05-30 21:38:21] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 2 ms to minimize.
[2024-05-30 21:38:21] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 2 ms to minimize.
[2024-05-30 21:38:21] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 2 ms to minimize.
[2024-05-30 21:38:22] [INFO ] Deduced a trap composed of 160 places in 221 ms of which 2 ms to minimize.
[2024-05-30 21:38:22] [INFO ] Deduced a trap composed of 166 places in 184 ms of which 2 ms to minimize.
[2024-05-30 21:38:22] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 2 ms to minimize.
[2024-05-30 21:38:22] [INFO ] Deduced a trap composed of 166 places in 191 ms of which 2 ms to minimize.
[2024-05-30 21:38:23] [INFO ] Deduced a trap composed of 166 places in 259 ms of which 3 ms to minimize.
[2024-05-30 21:38:23] [INFO ] Deduced a trap composed of 168 places in 246 ms of which 2 ms to minimize.
[2024-05-30 21:38:23] [INFO ] Deduced a trap composed of 166 places in 271 ms of which 3 ms to minimize.
[2024-05-30 21:38:24] [INFO ] Deduced a trap composed of 166 places in 256 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1438 variables, 20/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:38:24] [INFO ] Deduced a trap composed of 162 places in 258 ms of which 5 ms to minimize.
[2024-05-30 21:38:24] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 2 ms to minimize.
[2024-05-30 21:38:25] [INFO ] Deduced a trap composed of 170 places in 213 ms of which 2 ms to minimize.
[2024-05-30 21:38:25] [INFO ] Deduced a trap composed of 162 places in 262 ms of which 3 ms to minimize.
[2024-05-30 21:38:25] [INFO ] Deduced a trap composed of 158 places in 189 ms of which 2 ms to minimize.
[2024-05-30 21:38:25] [INFO ] Deduced a trap composed of 172 places in 281 ms of which 3 ms to minimize.
[2024-05-30 21:38:26] [INFO ] Deduced a trap composed of 162 places in 247 ms of which 3 ms to minimize.
[2024-05-30 21:38:26] [INFO ] Deduced a trap composed of 175 places in 244 ms of which 2 ms to minimize.
[2024-05-30 21:38:26] [INFO ] Deduced a trap composed of 168 places in 254 ms of which 3 ms to minimize.
[2024-05-30 21:38:27] [INFO ] Deduced a trap composed of 166 places in 248 ms of which 3 ms to minimize.
[2024-05-30 21:38:27] [INFO ] Deduced a trap composed of 166 places in 251 ms of which 2 ms to minimize.
[2024-05-30 21:38:28] [INFO ] Deduced a trap composed of 164 places in 245 ms of which 3 ms to minimize.
[2024-05-30 21:38:28] [INFO ] Deduced a trap composed of 166 places in 267 ms of which 3 ms to minimize.
[2024-05-30 21:38:28] [INFO ] Deduced a trap composed of 162 places in 236 ms of which 2 ms to minimize.
[2024-05-30 21:38:29] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 3 ms to minimize.
[2024-05-30 21:38:29] [INFO ] Deduced a trap composed of 164 places in 231 ms of which 2 ms to minimize.
[2024-05-30 21:38:29] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 2 ms to minimize.
[2024-05-30 21:38:29] [INFO ] Deduced a trap composed of 166 places in 281 ms of which 3 ms to minimize.
[2024-05-30 21:38:30] [INFO ] Deduced a trap composed of 168 places in 329 ms of which 3 ms to minimize.
[2024-05-30 21:38:30] [INFO ] Deduced a trap composed of 166 places in 281 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1438 variables, 20/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:38:31] [INFO ] Deduced a trap composed of 162 places in 296 ms of which 6 ms to minimize.
[2024-05-30 21:38:31] [INFO ] Deduced a trap composed of 169 places in 277 ms of which 3 ms to minimize.
[2024-05-30 21:38:32] [INFO ] Deduced a trap composed of 156 places in 264 ms of which 2 ms to minimize.
[2024-05-30 21:38:32] [INFO ] Deduced a trap composed of 160 places in 241 ms of which 3 ms to minimize.
[2024-05-30 21:38:32] [INFO ] Deduced a trap composed of 170 places in 225 ms of which 3 ms to minimize.
[2024-05-30 21:38:33] [INFO ] Deduced a trap composed of 160 places in 266 ms of which 3 ms to minimize.
[2024-05-30 21:38:34] [INFO ] Deduced a trap composed of 166 places in 292 ms of which 3 ms to minimize.
[2024-05-30 21:38:34] [INFO ] Deduced a trap composed of 162 places in 318 ms of which 3 ms to minimize.
[2024-05-30 21:38:35] [INFO ] Deduced a trap composed of 158 places in 274 ms of which 3 ms to minimize.
[2024-05-30 21:38:36] [INFO ] Deduced a trap composed of 164 places in 365 ms of which 3 ms to minimize.
[2024-05-30 21:38:37] [INFO ] Deduced a trap composed of 164 places in 328 ms of which 2 ms to minimize.
[2024-05-30 21:38:37] [INFO ] Deduced a trap composed of 160 places in 320 ms of which 3 ms to minimize.
[2024-05-30 21:38:38] [INFO ] Deduced a trap composed of 164 places in 311 ms of which 2 ms to minimize.
[2024-05-30 21:38:38] [INFO ] Deduced a trap composed of 158 places in 266 ms of which 2 ms to minimize.
[2024-05-30 21:38:39] [INFO ] Deduced a trap composed of 160 places in 267 ms of which 3 ms to minimize.
[2024-05-30 21:38:39] [INFO ] Deduced a trap composed of 166 places in 307 ms of which 3 ms to minimize.
[2024-05-30 21:38:40] [INFO ] Deduced a trap composed of 158 places in 305 ms of which 3 ms to minimize.
[2024-05-30 21:38:40] [INFO ] Deduced a trap composed of 158 places in 245 ms of which 3 ms to minimize.
[2024-05-30 21:38:41] [INFO ] Deduced a trap composed of 173 places in 266 ms of which 2 ms to minimize.
[2024-05-30 21:38:41] [INFO ] Deduced a trap composed of 160 places in 247 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1438 variables, 20/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:38:42] [INFO ] Deduced a trap composed of 166 places in 307 ms of which 3 ms to minimize.
[2024-05-30 21:38:42] [INFO ] Deduced a trap composed of 173 places in 275 ms of which 3 ms to minimize.
[2024-05-30 21:38:43] [INFO ] Deduced a trap composed of 166 places in 287 ms of which 4 ms to minimize.
[2024-05-30 21:38:43] [INFO ] Deduced a trap composed of 171 places in 276 ms of which 3 ms to minimize.
[2024-05-30 21:38:43] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 3 ms to minimize.
[2024-05-30 21:38:43] [INFO ] Deduced a trap composed of 179 places in 268 ms of which 2 ms to minimize.
[2024-05-30 21:38:44] [INFO ] Deduced a trap composed of 164 places in 235 ms of which 3 ms to minimize.
[2024-05-30 21:38:44] [INFO ] Deduced a trap composed of 160 places in 294 ms of which 3 ms to minimize.
[2024-05-30 21:38:46] [INFO ] Deduced a trap composed of 160 places in 257 ms of which 2 ms to minimize.
[2024-05-30 21:38:46] [INFO ] Deduced a trap composed of 156 places in 254 ms of which 4 ms to minimize.
[2024-05-30 21:38:47] [INFO ] Deduced a trap composed of 168 places in 320 ms of which 3 ms to minimize.
[2024-05-30 21:38:48] [INFO ] Deduced a trap composed of 166 places in 312 ms of which 3 ms to minimize.
[2024-05-30 21:38:48] [INFO ] Deduced a trap composed of 164 places in 310 ms of which 3 ms to minimize.
[2024-05-30 21:38:49] [INFO ] Deduced a trap composed of 162 places in 324 ms of which 3 ms to minimize.
[2024-05-30 21:38:49] [INFO ] Deduced a trap composed of 162 places in 334 ms of which 3 ms to minimize.
[2024-05-30 21:38:50] [INFO ] Deduced a trap composed of 166 places in 287 ms of which 2 ms to minimize.
[2024-05-30 21:38:51] [INFO ] Deduced a trap composed of 156 places in 287 ms of which 3 ms to minimize.
[2024-05-30 21:38:52] [INFO ] Deduced a trap composed of 158 places in 376 ms of which 3 ms to minimize.
[2024-05-30 21:38:52] [INFO ] Deduced a trap composed of 173 places in 248 ms of which 3 ms to minimize.
[2024-05-30 21:38:53] [INFO ] Deduced a trap composed of 162 places in 268 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1438/1439 variables, and 572 constraints, problems are : Problem set: 0 solved, 1 unsolved in 44737 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 409/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 100/100 constraints]
After SMT, in 45205ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 1038/1038 transitions.
Applied a total of 0 rules in 31 ms. Remains 410 /410 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 410/410 places, 1038/1038 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 1038/1038 transitions.
Applied a total of 0 rules in 25 ms. Remains 410 /410 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
[2024-05-30 21:38:57] [INFO ] Flow matrix only has 1029 transitions (discarded 9 similar events)
[2024-05-30 21:38:57] [INFO ] Invariant cache hit.
[2024-05-30 21:38:58] [INFO ] Implicit Places using invariants in 419 ms returned []
[2024-05-30 21:38:58] [INFO ] Flow matrix only has 1029 transitions (discarded 9 similar events)
[2024-05-30 21:38:58] [INFO ] Invariant cache hit.
[2024-05-30 21:38:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 21:38:59] [INFO ] Implicit Places using invariants and state equation in 1666 ms returned []
Implicit Place search using SMT with State Equation took 2087 ms to find 0 implicit places.
[2024-05-30 21:38:59] [INFO ] Redundant transitions in 7 ms returned []
Running 1027 sub problems to find dead transitions.
[2024-05-30 21:38:59] [INFO ] Flow matrix only has 1029 transitions (discarded 9 similar events)
[2024-05-30 21:38:59] [INFO ] Invariant cache hit.
[2024-05-30 21:38:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-30 21:39:12] [INFO ] Deduced a trap composed of 116 places in 147 ms of which 2 ms to minimize.
[2024-05-30 21:39:12] [INFO ] Deduced a trap composed of 121 places in 161 ms of which 2 ms to minimize.
[2024-05-30 21:39:12] [INFO ] Deduced a trap composed of 126 places in 177 ms of which 2 ms to minimize.
[2024-05-30 21:39:12] [INFO ] Deduced a trap composed of 136 places in 187 ms of which 3 ms to minimize.
[2024-05-30 21:39:12] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 3 ms to minimize.
[2024-05-30 21:39:13] [INFO ] Deduced a trap composed of 121 places in 157 ms of which 2 ms to minimize.
[2024-05-30 21:39:13] [INFO ] Deduced a trap composed of 126 places in 154 ms of which 2 ms to minimize.
[2024-05-30 21:39:13] [INFO ] Deduced a trap composed of 121 places in 152 ms of which 2 ms to minimize.
[2024-05-30 21:39:13] [INFO ] Deduced a trap composed of 111 places in 169 ms of which 2 ms to minimize.
[2024-05-30 21:39:13] [INFO ] Deduced a trap composed of 106 places in 165 ms of which 2 ms to minimize.
[2024-05-30 21:39:13] [INFO ] Deduced a trap composed of 126 places in 184 ms of which 3 ms to minimize.
[2024-05-30 21:39:14] [INFO ] Deduced a trap composed of 126 places in 152 ms of which 2 ms to minimize.
[2024-05-30 21:39:14] [INFO ] Deduced a trap composed of 126 places in 151 ms of which 2 ms to minimize.
[2024-05-30 21:39:14] [INFO ] Deduced a trap composed of 126 places in 174 ms of which 2 ms to minimize.
[2024-05-30 21:39:14] [INFO ] Deduced a trap composed of 170 places in 165 ms of which 2 ms to minimize.
[2024-05-30 21:39:14] [INFO ] Deduced a trap composed of 126 places in 189 ms of which 3 ms to minimize.
[2024-05-30 21:39:15] [INFO ] Deduced a trap composed of 111 places in 149 ms of which 2 ms to minimize.
[2024-05-30 21:39:15] [INFO ] Deduced a trap composed of 121 places in 194 ms of which 3 ms to minimize.
[2024-05-30 21:39:15] [INFO ] Deduced a trap composed of 121 places in 164 ms of which 3 ms to minimize.
[2024-05-30 21:39:15] [INFO ] Deduced a trap composed of 116 places in 169 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-30 21:39:16] [INFO ] Deduced a trap composed of 111 places in 163 ms of which 2 ms to minimize.
[2024-05-30 21:39:16] [INFO ] Deduced a trap composed of 170 places in 145 ms of which 2 ms to minimize.
[2024-05-30 21:39:16] [INFO ] Deduced a trap composed of 136 places in 135 ms of which 2 ms to minimize.
[2024-05-30 21:39:16] [INFO ] Deduced a trap composed of 116 places in 157 ms of which 2 ms to minimize.
[2024-05-30 21:39:16] [INFO ] Deduced a trap composed of 111 places in 137 ms of which 3 ms to minimize.
[2024-05-30 21:39:16] [INFO ] Deduced a trap composed of 111 places in 137 ms of which 2 ms to minimize.
[2024-05-30 21:39:17] [INFO ] Deduced a trap composed of 121 places in 154 ms of which 2 ms to minimize.
[2024-05-30 21:39:17] [INFO ] Deduced a trap composed of 111 places in 146 ms of which 2 ms to minimize.
[2024-05-30 21:39:17] [INFO ] Deduced a trap composed of 136 places in 143 ms of which 3 ms to minimize.
[2024-05-30 21:39:17] [INFO ] Deduced a trap composed of 121 places in 145 ms of which 2 ms to minimize.
[2024-05-30 21:39:17] [INFO ] Deduced a trap composed of 111 places in 131 ms of which 2 ms to minimize.
[2024-05-30 21:39:17] [INFO ] Deduced a trap composed of 116 places in 131 ms of which 2 ms to minimize.
[2024-05-30 21:39:17] [INFO ] Deduced a trap composed of 111 places in 130 ms of which 3 ms to minimize.
[2024-05-30 21:39:18] [INFO ] Deduced a trap composed of 162 places in 139 ms of which 2 ms to minimize.
[2024-05-30 21:39:18] [INFO ] Deduced a trap composed of 162 places in 141 ms of which 2 ms to minimize.
[2024-05-30 21:39:18] [INFO ] Deduced a trap composed of 162 places in 129 ms of which 2 ms to minimize.
[2024-05-30 21:39:18] [INFO ] Deduced a trap composed of 162 places in 136 ms of which 2 ms to minimize.
[2024-05-30 21:39:18] [INFO ] Deduced a trap composed of 166 places in 157 ms of which 3 ms to minimize.
[2024-05-30 21:39:18] [INFO ] Deduced a trap composed of 172 places in 138 ms of which 2 ms to minimize.
[2024-05-30 21:39:18] [INFO ] Deduced a trap composed of 146 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 5 (OVERLAPS) 9/409 variables, 9/101 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-30 21:39:30] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 409/1439 variables, and 102 constraints, problems are : Problem set: 0 solved, 1027 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1027/1027 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1027 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 41/93 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-30 21:39:37] [INFO ] Deduced a trap composed of 18 places in 217 ms of which 2 ms to minimize.
[2024-05-30 21:39:40] [INFO ] Deduced a trap composed of 175 places in 321 ms of which 3 ms to minimize.
[2024-05-30 21:39:40] [INFO ] Deduced a trap composed of 162 places in 237 ms of which 2 ms to minimize.
[2024-05-30 21:39:41] [INFO ] Deduced a trap composed of 93 places in 240 ms of which 3 ms to minimize.
[2024-05-30 21:39:41] [INFO ] Deduced a trap composed of 142 places in 244 ms of which 2 ms to minimize.
[2024-05-30 21:39:41] [INFO ] Deduced a trap composed of 151 places in 318 ms of which 3 ms to minimize.
[2024-05-30 21:39:42] [INFO ] Deduced a trap composed of 74 places in 309 ms of which 3 ms to minimize.
[2024-05-30 21:39:42] [INFO ] Deduced a trap composed of 79 places in 279 ms of which 3 ms to minimize.
[2024-05-30 21:39:42] [INFO ] Deduced a trap composed of 72 places in 321 ms of which 2 ms to minimize.
[2024-05-30 21:39:42] [INFO ] Deduced a trap composed of 95 places in 321 ms of which 3 ms to minimize.
[2024-05-30 21:39:43] [INFO ] Deduced a trap composed of 86 places in 298 ms of which 3 ms to minimize.
[2024-05-30 21:39:43] [INFO ] Deduced a trap composed of 79 places in 294 ms of which 2 ms to minimize.
[2024-05-30 21:39:43] [INFO ] Deduced a trap composed of 93 places in 274 ms of which 3 ms to minimize.
[2024-05-30 21:39:44] [INFO ] Deduced a trap composed of 121 places in 256 ms of which 2 ms to minimize.
[2024-05-30 21:39:44] [INFO ] Deduced a trap composed of 180 places in 264 ms of which 2 ms to minimize.
[2024-05-30 21:39:49] [INFO ] Deduced a trap composed of 164 places in 190 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 16/109 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-30 21:39:50] [INFO ] Deduced a trap composed of 141 places in 299 ms of which 3 ms to minimize.
[2024-05-30 21:39:50] [INFO ] Deduced a trap composed of 121 places in 302 ms of which 3 ms to minimize.
[2024-05-30 21:39:51] [INFO ] Deduced a trap composed of 130 places in 431 ms of which 3 ms to minimize.
[2024-05-30 21:39:51] [INFO ] Deduced a trap composed of 116 places in 404 ms of which 2 ms to minimize.
[2024-05-30 21:39:52] [INFO ] Deduced a trap composed of 116 places in 424 ms of which 2 ms to minimize.
[2024-05-30 21:39:52] [INFO ] Deduced a trap composed of 125 places in 392 ms of which 3 ms to minimize.
[2024-05-30 21:39:52] [INFO ] Deduced a trap composed of 126 places in 299 ms of which 2 ms to minimize.
[2024-05-30 21:39:54] [INFO ] Deduced a trap composed of 138 places in 399 ms of which 3 ms to minimize.
[2024-05-30 21:39:54] [INFO ] Deduced a trap composed of 120 places in 323 ms of which 3 ms to minimize.
[2024-05-30 21:39:54] [INFO ] Deduced a trap composed of 141 places in 296 ms of which 3 ms to minimize.
[2024-05-30 21:39:55] [INFO ] Deduced a trap composed of 117 places in 295 ms of which 3 ms to minimize.
[2024-05-30 21:39:55] [INFO ] Deduced a trap composed of 117 places in 460 ms of which 2 ms to minimize.
[2024-05-30 21:39:56] [INFO ] Deduced a trap composed of 150 places in 393 ms of which 3 ms to minimize.
[2024-05-30 21:39:56] [INFO ] Deduced a trap composed of 131 places in 386 ms of which 2 ms to minimize.
[2024-05-30 21:39:57] [INFO ] Deduced a trap composed of 145 places in 424 ms of which 3 ms to minimize.
[2024-05-30 21:39:57] [INFO ] Deduced a trap composed of 126 places in 401 ms of which 2 ms to minimize.
[2024-05-30 21:39:57] [INFO ] Deduced a trap composed of 116 places in 314 ms of which 3 ms to minimize.
[2024-05-30 21:39:58] [INFO ] Deduced a trap composed of 162 places in 323 ms of which 3 ms to minimize.
[2024-05-30 21:39:58] [INFO ] Deduced a trap composed of 146 places in 427 ms of which 2 ms to minimize.
[2024-05-30 21:39:59] [INFO ] Deduced a trap composed of 126 places in 301 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-30 21:40:00] [INFO ] Deduced a trap composed of 135 places in 252 ms of which 3 ms to minimize.
[2024-05-30 21:40:01] [INFO ] Deduced a trap composed of 177 places in 222 ms of which 2 ms to minimize.
[2024-05-30 21:40:01] [INFO ] Deduced a trap composed of 117 places in 246 ms of which 4 ms to minimize.
[2024-05-30 21:40:02] [INFO ] Deduced a trap composed of 123 places in 205 ms of which 3 ms to minimize.
[2024-05-30 21:40:02] [INFO ] Deduced a trap composed of 117 places in 181 ms of which 3 ms to minimize.
[2024-05-30 21:40:02] [INFO ] Deduced a trap composed of 123 places in 205 ms of which 2 ms to minimize.
[2024-05-30 21:40:03] [INFO ] Deduced a trap composed of 123 places in 204 ms of which 2 ms to minimize.
[2024-05-30 21:40:03] [INFO ] Deduced a trap composed of 123 places in 204 ms of which 2 ms to minimize.
[2024-05-30 21:40:03] [INFO ] Deduced a trap composed of 180 places in 205 ms of which 3 ms to minimize.
[2024-05-30 21:40:03] [INFO ] Deduced a trap composed of 123 places in 178 ms of which 3 ms to minimize.
[2024-05-30 21:40:03] [INFO ] Deduced a trap composed of 129 places in 176 ms of which 3 ms to minimize.
[2024-05-30 21:40:04] [INFO ] Deduced a trap composed of 123 places in 176 ms of which 3 ms to minimize.
[2024-05-30 21:40:04] [INFO ] Deduced a trap composed of 123 places in 233 ms of which 2 ms to minimize.
[2024-05-30 21:40:04] [INFO ] Deduced a trap composed of 141 places in 238 ms of which 3 ms to minimize.
[2024-05-30 21:40:05] [INFO ] Deduced a trap composed of 117 places in 456 ms of which 2 ms to minimize.
[2024-05-30 21:40:05] [INFO ] Deduced a trap composed of 141 places in 453 ms of which 3 ms to minimize.
[2024-05-30 21:40:06] [INFO ] Deduced a trap composed of 120 places in 435 ms of which 3 ms to minimize.
SMT process timed out in 66374ms, After SMT, problems are : Problem set: 0 solved, 1027 unsolved
Search for dead transitions found 0 dead transitions in 66383ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68514 ms. Remains : 410/410 places, 1038/1038 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 410 transition count 1029
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 410 transition count 1028
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 409 transition count 1028
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 409 transition count 1027
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 408 transition count 1027
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 22 place count 408 transition count 1018
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 31 place count 399 transition count 1018
Applied a total of 31 rules in 139 ms. Remains 399 /410 variables (removed 11) and now considering 1018/1038 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1018 rows 399 cols
[2024-05-30 21:40:06] [INFO ] Computed 62 invariants in 11 ms
[2024-05-30 21:40:06] [INFO ] [Real]Absence check using 55 positive place invariants in 38 ms returned sat
[2024-05-30 21:40:06] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 21 ms returned sat
[2024-05-30 21:40:06] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 21:40:06] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2024-05-30 21:40:06] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-30 21:40:07] [INFO ] After 343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 21:40:07] [INFO ] Deduced a trap composed of 160 places in 307 ms of which 2 ms to minimize.
[2024-05-30 21:40:07] [INFO ] Deduced a trap composed of 154 places in 294 ms of which 2 ms to minimize.
[2024-05-30 21:40:08] [INFO ] Deduced a trap composed of 156 places in 282 ms of which 2 ms to minimize.
[2024-05-30 21:40:08] [INFO ] Deduced a trap composed of 154 places in 264 ms of which 2 ms to minimize.
[2024-05-30 21:40:08] [INFO ] Deduced a trap composed of 154 places in 258 ms of which 2 ms to minimize.
[2024-05-30 21:40:08] [INFO ] Deduced a trap composed of 158 places in 292 ms of which 2 ms to minimize.
[2024-05-30 21:40:09] [INFO ] Deduced a trap composed of 158 places in 280 ms of which 2 ms to minimize.
[2024-05-30 21:40:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2232 ms
TRAPS : Iteration 1
[2024-05-30 21:40:09] [INFO ] After 2637ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-30 21:40:09] [INFO ] After 2813ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 3153 ms.
Unable to solve all queries for examination QuasiLiveness. Remains :1 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 38 properties from file /home/mcc/execution/QuasiLiveness.xml in 4 ms.
Working with output stream class java.io.PrintStream
Total runtime 728272 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBNT-COL-S10J20

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 48
TRANSITIONS: 38
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 8
COLOR VARS: 26
ARCS: 140
LOADING TIME: 0.252

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 494
TRANSITIONS: 11780
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 111159
UNFOLDING TIME: 1.216

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.432
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 2.211
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 3311
MODEL NAME: /home/mcc/execution/model
494 places, 11780 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J20"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBNT-COL-S10J20, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r298-tajo-171654455200252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J20.tgz
mv PolyORBNT-COL-S10J20 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;