About the Execution of GreatSPN+red for ASLink-PT-04b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 866.760 | 1800000.00 | 3079066.00 | 3409.10 | [undef] | Time out reached |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r012-smll-171620123800043.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ASLink-PT-04b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r012-smll-171620123800043
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 669K May 18 16:42 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 StableMarking
=== Now, execution of the tool begins
BK_START 1716245213020
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-20 22:46:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-20 22:46:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 22:46:56] [INFO ] Load time of PNML (sax parser for PT used): 404 ms
[2024-05-20 22:46:56] [INFO ] Transformed 2034 places.
[2024-05-20 22:46:56] [INFO ] Transformed 2567 transitions.
[2024-05-20 22:46:56] [INFO ] Found NUPN structural information;
[2024-05-20 22:46:56] [INFO ] Parsed PT model containing 2034 places and 2567 transitions and 7875 arcs in 669 ms.
Structural test allowed to assert that 246 places are NOT stable. Took 25 ms.
RANDOM walk for 40000 steps (93 resets) in 5384 ms. (7 steps per ms) remains 637/1788 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 637/637 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 637/637 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 637/637 properties
BEST_FIRST walk for 122 steps (8 resets) in 15 ms. (7 steps per ms) remains 637/637 properties
BEST_FIRST walk for 124 steps (8 resets) in 36 ms. (3 steps per ms) remains 637/637 properties
BEST_FIRST walk for 123 steps (8 resets) in 15 ms. (7 steps per ms) remains 637/637 properties
BEST_FIRST walk for 123 steps (8 resets) in 12 ms. (9 steps per ms) remains 637/637 properties
BEST_FIRST walk for 123 steps (8 resets) in 17 ms. (6 steps per ms) remains 637/637 properties
BEST_FIRST walk for 123 steps (8 resets) in 13 ms. (8 steps per ms) remains 637/637 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 637/637 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 637/637 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 637/637 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 637/637 properties
BEST_FIRST walk for 123 steps (8 resets) in 12 ms. (9 steps per ms) remains 637/637 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 637/637 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 637/637 properties
BEST_FIRST walk for 123 steps (8 resets) in 15 ms. (7 steps per ms) remains 637/637 properties
BEST_FIRST walk for 123 steps (8 resets) in 14 ms. (8 steps per ms) remains 637/637 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 637/637 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 637/637 properties
BEST_FIRST walk for 122 steps (8 resets) in 8 ms. (13 steps per ms) remains 637/637 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 637/637 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 637/637 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 637/637 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 637/637 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 637/637 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 637/637 properties
BEST_FIRST walk for 123 steps (8 resets) in 13 ms. (8 steps per ms) remains 637/637 properties
BEST_FIRST walk for 122 steps (8 resets) in 8 ms. (13 steps per ms) remains 637/637 properties
BEST_FIRST walk for 122 steps (8 resets) in 7 ms. (15 steps per ms) remains 637/637 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 637/637 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 637/637 properties
BEST_FIRST walk for 122 steps (8 resets) in 13 ms. (8 steps per ms) remains 637/637 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 637/637 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 637/637 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 637/637 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 637/637 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 637/637 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 637/637 properties
BEST_FIRST walk for 122 steps (8 resets) in 6 ms. (17 steps per ms) remains 637/637 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 637/637 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 637/637 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 637/637 properties
BEST_FIRST walk for 123 steps (8 resets) in 5 ms. (20 steps per ms) remains 637/637 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 637/637 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 637/637 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 637/637 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 637/637 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 637/637 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 637/637 properties
// Phase 1: matrix 2567 rows 2034 cols
[2024-05-20 22:46:58] [INFO ] Computed 199 invariants in 341 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/637 variables, 637/637 constraints. Problems are: Problem set: 0 solved, 637 unsolved
SMT process timed out in 5999ms, After SMT, problems are : Problem set: 0 solved, 637 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 637 out of 2034 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2034/2034 places, 2567/2567 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 346 transitions
Trivial Post-agglo rules discarded 346 transitions
Performed 346 trivial Post agglomeration. Transition count delta: 346
Iterating post reduction 0 with 346 rules applied. Total rules applied 346 place count 2034 transition count 2221
Reduce places removed 346 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 368 rules applied. Total rules applied 714 place count 1688 transition count 2199
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 720 place count 1682 transition count 2199
Performed 309 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 309 Pre rules applied. Total rules applied 720 place count 1682 transition count 1890
Deduced a syphon composed of 309 places in 9 ms
Ensure Unique test removed 28 places
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 3 with 646 rules applied. Total rules applied 1366 place count 1345 transition count 1890
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 19 rules applied. Total rules applied 1385 place count 1342 transition count 1874
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1401 place count 1326 transition count 1874
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 1401 place count 1326 transition count 1861
Deduced a syphon composed of 13 places in 26 ms
Ensure Unique test removed 13 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 39 rules applied. Total rules applied 1440 place count 1300 transition count 1861
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 1440 place count 1300 transition count 1848
Deduced a syphon composed of 13 places in 26 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 1466 place count 1287 transition count 1848
Discarding 37 places :
Symmetric choice reduction at 5 with 37 rule applications. Total rules 1503 place count 1250 transition count 1811
Iterating global reduction 5 with 37 rules applied. Total rules applied 1540 place count 1250 transition count 1811
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1541 place count 1250 transition count 1810
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 1541 place count 1250 transition count 1801
Deduced a syphon composed of 9 places in 23 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 19 rules applied. Total rules applied 1560 place count 1240 transition count 1801
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1560 place count 1240 transition count 1800
Deduced a syphon composed of 1 places in 23 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 1563 place count 1238 transition count 1800
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1565 place count 1236 transition count 1785
Iterating global reduction 6 with 2 rules applied. Total rules applied 1567 place count 1236 transition count 1785
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1567 place count 1236 transition count 1784
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1569 place count 1235 transition count 1784
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1570 place count 1234 transition count 1776
Iterating global reduction 6 with 1 rules applied. Total rules applied 1571 place count 1234 transition count 1776
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1572 place count 1233 transition count 1768
Iterating global reduction 6 with 1 rules applied. Total rules applied 1573 place count 1233 transition count 1768
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1574 place count 1232 transition count 1760
Iterating global reduction 6 with 1 rules applied. Total rules applied 1575 place count 1232 transition count 1760
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1576 place count 1231 transition count 1752
Iterating global reduction 6 with 1 rules applied. Total rules applied 1577 place count 1231 transition count 1752
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1578 place count 1230 transition count 1744
Iterating global reduction 6 with 1 rules applied. Total rules applied 1579 place count 1230 transition count 1744
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1580 place count 1229 transition count 1736
Iterating global reduction 6 with 1 rules applied. Total rules applied 1581 place count 1229 transition count 1736
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1582 place count 1228 transition count 1728
Iterating global reduction 6 with 1 rules applied. Total rules applied 1583 place count 1228 transition count 1728
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1584 place count 1227 transition count 1720
Iterating global reduction 6 with 1 rules applied. Total rules applied 1585 place count 1227 transition count 1720
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1586 place count 1226 transition count 1712
Iterating global reduction 6 with 1 rules applied. Total rules applied 1587 place count 1226 transition count 1712
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1588 place count 1225 transition count 1704
Iterating global reduction 6 with 1 rules applied. Total rules applied 1589 place count 1225 transition count 1704
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1590 place count 1224 transition count 1696
Iterating global reduction 6 with 1 rules applied. Total rules applied 1591 place count 1224 transition count 1696
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1592 place count 1223 transition count 1688
Iterating global reduction 6 with 1 rules applied. Total rules applied 1593 place count 1223 transition count 1688
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1594 place count 1222 transition count 1680
Iterating global reduction 6 with 1 rules applied. Total rules applied 1595 place count 1222 transition count 1680
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1596 place count 1221 transition count 1672
Iterating global reduction 6 with 1 rules applied. Total rules applied 1597 place count 1221 transition count 1672
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1598 place count 1220 transition count 1664
Iterating global reduction 6 with 1 rules applied. Total rules applied 1599 place count 1220 transition count 1664
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1600 place count 1219 transition count 1656
Iterating global reduction 6 with 1 rules applied. Total rules applied 1601 place count 1219 transition count 1656
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 4 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 6 with 196 rules applied. Total rules applied 1797 place count 1121 transition count 1558
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1799 place count 1120 transition count 1567
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 1804 place count 1120 transition count 1562
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1809 place count 1115 transition count 1562
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1811 place count 1115 transition count 1560
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1813 place count 1113 transition count 1560
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1814 place count 1112 transition count 1559
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 1817 place count 1110 transition count 1558
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1818 place count 1109 transition count 1558
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 3 Pre rules applied. Total rules applied 1818 place count 1109 transition count 1555
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 1824 place count 1106 transition count 1555
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 10 with 1 rules applied. Total rules applied 1825 place count 1105 transition count 1555
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 1829 place count 1103 transition count 1553
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1830 place count 1102 transition count 1552
Iterating global reduction 11 with 1 rules applied. Total rules applied 1831 place count 1102 transition count 1552
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1832 place count 1102 transition count 1551
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1833 place count 1101 transition count 1551
Applied a total of 1833 rules in 2024 ms. Remains 1101 /2034 variables (removed 933) and now considering 1551/2567 (removed 1016) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2046 ms. Remains : 1101/2034 places, 1551/2567 transitions.
RANDOM walk for 3046245 steps (38934 resets) in 120004 ms. (25 steps per ms) remains 385/637 properties
BEST_FIRST walk for 40003 steps (117 resets) in 320 ms. (124 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (105 resets) in 365 ms. (109 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (104 resets) in 459 ms. (86 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (112 resets) in 434 ms. (91 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (117 resets) in 733 ms. (54 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (114 resets) in 669 ms. (59 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (109 resets) in 328 ms. (121 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (119 resets) in 311 ms. (128 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (107 resets) in 319 ms. (125 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40002 steps (112 resets) in 310 ms. (128 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (110 resets) in 324 ms. (123 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (118 resets) in 331 ms. (120 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40002 steps (106 resets) in 321 ms. (124 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40002 steps (112 resets) in 314 ms. (126 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (110 resets) in 318 ms. (125 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (114 resets) in 303 ms. (131 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40002 steps (114 resets) in 315 ms. (126 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40002 steps (113 resets) in 398 ms. (100 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (109 resets) in 491 ms. (81 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (108 resets) in 466 ms. (85 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (113 resets) in 487 ms. (81 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (115 resets) in 346 ms. (115 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (116 resets) in 316 ms. (126 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (108 resets) in 310 ms. (128 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (113 resets) in 304 ms. (131 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40002 steps (109 resets) in 324 ms. (123 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (110 resets) in 326 ms. (122 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (112 resets) in 404 ms. (98 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (108 resets) in 404 ms. (98 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (109 resets) in 395 ms. (101 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40002 steps (108 resets) in 384 ms. (103 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40002 steps (117 resets) in 313 ms. (127 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (109 resets) in 319 ms. (125 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (107 resets) in 330 ms. (120 steps per ms) remains 381/385 properties
BEST_FIRST walk for 40003 steps (105 resets) in 326 ms. (122 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (116 resets) in 287 ms. (138 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40002 steps (114 resets) in 349 ms. (114 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40002 steps (111 resets) in 401 ms. (99 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40001 steps (107 resets) in 395 ms. (101 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (110 resets) in 398 ms. (100 steps per ms) remains 378/381 properties
BEST_FIRST walk for 40002 steps (108 resets) in 372 ms. (107 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40004 steps (122 resets) in 293 ms. (136 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40003 steps (110 resets) in 319 ms. (125 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40004 steps (112 resets) in 320 ms. (124 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40003 steps (118 resets) in 295 ms. (135 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40004 steps (115 resets) in 309 ms. (129 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40002 steps (113 resets) in 310 ms. (128 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40002 steps (108 resets) in 335 ms. (119 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40002 steps (109 resets) in 312 ms. (127 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40003 steps (115 resets) in 305 ms. (130 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40003 steps (112 resets) in 309 ms. (129 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40002 steps (108 resets) in 315 ms. (126 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40004 steps (117 resets) in 351 ms. (113 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40004 steps (116 resets) in 398 ms. (100 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40002 steps (113 resets) in 392 ms. (101 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40004 steps (105 resets) in 425 ms. (93 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40003 steps (115 resets) in 331 ms. (120 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40003 steps (109 resets) in 322 ms. (123 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40004 steps (114 resets) in 306 ms. (130 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40002 steps (114 resets) in 309 ms. (129 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40003 steps (108 resets) in 330 ms. (120 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40004 steps (111 resets) in 320 ms. (124 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40003 steps (113 resets) in 318 ms. (125 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40003 steps (109 resets) in 319 ms. (125 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40001 steps (115 resets) in 303 ms. (131 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40003 steps (112 resets) in 310 ms. (128 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40004 steps (108 resets) in 328 ms. (121 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40004 steps (116 resets) in 293 ms. (136 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40003 steps (109 resets) in 400 ms. (99 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40003 steps (110 resets) in 385 ms. (103 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40003 steps (104 resets) in 410 ms. (97 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40002 steps (108 resets) in 387 ms. (103 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40004 steps (118 resets) in 305 ms. (130 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40003 steps (113 resets) in 314 ms. (126 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40003 steps (107 resets) in 318 ms. (125 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40003 steps (120 resets) in 299 ms. (133 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40003 steps (112 resets) in 304 ms. (131 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40002 steps (120 resets) in 292 ms. (136 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40004 steps (117 resets) in 304 ms. (131 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40002 steps (115 resets) in 309 ms. (129 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40003 steps (111 resets) in 317 ms. (125 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40003 steps (111 resets) in 317 ms. (125 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40004 steps (122 resets) in 299 ms. (133 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40004 steps (101 resets) in 324 ms. (123 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40003 steps (112 resets) in 291 ms. (136 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40002 steps (106 resets) in 327 ms. (121 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40003 steps (115 resets) in 306 ms. (130 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40003 steps (107 resets) in 304 ms. (131 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40004 steps (118 resets) in 311 ms. (128 steps per ms) remains 378/378 properties
// Phase 1: matrix 1551 rows 1101 cols
[2024-05-20 22:47:45] [INFO ] Computed 150 invariants in 131 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 19/397 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (OVERLAPS) 1/398 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 7 (OVERLAPS) 228/626 variables, 33/65 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/626 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 9 (OVERLAPS) 53/679 variables, 12/77 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 679/2652 variables, and 77 constraints, problems are : Problem set: 0 solved, 378 unsolved in 45018 ms.
Refiners :[Positive P Invariants (semi-flows): 31/44 constraints, Generalized P Invariants (flows): 46/106 constraints, State Equation: 0/1101 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 378 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 19/397 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (OVERLAPS) 1/398 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 7 (OVERLAPS) 228/626 variables, 33/65 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-05-20 22:48:43] [INFO ] Deduced a trap composed of 54 places in 354 ms of which 50 ms to minimize.
[2024-05-20 22:48:43] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 2 ms to minimize.
[2024-05-20 22:48:43] [INFO ] Deduced a trap composed of 93 places in 291 ms of which 3 ms to minimize.
[2024-05-20 22:48:44] [INFO ] Deduced a trap composed of 45 places in 202 ms of which 4 ms to minimize.
[2024-05-20 22:48:44] [INFO ] Deduced a trap composed of 95 places in 190 ms of which 4 ms to minimize.
[2024-05-20 22:48:44] [INFO ] Deduced a trap composed of 48 places in 214 ms of which 4 ms to minimize.
[2024-05-20 22:48:45] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-05-20 22:48:46] [INFO ] Deduced a trap composed of 72 places in 223 ms of which 4 ms to minimize.
[2024-05-20 22:48:48] [INFO ] Deduced a trap composed of 24 places in 215 ms of which 4 ms to minimize.
[2024-05-20 22:48:48] [INFO ] Deduced a trap composed of 91 places in 150 ms of which 3 ms to minimize.
[2024-05-20 22:48:48] [INFO ] Deduced a trap composed of 51 places in 169 ms of which 3 ms to minimize.
[2024-05-20 22:48:49] [INFO ] Deduced a trap composed of 71 places in 183 ms of which 3 ms to minimize.
[2024-05-20 22:48:51] [INFO ] Deduced a trap composed of 44 places in 279 ms of which 5 ms to minimize.
[2024-05-20 22:48:52] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 3 ms to minimize.
[2024-05-20 22:48:53] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/626 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/626 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 10 (OVERLAPS) 53/679 variables, 12/92 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/679 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 12 (OVERLAPS) 2/681 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 681/2652 variables, and 94 constraints, problems are : Problem set: 0 solved, 378 unsolved in 45025 ms.
Refiners :[Positive P Invariants (semi-flows): 33/44 constraints, Generalized P Invariants (flows): 46/106 constraints, State Equation: 0/1101 constraints, PredecessorRefiner: 0/378 constraints, Known Traps: 15/15 constraints]
After SMT, in 90439ms problems are : Problem set: 0 solved, 378 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 378 out of 1101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1101/1101 places, 1551/1551 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 1101 transition count 1503
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 1053 transition count 1503
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 96 place count 1053 transition count 1440
Deduced a syphon composed of 63 places in 3 ms
Ensure Unique test removed 4 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 226 place count 986 transition count 1440
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 230 place count 986 transition count 1436
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 234 place count 982 transition count 1436
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 236 place count 980 transition count 1434
Iterating global reduction 4 with 2 rules applied. Total rules applied 238 place count 980 transition count 1434
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 284 place count 956 transition count 1412
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 285 place count 956 transition count 1411
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 286 place count 955 transition count 1411
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 286 place count 955 transition count 1408
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 292 place count 952 transition count 1408
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 293 place count 951 transition count 1408
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 294 place count 950 transition count 1402
Iterating global reduction 7 with 1 rules applied. Total rules applied 295 place count 950 transition count 1402
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 296 place count 949 transition count 1402
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 302 place count 946 transition count 1399
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 304 place count 944 transition count 1397
Iterating global reduction 8 with 2 rules applied. Total rules applied 306 place count 944 transition count 1397
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 307 place count 943 transition count 1396
Iterating global reduction 8 with 1 rules applied. Total rules applied 308 place count 943 transition count 1396
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 309 place count 943 transition count 1395
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 310 place count 943 transition count 1394
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 311 place count 942 transition count 1394
Applied a total of 311 rules in 229 ms. Remains 942 /1101 variables (removed 159) and now considering 1394/1551 (removed 157) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 230 ms. Remains : 942/1101 places, 1394/1551 transitions.
RANDOM walk for 3794263 steps (49054 resets) in 120004 ms. (31 steps per ms) remains 375/378 properties
BEST_FIRST walk for 40004 steps (111 resets) in 316 ms. (126 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (114 resets) in 333 ms. (119 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (115 resets) in 305 ms. (130 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (117 resets) in 311 ms. (128 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (115 resets) in 302 ms. (132 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (119 resets) in 302 ms. (132 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (119 resets) in 305 ms. (130 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (115 resets) in 309 ms. (129 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (115 resets) in 303 ms. (131 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40001 steps (112 resets) in 305 ms. (130 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40002 steps (112 resets) in 324 ms. (123 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (112 resets) in 406 ms. (98 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (114 resets) in 382 ms. (104 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (120 resets) in 366 ms. (109 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (116 resets) in 377 ms. (105 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (118 resets) in 386 ms. (103 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (115 resets) in 382 ms. (104 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (113 resets) in 547 ms. (73 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (121 resets) in 473 ms. (84 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40002 steps (115 resets) in 478 ms. (83 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (121 resets) in 673 ms. (59 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (114 resets) in 546 ms. (73 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (122 resets) in 616 ms. (64 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (126 resets) in 569 ms. (70 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (119 resets) in 589 ms. (67 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (116 resets) in 529 ms. (75 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (110 resets) in 459 ms. (86 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (112 resets) in 517 ms. (77 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (113 resets) in 476 ms. (83 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (109 resets) in 549 ms. (72 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (118 resets) in 518 ms. (77 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40002 steps (116 resets) in 465 ms. (85 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (110 resets) in 654 ms. (61 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (110 resets) in 758 ms. (52 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (115 resets) in 546 ms. (73 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (122 resets) in 438 ms. (91 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (115 resets) in 726 ms. (55 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (120 resets) in 685 ms. (58 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (112 resets) in 646 ms. (61 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (117 resets) in 633 ms. (63 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (111 resets) in 809 ms. (49 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (110 resets) in 599 ms. (66 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40002 steps (118 resets) in 608 ms. (65 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (119 resets) in 489 ms. (81 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (111 resets) in 572 ms. (69 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (115 resets) in 490 ms. (81 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (114 resets) in 656 ms. (60 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (116 resets) in 435 ms. (91 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (120 resets) in 598 ms. (66 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40002 steps (114 resets) in 593 ms. (67 steps per ms) remains 375/375 properties
Interrupted probabilistic random walk after 3499961 steps, run timeout after 111001 ms. (steps per millisecond=31 ) properties seen :33 out of 375
Probabilistic random walk after 3499961 steps, saw 890421 distinct states, run finished after 111016 ms. (steps per millisecond=31 ) properties seen :33
// Phase 1: matrix 1394 rows 942 cols
[2024-05-20 22:51:44] [INFO ] Computed 142 invariants in 30 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (OVERLAPS) 16/358 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 5 (OVERLAPS) 1/359 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 7 (OVERLAPS) 120/479 variables, 23/55 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 9 (OVERLAPS) 35/514 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 11 (OVERLAPS) 2/516 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/516 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 13 (OVERLAPS) 121/637 variables, 19/81 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/637 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 15 (OVERLAPS) 26/663 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/663 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 17 (OVERLAPS) 2/665 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 19 (OVERLAPS) 109/774 variables, 15/102 constraints. Problems are: Problem set: 0 solved, 342 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 (/ 1.0 216.0))
(s1 (/ 13.0 216.0))
(s2 (/ 1.0 216.0))
(s3 (/ 1.0 216.0))
(s4 (/ 1.0 216.0))
(s5 (/ 1.0 216.0))
(s6 (/ 1.0 216.0))
(s7 (/ 1.0 216.0))
(s8 (/ 1.0 216.0))
(s9 (/ 1.0 216.0))
(s10 (/ 1.0 216.0))
(s11 (/ 1.0 216.0))
(s12 (/ 1.0 216.0))
(s13 (/ 1.0 216.0))
(s14 (/ 1.0 216.0))
(s15 (/ 1.0 216.0))
(s16 (/ 1.0 216.0))
(s17 (/ 1.0 216.0))
(s18 (/ 1.0 216.0))
(s19 (/ 1.0 216.0))
(s20 (/ 1.0 216.0))
(s21 (/ 1.0 216.0))
(s22 (/ 1.0 216.0))
(s23 (/ 85.0 108.0))
(s24 (/ 1.0 216.0))
(s25 (/ 1.0 216.0))
(s26 (/ 1.0 216.0))
(s27 (/ 1.0 216.0))
(s28 (/ 1.0 216.0))
(s29 (/ 1.0 216.0))
(s30 (/ 1.0 216.0))
(s31 (/ 1.0 216.0))
(s32 (/ 1.0 216.0))
(s33 (/ 1.0 216.0))
(s34 (/ 1.0 216.0))
(s35 0.0)
(s36 (/ 1.0 216.0))
(s37 (/ 1.0 72.0))
(s38 (/ 1.0 216.0))
(s39 (/ 17.0 18.0))
(s40 (/ 1.0 216.0))
(s41 (/ 1.0 36.0))
(s42 0.0)
(s43 0.0)
(s44 (/ 1.0 216.0))
(s45 (/ 1.0 216.0))
(s46 (/ 1.0 216.0))
(s47 (/ 1.0 216.0))
(s48 (/ 1.0 216.0))
(s49 (/ 23.0 27.0))
(s50 (/ 1.0 216.0))
(s51 (/ 1.0 24.0))
(s52 (/ 1.0 216.0))
(s53 (/ 1.0 216.0))
(s54 (/ 1.0 216.0))
(s55 (/ 1.0 216.0))
(s56 (/ 1.0 216.0))
(s57 (/ 1.0 216.0))
(s58 (/ 1.0 216.0))
(s59 (/ 1.0 216.0))
(s60 (/ 1.0 216.0))
(s61 (/ 1.0 216.0))
(s62 (/ 1.0 216.0))
(s63 (/ 1.0 216.0))
(s64 (/ 1.0 216.0))
(s65 (/ 1.0 216.0))
(s66 (/ 1.0 216.0))
(s67 (/ 1.0 216.0))
(s68 (/ 1.0 216.0))
(s69 (/ 1.0 216.0))
(s70 (/ 1.0 216.0))
(s71 (/ 1.0 216.0))
(s72 (/ 1.0 216.0))
(s73 (/ 179.0 216.0))
(s74 (/ 1.0 216.0))
(s75 (/ 1.0 216.0))
(s76 (/ 1.0 216.0))
(s77 (/ 1.0 216.0))
(s78 (/ 1.0 216.0))
(s79 (/ 1.0 216.0))
(s80 (/ 1.0 216.0))
(s81 (/ 1.0 216.0))
(s82 (/ 1.0 216.0))
(s83 (/ 1.0 216.0))
(s84 (/ 1.0 216.0))
(s85 (/ 1.0 216.0))
(s86 (/ 1.0 216.0))
(s87 (/ 1.0 216.0))
(s88 (/ 1.0 216.0))
(s89 (/ 1.0 216.0))
(s90 (/ 1.0 216.0))
(s91 (/ 1.0 216.0))
(s92 (/ 1.0 216.0))
(s93 (/ 1.0 216.0))
(s94 (/ 1.0 216.0))
(s95 (/ 1.0 216.0))
(s96 (/ 1.0 216.0))
(s97 (/ 1.0 216.0))
(s98 (/ 1.0 216.0))
(s99 (/ 1.0 216.0))
(s100 (/ 1.0 216.0))
(s101 (/ 1.0 216.0))
(s102 (/ 1.0 216.0))
(s103 (/ 1.0 216.0))
(s104 (/ 1.0 216.0))
(s105 (/ 1.0 216.0))
(s106 (/ 1.0 216.0))
(s107 0.0)
(s108 (/ 25.0 27.0))
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 (/ 2.0 27.0))
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 (/ 181.0 216.0))
(s127 (/ 1.0 216.0))
(s128 (/ 1.0 216.0))
(s129 (/ 1.0 216.0))
(s130 (/ 1.0 216.0))
(s131 (/ 1.0 216.0))
(s132 (/ 1.0 216.0))
(s133 (/ 1.0 216.0))
(s134 (/ 1.0 216.0))
(s135 (/ 1.0 216.0))
(s136 (/ 1.0 216.0))
(s137 (/ 1.0 216.0))
(s138 (/ 1.0 216.0))
(s139 (/ 1.0 216.0))
(s140 (/ 1.0 216.0))
(s141 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 774/2336 variables, and 102 constraints, problems are : Problem set: 0 solved, 342 unsolved in 75018 ms.
Refiners :[Positive P Invariants (semi-flows): 32/42 constraints, Generalized P Invariants (flows): 70/100 constraints, State Equation: 0/942 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (OVERLAPS) 16/358 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 5 (OVERLAPS) 1/359 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 7 (OVERLAPS) 120/479 variables, 23/55 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-20 22:53:09] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 3 ms to minimize.
[2024-05-20 22:53:10] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-05-20 22:53:10] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 3 ms to minimize.
[2024-05-20 22:53:11] [INFO ] Deduced a trap composed of 94 places in 196 ms of which 3 ms to minimize.
[2024-05-20 22:53:11] [INFO ] Deduced a trap composed of 48 places in 175 ms of which 3 ms to minimize.
[2024-05-20 22:53:12] [INFO ] Deduced a trap composed of 24 places in 220 ms of which 4 ms to minimize.
[2024-05-20 22:53:13] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 3 ms to minimize.
[2024-05-20 22:53:13] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 2 ms to minimize.
[2024-05-20 22:53:13] [INFO ] Deduced a trap composed of 70 places in 182 ms of which 3 ms to minimize.
[2024-05-20 22:53:14] [INFO ] Deduced a trap composed of 66 places in 184 ms of which 3 ms to minimize.
[2024-05-20 22:53:15] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 4 ms to minimize.
[2024-05-20 22:53:16] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2024-05-20 22:53:17] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 13/68 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 10 (OVERLAPS) 35/514 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/514 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 12 (OVERLAPS) 2/516 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/516 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 14 (OVERLAPS) 121/637 variables, 19/94 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-20 22:53:36] [INFO ] Deduced a trap composed of 34 places in 323 ms of which 5 ms to minimize.
[2024-05-20 22:53:41] [INFO ] Deduced a trap composed of 45 places in 285 ms of which 4 ms to minimize.
[2024-05-20 22:53:41] [INFO ] Deduced a trap composed of 59 places in 279 ms of which 4 ms to minimize.
[2024-05-20 22:53:42] [INFO ] Deduced a trap composed of 59 places in 285 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/637 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-20 22:53:49] [INFO ] Deduced a trap composed of 113 places in 245 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/637 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-20 22:53:55] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 6 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/637 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/637 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 19 (OVERLAPS) 26/663 variables, 4/104 constraints. Problems are: Problem set: 0 solved, 342 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 663/2336 variables, and 104 constraints, problems are : Problem set: 0 solved, 342 unsolved in 75029 ms.
Refiners :[Positive P Invariants (semi-flows): 30/42 constraints, Generalized P Invariants (flows): 55/100 constraints, State Equation: 0/942 constraints, PredecessorRefiner: 0/342 constraints, Known Traps: 19/19 constraints]
After SMT, in 150269ms problems are : Problem set: 0 solved, 342 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 342 out of 942 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 942/942 places, 1394/1394 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 942 transition count 1378
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 926 transition count 1378
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 32 place count 926 transition count 1371
Deduced a syphon composed of 7 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 47 place count 918 transition count 1371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 47 place count 918 transition count 1370
Deduced a syphon composed of 1 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 916 transition count 1370
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 50 place count 916 transition count 1369
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 915 transition count 1369
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 914 transition count 1368
Applied a total of 54 rules in 105 ms. Remains 914 /942 variables (removed 28) and now considering 1368/1394 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 914/942 places, 1368/1394 transitions.
RANDOM walk for 4000000 steps (51832 resets) in 115881 ms. (34 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (109 resets) in 545 ms. (73 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (119 resets) in 529 ms. (75 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (108 resets) in 708 ms. (56 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (120 resets) in 621 ms. (64 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (115 resets) in 626 ms. (63 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (119 resets) in 610 ms. (65 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (112 resets) in 604 ms. (66 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (113 resets) in 754 ms. (52 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (118 resets) in 552 ms. (72 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (116 resets) in 681 ms. (58 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (118 resets) in 697 ms. (57 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (112 resets) in 699 ms. (57 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (113 resets) in 700 ms. (57 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (116 resets) in 743 ms. (53 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (112 resets) in 646 ms. (61 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (117 resets) in 657 ms. (60 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (113 resets) in 583 ms. (68 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (119 resets) in 579 ms. (68 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (120 resets) in 513 ms. (77 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (114 resets) in 661 ms. (60 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (113 resets) in 614 ms. (65 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (110 resets) in 611 ms. (65 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (114 resets) in 584 ms. (68 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (106 resets) in 721 ms. (55 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (116 resets) in 602 ms. (66 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (121 resets) in 536 ms. (74 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (119 resets) in 709 ms. (56 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (116 resets) in 878 ms. (45 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (115 resets) in 748 ms. (53 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (120 resets) in 588 ms. (67 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (111 resets) in 549 ms. (72 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (122 resets) in 513 ms. (77 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (116 resets) in 702 ms. (56 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (122 resets) in 618 ms. (64 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (112 resets) in 618 ms. (64 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (112 resets) in 564 ms. (70 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (113 resets) in 683 ms. (58 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (116 resets) in 669 ms. (59 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (109 resets) in 801 ms. (49 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (114 resets) in 671 ms. (59 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (112 resets) in 684 ms. (58 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (121 resets) in 510 ms. (78 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (114 resets) in 548 ms. (72 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (115 resets) in 575 ms. (69 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (113 resets) in 548 ms. (72 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (123 resets) in 617 ms. (64 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (112 resets) in 682 ms. (58 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (111 resets) in 523 ms. (76 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (116 resets) in 689 ms. (57 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40001 steps (120 resets) in 522 ms. (76 steps per ms) remains 342/342 properties
Interrupted probabilistic random walk after 3010319 steps, run timeout after 114001 ms. (steps per millisecond=26 ) properties seen :0 out of 342
Probabilistic random walk after 3010319 steps, saw 818252 distinct states, run finished after 114002 ms. (steps per millisecond=26 ) properties seen :0
// Phase 1: matrix 1368 rows 914 cols
[2024-05-20 22:56:47] [INFO ] Computed 140 invariants in 17 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (OVERLAPS) 16/358 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 5 (OVERLAPS) 1/359 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 7 (OVERLAPS) 117/476 variables, 23/55 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 9 (OVERLAPS) 25/501 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 11 (OVERLAPS) 2/503 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/503 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 13 (OVERLAPS) 106/609 variables, 17/79 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/609 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 15 (OVERLAPS) 26/635 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/635 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 17 (OVERLAPS) 2/637 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/637 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 19 (OVERLAPS) 109/746 variables, 15/100 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/746 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 21 (OVERLAPS) 60/806 variables, 8/108 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/806 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 23 (OVERLAPS) 13/819 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/819 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 25 (OVERLAPS) 95/914 variables, 30/140 constraints. Problems are: Problem set: 0 solved, 342 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 914/2282 variables, and 140 constraints, problems are : Problem set: 0 solved, 342 unsolved in 90025 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 98/98 constraints, State Equation: 0/914 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (OVERLAPS) 16/358 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 5 (OVERLAPS) 1/359 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 7 (OVERLAPS) 117/476 variables, 23/55 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-20 22:58:27] [INFO ] Deduced a trap composed of 56 places in 139 ms of which 3 ms to minimize.
[2024-05-20 22:58:28] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 3 ms to minimize.
[2024-05-20 22:58:28] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2024-05-20 22:58:29] [INFO ] Deduced a trap composed of 74 places in 365 ms of which 6 ms to minimize.
[2024-05-20 22:58:29] [INFO ] Deduced a trap composed of 56 places in 228 ms of which 4 ms to minimize.
[2024-05-20 22:58:30] [INFO ] Deduced a trap composed of 28 places in 318 ms of which 6 ms to minimize.
[2024-05-20 22:58:30] [INFO ] Deduced a trap composed of 36 places in 213 ms of which 3 ms to minimize.
[2024-05-20 22:58:34] [INFO ] Deduced a trap composed of 36 places in 357 ms of which 6 ms to minimize.
[2024-05-20 22:58:36] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 4 ms to minimize.
[2024-05-20 22:58:38] [INFO ] Deduced a trap composed of 29 places in 457 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-20 22:58:42] [INFO ] Deduced a trap composed of 90 places in 362 ms of which 5 ms to minimize.
[2024-05-20 22:58:42] [INFO ] Deduced a trap composed of 88 places in 219 ms of which 4 ms to minimize.
[2024-05-20 22:58:43] [INFO ] Deduced a trap composed of 87 places in 183 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/476 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 11 (OVERLAPS) 25/501 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/501 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 13 (OVERLAPS) 2/503 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/503 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 15 (OVERLAPS) 106/609 variables, 17/92 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-20 22:59:17] [INFO ] Deduced a trap composed of 58 places in 288 ms of which 5 ms to minimize.
[2024-05-20 22:59:28] [INFO ] Deduced a trap composed of 31 places in 310 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/609 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-20 22:59:30] [INFO ] Deduced a trap composed of 53 places in 542 ms of which 8 ms to minimize.
[2024-05-20 22:59:39] [INFO ] Deduced a trap composed of 79 places in 275 ms of which 7 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/609 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 342 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(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 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(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 1)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(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 1)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 609/2282 variables, and 96 constraints, problems are : Problem set: 0 solved, 342 unsolved in 90027 ms.
Refiners :[Positive P Invariants (semi-flows): 26/42 constraints, Generalized P Invariants (flows): 53/98 constraints, State Equation: 0/914 constraints, PredecessorRefiner: 0/342 constraints, Known Traps: 17/17 constraints]
After SMT, in 180219ms problems are : Problem set: 0 solved, 342 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 342 out of 914 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 914/914 places, 1368/1368 transitions.
Applied a total of 0 rules in 38 ms. Remains 914 /914 variables (removed 0) and now considering 1368/1368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 914/914 places, 1368/1368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 914/914 places, 1368/1368 transitions.
Applied a total of 0 rules in 37 ms. Remains 914 /914 variables (removed 0) and now considering 1368/1368 (removed 0) transitions.
[2024-05-20 22:59:48] [INFO ] Invariant cache hit.
[2024-05-20 22:59:49] [INFO ] Implicit Places using invariants in 1319 ms returned [108, 312, 335, 490, 514, 515, 516, 534, 552, 571, 621, 622, 633, 634, 636, 653, 671, 740, 744, 745, 748, 759, 760, 761, 779, 781, 785, 803, 804, 805, 806, 818, 824, 830, 836, 842, 848, 854, 860, 866, 872, 878]
[2024-05-20 22:59:49] [INFO ] Actually due to overlaps returned [779, 761, 108, 335, 534, 653, 785, 636, 515, 516, 633, 759, 803, 312, 514, 634, 760, 781, 804, 490, 621, 622, 744, 745, 671, 805, 848, 866, 878, 552, 571, 748, 806, 818, 824, 830, 836, 842, 854, 860, 872]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 1341 ms to find 41 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 873/914 places, 1368/1368 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 872 transition count 1296
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 147 place count 800 transition count 1294
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 147 place count 800 transition count 1276
Deduced a syphon composed of 18 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 184 place count 781 transition count 1276
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 196 place count 777 transition count 1268
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 204 place count 769 transition count 1268
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 219 place count 754 transition count 1253
Iterating global reduction 4 with 15 rules applied. Total rules applied 234 place count 754 transition count 1253
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 237 place count 754 transition count 1250
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 237 place count 754 transition count 1249
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 239 place count 753 transition count 1249
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 242 place count 750 transition count 1243
Iterating global reduction 5 with 3 rules applied. Total rules applied 245 place count 750 transition count 1243
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 246 place count 749 transition count 1242
Iterating global reduction 5 with 1 rules applied. Total rules applied 247 place count 749 transition count 1242
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 248 place count 748 transition count 1240
Iterating global reduction 5 with 1 rules applied. Total rules applied 249 place count 748 transition count 1240
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 3 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 311 place count 717 transition count 1209
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 312 place count 716 transition count 1208
Iterating global reduction 5 with 1 rules applied. Total rules applied 313 place count 716 transition count 1208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 314 place count 716 transition count 1207
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 318 place count 714 transition count 1208
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 327 place count 714 transition count 1199
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 337 place count 704 transition count 1199
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 349 place count 704 transition count 1199
Applied a total of 349 rules in 271 ms. Remains 704 /873 variables (removed 169) and now considering 1199/1368 (removed 169) transitions.
// Phase 1: matrix 1199 rows 704 cols
[2024-05-20 22:59:49] [INFO ] Computed 92 invariants in 20 ms
[2024-05-20 22:59:50] [INFO ] Implicit Places using invariants in 808 ms returned [236, 278, 279, 433, 439, 442, 444, 465, 466, 543, 549, 552, 554, 559, 560, 612, 629, 635, 638, 640]
[2024-05-20 22:59:50] [INFO ] Actually due to overlaps returned [278, 465, 559, 279, 466, 560, 433, 439, 444, 543, 549, 554, 629, 635, 640, 236, 612]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 815 ms to find 17 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 687/914 places, 1199/1368 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 675 transition count 1187
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 675 transition count 1187
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 672 transition count 1184
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 672 transition count 1184
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 668 transition count 1180
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 47 place count 668 transition count 1171
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 56 place count 659 transition count 1171
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 659 transition count 1170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 658 transition count 1170
Applied a total of 58 rules in 128 ms. Remains 658 /687 variables (removed 29) and now considering 1170/1199 (removed 29) transitions.
// Phase 1: matrix 1170 rows 658 cols
[2024-05-20 22:59:50] [INFO ] Computed 75 invariants in 17 ms
[2024-05-20 22:59:51] [INFO ] Implicit Places using invariants in 681 ms returned []
[2024-05-20 22:59:51] [INFO ] Invariant cache hit.
[2024-05-20 22:59:53] [INFO ] Implicit Places using invariants and state equation in 1771 ms returned []
Implicit Place search using SMT with State Equation took 2460 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 658/914 places, 1170/1368 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5055 ms. Remains : 658/914 places, 1170/1368 transitions.
RANDOM walk for 4000000 steps (76364 resets) in 113388 ms. (35 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (184 resets) in 510 ms. (78 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (197 resets) in 611 ms. (65 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (196 resets) in 652 ms. (61 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (195 resets) in 556 ms. (71 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (185 resets) in 559 ms. (71 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (193 resets) in 811 ms. (49 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (189 resets) in 623 ms. (64 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (195 resets) in 705 ms. (56 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40001 steps (188 resets) in 766 ms. (52 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (205 resets) in 826 ms. (48 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (183 resets) in 600 ms. (66 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (189 resets) in 616 ms. (64 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (191 resets) in 578 ms. (69 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (198 resets) in 553 ms. (72 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (183 resets) in 740 ms. (53 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (195 resets) in 759 ms. (52 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (191 resets) in 824 ms. (48 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (187 resets) in 650 ms. (61 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40001 steps (198 resets) in 676 ms. (59 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (190 resets) in 771 ms. (51 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (195 resets) in 610 ms. (65 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (179 resets) in 705 ms. (56 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (198 resets) in 647 ms. (61 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (195 resets) in 659 ms. (60 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (186 resets) in 634 ms. (62 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (186 resets) in 633 ms. (63 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (187 resets) in 645 ms. (61 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (200 resets) in 755 ms. (52 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (199 resets) in 689 ms. (57 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (192 resets) in 647 ms. (61 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (183 resets) in 622 ms. (64 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (189 resets) in 816 ms. (48 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (187 resets) in 826 ms. (48 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (189 resets) in 675 ms. (59 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (179 resets) in 776 ms. (51 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (190 resets) in 656 ms. (60 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (191 resets) in 576 ms. (69 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (187 resets) in 656 ms. (60 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (184 resets) in 617 ms. (64 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (197 resets) in 737 ms. (54 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (196 resets) in 589 ms. (67 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (188 resets) in 703 ms. (56 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (193 resets) in 580 ms. (68 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (184 resets) in 602 ms. (66 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (195 resets) in 554 ms. (72 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (186 resets) in 568 ms. (70 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (178 resets) in 700 ms. (57 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (196 resets) in 644 ms. (62 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (204 resets) in 666 ms. (59 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (198 resets) in 664 ms. (60 steps per ms) remains 342/342 properties
Interrupted probabilistic random walk after 4608487 steps, run timeout after 117001 ms. (steps per millisecond=39 ) properties seen :109 out of 342
Probabilistic random walk after 4608487 steps, saw 1073537 distinct states, run finished after 117006 ms. (steps per millisecond=39 ) properties seen :109
[2024-05-20 23:02:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 11/244 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (OVERLAPS) 178/422 variables, 16/42 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (OVERLAPS) 20/442 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 9 (OVERLAPS) 13/455 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 11 (OVERLAPS) 33/488 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 13 (OVERLAPS) 137/625 variables, 17/70 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/625 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 15 (OVERLAPS) 22/647 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/647 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 17 (OVERLAPS) 11/658 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/658 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 19 (OVERLAPS) 1170/1828 variables, 658/733 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1828 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 21 (OVERLAPS) 0/1828 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1828/1828 variables, and 733 constraints, problems are : Problem set: 0 solved, 233 unsolved in 60944 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 658/658 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 11/244 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-20 23:03:32] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-20 23:03:32] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-20 23:03:33] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (OVERLAPS) 178/422 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-20 23:03:36] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 3 ms to minimize.
[2024-05-20 23:03:36] [INFO ] Deduced a trap composed of 61 places in 146 ms of which 6 ms to minimize.
[2024-05-20 23:03:36] [INFO ] Deduced a trap composed of 43 places in 210 ms of which 5 ms to minimize.
[2024-05-20 23:03:36] [INFO ] Deduced a trap composed of 43 places in 253 ms of which 4 ms to minimize.
[2024-05-20 23:03:38] [INFO ] Deduced a trap composed of 53 places in 171 ms of which 2 ms to minimize.
[2024-05-20 23:03:38] [INFO ] Deduced a trap composed of 29 places in 204 ms of which 4 ms to minimize.
[2024-05-20 23:03:39] [INFO ] Deduced a trap composed of 84 places in 215 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-20 23:03:42] [INFO ] Deduced a trap composed of 82 places in 168 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 10 (OVERLAPS) 20/442 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/442 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 12 (OVERLAPS) 13/455 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/455 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 14 (OVERLAPS) 33/488 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-20 23:04:00] [INFO ] Deduced a trap composed of 102 places in 193 ms of which 3 ms to minimize.
[2024-05-20 23:04:02] [INFO ] Deduced a trap composed of 31 places in 269 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/488 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/488 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 17 (OVERLAPS) 137/625 variables, 17/83 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/625 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 19 (OVERLAPS) 22/647 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/647 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 21 (OVERLAPS) 11/658 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-20 23:04:29] [INFO ] Deduced a trap composed of 72 places in 176 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/658 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-20 23:04:40] [INFO ] Deduced a trap composed of 75 places in 244 ms of which 4 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/658 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/658 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 25 (OVERLAPS) 1170/1828 variables, 658/748 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1828 variables, 233/981 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1828/1828 variables, and 981 constraints, problems are : Problem set: 0 solved, 233 unsolved in 105030 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 658/658 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 15/15 constraints]
After SMT, in 166044ms problems are : Problem set: 0 solved, 233 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 233 out of 658 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 658/658 places, 1170/1170 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 658 transition count 1155
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 643 transition count 1155
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 30 place count 643 transition count 1125
Deduced a syphon composed of 30 places in 3 ms
Ensure Unique test removed 3 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 63 rules applied. Total rules applied 93 place count 610 transition count 1125
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 96 place count 610 transition count 1122
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 99 place count 607 transition count 1122
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 101 place count 605 transition count 1120
Iterating global reduction 4 with 2 rules applied. Total rules applied 103 place count 605 transition count 1120
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 123 place count 594 transition count 1111
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 124 place count 594 transition count 1110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 125 place count 593 transition count 1110
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 125 place count 593 transition count 1107
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 131 place count 590 transition count 1107
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 132 place count 589 transition count 1107
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 133 place count 588 transition count 1101
Iterating global reduction 7 with 1 rules applied. Total rules applied 134 place count 588 transition count 1101
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 135 place count 587 transition count 1101
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 141 place count 584 transition count 1098
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 143 place count 582 transition count 1096
Iterating global reduction 8 with 2 rules applied. Total rules applied 145 place count 582 transition count 1096
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 146 place count 581 transition count 1095
Iterating global reduction 8 with 1 rules applied. Total rules applied 147 place count 581 transition count 1095
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 148 place count 581 transition count 1094
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 149 place count 581 transition count 1093
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 151 place count 580 transition count 1092
Applied a total of 151 rules in 172 ms. Remains 580 /658 variables (removed 78) and now considering 1092/1170 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 580/658 places, 1092/1170 transitions.
RANDOM walk for 2985766 steps (58003 resets) in 120004 ms. (24 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (200 resets) in 693 ms. (57 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40001 steps (197 resets) in 664 ms. (60 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (204 resets) in 594 ms. (67 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (190 resets) in 600 ms. (66 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (192 resets) in 679 ms. (58 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (189 resets) in 601 ms. (66 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (198 resets) in 681 ms. (58 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (215 resets) in 722 ms. (55 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40001 steps (201 resets) in 554 ms. (72 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (207 resets) in 653 ms. (61 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (203 resets) in 675 ms. (59 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (209 resets) in 501 ms. (79 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (201 resets) in 588 ms. (67 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (186 resets) in 533 ms. (74 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (193 resets) in 484 ms. (82 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (197 resets) in 698 ms. (57 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (198 resets) in 555 ms. (71 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (202 resets) in 712 ms. (56 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (196 resets) in 626 ms. (63 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (212 resets) in 641 ms. (62 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (206 resets) in 579 ms. (68 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (212 resets) in 494 ms. (80 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (200 resets) in 597 ms. (66 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (200 resets) in 494 ms. (80 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (191 resets) in 656 ms. (60 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (195 resets) in 542 ms. (73 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (204 resets) in 651 ms. (61 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (201 resets) in 633 ms. (63 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (211 resets) in 527 ms. (75 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (211 resets) in 514 ms. (77 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (219 resets) in 371 ms. (107 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (206 resets) in 516 ms. (77 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (200 resets) in 496 ms. (80 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (200 resets) in 518 ms. (77 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (200 resets) in 695 ms. (57 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (209 resets) in 467 ms. (85 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (199 resets) in 470 ms. (84 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (208 resets) in 532 ms. (75 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (208 resets) in 518 ms. (77 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (198 resets) in 541 ms. (73 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (205 resets) in 528 ms. (75 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (197 resets) in 509 ms. (78 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (201 resets) in 537 ms. (74 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (202 resets) in 510 ms. (78 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (199 resets) in 488 ms. (81 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (203 resets) in 485 ms. (82 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (218 resets) in 517 ms. (77 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (209 resets) in 525 ms. (76 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (200 resets) in 506 ms. (78 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (194 resets) in 479 ms. (83 steps per ms) remains 233/233 properties
Interrupted probabilistic random walk after 3379990 steps, run timeout after 117001 ms. (steps per millisecond=28 ) properties seen :38 out of 233
Probabilistic random walk after 3379990 steps, saw 1195074 distinct states, run finished after 117003 ms. (steps per millisecond=28 ) properties seen :38
// Phase 1: matrix 1092 rows 580 cols
[2024-05-20 23:07:51] [INFO ] Computed 68 invariants in 17 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 11/206 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 125/331 variables, 13/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 15/346 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 151/497 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 11 (OVERLAPS) 48/545 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/545 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 13 (OVERLAPS) 35/580 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/580 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 15 (OVERLAPS) 1092/1672 variables, 580/648 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1672 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 17 (OVERLAPS) 0/1672 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1672/1672 variables, and 648 constraints, problems are : Problem set: 0 solved, 195 unsolved in 41125 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 11/206 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-20 23:08:34] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-20 23:08:34] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-20 23:08:35] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 125/331 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-20 23:08:37] [INFO ] Deduced a trap composed of 54 places in 167 ms of which 3 ms to minimize.
[2024-05-20 23:08:37] [INFO ] Deduced a trap composed of 61 places in 157 ms of which 3 ms to minimize.
[2024-05-20 23:08:39] [INFO ] Deduced a trap composed of 28 places in 210 ms of which 4 ms to minimize.
[2024-05-20 23:08:39] [INFO ] Deduced a trap composed of 63 places in 181 ms of which 3 ms to minimize.
[2024-05-20 23:08:40] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 2 ms to minimize.
[2024-05-20 23:08:40] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 2 ms to minimize.
[2024-05-20 23:08:41] [INFO ] Deduced a trap composed of 36 places in 282 ms of which 4 ms to minimize.
[2024-05-20 23:08:41] [INFO ] Deduced a trap composed of 65 places in 188 ms of which 3 ms to minimize.
[2024-05-20 23:08:41] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-20 23:08:42] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/331 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 15/346 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 12 (OVERLAPS) 151/497 variables, 14/67 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/497 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 14 (OVERLAPS) 48/545 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/545 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 16 (OVERLAPS) 35/580 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-20 23:08:59] [INFO ] Deduced a trap composed of 58 places in 333 ms of which 4 ms to minimize.
[2024-05-20 23:09:02] [INFO ] Deduced a trap composed of 61 places in 268 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/580 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/580 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 19 (OVERLAPS) 1092/1672 variables, 580/663 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1672 variables, 195/858 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1672/1672 variables, and 858 constraints, problems are : Problem set: 0 solved, 195 unsolved in 120020 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 15/15 constraints]
After SMT, in 161210ms problems are : Problem set: 0 solved, 195 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 195 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1092/1092 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 580 transition count 1074
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 562 transition count 1074
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 36 place count 562 transition count 1066
Deduced a syphon composed of 8 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 53 place count 553 transition count 1066
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 53 place count 553 transition count 1065
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 551 transition count 1065
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 56 place count 551 transition count 1064
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 550 transition count 1064
Applied a total of 58 rules in 48 ms. Remains 550 /580 variables (removed 30) and now considering 1064/1092 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 550/580 places, 1064/1092 transitions.
RANDOM walk for 2586061 steps (50174 resets) in 120004 ms. (21 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (206 resets) in 449 ms. (88 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (212 resets) in 468 ms. (85 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40001 steps (200 resets) in 517 ms. (77 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (199 resets) in 486 ms. (82 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (201 resets) in 476 ms. (83 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (203 resets) in 492 ms. (81 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (193 resets) in 584 ms. (68 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (208 resets) in 522 ms. (76 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (197 resets) in 520 ms. (76 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (210 resets) in 457 ms. (87 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (199 resets) in 555 ms. (71 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (203 resets) in 495 ms. (80 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (201 resets) in 501 ms. (79 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (196 resets) in 521 ms. (76 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (213 resets) in 416 ms. (95 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (194 resets) in 414 ms. (96 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (199 resets) in 494 ms. (80 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (197 resets) in 584 ms. (68 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40001 steps (204 resets) in 442 ms. (90 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (205 resets) in 432 ms. (92 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (195 resets) in 473 ms. (84 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (201 resets) in 471 ms. (84 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (194 resets) in 497 ms. (80 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (204 resets) in 458 ms. (87 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (208 resets) in 491 ms. (81 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (195 resets) in 449 ms. (88 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (200 resets) in 467 ms. (85 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40001 steps (191 resets) in 505 ms. (79 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (203 resets) in 483 ms. (82 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (208 resets) in 523 ms. (76 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40001 steps (193 resets) in 598 ms. (66 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (207 resets) in 575 ms. (69 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (202 resets) in 478 ms. (83 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (205 resets) in 490 ms. (81 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (210 resets) in 523 ms. (76 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (213 resets) in 634 ms. (62 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (206 resets) in 672 ms. (59 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (206 resets) in 502 ms. (79 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (216 resets) in 530 ms. (75 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (195 resets) in 577 ms. (69 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (199 resets) in 507 ms. (78 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (214 resets) in 392 ms. (101 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (193 resets) in 518 ms. (77 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (197 resets) in 543 ms. (73 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (203 resets) in 516 ms. (77 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (202 resets) in 468 ms. (85 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (208 resets) in 507 ms. (78 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (201 resets) in 494 ms. (80 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40000 steps (197 resets) in 511 ms. (78 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (217 resets) in 514 ms. (77 steps per ms) remains 195/195 properties
Interrupted probabilistic random walk after 3531058 steps, run timeout after 114001 ms. (steps per millisecond=30 ) properties seen :0 out of 195
Probabilistic random walk after 3531058 steps, saw 1147866 distinct states, run finished after 114002 ms. (steps per millisecond=30 ) properties seen :0
// Phase 1: matrix 1064 rows 550 cols
[2024-05-20 23:13:04] [INFO ] Computed 66 invariants in 13 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 11/206 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 140/346 variables, 15/39 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 5/351 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 107/458 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 11 (OVERLAPS) 17/475 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 13 (OVERLAPS) 51/526 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/526 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 15 (OVERLAPS) 22/548 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/548 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 17 (OVERLAPS) 2/550 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 19 (OVERLAPS) 1064/1614 variables, 550/616 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1614 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 21 (OVERLAPS) 0/1614 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1614/1614 variables, and 616 constraints, problems are : Problem set: 0 solved, 195 unsolved in 46033 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 550/550 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 11/206 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-20 23:13:53] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
[2024-05-20 23:13:53] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2024-05-20 23:13:54] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 140/346 variables, 15/42 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-20 23:13:56] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 3 ms to minimize.
[2024-05-20 23:13:58] [INFO ] Deduced a trap composed of 56 places in 267 ms of which 4 ms to minimize.
[2024-05-20 23:13:58] [INFO ] Deduced a trap composed of 43 places in 154 ms of which 4 ms to minimize.
[2024-05-20 23:13:58] [INFO ] Deduced a trap composed of 28 places in 217 ms of which 4 ms to minimize.
[2024-05-20 23:13:58] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 3 ms to minimize.
[2024-05-20 23:14:00] [INFO ] Deduced a trap composed of 34 places in 232 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-20 23:14:01] [INFO ] Deduced a trap composed of 94 places in 267 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-20 23:14:04] [INFO ] Deduced a trap composed of 95 places in 236 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 11 (OVERLAPS) 5/351 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/351 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 13 (OVERLAPS) 107/458 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/458 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 15 (OVERLAPS) 17/475 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-20 23:14:19] [INFO ] Deduced a trap composed of 94 places in 334 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/475 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-20 23:14:24] [INFO ] Deduced a trap composed of 56 places in 293 ms of which 5 ms to minimize.
[2024-05-20 23:14:24] [INFO ] Deduced a trap composed of 53 places in 325 ms of which 6 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/475 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/475 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 19 (OVERLAPS) 51/526 variables, 7/76 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-20 23:14:35] [INFO ] Deduced a trap composed of 93 places in 344 ms of which 5 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/526 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/526 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 22 (OVERLAPS) 22/548 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/548 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 24 (OVERLAPS) 2/550 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-20 23:14:47] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/550 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/550 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 27 (OVERLAPS) 1064/1614 variables, 550/632 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1614 variables, 195/827 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1614/1614 variables, and 827 constraints, problems are : Problem set: 0 solved, 195 unsolved in 135015 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 550/550 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 16/16 constraints]
After SMT, in 181103ms problems are : Problem set: 0 solved, 195 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 195 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 1064/1064 transitions.
Applied a total of 0 rules in 15 ms. Remains 550 /550 variables (removed 0) and now considering 1064/1064 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 550/550 places, 1064/1064 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 1064/1064 transitions.
Applied a total of 0 rules in 16 ms. Remains 550 /550 variables (removed 0) and now considering 1064/1064 (removed 0) transitions.
[2024-05-20 23:16:06] [INFO ] Invariant cache hit.
[2024-05-20 23:16:06] [INFO ] Implicit Places using invariants in 500 ms returned [272, 307, 326, 348]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 513 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 546/550 places, 1064/1064 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 546 transition count 1059
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 541 transition count 1059
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 539 transition count 1057
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 539 transition count 1056
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 538 transition count 1056
Applied a total of 16 rules in 36 ms. Remains 538 /546 variables (removed 8) and now considering 1056/1064 (removed 8) transitions.
// Phase 1: matrix 1056 rows 538 cols
[2024-05-20 23:16:06] [INFO ] Computed 62 invariants in 10 ms
[2024-05-20 23:16:07] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-05-20 23:16:07] [INFO ] Invariant cache hit.
[2024-05-20 23:16:08] [INFO ] Implicit Places using invariants and state equation in 1172 ms returned []
Implicit Place search using SMT with State Equation took 1628 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 538/550 places, 1056/1064 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2196 ms. Remains : 538/550 places, 1056/1064 transitions.
RANDOM walk for 4000000 steps (78013 resets) in 71004 ms. (56 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (195 resets) in 357 ms. (111 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (201 resets) in 614 ms. (65 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (207 resets) in 373 ms. (106 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (203 resets) in 416 ms. (95 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (195 resets) in 663 ms. (60 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (204 resets) in 528 ms. (75 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (198 resets) in 401 ms. (99 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (201 resets) in 554 ms. (72 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (197 resets) in 619 ms. (64 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (210 resets) in 617 ms. (64 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (199 resets) in 434 ms. (91 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (209 resets) in 503 ms. (79 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (198 resets) in 524 ms. (76 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40001 steps (196 resets) in 547 ms. (72 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (204 resets) in 485 ms. (82 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (198 resets) in 534 ms. (74 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (207 resets) in 489 ms. (81 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (196 resets) in 605 ms. (66 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (218 resets) in 471 ms. (84 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (198 resets) in 567 ms. (70 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (200 resets) in 471 ms. (84 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (193 resets) in 668 ms. (59 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (200 resets) in 530 ms. (75 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (210 resets) in 448 ms. (89 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (193 resets) in 413 ms. (96 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (205 resets) in 489 ms. (81 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (203 resets) in 597 ms. (66 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (203 resets) in 524 ms. (76 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40001 steps (198 resets) in 540 ms. (73 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (212 resets) in 427 ms. (93 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (195 resets) in 537 ms. (74 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (202 resets) in 504 ms. (79 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (204 resets) in 525 ms. (76 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (194 resets) in 480 ms. (83 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (208 resets) in 574 ms. (69 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (199 resets) in 593 ms. (67 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (201 resets) in 440 ms. (90 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (199 resets) in 607 ms. (65 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (189 resets) in 425 ms. (93 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (197 resets) in 577 ms. (69 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (200 resets) in 587 ms. (68 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (204 resets) in 536 ms. (74 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (205 resets) in 416 ms. (95 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (199 resets) in 384 ms. (103 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (194 resets) in 546 ms. (73 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (215 resets) in 558 ms. (71 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (198 resets) in 553 ms. (72 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (201 resets) in 575 ms. (69 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (206 resets) in 437 ms. (91 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (203 resets) in 526 ms. (75 steps per ms) remains 195/195 properties
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 StableMarking -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="ASLink-PT-04b"
export BK_EXAMINATION="StableMarking"
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 ASLink-PT-04b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r012-smll-171620123800043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-04b.tgz
mv ASLink-PT-04b execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;