About the Execution of 2023-gold for RERS17pb113-PT-3
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16217.743 | 3600000.00 | 3708008.00 | 22796.60 | ? 3 3 ? ? 3 3 3 ? 3 ? ? ? ? 3 ? | 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.r329-tall-171662361500081.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 gold2023
Input is RERS17pb113-PT-3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662361500081
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 15M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME RERS17pb113-PT-3-UpperBounds-00
FORMULA_NAME RERS17pb113-PT-3-UpperBounds-01
FORMULA_NAME RERS17pb113-PT-3-UpperBounds-02
FORMULA_NAME RERS17pb113-PT-3-UpperBounds-03
FORMULA_NAME RERS17pb113-PT-3-UpperBounds-04
FORMULA_NAME RERS17pb113-PT-3-UpperBounds-05
FORMULA_NAME RERS17pb113-PT-3-UpperBounds-06
FORMULA_NAME RERS17pb113-PT-3-UpperBounds-07
FORMULA_NAME RERS17pb113-PT-3-UpperBounds-08
FORMULA_NAME RERS17pb113-PT-3-UpperBounds-09
FORMULA_NAME RERS17pb113-PT-3-UpperBounds-10
FORMULA_NAME RERS17pb113-PT-3-UpperBounds-11
FORMULA_NAME RERS17pb113-PT-3-UpperBounds-12
FORMULA_NAME RERS17pb113-PT-3-UpperBounds-13
FORMULA_NAME RERS17pb113-PT-3-UpperBounds-14
FORMULA_NAME RERS17pb113-PT-3-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716780382168
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS17pb113-PT-3
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-27 03:26:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 03:26:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 03:26:24] [INFO ] Load time of PNML (sax parser for PT used): 703 ms
[2024-05-27 03:26:24] [INFO ] Transformed 639 places.
[2024-05-27 03:26:24] [INFO ] Transformed 31353 transitions.
[2024-05-27 03:26:24] [INFO ] Parsed PT model containing 639 places and 31353 transitions and 125418 arcs in 1030 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Normalized transition count is 18326 out of 31353 initially.
// Phase 1: matrix 18326 rows 639 cols
[2024-05-27 03:26:25] [INFO ] Computed 25 invariants in 141 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 16) seen :18
FORMULA RERS17pb113-PT-3-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 15) seen :2
[2024-05-27 03:26:26] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 639 cols
[2024-05-27 03:26:26] [INFO ] Computed 25 invariants in 94 ms
[2024-05-27 03:26:26] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-27 03:26:26] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-27 03:26:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:26:31] [INFO ] [Real]Absence check using state equation in 4838 ms returned unknown
[2024-05-27 03:26:31] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:26:31] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-27 03:26:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:26:36] [INFO ] [Real]Absence check using state equation in 4934 ms returned unknown
[2024-05-27 03:26:36] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:26:36] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 4 ms returned sat
[2024-05-27 03:26:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:26:41] [INFO ] [Real]Absence check using state equation in 4938 ms returned unknown
[2024-05-27 03:26:41] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-27 03:26:41] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-27 03:26:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:26:46] [INFO ] [Real]Absence check using state equation in 4937 ms returned unknown
[2024-05-27 03:26:46] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-27 03:26:46] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 1 ms returned sat
[2024-05-27 03:26:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:26:51] [INFO ] [Real]Absence check using state equation in 4923 ms returned unknown
[2024-05-27 03:26:51] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-27 03:26:51] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-27 03:26:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:26:56] [INFO ] [Real]Absence check using state equation in 4935 ms returned unknown
[2024-05-27 03:26:56] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:26:56] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-27 03:26:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:27:01] [INFO ] [Real]Absence check using state equation in 4930 ms returned unknown
[2024-05-27 03:27:01] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:27:01] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-27 03:27:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:27:06] [INFO ] [Real]Absence check using state equation in 4929 ms returned unknown
[2024-05-27 03:27:06] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:27:06] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-27 03:27:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:27:11] [INFO ] [Real]Absence check using state equation in 4937 ms returned unknown
[2024-05-27 03:27:11] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-27 03:27:11] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-27 03:27:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:27:16] [INFO ] [Real]Absence check using state equation in 4938 ms returned unknown
[2024-05-27 03:27:16] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:27:16] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 1 ms returned sat
[2024-05-27 03:27:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:27:21] [INFO ] [Real]Absence check using state equation in 4931 ms returned unknown
[2024-05-27 03:27:21] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:27:21] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-27 03:27:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:27:26] [INFO ] [Real]Absence check using state equation in 4928 ms returned unknown
[2024-05-27 03:27:26] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:27:26] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 5 ms returned sat
[2024-05-27 03:27:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:27:31] [INFO ] [Real]Absence check using state equation in 4939 ms returned unknown
[2024-05-27 03:27:31] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:27:31] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-27 03:27:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:27:36] [INFO ] [Real]Absence check using state equation in 4941 ms returned unknown
[2024-05-27 03:27:36] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:27:36] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-27 03:27:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:27:41] [INFO ] [Real]Absence check using state equation in 4935 ms returned unknown
Current structural bounds on expressions (after SMT) : [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3] Max seen :[1, 1, 2, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 2, 1]
Support contains 14 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 31353/31353 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 627 transition count 31353
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 626 transition count 31352
Applied a total of 13 rules in 663 ms. Remains 626 /639 variables (removed 13) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 669 ms. Remains : 626/639 places, 31352/31353 transitions.
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 03:27:42] [INFO ] Computed 13 invariants in 75 ms
Finished random walk after 896671 steps, including 2 resets, run visited all 15 properties in 30001 ms. (steps per millisecond=29 )
FORMULA RERS17pb113-PT-3-UpperBounds-14 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-3-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-3-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2031 ms. (steps per millisecond=492 ) properties (out of 12) seen :12
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2606 ms. (steps per millisecond=383 ) properties (out of 12) seen :12
FORMULA RERS17pb113-PT-3-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2050 ms. (steps per millisecond=487 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1765 ms. (steps per millisecond=566 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2246 ms. (steps per millisecond=445 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2431 ms. (steps per millisecond=411 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1943 ms. (steps per millisecond=514 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1836 ms. (steps per millisecond=544 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1862 ms. (steps per millisecond=537 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1874 ms. (steps per millisecond=533 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1789 ms. (steps per millisecond=558 ) properties (out of 11) seen :11
[2024-05-27 03:28:35] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 03:28:35] [INFO ] Computed 13 invariants in 53 ms
[2024-05-27 03:28:35] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:28:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:29:00] [INFO ] [Real]Absence check using state equation in 25266 ms returned sat
[2024-05-27 03:29:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:29:01] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-27 03:29:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:29:15] [INFO ] [Nat]Absence check using state equation in 14550 ms returned sat
[2024-05-27 03:29:15] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-27 03:29:19] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:29:22] [INFO ] [Nat]Added 268 Read/Feed constraints in 6535 ms returned unknown
[2024-05-27 03:29:22] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:29:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:29:39] [INFO ] [Real]Absence check using state equation in 16518 ms returned sat
[2024-05-27 03:29:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:29:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:29:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:29:54] [INFO ] [Nat]Absence check using state equation in 14613 ms returned sat
[2024-05-27 03:29:57] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:30:00] [INFO ] [Nat]Added 268 Read/Feed constraints in 6451 ms returned unknown
[2024-05-27 03:30:00] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:30:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:30:12] [INFO ] [Real]Absence check using state equation in 12069 ms returned sat
[2024-05-27 03:30:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:30:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:30:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:30:25] [INFO ] [Nat]Absence check using state equation in 12668 ms returned sat
[2024-05-27 03:30:29] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:30:32] [INFO ] [Nat]Added 268 Read/Feed constraints in 6437 ms returned unknown
[2024-05-27 03:30:32] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-27 03:30:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:30:43] [INFO ] [Real]Absence check using state equation in 11328 ms returned sat
[2024-05-27 03:30:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:30:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-27 03:30:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:30:56] [INFO ] [Nat]Absence check using state equation in 12516 ms returned sat
[2024-05-27 03:31:00] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:31:03] [INFO ] [Nat]Added 268 Read/Feed constraints in 6401 ms returned unknown
[2024-05-27 03:31:03] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:31:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:31:16] [INFO ] [Real]Absence check using state equation in 13229 ms returned sat
[2024-05-27 03:31:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:31:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:31:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:31:27] [INFO ] [Nat]Absence check using state equation in 11084 ms returned sat
[2024-05-27 03:31:31] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:31:34] [INFO ] [Nat]Added 268 Read/Feed constraints in 6475 ms returned unknown
[2024-05-27 03:31:34] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:31:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:31:50] [INFO ] [Real]Absence check using state equation in 16587 ms returned sat
[2024-05-27 03:31:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:31:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:31:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:32:09] [INFO ] [Nat]Absence check using state equation in 18328 ms returned sat
[2024-05-27 03:32:13] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:32:14] [INFO ] [Nat]Added 268 Read/Feed constraints in 5035 ms returned sat
[2024-05-27 03:32:17] [INFO ] Deduced a trap composed of 48 places in 1872 ms of which 4 ms to minimize.
[2024-05-27 03:32:19] [INFO ] Deduced a trap composed of 64 places in 1649 ms of which 1 ms to minimize.
[2024-05-27 03:32:20] [INFO ] Deduced a trap composed of 64 places in 1334 ms of which 2 ms to minimize.
[2024-05-27 03:32:22] [INFO ] Deduced a trap composed of 48 places in 1233 ms of which 2 ms to minimize.
[2024-05-27 03:32:23] [INFO ] Deduced a trap composed of 40 places in 1269 ms of which 1 ms to minimize.
[2024-05-27 03:32:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 9579 ms
[2024-05-27 03:32:26] [INFO ] Computed and/alt/rep : 1/9/1 causal constraints (skipped 18323 transitions) in 2611 ms.
[2024-05-27 03:32:28] [INFO ] Added : 0 causal constraints over 0 iterations in 3676 ms. Result :sat
[2024-05-27 03:32:28] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:32:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:32:45] [INFO ] [Real]Absence check using state equation in 17402 ms returned sat
[2024-05-27 03:32:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:32:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-27 03:32:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:33:00] [INFO ] [Nat]Absence check using state equation in 13893 ms returned sat
[2024-05-27 03:33:03] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:33:06] [INFO ] [Nat]Added 268 Read/Feed constraints in 6426 ms returned unknown
[2024-05-27 03:33:06] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:33:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:33:17] [INFO ] [Real]Absence check using state equation in 10879 ms returned sat
[2024-05-27 03:33:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:33:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:33:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:33:35] [INFO ] [Nat]Absence check using state equation in 17102 ms returned sat
[2024-05-27 03:33:38] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:33:41] [INFO ] [Nat]Added 268 Read/Feed constraints in 6615 ms returned unknown
[2024-05-27 03:33:41] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:33:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:33:57] [INFO ] [Real]Absence check using state equation in 15884 ms returned sat
[2024-05-27 03:33:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:33:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:33:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:34:12] [INFO ] [Nat]Absence check using state equation in 14132 ms returned sat
[2024-05-27 03:34:15] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:34:18] [INFO ] [Nat]Added 268 Read/Feed constraints in 6536 ms returned unknown
[2024-05-27 03:34:18] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:34:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:34:31] [INFO ] [Real]Absence check using state equation in 12874 ms returned sat
[2024-05-27 03:34:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:34:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:34:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:34:46] [INFO ] [Nat]Absence check using state equation in 13925 ms returned sat
[2024-05-27 03:34:49] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:34:52] [INFO ] [Nat]Added 268 Read/Feed constraints in 6388 ms returned unknown
[2024-05-27 03:34:52] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-27 03:34:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:35:02] [INFO ] [Real]Absence check using state equation in 9884 ms returned sat
[2024-05-27 03:35:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:35:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:35:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:35:16] [INFO ] [Nat]Absence check using state equation in 13027 ms returned sat
[2024-05-27 03:35:19] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:35:20] [INFO ] [Nat]Added 268 Read/Feed constraints in 4299 ms returned sat
[2024-05-27 03:35:23] [INFO ] Deduced a trap composed of 40 places in 2517 ms of which 1 ms to minimize.
[2024-05-27 03:35:25] [INFO ] Deduced a trap composed of 24 places in 2493 ms of which 0 ms to minimize.
[2024-05-27 03:35:28] [INFO ] Deduced a trap composed of 48 places in 2331 ms of which 1 ms to minimize.
[2024-05-27 03:35:31] [INFO ] Deduced a trap composed of 48 places in 2442 ms of which 1 ms to minimize.
[2024-05-27 03:35:34] [INFO ] Deduced a trap composed of 64 places in 2332 ms of which 0 ms to minimize.
[2024-05-27 03:35:36] [INFO ] Deduced a trap composed of 48 places in 2323 ms of which 1 ms to minimize.
[2024-05-27 03:35:39] [INFO ] Deduced a trap composed of 48 places in 2426 ms of which 1 ms to minimize.
[2024-05-27 03:35:41] [INFO ] Deduced a trap composed of 40 places in 2168 ms of which 1 ms to minimize.
[2024-05-27 03:35:44] [INFO ] Deduced a trap composed of 64 places in 2086 ms of which 0 ms to minimize.
[2024-05-27 03:35:46] [INFO ] Deduced a trap composed of 64 places in 2137 ms of which 1 ms to minimize.
[2024-05-27 03:35:48] [INFO ] Deduced a trap composed of 64 places in 1017 ms of which 0 ms to minimize.
[2024-05-27 03:35:48] [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 10
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3] Max seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 10 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 205 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 626/626 places, 31352/31352 transitions.
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 03:35:48] [INFO ] Computed 13 invariants in 49 ms
Finished random walk after 959022 steps, including 2 resets, run visited all 11 properties in 30001 ms. (steps per millisecond=31 )
FORMULA RERS17pb113-PT-3-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1887 ms. (steps per millisecond=529 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1874 ms. (steps per millisecond=533 ) properties (out of 10) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1945 ms. (steps per millisecond=514 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1740 ms. (steps per millisecond=574 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2448 ms. (steps per millisecond=408 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1899 ms. (steps per millisecond=526 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1784 ms. (steps per millisecond=560 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1853 ms. (steps per millisecond=539 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1794 ms. (steps per millisecond=557 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1728 ms. (steps per millisecond=578 ) properties (out of 10) seen :10
[2024-05-27 03:36:37] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 03:36:37] [INFO ] Computed 13 invariants in 43 ms
[2024-05-27 03:36:37] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:36:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:37:01] [INFO ] [Real]Absence check using state equation in 24361 ms returned sat
[2024-05-27 03:37:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:37:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:37:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:37:17] [INFO ] [Nat]Absence check using state equation in 14729 ms returned sat
[2024-05-27 03:37:17] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-27 03:37:20] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:37:23] [INFO ] [Nat]Added 268 Read/Feed constraints in 6489 ms returned unknown
[2024-05-27 03:37:23] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:37:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:37:38] [INFO ] [Real]Absence check using state equation in 14582 ms returned sat
[2024-05-27 03:37:42] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:37:45] [INFO ] [Real]Added 268 Read/Feed constraints in 6507 ms returned unknown
[2024-05-27 03:37:45] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:37:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:37:58] [INFO ] [Real]Absence check using state equation in 13016 ms returned sat
[2024-05-27 03:37:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:37:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-27 03:37:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:38:11] [INFO ] [Nat]Absence check using state equation in 13059 ms returned sat
[2024-05-27 03:38:15] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:38:18] [INFO ] [Nat]Added 268 Read/Feed constraints in 6404 ms returned unknown
[2024-05-27 03:38:18] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:38:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:38:29] [INFO ] [Real]Absence check using state equation in 11667 ms returned sat
[2024-05-27 03:38:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:38:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 23 ms returned sat
[2024-05-27 03:38:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:38:43] [INFO ] [Nat]Absence check using state equation in 13164 ms returned sat
[2024-05-27 03:38:47] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:38:50] [INFO ] [Nat]Added 268 Read/Feed constraints in 6489 ms returned unknown
[2024-05-27 03:38:50] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:38:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:39:07] [INFO ] [Real]Absence check using state equation in 17579 ms returned sat
[2024-05-27 03:39:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:39:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:39:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:39:26] [INFO ] [Nat]Absence check using state equation in 17969 ms returned sat
[2024-05-27 03:39:29] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:39:32] [INFO ] [Nat]Added 268 Read/Feed constraints in 6412 ms returned unknown
[2024-05-27 03:39:32] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:39:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:39:50] [INFO ] [Real]Absence check using state equation in 18086 ms returned sat
[2024-05-27 03:39:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:39:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:39:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:40:05] [INFO ] [Nat]Absence check using state equation in 13864 ms returned sat
[2024-05-27 03:40:08] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:40:11] [INFO ] [Nat]Added 268 Read/Feed constraints in 6466 ms returned unknown
[2024-05-27 03:40:11] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:40:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:40:25] [INFO ] [Real]Absence check using state equation in 14127 ms returned sat
[2024-05-27 03:40:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:40:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:40:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:40:43] [INFO ] [Nat]Absence check using state equation in 17458 ms returned sat
[2024-05-27 03:40:47] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:40:50] [INFO ] [Nat]Added 268 Read/Feed constraints in 6465 ms returned unknown
[2024-05-27 03:40:50] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:40:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:41:04] [INFO ] [Real]Absence check using state equation in 14011 ms returned sat
[2024-05-27 03:41:07] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:41:10] [INFO ] [Real]Added 268 Read/Feed constraints in 6487 ms returned unknown
[2024-05-27 03:41:11] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:41:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:41:24] [INFO ] [Real]Absence check using state equation in 13781 ms returned sat
[2024-05-27 03:41:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:41:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:41:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:41:39] [INFO ] [Nat]Absence check using state equation in 14419 ms returned sat
[2024-05-27 03:41:43] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:41:46] [INFO ] [Nat]Added 268 Read/Feed constraints in 6484 ms returned unknown
[2024-05-27 03:41:46] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:41:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:41:56] [INFO ] [Real]Absence check using state equation in 9816 ms returned sat
[2024-05-27 03:41:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:41:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:41:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:42:09] [INFO ] [Nat]Absence check using state equation in 13007 ms returned sat
[2024-05-27 03:42:12] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:42:13] [INFO ] [Nat]Added 268 Read/Feed constraints in 4329 ms returned sat
[2024-05-27 03:42:16] [INFO ] Deduced a trap composed of 40 places in 2316 ms of which 1 ms to minimize.
[2024-05-27 03:42:19] [INFO ] Deduced a trap composed of 24 places in 2413 ms of which 1 ms to minimize.
[2024-05-27 03:42:21] [INFO ] Deduced a trap composed of 64 places in 2265 ms of which 1 ms to minimize.
[2024-05-27 03:42:24] [INFO ] Deduced a trap composed of 64 places in 2186 ms of which 1 ms to minimize.
[2024-05-27 03:42:26] [INFO ] Deduced a trap composed of 40 places in 2218 ms of which 1 ms to minimize.
[2024-05-27 03:42:29] [INFO ] Deduced a trap composed of 48 places in 2256 ms of which 0 ms to minimize.
[2024-05-27 03:42:30] [INFO ] Deduced a trap composed of 40 places in 1065 ms of which 0 ms to minimize.
[2024-05-27 03:42:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 17877 ms
[2024-05-27 03:42:34] [INFO ] Computed and/alt/rep : 1/9/1 causal constraints (skipped 18323 transitions) in 2337 ms.
[2024-05-27 03:42:35] [INFO ] Added : 0 causal constraints over 0 iterations in 3566 ms. Result :sat
Current structural bounds on expressions (after SMT) : [3, 3, 3, 3, 3, 3, 3, 3, 3, 3] Max seen :[1, 2, 1, 1, 1, 1, 2, 2, 1, 1]
Support contains 9 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 205 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 626/626 places, 31352/31352 transitions.
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 03:42:36] [INFO ] Computed 13 invariants in 68 ms
Finished random walk after 946244 steps, including 2 resets, run visited all 10 properties in 30001 ms. (steps per millisecond=31 )
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1991 ms. (steps per millisecond=502 ) properties (out of 10) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1927 ms. (steps per millisecond=518 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1988 ms. (steps per millisecond=503 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1819 ms. (steps per millisecond=549 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2511 ms. (steps per millisecond=398 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1970 ms. (steps per millisecond=507 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1863 ms. (steps per millisecond=536 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1854 ms. (steps per millisecond=539 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1955 ms. (steps per millisecond=511 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1854 ms. (steps per millisecond=539 ) properties (out of 10) seen :10
[2024-05-27 03:43:25] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 03:43:25] [INFO ] Computed 13 invariants in 52 ms
[2024-05-27 03:43:26] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:43:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:43:40] [INFO ] [Real]Absence check using state equation in 14929 ms returned sat
[2024-05-27 03:43:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:43:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:43:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:43:57] [INFO ] [Nat]Absence check using state equation in 16567 ms returned unknown
[2024-05-27 03:43:58] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:43:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:44:11] [INFO ] [Real]Absence check using state equation in 13792 ms returned sat
[2024-05-27 03:44:12] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-27 03:44:15] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:44:18] [INFO ] [Real]Added 268 Read/Feed constraints in 6458 ms returned unknown
[2024-05-27 03:44:18] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-27 03:44:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:44:31] [INFO ] [Real]Absence check using state equation in 12527 ms returned sat
[2024-05-27 03:44:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:44:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:44:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:44:44] [INFO ] [Nat]Absence check using state equation in 13050 ms returned sat
[2024-05-27 03:44:48] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:44:51] [INFO ] [Nat]Added 268 Read/Feed constraints in 6489 ms returned unknown
[2024-05-27 03:44:51] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:44:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:45:03] [INFO ] [Real]Absence check using state equation in 11852 ms returned sat
[2024-05-27 03:45:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:45:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:45:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:45:16] [INFO ] [Nat]Absence check using state equation in 13237 ms returned sat
[2024-05-27 03:45:20] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:45:23] [INFO ] [Nat]Added 268 Read/Feed constraints in 6462 ms returned unknown
[2024-05-27 03:45:23] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:45:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:45:40] [INFO ] [Real]Absence check using state equation in 17080 ms returned sat
[2024-05-27 03:45:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:45:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-27 03:45:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:45:57] [INFO ] [Nat]Absence check using state equation in 16945 ms returned sat
[2024-05-27 03:46:01] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:46:04] [INFO ] [Nat]Added 268 Read/Feed constraints in 6479 ms returned unknown
[2024-05-27 03:46:04] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:46:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:46:22] [INFO ] [Real]Absence check using state equation in 17578 ms returned sat
[2024-05-27 03:46:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:46:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:46:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:46:36] [INFO ] [Nat]Absence check using state equation in 14219 ms returned sat
[2024-05-27 03:46:40] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:46:43] [INFO ] [Nat]Added 268 Read/Feed constraints in 6495 ms returned unknown
[2024-05-27 03:46:43] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:46:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:46:57] [INFO ] [Real]Absence check using state equation in 14626 ms returned sat
[2024-05-27 03:46:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:46:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-27 03:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:47:07] [INFO ] [Nat]Absence check using state equation in 8793 ms returned sat
[2024-05-27 03:47:10] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:47:13] [INFO ] [Nat]Added 268 Read/Feed constraints in 6412 ms returned unknown
[2024-05-27 03:47:13] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:47:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:47:27] [INFO ] [Real]Absence check using state equation in 14099 ms returned sat
[2024-05-27 03:47:31] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:47:34] [INFO ] [Real]Added 268 Read/Feed constraints in 6505 ms returned unknown
[2024-05-27 03:47:34] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:47:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:47:48] [INFO ] [Real]Absence check using state equation in 14260 ms returned sat
[2024-05-27 03:47:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:47:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:47:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:48:04] [INFO ] [Nat]Absence check using state equation in 15553 ms returned sat
[2024-05-27 03:48:08] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:48:11] [INFO ] [Nat]Added 268 Read/Feed constraints in 6418 ms returned unknown
[2024-05-27 03:48:11] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-27 03:48:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:48:21] [INFO ] [Real]Absence check using state equation in 10339 ms returned sat
[2024-05-27 03:48:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:48:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:48:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:48:36] [INFO ] [Nat]Absence check using state equation in 13914 ms returned sat
[2024-05-27 03:48:39] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:48:40] [INFO ] [Nat]Added 268 Read/Feed constraints in 4351 ms returned sat
[2024-05-27 03:48:42] [INFO ] Deduced a trap composed of 24 places in 2209 ms of which 1 ms to minimize.
[2024-05-27 03:48:45] [INFO ] Deduced a trap composed of 48 places in 2018 ms of which 1 ms to minimize.
[2024-05-27 03:48:47] [INFO ] Deduced a trap composed of 40 places in 2113 ms of which 0 ms to minimize.
[2024-05-27 03:48:50] [INFO ] Deduced a trap composed of 64 places in 2068 ms of which 1 ms to minimize.
[2024-05-27 03:48:52] [INFO ] Deduced a trap composed of 40 places in 1891 ms of which 1 ms to minimize.
[2024-05-27 03:48:54] [INFO ] Deduced a trap composed of 64 places in 1750 ms of which 1 ms to minimize.
[2024-05-27 03:48:56] [INFO ] Deduced a trap composed of 96 places in 1634 ms of which 1 ms to minimize.
[2024-05-27 03:48:58] [INFO ] Deduced a trap composed of 64 places in 1652 ms of which 1 ms to minimize.
[2024-05-27 03:48:59] [INFO ] Deduced a trap composed of 48 places in 1148 ms of which 1 ms to minimize.
[2024-05-27 03:49:01] [INFO ] Deduced a trap composed of 64 places in 976 ms of which 0 ms to minimize.
[2024-05-27 03:49:02] [INFO ] Deduced a trap composed of 48 places in 803 ms of which 1 ms to minimize.
[2024-05-27 03:49:02] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 22381 ms
[2024-05-27 03:49:04] [INFO ] Computed and/alt/rep : 1/9/1 causal constraints (skipped 18323 transitions) in 2030 ms.
[2024-05-27 03:49:05] [INFO ] Added : 0 causal constraints over 0 iterations in 3089 ms. Result :sat
Current structural bounds on expressions (after SMT) : [3, 3, 3, 3, 3, 3, 3, 3, 3, 3] Max seen :[2, 2, 1, 1, 1, 1, 2, 2, 1, 1]
Support contains 9 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 209 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 183 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2024-05-27 03:49:06] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-05-27 03:49:06] [INFO ] Invariant cache hit.
[2024-05-27 03:49:08] [INFO ] Implicit Places using invariants in 1856 ms returned []
Implicit Place search using SMT only with invariants took 1865 ms to find 0 implicit places.
[2024-05-27 03:49:08] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-05-27 03:49:08] [INFO ] Invariant cache hit.
[2024-05-27 03:49:17] [INFO ] Dead Transitions using invariants and state equation in 8778 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10831 ms. Remains : 626/626 places, 31352/31352 transitions.
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 03:49:17] [INFO ] Computed 13 invariants in 55 ms
Finished random walk after 900843 steps, including 2 resets, run visited all 10 properties in 30001 ms. (steps per millisecond=30 )
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2172 ms. (steps per millisecond=460 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2062 ms. (steps per millisecond=484 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2151 ms. (steps per millisecond=464 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1902 ms. (steps per millisecond=525 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2674 ms. (steps per millisecond=373 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2014 ms. (steps per millisecond=496 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1877 ms. (steps per millisecond=532 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1830 ms. (steps per millisecond=546 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1853 ms. (steps per millisecond=539 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1787 ms. (steps per millisecond=559 ) properties (out of 10) seen :10
[2024-05-27 03:50:07] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 03:50:07] [INFO ] Computed 13 invariants in 50 ms
[2024-05-27 03:50:08] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:50:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:50:25] [INFO ] [Real]Absence check using state equation in 17815 ms returned sat
[2024-05-27 03:50:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:50:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:50:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:50:43] [INFO ] [Nat]Absence check using state equation in 17059 ms returned unknown
[2024-05-27 03:50:43] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:50:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:50:57] [INFO ] [Real]Absence check using state equation in 14170 ms returned sat
[2024-05-27 03:50:58] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-27 03:51:01] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:51:04] [INFO ] [Real]Added 268 Read/Feed constraints in 6486 ms returned unknown
[2024-05-27 03:51:04] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:51:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:51:17] [INFO ] [Real]Absence check using state equation in 12858 ms returned sat
[2024-05-27 03:51:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:51:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:51:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:51:31] [INFO ] [Nat]Absence check using state equation in 13289 ms returned sat
[2024-05-27 03:51:34] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:51:37] [INFO ] [Nat]Added 268 Read/Feed constraints in 6459 ms returned unknown
[2024-05-27 03:51:37] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:51:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:51:49] [INFO ] [Real]Absence check using state equation in 12063 ms returned sat
[2024-05-27 03:51:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:51:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:51:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:52:03] [INFO ] [Nat]Absence check using state equation in 13316 ms returned sat
[2024-05-27 03:52:06] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:52:09] [INFO ] [Nat]Added 268 Read/Feed constraints in 6478 ms returned unknown
[2024-05-27 03:52:10] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-27 03:52:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:52:27] [INFO ] [Real]Absence check using state equation in 17574 ms returned sat
[2024-05-27 03:52:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:52:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:52:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:52:45] [INFO ] [Nat]Absence check using state equation in 17405 ms returned sat
[2024-05-27 03:52:48] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:52:51] [INFO ] [Nat]Added 268 Read/Feed constraints in 6410 ms returned unknown
[2024-05-27 03:52:51] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:52:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:53:10] [INFO ] [Real]Absence check using state equation in 18087 ms returned sat
[2024-05-27 03:53:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:53:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:53:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:53:25] [INFO ] [Nat]Absence check using state equation in 14710 ms returned sat
[2024-05-27 03:53:28] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:53:31] [INFO ] [Nat]Added 268 Read/Feed constraints in 6443 ms returned unknown
[2024-05-27 03:53:31] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:53:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:53:46] [INFO ] [Real]Absence check using state equation in 14467 ms returned sat
[2024-05-27 03:53:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:53:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:53:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:53:55] [INFO ] [Nat]Absence check using state equation in 9147 ms returned sat
[2024-05-27 03:53:59] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:54:02] [INFO ] [Nat]Added 268 Read/Feed constraints in 6443 ms returned unknown
[2024-05-27 03:54:02] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:54:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:54:16] [INFO ] [Real]Absence check using state equation in 13828 ms returned sat
[2024-05-27 03:54:19] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:54:22] [INFO ] [Real]Added 268 Read/Feed constraints in 6506 ms returned unknown
[2024-05-27 03:54:22] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:54:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:54:36] [INFO ] [Real]Absence check using state equation in 13666 ms returned sat
[2024-05-27 03:54:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:54:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:54:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:54:52] [INFO ] [Nat]Absence check using state equation in 14984 ms returned sat
[2024-05-27 03:54:55] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:54:58] [INFO ] [Nat]Added 268 Read/Feed constraints in 6415 ms returned unknown
[2024-05-27 03:54:58] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:54:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:55:08] [INFO ] [Real]Absence check using state equation in 10140 ms returned sat
[2024-05-27 03:55:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:55:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:55:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:55:22] [INFO ] [Nat]Absence check using state equation in 13202 ms returned sat
[2024-05-27 03:55:25] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:55:26] [INFO ] [Nat]Added 268 Read/Feed constraints in 4237 ms returned sat
[2024-05-27 03:55:29] [INFO ] Deduced a trap composed of 24 places in 2469 ms of which 8 ms to minimize.
[2024-05-27 03:55:32] [INFO ] Deduced a trap composed of 48 places in 2468 ms of which 0 ms to minimize.
[2024-05-27 03:55:34] [INFO ] Deduced a trap composed of 64 places in 2281 ms of which 0 ms to minimize.
[2024-05-27 03:55:37] [INFO ] Deduced a trap composed of 48 places in 2484 ms of which 1 ms to minimize.
[2024-05-27 03:55:39] [INFO ] Deduced a trap composed of 40 places in 1968 ms of which 0 ms to minimize.
[2024-05-27 03:55:42] [INFO ] Deduced a trap composed of 48 places in 1919 ms of which 5 ms to minimize.
[2024-05-27 03:55:44] [INFO ] Deduced a trap composed of 40 places in 2019 ms of which 1 ms to minimize.
[2024-05-27 03:55:46] [INFO ] Deduced a trap composed of 64 places in 1930 ms of which 0 ms to minimize.
[2024-05-27 03:55:48] [INFO ] Deduced a trap composed of 64 places in 1997 ms of which 1 ms to minimize.
[2024-05-27 03:55:49] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 23055 ms
[2024-05-27 03:55:51] [INFO ] Computed and/alt/rep : 1/9/1 causal constraints (skipped 18323 transitions) in 2086 ms.
[2024-05-27 03:55:52] [INFO ] Added : 0 causal constraints over 0 iterations in 3302 ms. Result :sat
Current structural bounds on expressions (after SMT) : [3, 3, 3, 3, 3, 3, 3, 3, 3, 3] Max seen :[2, 2, 1, 1, 1, 1, 2, 2, 1, 1]
Support contains 9 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 186 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 184 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2024-05-27 03:55:53] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-05-27 03:55:53] [INFO ] Invariant cache hit.
[2024-05-27 03:55:55] [INFO ] Implicit Places using invariants in 1935 ms returned []
Implicit Place search using SMT only with invariants took 1936 ms to find 0 implicit places.
[2024-05-27 03:55:55] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-05-27 03:55:55] [INFO ] Invariant cache hit.
[2024-05-27 03:56:04] [INFO ] Dead Transitions using invariants and state equation in 8473 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10596 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting property specific reduction for RERS17pb113-PT-3-UpperBounds-00
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 03:56:04] [INFO ] Computed 13 invariants in 71 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
[2024-05-27 03:56:04] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 03:56:04] [INFO ] Computed 13 invariants in 47 ms
[2024-05-27 03:56:04] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-27 03:56:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:56:09] [INFO ] [Real]Absence check using state equation in 4927 ms returned unknown
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 162 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 626/626 places, 31352/31352 transitions.
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 03:56:10] [INFO ] Computed 13 invariants in 55 ms
Finished random walk after 939705 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=31 )
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1909 ms. (steps per millisecond=523 ) properties (out of 1) seen :1
[2024-05-27 03:56:41] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 03:56:41] [INFO ] Computed 13 invariants in 44 ms
[2024-05-27 03:56:42] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:56:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:57:07] [INFO ] [Real]Absence check using state equation in 25446 ms returned sat
[2024-05-27 03:57:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:57:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 03:57:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:57:22] [INFO ] [Nat]Absence check using state equation in 14371 ms returned sat
[2024-05-27 03:57:22] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-27 03:57:25] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:57:28] [INFO ] [Nat]Added 268 Read/Feed constraints in 6487 ms returned unknown
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 188 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 180 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2024-05-27 03:57:29] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-05-27 03:57:29] [INFO ] Invariant cache hit.
[2024-05-27 03:57:31] [INFO ] Implicit Places using invariants in 1877 ms returned []
Implicit Place search using SMT only with invariants took 1878 ms to find 0 implicit places.
[2024-05-27 03:57:31] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-05-27 03:57:31] [INFO ] Invariant cache hit.
[2024-05-27 03:57:39] [INFO ] Dead Transitions using invariants and state equation in 8567 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10629 ms. Remains : 626/626 places, 31352/31352 transitions.
Ending property specific reduction for RERS17pb113-PT-3-UpperBounds-00 in 95525 ms.
Starting property specific reduction for RERS17pb113-PT-3-UpperBounds-03
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 03:57:39] [INFO ] Computed 13 invariants in 51 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :1
[2024-05-27 03:57:40] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 03:57:40] [INFO ] Computed 13 invariants in 51 ms
[2024-05-27 03:57:40] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:57:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:57:45] [INFO ] [Real]Absence check using state equation in 4940 ms returned unknown
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 176 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 626/626 places, 31352/31352 transitions.
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 03:57:45] [INFO ] Computed 13 invariants in 54 ms
Finished random walk after 980102 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=32 )
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1851 ms. (steps per millisecond=540 ) properties (out of 1) seen :1
[2024-05-27 03:58:17] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 03:58:17] [INFO ] Computed 13 invariants in 47 ms
[2024-05-27 03:58:17] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:58:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:58:34] [INFO ] [Real]Absence check using state equation in 16823 ms returned sat
[2024-05-27 03:58:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 03:58:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-27 03:58:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 03:58:49] [INFO ] [Nat]Absence check using state equation in 15084 ms returned sat
[2024-05-27 03:58:49] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-27 03:58:53] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 03:58:56] [INFO ] [Nat]Added 268 Read/Feed constraints in 6524 ms returned unknown
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 174 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 174 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2024-05-27 03:58:56] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-05-27 03:58:56] [INFO ] Invariant cache hit.
[2024-05-27 03:58:58] [INFO ] Implicit Places using invariants in 1911 ms returned []
Implicit Place search using SMT only with invariants took 1912 ms to find 0 implicit places.
[2024-05-27 03:58:58] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-05-27 03:58:58] [INFO ] Invariant cache hit.
[2024-05-27 03:59:07] [INFO ] Dead Transitions using invariants and state equation in 8618 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10707 ms. Remains : 626/626 places, 31352/31352 transitions.
Ending property specific reduction for RERS17pb113-PT-3-UpperBounds-03 in 87615 ms.
Starting property specific reduction for RERS17pb113-PT-3-UpperBounds-04
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 03:59:07] [INFO ] Computed 13 invariants in 55 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
[2024-05-27 03:59:07] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 03:59:07] [INFO ] Computed 13 invariants in 50 ms
[2024-05-27 03:59:07] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:59:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 03:59:12] [INFO ] [Real]Absence check using state equation in 4940 ms returned unknown
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 172 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 626/626 places, 31352/31352 transitions.
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 03:59:13] [INFO ] Computed 13 invariants in 55 ms
Finished random walk after 722091 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=24 )
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2593 ms. (steps per millisecond=385 ) properties (out of 1) seen :1
[2024-05-27 03:59:45] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 03:59:45] [INFO ] Computed 13 invariants in 47 ms
[2024-05-27 03:59:45] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 03:59:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 04:00:00] [INFO ] [Real]Absence check using state equation in 14759 ms returned sat
[2024-05-27 04:00:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 04:00:01] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 04:00:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 04:00:13] [INFO ] [Nat]Absence check using state equation in 12599 ms returned sat
[2024-05-27 04:00:13] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-27 04:00:17] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 04:00:20] [INFO ] [Nat]Added 268 Read/Feed constraints in 6488 ms returned unknown
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 201 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 194 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2024-05-27 04:00:20] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-05-27 04:00:20] [INFO ] Invariant cache hit.
[2024-05-27 04:00:22] [INFO ] Implicit Places using invariants in 2037 ms returned []
Implicit Place search using SMT only with invariants took 2038 ms to find 0 implicit places.
[2024-05-27 04:00:22] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-05-27 04:00:22] [INFO ] Invariant cache hit.
[2024-05-27 04:00:31] [INFO ] Dead Transitions using invariants and state equation in 8700 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10936 ms. Remains : 626/626 places, 31352/31352 transitions.
Ending property specific reduction for RERS17pb113-PT-3-UpperBounds-04 in 84052 ms.
Starting property specific reduction for RERS17pb113-PT-3-UpperBounds-06
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 04:00:31] [INFO ] Computed 13 invariants in 60 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
[2024-05-27 04:00:31] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 04:00:31] [INFO ] Computed 13 invariants in 51 ms
[2024-05-27 04:00:31] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 04:00:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 04:00:36] [INFO ] [Real]Absence check using state equation in 4933 ms returned unknown
Current structural bounds on expressions (after SMT) : [3] Max seen :[0]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 162 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 626/626 places, 31352/31352 transitions.
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 04:00:37] [INFO ] Computed 13 invariants in 55 ms
Finished random walk after 977217 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=32 )
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1694 ms. (steps per millisecond=590 ) properties (out of 1) seen :1
[2024-05-27 04:01:08] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 04:01:08] [INFO ] Computed 13 invariants in 51 ms
[2024-05-27 04:01:09] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 04:01:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 04:01:21] [INFO ] [Real]Absence check using state equation in 12053 ms returned sat
[2024-05-27 04:01:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 04:01:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-27 04:01:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 04:01:34] [INFO ] [Nat]Absence check using state equation in 13105 ms returned sat
[2024-05-27 04:01:34] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-27 04:01:38] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 04:01:41] [INFO ] [Nat]Added 268 Read/Feed constraints in 6504 ms returned unknown
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 195 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 186 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2024-05-27 04:01:41] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-05-27 04:01:41] [INFO ] Invariant cache hit.
[2024-05-27 04:01:43] [INFO ] Implicit Places using invariants in 1871 ms returned []
Implicit Place search using SMT only with invariants took 1872 ms to find 0 implicit places.
[2024-05-27 04:01:43] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-05-27 04:01:43] [INFO ] Invariant cache hit.
[2024-05-27 04:01:51] [INFO ] Dead Transitions using invariants and state equation in 8351 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10412 ms. Remains : 626/626 places, 31352/31352 transitions.
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 04:01:51] [INFO ] Computed 13 invariants in 52 ms
Finished random walk after 955282 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=31 )
FORMULA RERS17pb113-PT-3-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for RERS17pb113-PT-3-UpperBounds-06 in 110542 ms.
Starting property specific reduction for RERS17pb113-PT-3-UpperBounds-08
[2024-05-27 04:02:21] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
[2024-05-27 04:02:22] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 04:02:22] [INFO ] Computed 13 invariants in 52 ms
[2024-05-27 04:02:22] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 04:02:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 04:02:27] [INFO ] [Real]Absence check using state equation in 4941 ms returned unknown
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 156 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 626/626 places, 31352/31352 transitions.
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 04:02:27] [INFO ] Computed 13 invariants in 52 ms
Finished random walk after 971757 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=32 )
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2395 ms. (steps per millisecond=417 ) properties (out of 1) seen :1
[2024-05-27 04:03:00] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 04:03:00] [INFO ] Computed 13 invariants in 51 ms
[2024-05-27 04:03:00] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 04:03:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 04:03:17] [INFO ] [Real]Absence check using state equation in 17146 ms returned sat
[2024-05-27 04:03:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 04:03:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 04:03:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 04:03:36] [INFO ] [Nat]Absence check using state equation in 18634 ms returned sat
[2024-05-27 04:03:36] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-27 04:03:39] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 04:03:41] [INFO ] [Nat]Added 268 Read/Feed constraints in 5163 ms returned sat
[2024-05-27 04:03:43] [INFO ] Deduced a trap composed of 64 places in 1698 ms of which 5 ms to minimize.
[2024-05-27 04:03:45] [INFO ] Deduced a trap composed of 48 places in 1583 ms of which 0 ms to minimize.
[2024-05-27 04:03:47] [INFO ] Deduced a trap composed of 40 places in 1360 ms of which 0 ms to minimize.
[2024-05-27 04:03:48] [INFO ] Deduced a trap composed of 40 places in 684 ms of which 0 ms to minimize.
[2024-05-27 04:03:49] [INFO ] Deduced a trap composed of 40 places in 553 ms of which 0 ms to minimize.
[2024-05-27 04:03:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 8074 ms
[2024-05-27 04:03:51] [INFO ] Computed and/alt/rep : 1/9/1 causal constraints (skipped 18323 transitions) in 2056 ms.
[2024-05-27 04:03:52] [INFO ] Added : 0 causal constraints over 0 iterations in 3098 ms. Result :sat
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 175 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 176 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2024-05-27 04:03:53] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-05-27 04:03:53] [INFO ] Invariant cache hit.
[2024-05-27 04:03:55] [INFO ] Implicit Places using invariants in 1835 ms returned []
Implicit Place search using SMT only with invariants took 1835 ms to find 0 implicit places.
[2024-05-27 04:03:55] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-05-27 04:03:55] [INFO ] Invariant cache hit.
[2024-05-27 04:04:04] [INFO ] Dead Transitions using invariants and state equation in 8594 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10609 ms. Remains : 626/626 places, 31352/31352 transitions.
Ending property specific reduction for RERS17pb113-PT-3-UpperBounds-08 in 102142 ms.
Starting property specific reduction for RERS17pb113-PT-3-UpperBounds-10
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 04:04:04] [INFO ] Computed 13 invariants in 54 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
[2024-05-27 04:04:04] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 04:04:04] [INFO ] Computed 13 invariants in 48 ms
[2024-05-27 04:04:04] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 04:04:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 04:04:09] [INFO ] [Real]Absence check using state equation in 4946 ms returned unknown
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 156 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 626/626 places, 31352/31352 transitions.
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 04:04:09] [INFO ] Computed 13 invariants in 69 ms
Finished random walk after 991889 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=33 )
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1939 ms. (steps per millisecond=515 ) properties (out of 1) seen :1
[2024-05-27 04:04:41] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 04:04:41] [INFO ] Computed 13 invariants in 52 ms
[2024-05-27 04:04:41] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 04:04:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 04:05:00] [INFO ] [Real]Absence check using state equation in 18179 ms returned sat
[2024-05-27 04:05:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 04:05:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 04:05:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 04:05:14] [INFO ] [Nat]Absence check using state equation in 14243 ms returned sat
[2024-05-27 04:05:14] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-27 04:05:18] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 04:05:21] [INFO ] [Nat]Added 268 Read/Feed constraints in 6497 ms returned unknown
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 193 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 177 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2024-05-27 04:05:21] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-05-27 04:05:21] [INFO ] Invariant cache hit.
[2024-05-27 04:05:23] [INFO ] Implicit Places using invariants in 1885 ms returned []
Implicit Place search using SMT only with invariants took 1886 ms to find 0 implicit places.
[2024-05-27 04:05:23] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-05-27 04:05:23] [INFO ] Invariant cache hit.
[2024-05-27 04:05:32] [INFO ] Dead Transitions using invariants and state equation in 8831 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10899 ms. Remains : 626/626 places, 31352/31352 transitions.
Ending property specific reduction for RERS17pb113-PT-3-UpperBounds-10 in 88443 ms.
Starting property specific reduction for RERS17pb113-PT-3-UpperBounds-11
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 04:05:32] [INFO ] Computed 13 invariants in 54 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :1
[2024-05-27 04:05:32] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 04:05:33] [INFO ] Computed 13 invariants in 49 ms
[2024-05-27 04:05:33] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 04:05:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 04:05:38] [INFO ] [Real]Absence check using state equation in 4943 ms returned unknown
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 178 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 626/626 places, 31352/31352 transitions.
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 04:05:38] [INFO ] Computed 13 invariants in 53 ms
Finished random walk after 997772 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=33 )
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1784 ms. (steps per millisecond=560 ) properties (out of 1) seen :1
[2024-05-27 04:06:10] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 04:06:10] [INFO ] Computed 13 invariants in 51 ms
[2024-05-27 04:06:10] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 04:06:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 04:06:20] [INFO ] [Real]Absence check using state equation in 10673 ms returned sat
[2024-05-27 04:06:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 04:06:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 04:06:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 04:06:39] [INFO ] [Nat]Absence check using state equation in 18356 ms returned sat
[2024-05-27 04:06:39] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-27 04:06:43] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 04:06:46] [INFO ] [Nat]Added 268 Read/Feed constraints in 6501 ms returned unknown
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 181 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 162 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2024-05-27 04:06:46] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-05-27 04:06:46] [INFO ] Invariant cache hit.
[2024-05-27 04:06:48] [INFO ] Implicit Places using invariants in 1859 ms returned []
Implicit Place search using SMT only with invariants took 1860 ms to find 0 implicit places.
[2024-05-27 04:06:48] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-05-27 04:06:48] [INFO ] Invariant cache hit.
[2024-05-27 04:06:57] [INFO ] Dead Transitions using invariants and state equation in 8886 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10912 ms. Remains : 626/626 places, 31352/31352 transitions.
Ending property specific reduction for RERS17pb113-PT-3-UpperBounds-11 in 84885 ms.
Starting property specific reduction for RERS17pb113-PT-3-UpperBounds-12
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 04:06:57] [INFO ] Computed 13 invariants in 67 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :1
[2024-05-27 04:06:57] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 04:06:57] [INFO ] Computed 13 invariants in 48 ms
[2024-05-27 04:06:57] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 04:06:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 04:07:02] [INFO ] [Real]Absence check using state equation in 4943 ms returned unknown
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 153 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 626/626 places, 31352/31352 transitions.
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 04:07:03] [INFO ] Computed 13 invariants in 67 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 29700 ms. (steps per millisecond=33 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1864 ms. (steps per millisecond=536 ) properties (out of 1) seen :1
[2024-05-27 04:07:34] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 04:07:34] [INFO ] Computed 13 invariants in 54 ms
[2024-05-27 04:07:34] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 04:07:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 04:07:51] [INFO ] [Real]Absence check using state equation in 17002 ms returned sat
[2024-05-27 04:07:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 04:07:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 04:07:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 04:08:08] [INFO ] [Nat]Absence check using state equation in 15708 ms returned sat
[2024-05-27 04:08:08] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-27 04:08:11] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 04:08:14] [INFO ] [Nat]Added 268 Read/Feed constraints in 6502 ms returned unknown
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 173 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 181 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2024-05-27 04:08:15] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-05-27 04:08:15] [INFO ] Invariant cache hit.
[2024-05-27 04:08:16] [INFO ] Implicit Places using invariants in 1850 ms returned []
Implicit Place search using SMT only with invariants took 1851 ms to find 0 implicit places.
[2024-05-27 04:08:16] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-05-27 04:08:16] [INFO ] Invariant cache hit.
[2024-05-27 04:08:25] [INFO ] Dead Transitions using invariants and state equation in 8715 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10753 ms. Remains : 626/626 places, 31352/31352 transitions.
Ending property specific reduction for RERS17pb113-PT-3-UpperBounds-12 in 88166 ms.
Starting property specific reduction for RERS17pb113-PT-3-UpperBounds-13
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 04:08:25] [INFO ] Computed 13 invariants in 54 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :1
[2024-05-27 04:08:25] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 04:08:26] [INFO ] Computed 13 invariants in 46 ms
[2024-05-27 04:08:26] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 04:08:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 04:08:31] [INFO ] [Real]Absence check using state equation in 4945 ms returned unknown
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 169 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 626/626 places, 31352/31352 transitions.
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 04:08:31] [INFO ] Computed 13 invariants in 52 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 29650 ms. (steps per millisecond=33 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1841 ms. (steps per millisecond=543 ) properties (out of 1) seen :1
[2024-05-27 04:09:02] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 04:09:02] [INFO ] Computed 13 invariants in 49 ms
[2024-05-27 04:09:02] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 04:09:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 04:09:16] [INFO ] [Real]Absence check using state equation in 13718 ms returned sat
[2024-05-27 04:09:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 04:09:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 04:09:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 04:09:31] [INFO ] [Nat]Absence check using state equation in 14692 ms returned sat
[2024-05-27 04:09:31] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-27 04:09:35] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 04:09:38] [INFO ] [Nat]Added 268 Read/Feed constraints in 6475 ms returned unknown
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 169 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 160 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2024-05-27 04:09:38] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-05-27 04:09:38] [INFO ] Invariant cache hit.
[2024-05-27 04:09:40] [INFO ] Implicit Places using invariants in 1850 ms returned []
Implicit Place search using SMT only with invariants took 1850 ms to find 0 implicit places.
[2024-05-27 04:09:40] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-05-27 04:09:40] [INFO ] Invariant cache hit.
[2024-05-27 04:09:49] [INFO ] Dead Transitions using invariants and state equation in 8562 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10575 ms. Remains : 626/626 places, 31352/31352 transitions.
Ending property specific reduction for RERS17pb113-PT-3-UpperBounds-13 in 83542 ms.
Starting property specific reduction for RERS17pb113-PT-3-UpperBounds-15
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 04:09:49] [INFO ] Computed 13 invariants in 54 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
[2024-05-27 04:09:49] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 04:09:49] [INFO ] Computed 13 invariants in 47 ms
[2024-05-27 04:09:49] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 04:09:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 04:09:54] [INFO ] [Real]Absence check using state equation in 4940 ms returned unknown
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 150 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 626/626 places, 31352/31352 transitions.
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 04:09:54] [INFO ] Computed 13 invariants in 54 ms
Finished random walk after 886474 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=29 )
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2444 ms. (steps per millisecond=409 ) properties (out of 1) seen :1
[2024-05-27 04:10:27] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2024-05-27 04:10:27] [INFO ] Computed 13 invariants in 47 ms
[2024-05-27 04:10:27] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 04:10:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 04:10:37] [INFO ] [Real]Absence check using state equation in 10518 ms returned sat
[2024-05-27 04:10:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 04:10:38] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 04:10:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 04:10:53] [INFO ] [Nat]Absence check using state equation in 14793 ms returned sat
[2024-05-27 04:10:53] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-27 04:10:56] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 04:10:57] [INFO ] [Nat]Added 268 Read/Feed constraints in 4397 ms returned sat
[2024-05-27 04:11:00] [INFO ] Deduced a trap composed of 40 places in 2198 ms of which 1 ms to minimize.
[2024-05-27 04:11:02] [INFO ] Deduced a trap composed of 64 places in 2061 ms of which 1 ms to minimize.
[2024-05-27 04:11:04] [INFO ] Deduced a trap composed of 64 places in 2033 ms of which 0 ms to minimize.
[2024-05-27 04:11:07] [INFO ] Deduced a trap composed of 72 places in 2031 ms of which 0 ms to minimize.
[2024-05-27 04:11:09] [INFO ] Deduced a trap composed of 48 places in 1774 ms of which 0 ms to minimize.
[2024-05-27 04:11:11] [INFO ] Deduced a trap composed of 64 places in 1587 ms of which 1 ms to minimize.
[2024-05-27 04:11:13] [INFO ] Deduced a trap composed of 24 places in 1369 ms of which 0 ms to minimize.
[2024-05-27 04:11:14] [INFO ] Deduced a trap composed of 48 places in 965 ms of which 1 ms to minimize.
[2024-05-27 04:11:15] [INFO ] Deduced a trap composed of 64 places in 868 ms of which 3 ms to minimize.
[2024-05-27 04:11:16] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 18476 ms
[2024-05-27 04:11:18] [INFO ] Computed and/alt/rep : 1/9/1 causal constraints (skipped 18323 transitions) in 2109 ms.
[2024-05-27 04:11:19] [INFO ] Added : 0 causal constraints over 0 iterations in 3257 ms. Result :sat
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 200 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 195 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2024-05-27 04:11:20] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-05-27 04:11:20] [INFO ] Invariant cache hit.
[2024-05-27 04:11:22] [INFO ] Implicit Places using invariants in 1934 ms returned []
Implicit Place search using SMT only with invariants took 1935 ms to find 0 implicit places.
[2024-05-27 04:11:22] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-05-27 04:11:22] [INFO ] Invariant cache hit.
[2024-05-27 04:11:31] [INFO ] Dead Transitions using invariants and state equation in 8802 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10935 ms. Remains : 626/626 places, 31352/31352 transitions.
Ending property specific reduction for RERS17pb113-PT-3-UpperBounds-15 in 101984 ms.
[2024-05-27 04:11:32] [INFO ] Flatten gal took : 1029 ms
[2024-05-27 04:11:33] [INFO ] Applying decomposition
[2024-05-27 04:11:33] [INFO ] Flatten gal took : 838 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6028169145450559196.txt' '-o' '/tmp/graph6028169145450559196.bin' '-w' '/tmp/graph6028169145450559196.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6028169145450559196.bin' '-l' '-1' '-v' '-w' '/tmp/graph6028169145450559196.weights' '-q' '0' '-e' '0.001'
[2024-05-27 04:11:36] [INFO ] Decomposing Gal with order
[2024-05-27 04:11:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 04:11:38] [INFO ] Removed a total of 91884 redundant transitions.
[2024-05-27 04:11:38] [INFO ] Flatten gal took : 1622 ms
[2024-05-27 04:11:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 1492 labels/synchronizations in 1171 ms.
[2024-05-27 04:11:40] [INFO ] Time to serialize gal into /tmp/UpperBounds15950163085883235944.gal : 175 ms
[2024-05-27 04:11:40] [INFO ] Time to serialize properties into /tmp/UpperBounds7597395840000317231.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds15950163085883235944.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7597395840000317231.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds7597395840000317231.prop.
ITS-tools command line returned an error code 137
[2024-05-27 04:24:24] [INFO ] Flatten gal took : 751 ms
[2024-05-27 04:24:25] [INFO ] Time to serialize gal into /tmp/UpperBounds4783076039714499120.gal : 1241 ms
[2024-05-27 04:24:25] [INFO ] Time to serialize properties into /tmp/UpperBounds9803928380131171891.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4783076039714499120.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9803928380131171891.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds9803928380131171891.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12998696 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16270264 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="RERS17pb113-PT-3"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is RERS17pb113-PT-3, 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 r329-tall-171662361500081"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RERS17pb113-PT-3.tgz
mv RERS17pb113-PT-3 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 ;