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-177946996300051.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-30b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r095-smll-177946996300051
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 5.7K Mar 6 18:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 6 18:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Mar 6 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Mar 6 18:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 08:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 08:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Mar 6 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Mar 6 18:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 6 18:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:58 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 103K 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-30b-UpperBounds-00
FORMULA_NAME DES-PT-30b-UpperBounds-01
FORMULA_NAME DES-PT-30b-UpperBounds-02
FORMULA_NAME DES-PT-30b-UpperBounds-03
FORMULA_NAME DES-PT-30b-UpperBounds-04
FORMULA_NAME DES-PT-30b-UpperBounds-05
FORMULA_NAME DES-PT-30b-UpperBounds-06
FORMULA_NAME DES-PT-30b-UpperBounds-07
FORMULA_NAME DES-PT-30b-UpperBounds-08
FORMULA_NAME DES-PT-30b-UpperBounds-09
FORMULA_NAME DES-PT-30b-UpperBounds-10
FORMULA_NAME DES-PT-30b-UpperBounds-11
FORMULA_NAME DES-PT-30b-UpperBounds-12
FORMULA_NAME DES-PT-30b-UpperBounds-13
FORMULA_NAME DES-PT-30b-UpperBounds-14
FORMULA_NAME DES-PT-30b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779527565016

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-30b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 09:12:47] [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:12:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 09:12:47] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2026-05-23 09:12:47] [INFO ] Transformed 399 places.
[2026-05-23 09:12:47] [INFO ] Transformed 350 transitions.
[2026-05-23 09:12:47] [INFO ] Found NUPN structural information;
[2026-05-23 09:12:47] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 333 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
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 350 rows 399 cols
[2026-05-23 09:12:47] [INFO ] Computed 65 invariants in 47 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 (82 resets) in 86 ms. (114 steps per ms)
FORMULA DES-PT-30b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-30b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-30b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-30b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-30b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-30b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-30b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-30b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-30b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-30b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-30b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-30b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-30b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (38 resets) in 63 ms. (468 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-23 09:12:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:12:48] [INFO ] [Real]Absence check using 39 positive place invariants in 47 ms returned sat
[2026-05-23 09:12:48] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 54 ms returned sat
[2026-05-23 09:12:48] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2026-05-23 09:12:49] [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:12:49] [INFO ] [Nat]Absence check using 39 positive place invariants in 37 ms returned sat
[2026-05-23 09:12:49] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 59 ms returned sat
[2026-05-23 09:12:49] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:12:50] [INFO ] Deduced a trap composed of 7 places in 336 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:12:50] [INFO ] Deduced a trap composed of 8 places in 280 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:12:51] [INFO ] Deduced a trap composed of 10 places in 357 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:12:51] [INFO ] Deduced a trap composed of 13 places in 293 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:12:51] [INFO ] Deduced a trap composed of 23 places in 279 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:12:52] [INFO ] Deduced a trap composed of 21 places in 247 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:12:52] [INFO ] Deduced a trap composed of 26 places in 276 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:12:52] [INFO ] Deduced a trap composed of 26 places in 264 ms of which 17 ms to minimize.
[2026-05-23 09:12:52] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2768 ms
[2026-05-23 09:12:52] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 59 ms.
Maximisation of solution failed !
Minimization took 2 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:12:54] [INFO ] [Real]Absence check using 39 positive place invariants in 38 ms returned sat
[2026-05-23 09:12:54] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 58 ms returned sat
[2026-05-23 09:12:54] [INFO ] [Real]Absence check using state equation in 537 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:12:55] [INFO ] Deduced a trap composed of 14 places in 240 ms of which 27 ms to minimize.
[2026-05-23 09:12:55] [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:12:55] [INFO ] [Nat]Absence check using 39 positive place invariants in 40 ms returned sat
[2026-05-23 09:12:55] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 66 ms returned sat
[2026-05-23 09:12:56] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2026-05-23 09:12:56] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 57 ms.
Maximisation of solution failed !
Minimization took 6 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:13:00] [INFO ] [Real]Absence check using 39 positive place invariants in 32 ms returned sat
[2026-05-23 09:13:00] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 65 ms returned sat
[2026-05-23 09:13:01] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2026-05-23 09:13:01] [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:13:01] [INFO ] [Nat]Absence check using 39 positive place invariants in 37 ms returned sat
[2026-05-23 09:13:01] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 83 ms returned sat
[2026-05-23 09:13:02] [INFO ] [Nat]Absence check using state equation in 656 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:13:02] [INFO ] Deduced a trap composed of 13 places in 306 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:13:02] [INFO ] Deduced a trap composed of 22 places in 227 ms of which 21 ms to minimize.
[2026-05-23 09:13:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 631 ms
[2026-05-23 09:13:02] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 44 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 350/350 transitions.
Graph (complete) has 858 edges and 399 vertex of which 392 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 392 transition count 323
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 371 transition count 323
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 371 transition count 314
Deduced a syphon composed of 9 places in 6 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 362 transition count 314
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 343 transition count 295
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 343 transition count 295
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 343 transition count 294
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 342 transition count 294
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 327 transition count 279
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 327 transition count 279
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 327 transition count 264
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 325 transition count 263
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 325 transition count 260
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 322 transition count 260
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 245 transition count 183
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 243 transition count 185
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 243 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 242 transition count 184
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 241 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 240 transition count 183
Applied a total of 319 rules in 388 ms. Remains 240 /399 variables (removed 159) and now considering 183/350 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 409 ms. Remains : 240/399 places, 183/350 transitions.
// Phase 1: matrix 183 rows 240 cols
[2026-05-23 09:13:06] [INFO ] Computed 63 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (47781 resets) in 3174 ms. (314 steps per ms)
BEST_FIRST walk for 3000002 steps (27141 resets) in 3808 ms. (787 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-23 09:13:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:13:13] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2026-05-23 09:13:13] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 28 ms returned sat
[2026-05-23 09:13:13] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2026-05-23 09:13:13] [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:13:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2026-05-23 09:13:13] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 24 ms returned sat
[2026-05-23 09:13:14] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2026-05-23 09:13:14] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 25 ms.
[2026-05-23 09:13:14] [INFO ] Added : 111 causal constraints over 23 iterations in 613 ms. Result :sat
Minimization took 173 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:13:15] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2026-05-23 09:13:15] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 33 ms returned sat
[2026-05-23 09:13:15] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2026-05-23 09:13:15] [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:13:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2026-05-23 09:13:15] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 33 ms returned sat
[2026-05-23 09:13:15] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:13:15] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 6 ms to minimize.
[2026-05-23 09:13:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2026-05-23 09:13:15] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 23 ms.
[2026-05-23 09:13:16] [INFO ] Added : 125 causal constraints over 25 iterations in 830 ms. Result :sat
Minimization took 194 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:13:16] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2026-05-23 09:13:16] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 33 ms returned sat
[2026-05-23 09:13:17] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2026-05-23 09:13:17] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 22 ms.
[2026-05-23 09:13:17] [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:13:17] [INFO ] [Nat]Absence check using 35 positive place invariants in 17 ms returned sat
[2026-05-23 09:13:17] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 33 ms returned sat
[2026-05-23 09:13:17] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2026-05-23 09:13:17] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 28 ms.
[2026-05-23 09:13:18] [INFO ] Added : 161 causal constraints over 33 iterations in 1125 ms. Result :sat
Minimization took 183 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 183/183 transitions.
Applied a total of 0 rules in 14 ms. Remains 240 /240 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 240/240 places, 183/183 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 183/183 transitions.
Applied a total of 0 rules in 14 ms. Remains 240 /240 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2026-05-23 09:13:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:13:20] [INFO ] Implicit Places using invariants in 306 ms returned []
[2026-05-23 09:13:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:13:21] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 09:13:21] [INFO ] Redundant transitions in 13 ms returned []
Running 180 sub problems to find dead transitions.
[2026-05-23 09:13:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 180 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3/240 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 183/423 variables, 240/303 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:13:27] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:13:29] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:13:29] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 3/306 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:13:31] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:13:34] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:13:34] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:13:34] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 16 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 3/310 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (OVERLAPS) 0/423 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 310 constraints, problems are : Problem set: 0 solved, 180 unsolved in 24280 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 3/240 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 183/423 variables, 240/310 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 180/490 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 490 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54588ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 54605ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55493 ms. Remains : 240/240 places, 183/183 transitions.
RANDOM walk for 40000 steps (1886 resets) in 1414 ms. (28 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (364 resets) in 314 ms. (126 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (381 resets) in 224 ms. (177 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (370 resets) in 187 ms. (212 steps per ms) remains 6/6 properties
[2026-05-23 09:14:16] [INFO ] Flatten gal took : 177 ms
BEST_FIRST walk for 40004 steps (367 resets) in 320 ms. (124 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (350 resets) in 171 ms. (232 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (347 resets) in 161 ms. (246 steps per ms) remains 6/6 properties
[2026-05-23 09:14:16] [INFO ] Flatten gal took : 118 ms
[2026-05-23 09:14:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8036262224117398576.gal : 45 ms
[2026-05-23 09:14:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6580808203304079513.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/ReachabilityCardinality8036262224117398576.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6580808203304079513.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 ...328
Loading property file /tmp/ReachabilityCardinality6580808203304079513.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :4 after 36
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :36 after 40
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :40 after 160
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :160 after 1236
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :1236 after 28040
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :28040 after 190228
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :190228 after 333544
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :333544 after 984880
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :2.99798e+09 after 2.99864e+09
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :2.99864e+09 after 3.00808e+09
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :2.78314e+10 after 2.78369e+10
Interrupted probabilistic random walk after 414001 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :2 out of 6
Probabilistic random walk after 414001 steps, saw 104895 distinct states, run finished after 3012 ms. (steps per millisecond=137 ) properties seen :2
[2026-05-23 09:14:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 159/161 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 35/196 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:14:19] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 25/221 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 7/228 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 179/407 variables, 228/287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 14/421 variables, 10/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/421 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/421 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/423 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/423 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/423 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 304 constraints, problems are : Problem set: 0 solved, 4 unsolved in 886 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 159/161 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,6 properties remain. new max is 32768
At refinement iteration 3 (OVERLAPS) 35/196 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD size :7.37836e+10 after 7.51152e+10
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 25/221 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 7/228 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 179/407 variables, 228/287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/407 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 14/421 variables, 10/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/421 variables, 4/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/421 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/421 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/423 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/423 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/423 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/423 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 308 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1360 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2257ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :2.54952e+11 after 2.54991e+11
Parikh walk visited 0 properties in 3146 ms.
Support contains 2 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 183/183 transitions.
Applied a total of 0 rules in 14 ms. Remains 240 /240 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 240/240 places, 183/183 transitions.
RANDOM walk for 40000 steps (1944 resets) in 282 ms. (141 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (384 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (361 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (346 resets) in 172 ms. (231 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (373 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 402911 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :0 out of 4
Probabilistic random walk after 402911 steps, saw 102283 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
[2026-05-23 09:14:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 159/161 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 35/196 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:14:28] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 25/221 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 7/228 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 179/407 variables, 228/287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 14/421 variables, 10/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/421 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/421 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/423 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/423 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/423 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 304 constraints, problems are : Problem set: 0 solved, 4 unsolved in 762 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 159/161 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 35/196 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 25/221 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 7/228 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 179/407 variables, 228/287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/407 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 14/421 variables, 10/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/421 variables, 4/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/421 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/421 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/423 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/423 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/423 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/423 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 308 constraints, problems are : Problem set: 0 solved, 4 unsolved in 812 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1586ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
SDD proceeding with computation,6 properties remain. new max is 131072
SDD size :6.53499e+11 after 6.58451e+11
Parikh walk visited 0 properties in 2378 ms.
Support contains 2 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 183/183 transitions.
Applied a total of 0 rules in 17 ms. Remains 240 /240 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 240/240 places, 183/183 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 183/183 transitions.
Applied a total of 0 rules in 10 ms. Remains 240 /240 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2026-05-23 09:14:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:14:32] [INFO ] Implicit Places using invariants in 232 ms returned []
[2026-05-23 09:14:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:14:33] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 09:14:33] [INFO ] Redundant transitions in 7 ms returned []
Running 180 sub problems to find dead transitions.
[2026-05-23 09:14:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 180 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3/240 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 183/423 variables, 240/303 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:14:38] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:14:39] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:14:39] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 3/306 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:14:40] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:14:43] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:14:43] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:14:43] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 3/310 constraints. Problems are: Problem set: 0 solved, 180 unsolved
SDD proceeding with computation,6 properties remain. new max is 262144
SDD size :1.5349e+12 after 1.53522e+12
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (OVERLAPS) 0/423 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 310 constraints, problems are : Problem set: 0 solved, 180 unsolved in 20431 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 3/240 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 183/423 variables, 240/310 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Detected timeout of ITS tools.
[2026-05-23 09:15:06] [INFO ] Flatten gal took : 28 ms
[2026-05-23 09:15:06] [INFO ] Applying decomposition
[2026-05-23 09:15:06] [INFO ] Flatten gal took : 28 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/graph9019054640941880824.txt' '-o' '/tmp/graph9019054640941880824.bin' '-w' '/tmp/graph9019054640941880824.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9019054640941880824.bin' '-l' '-1' '-v' '-w' '/tmp/graph9019054640941880824.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:15:07] [INFO ] Decomposing Gal with order
[2026-05-23 09:15:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:15:07] [INFO ] Removed a total of 66 redundant transitions.
[2026-05-23 09:15:07] [INFO ] Flatten gal took : 174 ms
[2026-05-23 09:15:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 30 ms.
[2026-05-23 09:15:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5011296714721391587.gal : 13 ms
[2026-05-23 09:15:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12271187396676459232.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/ReachabilityCardinality5011296714721391587.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12271187396676459232.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/ReachabilityCardinality12271187396676459232.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 194
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :194 after 4132
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :4132 after 50736
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :50736 after 2.53939e+09
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :2.53939e+09 after 4.4245e+09
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :4.4245e+09 after 7.25216e+09
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :7.25216e+09 after 3.3398e+10
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :9.30852e+12 after 1.01671e+13
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.36889e+13,4.80116,143644,18767,3000,426641,6792,341,273912,312,38954,0
Total reachable state count : 23688949534766

Verifying 4 reachability properties.
Reachability property MAX1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,1.57092e+08,4.82373,143644,518,271,426641,6792,343,273912,315,38954,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,1.57092e+08,4.83066,143644,518,271,426641,6792,347,273912,317,38954,0
Reachability property MAX2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,3.09658e+06,4.83769,143644,88,192,426641,6792,347,273912,318,38954,0
Invariant property MIN2 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,3.09658e+06,4.84553,143644,88,192,426641,6792,349,273912,319,38954,0
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 180/490 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 490 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50578ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 50580ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51299 ms. Remains : 240/240 places, 183/183 transitions.
FORMULA DES-PT-30b-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-30b-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-30b-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 3 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 156321 ms.

BK_STOP 1779527723703

--------------------
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-30b"
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-30b, 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-177946996300051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-30b.tgz
mv DES-PT-30b 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;