About the Execution of GreatSPN+red for DBSingleClientW-PT-d2m05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1398.787 | 268308.00 | 326191.00 | 588.70 | 0 0 1 0 1 1 0 0 0 1 1 2 0 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.r091-tall-171624188000557.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 DBSingleClientW-PT-d2m05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188000557
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.7K 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 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 12 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Apr 12 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716299190153
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 13:46:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 13:46:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:46:31] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2024-05-21 13:46:31] [INFO ] Transformed 4763 places.
[2024-05-21 13:46:31] [INFO ] Transformed 2478 transitions.
[2024-05-21 13:46:31] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 319 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 3580 places in 25 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+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] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 2478 rows 1183 cols
[2024-05-21 13:46:31] [INFO ] Computed 6 invariants in 144 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1944, 1944, 7, 5, 7, 2, 5, 5, 7]
RANDOM walk for 10000 steps (2297 resets) in 318 ms. (31 steps per ms)
BEST_FIRST walk for 90004 steps (8495 resets) in 518 ms. (173 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[1944, 1944, 7, 5, 7, 2, 5, 5, 7]
[2024-05-21 13:46:32] [INFO ] Invariant cache hit.
[2024-05-21 13:46:33] [INFO ] [Real]Absence check using 2 positive place invariants in 23 ms returned sat
[2024-05-21 13:46:33] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 101 ms returned sat
[2024-05-21 13:46:33] [INFO ] [Real]Absence check using state equation in 645 ms returned sat
[2024-05-21 13:46:34] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2024-05-21 13:46:34] [INFO ] [Real]Added 1588 Read/Feed constraints in 718 ms returned sat
[2024-05-21 13:46:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:46:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2024-05-21 13:46:35] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 13:46:35] [INFO ] [Nat]Absence check using state equation in 655 ms returned sat
[2024-05-21 13:46:36] [INFO ] [Nat]Added 1588 Read/Feed constraints in 958 ms returned sat
[2024-05-21 13:46:37] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 701 ms.
[2024-05-21 13:46:39] [INFO ] Deduced a trap composed of 33 places in 785 ms of which 75 ms to minimize.
[2024-05-21 13:46:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 998 ms
[2024-05-21 13:46:39] [INFO ] Added : 10 causal constraints over 3 iterations in 2506 ms. Result :sat
Minimization took 537 ms.
[2024-05-21 13:46:40] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2024-05-21 13:46:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 13:46:40] [INFO ] [Real]Absence check using state equation in 692 ms returned sat
[2024-05-21 13:46:41] [INFO ] [Real]Added 1588 Read/Feed constraints in 700 ms returned sat
[2024-05-21 13:46:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:46:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-21 13:46:41] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 17 ms returned sat
[2024-05-21 13:46:42] [INFO ] [Nat]Absence check using state equation in 634 ms returned sat
[2024-05-21 13:46:43] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-21 13:46:43] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1302 ms returned sat
[2024-05-21 13:46:44] [INFO ] Deduced a trap composed of 56 places in 660 ms of which 14 ms to minimize.
[2024-05-21 13:46:45] [INFO ] Deduced a trap composed of 75 places in 707 ms of which 8 ms to minimize.
[2024-05-21 13:46:45] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2031 ms
[2024-05-21 13:46:45] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-21 13:46:45] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2024-05-21 13:46:46] [INFO ] [Real]Absence check using state equation in 670 ms returned sat
[2024-05-21 13:46:47] [INFO ] [Real]Added 1588 Read/Feed constraints in 735 ms returned sat
[2024-05-21 13:46:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:46:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 13:46:47] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2024-05-21 13:46:48] [INFO ] [Nat]Absence check using state equation in 658 ms returned sat
[2024-05-21 13:46:49] [INFO ] [Nat]Added 1588 Read/Feed constraints in 905 ms returned sat
[2024-05-21 13:46:49] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 646 ms.
[2024-05-21 13:46:50] [INFO ] Added : 9 causal constraints over 2 iterations in 1141 ms. Result :sat
Minimization took 634 ms.
[2024-05-21 13:46:51] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 13:46:51] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 17 ms returned sat
[2024-05-21 13:46:51] [INFO ] [Real]Absence check using state equation in 649 ms returned sat
[2024-05-21 13:46:52] [INFO ] [Real]Added 1588 Read/Feed constraints in 705 ms returned sat
[2024-05-21 13:46:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:46:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-21 13:46:52] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2024-05-21 13:46:53] [INFO ] [Nat]Absence check using state equation in 620 ms returned sat
[2024-05-21 13:46:54] [INFO ] [Nat]Added 1588 Read/Feed constraints in 973 ms returned sat
[2024-05-21 13:46:54] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 351 ms.
[2024-05-21 13:46:55] [INFO ] Deduced a trap composed of 33 places in 686 ms of which 7 ms to minimize.
[2024-05-21 13:46:56] [INFO ] Deduced a trap composed of 100 places in 668 ms of which 7 ms to minimize.
[2024-05-21 13:46:57] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2163 ms
Maximisation of solution failed !
Minimization took 2 ms.
[2024-05-21 13:46:57] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 13:46:57] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 13:46:58] [INFO ] [Real]Absence check using state equation in 645 ms returned sat
[2024-05-21 13:46:59] [INFO ] [Real]Added 1588 Read/Feed constraints in 708 ms returned sat
[2024-05-21 13:46:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:46:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 13:46:59] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 15 ms returned sat
[2024-05-21 13:47:00] [INFO ] [Nat]Absence check using state equation in 621 ms returned sat
[2024-05-21 13:47:01] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-21 13:47:01] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1627 ms returned unknown
[2024-05-21 13:47:01] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-21 13:47:01] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 15 ms returned sat
[2024-05-21 13:47:02] [INFO ] [Real]Absence check using state equation in 631 ms returned sat
[2024-05-21 13:47:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:47:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 13:47:02] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2024-05-21 13:47:03] [INFO ] [Nat]Absence check using state equation in 614 ms returned sat
[2024-05-21 13:47:04] [INFO ] [Nat]Added 1588 Read/Feed constraints in 832 ms returned sat
[2024-05-21 13:47:04] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 338 ms.
[2024-05-21 13:47:04] [INFO ] Added : 2 causal constraints over 1 iterations in 604 ms. Result :sat
Minimization took 628 ms.
[2024-05-21 13:47:05] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-21 13:47:05] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-21 13:47:06] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2024-05-21 13:47:06] [INFO ] [Real]Added 1588 Read/Feed constraints in 721 ms returned sat
[2024-05-21 13:47:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:47:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 13:47:07] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 15 ms returned sat
[2024-05-21 13:47:07] [INFO ] [Nat]Absence check using state equation in 586 ms returned sat
[2024-05-21 13:47:08] [INFO ] [Nat]Added 1588 Read/Feed constraints in 923 ms returned sat
[2024-05-21 13:47:09] [INFO ] Deduced a trap composed of 33 places in 648 ms of which 7 ms to minimize.
[2024-05-21 13:47:10] [INFO ] Deduced a trap composed of 48 places in 663 ms of which 7 ms to minimize.
[2024-05-21 13:47:10] [INFO ] Deduced a trap composed of 28 places in 673 ms of which 7 ms to minimize.
[2024-05-21 13:47:11] [INFO ] Deduced a trap composed of 76 places in 634 ms of which 7 ms to minimize.
[2024-05-21 13:47:12] [INFO ] Deduced a trap composed of 70 places in 657 ms of which 7 ms to minimize.
[2024-05-21 13:47:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 13:47:12] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 13:47:12] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 13:47:13] [INFO ] [Real]Absence check using state equation in 625 ms returned sat
[2024-05-21 13:47:14] [INFO ] [Real]Added 1588 Read/Feed constraints in 743 ms returned sat
[2024-05-21 13:47:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:47:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-21 13:47:14] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2024-05-21 13:47:15] [INFO ] [Nat]Absence check using state equation in 636 ms returned sat
[2024-05-21 13:47:16] [INFO ] [Nat]Added 1588 Read/Feed constraints in 956 ms returned sat
[2024-05-21 13:47:16] [INFO ] Deduced a trap composed of 170 places in 628 ms of which 7 ms to minimize.
[2024-05-21 13:47:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 794 ms
[2024-05-21 13:47:17] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 342 ms.
[2024-05-21 13:47:18] [INFO ] Deduced a trap composed of 32 places in 682 ms of which 8 ms to minimize.
[2024-05-21 13:47:19] [INFO ] Deduced a trap composed of 75 places in 683 ms of which 8 ms to minimize.
[2024-05-21 13:47:20] [INFO ] Deduced a trap composed of 29 places in 651 ms of which 7 ms to minimize.
[2024-05-21 13:47:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 13:47:20] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-21 13:47:20] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 13:47:20] [INFO ] [Real]Absence check using state equation in 596 ms returned sat
[2024-05-21 13:47:21] [INFO ] [Real]Added 1588 Read/Feed constraints in 893 ms returned sat
[2024-05-21 13:47:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:47:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-21 13:47:21] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2024-05-21 13:47:22] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2024-05-21 13:47:23] [INFO ] [Nat]Added 1588 Read/Feed constraints in 875 ms returned sat
[2024-05-21 13:47:24] [INFO ] Deduced a trap composed of 50 places in 688 ms of which 8 ms to minimize.
[2024-05-21 13:47:24] [INFO ] Deduced a trap composed of 157 places in 414 ms of which 7 ms to minimize.
[2024-05-21 13:47:25] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 1768 ms
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[1944, 1944, 7, 5, 7, 2, 5, 5, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[1944, 1944, 7, 5, 7, 2, 5, 5, 7]
Support contains 9 out of 1183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1136 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.8 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 217 transitions.
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 1136 transition count 2261
Discarding 388 places :
Symmetric choice reduction at 1 with 388 rule applications. Total rules 606 place count 748 transition count 1220
Iterating global reduction 1 with 388 rules applied. Total rules applied 994 place count 748 transition count 1220
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 1012 place count 748 transition count 1202
Discarding 311 places :
Symmetric choice reduction at 2 with 311 rule applications. Total rules 1323 place count 437 transition count 891
Iterating global reduction 2 with 311 rules applied. Total rules applied 1634 place count 437 transition count 891
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1645 place count 437 transition count 880
Discarding 234 places :
Symmetric choice reduction at 3 with 234 rule applications. Total rules 1879 place count 203 transition count 550
Iterating global reduction 3 with 234 rules applied. Total rules applied 2113 place count 203 transition count 550
Ensure Unique test removed 207 transitions
Reduce isomorphic transitions removed 207 transitions.
Iterating post reduction 3 with 207 rules applied. Total rules applied 2320 place count 203 transition count 343
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 2342 place count 181 transition count 306
Iterating global reduction 4 with 22 rules applied. Total rules applied 2364 place count 181 transition count 306
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2374 place count 181 transition count 296
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 2388 place count 167 transition count 282
Iterating global reduction 5 with 14 rules applied. Total rules applied 2402 place count 167 transition count 282
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2406 place count 167 transition count 278
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 2417 place count 156 transition count 267
Iterating global reduction 6 with 11 rules applied. Total rules applied 2428 place count 156 transition count 267
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 2433 place count 156 transition count 262
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2435 place count 154 transition count 258
Iterating global reduction 7 with 2 rules applied. Total rules applied 2437 place count 154 transition count 258
Applied a total of 2437 rules in 272 ms. Remains 154 /1183 variables (removed 1029) and now considering 258/2478 (removed 2220) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 292 ms. Remains : 154/1183 places, 258/2478 transitions.
// Phase 1: matrix 258 rows 154 cols
[2024-05-21 13:47:25] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[1944, 1944, 7, 5, 7, 2, 5, 5, 7]
RANDOM walk for 1000000 steps (229597 resets) in 1612 ms. (619 steps per ms)
BEST_FIRST walk for 9000004 steps (859201 resets) in 6459 ms. (1393 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[1944, 1944, 7, 5, 7, 2, 5, 5, 7]
[2024-05-21 13:47:33] [INFO ] Invariant cache hit.
[2024-05-21 13:47:33] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:47:33] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-21 13:47:33] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 13:47:33] [INFO ] [Real]Added 111 Read/Feed constraints in 26 ms returned sat
[2024-05-21 13:47:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:47:33] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 13:47:33] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-21 13:47:33] [INFO ] [Nat]Added 111 Read/Feed constraints in 23 ms returned sat
[2024-05-21 13:47:33] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 15 ms.
[2024-05-21 13:47:33] [INFO ] Added : 9 causal constraints over 2 iterations in 63 ms. Result :sat
Minimization took 196 ms.
[2024-05-21 13:47:34] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:47:34] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-21 13:47:34] [INFO ] [Real]Added 111 Read/Feed constraints in 18 ms returned sat
[2024-05-21 13:47:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:47:34] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 13:47:34] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-21 13:47:34] [INFO ] [Nat]Added 111 Read/Feed constraints in 32 ms returned sat
[2024-05-21 13:47:34] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 16 ms.
[2024-05-21 13:47:34] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-21 13:47:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-05-21 13:47:34] [INFO ] Added : 13 causal constraints over 3 iterations in 187 ms. Result :sat
Minimization took 189 ms.
[2024-05-21 13:47:34] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:47:34] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-21 13:47:34] [INFO ] [Real]Added 111 Read/Feed constraints in 17 ms returned sat
[2024-05-21 13:47:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:47:34] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:47:35] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-21 13:47:35] [INFO ] [Nat]Added 111 Read/Feed constraints in 20 ms returned sat
[2024-05-21 13:47:35] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 16 ms.
[2024-05-21 13:47:35] [INFO ] Added : 11 causal constraints over 3 iterations in 79 ms. Result :sat
Minimization took 179 ms.
[2024-05-21 13:47:35] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:47:35] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-21 13:47:35] [INFO ] [Real]Added 111 Read/Feed constraints in 15 ms returned sat
[2024-05-21 13:47:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:47:35] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:47:35] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-21 13:47:35] [INFO ] [Nat]Added 111 Read/Feed constraints in 17 ms returned sat
[2024-05-21 13:47:35] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 15 ms.
[2024-05-21 13:47:35] [INFO ] Added : 10 causal constraints over 4 iterations in 103 ms. Result :sat
Minimization took 178 ms.
[2024-05-21 13:47:35] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:47:35] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-21 13:47:35] [INFO ] [Real]Added 111 Read/Feed constraints in 24 ms returned sat
[2024-05-21 13:47:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:47:35] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 13:47:35] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-21 13:47:36] [INFO ] [Nat]Added 111 Read/Feed constraints in 37 ms returned sat
[2024-05-21 13:47:36] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 16 ms.
[2024-05-21 13:47:36] [INFO ] Added : 15 causal constraints over 3 iterations in 122 ms. Result :sat
Minimization took 184 ms.
[2024-05-21 13:47:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:47:36] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-21 13:47:36] [INFO ] [Real]Added 111 Read/Feed constraints in 13 ms returned sat
[2024-05-21 13:47:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:47:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 13:47:36] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-21 13:47:36] [INFO ] [Nat]Added 111 Read/Feed constraints in 11 ms returned sat
[2024-05-21 13:47:36] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-21 13:47:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-05-21 13:47:36] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 15 ms.
[2024-05-21 13:47:36] [INFO ] Added : 2 causal constraints over 1 iterations in 41 ms. Result :sat
Minimization took 163 ms.
[2024-05-21 13:47:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:47:36] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-21 13:47:36] [INFO ] [Real]Added 111 Read/Feed constraints in 18 ms returned sat
[2024-05-21 13:47:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:47:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:47:37] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-21 13:47:37] [INFO ] [Nat]Added 111 Read/Feed constraints in 21 ms returned sat
[2024-05-21 13:47:37] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 20 ms.
[2024-05-21 13:47:37] [INFO ] Added : 15 causal constraints over 4 iterations in 91 ms. Result :sat
Minimization took 185 ms.
[2024-05-21 13:47:37] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:47:37] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-21 13:47:37] [INFO ] [Real]Added 111 Read/Feed constraints in 16 ms returned sat
[2024-05-21 13:47:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:47:37] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 13:47:37] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-21 13:47:37] [INFO ] [Nat]Added 111 Read/Feed constraints in 21 ms returned sat
[2024-05-21 13:47:37] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 15 ms.
[2024-05-21 13:47:37] [INFO ] Added : 11 causal constraints over 3 iterations in 73 ms. Result :sat
Minimization took 182 ms.
[2024-05-21 13:47:37] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:47:37] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-21 13:47:37] [INFO ] [Real]Added 111 Read/Feed constraints in 17 ms returned sat
[2024-05-21 13:47:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:47:38] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:47:38] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-21 13:47:38] [INFO ] [Nat]Added 111 Read/Feed constraints in 26 ms returned sat
[2024-05-21 13:47:38] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 16 ms.
[2024-05-21 13:47:38] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-21 13:47:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2024-05-21 13:47:38] [INFO ] Added : 13 causal constraints over 3 iterations in 210 ms. Result :sat
Minimization took 185 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[1944, 1944, 7, 5, 7, 2, 5, 5, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[1944, 1944, 7, 5, 7, 2, 5, 5, 7]
Support contains 9 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Applied a total of 0 rules in 16 ms. Remains 154 /154 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 154/154 places, 258/258 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Applied a total of 0 rules in 9 ms. Remains 154 /154 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-05-21 13:47:38] [INFO ] Invariant cache hit.
[2024-05-21 13:47:39] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-21 13:47:39] [INFO ] Invariant cache hit.
[2024-05-21 13:47:39] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 13:47:39] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2024-05-21 13:47:39] [INFO ] Redundant transitions in 10 ms returned []
Running 257 sub problems to find dead transitions.
[2024-05-21 13:47:39] [INFO ] Invariant cache hit.
[2024-05-21 13:47:39] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (OVERLAPS) 1/154 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/412 variables, 154/156 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 111/267 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-21 13:47:48] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/412 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (OVERLAPS) 0/412 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 268 constraints, problems are : Problem set: 0 solved, 257 unsolved in 18589 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 154/154 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 1/154 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 258/412 variables, 154/157 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 111/268 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 257/525 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (OVERLAPS) 0/412 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 412/412 variables, and 525 constraints, problems are : Problem set: 0 solved, 257 unsolved in 21163 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 154/154 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 1/1 constraints]
After SMT, in 40286ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 40298ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40817 ms. Remains : 154/154 places, 258/258 transitions.
RANDOM walk for 40000 steps (9281 resets) in 1701 ms. (23 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (373 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (398 resets) in 48 ms. (81 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (385 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (349 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (371 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (396 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (375 resets) in 66 ms. (59 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (398 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (396 resets) in 36 ms. (108 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (409 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (405 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (330 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (392 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (398 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (383 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (417 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (379 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (376 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 529952 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :10 out of 18
Probabilistic random walk after 529952 steps, saw 210037 distinct states, run finished after 3004 ms. (steps per millisecond=176 ) properties seen :10
[2024-05-21 13:48:23] [INFO ] Invariant cache hit.
[2024-05-21 13:48:23] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 102/110 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 170/280 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX6 is UNSAT
Problem MAX7 is UNSAT
Problem MAX8 is UNSAT
After SMT solving in domain Real declared 405/412 variables, and 152 constraints, problems are : Problem set: 8 solved, 0 unsolved in 165 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 150/154 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 185ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-11 2 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1944, 1944, 7, 5, 7, 5, 5, 7]
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-02
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:[1944]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1944]
[2024-05-21 13:48:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1944]
RANDOM walk for 10000 steps (2314 resets) in 16 ms. (588 steps per ms)
BEST_FIRST walk for 10001 steps (1017 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1944]
[2024-05-21 13:48:23] [INFO ] Invariant cache hit.
[2024-05-21 13:48:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:48:23] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-21 13:48:23] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 13:48:23] [INFO ] [Real]Added 111 Read/Feed constraints in 17 ms returned sat
[2024-05-21 13:48:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:48:23] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:48:23] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-21 13:48:24] [INFO ] [Nat]Added 111 Read/Feed constraints in 24 ms returned sat
[2024-05-21 13:48:24] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 17 ms.
[2024-05-21 13:48:24] [INFO ] Added : 9 causal constraints over 2 iterations in 68 ms. Result :sat
Minimization took 196 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1944]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1944]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 246
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 146 transition count 243
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 139 transition count 235
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 139 transition count 235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 139 transition count 233
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 39 place count 135 transition count 225
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 135 transition count 225
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 48 place count 135 transition count 220
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 53 place count 130 transition count 198
Iterating global reduction 3 with 5 rules applied. Total rules applied 58 place count 130 transition count 198
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 60 place count 128 transition count 196
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 128 transition count 196
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 64 place count 128 transition count 194
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 127 transition count 193
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 127 transition count 193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 69 place count 127 transition count 190
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 71 place count 125 transition count 177
Iterating global reduction 5 with 2 rules applied. Total rules applied 73 place count 125 transition count 177
Applied a total of 73 rules in 27 ms. Remains 125 /154 variables (removed 29) and now considering 177/258 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 125/154 places, 177/258 transitions.
// Phase 1: matrix 177 rows 125 cols
[2024-05-21 13:48:24] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1944]
RANDOM walk for 1000000 steps (230375 resets) in 1097 ms. (910 steps per ms)
BEST_FIRST walk for 1000001 steps (95979 resets) in 521 ms. (1915 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1944]
[2024-05-21 13:48:25] [INFO ] Invariant cache hit.
[2024-05-21 13:48:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 13:48:26] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-21 13:48:26] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-21 13:48:26] [INFO ] [Real]Added 57 Read/Feed constraints in 9 ms returned sat
[2024-05-21 13:48:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:48:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 13:48:26] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-21 13:48:26] [INFO ] [Nat]Added 57 Read/Feed constraints in 10 ms returned sat
[2024-05-21 13:48:26] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 127 transitions) in 11 ms.
[2024-05-21 13:48:26] [INFO ] Added : 16 causal constraints over 4 iterations in 75 ms. Result :sat
Minimization took 67 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1944]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1944]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 177/177 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 125/125 places, 177/177 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 177/177 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2024-05-21 13:48:26] [INFO ] Invariant cache hit.
[2024-05-21 13:48:26] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-21 13:48:26] [INFO ] Invariant cache hit.
[2024-05-21 13:48:26] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-21 13:48:26] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-05-21 13:48:26] [INFO ] Redundant transitions in 2 ms returned []
Running 176 sub problems to find dead transitions.
[2024-05-21 13:48:26] [INFO ] Invariant cache hit.
[2024-05-21 13:48:26] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 177/302 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 57/184 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/302 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 184 constraints, problems are : Problem set: 0 solved, 176 unsolved in 4478 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 177/302 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 57/184 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 176/360 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 360 constraints, problems are : Problem set: 0 solved, 176 unsolved in 10678 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
After SMT, in 15455ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 15458ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15802 ms. Remains : 125/125 places, 177/177 transitions.
RANDOM walk for 40000 steps (9253 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3791 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3820 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
Probably explored full state space saw : 190433 states, properties seen :1
Probabilistic random walk after 461337 steps, saw 190433 distinct states, run finished after 675 ms. (steps per millisecond=683 ) properties seen :1
Explored full state space saw : 190906 states, properties seen :0
Exhaustive walk after 462250 steps, saw 190906 distinct states, run finished after 526 ms. (steps per millisecond=878 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1944]
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-02 in 19697 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-04
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:[1944]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1944]
// Phase 1: matrix 258 rows 154 cols
[2024-05-21 13:48:43] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1944]
RANDOM walk for 10000 steps (2275 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10000 steps (869 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1944]
[2024-05-21 13:48:43] [INFO ] Invariant cache hit.
[2024-05-21 13:48:43] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:48:43] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-21 13:48:43] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 13:48:43] [INFO ] [Real]Added 111 Read/Feed constraints in 19 ms returned sat
[2024-05-21 13:48:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:48:43] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:48:43] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-21 13:48:43] [INFO ] [Nat]Added 111 Read/Feed constraints in 29 ms returned sat
[2024-05-21 13:48:43] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 18 ms.
[2024-05-21 13:48:43] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-05-21 13:48:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2024-05-21 13:48:43] [INFO ] Added : 13 causal constraints over 3 iterations in 194 ms. Result :sat
Minimization took 189 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1944]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1944]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 246
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 146 transition count 243
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 139 transition count 235
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 139 transition count 235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 139 transition count 233
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 39 place count 135 transition count 225
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 135 transition count 225
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 48 place count 135 transition count 220
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 52 place count 131 transition count 206
Iterating global reduction 3 with 4 rules applied. Total rules applied 56 place count 131 transition count 206
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 58 place count 129 transition count 204
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 129 transition count 204
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 129 transition count 202
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 63 place count 128 transition count 201
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 128 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 67 place count 128 transition count 198
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 70 place count 125 transition count 178
Iterating global reduction 5 with 3 rules applied. Total rules applied 73 place count 125 transition count 178
Applied a total of 73 rules in 21 ms. Remains 125 /154 variables (removed 29) and now considering 178/258 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 125/154 places, 178/258 transitions.
// Phase 1: matrix 178 rows 125 cols
[2024-05-21 13:48:44] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1944]
RANDOM walk for 1000000 steps (229854 resets) in 1084 ms. (921 steps per ms)
BEST_FIRST walk for 1000000 steps (95517 resets) in 505 ms. (1976 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1944]
[2024-05-21 13:48:45] [INFO ] Invariant cache hit.
[2024-05-21 13:48:45] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 13:48:45] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-21 13:48:45] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 13:48:45] [INFO ] [Real]Added 58 Read/Feed constraints in 15 ms returned sat
[2024-05-21 13:48:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:48:45] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:48:45] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-21 13:48:45] [INFO ] [Nat]Added 58 Read/Feed constraints in 13 ms returned sat
[2024-05-21 13:48:46] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 128 transitions) in 10 ms.
[2024-05-21 13:48:46] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-21 13:48:46] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-21 13:48:46] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-21 13:48:46] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-21 13:48:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 293 ms
[2024-05-21 13:48:46] [INFO ] Added : 22 causal constraints over 5 iterations in 390 ms. Result :sat
Minimization took 87 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1944]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1944]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 125/125 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-21 13:48:46] [INFO ] Invariant cache hit.
[2024-05-21 13:48:46] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 13:48:46] [INFO ] Invariant cache hit.
[2024-05-21 13:48:46] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 13:48:46] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2024-05-21 13:48:46] [INFO ] Redundant transitions in 2 ms returned []
Running 177 sub problems to find dead transitions.
[2024-05-21 13:48:46] [INFO ] Invariant cache hit.
[2024-05-21 13:48:46] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/303 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 58/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/303 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 185 constraints, problems are : Problem set: 0 solved, 177 unsolved in 4493 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/303 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 58/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 177/362 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/303 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 362 constraints, problems are : Problem set: 0 solved, 177 unsolved in 9771 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
After SMT, in 14468ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 14471ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14801 ms. Remains : 125/125 places, 178/178 transitions.
RANDOM walk for 40000 steps (9201 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3876 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3866 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
Probably explored full state space saw : 193672 states, properties seen :1
Probabilistic random walk after 473596 steps, saw 193672 distinct states, run finished after 575 ms. (steps per millisecond=823 ) properties seen :1
Explored full state space saw : 194154 states, properties seen :0
Exhaustive walk after 474514 steps, saw 194154 distinct states, run finished after 420 ms. (steps per millisecond=1129 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1944]
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-04 in 19010 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-05
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:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 258 rows 154 cols
[2024-05-21 13:49:02] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2311 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10000 steps (955 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 13:49:02] [INFO ] Invariant cache hit.
[2024-05-21 13:49:02] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:49:02] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-21 13:49:02] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 13:49:02] [INFO ] [Real]Added 111 Read/Feed constraints in 18 ms returned sat
[2024-05-21 13:49:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:49:02] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:49:02] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-21 13:49:02] [INFO ] [Nat]Added 111 Read/Feed constraints in 20 ms returned sat
[2024-05-21 13:49:02] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 15 ms.
[2024-05-21 13:49:02] [INFO ] Added : 11 causal constraints over 3 iterations in 79 ms. Result :sat
Minimization took 182 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 146 transition count 242
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 140 transition count 235
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 140 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 140 transition count 234
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 37 place count 136 transition count 226
Iterating global reduction 2 with 4 rules applied. Total rules applied 41 place count 136 transition count 226
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 46 place count 136 transition count 221
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 51 place count 131 transition count 199
Iterating global reduction 3 with 5 rules applied. Total rules applied 56 place count 131 transition count 199
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 58 place count 129 transition count 197
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 129 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 129 transition count 195
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 63 place count 128 transition count 194
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 128 transition count 194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 67 place count 128 transition count 191
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 69 place count 126 transition count 176
Iterating global reduction 5 with 2 rules applied. Total rules applied 71 place count 126 transition count 176
Applied a total of 71 rules in 36 ms. Remains 126 /154 variables (removed 28) and now considering 176/258 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 126/154 places, 176/258 transitions.
// Phase 1: matrix 176 rows 126 cols
[2024-05-21 13:49:03] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (230069 resets) in 1061 ms. (941 steps per ms)
BEST_FIRST walk for 1000001 steps (95534 resets) in 508 ms. (1964 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 13:49:04] [INFO ] Invariant cache hit.
[2024-05-21 13:49:04] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 13:49:04] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-21 13:49:04] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 13:49:04] [INFO ] [Real]Added 55 Read/Feed constraints in 8 ms returned sat
[2024-05-21 13:49:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:49:04] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:49:04] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-21 13:49:04] [INFO ] [Nat]Added 55 Read/Feed constraints in 10 ms returned sat
[2024-05-21 13:49:04] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 125 transitions) in 9 ms.
[2024-05-21 13:49:04] [INFO ] Added : 16 causal constraints over 4 iterations in 69 ms. Result :sat
Minimization took 67 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 126/126 places, 176/176 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-21 13:49:05] [INFO ] Invariant cache hit.
[2024-05-21 13:49:05] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 13:49:05] [INFO ] Invariant cache hit.
[2024-05-21 13:49:05] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 13:49:05] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-05-21 13:49:05] [INFO ] Redundant transitions in 1 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-21 13:49:05] [INFO ] Invariant cache hit.
[2024-05-21 13:49:05] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/302 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 55/183 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 0/302 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 183 constraints, problems are : Problem set: 0 solved, 175 unsolved in 4419 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/302 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 55/183 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 175/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 358 constraints, problems are : Problem set: 0 solved, 175 unsolved in 10200 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints]
After SMT, in 14816ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 14821ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15172 ms. Remains : 126/126 places, 176/176 transitions.
RANDOM walk for 40000 steps (9184 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3864 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3918 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
Probably explored full state space saw : 189798 states, properties seen :1
Probabilistic random walk after 458920 steps, saw 189798 distinct states, run finished after 717 ms. (steps per millisecond=640 ) properties seen :1
Explored full state space saw : 190198 states, properties seen :0
Exhaustive walk after 459670 steps, saw 190198 distinct states, run finished after 417 ms. (steps per millisecond=1102 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-05 in 18957 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-09
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:[5]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[5]
// Phase 1: matrix 258 rows 154 cols
[2024-05-21 13:49:21] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 10000 steps (2349 resets) in 18 ms. (526 steps per ms)
BEST_FIRST walk for 10001 steps (983 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[5]
[2024-05-21 13:49:21] [INFO ] Invariant cache hit.
[2024-05-21 13:49:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:49:21] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-21 13:49:21] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 13:49:21] [INFO ] [Real]Added 111 Read/Feed constraints in 16 ms returned sat
[2024-05-21 13:49:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:49:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:49:21] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-21 13:49:21] [INFO ] [Nat]Added 111 Read/Feed constraints in 17 ms returned sat
[2024-05-21 13:49:21] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 15 ms.
[2024-05-21 13:49:21] [INFO ] Added : 10 causal constraints over 4 iterations in 87 ms. Result :sat
Minimization took 183 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[5]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 249
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 249
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 146 transition count 245
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 140 transition count 238
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 140 transition count 238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 34 place count 140 transition count 236
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 137 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 137 transition count 230
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 45 place count 137 transition count 225
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 49 place count 133 transition count 204
Iterating global reduction 3 with 4 rules applied. Total rules applied 53 place count 133 transition count 204
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 132 transition count 203
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 132 transition count 203
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 131 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 131 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 60 place count 131 transition count 199
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 63 place count 128 transition count 179
Iterating global reduction 4 with 3 rules applied. Total rules applied 66 place count 128 transition count 179
Applied a total of 66 rules in 19 ms. Remains 128 /154 variables (removed 26) and now considering 179/258 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 128/154 places, 179/258 transitions.
// Phase 1: matrix 179 rows 128 cols
[2024-05-21 13:49:22] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 1000000 steps (229940 resets) in 1074 ms. (930 steps per ms)
BEST_FIRST walk for 1000001 steps (95499 resets) in 501 ms. (1992 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[5]
[2024-05-21 13:49:23] [INFO ] Invariant cache hit.
[2024-05-21 13:49:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:49:23] [INFO ] [Real]Absence check using state equation in 30 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[1]
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-09 in 2230 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-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:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 258 rows 154 cols
[2024-05-21 13:49:23] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2308 resets) in 18 ms. (526 steps per ms)
BEST_FIRST walk for 10000 steps (962 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 13:49:23] [INFO ] Invariant cache hit.
[2024-05-21 13:49:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:49:23] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-21 13:49:23] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 13:49:23] [INFO ] [Real]Added 111 Read/Feed constraints in 26 ms returned sat
[2024-05-21 13:49:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:49:23] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:49:23] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-21 13:49:23] [INFO ] [Nat]Added 111 Read/Feed constraints in 36 ms returned sat
[2024-05-21 13:49:23] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 18 ms.
[2024-05-21 13:49:24] [INFO ] Added : 15 causal constraints over 3 iterations in 103 ms. Result :sat
Minimization took 190 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 146 transition count 242
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 140 transition count 235
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 140 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 140 transition count 234
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 37 place count 136 transition count 226
Iterating global reduction 2 with 4 rules applied. Total rules applied 41 place count 136 transition count 226
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 46 place count 136 transition count 221
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 50 place count 132 transition count 207
Iterating global reduction 3 with 4 rules applied. Total rules applied 54 place count 132 transition count 207
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 56 place count 130 transition count 205
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 130 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 130 transition count 203
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 129 transition count 202
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 129 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 65 place count 129 transition count 199
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 68 place count 126 transition count 179
Iterating global reduction 5 with 3 rules applied. Total rules applied 71 place count 126 transition count 179
Applied a total of 71 rules in 19 ms. Remains 126 /154 variables (removed 28) and now considering 179/258 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 126/154 places, 179/258 transitions.
// Phase 1: matrix 179 rows 126 cols
[2024-05-21 13:49:24] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (230055 resets) in 1093 ms. (914 steps per ms)
BEST_FIRST walk for 1000000 steps (95349 resets) in 532 ms. (1876 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 13:49:25] [INFO ] Invariant cache hit.
[2024-05-21 13:49:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:49:26] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-21 13:49:26] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 13:49:26] [INFO ] [Real]Added 58 Read/Feed constraints in 13 ms returned sat
[2024-05-21 13:49:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:49:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 13:49:26] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-21 13:49:26] [INFO ] [Nat]Added 58 Read/Feed constraints in 13 ms returned sat
[2024-05-21 13:49:26] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 128 transitions) in 11 ms.
[2024-05-21 13:49:26] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-21 13:49:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2024-05-21 13:49:26] [INFO ] Added : 16 causal constraints over 4 iterations in 158 ms. Result :sat
Minimization took 74 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 179/179 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 126/126 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 179/179 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-05-21 13:49:26] [INFO ] Invariant cache hit.
[2024-05-21 13:49:26] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 13:49:26] [INFO ] Invariant cache hit.
[2024-05-21 13:49:26] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 13:49:26] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2024-05-21 13:49:26] [INFO ] Redundant transitions in 0 ms returned []
Running 178 sub problems to find dead transitions.
[2024-05-21 13:49:26] [INFO ] Invariant cache hit.
[2024-05-21 13:49:26] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/305 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 58/186 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/305 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 186 constraints, problems are : Problem set: 0 solved, 178 unsolved in 5871 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/305 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 58/186 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 178/364 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 0/305 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 305/305 variables, and 364 constraints, problems are : Problem set: 0 solved, 178 unsolved in 12829 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
After SMT, in 18894ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 18897ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19224 ms. Remains : 126/126 places, 179/179 transitions.
RANDOM walk for 40000 steps (9189 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (3863 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3846 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
Probably explored full state space saw : 194472 states, properties seen :1
Probabilistic random walk after 474516 steps, saw 194472 distinct states, run finished after 586 ms. (steps per millisecond=809 ) properties seen :1
Explored full state space saw : 194970 states, properties seen :0
Exhaustive walk after 475450 steps, saw 194970 distinct states, run finished after 412 ms. (steps per millisecond=1154 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-10 in 23127 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-13
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:[5]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[5]
// Phase 1: matrix 258 rows 154 cols
[2024-05-21 13:49:46] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 10000 steps (2304 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10000 steps (947 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[5]
[2024-05-21 13:49:46] [INFO ] Invariant cache hit.
[2024-05-21 13:49:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 13:49:46] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-21 13:49:46] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 13:49:46] [INFO ] [Real]Added 111 Read/Feed constraints in 18 ms returned sat
[2024-05-21 13:49:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:49:46] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:49:46] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-21 13:49:47] [INFO ] [Nat]Added 111 Read/Feed constraints in 21 ms returned sat
[2024-05-21 13:49:47] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 15 ms.
[2024-05-21 13:49:47] [INFO ] Added : 15 causal constraints over 4 iterations in 87 ms. Result :sat
Minimization took 192 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[5]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 146 transition count 242
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 141 transition count 236
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 141 transition count 236
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 141 transition count 234
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 138 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 138 transition count 230
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 43 place count 138 transition count 225
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 47 place count 134 transition count 204
Iterating global reduction 3 with 4 rules applied. Total rules applied 51 place count 134 transition count 204
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 133 transition count 203
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 133 transition count 203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 55 place count 133 transition count 201
Applied a total of 55 rules in 12 ms. Remains 133 /154 variables (removed 21) and now considering 201/258 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 133/154 places, 201/258 transitions.
// Phase 1: matrix 201 rows 133 cols
[2024-05-21 13:49:47] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 1000000 steps (230320 resets) in 1214 ms. (823 steps per ms)
BEST_FIRST walk for 1000001 steps (95286 resets) in 575 ms. (1736 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[5]
[2024-05-21 13:49:49] [INFO ] Invariant cache hit.
[2024-05-21 13:49:49] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:49:49] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-21 13:49:49] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-21 13:49:49] [INFO ] [Real]Added 74 Read/Feed constraints in 14 ms returned sat
[2024-05-21 13:49:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:49:49] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:49:49] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-21 13:49:49] [INFO ] [Nat]Added 74 Read/Feed constraints in 17 ms returned sat
[2024-05-21 13:49:49] [INFO ] Computed and/alt/rep : 52/123/52 causal constraints (skipped 148 transitions) in 13 ms.
[2024-05-21 13:49:49] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-21 13:49:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-05-21 13:49:49] [INFO ] Added : 12 causal constraints over 4 iterations in 151 ms. Result :sat
Minimization took 115 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[5]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 201/201 transitions.
Applied a total of 0 rules in 4 ms. Remains 133 /133 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 133/133 places, 201/201 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 201/201 transitions.
Applied a total of 0 rules in 3 ms. Remains 133 /133 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2024-05-21 13:49:49] [INFO ] Invariant cache hit.
[2024-05-21 13:49:49] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 13:49:49] [INFO ] Invariant cache hit.
[2024-05-21 13:49:49] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-21 13:49:50] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2024-05-21 13:49:50] [INFO ] Redundant transitions in 1 ms returned []
Running 200 sub problems to find dead transitions.
[2024-05-21 13:49:50] [INFO ] Invariant cache hit.
[2024-05-21 13:49:50] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 201/334 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 74/209 constraints. Problems are: Problem set: 0 solved, 200 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/334 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 209 constraints, problems are : Problem set: 0 solved, 200 unsolved in 5572 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 133/133 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 201/334 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 74/209 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 200/409 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 0/334 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 409 constraints, problems are : Problem set: 0 solved, 200 unsolved in 13997 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 133/133 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 19806ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 19808ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20256 ms. Remains : 133/133 places, 201/201 transitions.
RANDOM walk for 40000 steps (9248 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (3749 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3780 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
Probably explored full state space saw : 222751 states, properties seen :1
Probabilistic random walk after 556807 steps, saw 222751 distinct states, run finished after 738 ms. (steps per millisecond=754 ) properties seen :1
Explored full state space saw : 224184 states, properties seen :0
Exhaustive walk after 559488 steps, saw 224184 distinct states, run finished after 564 ms. (steps per millisecond=992 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[5]
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-13 in 24551 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-14
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:[5]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[5]
// Phase 1: matrix 258 rows 154 cols
[2024-05-21 13:50:11] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 10000 steps (2335 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10001 steps (907 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[5]
[2024-05-21 13:50:11] [INFO ] Invariant cache hit.
[2024-05-21 13:50:11] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 13:50:11] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-21 13:50:11] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 13:50:11] [INFO ] [Real]Added 111 Read/Feed constraints in 17 ms returned sat
[2024-05-21 13:50:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:50:11] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 13:50:11] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-21 13:50:11] [INFO ] [Nat]Added 111 Read/Feed constraints in 22 ms returned sat
[2024-05-21 13:50:11] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 15 ms.
[2024-05-21 13:50:11] [INFO ] Added : 11 causal constraints over 3 iterations in 75 ms. Result :sat
Minimization took 186 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[5]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 146 transition count 242
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 140 transition count 235
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 140 transition count 235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 34 place count 140 transition count 233
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 137 transition count 226
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 137 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 137 transition count 224
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 44 place count 135 transition count 222
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 135 transition count 222
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 48 place count 133 transition count 220
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 133 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 133 transition count 218
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 53 place count 132 transition count 217
Iterating global reduction 4 with 1 rules applied. Total rules applied 54 place count 132 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 57 place count 132 transition count 214
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 60 place count 129 transition count 194
Iterating global reduction 5 with 3 rules applied. Total rules applied 63 place count 129 transition count 194
Applied a total of 63 rules in 26 ms. Remains 129 /154 variables (removed 25) and now considering 194/258 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 129/154 places, 194/258 transitions.
// Phase 1: matrix 194 rows 129 cols
[2024-05-21 13:50:11] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 1000000 steps (229980 resets) in 1217 ms. (821 steps per ms)
BEST_FIRST walk for 1000000 steps (95054 resets) in 567 ms. (1760 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[5]
[2024-05-21 13:50:13] [INFO ] Invariant cache hit.
[2024-05-21 13:50:13] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:50:13] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-21 13:50:13] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-21 13:50:13] [INFO ] [Real]Added 73 Read/Feed constraints in 12 ms returned sat
[2024-05-21 13:50:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:50:13] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:50:13] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-21 13:50:13] [INFO ] [Nat]Added 73 Read/Feed constraints in 15 ms returned sat
[2024-05-21 13:50:13] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 143 transitions) in 11 ms.
[2024-05-21 13:50:14] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-21 13:50:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-05-21 13:50:14] [INFO ] Added : 10 causal constraints over 2 iterations in 139 ms. Result :sat
Minimization took 106 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[5]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 194/194 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 129/129 places, 194/194 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 194/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2024-05-21 13:50:14] [INFO ] Invariant cache hit.
[2024-05-21 13:50:14] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 13:50:14] [INFO ] Invariant cache hit.
[2024-05-21 13:50:14] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-21 13:50:14] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2024-05-21 13:50:14] [INFO ] Redundant transitions in 1 ms returned []
Running 193 sub problems to find dead transitions.
[2024-05-21 13:50:14] [INFO ] Invariant cache hit.
[2024-05-21 13:50:14] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/323 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 73/204 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/323 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 204 constraints, problems are : Problem set: 0 solved, 193 unsolved in 5262 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 129/129 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/323 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 73/204 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 193/397 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 0/323 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 397 constraints, problems are : Problem set: 0 solved, 193 unsolved in 13266 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 129/129 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints]
After SMT, in 18751ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 18753ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19174 ms. Remains : 129/129 places, 194/194 transitions.
RANDOM walk for 40000 steps (9239 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (3781 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3911 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
Probably explored full state space saw : 205416 states, properties seen :1
Probabilistic random walk after 510014 steps, saw 205416 distinct states, run finished after 663 ms. (steps per millisecond=769 ) properties seen :1
Explored full state space saw : 207012 states, properties seen :0
Exhaustive walk after 512925 steps, saw 207012 distinct states, run finished after 513 ms. (steps per millisecond=999 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[5]
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-14 in 23313 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-15
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:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 258 rows 154 cols
[2024-05-21 13:50:34] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2281 resets) in 20 ms. (476 steps per ms)
BEST_FIRST walk for 10001 steps (925 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 13:50:34] [INFO ] Invariant cache hit.
[2024-05-21 13:50:34] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:50:34] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-21 13:50:34] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 13:50:34] [INFO ] [Real]Added 111 Read/Feed constraints in 16 ms returned sat
[2024-05-21 13:50:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:50:34] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:50:34] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-21 13:50:34] [INFO ] [Nat]Added 111 Read/Feed constraints in 27 ms returned sat
[2024-05-21 13:50:34] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 16 ms.
[2024-05-21 13:50:35] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-21 13:50:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2024-05-21 13:50:35] [INFO ] Added : 13 causal constraints over 3 iterations in 222 ms. Result :sat
Minimization took 197 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 246
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 146 transition count 243
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 140 transition count 237
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 140 transition count 237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 140 transition count 235
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 36 place count 137 transition count 228
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 137 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 43 place count 137 transition count 224
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 48 place count 132 transition count 202
Iterating global reduction 3 with 5 rules applied. Total rules applied 53 place count 132 transition count 202
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 55 place count 130 transition count 200
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 130 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 59 place count 130 transition count 198
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 60 place count 129 transition count 197
Iterating global reduction 4 with 1 rules applied. Total rules applied 61 place count 129 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 64 place count 129 transition count 194
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 67 place count 126 transition count 174
Iterating global reduction 5 with 3 rules applied. Total rules applied 70 place count 126 transition count 174
Applied a total of 70 rules in 16 ms. Remains 126 /154 variables (removed 28) and now considering 174/258 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 126/154 places, 174/258 transitions.
// Phase 1: matrix 174 rows 126 cols
[2024-05-21 13:50:35] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (229730 resets) in 1067 ms. (936 steps per ms)
BEST_FIRST walk for 1000001 steps (95915 resets) in 501 ms. (1992 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 13:50:37] [INFO ] Invariant cache hit.
[2024-05-21 13:50:37] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 13:50:37] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-21 13:50:37] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-21 13:50:37] [INFO ] [Real]Added 51 Read/Feed constraints in 7 ms returned sat
[2024-05-21 13:50:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:50:37] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 13:50:37] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-21 13:50:37] [INFO ] [Nat]Added 51 Read/Feed constraints in 13 ms returned sat
[2024-05-21 13:50:37] [INFO ] Computed and/alt/rep : 50/124/50 causal constraints (skipped 123 transitions) in 10 ms.
[2024-05-21 13:50:37] [INFO ] Added : 10 causal constraints over 3 iterations in 50 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 174/174 transitions.
Applied a total of 0 rules in 2 ms. Remains 126 /126 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 126/126 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 174/174 transitions.
Applied a total of 0 rules in 2 ms. Remains 126 /126 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2024-05-21 13:50:37] [INFO ] Invariant cache hit.
[2024-05-21 13:50:37] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 13:50:37] [INFO ] Invariant cache hit.
[2024-05-21 13:50:37] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-21 13:50:37] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-05-21 13:50:37] [INFO ] Redundant transitions in 1 ms returned []
Running 173 sub problems to find dead transitions.
[2024-05-21 13:50:37] [INFO ] Invariant cache hit.
[2024-05-21 13:50:37] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/300 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 51/179 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/300 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 179 constraints, problems are : Problem set: 0 solved, 173 unsolved in 4814 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/300 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 51/179 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 173/352 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 0/300 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 352 constraints, problems are : Problem set: 0 solved, 173 unsolved in 12270 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints]
After SMT, in 17292ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 17295ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17618 ms. Remains : 126/126 places, 174/174 transitions.
RANDOM walk for 40000 steps (9173 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3726 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (3873 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
Probably explored full state space saw : 195530 states, properties seen :1
Probabilistic random walk after 472686 steps, saw 195530 distinct states, run finished after 566 ms. (steps per millisecond=835 ) properties seen :1
Explored full state space saw : 195814 states, properties seen :0
Exhaustive walk after 473234 steps, saw 195814 distinct states, run finished after 418 ms. (steps per millisecond=1132 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-15 in 21422 ms.
[2024-05-21 13:50:56] [INFO ] Flatten gal took : 57 ms
[2024-05-21 13:50:56] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-21 13:50:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 154 places, 258 transitions and 1018 arcs took 5 ms.
Total runtime 265033 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DBSingleClientW-PT-d2m05
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 154
TRANSITIONS: 258
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.002s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
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: 1014
MODEL NAME: /home/mcc/execution/413/model
154 places, 258 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.
Building monolithic NSF...
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-04 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716299458461
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="DBSingleClientW-PT-d2m05"
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 DBSingleClientW-PT-d2m05, 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 r091-tall-171624188000557"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m05.tgz
mv DBSingleClientW-PT-d2m05 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 ;