About the Execution of 2023-gold for BugTracking-PT-q8m008
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16215.115 | 3600000.00 | 3665523.00 | 102223.20 | ? ? ? ? ? ? ? 0 ? ? 0 0 0 ? ? 0 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r065-tajo-171620414700251.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BugTracking-PT-q8m008, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414700251
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 129K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716645873894
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=BugTracking-PT-q8m008
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 14:04:36] [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-25 14:04:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 14:04:38] [INFO ] Load time of PNML (sax parser for PT used): 1514 ms
[2024-05-25 14:04:38] [INFO ] Transformed 754 places.
[2024-05-25 14:04:38] [INFO ] Transformed 27370 transitions.
[2024-05-25 14:04:38] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1963 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 21 ms.
Deduced a syphon composed of 474 places in 207 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m008-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3729 out of 3904 initially.
// Phase 1: matrix 3729 rows 280 cols
[2024-05-25 14:04:39] [INFO ] Computed 10 invariants in 107 ms
Incomplete random walk after 10000 steps, including 52 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
[2024-05-25 14:04:39] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2024-05-25 14:04:39] [INFO ] Computed 10 invariants in 42 ms
[2024-05-25 14:04:40] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2024-05-25 14:04:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:04:40] [INFO ] [Real]Absence check using state equation in 647 ms returned sat
[2024-05-25 14:04:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:04:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 33 ms returned sat
[2024-05-25 14:04:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:04:41] [INFO ] [Nat]Absence check using state equation in 833 ms returned sat
[2024-05-25 14:04:41] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-25 14:04:42] [INFO ] [Nat]Added 303 Read/Feed constraints in 285 ms returned sat
[2024-05-25 14:04:43] [INFO ] Deduced a trap composed of 17 places in 850 ms of which 13 ms to minimize.
[2024-05-25 14:04:44] [INFO ] Deduced a trap composed of 17 places in 1306 ms of which 2 ms to minimize.
[2024-05-25 14:04:45] [INFO ] Deduced a trap composed of 61 places in 586 ms of which 2 ms to minimize.
[2024-05-25 14:04:46] [INFO ] Deduced a trap composed of 47 places in 642 ms of which 2 ms to minimize.
[2024-05-25 14:04:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 14:04:46] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-25 14:04:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:04:46] [INFO ] [Real]Absence check using state equation in 631 ms returned sat
[2024-05-25 14:04:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:04:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-25 14:04:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:04:48] [INFO ] [Nat]Absence check using state equation in 1038 ms returned sat
[2024-05-25 14:04:48] [INFO ] [Nat]Added 303 Read/Feed constraints in 350 ms returned sat
[2024-05-25 14:04:48] [INFO ] Deduced a trap composed of 31 places in 419 ms of which 1 ms to minimize.
[2024-05-25 14:04:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 597 ms
[2024-05-25 14:04:49] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 409 ms.
[2024-05-25 14:04:50] [INFO ] Added : 7 causal constraints over 2 iterations in 1108 ms. Result :sat
[2024-05-25 14:04:50] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-25 14:04:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:04:50] [INFO ] [Real]Absence check using state equation in 595 ms returned sat
[2024-05-25 14:04:51] [INFO ] [Real]Added 303 Read/Feed constraints in 50 ms returned sat
[2024-05-25 14:04:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:04:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-25 14:04:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:04:52] [INFO ] [Nat]Absence check using state equation in 823 ms returned sat
[2024-05-25 14:04:52] [INFO ] [Nat]Added 303 Read/Feed constraints in 220 ms returned sat
[2024-05-25 14:04:52] [INFO ] Deduced a trap composed of 14 places in 328 ms of which 0 ms to minimize.
[2024-05-25 14:04:53] [INFO ] Deduced a trap composed of 60 places in 341 ms of which 1 ms to minimize.
[2024-05-25 14:04:53] [INFO ] Deduced a trap composed of 47 places in 566 ms of which 1 ms to minimize.
[2024-05-25 14:04:54] [INFO ] Deduced a trap composed of 61 places in 560 ms of which 0 ms to minimize.
[2024-05-25 14:04:55] [INFO ] Deduced a trap composed of 60 places in 294 ms of which 0 ms to minimize.
[2024-05-25 14:04:55] [INFO ] Deduced a trap composed of 59 places in 286 ms of which 1 ms to minimize.
[2024-05-25 14:04:55] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 1 ms to minimize.
[2024-05-25 14:04:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3618 ms
[2024-05-25 14:04:56] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 779 ms.
[2024-05-25 14:04:56] [INFO ] Added : 0 causal constraints over 0 iterations in 780 ms. Result :unknown
[2024-05-25 14:04:56] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-25 14:04:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:04:57] [INFO ] [Real]Absence check using state equation in 912 ms returned sat
[2024-05-25 14:04:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:04:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-25 14:04:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:04:58] [INFO ] [Nat]Absence check using state equation in 749 ms returned sat
[2024-05-25 14:04:58] [INFO ] [Nat]Added 303 Read/Feed constraints in 201 ms returned sat
[2024-05-25 14:04:59] [INFO ] Deduced a trap composed of 19 places in 422 ms of which 0 ms to minimize.
[2024-05-25 14:04:59] [INFO ] Deduced a trap composed of 14 places in 428 ms of which 1 ms to minimize.
[2024-05-25 14:05:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1265 ms
[2024-05-25 14:05:00] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 429 ms.
[2024-05-25 14:05:01] [INFO ] Added : 6 causal constraints over 2 iterations in 1075 ms. Result :sat
[2024-05-25 14:05:01] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-25 14:05:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:05:01] [INFO ] [Real]Absence check using state equation in 585 ms returned sat
[2024-05-25 14:05:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:05:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-25 14:05:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:05:05] [INFO ] [Nat]Absence check using state equation in 3153 ms returned sat
[2024-05-25 14:05:05] [INFO ] [Nat]Added 303 Read/Feed constraints in 205 ms returned sat
[2024-05-25 14:05:05] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 351 ms.
[2024-05-25 14:05:06] [INFO ] Added : 12 causal constraints over 3 iterations in 1195 ms. Result :sat
[2024-05-25 14:05:07] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-25 14:05:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:05:08] [INFO ] [Real]Absence check using state equation in 1051 ms returned sat
[2024-05-25 14:05:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:05:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-25 14:05:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:05:08] [INFO ] [Nat]Absence check using state equation in 653 ms returned sat
[2024-05-25 14:05:09] [INFO ] [Nat]Added 303 Read/Feed constraints in 159 ms returned sat
[2024-05-25 14:05:09] [INFO ] Deduced a trap composed of 58 places in 617 ms of which 1 ms to minimize.
[2024-05-25 14:05:10] [INFO ] Deduced a trap composed of 34 places in 836 ms of which 1 ms to minimize.
[2024-05-25 14:05:11] [INFO ] Deduced a trap composed of 59 places in 604 ms of which 1 ms to minimize.
[2024-05-25 14:05:12] [INFO ] Deduced a trap composed of 67 places in 605 ms of which 0 ms to minimize.
[2024-05-25 14:05:12] [INFO ] Deduced a trap composed of 95 places in 602 ms of which 0 ms to minimize.
[2024-05-25 14:05:13] [INFO ] Deduced a trap composed of 92 places in 791 ms of which 1 ms to minimize.
[2024-05-25 14:05:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 14:05:13] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-25 14:05:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:05:14] [INFO ] [Real]Absence check using state equation in 1070 ms returned sat
[2024-05-25 14:05:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:05:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-25 14:05:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:05:15] [INFO ] [Nat]Absence check using state equation in 635 ms returned sat
[2024-05-25 14:05:16] [INFO ] [Nat]Added 303 Read/Feed constraints in 211 ms returned sat
[2024-05-25 14:05:16] [INFO ] Deduced a trap composed of 38 places in 582 ms of which 1 ms to minimize.
[2024-05-25 14:05:17] [INFO ] Deduced a trap composed of 26 places in 554 ms of which 1 ms to minimize.
[2024-05-25 14:05:18] [INFO ] Deduced a trap composed of 58 places in 582 ms of which 2 ms to minimize.
[2024-05-25 14:05:18] [INFO ] Deduced a trap composed of 58 places in 552 ms of which 1 ms to minimize.
[2024-05-25 14:05:19] [INFO ] Deduced a trap composed of 39 places in 591 ms of which 0 ms to minimize.
[2024-05-25 14:05:20] [INFO ] Deduced a trap composed of 12 places in 610 ms of which 0 ms to minimize.
[2024-05-25 14:05:20] [INFO ] Deduced a trap composed of 29 places in 395 ms of which 0 ms to minimize.
[2024-05-25 14:05:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 14:05:20] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-25 14:05:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:05:23] [INFO ] [Real]Absence check using state equation in 2975 ms returned sat
[2024-05-25 14:05:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:05:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 20 ms returned sat
[2024-05-25 14:05:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:05:24] [INFO ] [Nat]Absence check using state equation in 975 ms returned sat
[2024-05-25 14:05:24] [INFO ] [Nat]Added 303 Read/Feed constraints in 258 ms returned sat
[2024-05-25 14:05:25] [INFO ] Deduced a trap composed of 23 places in 500 ms of which 1 ms to minimize.
[2024-05-25 14:05:26] [INFO ] Deduced a trap composed of 85 places in 651 ms of which 1 ms to minimize.
[2024-05-25 14:05:27] [INFO ] Deduced a trap composed of 40 places in 533 ms of which 0 ms to minimize.
[2024-05-25 14:05:27] [INFO ] Deduced a trap composed of 69 places in 463 ms of which 1 ms to minimize.
[2024-05-25 14:05:28] [INFO ] Deduced a trap composed of 69 places in 567 ms of which 1 ms to minimize.
[2024-05-25 14:05:28] [INFO ] Deduced a trap composed of 70 places in 565 ms of which 2 ms to minimize.
[2024-05-25 14:05:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 14:05:29] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-25 14:05:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:05:29] [INFO ] [Real]Absence check using state equation in 558 ms returned sat
[2024-05-25 14:05:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:05:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-25 14:05:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:05:30] [INFO ] [Nat]Absence check using state equation in 979 ms returned sat
[2024-05-25 14:05:30] [INFO ] [Nat]Added 303 Read/Feed constraints in 226 ms returned sat
[2024-05-25 14:05:31] [INFO ] Deduced a trap composed of 47 places in 266 ms of which 2 ms to minimize.
[2024-05-25 14:05:31] [INFO ] Deduced a trap composed of 24 places in 286 ms of which 2 ms to minimize.
[2024-05-25 14:05:32] [INFO ] Deduced a trap composed of 33 places in 295 ms of which 1 ms to minimize.
[2024-05-25 14:05:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1278 ms
[2024-05-25 14:05:32] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 363 ms.
[2024-05-25 14:05:32] [INFO ] Added : 5 causal constraints over 1 iterations in 784 ms. Result :sat
[2024-05-25 14:05:33] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-25 14:05:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:05:33] [INFO ] [Real]Absence check using state equation in 641 ms returned sat
[2024-05-25 14:05:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:05:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-25 14:05:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:05:34] [INFO ] [Nat]Absence check using state equation in 692 ms returned sat
[2024-05-25 14:05:35] [INFO ] [Nat]Added 303 Read/Feed constraints in 483 ms returned sat
[2024-05-25 14:05:36] [INFO ] Deduced a trap composed of 24 places in 710 ms of which 1 ms to minimize.
[2024-05-25 14:05:36] [INFO ] Deduced a trap composed of 30 places in 536 ms of which 0 ms to minimize.
[2024-05-25 14:05:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1611 ms
[2024-05-25 14:05:37] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 346 ms.
[2024-05-25 14:05:37] [INFO ] Added : 8 causal constraints over 2 iterations in 972 ms. Result :sat
[2024-05-25 14:05:38] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-25 14:05:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:05:38] [INFO ] [Real]Absence check using state equation in 716 ms returned sat
[2024-05-25 14:05:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:05:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-25 14:05:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:05:39] [INFO ] [Nat]Absence check using state equation in 693 ms returned sat
[2024-05-25 14:05:40] [INFO ] [Nat]Added 303 Read/Feed constraints in 450 ms returned sat
[2024-05-25 14:05:40] [INFO ] Deduced a trap composed of 23 places in 614 ms of which 1 ms to minimize.
[2024-05-25 14:05:41] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 0 ms to minimize.
[2024-05-25 14:05:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1241 ms
[2024-05-25 14:05:41] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 303 ms.
[2024-05-25 14:05:42] [INFO ] Added : 10 causal constraints over 2 iterations in 917 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, 1, -1, 1, -1, -1, -1, 1, 1, 1, 1] Max seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 11 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 721 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 722 ms. Remains : 269/280 places, 3871/3904 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:05:43] [INFO ] Computed 8 invariants in 45 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5136 ms. (steps per millisecond=194 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1809 ms. (steps per millisecond=552 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1788 ms. (steps per millisecond=559 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1829 ms. (steps per millisecond=546 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1803 ms. (steps per millisecond=554 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1844 ms. (steps per millisecond=542 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1879 ms. (steps per millisecond=532 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1949 ms. (steps per millisecond=513 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2321 ms. (steps per millisecond=430 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2144 ms. (steps per millisecond=466 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 2108 ms. (steps per millisecond=474 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2046 ms. (steps per millisecond=488 ) properties (out of 11) seen :0
[2024-05-25 14:06:10] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:06:10] [INFO ] Computed 8 invariants in 31 ms
[2024-05-25 14:06:10] [INFO ] [Real]Absence check using 8 positive place invariants in 16 ms returned sat
[2024-05-25 14:06:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:06:11] [INFO ] [Real]Absence check using state equation in 697 ms returned sat
[2024-05-25 14:06:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:06:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:06:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:06:12] [INFO ] [Nat]Absence check using state equation in 966 ms returned sat
[2024-05-25 14:06:12] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:06:12] [INFO ] [Nat]Added 283 Read/Feed constraints in 148 ms returned sat
[2024-05-25 14:06:13] [INFO ] Deduced a trap composed of 28 places in 465 ms of which 1 ms to minimize.
[2024-05-25 14:06:13] [INFO ] Deduced a trap composed of 85 places in 463 ms of which 0 ms to minimize.
[2024-05-25 14:06:14] [INFO ] Deduced a trap composed of 62 places in 445 ms of which 0 ms to minimize.
[2024-05-25 14:06:14] [INFO ] Deduced a trap composed of 31 places in 453 ms of which 0 ms to minimize.
[2024-05-25 14:06:15] [INFO ] Deduced a trap composed of 53 places in 440 ms of which 1 ms to minimize.
[2024-05-25 14:06:16] [INFO ] Deduced a trap composed of 57 places in 629 ms of which 1 ms to minimize.
[2024-05-25 14:06:16] [INFO ] Deduced a trap composed of 60 places in 455 ms of which 1 ms to minimize.
[2024-05-25 14:06:17] [INFO ] Deduced a trap composed of 92 places in 417 ms of which 0 ms to minimize.
[2024-05-25 14:06:18] [INFO ] Deduced a trap composed of 102 places in 438 ms of which 1 ms to minimize.
[2024-05-25 14:06:18] [INFO ] Deduced a trap composed of 59 places in 424 ms of which 1 ms to minimize.
[2024-05-25 14:06:19] [INFO ] Deduced a trap composed of 61 places in 422 ms of which 2 ms to minimize.
[2024-05-25 14:06:19] [INFO ] Deduced a trap composed of 90 places in 432 ms of which 0 ms to minimize.
[2024-05-25 14:06:20] [INFO ] Deduced a trap composed of 41 places in 503 ms of which 1 ms to minimize.
[2024-05-25 14:06:21] [INFO ] Deduced a trap composed of 100 places in 495 ms of which 0 ms to minimize.
[2024-05-25 14:06:21] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 1 ms to minimize.
[2024-05-25 14:06:21] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 9002 ms
[2024-05-25 14:06:21] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 307 ms.
[2024-05-25 14:06:22] [INFO ] Added : 5 causal constraints over 1 iterations in 773 ms. Result :sat
[2024-05-25 14:06:22] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:06:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:06:23] [INFO ] [Real]Absence check using state equation in 673 ms returned sat
[2024-05-25 14:06:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:06:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:06:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:06:24] [INFO ] [Nat]Absence check using state equation in 552 ms returned sat
[2024-05-25 14:06:24] [INFO ] [Nat]Added 283 Read/Feed constraints in 249 ms returned sat
[2024-05-25 14:06:24] [INFO ] Deduced a trap composed of 19 places in 474 ms of which 0 ms to minimize.
[2024-05-25 14:06:25] [INFO ] Deduced a trap composed of 17 places in 539 ms of which 41 ms to minimize.
[2024-05-25 14:06:25] [INFO ] Deduced a trap composed of 60 places in 390 ms of which 1 ms to minimize.
[2024-05-25 14:06:26] [INFO ] Deduced a trap composed of 28 places in 422 ms of which 0 ms to minimize.
[2024-05-25 14:06:26] [INFO ] Deduced a trap composed of 34 places in 358 ms of which 1 ms to minimize.
[2024-05-25 14:06:27] [INFO ] Deduced a trap composed of 26 places in 367 ms of which 0 ms to minimize.
[2024-05-25 14:06:27] [INFO ] Deduced a trap composed of 26 places in 367 ms of which 1 ms to minimize.
[2024-05-25 14:06:28] [INFO ] Deduced a trap composed of 14 places in 364 ms of which 1 ms to minimize.
[2024-05-25 14:06:28] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3999 ms
[2024-05-25 14:06:28] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 310 ms.
[2024-05-25 14:06:29] [INFO ] Added : 6 causal constraints over 2 iterations in 900 ms. Result :sat
[2024-05-25 14:06:29] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:06:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:06:30] [INFO ] [Real]Absence check using state equation in 628 ms returned sat
[2024-05-25 14:06:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:06:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:06:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:06:30] [INFO ] [Nat]Absence check using state equation in 715 ms returned sat
[2024-05-25 14:06:31] [INFO ] [Nat]Added 283 Read/Feed constraints in 194 ms returned sat
[2024-05-25 14:06:31] [INFO ] Deduced a trap composed of 76 places in 503 ms of which 1 ms to minimize.
[2024-05-25 14:06:32] [INFO ] Deduced a trap composed of 83 places in 461 ms of which 4 ms to minimize.
[2024-05-25 14:06:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1343 ms
[2024-05-25 14:06:32] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 347 ms.
[2024-05-25 14:06:33] [INFO ] Added : 4 causal constraints over 1 iterations in 839 ms. Result :sat
[2024-05-25 14:06:33] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:06:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:06:34] [INFO ] [Real]Absence check using state equation in 1004 ms returned sat
[2024-05-25 14:06:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:06:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:06:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:06:35] [INFO ] [Nat]Absence check using state equation in 635 ms returned sat
[2024-05-25 14:06:35] [INFO ] [Nat]Added 283 Read/Feed constraints in 236 ms returned sat
[2024-05-25 14:06:36] [INFO ] Deduced a trap composed of 48 places in 484 ms of which 0 ms to minimize.
[2024-05-25 14:06:36] [INFO ] Deduced a trap composed of 20 places in 472 ms of which 3 ms to minimize.
[2024-05-25 14:06:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1321 ms
[2024-05-25 14:06:37] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 569 ms.
[2024-05-25 14:06:37] [INFO ] Added : 4 causal constraints over 1 iterations in 1038 ms. Result :sat
[2024-05-25 14:06:38] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:06:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:06:38] [INFO ] [Real]Absence check using state equation in 638 ms returned sat
[2024-05-25 14:06:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:06:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-25 14:06:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:06:39] [INFO ] [Nat]Absence check using state equation in 655 ms returned sat
[2024-05-25 14:06:39] [INFO ] [Nat]Added 283 Read/Feed constraints in 173 ms returned sat
[2024-05-25 14:06:40] [INFO ] Deduced a trap composed of 56 places in 972 ms of which 29 ms to minimize.
[2024-05-25 14:06:41] [INFO ] Deduced a trap composed of 15 places in 545 ms of which 2 ms to minimize.
[2024-05-25 14:06:42] [INFO ] Deduced a trap composed of 52 places in 441 ms of which 1 ms to minimize.
[2024-05-25 14:06:42] [INFO ] Deduced a trap composed of 48 places in 346 ms of which 1 ms to minimize.
[2024-05-25 14:06:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2995 ms
[2024-05-25 14:06:43] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 322 ms.
[2024-05-25 14:06:43] [INFO ] Added : 4 causal constraints over 1 iterations in 810 ms. Result :sat
[2024-05-25 14:06:43] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:06:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:06:44] [INFO ] [Real]Absence check using state equation in 701 ms returned sat
[2024-05-25 14:06:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:06:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:06:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:06:45] [INFO ] [Nat]Absence check using state equation in 677 ms returned sat
[2024-05-25 14:06:45] [INFO ] [Nat]Added 283 Read/Feed constraints in 229 ms returned sat
[2024-05-25 14:06:46] [INFO ] Deduced a trap composed of 42 places in 462 ms of which 1 ms to minimize.
[2024-05-25 14:06:46] [INFO ] Deduced a trap composed of 26 places in 262 ms of which 1 ms to minimize.
[2024-05-25 14:06:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1101 ms
[2024-05-25 14:06:47] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 321 ms.
[2024-05-25 14:06:47] [INFO ] Added : 5 causal constraints over 1 iterations in 851 ms. Result :sat
[2024-05-25 14:06:47] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:06:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:06:48] [INFO ] [Real]Absence check using state equation in 626 ms returned sat
[2024-05-25 14:06:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:06:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:06:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:06:49] [INFO ] [Nat]Absence check using state equation in 647 ms returned sat
[2024-05-25 14:06:49] [INFO ] [Nat]Added 283 Read/Feed constraints in 162 ms returned sat
[2024-05-25 14:06:50] [INFO ] Deduced a trap composed of 91 places in 512 ms of which 1 ms to minimize.
[2024-05-25 14:06:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 685 ms
[2024-05-25 14:06:50] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 331 ms.
[2024-05-25 14:06:51] [INFO ] Deduced a trap composed of 14 places in 538 ms of which 0 ms to minimize.
[2024-05-25 14:06:52] [INFO ] Deduced a trap composed of 57 places in 493 ms of which 1 ms to minimize.
[2024-05-25 14:06:52] [INFO ] Deduced a trap composed of 62 places in 355 ms of which 1 ms to minimize.
[2024-05-25 14:06:53] [INFO ] Deduced a trap composed of 25 places in 380 ms of which 1 ms to minimize.
[2024-05-25 14:06:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2364 ms
[2024-05-25 14:06:53] [INFO ] Added : 4 causal constraints over 1 iterations in 3220 ms. Result :sat
[2024-05-25 14:06:53] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:06:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:06:54] [INFO ] [Real]Absence check using state equation in 653 ms returned sat
[2024-05-25 14:06:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:06:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 14:06:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:06:55] [INFO ] [Nat]Absence check using state equation in 596 ms returned sat
[2024-05-25 14:06:55] [INFO ] [Nat]Added 283 Read/Feed constraints in 229 ms returned sat
[2024-05-25 14:06:55] [INFO ] Deduced a trap composed of 16 places in 410 ms of which 1 ms to minimize.
[2024-05-25 14:06:56] [INFO ] Deduced a trap composed of 59 places in 360 ms of which 1 ms to minimize.
[2024-05-25 14:06:56] [INFO ] Deduced a trap composed of 33 places in 376 ms of which 1 ms to minimize.
[2024-05-25 14:06:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1548 ms
[2024-05-25 14:06:57] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 355 ms.
[2024-05-25 14:06:58] [INFO ] Added : 10 causal constraints over 3 iterations in 1364 ms. Result :sat
[2024-05-25 14:06:58] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 14:06:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:06:59] [INFO ] [Real]Absence check using state equation in 1125 ms returned sat
[2024-05-25 14:06:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:06:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 14:06:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:07:00] [INFO ] [Nat]Absence check using state equation in 914 ms returned sat
[2024-05-25 14:07:00] [INFO ] [Nat]Added 283 Read/Feed constraints in 253 ms returned sat
[2024-05-25 14:07:01] [INFO ] Deduced a trap composed of 22 places in 323 ms of which 1 ms to minimize.
[2024-05-25 14:07:01] [INFO ] Deduced a trap composed of 23 places in 400 ms of which 1 ms to minimize.
[2024-05-25 14:07:02] [INFO ] Deduced a trap composed of 68 places in 405 ms of which 1 ms to minimize.
[2024-05-25 14:07:02] [INFO ] Deduced a trap composed of 57 places in 425 ms of which 0 ms to minimize.
[2024-05-25 14:07:03] [INFO ] Deduced a trap composed of 57 places in 313 ms of which 0 ms to minimize.
[2024-05-25 14:07:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2619 ms
[2024-05-25 14:07:03] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 339 ms.
[2024-05-25 14:07:04] [INFO ] Added : 3 causal constraints over 1 iterations in 821 ms. Result :sat
[2024-05-25 14:07:04] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:07:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:07:05] [INFO ] [Real]Absence check using state equation in 660 ms returned sat
[2024-05-25 14:07:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:07:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:07:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:07:08] [INFO ] [Nat]Absence check using state equation in 2870 ms returned sat
[2024-05-25 14:07:08] [INFO ] [Nat]Added 283 Read/Feed constraints in 258 ms returned sat
[2024-05-25 14:07:09] [INFO ] Deduced a trap composed of 43 places in 368 ms of which 0 ms to minimize.
[2024-05-25 14:07:09] [INFO ] Deduced a trap composed of 18 places in 312 ms of which 1 ms to minimize.
[2024-05-25 14:07:09] [INFO ] Deduced a trap composed of 59 places in 339 ms of which 0 ms to minimize.
[2024-05-25 14:07:10] [INFO ] Deduced a trap composed of 24 places in 233 ms of which 1 ms to minimize.
[2024-05-25 14:07:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1699 ms
[2024-05-25 14:07:10] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 314 ms.
[2024-05-25 14:07:11] [INFO ] Added : 9 causal constraints over 3 iterations in 1087 ms. Result :sat
[2024-05-25 14:07:11] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:07:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:07:12] [INFO ] [Real]Absence check using state equation in 620 ms returned sat
[2024-05-25 14:07:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:07:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:07:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:07:13] [INFO ] [Nat]Absence check using state equation in 658 ms returned sat
[2024-05-25 14:07:13] [INFO ] [Nat]Added 283 Read/Feed constraints in 458 ms returned sat
[2024-05-25 14:07:14] [INFO ] Deduced a trap composed of 52 places in 415 ms of which 1 ms to minimize.
[2024-05-25 14:07:14] [INFO ] Deduced a trap composed of 52 places in 409 ms of which 1 ms to minimize.
[2024-05-25 14:07:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1122 ms
[2024-05-25 14:07:14] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 307 ms.
[2024-05-25 14:07:16] [INFO ] Deduced a trap composed of 103 places in 537 ms of which 1 ms to minimize.
[2024-05-25 14:07:16] [INFO ] Deduced a trap composed of 96 places in 543 ms of which 0 ms to minimize.
[2024-05-25 14:07:17] [INFO ] Deduced a trap composed of 91 places in 478 ms of which 1 ms to minimize.
[2024-05-25 14:07:18] [INFO ] Deduced a trap composed of 91 places in 463 ms of which 1 ms to minimize.
[2024-05-25 14:07:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2791 ms
[2024-05-25 14:07:18] [INFO ] Added : 7 causal constraints over 2 iterations in 3882 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, 1, -1, 1, -1, -1, -1, 1, 1, 1, 1] Max seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 11 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 67 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 85 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:07:19] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:07:19] [INFO ] Invariant cache hit.
[2024-05-25 14:07:20] [INFO ] Implicit Places using invariants in 824 ms returned []
[2024-05-25 14:07:20] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:07:20] [INFO ] Invariant cache hit.
[2024-05-25 14:07:20] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:07:22] [INFO ] Implicit Places using invariants and state equation in 2031 ms returned []
Implicit Place search using SMT with State Equation took 2861 ms to find 0 implicit places.
[2024-05-25 14:07:22] [INFO ] Redundant transitions in 384 ms returned []
[2024-05-25 14:07:22] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:07:22] [INFO ] Invariant cache hit.
[2024-05-25 14:07:24] [INFO ] Dead Transitions using invariants and state equation in 1575 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4917 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m008-UpperBounds-00
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:07:24] [INFO ] Computed 8 invariants in 12 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
[2024-05-25 14:07:24] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:07:24] [INFO ] Computed 8 invariants in 12 ms
[2024-05-25 14:07:24] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-05-25 14:07:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:07:24] [INFO ] [Real]Absence check using state equation in 596 ms returned sat
[2024-05-25 14:07:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:07:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:07:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:07:25] [INFO ] [Nat]Absence check using state equation in 534 ms returned sat
[2024-05-25 14:07:25] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:07:25] [INFO ] [Nat]Added 283 Read/Feed constraints in 112 ms returned sat
[2024-05-25 14:07:26] [INFO ] Deduced a trap composed of 28 places in 372 ms of which 1 ms to minimize.
[2024-05-25 14:07:26] [INFO ] Deduced a trap composed of 85 places in 430 ms of which 0 ms to minimize.
[2024-05-25 14:07:27] [INFO ] Deduced a trap composed of 62 places in 407 ms of which 1 ms to minimize.
[2024-05-25 14:07:27] [INFO ] Deduced a trap composed of 31 places in 424 ms of which 0 ms to minimize.
[2024-05-25 14:07:28] [INFO ] Deduced a trap composed of 53 places in 540 ms of which 1 ms to minimize.
[2024-05-25 14:07:29] [INFO ] Deduced a trap composed of 57 places in 596 ms of which 0 ms to minimize.
[2024-05-25 14:07:30] [INFO ] Deduced a trap composed of 60 places in 724 ms of which 26 ms to minimize.
[2024-05-25 14:07:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 150 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:07:30] [INFO ] Computed 8 invariants in 11 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 4112 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1790 ms. (steps per millisecond=558 ) properties (out of 1) seen :0
[2024-05-25 14:07:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:07:36] [INFO ] Computed 8 invariants in 28 ms
[2024-05-25 14:07:36] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:07:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:07:37] [INFO ] [Real]Absence check using state equation in 611 ms returned sat
[2024-05-25 14:07:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:07:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:07:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:07:37] [INFO ] [Nat]Absence check using state equation in 674 ms returned sat
[2024-05-25 14:07:37] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:07:38] [INFO ] [Nat]Added 283 Read/Feed constraints in 194 ms returned sat
[2024-05-25 14:07:38] [INFO ] Deduced a trap composed of 28 places in 586 ms of which 1 ms to minimize.
[2024-05-25 14:07:39] [INFO ] Deduced a trap composed of 85 places in 770 ms of which 0 ms to minimize.
[2024-05-25 14:07:40] [INFO ] Deduced a trap composed of 62 places in 503 ms of which 0 ms to minimize.
[2024-05-25 14:07:40] [INFO ] Deduced a trap composed of 31 places in 450 ms of which 0 ms to minimize.
[2024-05-25 14:07:41] [INFO ] Deduced a trap composed of 53 places in 447 ms of which 1 ms to minimize.
[2024-05-25 14:07:42] [INFO ] Deduced a trap composed of 57 places in 598 ms of which 1 ms to minimize.
[2024-05-25 14:07:43] [INFO ] Deduced a trap composed of 60 places in 454 ms of which 0 ms to minimize.
[2024-05-25 14:07:43] [INFO ] Deduced a trap composed of 92 places in 468 ms of which 1 ms to minimize.
[2024-05-25 14:07:44] [INFO ] Deduced a trap composed of 102 places in 440 ms of which 0 ms to minimize.
[2024-05-25 14:07:45] [INFO ] Deduced a trap composed of 59 places in 473 ms of which 0 ms to minimize.
[2024-05-25 14:07:45] [INFO ] Deduced a trap composed of 61 places in 494 ms of which 2 ms to minimize.
[2024-05-25 14:07:46] [INFO ] Deduced a trap composed of 90 places in 515 ms of which 0 ms to minimize.
[2024-05-25 14:07:47] [INFO ] Deduced a trap composed of 41 places in 494 ms of which 1 ms to minimize.
[2024-05-25 14:07:47] [INFO ] Deduced a trap composed of 100 places in 407 ms of which 1 ms to minimize.
[2024-05-25 14:07:47] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 1 ms to minimize.
[2024-05-25 14:07:48] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 9965 ms
[2024-05-25 14:07:48] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 357 ms.
[2024-05-25 14:07:48] [INFO ] Added : 5 causal constraints over 1 iterations in 848 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 72 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 73 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:07:49] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:07:49] [INFO ] Invariant cache hit.
[2024-05-25 14:07:50] [INFO ] Implicit Places using invariants in 709 ms returned []
[2024-05-25 14:07:50] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:07:50] [INFO ] Invariant cache hit.
[2024-05-25 14:07:50] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:07:53] [INFO ] Implicit Places using invariants and state equation in 3161 ms returned []
Implicit Place search using SMT with State Equation took 3875 ms to find 0 implicit places.
[2024-05-25 14:07:53] [INFO ] Redundant transitions in 397 ms returned []
[2024-05-25 14:07:53] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:07:53] [INFO ] Invariant cache hit.
[2024-05-25 14:07:54] [INFO ] Dead Transitions using invariants and state equation in 1288 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5648 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m008-UpperBounds-00 in 30806 ms.
Starting property specific reduction for BugTracking-PT-q8m008-UpperBounds-01
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:07:54] [INFO ] Computed 8 invariants in 17 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
[2024-05-25 14:07:55] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:07:55] [INFO ] Computed 8 invariants in 16 ms
[2024-05-25 14:07:55] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 14:07:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:07:56] [INFO ] [Real]Absence check using state equation in 858 ms returned sat
[2024-05-25 14:07:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:07:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:07:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:07:56] [INFO ] [Nat]Absence check using state equation in 645 ms returned sat
[2024-05-25 14:07:56] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:07:57] [INFO ] [Nat]Added 283 Read/Feed constraints in 301 ms returned sat
[2024-05-25 14:07:58] [INFO ] Deduced a trap composed of 19 places in 893 ms of which 1 ms to minimize.
[2024-05-25 14:07:58] [INFO ] Deduced a trap composed of 17 places in 707 ms of which 1 ms to minimize.
[2024-05-25 14:07:59] [INFO ] Deduced a trap composed of 60 places in 536 ms of which 0 ms to minimize.
[2024-05-25 14:08:00] [INFO ] Deduced a trap composed of 28 places in 529 ms of which 1 ms to minimize.
[2024-05-25 14:08:00] [INFO ] Deduced a trap composed of 34 places in 547 ms of which 1 ms to minimize.
[2024-05-25 14:08:01] [INFO ] Deduced a trap composed of 26 places in 556 ms of which 1 ms to minimize.
[2024-05-25 14:08:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 134 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:08:01] [INFO ] Computed 8 invariants in 23 ms
Incomplete random walk after 1000000 steps, including 3 resets, run finished after 4928 ms. (steps per millisecond=202 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2020 ms. (steps per millisecond=495 ) properties (out of 1) seen :0
[2024-05-25 14:08:08] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:08:08] [INFO ] Computed 8 invariants in 10 ms
[2024-05-25 14:08:08] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:08:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:08:09] [INFO ] [Real]Absence check using state equation in 659 ms returned sat
[2024-05-25 14:08:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:08:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:08:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:08:10] [INFO ] [Nat]Absence check using state equation in 625 ms returned sat
[2024-05-25 14:08:10] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:08:10] [INFO ] [Nat]Added 283 Read/Feed constraints in 258 ms returned sat
[2024-05-25 14:08:11] [INFO ] Deduced a trap composed of 19 places in 495 ms of which 1 ms to minimize.
[2024-05-25 14:08:11] [INFO ] Deduced a trap composed of 17 places in 478 ms of which 1 ms to minimize.
[2024-05-25 14:08:12] [INFO ] Deduced a trap composed of 60 places in 363 ms of which 0 ms to minimize.
[2024-05-25 14:08:12] [INFO ] Deduced a trap composed of 28 places in 347 ms of which 0 ms to minimize.
[2024-05-25 14:08:13] [INFO ] Deduced a trap composed of 34 places in 408 ms of which 1 ms to minimize.
[2024-05-25 14:08:13] [INFO ] Deduced a trap composed of 26 places in 419 ms of which 1 ms to minimize.
[2024-05-25 14:08:14] [INFO ] Deduced a trap composed of 26 places in 423 ms of which 0 ms to minimize.
[2024-05-25 14:08:14] [INFO ] Deduced a trap composed of 14 places in 514 ms of which 1 ms to minimize.
[2024-05-25 14:08:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4419 ms
[2024-05-25 14:08:15] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 340 ms.
[2024-05-25 14:08:16] [INFO ] Added : 6 causal constraints over 2 iterations in 979 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 158 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 148 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:08:16] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:08:16] [INFO ] Invariant cache hit.
[2024-05-25 14:08:17] [INFO ] Implicit Places using invariants in 554 ms returned []
[2024-05-25 14:08:17] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:08:17] [INFO ] Invariant cache hit.
[2024-05-25 14:08:17] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:08:20] [INFO ] Implicit Places using invariants and state equation in 2951 ms returned []
Implicit Place search using SMT with State Equation took 3510 ms to find 0 implicit places.
[2024-05-25 14:08:20] [INFO ] Redundant transitions in 233 ms returned []
[2024-05-25 14:08:20] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:08:20] [INFO ] Invariant cache hit.
[2024-05-25 14:08:21] [INFO ] Dead Transitions using invariants and state equation in 1289 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5192 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m008-UpperBounds-01 in 26689 ms.
Starting property specific reduction for BugTracking-PT-q8m008-UpperBounds-02
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:08:21] [INFO ] Computed 8 invariants in 11 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
[2024-05-25 14:08:21] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:08:21] [INFO ] Computed 8 invariants in 12 ms
[2024-05-25 14:08:21] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 14:08:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:08:22] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2024-05-25 14:08:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:08:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:08:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:08:22] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2024-05-25 14:08:22] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:08:23] [INFO ] [Nat]Added 283 Read/Feed constraints in 164 ms returned sat
[2024-05-25 14:08:23] [INFO ] Deduced a trap composed of 76 places in 393 ms of which 1 ms to minimize.
[2024-05-25 14:08:24] [INFO ] Deduced a trap composed of 83 places in 441 ms of which 1 ms to minimize.
[2024-05-25 14:08:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1163 ms
[2024-05-25 14:08:24] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 313 ms.
[2024-05-25 14:08:25] [INFO ] Added : 4 causal constraints over 1 iterations in 708 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 52 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:08:25] [INFO ] Computed 8 invariants in 22 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3790 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2166 ms. (steps per millisecond=461 ) properties (out of 1) seen :1
[2024-05-25 14:08:31] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:08:31] [INFO ] Computed 8 invariants in 22 ms
[2024-05-25 14:08:31] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:08:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:08:32] [INFO ] [Real]Absence check using state equation in 690 ms returned sat
[2024-05-25 14:08:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:08:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:08:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:08:32] [INFO ] [Nat]Absence check using state equation in 643 ms returned sat
[2024-05-25 14:08:32] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:08:33] [INFO ] [Nat]Added 283 Read/Feed constraints in 193 ms returned sat
[2024-05-25 14:08:33] [INFO ] Deduced a trap composed of 76 places in 476 ms of which 1 ms to minimize.
[2024-05-25 14:08:34] [INFO ] Deduced a trap composed of 83 places in 459 ms of which 0 ms to minimize.
[2024-05-25 14:08:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1224 ms
[2024-05-25 14:08:34] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 270 ms.
[2024-05-25 14:08:34] [INFO ] Added : 4 causal constraints over 1 iterations in 697 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 62 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 59 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:08:35] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:08:35] [INFO ] Invariant cache hit.
[2024-05-25 14:08:35] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-25 14:08:35] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:08:35] [INFO ] Invariant cache hit.
[2024-05-25 14:08:36] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:08:38] [INFO ] Implicit Places using invariants and state equation in 2782 ms returned []
Implicit Place search using SMT with State Equation took 3167 ms to find 0 implicit places.
[2024-05-25 14:08:38] [INFO ] Redundant transitions in 147 ms returned []
[2024-05-25 14:08:38] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:08:38] [INFO ] Invariant cache hit.
[2024-05-25 14:08:39] [INFO ] Dead Transitions using invariants and state equation in 1075 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4461 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m008-UpperBounds-02 in 18028 ms.
Starting property specific reduction for BugTracking-PT-q8m008-UpperBounds-03
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:08:39] [INFO ] Computed 8 invariants in 23 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
[2024-05-25 14:08:39] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:08:39] [INFO ] Computed 8 invariants in 16 ms
[2024-05-25 14:08:39] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 14:08:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:08:40] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
[2024-05-25 14:08:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:08:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 14:08:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:08:41] [INFO ] [Nat]Absence check using state equation in 537 ms returned sat
[2024-05-25 14:08:41] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:08:41] [INFO ] [Nat]Added 283 Read/Feed constraints in 205 ms returned sat
[2024-05-25 14:08:41] [INFO ] Deduced a trap composed of 48 places in 448 ms of which 0 ms to minimize.
[2024-05-25 14:08:42] [INFO ] Deduced a trap composed of 20 places in 483 ms of which 0 ms to minimize.
[2024-05-25 14:08:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1293 ms
[2024-05-25 14:08:42] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 337 ms.
[2024-05-25 14:08:43] [INFO ] Added : 4 causal constraints over 1 iterations in 776 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 92 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:08:43] [INFO ] Computed 8 invariants in 22 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4214 ms. (steps per millisecond=237 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1944 ms. (steps per millisecond=514 ) properties (out of 1) seen :0
[2024-05-25 14:08:49] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:08:49] [INFO ] Computed 8 invariants in 19 ms
[2024-05-25 14:08:49] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:08:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:08:50] [INFO ] [Real]Absence check using state equation in 577 ms returned sat
[2024-05-25 14:08:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:08:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 14:08:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:08:51] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2024-05-25 14:08:51] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:08:51] [INFO ] [Nat]Added 283 Read/Feed constraints in 257 ms returned sat
[2024-05-25 14:08:52] [INFO ] Deduced a trap composed of 48 places in 461 ms of which 0 ms to minimize.
[2024-05-25 14:08:52] [INFO ] Deduced a trap composed of 20 places in 473 ms of which 0 ms to minimize.
[2024-05-25 14:08:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1276 ms
[2024-05-25 14:08:53] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 300 ms.
[2024-05-25 14:08:53] [INFO ] Added : 4 causal constraints over 1 iterations in 749 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 91 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 87 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:08:53] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:08:53] [INFO ] Invariant cache hit.
[2024-05-25 14:08:54] [INFO ] Implicit Places using invariants in 541 ms returned []
[2024-05-25 14:08:54] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:08:54] [INFO ] Invariant cache hit.
[2024-05-25 14:08:55] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:08:57] [INFO ] Implicit Places using invariants and state equation in 3055 ms returned []
Implicit Place search using SMT with State Equation took 3601 ms to find 0 implicit places.
[2024-05-25 14:08:57] [INFO ] Redundant transitions in 161 ms returned []
[2024-05-25 14:08:57] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:08:57] [INFO ] Invariant cache hit.
[2024-05-25 14:08:58] [INFO ] Dead Transitions using invariants and state equation in 1235 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5116 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m008-UpperBounds-03 in 19225 ms.
Starting property specific reduction for BugTracking-PT-q8m008-UpperBounds-04
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:08:58] [INFO ] Computed 8 invariants in 9 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
[2024-05-25 14:08:58] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:08:58] [INFO ] Computed 8 invariants in 22 ms
[2024-05-25 14:08:59] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:08:59] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2024-05-25 14:08:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:08:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 14:08:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:09:00] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2024-05-25 14:09:00] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:09:00] [INFO ] [Nat]Added 283 Read/Feed constraints in 149 ms returned sat
[2024-05-25 14:09:01] [INFO ] Deduced a trap composed of 56 places in 768 ms of which 1 ms to minimize.
[2024-05-25 14:09:01] [INFO ] Deduced a trap composed of 15 places in 427 ms of which 0 ms to minimize.
[2024-05-25 14:09:02] [INFO ] Deduced a trap composed of 52 places in 331 ms of which 2 ms to minimize.
[2024-05-25 14:09:02] [INFO ] Deduced a trap composed of 48 places in 364 ms of which 1 ms to minimize.
[2024-05-25 14:09:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2499 ms
[2024-05-25 14:09:03] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 303 ms.
[2024-05-25 14:09:03] [INFO ] Added : 4 causal constraints over 1 iterations in 752 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 71 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:09:03] [INFO ] Computed 8 invariants in 28 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 5883 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1818 ms. (steps per millisecond=550 ) properties (out of 1) seen :0
[2024-05-25 14:09:11] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:09:11] [INFO ] Computed 8 invariants in 21 ms
[2024-05-25 14:09:11] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:09:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:09:12] [INFO ] [Real]Absence check using state equation in 558 ms returned sat
[2024-05-25 14:09:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:09:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:09:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:09:12] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2024-05-25 14:09:12] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:09:13] [INFO ] [Nat]Added 283 Read/Feed constraints in 138 ms returned sat
[2024-05-25 14:09:13] [INFO ] Deduced a trap composed of 56 places in 599 ms of which 0 ms to minimize.
[2024-05-25 14:09:14] [INFO ] Deduced a trap composed of 15 places in 465 ms of which 2 ms to minimize.
[2024-05-25 14:09:14] [INFO ] Deduced a trap composed of 52 places in 406 ms of which 1 ms to minimize.
[2024-05-25 14:09:15] [INFO ] Deduced a trap composed of 48 places in 373 ms of which 1 ms to minimize.
[2024-05-25 14:09:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2489 ms
[2024-05-25 14:09:15] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 354 ms.
[2024-05-25 14:09:16] [INFO ] Added : 4 causal constraints over 1 iterations in 830 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 103 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 74 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:09:16] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:09:16] [INFO ] Invariant cache hit.
[2024-05-25 14:09:17] [INFO ] Implicit Places using invariants in 546 ms returned []
[2024-05-25 14:09:17] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:09:17] [INFO ] Invariant cache hit.
[2024-05-25 14:09:18] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:09:20] [INFO ] Implicit Places using invariants and state equation in 3205 ms returned []
Implicit Place search using SMT with State Equation took 3753 ms to find 0 implicit places.
[2024-05-25 14:09:20] [INFO ] Redundant transitions in 178 ms returned []
[2024-05-25 14:09:20] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:09:20] [INFO ] Invariant cache hit.
[2024-05-25 14:09:22] [INFO ] Dead Transitions using invariants and state equation in 1520 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5544 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m008-UpperBounds-04 in 23412 ms.
Starting property specific reduction for BugTracking-PT-q8m008-UpperBounds-05
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:09:22] [INFO ] Computed 8 invariants in 10 ms
Incomplete random walk after 10003 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2024-05-25 14:09:22] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:09:22] [INFO ] Computed 8 invariants in 14 ms
[2024-05-25 14:09:22] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:09:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:09:23] [INFO ] [Real]Absence check using state equation in 619 ms returned sat
[2024-05-25 14:09:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:09:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:09:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:09:23] [INFO ] [Nat]Absence check using state equation in 687 ms returned sat
[2024-05-25 14:09:23] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:09:24] [INFO ] [Nat]Added 283 Read/Feed constraints in 267 ms returned sat
[2024-05-25 14:09:24] [INFO ] Deduced a trap composed of 42 places in 449 ms of which 1 ms to minimize.
[2024-05-25 14:09:25] [INFO ] Deduced a trap composed of 26 places in 235 ms of which 0 ms to minimize.
[2024-05-25 14:09:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1039 ms
[2024-05-25 14:09:25] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 296 ms.
[2024-05-25 14:09:26] [INFO ] Added : 5 causal constraints over 1 iterations in 808 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 65 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:09:26] [INFO ] Computed 8 invariants in 22 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 4198 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3 resets, run finished after 1895 ms. (steps per millisecond=527 ) properties (out of 1) seen :0
[2024-05-25 14:09:32] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:09:32] [INFO ] Computed 8 invariants in 24 ms
[2024-05-25 14:09:32] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:09:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:09:33] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2024-05-25 14:09:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:09:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:09:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:09:34] [INFO ] [Nat]Absence check using state equation in 699 ms returned sat
[2024-05-25 14:09:34] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:09:34] [INFO ] [Nat]Added 283 Read/Feed constraints in 239 ms returned sat
[2024-05-25 14:09:34] [INFO ] Deduced a trap composed of 42 places in 446 ms of which 1 ms to minimize.
[2024-05-25 14:09:35] [INFO ] Deduced a trap composed of 26 places in 238 ms of which 1 ms to minimize.
[2024-05-25 14:09:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 981 ms
[2024-05-25 14:09:35] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 302 ms.
[2024-05-25 14:09:36] [INFO ] Added : 5 causal constraints over 1 iterations in 799 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 61 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 63 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:09:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:09:36] [INFO ] Invariant cache hit.
[2024-05-25 14:09:37] [INFO ] Implicit Places using invariants in 561 ms returned []
[2024-05-25 14:09:37] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:09:37] [INFO ] Invariant cache hit.
[2024-05-25 14:09:37] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:09:40] [INFO ] Implicit Places using invariants and state equation in 3331 ms returned []
Implicit Place search using SMT with State Equation took 3893 ms to find 0 implicit places.
[2024-05-25 14:09:40] [INFO ] Redundant transitions in 182 ms returned []
[2024-05-25 14:09:40] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:09:40] [INFO ] Invariant cache hit.
[2024-05-25 14:09:42] [INFO ] Dead Transitions using invariants and state equation in 1727 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5882 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m008-UpperBounds-05 in 19987 ms.
Starting property specific reduction for BugTracking-PT-q8m008-UpperBounds-06
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:09:42] [INFO ] Computed 8 invariants in 22 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
[2024-05-25 14:09:42] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:09:42] [INFO ] Computed 8 invariants in 10 ms
[2024-05-25 14:09:42] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2024-05-25 14:09:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:09:43] [INFO ] [Real]Absence check using state equation in 554 ms returned sat
[2024-05-25 14:09:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:09:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:09:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:09:43] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2024-05-25 14:09:43] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:09:43] [INFO ] [Nat]Added 283 Read/Feed constraints in 153 ms returned sat
[2024-05-25 14:09:44] [INFO ] Deduced a trap composed of 91 places in 461 ms of which 0 ms to minimize.
[2024-05-25 14:09:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 699 ms
[2024-05-25 14:09:44] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 324 ms.
[2024-05-25 14:09:45] [INFO ] Deduced a trap composed of 14 places in 458 ms of which 1 ms to minimize.
[2024-05-25 14:09:46] [INFO ] Deduced a trap composed of 57 places in 450 ms of which 0 ms to minimize.
[2024-05-25 14:09:46] [INFO ] Deduced a trap composed of 62 places in 328 ms of which 1 ms to minimize.
[2024-05-25 14:09:47] [INFO ] Deduced a trap composed of 25 places in 321 ms of which 0 ms to minimize.
[2024-05-25 14:09:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2175 ms
[2024-05-25 14:09:47] [INFO ] Added : 4 causal constraints over 1 iterations in 3063 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 53 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:09:47] [INFO ] Computed 8 invariants in 23 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4510 ms. (steps per millisecond=221 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2102 ms. (steps per millisecond=475 ) properties (out of 1) seen :0
[2024-05-25 14:09:54] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:09:54] [INFO ] Computed 8 invariants in 24 ms
[2024-05-25 14:09:54] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:09:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:09:55] [INFO ] [Real]Absence check using state equation in 679 ms returned sat
[2024-05-25 14:09:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:09:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:09:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:09:56] [INFO ] [Nat]Absence check using state equation in 612 ms returned sat
[2024-05-25 14:09:56] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:09:56] [INFO ] [Nat]Added 283 Read/Feed constraints in 147 ms returned sat
[2024-05-25 14:09:56] [INFO ] Deduced a trap composed of 91 places in 509 ms of which 1 ms to minimize.
[2024-05-25 14:09:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 722 ms
[2024-05-25 14:09:57] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 287 ms.
[2024-05-25 14:09:58] [INFO ] Deduced a trap composed of 14 places in 468 ms of which 0 ms to minimize.
[2024-05-25 14:09:58] [INFO ] Deduced a trap composed of 57 places in 422 ms of which 0 ms to minimize.
[2024-05-25 14:09:59] [INFO ] Deduced a trap composed of 62 places in 379 ms of which 0 ms to minimize.
[2024-05-25 14:09:59] [INFO ] Deduced a trap composed of 25 places in 347 ms of which 1 ms to minimize.
[2024-05-25 14:09:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2270 ms
[2024-05-25 14:10:00] [INFO ] Added : 4 causal constraints over 1 iterations in 3062 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 63 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 63 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:10:00] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:10:00] [INFO ] Invariant cache hit.
[2024-05-25 14:10:00] [INFO ] Implicit Places using invariants in 549 ms returned []
[2024-05-25 14:10:00] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:10:00] [INFO ] Invariant cache hit.
[2024-05-25 14:10:01] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:10:03] [INFO ] Implicit Places using invariants and state equation in 2771 ms returned []
Implicit Place search using SMT with State Equation took 3334 ms to find 0 implicit places.
[2024-05-25 14:10:03] [INFO ] Redundant transitions in 146 ms returned []
[2024-05-25 14:10:03] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:10:03] [INFO ] Invariant cache hit.
[2024-05-25 14:10:05] [INFO ] Dead Transitions using invariants and state equation in 1355 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4918 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m008-UpperBounds-06 in 22970 ms.
Starting property specific reduction for BugTracking-PT-q8m008-UpperBounds-08
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:10:05] [INFO ] Computed 8 invariants in 8 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
[2024-05-25 14:10:05] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:10:05] [INFO ] Computed 8 invariants in 18 ms
[2024-05-25 14:10:05] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:10:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:10:05] [INFO ] [Real]Absence check using state equation in 536 ms returned sat
[2024-05-25 14:10:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:10:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 14:10:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:10:06] [INFO ] [Nat]Absence check using state equation in 563 ms returned sat
[2024-05-25 14:10:06] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:10:06] [INFO ] [Nat]Added 283 Read/Feed constraints in 349 ms returned sat
[2024-05-25 14:10:07] [INFO ] Deduced a trap composed of 16 places in 406 ms of which 0 ms to minimize.
[2024-05-25 14:10:08] [INFO ] Deduced a trap composed of 59 places in 380 ms of which 1 ms to minimize.
[2024-05-25 14:10:08] [INFO ] Deduced a trap composed of 33 places in 362 ms of which 1 ms to minimize.
[2024-05-25 14:10:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1582 ms
[2024-05-25 14:10:08] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 323 ms.
[2024-05-25 14:10:09] [INFO ] Added : 10 causal constraints over 3 iterations in 1124 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 75 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:10:10] [INFO ] Computed 8 invariants in 22 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3996 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2035 ms. (steps per millisecond=491 ) properties (out of 1) seen :0
[2024-05-25 14:10:16] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:10:16] [INFO ] Computed 8 invariants in 23 ms
[2024-05-25 14:10:16] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:10:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:10:16] [INFO ] [Real]Absence check using state equation in 685 ms returned sat
[2024-05-25 14:10:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:10:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:10:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:10:17] [INFO ] [Nat]Absence check using state equation in 631 ms returned sat
[2024-05-25 14:10:17] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:10:17] [INFO ] [Nat]Added 283 Read/Feed constraints in 283 ms returned sat
[2024-05-25 14:10:18] [INFO ] Deduced a trap composed of 16 places in 320 ms of which 1 ms to minimize.
[2024-05-25 14:10:18] [INFO ] Deduced a trap composed of 59 places in 332 ms of which 0 ms to minimize.
[2024-05-25 14:10:19] [INFO ] Deduced a trap composed of 33 places in 345 ms of which 0 ms to minimize.
[2024-05-25 14:10:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1387 ms
[2024-05-25 14:10:19] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 229 ms.
[2024-05-25 14:10:20] [INFO ] Added : 10 causal constraints over 3 iterations in 940 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 63 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 60 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:10:20] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:10:20] [INFO ] Invariant cache hit.
[2024-05-25 14:10:21] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-05-25 14:10:21] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:10:21] [INFO ] Invariant cache hit.
[2024-05-25 14:10:21] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:10:23] [INFO ] Implicit Places using invariants and state equation in 2783 ms returned []
Implicit Place search using SMT with State Equation took 3279 ms to find 0 implicit places.
[2024-05-25 14:10:24] [INFO ] Redundant transitions in 108 ms returned []
[2024-05-25 14:10:24] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:10:24] [INFO ] Invariant cache hit.
[2024-05-25 14:10:25] [INFO ] Dead Transitions using invariants and state equation in 1260 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4723 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m008-UpperBounds-08 in 20106 ms.
Starting property specific reduction for BugTracking-PT-q8m008-UpperBounds-09
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:10:25] [INFO ] Computed 8 invariants in 10 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
[2024-05-25 14:10:25] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:10:25] [INFO ] Computed 8 invariants in 19 ms
[2024-05-25 14:10:25] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-05-25 14:10:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:10:26] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2024-05-25 14:10:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:10:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 14:10:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:10:26] [INFO ] [Nat]Absence check using state equation in 595 ms returned sat
[2024-05-25 14:10:26] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:10:27] [INFO ] [Nat]Added 283 Read/Feed constraints in 171 ms returned sat
[2024-05-25 14:10:27] [INFO ] Deduced a trap composed of 22 places in 313 ms of which 1 ms to minimize.
[2024-05-25 14:10:27] [INFO ] Deduced a trap composed of 23 places in 269 ms of which 0 ms to minimize.
[2024-05-25 14:10:28] [INFO ] Deduced a trap composed of 68 places in 292 ms of which 1 ms to minimize.
[2024-05-25 14:10:28] [INFO ] Deduced a trap composed of 57 places in 292 ms of which 0 ms to minimize.
[2024-05-25 14:10:28] [INFO ] Deduced a trap composed of 57 places in 278 ms of which 0 ms to minimize.
[2024-05-25 14:10:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1944 ms
[2024-05-25 14:10:29] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 280 ms.
[2024-05-25 14:10:29] [INFO ] Added : 3 causal constraints over 1 iterations in 623 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 64 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:10:29] [INFO ] Computed 8 invariants in 15 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 4076 ms. (steps per millisecond=245 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1966 ms. (steps per millisecond=508 ) properties (out of 1) seen :0
[2024-05-25 14:10:35] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:10:35] [INFO ] Computed 8 invariants in 9 ms
[2024-05-25 14:10:35] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 14:10:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:10:36] [INFO ] [Real]Absence check using state equation in 535 ms returned sat
[2024-05-25 14:10:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:10:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:10:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:10:37] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2024-05-25 14:10:37] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:10:37] [INFO ] [Nat]Added 283 Read/Feed constraints in 193 ms returned sat
[2024-05-25 14:10:37] [INFO ] Deduced a trap composed of 22 places in 298 ms of which 1 ms to minimize.
[2024-05-25 14:10:38] [INFO ] Deduced a trap composed of 23 places in 267 ms of which 0 ms to minimize.
[2024-05-25 14:10:38] [INFO ] Deduced a trap composed of 68 places in 319 ms of which 1 ms to minimize.
[2024-05-25 14:10:38] [INFO ] Deduced a trap composed of 57 places in 276 ms of which 1 ms to minimize.
[2024-05-25 14:10:39] [INFO ] Deduced a trap composed of 57 places in 280 ms of which 0 ms to minimize.
[2024-05-25 14:10:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2056 ms
[2024-05-25 14:10:39] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 329 ms.
[2024-05-25 14:10:40] [INFO ] Added : 3 causal constraints over 1 iterations in 791 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 67 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 60 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:10:40] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:10:40] [INFO ] Invariant cache hit.
[2024-05-25 14:10:41] [INFO ] Implicit Places using invariants in 496 ms returned []
[2024-05-25 14:10:41] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:10:41] [INFO ] Invariant cache hit.
[2024-05-25 14:10:41] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:10:44] [INFO ] Implicit Places using invariants and state equation in 3167 ms returned []
Implicit Place search using SMT with State Equation took 3665 ms to find 0 implicit places.
[2024-05-25 14:10:44] [INFO ] Redundant transitions in 132 ms returned []
[2024-05-25 14:10:44] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:10:44] [INFO ] Invariant cache hit.
[2024-05-25 14:10:45] [INFO ] Dead Transitions using invariants and state equation in 1237 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5103 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m008-UpperBounds-09 in 20218 ms.
Starting property specific reduction for BugTracking-PT-q8m008-UpperBounds-13
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:10:45] [INFO ] Computed 8 invariants in 10 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
[2024-05-25 14:10:45] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:10:45] [INFO ] Computed 8 invariants in 14 ms
[2024-05-25 14:10:45] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:10:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:10:46] [INFO ] [Real]Absence check using state equation in 618 ms returned sat
[2024-05-25 14:10:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:10:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 14:10:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:10:47] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2024-05-25 14:10:47] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:10:47] [INFO ] [Nat]Added 283 Read/Feed constraints in 320 ms returned sat
[2024-05-25 14:10:47] [INFO ] Deduced a trap composed of 43 places in 349 ms of which 1 ms to minimize.
[2024-05-25 14:10:48] [INFO ] Deduced a trap composed of 18 places in 277 ms of which 0 ms to minimize.
[2024-05-25 14:10:48] [INFO ] Deduced a trap composed of 59 places in 277 ms of which 0 ms to minimize.
[2024-05-25 14:10:48] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 0 ms to minimize.
[2024-05-25 14:10:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1552 ms
[2024-05-25 14:10:49] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 295 ms.
[2024-05-25 14:10:49] [INFO ] Added : 9 causal constraints over 3 iterations in 1047 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 63 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:10:50] [INFO ] Computed 8 invariants in 23 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5343 ms. (steps per millisecond=187 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2005 ms. (steps per millisecond=498 ) properties (out of 1) seen :0
[2024-05-25 14:10:57] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:10:57] [INFO ] Computed 8 invariants in 23 ms
[2024-05-25 14:10:57] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:10:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:10:58] [INFO ] [Real]Absence check using state equation in 627 ms returned sat
[2024-05-25 14:10:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:10:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 14:10:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:10:58] [INFO ] [Nat]Absence check using state equation in 516 ms returned sat
[2024-05-25 14:10:58] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:10:59] [INFO ] [Nat]Added 283 Read/Feed constraints in 257 ms returned sat
[2024-05-25 14:10:59] [INFO ] Deduced a trap composed of 43 places in 403 ms of which 0 ms to minimize.
[2024-05-25 14:11:00] [INFO ] Deduced a trap composed of 18 places in 261 ms of which 0 ms to minimize.
[2024-05-25 14:11:00] [INFO ] Deduced a trap composed of 59 places in 316 ms of which 1 ms to minimize.
[2024-05-25 14:11:00] [INFO ] Deduced a trap composed of 24 places in 233 ms of which 0 ms to minimize.
[2024-05-25 14:11:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1654 ms
[2024-05-25 14:11:01] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 287 ms.
[2024-05-25 14:11:01] [INFO ] Added : 9 causal constraints over 3 iterations in 980 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 81 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 73 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:11:02] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:11:02] [INFO ] Invariant cache hit.
[2024-05-25 14:11:02] [INFO ] Implicit Places using invariants in 504 ms returned []
[2024-05-25 14:11:02] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:11:02] [INFO ] Invariant cache hit.
[2024-05-25 14:11:03] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:11:05] [INFO ] Implicit Places using invariants and state equation in 2894 ms returned []
Implicit Place search using SMT with State Equation took 3413 ms to find 0 implicit places.
[2024-05-25 14:11:05] [INFO ] Redundant transitions in 106 ms returned []
[2024-05-25 14:11:05] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:11:05] [INFO ] Invariant cache hit.
[2024-05-25 14:11:06] [INFO ] Dead Transitions using invariants and state equation in 1191 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4795 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m008-UpperBounds-13 in 21321 ms.
Starting property specific reduction for BugTracking-PT-q8m008-UpperBounds-14
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:11:06] [INFO ] Computed 8 invariants in 9 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
[2024-05-25 14:11:06] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:11:07] [INFO ] Computed 8 invariants in 19 ms
[2024-05-25 14:11:07] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 14:11:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:11:07] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2024-05-25 14:11:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:11:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:11:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:11:08] [INFO ] [Nat]Absence check using state equation in 596 ms returned sat
[2024-05-25 14:11:08] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:11:08] [INFO ] [Nat]Added 283 Read/Feed constraints in 425 ms returned sat
[2024-05-25 14:11:09] [INFO ] Deduced a trap composed of 52 places in 397 ms of which 0 ms to minimize.
[2024-05-25 14:11:09] [INFO ] Deduced a trap composed of 52 places in 366 ms of which 0 ms to minimize.
[2024-05-25 14:11:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1085 ms
[2024-05-25 14:11:10] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 334 ms.
[2024-05-25 14:11:11] [INFO ] Deduced a trap composed of 103 places in 506 ms of which 1 ms to minimize.
[2024-05-25 14:11:12] [INFO ] Deduced a trap composed of 96 places in 494 ms of which 1 ms to minimize.
[2024-05-25 14:11:12] [INFO ] Deduced a trap composed of 91 places in 475 ms of which 1 ms to minimize.
[2024-05-25 14:11:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 64 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:11:12] [INFO ] Computed 8 invariants in 19 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 4333 ms. (steps per millisecond=230 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 1827 ms. (steps per millisecond=547 ) properties (out of 1) seen :0
[2024-05-25 14:11:18] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:11:18] [INFO ] Computed 8 invariants in 23 ms
[2024-05-25 14:11:19] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:11:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:11:19] [INFO ] [Real]Absence check using state equation in 613 ms returned sat
[2024-05-25 14:11:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:11:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 14:11:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:11:20] [INFO ] [Nat]Absence check using state equation in 531 ms returned sat
[2024-05-25 14:11:20] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:11:20] [INFO ] [Nat]Added 283 Read/Feed constraints in 385 ms returned sat
[2024-05-25 14:11:21] [INFO ] Deduced a trap composed of 52 places in 407 ms of which 1 ms to minimize.
[2024-05-25 14:11:21] [INFO ] Deduced a trap composed of 52 places in 388 ms of which 1 ms to minimize.
[2024-05-25 14:11:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1103 ms
[2024-05-25 14:11:22] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 294 ms.
[2024-05-25 14:11:23] [INFO ] Deduced a trap composed of 103 places in 515 ms of which 0 ms to minimize.
[2024-05-25 14:11:24] [INFO ] Deduced a trap composed of 96 places in 522 ms of which 0 ms to minimize.
[2024-05-25 14:11:24] [INFO ] Deduced a trap composed of 91 places in 550 ms of which 0 ms to minimize.
[2024-05-25 14:11:25] [INFO ] Deduced a trap composed of 91 places in 436 ms of which 1 ms to minimize.
[2024-05-25 14:11:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2883 ms
[2024-05-25 14:11:25] [INFO ] Added : 7 causal constraints over 2 iterations in 4008 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 71 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 61 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:11:26] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:11:26] [INFO ] Invariant cache hit.
[2024-05-25 14:11:26] [INFO ] Implicit Places using invariants in 491 ms returned []
[2024-05-25 14:11:26] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:11:26] [INFO ] Invariant cache hit.
[2024-05-25 14:11:27] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:11:29] [INFO ] Implicit Places using invariants and state equation in 2952 ms returned []
Implicit Place search using SMT with State Equation took 3457 ms to find 0 implicit places.
[2024-05-25 14:11:29] [INFO ] Redundant transitions in 108 ms returned []
[2024-05-25 14:11:29] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:11:29] [INFO ] Invariant cache hit.
[2024-05-25 14:11:30] [INFO ] Dead Transitions using invariants and state equation in 1178 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4821 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m008-UpperBounds-14 in 24035 ms.
[2024-05-25 14:11:31] [INFO ] Flatten gal took : 371 ms
[2024-05-25 14:11:31] [INFO ] Applying decomposition
[2024-05-25 14:11:31] [INFO ] Flatten gal took : 243 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/graph15826913737330861930.txt' '-o' '/tmp/graph15826913737330861930.bin' '-w' '/tmp/graph15826913737330861930.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15826913737330861930.bin' '-l' '-1' '-v' '-w' '/tmp/graph15826913737330861930.weights' '-q' '0' '-e' '0.001'
[2024-05-25 14:11:32] [INFO ] Decomposing Gal with order
[2024-05-25 14:11:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 14:11:33] [INFO ] Removed a total of 424 redundant transitions.
[2024-05-25 14:11:33] [INFO ] Flatten gal took : 486 ms
[2024-05-25 14:11:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 36 ms.
[2024-05-25 14:11:33] [INFO ] Time to serialize gal into /tmp/UpperBounds11678598181616409153.gal : 48 ms
[2024-05-25 14:11:33] [INFO ] Time to serialize properties into /tmp/UpperBounds12349913970338099882.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/UpperBounds11678598181616409153.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12349913970338099882.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/UpperBounds12349913970338099882.prop.
Detected timeout of ITS tools.
[2024-05-25 14:34:00] [INFO ] Flatten gal took : 4646 ms
[2024-05-25 14:34:00] [INFO ] Time to serialize gal into /tmp/UpperBounds7977647638273316122.gal : 65 ms
[2024-05-25 14:34:00] [INFO ] Time to serialize properties into /tmp/UpperBounds3296466854739694593.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/UpperBounds7977647638273316122.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3296466854739694593.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds3296466854739694593.prop.
Detected timeout of ITS tools.
[2024-05-25 14:56:20] [INFO ] Flatten gal took : 647 ms
[2024-05-25 14:56:20] [INFO ] Input system was already deterministic with 3871 transitions.
[2024-05-25 14:56:20] [INFO ] Transformed 269 places.
[2024-05-25 14:56:20] [INFO ] Transformed 3871 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 14:56:21] [INFO ] Time to serialize gal into /tmp/UpperBounds16919501008452754797.gal : 35 ms
[2024-05-25 14:56:21] [INFO ] Time to serialize properties into /tmp/UpperBounds14151778409014393523.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/UpperBounds16919501008452754797.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14151778409014393523.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...351
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds14151778409014393523.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 8323536 kB
After kill :
MemTotal: 16393340 kB
MemFree: 15648596 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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="BugTracking-PT-q8m008"
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 BugTracking-PT-q8m008, 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 r065-tajo-171620414700251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m008.tgz
mv BugTracking-PT-q8m008 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 ;