About the Execution of GreatSPN+red for MultiCrashLeafsetExtension-PT-S16C06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7181.020 | 3600000.00 | 12217122.00 | 1881.30 | 1 1 1 1 1 1 1 1 1 1 ? 1 1 1 1 1 | normal |
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.r245-tall-171654349000037.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 MultiCrashLeafsetExtension-PT-S16C06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349000037
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 19 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 12 06:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 06:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.2M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716571363171
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 17:22:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-24 17:22:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 17:22:44] [INFO ] Load time of PNML (sax parser for PT used): 371 ms
[2024-05-24 17:22:44] [INFO ] Transformed 5568 places.
[2024-05-24 17:22:44] [INFO ] Transformed 7799 transitions.
[2024-05-24 17:22:44] [INFO ] Parsed PT model containing 5568 places and 7799 transitions and 29646 arcs in 522 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-24 17:22:45] [INFO ] Flow matrix only has 7527 transitions (discarded 272 similar events)
// Phase 1: matrix 7527 rows 5568 cols
[2024-05-24 17:22:45] [INFO ] Computed 573 invariants in 428 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[51, 17, 17, 1, +inf, 17, 1, 20, 51, 17, 1, 1, 17, 51, 17, 17]
RANDOM walk for 10000 steps (160 resets) in 140 ms. (70 steps per ms)
BEST_FIRST walk for 160011 steps (688 resets) in 572 ms. (279 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1] Max Struct:[51, 17, 17, 1, +inf, 17, 1, 20, 51, 17, 1, 1, 17, 51, 17, 17]
[2024-05-24 17:22:46] [INFO ] Flow matrix only has 7527 transitions (discarded 272 similar events)
[2024-05-24 17:22:46] [INFO ] Invariant cache hit.
[2024-05-24 17:22:47] [INFO ] [Real]Absence check using 50 positive place invariants in 104 ms returned sat
[2024-05-24 17:22:47] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 203 ms returned unsat
[2024-05-24 17:22:48] [INFO ] [Real]Absence check using 50 positive place invariants in 105 ms returned sat
[2024-05-24 17:22:48] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 168 ms returned unsat
[2024-05-24 17:22:48] [INFO ] [Real]Absence check using 50 positive place invariants in 79 ms returned sat
[2024-05-24 17:22:49] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 181 ms returned unsat
[2024-05-24 17:22:49] [INFO ] [Real]Absence check using 50 positive place invariants in 78 ms returned sat
[2024-05-24 17:22:49] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 194 ms returned sat
[2024-05-24 17:22:54] [INFO ] [Real]Absence check using state equation in 4238 ms returned unknown
[2024-05-24 17:22:54] [INFO ] [Real]Absence check using 50 positive place invariants in 96 ms returned sat
[2024-05-24 17:22:54] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 161 ms returned unsat
[2024-05-24 17:22:55] [INFO ] [Real]Absence check using 50 positive place invariants in 80 ms returned sat
[2024-05-24 17:22:55] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 169 ms returned unsat
[2024-05-24 17:22:56] [INFO ] [Real]Absence check using 50 positive place invariants in 77 ms returned sat
[2024-05-24 17:22:56] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 197 ms returned sat
[2024-05-24 17:23:00] [INFO ] [Real]Absence check using state equation in 4173 ms returned unknown
[2024-05-24 17:23:01] [INFO ] [Real]Absence check using 50 positive place invariants in 80 ms returned sat
[2024-05-24 17:23:01] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 173 ms returned unsat
[2024-05-24 17:23:02] [INFO ] [Real]Absence check using 50 positive place invariants in 78 ms returned sat
[2024-05-24 17:23:02] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 152 ms returned unsat
[2024-05-24 17:23:02] [INFO ] [Real]Absence check using 50 positive place invariants in 76 ms returned sat
[2024-05-24 17:23:03] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 174 ms returned unsat
[2024-05-24 17:23:03] [INFO ] [Real]Absence check using 50 positive place invariants in 75 ms returned sat
[2024-05-24 17:23:03] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 193 ms returned sat
[2024-05-24 17:23:08] [INFO ] [Real]Absence check using state equation in 4248 ms returned unknown
[2024-05-24 17:23:08] [INFO ] [Real]Absence check using 50 positive place invariants in 79 ms returned sat
[2024-05-24 17:23:08] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 204 ms returned sat
[2024-05-24 17:23:13] [INFO ] [Real]Absence check using state equation in 4223 ms returned unknown
[2024-05-24 17:23:13] [INFO ] [Real]Absence check using 50 positive place invariants in 74 ms returned sat
[2024-05-24 17:23:13] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 181 ms returned sat
[2024-05-24 17:23:18] [INFO ] [Real]Absence check using state equation in 4260 ms returned unknown
[2024-05-24 17:23:18] [INFO ] [Real]Absence check using 50 positive place invariants in 75 ms returned sat
[2024-05-24 17:23:18] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 177 ms returned sat
[2024-05-24 17:23:23] [INFO ] [Real]Absence check using state equation in 4271 ms returned unknown
[2024-05-24 17:23:23] [INFO ] [Real]Absence check using 50 positive place invariants in 77 ms returned sat
[2024-05-24 17:23:24] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 162 ms returned unsat
[2024-05-24 17:23:24] [INFO ] [Real]Absence check using 50 positive place invariants in 74 ms returned sat
[2024-05-24 17:23:24] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 159 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 17, 51, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 17, 51]
Support contains 6 out of 5568 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5568/5568 places, 7799/7799 transitions.
Graph (complete) has 17461 edges and 5568 vertex of which 5536 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.21 ms
Discarding 32 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1630 transitions
Trivial Post-agglo rules discarded 1630 transitions
Performed 1630 trivial Post agglomeration. Transition count delta: 1630
Iterating post reduction 0 with 1630 rules applied. Total rules applied 1631 place count 5536 transition count 6169
Reduce places removed 1630 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1631 rules applied. Total rules applied 3262 place count 3906 transition count 6168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3263 place count 3905 transition count 6168
Performed 204 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 204 Pre rules applied. Total rules applied 3263 place count 3905 transition count 5964
Deduced a syphon composed of 204 places in 4 ms
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 3 with 408 rules applied. Total rules applied 3671 place count 3701 transition count 5964
Discarding 1426 places :
Symmetric choice reduction at 3 with 1426 rule applications. Total rules 5097 place count 2275 transition count 4538
Iterating global reduction 3 with 1426 rules applied. Total rules applied 6523 place count 2275 transition count 4538
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 6523 place count 2275 transition count 4527
Deduced a syphon composed of 11 places in 7 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 6545 place count 2264 transition count 4527
Discarding 236 places :
Symmetric choice reduction at 3 with 236 rule applications. Total rules 6781 place count 2028 transition count 3111
Iterating global reduction 3 with 236 rules applied. Total rules applied 7017 place count 2028 transition count 3111
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 7051 place count 2011 transition count 3094
Free-agglomeration rule (complex) applied 162 times.
Iterating global reduction 3 with 162 rules applied. Total rules applied 7213 place count 2011 transition count 4112
Reduce places removed 162 places and 0 transitions.
Iterating post reduction 3 with 162 rules applied. Total rules applied 7375 place count 1849 transition count 4112
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 7392 place count 1849 transition count 4112
Applied a total of 7392 rules in 2026 ms. Remains 1849 /5568 variables (removed 3719) and now considering 4112/7799 (removed 3687) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2046 ms. Remains : 1849/5568 places, 4112/7799 transitions.
[2024-05-24 17:23:26] [INFO ] Flow matrix only has 3714 transitions (discarded 398 similar events)
// Phase 1: matrix 3714 rows 1849 cols
[2024-05-24 17:23:26] [INFO ] Computed 541 invariants in 44 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 2]
RANDOM walk for 1000000 steps (26665 resets) in 16404 ms. (60 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000003 steps (14598 resets) in 10957 ms. (273 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 2]
[2024-05-24 17:23:54] [INFO ] Flow matrix only has 3714 transitions (discarded 398 similar events)
[2024-05-24 17:23:54] [INFO ] Invariant cache hit.
[2024-05-24 17:23:54] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2024-05-24 17:23:54] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 76 ms returned sat
[2024-05-24 17:23:55] [INFO ] [Real]Absence check using state equation in 957 ms returned sat
[2024-05-24 17:23:55] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-24 17:23:56] [INFO ] [Real]Added 2178 Read/Feed constraints in 427 ms returned sat
[2024-05-24 17:23:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 17:23:56] [INFO ] [Nat]Absence check using 33 positive place invariants in 40 ms returned sat
[2024-05-24 17:23:56] [INFO ] [Nat]Absence check using 33 positive and 508 generalized place invariants in 95 ms returned sat
[2024-05-24 17:23:57] [INFO ] [Nat]Absence check using state equation in 1039 ms returned sat
[2024-05-24 17:23:59] [INFO ] [Nat]Added 2178 Read/Feed constraints in 1466 ms returned sat
[2024-05-24 17:24:01] [INFO ] Deduced a trap composed of 360 places in 1641 ms of which 94 ms to minimize.
[2024-05-24 17:24:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1908 ms
[2024-05-24 17:24:01] [INFO ] Computed and/alt/rep : 1611/3889/1611 causal constraints (skipped 2086 transitions) in 465 ms.
[2024-05-24 17:24:03] [INFO ] Added : 20 causal constraints over 5 iterations in 2311 ms. Result :sat
Minimization took 5224 ms.
[2024-05-24 17:24:09] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2024-05-24 17:24:09] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 84 ms returned sat
[2024-05-24 17:24:10] [INFO ] [Real]Absence check using state equation in 1020 ms returned sat
[2024-05-24 17:24:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 17:24:10] [INFO ] [Nat]Absence check using 33 positive place invariants in 57 ms returned sat
[2024-05-24 17:24:10] [INFO ] [Nat]Absence check using 33 positive and 508 generalized place invariants in 146 ms returned sat
[2024-05-24 17:24:11] [INFO ] [Nat]Absence check using state equation in 994 ms returned sat
[2024-05-24 17:24:13] [INFO ] [Nat]Added 2178 Read/Feed constraints in 1361 ms returned sat
[2024-05-24 17:24:14] [INFO ] Deduced a trap composed of 375 places in 1742 ms of which 30 ms to minimize.
[2024-05-24 17:24:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1954 ms
[2024-05-24 17:24:15] [INFO ] Computed and/alt/rep : 1611/3889/1611 causal constraints (skipped 2086 transitions) in 224 ms.
[2024-05-24 17:24:19] [INFO ] Deduced a trap composed of 218 places in 1472 ms of which 19 ms to minimize.
[2024-05-24 17:24:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1728 ms
[2024-05-24 17:24:19] [INFO ] Added : 30 causal constraints over 8 iterations in 4509 ms. Result :sat
Minimization took 5120 ms.
[2024-05-24 17:24:24] [INFO ] [Real]Absence check using 33 positive place invariants in 36 ms returned sat
[2024-05-24 17:24:25] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 81 ms returned sat
[2024-05-24 17:24:26] [INFO ] [Real]Absence check using state equation in 1068 ms returned sat
[2024-05-24 17:24:26] [INFO ] [Real]Added 2178 Read/Feed constraints in 291 ms returned sat
[2024-05-24 17:24:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 17:24:26] [INFO ] [Nat]Absence check using 33 positive place invariants in 43 ms returned sat
[2024-05-24 17:24:26] [INFO ] [Nat]Absence check using 33 positive and 508 generalized place invariants in 79 ms returned sat
[2024-05-24 17:24:28] [INFO ] [Nat]Absence check using state equation in 1104 ms returned sat
[2024-05-24 17:24:29] [INFO ] [Nat]Added 2178 Read/Feed constraints in 1319 ms returned sat
[2024-05-24 17:24:30] [INFO ] Deduced a trap composed of 234 places in 1346 ms of which 11 ms to minimize.
[2024-05-24 17:24:32] [INFO ] Deduced a trap composed of 292 places in 1406 ms of which 29 ms to minimize.
[2024-05-24 17:24:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4129 ms
[2024-05-24 17:24:33] [INFO ] Computed and/alt/rep : 1611/3889/1611 causal constraints (skipped 2086 transitions) in 447 ms.
[2024-05-24 17:24:34] [INFO ] Added : 14 causal constraints over 3 iterations in 1433 ms. Result :sat
Minimization took 5108 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 2]
Support contains 3 out of 1849 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1849/1849 places, 4112/4112 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 0 with 1 rules applied. Total rules applied 1 place count 1849 transition count 4111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1848 transition count 4111
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 1848 transition count 4111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 1847 transition count 4110
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 1847 transition count 4110
Applied a total of 5 rules in 445 ms. Remains 1847 /1849 variables (removed 2) and now considering 4110/4112 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 461 ms. Remains : 1847/1849 places, 4110/4112 transitions.
[2024-05-24 17:24:40] [INFO ] Flow matrix only has 3712 transitions (discarded 398 similar events)
// Phase 1: matrix 3712 rows 1847 cols
[2024-05-24 17:24:40] [INFO ] Computed 541 invariants in 69 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 2]
RANDOM walk for 1000000 steps (26661 resets) in 15990 ms. (62 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000002 steps (9731 resets) in 7302 ms. (273 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1] Max Struct:[1, 2]
[2024-05-24 17:25:03] [INFO ] Flow matrix only has 3712 transitions (discarded 398 similar events)
[2024-05-24 17:25:03] [INFO ] Invariant cache hit.
[2024-05-24 17:25:04] [INFO ] [Real]Absence check using 33 positive place invariants in 59 ms returned sat
[2024-05-24 17:25:04] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 77 ms returned sat
[2024-05-24 17:25:05] [INFO ] [Real]Absence check using state equation in 1011 ms returned sat
[2024-05-24 17:25:05] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-24 17:25:05] [INFO ] [Real]Added 2178 Read/Feed constraints in 456 ms returned sat
[2024-05-24 17:25:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 17:25:06] [INFO ] [Nat]Absence check using 33 positive place invariants in 35 ms returned sat
[2024-05-24 17:25:06] [INFO ] [Nat]Absence check using 33 positive and 508 generalized place invariants in 81 ms returned sat
[2024-05-24 17:25:07] [INFO ] [Nat]Absence check using state equation in 991 ms returned sat
[2024-05-24 17:25:08] [INFO ] [Nat]Added 2178 Read/Feed constraints in 1387 ms returned sat
[2024-05-24 17:25:10] [INFO ] Deduced a trap composed of 171 places in 1476 ms of which 12 ms to minimize.
[2024-05-24 17:25:11] [INFO ] Deduced a trap composed of 333 places in 1338 ms of which 12 ms to minimize.
[2024-05-24 17:25:13] [INFO ] Deduced a trap composed of 232 places in 1452 ms of which 12 ms to minimize.
[2024-05-24 17:25:14] [INFO ] Deduced a trap composed of 212 places in 1480 ms of which 11 ms to minimize.
[2024-05-24 17:25:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 6346 ms
[2024-05-24 17:25:15] [INFO ] Computed and/alt/rep : 1609/3886/1609 causal constraints (skipped 2086 transitions) in 227 ms.
[2024-05-24 17:25:16] [INFO ] Added : 17 causal constraints over 4 iterations in 1185 ms. Result :sat
Minimization took 5571 ms.
[2024-05-24 17:25:21] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2024-05-24 17:25:21] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 78 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1] Max Struct:[1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 1847 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node2ThinksNode11ShouldBeNodeMasterToReplaceNode7) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 1847/1847 places, 4108/4108 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1846 transition count 4106
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1845 transition count 4104
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 1844 transition count 4102
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 1843 transition count 4100
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 5 place count 1843 transition count 4099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6 place count 1842 transition count 4099
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 7 place count 1841 transition count 4098
Iterating global reduction 5 with 1 rules applied. Total rules applied 8 place count 1841 transition count 4098
Applied a total of 8 rules in 349 ms. Remains 1841 /1847 variables (removed 6) and now considering 4098/4108 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 349 ms. Remains : 1841/1847 places, 4098/4108 transitions.
[2024-05-24 17:25:22] [INFO ] Flow matrix only has 3700 transitions (discarded 398 similar events)
// Phase 1: matrix 3700 rows 1841 cols
[2024-05-24 17:25:22] [INFO ] Computed 541 invariants in 41 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (26668 resets) in 16004 ms. (62 steps per ms)
BEST_FIRST walk for 1000001 steps (4866 resets) in 3593 ms. (278 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 17:25:41] [INFO ] Flow matrix only has 3700 transitions (discarded 398 similar events)
[2024-05-24 17:25:41] [INFO ] Invariant cache hit.
[2024-05-24 17:25:42] [INFO ] [Real]Absence check using 33 positive place invariants in 34 ms returned sat
[2024-05-24 17:25:42] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 79 ms returned sat
[2024-05-24 17:25:43] [INFO ] [Real]Absence check using state equation in 986 ms returned sat
[2024-05-24 17:25:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 17:25:43] [INFO ] [Nat]Absence check using 33 positive place invariants in 30 ms returned sat
[2024-05-24 17:25:43] [INFO ] [Nat]Absence check using 33 positive and 508 generalized place invariants in 82 ms returned sat
[2024-05-24 17:25:44] [INFO ] [Nat]Absence check using state equation in 998 ms returned sat
[2024-05-24 17:25:44] [INFO ] State equation strengthened by 2173 read => feed constraints.
[2024-05-24 17:25:46] [INFO ] [Nat]Added 2173 Read/Feed constraints in 1525 ms returned sat
[2024-05-24 17:25:47] [INFO ] Deduced a trap composed of 339 places in 1359 ms of which 11 ms to minimize.
[2024-05-24 17:25:49] [INFO ] Deduced a trap composed of 214 places in 1511 ms of which 12 ms to minimize.
[2024-05-24 17:25:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3201 ms
[2024-05-24 17:25:49] [INFO ] Computed and/alt/rep : 1598/3869/1598 causal constraints (skipped 2085 transitions) in 233 ms.
[2024-05-24 17:25:50] [INFO ] Added : 16 causal constraints over 4 iterations in 1444 ms. Result :sat
Minimization took 5372 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 1841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1841/1841 places, 4098/4098 transitions.
Applied a total of 0 rules in 163 ms. Remains 1841 /1841 variables (removed 0) and now considering 4098/4098 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 1841/1841 places, 4098/4098 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1841/1841 places, 4098/4098 transitions.
Applied a total of 0 rules in 134 ms. Remains 1841 /1841 variables (removed 0) and now considering 4098/4098 (removed 0) transitions.
[2024-05-24 17:25:56] [INFO ] Flow matrix only has 3700 transitions (discarded 398 similar events)
[2024-05-24 17:25:56] [INFO ] Invariant cache hit.
[2024-05-24 17:26:00] [INFO ] Implicit Places using invariants in 3844 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 19, 25, 33, 43, 55, 69, 84, 98, 99, 100, 101, 102, 103, 104, 116, 126, 134, 140, 144, 146, 161, 167, 169, 170, 171, 172, 173, 174, 175, 177, 181, 187, 195, 205, 217, 230, 242, 243, 244, 245, 246, 247, 248, 258, 266, 272, 276, 278, 280, 295, 301, 303, 304, 305, 306, 307, 308, 309, 311, 313, 317, 323, 331, 337, 348, 358, 359, 360, 361, 362, 363, 364, 372, 378, 382, 384, 386, 388, 403, 409, 411, 412, 413, 414, 415, 416, 417, 419, 421, 423, 427, 433, 441, 450, 458, 459, 460, 461, 462, 463, 464, 470, 474, 476, 478, 480, 482, 497, 503, 505, 506, 507, 508, 509, 510, 511, 513, 515, 517, 519, 523, 529, 536, 542, 543, 544, 545, 546, 547, 548, 552, 554, 556, 558, 560, 562, 577, 583, 585, 586, 587, 588, 589, 590, 591, 593, 595, 597, 599, 601, 605, 610, 614, 615, 616, 617, 618, 619, 620, 622, 624, 626, 628, 630, 632, 647, 653, 655, 656, 657, 658, 659, 660, 661, 663, 665, 667, 669, 671, 673, 676, 678, 679, 680, 681, 682, 683, 684, 686, 688, 690, 692, 694, 696, 711, 717, 719, 720, 721, 722, 723, 724, 725, 727, 729, 731, 733, 735, 737, 739, 741, 742, 743, 744, 745, 746, 747, 749, 751, 753, 755, 757, 759, 774, 776, 779, 781, 782, 783, 784, 785, 786, 787, 789, 791, 793, 795, 797, 799, 801, 803, 804, 805, 806, 807, 808, 809, 811, 813, 815, 817, 819, 821, 836, 842, 844, 845, 846, 847, 848, 849, 850, 852, 854, 856, 858, 860, 862, 864, 866, 867, 868, 869, 870, 871, 872, 874, 876, 878, 880, 882, 884, 899, 905, 907, 908, 909, 910, 911, 912, 913, 915, 917, 919, 921, 923, 925, 927, 930, 931, 932, 933, 934, 935, 936, 938, 940, 942, 944, 946, 948, 963, 969, 971, 972, 973, 974, 975, 976, 977, 979, 981, 983, 985, 987, 989, 993, 998, 999, 1000, 1001, 1002, 1003, 1004, 1008, 1010, 1012, 1014, 1016, 1018, 1033, 1039, 1041, 1042, 1043, 1044, 1045, 1046, 1047, 1049, 1051, 1053, 1055, 1057, 1061, 1067, 1074, 1075, 1076, 1077, 1078, 1079, 1080, 1086, 1090, 1092, 1094, 1096, 1098, 1113, 1119, 1121, 1122, 1123, 1124, 1125, 1126, 1127, 1129, 1131, 1133, 1135, 1139, 1145, 1153, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1176, 1182, 1186, 1188, 1190, 1192, 1207, 1213, 1215, 1216, 1217, 1218, 1219, 1220, 1221, 1223, 1225, 1227, 1231, 1237, 1245, 1255, 1266, 1267, 1268, 1269, 1270, 1271, 1272, 1282, 1290, 1296, 1300, 1302, 1304, 1319, 1325, 1327, 1328, 1329, 1330, 1331, 1332, 1333, 1335, 1337, 1341, 1347, 1355, 1365, 1377, 1390, 1391, 1392, 1393, 1394, 1395, 1396, 1408, 1418, 1426, 1432, 1436, 1438, 1453, 1455, 1458, 1460, 1461, 1462, 1463, 1464, 1465, 1466, 1468, 1472, 1478, 1486, 1496, 1508, 1522, 1537, 1538, 1539, 1540, 1541, 1542, 1543, 1557, 1569, 1579, 1587, 1593, 1597, 1612]
[2024-05-24 17:26:00] [INFO ] Actually due to overlaps returned [161, 295, 403, 497, 577, 647, 711, 774, 836, 899, 963, 1033, 1113, 1207, 1319, 1453, 1612, 4, 9, 10, 11, 12, 13, 14, 98, 99, 100, 101, 102, 103, 169, 170, 171, 172, 173, 174, 242, 243, 244, 245, 246, 247, 303, 304, 305, 306, 307, 308, 358, 359, 360, 361, 362, 363, 411, 412, 413, 414, 415, 416, 458, 459, 460, 461, 462, 463, 505, 506, 507, 508, 509, 510, 542, 543, 544, 545, 546, 547, 585, 586, 587, 588, 589, 590, 614, 615, 616, 617, 618, 619, 655, 656, 657, 658, 659, 660, 678, 679, 680, 681, 682, 683, 719, 720, 721, 722, 723, 724, 741, 742, 743, 744, 745, 746, 776, 781, 782, 783, 784, 785, 786, 803, 804, 805, 806, 807, 808, 844, 845, 846, 847, 848, 849, 866, 867, 868, 869, 870, 871, 907, 908, 909, 910, 911, 912, 930, 931, 932, 933, 934, 935, 971, 972, 973, 974, 975, 976, 998, 999, 1000, 1001, 1002, 1003, 1041, 1042, 1043, 1044, 1045, 1046, 1074, 1075, 1076, 1077, 1078, 1079, 1121, 1122, 1123, 1124, 1125, 1126, 1162, 1163, 1164, 1165, 1166, 1167, 1215, 1216, 1217, 1218, 1219, 1220, 1266, 1267, 1268, 1269, 1270, 1271, 1327, 1328, 1329, 1330, 1331, 1332, 1390, 1391, 1392, 1393, 1394, 1395, 1455, 1460, 1461, 1462, 1463, 1464, 1465, 1537, 1538, 1539, 1540, 1541, 1542]
Discarding 224 places :
Implicit Place search using SMT only with invariants took 3859 ms to find 224 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1617/1841 places, 4098/4098 transitions.
Discarding 192 places :
Symmetric choice reduction at 0 with 192 rule applications. Total rules 192 place count 1425 transition count 3906
Iterating global reduction 0 with 192 rules applied. Total rules applied 384 place count 1425 transition count 3906
Discarding 192 places :
Symmetric choice reduction at 0 with 192 rule applications. Total rules 576 place count 1233 transition count 3714
Iterating global reduction 0 with 192 rules applied. Total rules applied 768 place count 1233 transition count 3714
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 771 place count 1233 transition count 3711
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 774 place count 1230 transition count 3711
Applied a total of 774 rules in 266 ms. Remains 1230 /1617 variables (removed 387) and now considering 3711/4098 (removed 387) transitions.
[2024-05-24 17:26:00] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
// Phase 1: matrix 3313 rows 1230 cols
[2024-05-24 17:26:00] [INFO ] Computed 317 invariants in 29 ms
[2024-05-24 17:26:02] [INFO ] Implicit Places using invariants in 2310 ms returned [6, 8, 12, 18, 26, 36, 48, 62, 77, 91, 103, 113, 121, 127, 131, 133, 152, 154, 156, 160, 166, 174, 184, 196, 209, 221, 231, 239, 245, 249, 251, 253, 261, 263, 265, 267, 271, 277, 285, 291, 302, 312, 320, 326, 330, 332, 334, 336, 344, 346, 348, 350, 352, 356, 362, 370, 379, 387, 393, 397, 399, 401, 403, 405, 413, 415, 417, 419, 421, 423, 427, 433, 440, 446, 450, 452, 454, 456, 458, 460, 468, 470, 472, 474, 476, 478, 480, 484, 489, 493, 495, 497, 499, 501, 503, 505, 513, 515, 517, 519, 521, 523, 525, 527, 530, 532, 534, 536, 538, 540, 542, 544, 552, 554, 556, 558, 560, 562, 564, 566, 568, 570, 572, 574, 576, 578, 580, 582, 588, 590, 592, 594, 596, 598, 600, 602, 604, 606, 608, 610, 612, 614, 616, 618, 625, 627, 629, 631, 633, 635, 637, 639, 641, 643, 645, 647, 649, 651, 653, 655, 663, 665, 667, 669, 671, 673, 675, 677, 679, 682, 684, 686, 688, 690, 692, 694, 702, 704, 706, 708, 710, 712, 714, 716, 720, 725, 729, 731, 733, 735, 737, 739, 747, 749, 751, 753, 755, 757, 759, 763, 769, 776, 782, 786, 788, 790, 792, 794, 802, 804, 806, 808, 810, 812, 816, 822, 830, 839, 847, 853, 857, 859, 861, 863, 871, 873, 875, 877, 879, 883, 889, 897, 907, 918, 928, 936, 942, 946, 948, 950, 958, 960, 962, 964, 968, 974, 982, 992, 1004, 1017, 1029, 1039, 1047, 1053, 1057, 1059, 1065, 1067, 1069, 1073, 1079, 1087, 1097, 1109, 1123, 1138, 1152, 1164, 1174, 1182, 1188, 1192]
Discarding 272 places :
Implicit Place search using SMT only with invariants took 2321 ms to find 272 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 958/1841 places, 3711/4098 transitions.
Applied a total of 0 rules in 108 ms. Remains 958 /958 variables (removed 0) and now considering 3711/3711 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6690 ms. Remains : 958/1841 places, 3711/4098 transitions.
[2024-05-24 17:26:03] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
// Phase 1: matrix 3313 rows 958 cols
[2024-05-24 17:26:03] [INFO ] Computed 45 invariants in 27 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (28283 resets) in 15925 ms. (62 steps per ms)
BEST_FIRST walk for 1000001 steps (3592 resets) in 2759 ms. (362 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 17:26:21] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:26:21] [INFO ] Invariant cache hit.
[2024-05-24 17:26:21] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-24 17:26:21] [INFO ] [Real]Absence check using 31 positive and 14 generalized place invariants in 6 ms returned sat
[2024-05-24 17:26:22] [INFO ] [Real]Absence check using state equation in 804 ms returned sat
[2024-05-24 17:26:22] [INFO ] State equation strengthened by 2173 read => feed constraints.
[2024-05-24 17:26:23] [INFO ] [Real]Added 2173 Read/Feed constraints in 384 ms returned sat
[2024-05-24 17:26:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 17:26:23] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-24 17:26:23] [INFO ] [Nat]Absence check using 31 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-24 17:26:24] [INFO ] [Nat]Absence check using state equation in 721 ms returned sat
[2024-05-24 17:26:25] [INFO ] [Nat]Added 2173 Read/Feed constraints in 1159 ms returned sat
[2024-05-24 17:26:25] [INFO ] Deduced a trap composed of 235 places in 501 ms of which 7 ms to minimize.
[2024-05-24 17:26:26] [INFO ] Deduced a trap composed of 93 places in 531 ms of which 6 ms to minimize.
[2024-05-24 17:26:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1303 ms
[2024-05-24 17:26:26] [INFO ] Computed and/alt/rep : 1324/1905/1324 causal constraints (skipped 1927 transitions) in 211 ms.
[2024-05-24 17:26:28] [INFO ] Added : 29 causal constraints over 10 iterations in 2053 ms. Result :sat
Minimization took 4864 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 958 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 958/958 places, 3711/3711 transitions.
Applied a total of 0 rules in 112 ms. Remains 958 /958 variables (removed 0) and now considering 3711/3711 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 958/958 places, 3711/3711 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 958/958 places, 3711/3711 transitions.
Applied a total of 0 rules in 101 ms. Remains 958 /958 variables (removed 0) and now considering 3711/3711 (removed 0) transitions.
[2024-05-24 17:26:33] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:26:33] [INFO ] Invariant cache hit.
[2024-05-24 17:26:34] [INFO ] Implicit Places using invariants in 1160 ms returned []
[2024-05-24 17:26:34] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:26:34] [INFO ] Invariant cache hit.
[2024-05-24 17:26:35] [INFO ] State equation strengthened by 2173 read => feed constraints.
[2024-05-24 17:27:05] [INFO ] Implicit Places using invariants and state equation in 30455 ms returned []
Implicit Place search using SMT with State Equation took 31617 ms to find 0 implicit places.
[2024-05-24 17:27:05] [INFO ] Redundant transitions in 230 ms returned []
Running 3649 sub problems to find dead transitions.
[2024-05-24 17:27:05] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:27:05] [INFO ] Invariant cache hit.
[2024-05-24 17:27:05] [INFO ] State equation strengthened by 2173 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/955 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3649 unsolved
SMT process timed out in 54672ms, After SMT, problems are : Problem set: 0 solved, 3649 unsolved
Search for dead transitions found 0 dead transitions in 54726ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86722 ms. Remains : 958/958 places, 3711/3711 transitions.
RANDOM walk for 40000 steps (1131 resets) in 1348 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (142 resets) in 273 ms. (145 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (141 resets) in 238 ms. (167 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 62111 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 2
Probabilistic random walk after 62111 steps, saw 25995 distinct states, run finished after 3006 ms. (steps per millisecond=20 ) properties seen :0
[2024-05-24 17:28:03] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:28:03] [INFO ] Invariant cache hit.
[2024-05-24 17:28:04] [INFO ] State equation strengthened by 2173 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 869/870 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/888 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:28:04] [INFO ] Deduced a trap composed of 89 places in 479 ms of which 5 ms to minimize.
[2024-05-24 17:28:05] [INFO ] Deduced a trap composed of 103 places in 494 ms of which 5 ms to minimize.
[2024-05-24 17:28:05] [INFO ] Deduced a trap composed of 87 places in 564 ms of which 6 ms to minimize.
[2024-05-24 17:28:06] [INFO ] Deduced a trap composed of 103 places in 555 ms of which 5 ms to minimize.
[2024-05-24 17:28:06] [INFO ] Deduced a trap composed of 169 places in 551 ms of which 6 ms to minimize.
[2024-05-24 17:28:07] [INFO ] Deduced a trap composed of 199 places in 567 ms of which 6 ms to minimize.
[2024-05-24 17:28:08] [INFO ] Deduced a trap composed of 171 places in 539 ms of which 6 ms to minimize.
[2024-05-24 17:28:08] [INFO ] Deduced a trap composed of 72 places in 532 ms of which 7 ms to minimize.
[2024-05-24 17:28:09] [INFO ] Deduced a trap composed of 198 places in 503 ms of which 5 ms to minimize.
SMT process timed out in 5186ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 958 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 958/958 places, 3711/3711 transitions.
Applied a total of 0 rules in 103 ms. Remains 958 /958 variables (removed 0) and now considering 3711/3711 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 958/958 places, 3711/3711 transitions.
RANDOM walk for 40000 steps (1130 resets) in 946 ms. (42 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (144 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (143 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 61883 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 2
Probabilistic random walk after 61883 steps, saw 25895 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
[2024-05-24 17:28:12] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:28:12] [INFO ] Invariant cache hit.
[2024-05-24 17:28:12] [INFO ] State equation strengthened by 2173 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 869/870 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/888 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:28:13] [INFO ] Deduced a trap composed of 89 places in 498 ms of which 6 ms to minimize.
[2024-05-24 17:28:13] [INFO ] Deduced a trap composed of 103 places in 513 ms of which 6 ms to minimize.
[2024-05-24 17:28:14] [INFO ] Deduced a trap composed of 87 places in 538 ms of which 6 ms to minimize.
[2024-05-24 17:28:15] [INFO ] Deduced a trap composed of 103 places in 532 ms of which 5 ms to minimize.
[2024-05-24 17:28:15] [INFO ] Deduced a trap composed of 169 places in 526 ms of which 6 ms to minimize.
[2024-05-24 17:28:16] [INFO ] Deduced a trap composed of 199 places in 530 ms of which 5 ms to minimize.
[2024-05-24 17:28:16] [INFO ] Deduced a trap composed of 171 places in 486 ms of which 6 ms to minimize.
[2024-05-24 17:28:17] [INFO ] Deduced a trap composed of 72 places in 502 ms of which 6 ms to minimize.
[2024-05-24 17:28:17] [INFO ] Deduced a trap composed of 198 places in 556 ms of which 5 ms to minimize.
[2024-05-24 17:28:18] [INFO ] Deduced a trap composed of 157 places in 536 ms of which 6 ms to minimize.
[2024-05-24 17:28:18] [INFO ] Deduced a trap composed of 174 places in 498 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/888 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 30/918 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:28:19] [INFO ] Deduced a trap composed of 5 places in 466 ms of which 6 ms to minimize.
[2024-05-24 17:28:20] [INFO ] Deduced a trap composed of 27 places in 531 ms of which 6 ms to minimize.
[2024-05-24 17:28:20] [INFO ] Deduced a trap composed of 46 places in 466 ms of which 6 ms to minimize.
[2024-05-24 17:28:21] [INFO ] Deduced a trap composed of 62 places in 502 ms of which 5 ms to minimize.
[2024-05-24 17:28:21] [INFO ] Deduced a trap composed of 75 places in 505 ms of which 6 ms to minimize.
[2024-05-24 17:28:22] [INFO ] Deduced a trap composed of 147 places in 497 ms of which 6 ms to minimize.
[2024-05-24 17:28:22] [INFO ] Deduced a trap composed of 149 places in 470 ms of which 6 ms to minimize.
[2024-05-24 17:28:23] [INFO ] Deduced a trap composed of 152 places in 472 ms of which 6 ms to minimize.
[2024-05-24 17:28:23] [INFO ] Deduced a trap composed of 85 places in 474 ms of which 6 ms to minimize.
[2024-05-24 17:28:24] [INFO ] Deduced a trap composed of 141 places in 466 ms of which 6 ms to minimize.
[2024-05-24 17:28:24] [INFO ] Deduced a trap composed of 75 places in 551 ms of which 6 ms to minimize.
[2024-05-24 17:28:25] [INFO ] Deduced a trap composed of 90 places in 466 ms of which 6 ms to minimize.
[2024-05-24 17:28:25] [INFO ] Deduced a trap composed of 95 places in 474 ms of which 6 ms to minimize.
[2024-05-24 17:28:26] [INFO ] Deduced a trap composed of 128 places in 512 ms of which 6 ms to minimize.
[2024-05-24 17:28:26] [INFO ] Deduced a trap composed of 135 places in 479 ms of which 5 ms to minimize.
[2024-05-24 17:28:27] [INFO ] Deduced a trap composed of 46 places in 498 ms of which 6 ms to minimize.
[2024-05-24 17:28:27] [INFO ] Deduced a trap composed of 115 places in 512 ms of which 7 ms to minimize.
[2024-05-24 17:28:28] [INFO ] Deduced a trap composed of 57 places in 545 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/918 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/918 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 28/946 variables, 28/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/946 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 12/958 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/958 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3313/4271 variables, 958/1032 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4271 variables, 2173/3205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4271 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/4271 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4271/4271 variables, and 3205 constraints, problems are : Problem set: 0 solved, 2 unsolved in 16863 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 958/958 constraints, ReadFeed: 2173/2173 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 869/870 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/888 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:28:30] [INFO ] Deduced a trap composed of 236 places in 510 ms of which 6 ms to minimize.
[2024-05-24 17:28:30] [INFO ] Deduced a trap composed of 73 places in 533 ms of which 6 ms to minimize.
[2024-05-24 17:28:31] [INFO ] Deduced a trap composed of 169 places in 518 ms of which 5 ms to minimize.
[2024-05-24 17:28:31] [INFO ] Deduced a trap composed of 170 places in 535 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/888 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/888 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 30/918 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/918 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:28:32] [INFO ] Deduced a trap composed of 154 places in 516 ms of which 5 ms to minimize.
[2024-05-24 17:28:33] [INFO ] Deduced a trap composed of 46 places in 471 ms of which 6 ms to minimize.
[2024-05-24 17:28:33] [INFO ] Deduced a trap composed of 62 places in 492 ms of which 6 ms to minimize.
[2024-05-24 17:28:34] [INFO ] Deduced a trap composed of 90 places in 462 ms of which 6 ms to minimize.
[2024-05-24 17:28:34] [INFO ] Deduced a trap composed of 165 places in 453 ms of which 5 ms to minimize.
[2024-05-24 17:28:35] [INFO ] Deduced a trap composed of 218 places in 489 ms of which 6 ms to minimize.
[2024-05-24 17:28:35] [INFO ] Deduced a trap composed of 92 places in 488 ms of which 6 ms to minimize.
[2024-05-24 17:28:36] [INFO ] Deduced a trap composed of 178 places in 473 ms of which 6 ms to minimize.
[2024-05-24 17:28:36] [INFO ] Deduced a trap composed of 85 places in 507 ms of which 6 ms to minimize.
[2024-05-24 17:28:37] [INFO ] Deduced a trap composed of 92 places in 486 ms of which 6 ms to minimize.
[2024-05-24 17:28:37] [INFO ] Deduced a trap composed of 95 places in 479 ms of which 5 ms to minimize.
[2024-05-24 17:28:38] [INFO ] Deduced a trap composed of 92 places in 471 ms of which 6 ms to minimize.
[2024-05-24 17:28:38] [INFO ] Deduced a trap composed of 97 places in 461 ms of which 6 ms to minimize.
[2024-05-24 17:28:39] [INFO ] Deduced a trap composed of 92 places in 468 ms of which 6 ms to minimize.
[2024-05-24 17:28:39] [INFO ] Deduced a trap composed of 97 places in 474 ms of which 6 ms to minimize.
[2024-05-24 17:28:40] [INFO ] Deduced a trap composed of 108 places in 506 ms of which 6 ms to minimize.
[2024-05-24 17:28:40] [INFO ] Deduced a trap composed of 119 places in 512 ms of which 5 ms to minimize.
[2024-05-24 17:28:41] [INFO ] Deduced a trap composed of 101 places in 469 ms of which 6 ms to minimize.
[2024-05-24 17:28:41] [INFO ] Deduced a trap composed of 263 places in 461 ms of which 6 ms to minimize.
[2024-05-24 17:28:42] [INFO ] Deduced a trap composed of 235 places in 464 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/918 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:28:42] [INFO ] Deduced a trap composed of 94 places in 473 ms of which 6 ms to minimize.
[2024-05-24 17:28:43] [INFO ] Deduced a trap composed of 153 places in 471 ms of which 6 ms to minimize.
[2024-05-24 17:28:43] [INFO ] Deduced a trap composed of 78 places in 556 ms of which 6 ms to minimize.
[2024-05-24 17:28:44] [INFO ] Deduced a trap composed of 82 places in 546 ms of which 6 ms to minimize.
[2024-05-24 17:28:44] [INFO ] Deduced a trap composed of 101 places in 458 ms of which 6 ms to minimize.
[2024-05-24 17:28:45] [INFO ] Deduced a trap composed of 131 places in 538 ms of which 6 ms to minimize.
[2024-05-24 17:28:45] [INFO ] Deduced a trap composed of 60 places in 541 ms of which 6 ms to minimize.
[2024-05-24 17:28:46] [INFO ] Deduced a trap composed of 92 places in 500 ms of which 6 ms to minimize.
[2024-05-24 17:28:46] [INFO ] Deduced a trap composed of 70 places in 588 ms of which 6 ms to minimize.
[2024-05-24 17:28:47] [INFO ] Deduced a trap composed of 92 places in 508 ms of which 7 ms to minimize.
[2024-05-24 17:28:48] [INFO ] Deduced a trap composed of 64 places in 576 ms of which 6 ms to minimize.
[2024-05-24 17:28:48] [INFO ] Deduced a trap composed of 97 places in 495 ms of which 6 ms to minimize.
[2024-05-24 17:28:49] [INFO ] Deduced a trap composed of 80 places in 587 ms of which 7 ms to minimize.
[2024-05-24 17:28:49] [INFO ] Deduced a trap composed of 64 places in 546 ms of which 6 ms to minimize.
[2024-05-24 17:28:50] [INFO ] Deduced a trap composed of 102 places in 578 ms of which 6 ms to minimize.
[2024-05-24 17:28:50] [INFO ] Deduced a trap composed of 72 places in 557 ms of which 7 ms to minimize.
[2024-05-24 17:28:51] [INFO ] Deduced a trap composed of 106 places in 465 ms of which 6 ms to minimize.
[2024-05-24 17:28:51] [INFO ] Deduced a trap composed of 260 places in 481 ms of which 6 ms to minimize.
[2024-05-24 17:28:52] [INFO ] Deduced a trap composed of 187 places in 507 ms of which 7 ms to minimize.
[2024-05-24 17:28:53] [INFO ] Deduced a trap composed of 78 places in 528 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/918 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:28:53] [INFO ] Deduced a trap composed of 71 places in 570 ms of which 6 ms to minimize.
[2024-05-24 17:28:54] [INFO ] Deduced a trap composed of 82 places in 569 ms of which 6 ms to minimize.
[2024-05-24 17:28:54] [INFO ] Deduced a trap composed of 267 places in 458 ms of which 5 ms to minimize.
[2024-05-24 17:28:55] [INFO ] Deduced a trap composed of 221 places in 462 ms of which 5 ms to minimize.
[2024-05-24 17:28:55] [INFO ] Deduced a trap composed of 223 places in 469 ms of which 6 ms to minimize.
[2024-05-24 17:28:56] [INFO ] Deduced a trap composed of 71 places in 573 ms of which 5 ms to minimize.
[2024-05-24 17:28:56] [INFO ] Deduced a trap composed of 225 places in 486 ms of which 6 ms to minimize.
[2024-05-24 17:28:57] [INFO ] Deduced a trap composed of 113 places in 495 ms of which 6 ms to minimize.
[2024-05-24 17:28:57] [INFO ] Deduced a trap composed of 67 places in 554 ms of which 6 ms to minimize.
[2024-05-24 17:28:58] [INFO ] Deduced a trap composed of 93 places in 563 ms of which 5 ms to minimize.
[2024-05-24 17:28:58] [INFO ] Deduced a trap composed of 235 places in 501 ms of which 6 ms to minimize.
[2024-05-24 17:28:59] [INFO ] Deduced a trap composed of 198 places in 489 ms of which 5 ms to minimize.
[2024-05-24 17:29:00] [INFO ] Deduced a trap composed of 112 places in 559 ms of which 6 ms to minimize.
[2024-05-24 17:29:00] [INFO ] Deduced a trap composed of 69 places in 550 ms of which 5 ms to minimize.
[2024-05-24 17:29:01] [INFO ] Deduced a trap composed of 68 places in 578 ms of which 6 ms to minimize.
[2024-05-24 17:29:01] [INFO ] Deduced a trap composed of 86 places in 551 ms of which 6 ms to minimize.
[2024-05-24 17:29:02] [INFO ] Deduced a trap composed of 113 places in 463 ms of which 6 ms to minimize.
[2024-05-24 17:29:02] [INFO ] Deduced a trap composed of 122 places in 487 ms of which 5 ms to minimize.
[2024-05-24 17:29:03] [INFO ] Deduced a trap composed of 61 places in 565 ms of which 6 ms to minimize.
[2024-05-24 17:29:03] [INFO ] Deduced a trap composed of 62 places in 583 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/918 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:29:04] [INFO ] Deduced a trap composed of 71 places in 572 ms of which 6 ms to minimize.
[2024-05-24 17:29:05] [INFO ] Deduced a trap composed of 203 places in 564 ms of which 6 ms to minimize.
[2024-05-24 17:29:05] [INFO ] Deduced a trap composed of 94 places in 566 ms of which 6 ms to minimize.
[2024-05-24 17:29:06] [INFO ] Deduced a trap composed of 82 places in 561 ms of which 6 ms to minimize.
[2024-05-24 17:29:06] [INFO ] Deduced a trap composed of 69 places in 558 ms of which 6 ms to minimize.
[2024-05-24 17:29:07] [INFO ] Deduced a trap composed of 113 places in 550 ms of which 6 ms to minimize.
[2024-05-24 17:29:08] [INFO ] Deduced a trap composed of 68 places in 527 ms of which 5 ms to minimize.
[2024-05-24 17:29:08] [INFO ] Deduced a trap composed of 88 places in 512 ms of which 6 ms to minimize.
[2024-05-24 17:29:09] [INFO ] Deduced a trap composed of 88 places in 511 ms of which 6 ms to minimize.
[2024-05-24 17:29:09] [INFO ] Deduced a trap composed of 62 places in 525 ms of which 6 ms to minimize.
[2024-05-24 17:29:10] [INFO ] Deduced a trap composed of 104 places in 518 ms of which 6 ms to minimize.
[2024-05-24 17:29:10] [INFO ] Deduced a trap composed of 76 places in 560 ms of which 6 ms to minimize.
[2024-05-24 17:29:11] [INFO ] Deduced a trap composed of 244 places in 526 ms of which 6 ms to minimize.
[2024-05-24 17:29:11] [INFO ] Deduced a trap composed of 94 places in 550 ms of which 6 ms to minimize.
[2024-05-24 17:29:12] [INFO ] Deduced a trap composed of 66 places in 554 ms of which 6 ms to minimize.
[2024-05-24 17:29:12] [INFO ] Deduced a trap composed of 67 places in 534 ms of which 6 ms to minimize.
[2024-05-24 17:29:13] [INFO ] Deduced a trap composed of 67 places in 531 ms of which 6 ms to minimize.
[2024-05-24 17:29:14] [INFO ] Deduced a trap composed of 68 places in 553 ms of which 6 ms to minimize.
[2024-05-24 17:29:14] [INFO ] Deduced a trap composed of 94 places in 544 ms of which 6 ms to minimize.
SMT process timed out in 61983ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 958 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 958/958 places, 3711/3711 transitions.
Applied a total of 0 rules in 96 ms. Remains 958 /958 variables (removed 0) and now considering 3711/3711 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 958/958 places, 3711/3711 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 958/958 places, 3711/3711 transitions.
Applied a total of 0 rules in 89 ms. Remains 958 /958 variables (removed 0) and now considering 3711/3711 (removed 0) transitions.
[2024-05-24 17:29:14] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:29:14] [INFO ] Invariant cache hit.
[2024-05-24 17:29:16] [INFO ] Implicit Places using invariants in 1123 ms returned []
[2024-05-24 17:29:16] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:29:16] [INFO ] Invariant cache hit.
[2024-05-24 17:29:16] [INFO ] State equation strengthened by 2173 read => feed constraints.
[2024-05-24 17:29:47] [INFO ] Performed 954/958 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 17:29:47] [INFO ] Implicit Places using invariants and state equation in 31546 ms returned []
Implicit Place search using SMT with State Equation took 32671 ms to find 0 implicit places.
[2024-05-24 17:29:47] [INFO ] Redundant transitions in 173 ms returned []
Running 3649 sub problems to find dead transitions.
[2024-05-24 17:29:47] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:29:47] [INFO ] Invariant cache hit.
[2024-05-24 17:29:47] [INFO ] State equation strengthened by 2173 read => feed constraints.
(s880 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 0.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 0.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 0.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 0.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 0.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 0.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 0.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 0.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 0.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 0.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 0.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/955 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3649 unsolved
SMT process timed out in 54075ms, After SMT, problems are : Problem set: 0 solved, 3649 unsolved
Search for dead transitions found 0 dead transitions in 54119ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87095 ms. Remains : 958/958 places, 3711/3711 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-05-24 17:30:41] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:30:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (282 resets) in 155 ms. (64 steps per ms)
BEST_FIRST walk for 10001 steps (36 resets) in 28 ms. (344 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 17:30:42] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:30:42] [INFO ] Invariant cache hit.
[2024-05-24 17:30:42] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-24 17:30:42] [INFO ] [Real]Absence check using 31 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-24 17:30:43] [INFO ] [Real]Absence check using state equation in 855 ms returned sat
[2024-05-24 17:30:43] [INFO ] State equation strengthened by 2173 read => feed constraints.
[2024-05-24 17:30:43] [INFO ] [Real]Added 2173 Read/Feed constraints in 415 ms returned sat
[2024-05-24 17:30:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 17:30:43] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-24 17:30:43] [INFO ] [Nat]Absence check using 31 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-24 17:30:44] [INFO ] [Nat]Absence check using state equation in 752 ms returned sat
[2024-05-24 17:30:45] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 17:30:45] [INFO ] [Nat]Added 2173 Read/Feed constraints in 1182 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 958 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 958/958 places, 3711/3711 transitions.
Applied a total of 0 rules in 97 ms. Remains 958 /958 variables (removed 0) and now considering 3711/3711 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 958/958 places, 3711/3711 transitions.
[2024-05-24 17:30:45] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:30:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (28284 resets) in 15494 ms. (64 steps per ms)
BEST_FIRST walk for 1000001 steps (3584 resets) in 2624 ms. (380 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 17:31:03] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:31:03] [INFO ] Invariant cache hit.
[2024-05-24 17:31:04] [INFO ] [Real]Absence check using 31 positive place invariants in 19 ms returned sat
[2024-05-24 17:31:04] [INFO ] [Real]Absence check using 31 positive and 14 generalized place invariants in 2 ms returned sat
[2024-05-24 17:31:04] [INFO ] [Real]Absence check using state equation in 735 ms returned sat
[2024-05-24 17:31:04] [INFO ] State equation strengthened by 2173 read => feed constraints.
[2024-05-24 17:31:05] [INFO ] [Real]Added 2173 Read/Feed constraints in 368 ms returned sat
[2024-05-24 17:31:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 17:31:05] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-24 17:31:05] [INFO ] [Nat]Absence check using 31 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-24 17:31:06] [INFO ] [Nat]Absence check using state equation in 732 ms returned sat
[2024-05-24 17:31:07] [INFO ] [Nat]Added 2173 Read/Feed constraints in 1208 ms returned sat
[2024-05-24 17:31:07] [INFO ] Deduced a trap composed of 235 places in 482 ms of which 6 ms to minimize.
[2024-05-24 17:31:08] [INFO ] Deduced a trap composed of 93 places in 558 ms of which 6 ms to minimize.
[2024-05-24 17:31:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1304 ms
[2024-05-24 17:31:08] [INFO ] Computed and/alt/rep : 1324/1905/1324 causal constraints (skipped 1927 transitions) in 212 ms.
[2024-05-24 17:31:10] [INFO ] Added : 29 causal constraints over 10 iterations in 2092 ms. Result :sat
Minimization took 4873 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 958 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 958/958 places, 3711/3711 transitions.
Applied a total of 0 rules in 96 ms. Remains 958 /958 variables (removed 0) and now considering 3711/3711 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 958/958 places, 3711/3711 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 958/958 places, 3711/3711 transitions.
Applied a total of 0 rules in 137 ms. Remains 958 /958 variables (removed 0) and now considering 3711/3711 (removed 0) transitions.
[2024-05-24 17:31:15] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:31:15] [INFO ] Invariant cache hit.
[2024-05-24 17:31:17] [INFO ] Implicit Places using invariants in 1271 ms returned []
[2024-05-24 17:31:17] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:31:17] [INFO ] Invariant cache hit.
[2024-05-24 17:31:18] [INFO ] State equation strengthened by 2173 read => feed constraints.
[2024-05-24 17:31:47] [INFO ] Implicit Places using invariants and state equation in 30680 ms returned []
Implicit Place search using SMT with State Equation took 31963 ms to find 0 implicit places.
[2024-05-24 17:31:48] [INFO ] Redundant transitions in 150 ms returned []
Running 3649 sub problems to find dead transitions.
[2024-05-24 17:31:48] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:31:48] [INFO ] Invariant cache hit.
[2024-05-24 17:31:48] [INFO ] State equation strengthened by 2173 read => feed constraints.
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/955 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3649 unsolved
SMT process timed out in 52784ms, After SMT, problems are : Problem set: 0 solved, 3649 unsolved
Search for dead transitions found 0 dead transitions in 52817ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85093 ms. Remains : 958/958 places, 3711/3711 transitions.
RANDOM walk for 40000 steps (1129 resets) in 1390 ms. (28 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (141 resets) in 291 ms. (137 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (141 resets) in 236 ms. (168 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 59911 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 2
Probabilistic random walk after 59911 steps, saw 25092 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-24 17:32:44] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:32:44] [INFO ] Invariant cache hit.
[2024-05-24 17:32:44] [INFO ] State equation strengthened by 2173 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 869/870 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/888 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:32:45] [INFO ] Deduced a trap composed of 89 places in 533 ms of which 6 ms to minimize.
[2024-05-24 17:32:45] [INFO ] Deduced a trap composed of 103 places in 531 ms of which 5 ms to minimize.
[2024-05-24 17:32:46] [INFO ] Deduced a trap composed of 87 places in 576 ms of which 5 ms to minimize.
[2024-05-24 17:32:47] [INFO ] Deduced a trap composed of 103 places in 519 ms of which 6 ms to minimize.
[2024-05-24 17:32:47] [INFO ] Deduced a trap composed of 169 places in 553 ms of which 6 ms to minimize.
[2024-05-24 17:32:48] [INFO ] Deduced a trap composed of 199 places in 546 ms of which 6 ms to minimize.
[2024-05-24 17:32:48] [INFO ] Deduced a trap composed of 171 places in 561 ms of which 7 ms to minimize.
[2024-05-24 17:32:49] [INFO ] Deduced a trap composed of 72 places in 545 ms of which 6 ms to minimize.
[2024-05-24 17:32:49] [INFO ] Deduced a trap composed of 198 places in 549 ms of which 5 ms to minimize.
SMT process timed out in 5358ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 958 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 958/958 places, 3711/3711 transitions.
Applied a total of 0 rules in 95 ms. Remains 958 /958 variables (removed 0) and now considering 3711/3711 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 958/958 places, 3711/3711 transitions.
RANDOM walk for 40000 steps (1130 resets) in 1452 ms. (27 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (142 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (140 resets) in 216 ms. (184 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 61092 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 2
Probabilistic random walk after 61092 steps, saw 25573 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
[2024-05-24 17:32:53] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:32:53] [INFO ] Invariant cache hit.
[2024-05-24 17:32:53] [INFO ] State equation strengthened by 2173 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 869/870 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/888 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:32:54] [INFO ] Deduced a trap composed of 89 places in 531 ms of which 5 ms to minimize.
[2024-05-24 17:32:54] [INFO ] Deduced a trap composed of 103 places in 542 ms of which 6 ms to minimize.
[2024-05-24 17:32:55] [INFO ] Deduced a trap composed of 87 places in 548 ms of which 6 ms to minimize.
[2024-05-24 17:32:56] [INFO ] Deduced a trap composed of 103 places in 550 ms of which 6 ms to minimize.
[2024-05-24 17:32:56] [INFO ] Deduced a trap composed of 169 places in 557 ms of which 6 ms to minimize.
[2024-05-24 17:32:57] [INFO ] Deduced a trap composed of 199 places in 550 ms of which 6 ms to minimize.
[2024-05-24 17:32:57] [INFO ] Deduced a trap composed of 171 places in 564 ms of which 6 ms to minimize.
[2024-05-24 17:32:58] [INFO ] Deduced a trap composed of 72 places in 564 ms of which 6 ms to minimize.
[2024-05-24 17:32:58] [INFO ] Deduced a trap composed of 198 places in 540 ms of which 5 ms to minimize.
[2024-05-24 17:32:59] [INFO ] Deduced a trap composed of 157 places in 541 ms of which 6 ms to minimize.
[2024-05-24 17:33:00] [INFO ] Deduced a trap composed of 174 places in 541 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/888 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 30/918 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:33:00] [INFO ] Deduced a trap composed of 5 places in 469 ms of which 6 ms to minimize.
[2024-05-24 17:33:01] [INFO ] Deduced a trap composed of 27 places in 482 ms of which 6 ms to minimize.
[2024-05-24 17:33:01] [INFO ] Deduced a trap composed of 46 places in 468 ms of which 6 ms to minimize.
[2024-05-24 17:33:02] [INFO ] Deduced a trap composed of 62 places in 494 ms of which 6 ms to minimize.
[2024-05-24 17:33:02] [INFO ] Deduced a trap composed of 75 places in 474 ms of which 7 ms to minimize.
[2024-05-24 17:33:03] [INFO ] Deduced a trap composed of 147 places in 494 ms of which 6 ms to minimize.
[2024-05-24 17:33:03] [INFO ] Deduced a trap composed of 149 places in 495 ms of which 6 ms to minimize.
[2024-05-24 17:33:04] [INFO ] Deduced a trap composed of 152 places in 475 ms of which 6 ms to minimize.
[2024-05-24 17:33:04] [INFO ] Deduced a trap composed of 85 places in 487 ms of which 5 ms to minimize.
[2024-05-24 17:33:05] [INFO ] Deduced a trap composed of 141 places in 487 ms of which 5 ms to minimize.
[2024-05-24 17:33:05] [INFO ] Deduced a trap composed of 75 places in 546 ms of which 6 ms to minimize.
[2024-05-24 17:33:06] [INFO ] Deduced a trap composed of 90 places in 505 ms of which 8 ms to minimize.
[2024-05-24 17:33:06] [INFO ] Deduced a trap composed of 95 places in 488 ms of which 6 ms to minimize.
[2024-05-24 17:33:07] [INFO ] Deduced a trap composed of 128 places in 529 ms of which 6 ms to minimize.
[2024-05-24 17:33:07] [INFO ] Deduced a trap composed of 135 places in 493 ms of which 6 ms to minimize.
[2024-05-24 17:33:08] [INFO ] Deduced a trap composed of 46 places in 519 ms of which 6 ms to minimize.
[2024-05-24 17:33:08] [INFO ] Deduced a trap composed of 115 places in 506 ms of which 6 ms to minimize.
[2024-05-24 17:33:09] [INFO ] Deduced a trap composed of 57 places in 550 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/918 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/918 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 28/946 variables, 28/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/946 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 12/958 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/958 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3313/4271 variables, 958/1032 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4271 variables, 2173/3205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4271 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/4271 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4271/4271 variables, and 3205 constraints, problems are : Problem set: 0 solved, 2 unsolved in 17247 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 958/958 constraints, ReadFeed: 2173/2173 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 869/870 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/888 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:33:11] [INFO ] Deduced a trap composed of 236 places in 526 ms of which 6 ms to minimize.
[2024-05-24 17:33:12] [INFO ] Deduced a trap composed of 73 places in 561 ms of which 6 ms to minimize.
[2024-05-24 17:33:12] [INFO ] Deduced a trap composed of 169 places in 522 ms of which 6 ms to minimize.
[2024-05-24 17:33:13] [INFO ] Deduced a trap composed of 170 places in 516 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/888 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/888 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 30/918 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/918 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:33:13] [INFO ] Deduced a trap composed of 154 places in 468 ms of which 6 ms to minimize.
[2024-05-24 17:33:14] [INFO ] Deduced a trap composed of 46 places in 482 ms of which 6 ms to minimize.
[2024-05-24 17:33:14] [INFO ] Deduced a trap composed of 62 places in 474 ms of which 6 ms to minimize.
[2024-05-24 17:33:15] [INFO ] Deduced a trap composed of 90 places in 485 ms of which 6 ms to minimize.
[2024-05-24 17:33:15] [INFO ] Deduced a trap composed of 165 places in 515 ms of which 6 ms to minimize.
[2024-05-24 17:33:16] [INFO ] Deduced a trap composed of 218 places in 489 ms of which 6 ms to minimize.
[2024-05-24 17:33:16] [INFO ] Deduced a trap composed of 92 places in 480 ms of which 6 ms to minimize.
[2024-05-24 17:33:17] [INFO ] Deduced a trap composed of 178 places in 494 ms of which 6 ms to minimize.
[2024-05-24 17:33:17] [INFO ] Deduced a trap composed of 85 places in 522 ms of which 5 ms to minimize.
[2024-05-24 17:33:18] [INFO ] Deduced a trap composed of 92 places in 495 ms of which 6 ms to minimize.
[2024-05-24 17:33:18] [INFO ] Deduced a trap composed of 95 places in 463 ms of which 6 ms to minimize.
[2024-05-24 17:33:19] [INFO ] Deduced a trap composed of 92 places in 468 ms of which 5 ms to minimize.
[2024-05-24 17:33:19] [INFO ] Deduced a trap composed of 97 places in 475 ms of which 6 ms to minimize.
[2024-05-24 17:33:20] [INFO ] Deduced a trap composed of 92 places in 479 ms of which 6 ms to minimize.
[2024-05-24 17:33:20] [INFO ] Deduced a trap composed of 97 places in 460 ms of which 6 ms to minimize.
[2024-05-24 17:33:21] [INFO ] Deduced a trap composed of 108 places in 528 ms of which 7 ms to minimize.
[2024-05-24 17:33:21] [INFO ] Deduced a trap composed of 119 places in 481 ms of which 6 ms to minimize.
[2024-05-24 17:33:22] [INFO ] Deduced a trap composed of 101 places in 461 ms of which 5 ms to minimize.
[2024-05-24 17:33:22] [INFO ] Deduced a trap composed of 263 places in 477 ms of which 6 ms to minimize.
[2024-05-24 17:33:23] [INFO ] Deduced a trap composed of 235 places in 452 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/918 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:33:23] [INFO ] Deduced a trap composed of 94 places in 505 ms of which 6 ms to minimize.
[2024-05-24 17:33:24] [INFO ] Deduced a trap composed of 153 places in 496 ms of which 6 ms to minimize.
[2024-05-24 17:33:25] [INFO ] Deduced a trap composed of 78 places in 571 ms of which 7 ms to minimize.
[2024-05-24 17:33:25] [INFO ] Deduced a trap composed of 82 places in 550 ms of which 6 ms to minimize.
[2024-05-24 17:33:26] [INFO ] Deduced a trap composed of 101 places in 497 ms of which 6 ms to minimize.
[2024-05-24 17:33:26] [INFO ] Deduced a trap composed of 131 places in 555 ms of which 6 ms to minimize.
[2024-05-24 17:33:27] [INFO ] Deduced a trap composed of 60 places in 587 ms of which 6 ms to minimize.
[2024-05-24 17:33:27] [INFO ] Deduced a trap composed of 92 places in 450 ms of which 6 ms to minimize.
[2024-05-24 17:33:28] [INFO ] Deduced a trap composed of 70 places in 592 ms of which 6 ms to minimize.
[2024-05-24 17:33:28] [INFO ] Deduced a trap composed of 92 places in 466 ms of which 6 ms to minimize.
[2024-05-24 17:33:29] [INFO ] Deduced a trap composed of 64 places in 523 ms of which 5 ms to minimize.
[2024-05-24 17:33:29] [INFO ] Deduced a trap composed of 97 places in 452 ms of which 5 ms to minimize.
[2024-05-24 17:33:30] [INFO ] Deduced a trap composed of 80 places in 588 ms of which 6 ms to minimize.
[2024-05-24 17:33:30] [INFO ] Deduced a trap composed of 64 places in 532 ms of which 6 ms to minimize.
[2024-05-24 17:33:31] [INFO ] Deduced a trap composed of 102 places in 534 ms of which 6 ms to minimize.
[2024-05-24 17:33:32] [INFO ] Deduced a trap composed of 72 places in 543 ms of which 6 ms to minimize.
[2024-05-24 17:33:32] [INFO ] Deduced a trap composed of 106 places in 465 ms of which 6 ms to minimize.
[2024-05-24 17:33:33] [INFO ] Deduced a trap composed of 260 places in 453 ms of which 5 ms to minimize.
[2024-05-24 17:33:33] [INFO ] Deduced a trap composed of 187 places in 497 ms of which 6 ms to minimize.
[2024-05-24 17:33:34] [INFO ] Deduced a trap composed of 78 places in 562 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/918 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:33:34] [INFO ] Deduced a trap composed of 71 places in 539 ms of which 6 ms to minimize.
[2024-05-24 17:33:35] [INFO ] Deduced a trap composed of 82 places in 530 ms of which 6 ms to minimize.
[2024-05-24 17:33:35] [INFO ] Deduced a trap composed of 267 places in 455 ms of which 6 ms to minimize.
[2024-05-24 17:33:36] [INFO ] Deduced a trap composed of 221 places in 486 ms of which 6 ms to minimize.
[2024-05-24 17:33:36] [INFO ] Deduced a trap composed of 223 places in 455 ms of which 5 ms to minimize.
[2024-05-24 17:33:37] [INFO ] Deduced a trap composed of 71 places in 556 ms of which 6 ms to minimize.
[2024-05-24 17:33:37] [INFO ] Deduced a trap composed of 225 places in 504 ms of which 6 ms to minimize.
[2024-05-24 17:33:38] [INFO ] Deduced a trap composed of 113 places in 500 ms of which 6 ms to minimize.
[2024-05-24 17:33:38] [INFO ] Deduced a trap composed of 67 places in 584 ms of which 6 ms to minimize.
[2024-05-24 17:33:39] [INFO ] Deduced a trap composed of 93 places in 561 ms of which 6 ms to minimize.
[2024-05-24 17:33:40] [INFO ] Deduced a trap composed of 235 places in 504 ms of which 6 ms to minimize.
[2024-05-24 17:33:40] [INFO ] Deduced a trap composed of 198 places in 478 ms of which 6 ms to minimize.
[2024-05-24 17:33:41] [INFO ] Deduced a trap composed of 112 places in 558 ms of which 5 ms to minimize.
[2024-05-24 17:33:41] [INFO ] Deduced a trap composed of 69 places in 580 ms of which 6 ms to minimize.
[2024-05-24 17:33:42] [INFO ] Deduced a trap composed of 68 places in 592 ms of which 6 ms to minimize.
[2024-05-24 17:33:42] [INFO ] Deduced a trap composed of 86 places in 528 ms of which 6 ms to minimize.
[2024-05-24 17:33:43] [INFO ] Deduced a trap composed of 113 places in 464 ms of which 6 ms to minimize.
[2024-05-24 17:33:43] [INFO ] Deduced a trap composed of 122 places in 458 ms of which 5 ms to minimize.
[2024-05-24 17:33:44] [INFO ] Deduced a trap composed of 61 places in 528 ms of which 5 ms to minimize.
[2024-05-24 17:33:44] [INFO ] Deduced a trap composed of 62 places in 531 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/918 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:33:45] [INFO ] Deduced a trap composed of 71 places in 531 ms of which 6 ms to minimize.
[2024-05-24 17:33:46] [INFO ] Deduced a trap composed of 203 places in 542 ms of which 6 ms to minimize.
[2024-05-24 17:33:46] [INFO ] Deduced a trap composed of 94 places in 528 ms of which 6 ms to minimize.
[2024-05-24 17:33:47] [INFO ] Deduced a trap composed of 82 places in 528 ms of which 6 ms to minimize.
[2024-05-24 17:33:47] [INFO ] Deduced a trap composed of 69 places in 552 ms of which 6 ms to minimize.
[2024-05-24 17:33:48] [INFO ] Deduced a trap composed of 113 places in 586 ms of which 6 ms to minimize.
[2024-05-24 17:33:48] [INFO ] Deduced a trap composed of 68 places in 556 ms of which 6 ms to minimize.
[2024-05-24 17:33:49] [INFO ] Deduced a trap composed of 88 places in 547 ms of which 6 ms to minimize.
[2024-05-24 17:33:50] [INFO ] Deduced a trap composed of 88 places in 550 ms of which 5 ms to minimize.
[2024-05-24 17:33:50] [INFO ] Deduced a trap composed of 62 places in 545 ms of which 6 ms to minimize.
[2024-05-24 17:33:51] [INFO ] Deduced a trap composed of 104 places in 543 ms of which 6 ms to minimize.
[2024-05-24 17:33:51] [INFO ] Deduced a trap composed of 76 places in 550 ms of which 6 ms to minimize.
[2024-05-24 17:33:52] [INFO ] Deduced a trap composed of 244 places in 569 ms of which 6 ms to minimize.
[2024-05-24 17:33:52] [INFO ] Deduced a trap composed of 94 places in 566 ms of which 7 ms to minimize.
[2024-05-24 17:33:53] [INFO ] Deduced a trap composed of 66 places in 539 ms of which 6 ms to minimize.
[2024-05-24 17:33:54] [INFO ] Deduced a trap composed of 67 places in 578 ms of which 6 ms to minimize.
[2024-05-24 17:33:54] [INFO ] Deduced a trap composed of 67 places in 513 ms of which 6 ms to minimize.
[2024-05-24 17:33:55] [INFO ] Deduced a trap composed of 68 places in 562 ms of which 9 ms to minimize.
[2024-05-24 17:33:55] [INFO ] Deduced a trap composed of 94 places in 553 ms of which 7 ms to minimize.
[2024-05-24 17:33:56] [INFO ] Deduced a trap composed of 120 places in 561 ms of which 6 ms to minimize.
SMT process timed out in 62839ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 958 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 958/958 places, 3711/3711 transitions.
Applied a total of 0 rules in 101 ms. Remains 958 /958 variables (removed 0) and now considering 3711/3711 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 958/958 places, 3711/3711 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 958/958 places, 3711/3711 transitions.
Applied a total of 0 rules in 103 ms. Remains 958 /958 variables (removed 0) and now considering 3711/3711 (removed 0) transitions.
[2024-05-24 17:33:56] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:33:56] [INFO ] Invariant cache hit.
[2024-05-24 17:33:57] [INFO ] Implicit Places using invariants in 1188 ms returned []
[2024-05-24 17:33:57] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:33:57] [INFO ] Invariant cache hit.
[2024-05-24 17:33:58] [INFO ] State equation strengthened by 2173 read => feed constraints.
[2024-05-24 17:34:29] [INFO ] Performed 954/958 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 17:34:29] [INFO ] Implicit Places using invariants and state equation in 31588 ms returned []
Implicit Place search using SMT with State Equation took 32777 ms to find 0 implicit places.
[2024-05-24 17:34:29] [INFO ] Redundant transitions in 155 ms returned []
Running 3649 sub problems to find dead transitions.
[2024-05-24 17:34:29] [INFO ] Flow matrix only has 3313 transitions (discarded 398 similar events)
[2024-05-24 17:34:29] [INFO ] Invariant cache hit.
[2024-05-24 17:34:29] [INFO ] State equation strengthened by 2173 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/955 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3649 unsolved
SMT process timed out in 51924ms, After SMT, problems are : Problem set: 0 solved, 3649 unsolved
Search for dead transitions found 0 dead transitions in 51963ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85013 ms. Remains : 958/958 places, 3711/3711 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-10 in 279629 ms.
[2024-05-24 17:35:22] [INFO ] Flatten gal took : 340 ms
[2024-05-24 17:35:22] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-24 17:35:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 958 places, 3711 transitions and 18504 arcs took 21 ms.
Total runtime 757765 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running MultiCrashLeafsetExtension-PT-S16C06
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 958
TRANSITIONS: 3711
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.097s, Sys 0.004s]
SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.009s, Sys 0.003s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1540
MODEL NAME: /home/mcc/execution/411/model
958 places, 3711 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 UpperBounds -timeout 360 -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="MultiCrashLeafsetExtension-PT-S16C06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 MultiCrashLeafsetExtension-PT-S16C06, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r245-tall-171654349000037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C06.tgz
mv MultiCrashLeafsetExtension-PT-S16C06 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;