Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r252-tall-174915605600207.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is TokenRing-PT-005, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r252-tall-174915605600207
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 33K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 203K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 168K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 670K May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 27K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 47K May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 147K May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 97K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 550K May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 171K May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 678K May 29 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K May 29 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 119K May 29 14:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1749200291069

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=TokenRing-PT-005
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-06 08:58:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-06 08:58:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 08:58:12] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2025-06-06 08:58:12] [INFO ] Transformed 36 places.
[2025-06-06 08:58:12] [INFO ] Transformed 156 transitions.
[2025-06-06 08:58:12] [INFO ] Found NUPN structural information;
[2025-06-06 08:58:12] [INFO ] Parsed PT model containing 36 places and 156 transitions and 624 arcs in 167 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 36/36 places, 156/156 transitions.
Applied a total of 0 rules in 8 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 36 cols
[2025-06-06 08:58:12] [INFO ] Computed 6 invariants in 24 ms
[2025-06-06 08:58:12] [INFO ] Implicit Places using invariants in 229 ms returned []
[2025-06-06 08:58:12] [INFO ] Invariant cache hit.
[2025-06-06 08:58:12] [INFO ] State equation strengthened by 130 read => feed constraints.
[2025-06-06 08:58:13] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 151 sub problems to find dead transitions.
[2025-06-06 08:58:13] [INFO ] Invariant cache hit.
[2025-06-06 08:58:13] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-06-06 08:58:13] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 14 ms to minimize.
[2025-06-06 08:58:13] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2025-06-06 08:58:13] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2025-06-06 08:58:13] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2025-06-06 08:58:13] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 2 ms to minimize.
[2025-06-06 08:58:13] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2025-06-06 08:58:13] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2025-06-06 08:58:13] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2025-06-06 08:58:13] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2025-06-06 08:58:13] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2025-06-06 08:58:13] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2025-06-06 08:58:13] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2025-06-06 08:58:13] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2025-06-06 08:58:14] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2025-06-06 08:58:14] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2025-06-06 08:58:14] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2025-06-06 08:58:14] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2025-06-06 08:58:14] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2025-06-06 08:58:14] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2025-06-06 08:58:14] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-06-06 08:58:14] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2025-06-06 08:58:14] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2025-06-06 08:58:14] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2025-06-06 08:58:14] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2025-06-06 08:58:14] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2025-06-06 08:58:14] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2025-06-06 08:58:14] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2025-06-06 08:58:14] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2025-06-06 08:58:14] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 10 ms to minimize.
[2025-06-06 08:58:14] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2025-06-06 08:58:14] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2025-06-06 08:58:14] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2025-06-06 08:58:14] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2025-06-06 08:58:14] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2025-06-06 08:58:14] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2025-06-06 08:58:14] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2025-06-06 08:58:15] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2025-06-06 08:58:15] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2025-06-06 08:58:15] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2025-06-06 08:58:15] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-06-06 08:58:15] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2025-06-06 08:58:15] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2025-06-06 08:58:15] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2025-06-06 08:58:15] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2025-06-06 08:58:15] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2025-06-06 08:58:15] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2025-06-06 08:58:15] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2025-06-06 08:58:15] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2025-06-06 08:58:15] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2025-06-06 08:58:15] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2025-06-06 08:58:15] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2025-06-06 08:58:15] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2025-06-06 08:58:15] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2025-06-06 08:58:15] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2025-06-06 08:58:15] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2025-06-06 08:58:16] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2025-06-06 08:58:16] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 8 ms to minimize.
[2025-06-06 08:58:16] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2025-06-06 08:58:16] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2025-06-06 08:58:16] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-06-06 08:58:16] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2025-06-06 08:58:16] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2025-06-06 08:58:16] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2025-06-06 08:58:16] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2025-06-06 08:58:16] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2025-06-06 08:58:16] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2025-06-06 08:58:16] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2025-06-06 08:58:16] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2025-06-06 08:58:16] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2025-06-06 08:58:16] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2025-06-06 08:58:16] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2025-06-06 08:58:16] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2025-06-06 08:58:16] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2025-06-06 08:58:16] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2025-06-06 08:58:16] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2025-06-06 08:58:16] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2025-06-06 08:58:17] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2025-06-06 08:58:17] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2025-06-06 08:58:17] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2025-06-06 08:58:17] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-06-06 08:58:17] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2025-06-06 08:58:17] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2025-06-06 08:58:17] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2025-06-06 08:58:17] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2025-06-06 08:58:17] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2025-06-06 08:58:17] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2025-06-06 08:58:17] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2025-06-06 08:58:17] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2025-06-06 08:58:17] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2025-06-06 08:58:17] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2025-06-06 08:58:17] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2025-06-06 08:58:17] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2025-06-06 08:58:17] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2025-06-06 08:58:17] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2025-06-06 08:58:17] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2025-06-06 08:58:17] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2025-06-06 08:58:17] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2025-06-06 08:58:17] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2025-06-06 08:58:18] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2025-06-06 08:58:18] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-06-06 08:58:18] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2025-06-06 08:58:18] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2025-06-06 08:58:18] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2025-06-06 08:58:18] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2025-06-06 08:58:18] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2025-06-06 08:58:18] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2025-06-06 08:58:18] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2025-06-06 08:58:18] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2025-06-06 08:58:18] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2025-06-06 08:58:18] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2025-06-06 08:58:19] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2025-06-06 08:58:19] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2025-06-06 08:58:19] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2025-06-06 08:58:19] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2025-06-06 08:58:19] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2025-06-06 08:58:19] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2025-06-06 08:58:19] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2025-06-06 08:58:19] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2025-06-06 08:58:19] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2025-06-06 08:58:19] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-06-06 08:58:19] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2025-06-06 08:58:19] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2025-06-06 08:58:19] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2025-06-06 08:58:19] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2025-06-06 08:58:19] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2025-06-06 08:58:19] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2025-06-06 08:58:19] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2025-06-06 08:58:19] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2025-06-06 08:58:20] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2025-06-06 08:58:20] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2025-06-06 08:58:20] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2025-06-06 08:58:20] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 12/174 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-06-06 08:58:20] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2025-06-06 08:58:20] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2025-06-06 08:58:20] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2025-06-06 08:58:20] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2025-06-06 08:58:20] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2025-06-06 08:58:20] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2025-06-06 08:58:20] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2025-06-06 08:58:20] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2025-06-06 08:58:20] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/36 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-06-06 08:58:21] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2025-06-06 08:58:21] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2025-06-06 08:58:21] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2025-06-06 08:58:21] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2025-06-06 08:58:21] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2025-06-06 08:58:21] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 6/189 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-06-06 08:58:22] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2025-06-06 08:58:22] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2025-06-06 08:58:22] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/36 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-06-06 08:58:22] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2025-06-06 08:58:22] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2025-06-06 08:58:22] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2025-06-06 08:58:22] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2025-06-06 08:58:22] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2025-06-06 08:58:22] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2025-06-06 08:58:22] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2025-06-06 08:58:22] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2025-06-06 08:58:23] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2025-06-06 08:58:23] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2025-06-06 08:58:23] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2025-06-06 08:58:23] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/36 variables, 12/204 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-06-06 08:58:23] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2025-06-06 08:58:23] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2025-06-06 08:58:23] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2025-06-06 08:58:23] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2025-06-06 08:58:23] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2025-06-06 08:58:23] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 2 ms to minimize.
[2025-06-06 08:58:24] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2025-06-06 08:58:24] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2025-06-06 08:58:24] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2025-06-06 08:58:24] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/36 variables, 10/214 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-06-06 08:58:24] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2025-06-06 08:58:24] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2025-06-06 08:58:24] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2025-06-06 08:58:24] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/36 variables, 4/218 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-06-06 08:58:25] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2025-06-06 08:58:25] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/36 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-06-06 08:58:25] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2025-06-06 08:58:26] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2025-06-06 08:58:26] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/36 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-06-06 08:58:26] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2025-06-06 08:58:26] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/36 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/36 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 19 (OVERLAPS) 156/192 variables, 36/261 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/192 variables, 130/391 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/192 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-06-06 08:58:32] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/192 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/192 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 24 (OVERLAPS) 0/192 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 392 constraints, problems are : Problem set: 0 solved, 151 unsolved in 27457 ms.
Refiners :[Domain max(s): 36/36 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 36/36 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 184/184 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 184/226 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-06-06 08:58:40] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2025-06-06 08:58:41] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2025-06-06 08:58:41] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2025-06-06 08:58:41] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2025-06-06 08:58:41] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2025-06-06 08:58:41] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2025-06-06 08:58:41] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 7/233 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-06-06 08:58:41] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2025-06-06 08:58:42] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2025-06-06 08:58:42] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2025-06-06 08:58:42] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2025-06-06 08:58:42] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2025-06-06 08:58:42] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 6/239 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-06-06 08:58:42] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2025-06-06 08:58:42] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2025-06-06 08:58:42] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2025-06-06 08:58:42] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 4/243 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (OVERLAPS) 156/192 variables, 36/279 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 130/409 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 151/560 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-06-06 08:58:48] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 1/561 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-06-06 08:58:50] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 1/562 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 13 (OVERLAPS) 0/192 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 562 constraints, problems are : Problem set: 0 solved, 151 unsolved in 19556 ms.
Refiners :[Domain max(s): 36/36 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 36/36 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 203/203 constraints]
After SMT, in 47138ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 47152ms
Finished structural reductions in LIVENESS mode , in 1 iterations and 47584 ms. Remains : 36/36 places, 156/156 transitions.
Initial state reduction rules removed 5 formulas.
RANDOM walk for 40000 steps (8 resets) in 1560 ms. (25 steps per ms) remains 88/151 properties
BEST_FIRST walk for 4000 steps (8 resets) in 123 ms. (32 steps per ms) remains 86/88 properties
BEST_FIRST walk for 4000 steps (8 resets) in 87 ms. (45 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 65 ms. (60 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 167 ms. (23 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 109 ms. (36 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 77 ms. (51 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 40 ms. (97 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 56 ms. (70 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 46 ms. (85 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 37 ms. (105 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 39 ms. (100 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 37 ms. (105 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 37 ms. (105 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 47 ms. (83 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 50 ms. (78 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 51 ms. (76 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 64 ms. (61 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 60 ms. (65 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 58 ms. (67 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 39 ms. (100 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 63 ms. (62 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 63 ms. (62 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 56 ms. (70 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 48 ms. (81 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 40 ms. (97 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 57 ms. (68 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 48 ms. (81 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 50 ms. (78 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 42 ms. (93 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 61 ms. (64 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 38 ms. (102 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 46 ms. (85 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 47 ms. (83 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 84 ms. (47 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 40 ms. (97 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 33 ms. (117 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 39 ms. (100 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 29 ms. (133 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 33 ms. (117 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 31 ms. (125 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 30 ms. (129 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 33 ms. (117 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 39 ms. (100 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 34 ms. (114 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 33 ms. (117 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 33 ms. (117 steps per ms) remains 86/86 properties
[2025-06-06 08:59:01] [INFO ] Invariant cache hit.
[2025-06-06 08:59:01] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 2/36 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2025-06-06 08:59:02] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2025-06-06 08:59:02] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2025-06-06 08:59:02] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2025-06-06 08:59:02] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2025-06-06 08:59:02] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2025-06-06 08:59:02] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2025-06-06 08:59:02] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2025-06-06 08:59:02] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2025-06-06 08:59:02] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2025-06-06 08:59:02] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2025-06-06 08:59:02] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2025-06-06 08:59:02] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2025-06-06 08:59:02] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2025-06-06 08:59:02] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2025-06-06 08:59:02] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2025-06-06 08:59:02] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2025-06-06 08:59:02] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2025-06-06 08:59:02] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2025-06-06 08:59:02] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2025-06-06 08:59:02] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2025-06-06 08:59:02] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2025-06-06 08:59:02] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2025-06-06 08:59:03] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2025-06-06 08:59:03] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2025-06-06 08:59:03] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2025-06-06 08:59:03] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2025-06-06 08:59:03] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2025-06-06 08:59:03] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2025-06-06 08:59:03] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 2 ms to minimize.
[2025-06-06 08:59:03] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2025-06-06 08:59:03] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2025-06-06 08:59:03] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2025-06-06 08:59:03] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2025-06-06 08:59:03] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2025-06-06 08:59:03] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2025-06-06 08:59:03] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2025-06-06 08:59:03] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2025-06-06 08:59:03] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2025-06-06 08:59:03] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2025-06-06 08:59:03] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2025-06-06 08:59:03] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2025-06-06 08:59:03] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2025-06-06 08:59:03] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2025-06-06 08:59:03] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2025-06-06 08:59:03] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2025-06-06 08:59:03] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 2 ms to minimize.
[2025-06-06 08:59:03] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2025-06-06 08:59:03] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2025-06-06 08:59:04] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2025-06-06 08:59:04] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2025-06-06 08:59:04] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2025-06-06 08:59:04] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2025-06-06 08:59:04] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2025-06-06 08:59:04] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2025-06-06 08:59:04] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2025-06-06 08:59:04] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2025-06-06 08:59:04] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2025-06-06 08:59:04] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2025-06-06 08:59:04] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2025-06-06 08:59:04] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2025-06-06 08:59:04] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2025-06-06 08:59:04] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2025-06-06 08:59:04] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2025-06-06 08:59:04] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2025-06-06 08:59:04] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2025-06-06 08:59:04] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2025-06-06 08:59:04] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2025-06-06 08:59:04] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2025-06-06 08:59:04] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2025-06-06 08:59:04] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2025-06-06 08:59:04] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2025-06-06 08:59:04] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2025-06-06 08:59:05] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2025-06-06 08:59:05] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2025-06-06 08:59:05] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2025-06-06 08:59:05] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2025-06-06 08:59:05] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2025-06-06 08:59:05] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2025-06-06 08:59:05] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2025-06-06 08:59:05] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2025-06-06 08:59:05] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2025-06-06 08:59:05] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2025-06-06 08:59:05] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2025-06-06 08:59:05] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2025-06-06 08:59:05] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/36 variables, 5/127 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2025-06-06 08:59:05] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2025-06-06 08:59:05] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2025-06-06 08:59:05] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2025-06-06 08:59:06] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2025-06-06 08:59:06] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2025-06-06 08:59:06] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2025-06-06 08:59:06] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2025-06-06 08:59:06] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2025-06-06 08:59:06] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2025-06-06 08:59:06] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 10/137 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2025-06-06 08:59:06] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/36 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2025-06-06 08:59:06] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2025-06-06 08:59:06] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2025-06-06 08:59:06] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2025-06-06 08:59:06] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2025-06-06 08:59:06] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2025-06-06 08:59:06] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
SMT process timed out in 5054ms, After SMT, problems are : Problem set: 0 solved, 86 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 36 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 36/36 places, 156/156 transitions.
Applied a total of 0 rules in 7 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 36/36 places, 156/156 transitions.
RANDOM walk for 4000000 steps (8 resets) in 32763 ms. (122 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3148 ms. (127 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3159 ms. (126 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3187 ms. (125 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3110 ms. (128 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3132 ms. (127 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3123 ms. (128 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3121 ms. (128 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3124 ms. (128 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3119 ms. (128 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3149 ms. (126 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3137 ms. (127 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3147 ms. (127 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3118 ms. (128 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3171 ms. (126 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3108 ms. (128 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3160 ms. (126 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3159 ms. (126 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3160 ms. (126 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3182 ms. (125 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3190 ms. (125 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3203 ms. (124 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3247 ms. (123 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3205 ms. (124 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3225 ms. (123 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3169 ms. (126 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3198 ms. (125 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3205 ms. (124 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3164 ms. (126 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3168 ms. (126 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3192 ms. (125 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3214 ms. (124 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3189 ms. (125 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3198 ms. (125 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3179 ms. (125 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3221 ms. (124 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3143 ms. (127 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3189 ms. (125 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3231 ms. (123 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3210 ms. (124 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3192 ms. (125 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3191 ms. (125 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3233 ms. (123 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3172 ms. (126 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3222 ms. (124 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3424 ms. (116 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3174 ms. (125 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3201 ms. (124 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3137 ms. (127 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3249 ms. (123 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3163 ms. (126 steps per ms) remains 86/86 properties
Probably explored full state space saw : 166 states, properties seen :0
Probabilistic random walk after 531 steps, saw 166 distinct states, run finished after 27 ms. (steps per millisecond=19 ) properties seen :0
Explored full state space saw : 166 states, properties seen :0
Exhaustive walk after 531 steps, saw 166 distinct states, run finished after 11 ms. (steps per millisecond=48 ) properties seen :0
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK EXHAUSTIVE_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 109368 ms.
ITS solved all properties within timeout

BK_STOP 1749200401813

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TokenRing-PT-005"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5832"
echo " Executing tool gold2024"
echo " Input is TokenRing-PT-005, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r252-tall-174915605600207"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TokenRing-PT-005.tgz
mv TokenRing-PT-005 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;