About the Execution of 2023-gold for PGCD-PT-D04N025
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.r263-tall-171654372900481.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 PGCD-PT-D04N025, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372900481
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 7.5K Apr 11 15:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 11 15:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 11 15:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 15:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 6 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 6 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 6 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 6 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 15:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 11 15:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 6 10:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 6 10:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 9.3K 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 PGCD-PT-D04N025-UpperBounds-00
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-01
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-02
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-03
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-04
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-05
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-06
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-07
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-08
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-09
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-10
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-11
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-12
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-13
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-14
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716698605958
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=PGCD-PT-D04N025
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-26 04:43:27] [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-26 04:43:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 04:43:27] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2024-05-26 04:43:27] [INFO ] Transformed 15 places.
[2024-05-26 04:43:27] [INFO ] Transformed 15 transitions.
[2024-05-26 04:43:27] [INFO ] Parsed PT model containing 15 places and 15 transitions and 70 arcs in 78 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 15 rows 15 cols
[2024-05-26 04:43:27] [INFO ] Computed 6 invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :546
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :438
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :397
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :428
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :308
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :480
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :365
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :276
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :435
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :282
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :438
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :374
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :325
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :278
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :365
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :329
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 16) seen :436
[2024-05-26 04:43:27] [INFO ] Invariant cache hit.
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-26 04:43:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-26 04:43:28] [INFO ] [Real]Added 5 Read/Feed constraints in 4 ms returned sat
[2024-05-26 04:43:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:28] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-26 04:43:28] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 04:43:28] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 9 ms.
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-26 04:43:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:28] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2024-05-26 04:43:28] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 04:43:28] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 7 ms.
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-26 04:43:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:28] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2024-05-26 04:43:28] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 3 ms to minimize.
[2024-05-26 04:43:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-05-26 04:43:28] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 04:43:28] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 7 ms.
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-26 04:43:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:28] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2024-05-26 04:43:28] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 04:43:28] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 13 ms.
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Real]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-26 04:43:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:28] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2024-05-26 04:43:28] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 04:43:28] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 5 ms.
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-26 04:43:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:28] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-26 04:43:28] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 04:43:28] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 8 ms.
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-26 04:43:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:28] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-26 04:43:28] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 04:43:28] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Real]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-26 04:43:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:28] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Nat]Added 5 Read/Feed constraints in 3 ms returned sat
[2024-05-26 04:43:28] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 04:43:28] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 7 ms.
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-26 04:43:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:28] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-26 04:43:28] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-26 04:43:28] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 7 ms.
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-26 04:43:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:28] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-26 04:43:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:29] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Nat]Added 5 Read/Feed constraints in 0 ms returned sat
[2024-05-26 04:43:29] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-26 04:43:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2024-05-26 04:43:29] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 04:43:29] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 7 ms.
[2024-05-26 04:43:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:29] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Real]Added 5 Read/Feed constraints in 2 ms returned sat
[2024-05-26 04:43:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:29] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-26 04:43:29] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 04:43:29] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 6 ms.
[2024-05-26 04:43:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:29] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-26 04:43:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:29] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2024-05-26 04:43:29] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 04:43:29] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 14 ms.
[2024-05-26 04:43:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:29] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-26 04:43:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:29] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Nat]Added 5 Read/Feed constraints in 0 ms returned sat
[2024-05-26 04:43:29] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-26 04:43:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2024-05-26 04:43:29] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 04:43:29] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 10 ms.
[2024-05-26 04:43:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:29] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-26 04:43:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:29] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-26 04:43:29] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 04:43:29] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 14 ms.
[2024-05-26 04:43:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:29] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-26 04:43:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-26 04:43:29] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-26 04:43:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-05-26 04:43:29] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 04:43:29] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 8 ms.
[2024-05-26 04:43:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:29] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-26 04:43:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:29] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-26 04:43:29] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-26 04:43:29] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-26 04:43:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2024-05-26 04:43:29] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 04:43:29] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [130, 130, 130, 130, 130, 130, 130, 130, 130, 130, 130, 130, 130, 130, 130, 130] Max seen :[74, 90, 104, 62, 74, 72, 62, 74, 102, 104, 74, 90, 104, 72, 100, 104]
FORMULA PGCD-PT-D04N025-UpperBounds-11 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D04N025-UpperBounds-01 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D04N025-UpperBounds-10 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D04N025-UpperBounds-07 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D04N025-UpperBounds-04 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D04N025-UpperBounds-00 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D04N025-UpperBounds-06 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D04N025-UpperBounds-03 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D04N025-UpperBounds-13 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D04N025-UpperBounds-05 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 10 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2024-05-26 04:43:30] [INFO ] Invariant cache hit.
[2024-05-26 04:43:30] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 15/15 places, 15/15 transitions.
[2024-05-26 04:43:30] [INFO ] Invariant cache hit.
Incomplete random walk after 1000027 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=4464 ) properties (out of 6) seen :289
Incomplete Best-First random walk after 1000001 steps, including 222 resets, run finished after 373 ms. (steps per millisecond=2680 ) properties (out of 6) seen :395
Incomplete Best-First random walk after 1000001 steps, including 229 resets, run finished after 320 ms. (steps per millisecond=3125 ) properties (out of 6) seen :277
Incomplete Best-First random walk after 1000001 steps, including 221 resets, run finished after 303 ms. (steps per millisecond=3300 ) properties (out of 6) seen :394
Incomplete Best-First random walk after 1000001 steps, including 222 resets, run finished after 307 ms. (steps per millisecond=3257 ) properties (out of 6) seen :242
Incomplete Best-First random walk after 1000001 steps, including 226 resets, run finished after 301 ms. (steps per millisecond=3322 ) properties (out of 6) seen :251
Incomplete Best-First random walk after 1000001 steps, including 240 resets, run finished after 297 ms. (steps per millisecond=3367 ) properties (out of 6) seen :399
[2024-05-26 04:43:32] [INFO ] Invariant cache hit.
[2024-05-26 04:43:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:32] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-26 04:43:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:32] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-26 04:43:32] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-26 04:43:32] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2024-05-26 04:43:32] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-26 04:43:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2024-05-26 04:43:32] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 04:43:32] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2024-05-26 04:43:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:32] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-26 04:43:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:32] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-26 04:43:32] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-26 04:43:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2024-05-26 04:43:32] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 04:43:32] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2024-05-26 04:43:32] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:32] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-26 04:43:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:32] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-26 04:43:32] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-26 04:43:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2024-05-26 04:43:32] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 04:43:32] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2024-05-26 04:43:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:32] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Real]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-26 04:43:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:32] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-26 04:43:32] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-26 04:43:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-05-26 04:43:32] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 04:43:32] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2024-05-26 04:43:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:32] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-26 04:43:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:32] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Nat]Added 5 Read/Feed constraints in 0 ms returned sat
[2024-05-26 04:43:32] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 04:43:32] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 9 ms.
[2024-05-26 04:43:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:32] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-26 04:43:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:32] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-26 04:43:32] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2024-05-26 04:43:32] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-26 04:43:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-05-26 04:43:32] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 04:43:32] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [130, 130, 130, 130, 130, 130] Max seen :[128, 128, 128, 126, 128, 128]
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 11 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 15/15 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2024-05-26 04:43:33] [INFO ] Invariant cache hit.
[2024-05-26 04:43:33] [INFO ] Implicit Places using invariants in 35 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 37 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 10/15 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 40 ms. Remains : 10/15 places, 15/15 transitions.
// Phase 1: matrix 15 rows 10 cols
[2024-05-26 04:43:33] [INFO ] Computed 1 invariants in 1 ms
Incomplete random walk after 1000029 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=6802 ) properties (out of 6) seen :284
Incomplete Best-First random walk after 1000001 steps, including 222 resets, run finished after 241 ms. (steps per millisecond=4149 ) properties (out of 6) seen :396
Incomplete Best-First random walk after 1000000 steps, including 209 resets, run finished after 238 ms. (steps per millisecond=4201 ) properties (out of 6) seen :271
Incomplete Best-First random walk after 1000001 steps, including 219 resets, run finished after 240 ms. (steps per millisecond=4166 ) properties (out of 6) seen :392
Incomplete Best-First random walk after 1000001 steps, including 226 resets, run finished after 247 ms. (steps per millisecond=4048 ) properties (out of 6) seen :241
Incomplete Best-First random walk after 1000001 steps, including 223 resets, run finished after 243 ms. (steps per millisecond=4115 ) properties (out of 6) seen :256
Incomplete Best-First random walk after 1000000 steps, including 223 resets, run finished after 241 ms. (steps per millisecond=4149 ) properties (out of 6) seen :396
[2024-05-26 04:43:34] [INFO ] Invariant cache hit.
[2024-05-26 04:43:34] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 04:43:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:34] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-26 04:43:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 04:43:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:34] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 04:43:34] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-26 04:43:34] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-26 04:43:34] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 04:43:34] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2024-05-26 04:43:34] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 04:43:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:34] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-26 04:43:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:34] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 04:43:34] [INFO ] [Nat]Added 5 Read/Feed constraints in 0 ms returned sat
[2024-05-26 04:43:34] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-26 04:43:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2024-05-26 04:43:34] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 04:43:34] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2024-05-26 04:43:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:34] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-26 04:43:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:34] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-26 04:43:34] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-26 04:43:34] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 04:43:34] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
[2024-05-26 04:43:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:34] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-26 04:43:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:34] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 04:43:34] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-26 04:43:35] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-26 04:43:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2024-05-26 04:43:35] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 04:43:35] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2024-05-26 04:43:35] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 04:43:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:35] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-26 04:43:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 04:43:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:35] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 04:43:35] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-26 04:43:35] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 04:43:35] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 4 ms.
[2024-05-26 04:43:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:35] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-26 04:43:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 04:43:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:35] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 04:43:35] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-26 04:43:35] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 04:43:35] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [130, 130, 130, 130, 130, 130] Max seen :[128, 128, 128, 128, 128, 128]
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2024-05-26 04:43:35] [INFO ] Invariant cache hit.
[2024-05-26 04:43:35] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-26 04:43:35] [INFO ] Invariant cache hit.
[2024-05-26 04:43:35] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-26 04:43:35] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-26 04:43:35] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-26 04:43:35] [INFO ] Invariant cache hit.
[2024-05-26 04:43:35] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 10/10 places, 15/15 transitions.
Starting property specific reduction for PGCD-PT-D04N025-UpperBounds-02
[2024-05-26 04:43:35] [INFO ] Invariant cache hit.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3335 ) properties (out of 1) seen :36
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :102
[2024-05-26 04:43:35] [INFO ] Invariant cache hit.
[2024-05-26 04:43:35] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 04:43:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:35] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-26 04:43:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 04:43:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:35] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-26 04:43:35] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-26 04:43:35] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-26 04:43:35] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 04:43:35] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[102]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2024-05-26 04:43:35] [INFO ] Invariant cache hit.
[2024-05-26 04:43:35] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 10/10 places, 15/15 transitions.
[2024-05-26 04:43:35] [INFO ] Invariant cache hit.
Incomplete random walk after 1000024 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=6756 ) properties (out of 1) seen :72
Incomplete Best-First random walk after 1000001 steps, including 230 resets, run finished after 235 ms. (steps per millisecond=4255 ) properties (out of 1) seen :104
[2024-05-26 04:43:35] [INFO ] Invariant cache hit.
[2024-05-26 04:43:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:35] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-26 04:43:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 04:43:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:35] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-26 04:43:35] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-26 04:43:35] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-26 04:43:35] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 04:43:35] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[128]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2024-05-26 04:43:35] [INFO ] Invariant cache hit.
[2024-05-26 04:43:35] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-26 04:43:35] [INFO ] Invariant cache hit.
[2024-05-26 04:43:35] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-26 04:43:35] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-26 04:43:35] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-26 04:43:35] [INFO ] Invariant cache hit.
[2024-05-26 04:43:36] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 10/10 places, 15/15 transitions.
Ending property specific reduction for PGCD-PT-D04N025-UpperBounds-02 in 689 ms.
Starting property specific reduction for PGCD-PT-D04N025-UpperBounds-08
[2024-05-26 04:43:36] [INFO ] Invariant cache hit.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5001 ) properties (out of 1) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :104
[2024-05-26 04:43:36] [INFO ] Invariant cache hit.
[2024-05-26 04:43:36] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:36] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-26 04:43:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 04:43:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:36] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-26 04:43:36] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-26 04:43:36] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-26 04:43:36] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 04:43:36] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[104]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2024-05-26 04:43:36] [INFO ] Invariant cache hit.
[2024-05-26 04:43:36] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 10/10 places, 15/15 transitions.
[2024-05-26 04:43:36] [INFO ] Invariant cache hit.
Incomplete random walk after 1000049 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=7194 ) properties (out of 1) seen :48
Incomplete Best-First random walk after 1000001 steps, including 228 resets, run finished after 234 ms. (steps per millisecond=4273 ) properties (out of 1) seen :104
[2024-05-26 04:43:36] [INFO ] Invariant cache hit.
[2024-05-26 04:43:36] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 04:43:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:36] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-26 04:43:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 04:43:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:36] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-26 04:43:36] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-26 04:43:36] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2024-05-26 04:43:36] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-26 04:43:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-05-26 04:43:36] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 04:43:36] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[128]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2024-05-26 04:43:36] [INFO ] Invariant cache hit.
[2024-05-26 04:43:36] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-26 04:43:36] [INFO ] Invariant cache hit.
[2024-05-26 04:43:36] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-26 04:43:36] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-26 04:43:36] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-26 04:43:36] [INFO ] Invariant cache hit.
[2024-05-26 04:43:36] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 10/10 places, 15/15 transitions.
Ending property specific reduction for PGCD-PT-D04N025-UpperBounds-08 in 700 ms.
Starting property specific reduction for PGCD-PT-D04N025-UpperBounds-09
[2024-05-26 04:43:36] [INFO ] Invariant cache hit.
Incomplete random walk after 10023 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5011 ) properties (out of 1) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :100
[2024-05-26 04:43:36] [INFO ] Invariant cache hit.
[2024-05-26 04:43:36] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 04:43:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:36] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-26 04:43:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:36] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 04:43:36] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-26 04:43:36] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-26 04:43:36] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 04:43:36] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[100]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2024-05-26 04:43:36] [INFO ] Invariant cache hit.
[2024-05-26 04:43:36] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 10/10 places, 15/15 transitions.
[2024-05-26 04:43:36] [INFO ] Invariant cache hit.
Incomplete random walk after 1000013 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=6944 ) properties (out of 1) seen :58
Incomplete Best-First random walk after 1000001 steps, including 230 resets, run finished after 242 ms. (steps per millisecond=4132 ) properties (out of 1) seen :104
[2024-05-26 04:43:37] [INFO ] Invariant cache hit.
[2024-05-26 04:43:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:37] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-26 04:43:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 04:43:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:37] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 04:43:37] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-26 04:43:37] [INFO ] [Nat]Added 5 Read/Feed constraints in 0 ms returned sat
[2024-05-26 04:43:37] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-26 04:43:37] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[128]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2024-05-26 04:43:37] [INFO ] Invariant cache hit.
[2024-05-26 04:43:37] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-26 04:43:37] [INFO ] Invariant cache hit.
[2024-05-26 04:43:37] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-26 04:43:37] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-26 04:43:37] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-26 04:43:37] [INFO ] Invariant cache hit.
[2024-05-26 04:43:37] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 10/10 places, 15/15 transitions.
Ending property specific reduction for PGCD-PT-D04N025-UpperBounds-09 in 696 ms.
Starting property specific reduction for PGCD-PT-D04N025-UpperBounds-12
[2024-05-26 04:43:37] [INFO ] Invariant cache hit.
Incomplete random walk after 10019 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2504 ) properties (out of 1) seen :28
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :102
[2024-05-26 04:43:37] [INFO ] Invariant cache hit.
[2024-05-26 04:43:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:37] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-26 04:43:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 04:43:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:37] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-26 04:43:37] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-26 04:43:37] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-26 04:43:37] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-26 04:43:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2024-05-26 04:43:37] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 04:43:37] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[102]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2024-05-26 04:43:37] [INFO ] Invariant cache hit.
[2024-05-26 04:43:37] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 10/10 places, 15/15 transitions.
[2024-05-26 04:43:37] [INFO ] Invariant cache hit.
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=7194 ) properties (out of 1) seen :56
Incomplete Best-First random walk after 1000001 steps, including 228 resets, run finished after 229 ms. (steps per millisecond=4366 ) properties (out of 1) seen :104
[2024-05-26 04:43:37] [INFO ] Invariant cache hit.
[2024-05-26 04:43:37] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 04:43:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:37] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-26 04:43:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:38] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-26 04:43:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-26 04:43:38] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-26 04:43:38] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-26 04:43:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2024-05-26 04:43:38] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 04:43:38] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[128]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2024-05-26 04:43:38] [INFO ] Invariant cache hit.
[2024-05-26 04:43:38] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-26 04:43:38] [INFO ] Invariant cache hit.
[2024-05-26 04:43:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-26 04:43:38] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-26 04:43:38] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-26 04:43:38] [INFO ] Invariant cache hit.
[2024-05-26 04:43:38] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 10/10 places, 15/15 transitions.
Ending property specific reduction for PGCD-PT-D04N025-UpperBounds-12 in 719 ms.
Starting property specific reduction for PGCD-PT-D04N025-UpperBounds-14
[2024-05-26 04:43:38] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :34
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :102
[2024-05-26 04:43:38] [INFO ] Invariant cache hit.
[2024-05-26 04:43:38] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 04:43:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:38] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-26 04:43:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:38] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 04:43:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-26 04:43:38] [INFO ] [Nat]Added 5 Read/Feed constraints in 0 ms returned sat
[2024-05-26 04:43:38] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 04:43:38] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[102]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2024-05-26 04:43:38] [INFO ] Invariant cache hit.
[2024-05-26 04:43:38] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 10/10 places, 15/15 transitions.
[2024-05-26 04:43:38] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=7194 ) properties (out of 1) seen :42
Incomplete Best-First random walk after 1000001 steps, including 229 resets, run finished after 237 ms. (steps per millisecond=4219 ) properties (out of 1) seen :104
[2024-05-26 04:43:38] [INFO ] Invariant cache hit.
[2024-05-26 04:43:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:38] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-26 04:43:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:38] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 04:43:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-26 04:43:38] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2024-05-26 04:43:38] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 04:43:38] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[128]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2024-05-26 04:43:38] [INFO ] Invariant cache hit.
[2024-05-26 04:43:38] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-26 04:43:38] [INFO ] Invariant cache hit.
[2024-05-26 04:43:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-26 04:43:38] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-26 04:43:38] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-26 04:43:38] [INFO ] Invariant cache hit.
[2024-05-26 04:43:38] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 10/10 places, 15/15 transitions.
Ending property specific reduction for PGCD-PT-D04N025-UpperBounds-14 in 665 ms.
Starting property specific reduction for PGCD-PT-D04N025-UpperBounds-15
[2024-05-26 04:43:38] [INFO ] Invariant cache hit.
Incomplete random walk after 10025 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3341 ) properties (out of 1) seen :30
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :104
[2024-05-26 04:43:38] [INFO ] Invariant cache hit.
[2024-05-26 04:43:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:38] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-26 04:43:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 04:43:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:38] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 04:43:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-26 04:43:38] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-26 04:43:38] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 04:43:38] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[104]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2024-05-26 04:43:38] [INFO ] Invariant cache hit.
[2024-05-26 04:43:38] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 10/10 places, 15/15 transitions.
[2024-05-26 04:43:38] [INFO ] Invariant cache hit.
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=6993 ) properties (out of 1) seen :62
Incomplete Best-First random walk after 1000001 steps, including 229 resets, run finished after 233 ms. (steps per millisecond=4291 ) properties (out of 1) seen :104
[2024-05-26 04:43:39] [INFO ] Invariant cache hit.
[2024-05-26 04:43:39] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 04:43:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:39] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-26 04:43:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:43:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 04:43:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 04:43:39] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-26 04:43:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-26 04:43:39] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-26 04:43:39] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-26 04:43:39] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[128]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2024-05-26 04:43:39] [INFO ] Invariant cache hit.
[2024-05-26 04:43:39] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-26 04:43:39] [INFO ] Invariant cache hit.
[2024-05-26 04:43:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-26 04:43:39] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-26 04:43:39] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-26 04:43:39] [INFO ] Invariant cache hit.
[2024-05-26 04:43:39] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 10/10 places, 15/15 transitions.
Ending property specific reduction for PGCD-PT-D04N025-UpperBounds-15 in 675 ms.
[2024-05-26 04:43:39] [INFO ] Flatten gal took : 15 ms
[2024-05-26 04:43:39] [INFO ] Applying decomposition
[2024-05-26 04:43:39] [INFO ] Flatten gal took : 2 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/graph12325012685177695025.txt' '-o' '/tmp/graph12325012685177695025.bin' '-w' '/tmp/graph12325012685177695025.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12325012685177695025.bin' '-l' '-1' '-v' '-w' '/tmp/graph12325012685177695025.weights' '-q' '0' '-e' '0.001'
[2024-05-26 04:43:39] [INFO ] Decomposing Gal with order
[2024-05-26 04:43:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 04:43:39] [INFO ] Flatten gal took : 22 ms
[2024-05-26 04:43:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 04:43:39] [INFO ] Time to serialize gal into /tmp/UpperBounds11029682560229941617.gal : 1 ms
[2024-05-26 04:43:39] [INFO ] Time to serialize properties into /tmp/UpperBounds12255375310347170301.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/UpperBounds11029682560229941617.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12255375310347170301.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 ...285
Loading property file /tmp/UpperBounds12255375310347170301.prop.
Detected timeout of ITS tools.
[2024-05-26 05:03:43] [INFO ] Flatten gal took : 2 ms
[2024-05-26 05:03:43] [INFO ] Time to serialize gal into /tmp/UpperBounds12534787424034888563.gal : 2 ms
[2024-05-26 05:03:43] [INFO ] Time to serialize properties into /tmp/UpperBounds5128301354076748871.prop : 1 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/UpperBounds12534787424034888563.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5128301354076748871.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 ...305
Loading property file /tmp/UpperBounds5128301354076748871.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.57364e+12,27.8625,424652,2,2182,5,1.54514e+06,6,0,73,1.57892e+06,0
Total reachable state count : 2573637642576
Verifying 6 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 128
Bounds property PGCD-PT-D04N025-UpperBounds-02 :0 <= p1_5 <= 128
FORMULA PGCD-PT-D04N025-UpperBounds-02 128 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PGCD-PT-D04N025-UpperBounds-02,0,27.8635,424652,1,0,7,1.54514e+06,9,1,217,1.57892e+06,4
Min sum of variable value : 0
Maximum sum along a path : 128
Bounds property PGCD-PT-D04N025-UpperBounds-08 :0 <= p1_2 <= 128
FORMULA PGCD-PT-D04N025-UpperBounds-08 128 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PGCD-PT-D04N025-UpperBounds-08,0,27.9216,424652,1,0,8,1.54514e+06,10,1,361,1.57892e+06,5
Min sum of variable value : 0
Maximum sum along a path : 128
Bounds property PGCD-PT-D04N025-UpperBounds-09 :0 <= p1_5 <= 128
FORMULA PGCD-PT-D04N025-UpperBounds-09 128 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PGCD-PT-D04N025-UpperBounds-09,0,27.9217,424652,1,0,8,1.54514e+06,10,1,361,1.57892e+06,5
Min sum of variable value : 0
Maximum sum along a path : 128
Bounds property PGCD-PT-D04N025-UpperBounds-12 :0 <= p1_1 <= 128
FORMULA PGCD-PT-D04N025-UpperBounds-12 128 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PGCD-PT-D04N025-UpperBounds-12,0,27.9947,424652,1,0,9,1.54514e+06,11,1,509,1.57892e+06,6
Min sum of variable value : 0
Maximum sum along a path : 128
Bounds property PGCD-PT-D04N025-UpperBounds-14 :0 <= p1_4 <= 128
FORMULA PGCD-PT-D04N025-UpperBounds-14 128 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PGCD-PT-D04N025-UpperBounds-14,0,28.0109,424652,1,0,10,1.54514e+06,12,1,645,1.57892e+06,7
Min sum of variable value : 0
Maximum sum along a path : 128
Bounds property PGCD-PT-D04N025-UpperBounds-15 :0 <= p1_5 <= 128
FORMULA PGCD-PT-D04N025-UpperBounds-15 128 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PGCD-PT-D04N025-UpperBounds-15,0,28.0109,424652,1,0,10,1.54514e+06,12,1,645,1.57892e+06,7
Total runtime 1244417 ms.
BK_STOP 1716699852819
--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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="PGCD-PT-D04N025"
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 PGCD-PT-D04N025, 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 r263-tall-171654372900481"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PGCD-PT-D04N025.tgz
mv PGCD-PT-D04N025 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 ;