About the Execution of 2025-gold for DES-PT-60a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1684.527 | 249478.00 | 363622.00 | 855.50 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r095-smll-177946996300056.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool gold2025
Input is DES-PT-60a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r095-smll-177946996300056
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 7.2K Mar 6 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 6 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 6 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 6 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 08:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 09:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Mar 6 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Mar 6 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Mar 6 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Mar 6 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 09:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 09:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 110K Mar 3 18:30 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
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DES-PT-60a-UpperBounds-00
FORMULA_NAME DES-PT-60a-UpperBounds-01
FORMULA_NAME DES-PT-60a-UpperBounds-02
FORMULA_NAME DES-PT-60a-UpperBounds-03
FORMULA_NAME DES-PT-60a-UpperBounds-04
FORMULA_NAME DES-PT-60a-UpperBounds-05
FORMULA_NAME DES-PT-60a-UpperBounds-06
FORMULA_NAME DES-PT-60a-UpperBounds-07
FORMULA_NAME DES-PT-60a-UpperBounds-08
FORMULA_NAME DES-PT-60a-UpperBounds-09
FORMULA_NAME DES-PT-60a-UpperBounds-10
FORMULA_NAME DES-PT-60a-UpperBounds-11
FORMULA_NAME DES-PT-60a-UpperBounds-12
FORMULA_NAME DES-PT-60a-UpperBounds-13
FORMULA_NAME DES-PT-60a-UpperBounds-14
FORMULA_NAME DES-PT-60a-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779528468656
Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-60a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 09:27:51] [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]
[2026-05-23 09:27:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 09:27:51] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2026-05-23 09:27:51] [INFO ] Transformed 354 places.
[2026-05-23 09:27:51] [INFO ] Transformed 311 transitions.
[2026-05-23 09:27:51] [INFO ] Found NUPN structural information;
[2026-05-23 09:27:52] [INFO ] Parsed PT model containing 354 places and 311 transitions and 1496 arcs in 509 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 297 rows 354 cols
[2026-05-23 09:27:52] [INFO ] Computed 59 invariants in 78 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (225 resets) in 148 ms. (67 steps per ms)
FORMULA DES-PT-60a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120009 steps (533 resets) in 286 ms. (418 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-23 09:27:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:27:53] [INFO ] [Real]Absence check using 34 positive place invariants in 27 ms returned sat
[2026-05-23 09:27:53] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 32 ms returned sat
[2026-05-23 09:27:53] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2026-05-23 09:27:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:27:54] [INFO ] [Nat]Absence check using 34 positive place invariants in 34 ms returned sat
[2026-05-23 09:27:54] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 70 ms returned sat
[2026-05-23 09:27:57] [INFO ] [Nat]Absence check using state equation in 3101 ms returned sat
[2026-05-23 09:27:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 09:27:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 176 ms returned sat
[2026-05-23 09:27:57] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 44 ms.
[2026-05-23 09:27:58] [INFO ] Added : 55 causal constraints over 11 iterations in 1342 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:27:59] [INFO ] [Real]Absence check using 34 positive place invariants in 23 ms returned sat
[2026-05-23 09:27:59] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 31 ms returned sat
[2026-05-23 09:27:59] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2026-05-23 09:27:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:27:59] [INFO ] [Nat]Absence check using 34 positive place invariants in 19 ms returned sat
[2026-05-23 09:27:59] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 30 ms returned sat
[2026-05-23 09:27:59] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2026-05-23 09:27:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-23 09:27:59] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 33 ms.
[2026-05-23 09:28:01] [INFO ] Added : 91 causal constraints over 19 iterations in 1224 ms. Result :sat
Minimization took 503 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:28:01] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2026-05-23 09:28:01] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 29 ms returned sat
[2026-05-23 09:28:02] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2026-05-23 09:28:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:28:02] [INFO ] [Nat]Absence check using 34 positive place invariants in 20 ms returned sat
[2026-05-23 09:28:02] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 31 ms returned sat
[2026-05-23 09:28:02] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2026-05-23 09:28:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2026-05-23 09:28:02] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 40 ms.
[2026-05-23 09:28:05] [INFO ] Added : 130 causal constraints over 26 iterations in 2500 ms. Result :sat
Minimization took 320 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:28:05] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2026-05-23 09:28:05] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 35 ms returned sat
[2026-05-23 09:28:05] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2026-05-23 09:28:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:28:06] [INFO ] [Nat]Absence check using 34 positive place invariants in 28 ms returned sat
[2026-05-23 09:28:06] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 43 ms returned sat
[2026-05-23 09:28:06] [INFO ] [Nat]Absence check using state equation in 817 ms returned sat
[2026-05-23 09:28:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 25 ms returned sat
[2026-05-23 09:28:07] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 36 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:28:10] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:28:10] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 6 ms to minimize.
[2026-05-23 09:28:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 369 ms
[2026-05-23 09:28:10] [INFO ] Added : 112 causal constraints over 40 iterations in 3269 ms. Result :sat
Minimization took 501 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:28:10] [INFO ] [Real]Absence check using 34 positive place invariants in 18 ms returned sat
[2026-05-23 09:28:10] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2026-05-23 09:28:11] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2026-05-23 09:28:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:28:11] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2026-05-23 09:28:11] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 40 ms returned sat
[2026-05-23 09:28:14] [INFO ] [Nat]Absence check using state equation in 2781 ms returned sat
[2026-05-23 09:28:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 111 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:28:14] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 6 ms to minimize.
[2026-05-23 09:28:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2026-05-23 09:28:14] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 22 ms.
[2026-05-23 09:28:15] [INFO ] Added : 63 causal constraints over 13 iterations in 1104 ms. Result :sat
Minimization took 404 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:28:16] [INFO ] [Real]Absence check using 34 positive place invariants in 24 ms returned sat
[2026-05-23 09:28:16] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 44 ms returned sat
[2026-05-23 09:28:16] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2026-05-23 09:28:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:28:16] [INFO ] [Nat]Absence check using 34 positive place invariants in 23 ms returned sat
[2026-05-23 09:28:16] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 36 ms returned sat
[2026-05-23 09:28:17] [INFO ] [Nat]Absence check using state equation in 561 ms returned sat
[2026-05-23 09:28:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 96 ms returned sat
[2026-05-23 09:28:17] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 35 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:28:20] [INFO ] Deduced a trap composed of 17 places in 227 ms of which 19 ms to minimize.
[2026-05-23 09:28:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 427 ms
[2026-05-23 09:28:20] [INFO ] Added : 150 causal constraints over 32 iterations in 3312 ms. Result :sat
Minimization took 568 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:28:21] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2026-05-23 09:28:21] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2026-05-23 09:28:21] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2026-05-23 09:28:21] [INFO ] [Real]Added 1 Read/Feed constraints in 59 ms returned sat
[2026-05-23 09:28:22] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 22 ms.
[2026-05-23 09:28:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:28:22] [INFO ] [Nat]Absence check using 34 positive place invariants in 29 ms returned sat
[2026-05-23 09:28:22] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 43 ms returned sat
[2026-05-23 09:28:22] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2026-05-23 09:28:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 151 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:28:23] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 11 ms to minimize.
[2026-05-23 09:28:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2026-05-23 09:28:23] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 21 ms.
[2026-05-23 09:28:24] [INFO ] Added : 162 causal constraints over 33 iterations in 1706 ms. Result :sat
Minimization took 505 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:28:25] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2026-05-23 09:28:25] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2026-05-23 09:28:25] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2026-05-23 09:28:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:28:25] [INFO ] [Nat]Absence check using 34 positive place invariants in 25 ms returned sat
[2026-05-23 09:28:26] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2026-05-23 09:28:26] [INFO ] [Nat]Absence check using state equation in 794 ms returned sat
[2026-05-23 09:28:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-23 09:28:26] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 25 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:28:28] [INFO ] Deduced a trap composed of 9 places in 249 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:28:29] [INFO ] Deduced a trap composed of 17 places in 229 ms of which 19 ms to minimize.
[2026-05-23 09:28:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 682 ms
[2026-05-23 09:28:29] [INFO ] Added : 113 causal constraints over 23 iterations in 2527 ms. Result :sat
Minimization took 501 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:28:30] [INFO ] [Real]Absence check using 34 positive place invariants in 24 ms returned sat
[2026-05-23 09:28:30] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 46 ms returned sat
[2026-05-23 09:28:30] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2026-05-23 09:28:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:28:30] [INFO ] [Nat]Absence check using 34 positive place invariants in 22 ms returned sat
[2026-05-23 09:28:30] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 33 ms returned sat
[2026-05-23 09:28:31] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2026-05-23 09:28:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 167 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:28:31] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 10 ms to minimize.
[2026-05-23 09:28:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2026-05-23 09:28:31] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 26 ms.
[2026-05-23 09:28:33] [INFO ] Added : 208 causal constraints over 42 iterations in 2418 ms. Result :sat
Minimization took 521 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:28:34] [INFO ] [Real]Absence check using 34 positive place invariants in 25 ms returned sat
[2026-05-23 09:28:34] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 32 ms returned sat
[2026-05-23 09:28:34] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2026-05-23 09:28:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:28:35] [INFO ] [Nat]Absence check using 34 positive place invariants in 20 ms returned sat
[2026-05-23 09:28:35] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 43 ms returned sat
[2026-05-23 09:28:35] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2026-05-23 09:28:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 139 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:28:35] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 8 ms to minimize.
[2026-05-23 09:28:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2026-05-23 09:28:35] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 20 ms.
[2026-05-23 09:28:37] [INFO ] Added : 194 causal constraints over 39 iterations in 2090 ms. Result :sat
Minimization took 556 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:28:38] [INFO ] [Real]Absence check using 34 positive place invariants in 25 ms returned sat
[2026-05-23 09:28:38] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 42 ms returned sat
[2026-05-23 09:28:39] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2026-05-23 09:28:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:28:39] [INFO ] [Nat]Absence check using 34 positive place invariants in 23 ms returned sat
[2026-05-23 09:28:39] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 68 ms returned sat
[2026-05-23 09:28:42] [INFO ] [Nat]Absence check using state equation in 3019 ms returned sat
[2026-05-23 09:28:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 34 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:28:42] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 6 ms to minimize.
[2026-05-23 09:28:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2026-05-23 09:28:42] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 19 ms.
[2026-05-23 09:28:44] [INFO ] Added : 97 causal constraints over 20 iterations in 1512 ms. Result :sat
Minimization took 113 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:28:44] [INFO ] [Real]Absence check using 34 positive place invariants in 22 ms returned sat
[2026-05-23 09:28:44] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 46 ms returned sat
[2026-05-23 09:28:44] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2026-05-23 09:28:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:28:44] [INFO ] [Nat]Absence check using 34 positive place invariants in 26 ms returned sat
[2026-05-23 09:28:45] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 65 ms returned sat
[2026-05-23 09:28:48] [INFO ] [Nat]Absence check using state equation in 2943 ms returned sat
[2026-05-23 09:28:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 140 ms returned sat
[2026-05-23 09:28:48] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 20 ms.
[2026-05-23 09:28:49] [INFO ] Added : 30 causal constraints over 6 iterations in 1414 ms. Result :sat
Minimization took 254 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 12 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 297/297 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 353 transition count 294
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 353 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 352 transition count 293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 351 transition count 293
Applied a total of 12 rules in 172 ms. Remains 351 /354 variables (removed 3) and now considering 293/297 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 351/354 places, 293/297 transitions.
// Phase 1: matrix 293 rows 351 cols
[2026-05-23 09:28:51] [INFO ] Computed 60 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (13648 resets) in 2874 ms. (347 steps per ms)
BEST_FIRST walk for 12000011 steps (27275 resets) in 12825 ms. (935 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-23 09:29:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:29:07] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2026-05-23 09:29:07] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 25 ms returned sat
[2026-05-23 09:29:07] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2026-05-23 09:29:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 09:29:07] [INFO ] [Real]Added 2 Read/Feed constraints in 8 ms returned sat
[2026-05-23 09:29:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:29:07] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2026-05-23 09:29:08] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 748 ms returned sat
[2026-05-23 09:29:08] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2026-05-23 09:29:08] [INFO ] [Nat]Added 2 Read/Feed constraints in 13 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:08] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:09] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 10 ms to minimize.
[2026-05-23 09:29:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 327 ms
[2026-05-23 09:29:09] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 17 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:11] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 6 ms to minimize.
[2026-05-23 09:29:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2026-05-23 09:29:11] [INFO ] Added : 193 causal constraints over 40 iterations in 2346 ms. Result :sat
Minimization took 398 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:29:11] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2026-05-23 09:29:11] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 40 ms returned sat
[2026-05-23 09:29:12] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2026-05-23 09:29:12] [INFO ] [Real]Added 2 Read/Feed constraints in 23 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:12] [INFO ] Deduced a trap composed of 5 places in 292 ms of which 18 ms to minimize.
[2026-05-23 09:29:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:29:12] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2026-05-23 09:29:12] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 37 ms returned sat
[2026-05-23 09:29:13] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2026-05-23 09:29:13] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:13] [INFO ] Deduced a trap composed of 15 places in 335 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:13] [INFO ] Deduced a trap composed of 7 places in 330 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:14] [INFO ] Deduced a trap composed of 16 places in 277 ms of which 20 ms to minimize.
[2026-05-23 09:29:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1044 ms
[2026-05-23 09:29:14] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 30 ms.
[2026-05-23 09:29:15] [INFO ] Added : 94 causal constraints over 19 iterations in 1008 ms. Result :sat
Minimization took 392 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:29:15] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2026-05-23 09:29:15] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 39 ms returned sat
[2026-05-23 09:29:16] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2026-05-23 09:29:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:29:16] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2026-05-23 09:29:16] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 86 ms returned sat
[2026-05-23 09:29:16] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2026-05-23 09:29:16] [INFO ] [Nat]Added 2 Read/Feed constraints in 21 ms returned sat
[2026-05-23 09:29:16] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 29 ms.
[2026-05-23 09:29:19] [INFO ] Added : 209 causal constraints over 43 iterations in 2713 ms. Result :sat
Minimization took 382 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:29:19] [INFO ] [Real]Absence check using 35 positive place invariants in 20 ms returned sat
[2026-05-23 09:29:20] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 39 ms returned sat
[2026-05-23 09:29:20] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2026-05-23 09:29:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:29:20] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2026-05-23 09:29:20] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 184 ms returned sat
[2026-05-23 09:29:20] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2026-05-23 09:29:20] [INFO ] [Nat]Added 2 Read/Feed constraints in 22 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:20] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:21] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 11 ms to minimize.
[2026-05-23 09:29:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 331 ms
[2026-05-23 09:29:21] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 18 ms.
[2026-05-23 09:29:21] [INFO ] Added : 136 causal constraints over 28 iterations in 763 ms. Result :sat
Minimization took 248 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:29:22] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2026-05-23 09:29:22] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 28 ms returned sat
[2026-05-23 09:29:22] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2026-05-23 09:29:22] [INFO ] [Real]Added 2 Read/Feed constraints in 10 ms returned sat
[2026-05-23 09:29:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:29:22] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2026-05-23 09:29:23] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 548 ms returned sat
[2026-05-23 09:29:23] [INFO ] [Nat]Absence check using state equation in 500 ms returned sat
[2026-05-23 09:29:23] [INFO ] [Nat]Added 2 Read/Feed constraints in 13 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:23] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:24] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 13 ms to minimize.
[2026-05-23 09:29:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 352 ms
[2026-05-23 09:29:24] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 20 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:25] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 3 ms to minimize.
[2026-05-23 09:29:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2026-05-23 09:29:25] [INFO ] Added : 192 causal constraints over 39 iterations in 1488 ms. Result :sat
Minimization took 239 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:29:25] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2026-05-23 09:29:25] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 27 ms returned sat
[2026-05-23 09:29:26] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2026-05-23 09:29:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:29:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2026-05-23 09:29:26] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 326 ms returned sat
[2026-05-23 09:29:26] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2026-05-23 09:29:26] [INFO ] [Nat]Added 2 Read/Feed constraints in 9 ms returned sat
[2026-05-23 09:29:26] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 18 ms.
[2026-05-23 09:29:27] [INFO ] Added : 144 causal constraints over 30 iterations in 869 ms. Result :sat
Minimization took 237 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:29:27] [INFO ] [Real]Absence check using 35 positive place invariants in 14 ms returned sat
[2026-05-23 09:29:28] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 28 ms returned sat
[2026-05-23 09:29:28] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2026-05-23 09:29:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:29:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2026-05-23 09:29:28] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 83 ms returned sat
[2026-05-23 09:29:28] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2026-05-23 09:29:28] [INFO ] [Nat]Added 2 Read/Feed constraints in 38 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:28] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:29] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 11 ms to minimize.
[2026-05-23 09:29:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 337 ms
[2026-05-23 09:29:29] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 17 ms.
[2026-05-23 09:29:30] [INFO ] Added : 200 causal constraints over 40 iterations in 1241 ms. Result :sat
Minimization took 245 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:29:30] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned sat
[2026-05-23 09:29:30] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 26 ms returned sat
[2026-05-23 09:29:30] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2026-05-23 09:29:30] [INFO ] [Real]Added 2 Read/Feed constraints in 13 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:31] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 15 ms to minimize.
[2026-05-23 09:29:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:29:31] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2026-05-23 09:29:31] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 196 ms returned sat
[2026-05-23 09:29:31] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2026-05-23 09:29:31] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:31] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:32] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:32] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 10 ms to minimize.
[2026-05-23 09:29:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 512 ms
[2026-05-23 09:29:32] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 15 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:33] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 10 ms to minimize.
[2026-05-23 09:29:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2026-05-23 09:29:33] [INFO ] Added : 166 causal constraints over 34 iterations in 1361 ms. Result :sat
Minimization took 274 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:29:33] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2026-05-23 09:29:33] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 27 ms returned sat
[2026-05-23 09:29:34] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2026-05-23 09:29:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:29:34] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2026-05-23 09:29:34] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 59 ms returned sat
[2026-05-23 09:29:34] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2026-05-23 09:29:34] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2026-05-23 09:29:34] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 21 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:36] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 11 ms to minimize.
[2026-05-23 09:29:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2026-05-23 09:29:36] [INFO ] Added : 264 causal constraints over 54 iterations in 2012 ms. Result :sat
Minimization took 286 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:29:37] [INFO ] [Real]Absence check using 35 positive place invariants in 14 ms returned sat
[2026-05-23 09:29:37] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 31 ms returned sat
[2026-05-23 09:29:37] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2026-05-23 09:29:37] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2026-05-23 09:29:37] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 19 ms.
[2026-05-23 09:29:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:29:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2026-05-23 09:29:38] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 26 ms returned sat
[2026-05-23 09:29:39] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2026-05-23 09:29:39] [INFO ] [Nat]Added 2 Read/Feed constraints in 40 ms returned sat
[2026-05-23 09:29:39] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 19 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:41] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:42] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:42] [INFO ] Deduced a trap composed of 60 places in 106 ms of which 10 ms to minimize.
[2026-05-23 09:29:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 698 ms
[2026-05-23 09:29:42] [INFO ] Added : 259 causal constraints over 52 iterations in 3433 ms. Result :sat
Minimization took 360 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:29:43] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2026-05-23 09:29:43] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 28 ms returned sat
[2026-05-23 09:29:43] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2026-05-23 09:29:43] [INFO ] [Real]Added 2 Read/Feed constraints in 11 ms returned sat
[2026-05-23 09:29:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:29:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2026-05-23 09:29:43] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 574 ms returned sat
[2026-05-23 09:29:44] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2026-05-23 09:29:44] [INFO ] [Nat]Added 2 Read/Feed constraints in 14 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:44] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:44] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 11 ms to minimize.
[2026-05-23 09:29:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 312 ms
[2026-05-23 09:29:44] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 18 ms.
[2026-05-23 09:29:46] [INFO ] Added : 224 causal constraints over 46 iterations in 1654 ms. Result :sat
Minimization took 272 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:29:46] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2026-05-23 09:29:46] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 27 ms returned sat
[2026-05-23 09:29:47] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2026-05-23 09:29:47] [INFO ] [Real]Added 2 Read/Feed constraints in 10 ms returned sat
[2026-05-23 09:29:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:29:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2026-05-23 09:29:47] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 702 ms returned sat
[2026-05-23 09:29:48] [INFO ] [Nat]Absence check using state equation in 509 ms returned sat
[2026-05-23 09:29:48] [INFO ] [Nat]Added 2 Read/Feed constraints in 14 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:48] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:48] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 13 ms to minimize.
[2026-05-23 09:29:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 362 ms
[2026-05-23 09:29:48] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 18 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:50] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 4 ms to minimize.
[2026-05-23 09:29:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2026-05-23 09:29:50] [INFO ] Added : 189 causal constraints over 38 iterations in 1517 ms. Result :sat
Minimization took 301 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 12 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 27 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 26 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2026-05-23 09:29:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:29:56] [INFO ] Implicit Places using invariants in 442 ms returned []
[2026-05-23 09:29:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:29:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 09:29:58] [INFO ] Implicit Places using invariants and state equation in 1022 ms returned []
Implicit Place search using SMT with State Equation took 1466 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 09:29:58] [INFO ] Redundant transitions in 30 ms returned []
Running 290 sub problems to find dead transitions.
[2026-05-23 09:29:58] [INFO ] Invariant cache hit.
[2026-05-23 09:29:58] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 290 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/350 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 293/643 variables, 350/410 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/643 variables, 2/412 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:30:22] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/643 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:30:24] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:30:24] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:30:28] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/644 variables, and 416 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 350/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 2/350 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (OVERLAPS) 293/643 variables, 350/414 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/643 variables, 2/416 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 290/706 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/644 variables, and 706 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 350/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60573ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 60593ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62148 ms. Remains : 351/351 places, 293/293 transitions.
RANDOM walk for 40000 steps (549 resets) in 1464 ms. (27 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (10 resets) in 49 ms. (80 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (10 resets) in 31 ms. (125 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (10 resets) in 62 ms. (63 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (11 resets) in 64 ms. (61 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (11 resets) in 63 ms. (62 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (10 resets) in 60 ms. (65 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (11 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (10 resets) in 40 ms. (97 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (11 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (10 resets) in 35 ms. (111 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (10 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (11 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (11 resets) in 33 ms. (117 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (9 resets) in 35 ms. (111 steps per ms) remains 24/24 properties
[2026-05-23 09:30:59] [INFO ] Flatten gal took : 214 ms
BEST_FIRST walk for 4003 steps (11 resets) in 34 ms. (114 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (11 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (10 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (9 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (10 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (10 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 24/24 properties
[2026-05-23 09:30:59] [INFO ] Flatten gal took : 118 ms
BEST_FIRST walk for 4004 steps (10 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
[2026-05-23 09:30:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6546711358367644120.gal : 42 ms
[2026-05-23 09:30:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17094774393701017723.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6546711358367644120.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17094774393701017723.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality17094774393701017723.prop.
SDD proceeding with computation,24 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,24 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,24 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,24 properties remain. new max is 32
SDD size :8 after 20
SDD proceeding with computation,24 properties remain. new max is 64
SDD size :20 after 36
SDD proceeding with computation,24 properties remain. new max is 128
SDD size :36 after 44
SDD proceeding with computation,24 properties remain. new max is 256
SDD size :44 after 624
SDD proceeding with computation,24 properties remain. new max is 512
SDD size :624 after 676
SDD proceeding with computation,24 properties remain. new max is 1024
SDD size :676 after 3028
SDD proceeding with computation,24 properties remain. new max is 2048
SDD size :3028 after 19204
SDD proceeding with computation,24 properties remain. new max is 4096
SDD size :19204 after 78688
SDD proceeding with computation,24 properties remain. new max is 8192
SDD size :78688 after 84712
Interrupted probabilistic random walk after 387936 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 24
Probabilistic random walk after 387936 steps, saw 57355 distinct states, run finished after 3007 ms. (steps per millisecond=129 ) properties seen :0
[2026-05-23 09:31:02] [INFO ] Invariant cache hit.
[2026-05-23 09:31:02] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 207/219 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
SDD proceeding with computation,24 properties remain. new max is 16384
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/252 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 24 unsolved
SDD size :364744 after 1.60049e+08
At refinement iteration 5 (OVERLAPS) 25/277 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 7/284 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 236/520 variables, 284/339 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/520 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/520 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 24 unsolved
SMT process timed out in 5024ms, After SMT, problems are : Problem set: 0 solved, 24 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 18 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 351/351 places, 293/293 transitions.
RANDOM walk for 40000 steps (544 resets) in 640 ms. (62 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (9 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (11 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (11 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (10 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (9 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (9 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (11 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (10 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (11 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (11 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (10 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (10 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (11 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (10 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (9 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
SDD proceeding with computation,24 properties remain. new max is 32768
SDD size :1.60049e+08 after 2.41645e+08
Interrupted probabilistic random walk after 416269 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :0 out of 24
Probabilistic random walk after 416269 steps, saw 61223 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
[2026-05-23 09:31:11] [INFO ] Invariant cache hit.
[2026-05-23 09:31:11] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 207/219 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/252 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 25/277 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 7/284 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 236/520 variables, 284/339 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/520 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/520 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 71/591 variables, 14/355 constraints. Problems are: Problem set: 0 solved, 24 unsolved
SDD proceeding with computation,24 properties remain. new max is 65536
SDD size :2.41645e+08 after 6.78415e+08
At refinement iteration 13 (INCLUDED_ONLY) 0/591 variables, 4/359 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/591 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (OVERLAPS) 1/592 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/592 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:31:23] [INFO ] Deduced a trap composed of 15 places in 248 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:31:23] [INFO ] Deduced a trap composed of 16 places in 240 ms of which 22 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/592 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/592 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 19 (OVERLAPS) 52/644 variables, 52/415 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/644 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 21 (OVERLAPS) 0/644 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 644/644 variables, and 415 constraints, problems are : Problem set: 0 solved, 24 unsolved in 28378 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 351/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 207/219 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 33/252 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 24 unsolved
SDD proceeding with computation,24 properties remain. new max is 131072
At refinement iteration 5 (OVERLAPS) 25/277 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 7/284 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
SDD size :7.29588e+08 after 7.96509e+09
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 236/520 variables, 284/340 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/520 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/520 variables, 16/358 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/520 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (OVERLAPS) 71/591 variables, 14/372 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/591 variables, 4/376 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/591 variables, 8/384 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/591 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Detected timeout of ITS tools.
[2026-05-23 09:31:49] [INFO ] Flatten gal took : 41 ms
[2026-05-23 09:31:49] [INFO ] Applying decomposition
[2026-05-23 09:31:49] [INFO ] Flatten gal took : 80 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1694532446162496896.txt' '-o' '/tmp/graph1694532446162496896.bin' '-w' '/tmp/graph1694532446162496896.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1694532446162496896.bin' '-l' '-1' '-v' '-w' '/tmp/graph1694532446162496896.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:31:50] [INFO ] Decomposing Gal with order
[2026-05-23 09:31:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:31:50] [INFO ] Removed a total of 75 redundant transitions.
[2026-05-23 09:31:50] [INFO ] Flatten gal took : 148 ms
[2026-05-23 09:31:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 16 ms.
[2026-05-23 09:31:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9451708187290097563.gal : 15 ms
[2026-05-23 09:31:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17627088558982446223.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9451708187290097563.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17627088558982446223.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality17627088558982446223.prop.
SDD proceeding with computation,24 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,24 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,24 properties remain. new max is 16
SDD size :4 after 20
SDD proceeding with computation,24 properties remain. new max is 32
SDD size :20 after 364
SDD proceeding with computation,24 properties remain. new max is 64
SDD size :364 after 2640
SDD proceeding with computation,24 properties remain. new max is 128
SDD size :8206 after 1.15805e+08
Invariant property MIN11 does not hold.
Reachability property MAX11 is true.
SDD proceeding with computation,22 properties remain. new max is 128
SDD size :1.15805e+08 after 2.62343e+08
Invariant property MIN4 does not hold.
Reachability property MAX4 is true.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,18 properties remain. new max is 128
SDD size :2.62343e+08 after 3.60035e+08
SDD proceeding with computation,18 properties remain. new max is 256
SDD size :3.60035e+08 after 4.57727e+08
SDD proceeding with computation,18 properties remain. new max is 512
SDD size :4.57727e+08 after 6.04266e+08
SDD proceeding with computation,18 properties remain. new max is 1024
SDD size :6.04266e+08 after 8.7292e+08
Invariant property MIN10 does not hold.
Reachability property MAX10 is true.
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :1.25187e+12 after 1.48131e+12
At refinement iteration 18 (INCLUDED_ONLY) 0/591 variables, 0/385 constraints. Problems are: Problem set: 8 solved, 16 unsolved
Invariant property MIN7 does not hold.
Reachability property MAX7 is true.
Invariant property MIN5 does not hold.
Reachability property MAX5 is true.
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :1.63547e+13 after 1.70749e+13
At refinement iteration 19 (OVERLAPS) 1/592 variables, 1/386 constraints. Problems are: Problem set: 14 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/592 variables, 1/387 constraints. Problems are: Problem set: 14 solved, 10 unsolved
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :2.49968e+13 after 2.51254e+13
Invariant property MIN9 does not hold.
Reachability property MAX9 is true.
Invariant property MIN8 does not hold.
Reachability property MAX8 is true.
Invariant property MIN6 does not hold.
Reachability property MAX6 is true.
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
After SMT solving in domain Int declared 592/644 variables, and 387 constraints, problems are : Problem set: 24 solved, 0 unsolved in 18598 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 299/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46991ms problems are : Problem set: 24 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA DES-PT-60a-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-60a-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-60a-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-60a-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-60a-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-60a-UpperBounds-10 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-60a-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-60a-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-60a-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-60a-UpperBounds-05 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-60a-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-60a-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 12 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 246666 ms.
BK_STOP 1779528718134
--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="DES-PT-60a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is DES-PT-60a, 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 r095-smll-177946996300056"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-60a.tgz
mv DES-PT-60a 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.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 ;