About the Execution of 2024-gold for SieveSingleMsgMbox-PT-d2m36
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15684.580 | 1811980.00 | 1877129.00 | 5766.50 | 0 0 1 0 0 0 0 0 32 1 1 0 0 0 0 0 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r223-tall-174902009200060.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is SieveSingleMsgMbox-PT-d2m36, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-174902009200060
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.1M May 29 14:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1749106873274
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m36
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-05 07:01:14] [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]
[2025-06-05 07:01:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 07:01:14] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2025-06-05 07:01:14] [INFO ] Transformed 2398 places.
[2025-06-05 07:01:14] [INFO ] Transformed 1954 transitions.
[2025-06-05 07:01:14] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 271 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1984 places in 16 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 1954 rows 414 cols
[2025-06-05 07:01:14] [INFO ] Computed 6 invariants in 77 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[42, 87, 1, 42, 1]
RANDOM walk for 10000 steps (2190 resets) in 290 ms. (34 steps per ms)
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (3697 resets) in 220 ms. (181 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[42, 87, 42, 1]
[2025-06-05 07:01:15] [INFO ] Invariant cache hit.
[2025-06-05 07:01:15] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-05 07:01:15] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 13 ms returned sat
[2025-06-05 07:01:16] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2025-06-05 07:01:16] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2025-06-05 07:01:16] [INFO ] [Real]Added 1674 Read/Feed constraints in 301 ms returned sat
[2025-06-05 07:01:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:01:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-05 07:01:16] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2025-06-05 07:01:17] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2025-06-05 07:01:17] [INFO ] [Nat]Added 1674 Read/Feed constraints in 458 ms returned sat
[2025-06-05 07:01:17] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 288 ms.
[2025-06-05 07:01:18] [INFO ] Added : 28 causal constraints over 6 iterations in 962 ms. Result :sat
Minimization took 538 ms.
[2025-06-05 07:01:19] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 07:01:19] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-05 07:01:19] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2025-06-05 07:01:19] [INFO ] [Real]Added 1674 Read/Feed constraints in 297 ms returned sat
[2025-06-05 07:01:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:01:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 07:01:20] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2025-06-05 07:01:20] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2025-06-05 07:01:20] [INFO ] [Nat]Added 1674 Read/Feed constraints in 494 ms returned sat
[2025-06-05 07:01:21] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 157 ms.
[2025-06-05 07:01:21] [INFO ] Added : 28 causal constraints over 6 iterations in 957 ms. Result :sat
Minimization took 534 ms.
[2025-06-05 07:01:22] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 07:01:22] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-05 07:01:22] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2025-06-05 07:01:23] [INFO ] [Real]Added 1674 Read/Feed constraints in 337 ms returned sat
[2025-06-05 07:01:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:01:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 07:01:23] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 07:01:23] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2025-06-05 07:01:23] [INFO ] [Nat]Added 1674 Read/Feed constraints in 370 ms returned sat
[2025-06-05 07:01:24] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 167 ms.
[2025-06-05 07:01:24] [INFO ] Added : 14 causal constraints over 3 iterations in 626 ms. Result :sat
Minimization took 533 ms.
[2025-06-05 07:01:25] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 07:01:25] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 07:01:25] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2025-06-05 07:01:25] [INFO ] [Real]Added 1674 Read/Feed constraints in 321 ms returned sat
[2025-06-05 07:01:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:01:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 07:01:25] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-05 07:01:26] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2025-06-05 07:01:26] [INFO ] [Nat]Added 1674 Read/Feed constraints in 428 ms returned sat
[2025-06-05 07:01:26] [INFO ] Deduced a trap composed of 159 places in 210 ms of which 23 ms to minimize.
[2025-06-05 07:01:27] [INFO ] Deduced a trap composed of 175 places in 191 ms of which 3 ms to minimize.
[2025-06-05 07:01:27] [INFO ] Deduced a trap composed of 175 places in 184 ms of which 4 ms to minimize.
[2025-06-05 07:01:27] [INFO ] Deduced a trap composed of 241 places in 185 ms of which 3 ms to minimize.
[2025-06-05 07:01:28] [INFO ] Deduced a trap composed of 260 places in 167 ms of which 3 ms to minimize.
[2025-06-05 07:01:28] [INFO ] Deduced a trap composed of 263 places in 170 ms of which 2 ms to minimize.
[2025-06-05 07:01:28] [INFO ] Deduced a trap composed of 265 places in 183 ms of which 2 ms to minimize.
[2025-06-05 07:01:29] [INFO ] Deduced a trap composed of 257 places in 159 ms of which 2 ms to minimize.
[2025-06-05 07:01:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 2670 ms
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[42, 87, 42, 0]
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[42, 87, 42]
Support contains 3 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.5 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 119 places :
Symmetric choice reduction at 1 with 119 rule applications. Total rules 950 place count 269 transition count 372
Iterating global reduction 1 with 119 rules applied. Total rules applied 1069 place count 269 transition count 372
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1079 place count 269 transition count 362
Discarding 91 places :
Symmetric choice reduction at 2 with 91 rule applications. Total rules 1170 place count 178 transition count 271
Iterating global reduction 2 with 91 rules applied. Total rules applied 1261 place count 178 transition count 271
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 1296 place count 178 transition count 236
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 1332 place count 142 transition count 188
Iterating global reduction 3 with 36 rules applied. Total rules applied 1368 place count 142 transition count 188
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 1389 place count 142 transition count 167
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1397 place count 134 transition count 154
Iterating global reduction 4 with 8 rules applied. Total rules applied 1405 place count 134 transition count 154
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1413 place count 126 transition count 146
Iterating global reduction 4 with 8 rules applied. Total rules applied 1421 place count 126 transition count 146
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1425 place count 122 transition count 141
Iterating global reduction 4 with 4 rules applied. Total rules applied 1429 place count 122 transition count 141
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1433 place count 118 transition count 137
Iterating global reduction 4 with 4 rules applied. Total rules applied 1437 place count 118 transition count 137
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1441 place count 114 transition count 133
Iterating global reduction 4 with 4 rules applied. Total rules applied 1445 place count 114 transition count 133
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1447 place count 112 transition count 129
Iterating global reduction 4 with 2 rules applied. Total rules applied 1449 place count 112 transition count 129
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1450 place count 111 transition count 128
Iterating global reduction 4 with 1 rules applied. Total rules applied 1451 place count 111 transition count 128
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1452 place count 110 transition count 127
Iterating global reduction 4 with 1 rules applied. Total rules applied 1453 place count 110 transition count 127
Applied a total of 1453 rules in 117 ms. Remains 110 /414 variables (removed 304) and now considering 127/1954 (removed 1827) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 110/414 places, 127/1954 transitions.
// Phase 1: matrix 127 rows 110 cols
[2025-06-05 07:01:29] [INFO ] Computed 4 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[42, 36, 42]
RANDOM walk for 1000000 steps (224551 resets) in 943 ms. (1059 steps per ms)
BEST_FIRST walk for 3000001 steps (309045 resets) in 1395 ms. (2148 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[42, 36, 42]
[2025-06-05 07:01:31] [INFO ] Invariant cache hit.
[2025-06-05 07:01:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 07:01:31] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 7 ms returned sat
[2025-06-05 07:01:31] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-05 07:01:31] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-05 07:01:31] [INFO ] [Real]Added 48 Read/Feed constraints in 14 ms returned sat
[2025-06-05 07:01:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:01:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-05 07:01:31] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-05 07:01:31] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-05 07:01:31] [INFO ] [Nat]Added 48 Read/Feed constraints in 10 ms returned sat
[2025-06-05 07:01:31] [INFO ] Computed and/alt/rep : 29/83/29 causal constraints (skipped 97 transitions) in 6 ms.
[2025-06-05 07:01:31] [INFO ] Added : 16 causal constraints over 4 iterations in 53 ms. Result :sat
Minimization took 62 ms.
[2025-06-05 07:01:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 07:01:32] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-05 07:01:32] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-05 07:01:32] [INFO ] [Real]Added 48 Read/Feed constraints in 6 ms returned sat
[2025-06-05 07:01:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:01:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-05 07:01:32] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2025-06-05 07:01:32] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-06-05 07:01:32] [INFO ] [Nat]Added 48 Read/Feed constraints in 12 ms returned sat
[2025-06-05 07:01:32] [INFO ] Computed and/alt/rep : 29/83/29 causal constraints (skipped 97 transitions) in 6 ms.
[2025-06-05 07:01:32] [INFO ] Added : 15 causal constraints over 4 iterations in 59 ms. Result :sat
Minimization took 92 ms.
[2025-06-05 07:01:32] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-05 07:01:32] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2025-06-05 07:01:32] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-05 07:01:32] [INFO ] [Real]Added 48 Read/Feed constraints in 11 ms returned sat
[2025-06-05 07:01:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:01:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 07:01:32] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-05 07:01:32] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-05 07:01:32] [INFO ] [Nat]Added 48 Read/Feed constraints in 12 ms returned sat
[2025-06-05 07:01:32] [INFO ] Computed and/alt/rep : 29/83/29 causal constraints (skipped 97 transitions) in 9 ms.
[2025-06-05 07:01:32] [INFO ] Added : 15 causal constraints over 3 iterations in 49 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[42, 36, 42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[42, 36, 42]
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 127/127 transitions.
Applied a total of 0 rules in 7 ms. Remains 110 /110 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 110/110 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 127/127 transitions.
Applied a total of 0 rules in 8 ms. Remains 110 /110 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2025-06-05 07:01:32] [INFO ] Invariant cache hit.
[2025-06-05 07:01:32] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-05 07:01:32] [INFO ] Invariant cache hit.
[2025-06-05 07:01:32] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-05 07:01:32] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2025-06-05 07:01:32] [INFO ] Redundant transitions in 4 ms returned []
Running 126 sub problems to find dead transitions.
[2025-06-05 07:01:32] [INFO ] Invariant cache hit.
[2025-06-05 07:01:32] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 1/110 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 127/237 variables, 110/114 constraints. Problems are: Problem set: 0 solved, 126 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 48/162 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 0/237 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 162 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3143 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 1/110 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 127/237 variables, 110/114 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 48/162 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 126/288 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2025-06-05 07:01:38] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD113 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 1/289 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 0/289 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 0/237 variables, 0/289 constraints. Problems are: Problem set: 3 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 289 constraints, problems are : Problem set: 3 solved, 123 unsolved in 8245 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 1/1 constraints]
After SMT, in 11564ms problems are : Problem set: 3 solved, 123 unsolved
Search for dead transitions found 3 dead transitions in 11574ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 110/110 places, 124/127 transitions.
Graph (complete) has 309 edges and 110 vertex of which 107 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 107 /110 variables (removed 3) and now considering 124/124 (removed 0) transitions.
// Phase 1: matrix 124 rows 107 cols
[2025-06-05 07:01:44] [INFO ] Computed 3 invariants in 2 ms
[2025-06-05 07:01:44] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-05 07:01:44] [INFO ] Invariant cache hit.
[2025-06-05 07:01:44] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-05 07:01:44] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 107/110 places, 124/127 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 12063 ms. Remains : 107/110 places, 124/127 transitions.
[2025-06-05 07:01:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[42, 36, 42]
RANDOM walk for 1000000 steps (224846 resets) in 940 ms. (1062 steps per ms)
BEST_FIRST walk for 3000002 steps (310236 resets) in 1432 ms. (2093 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[42, 36, 42]
[2025-06-05 07:01:47] [INFO ] Invariant cache hit.
[2025-06-05 07:01:47] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 07:01:47] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-05 07:01:47] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-05 07:01:47] [INFO ] [Real]Added 47 Read/Feed constraints in 6 ms returned sat
[2025-06-05 07:01:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:01:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 07:01:47] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-05 07:01:47] [INFO ] [Nat]Added 47 Read/Feed constraints in 13 ms returned sat
[2025-06-05 07:01:47] [INFO ] Computed and/alt/rep : 28/78/28 causal constraints (skipped 95 transitions) in 9 ms.
[2025-06-05 07:01:47] [INFO ] Added : 15 causal constraints over 4 iterations in 58 ms. Result :sat
Minimization took 47 ms.
[2025-06-05 07:01:47] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 07:01:47] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-05 07:01:47] [INFO ] [Real]Added 47 Read/Feed constraints in 6 ms returned sat
[2025-06-05 07:01:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:01:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 07:01:47] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-05 07:01:47] [INFO ] [Nat]Added 47 Read/Feed constraints in 12 ms returned sat
[2025-06-05 07:01:47] [INFO ] Computed and/alt/rep : 28/78/28 causal constraints (skipped 95 transitions) in 6 ms.
[2025-06-05 07:01:47] [INFO ] Added : 15 causal constraints over 3 iterations in 47 ms. Result :sat
Minimization took 77 ms.
[2025-06-05 07:01:47] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 07:01:47] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-05 07:01:47] [INFO ] [Real]Added 47 Read/Feed constraints in 8 ms returned sat
[2025-06-05 07:01:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:01:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 07:01:47] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-05 07:01:47] [INFO ] [Nat]Added 47 Read/Feed constraints in 12 ms returned sat
[2025-06-05 07:01:47] [INFO ] Computed and/alt/rep : 28/78/28 causal constraints (skipped 95 transitions) in 8 ms.
[2025-06-05 07:01:47] [INFO ] Added : 12 causal constraints over 3 iterations in 51 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[42, 36, 42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[42, 36, 42]
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 124/124 transitions.
Applied a total of 0 rules in 8 ms. Remains 107 /107 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 107/107 places, 124/124 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 124/124 transitions.
Applied a total of 0 rules in 11 ms. Remains 107 /107 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2025-06-05 07:01:47] [INFO ] Invariant cache hit.
[2025-06-05 07:01:48] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-05 07:01:48] [INFO ] Invariant cache hit.
[2025-06-05 07:01:48] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-05 07:01:48] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2025-06-05 07:01:48] [INFO ] Redundant transitions in 3 ms returned []
Running 123 sub problems to find dead transitions.
[2025-06-05 07:01:48] [INFO ] Invariant cache hit.
[2025-06-05 07:01:48] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD108 is UNSAT
At refinement iteration 4 (OVERLAPS) 124/231 variables, 107/110 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 47/157 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/157 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/231 variables, 0/157 constraints. Problems are: Problem set: 3 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 157 constraints, problems are : Problem set: 3 solved, 120 unsolved in 3239 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 107/107 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 123/227 variables, 104/107 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 46/153 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 15/168 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/168 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 4/231 variables, 3/171 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 1/172 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 105/277 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 0/277 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 12 (OVERLAPS) 0/231 variables, 0/277 constraints. Problems are: Problem set: 3 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 277 constraints, problems are : Problem set: 3 solved, 120 unsolved in 7607 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 107/107 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 120/123 constraints, Known Traps: 0/0 constraints]
After SMT, in 10979ms problems are : Problem set: 3 solved, 120 unsolved
Search for dead transitions found 3 dead transitions in 10982ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 107/107 places, 121/124 transitions.
Graph (complete) has 300 edges and 107 vertex of which 104 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 104 /107 variables (removed 3) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 104 cols
[2025-06-05 07:01:59] [INFO ] Computed 3 invariants in 3 ms
[2025-06-05 07:01:59] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-05 07:01:59] [INFO ] Invariant cache hit.
[2025-06-05 07:01:59] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-05 07:01:59] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 104/107 places, 121/124 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11463 ms. Remains : 104/107 places, 121/124 transitions.
[2025-06-05 07:01:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[42, 36, 42]
RANDOM walk for 1000000 steps (224118 resets) in 850 ms. (1175 steps per ms)
BEST_FIRST walk for 3000003 steps (310282 resets) in 1307 ms. (2293 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[42, 36, 42]
[2025-06-05 07:02:01] [INFO ] Invariant cache hit.
[2025-06-05 07:02:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 07:02:01] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 07:02:01] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-05 07:02:01] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-05 07:02:01] [INFO ] [Real]Added 46 Read/Feed constraints in 9 ms returned sat
[2025-06-05 07:02:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:02:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 07:02:01] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 07:02:01] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-05 07:02:01] [INFO ] [Nat]Added 46 Read/Feed constraints in 8 ms returned sat
[2025-06-05 07:02:01] [INFO ] Computed and/alt/rep : 27/73/27 causal constraints (skipped 93 transitions) in 7 ms.
[2025-06-05 07:02:01] [INFO ] Added : 16 causal constraints over 4 iterations in 54 ms. Result :sat
Minimization took 53 ms.
[2025-06-05 07:02:01] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-05 07:02:01] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-05 07:02:01] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-05 07:02:01] [INFO ] [Real]Added 46 Read/Feed constraints in 6 ms returned sat
[2025-06-05 07:02:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:02:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 07:02:01] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 07:02:01] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-05 07:02:01] [INFO ] [Nat]Added 46 Read/Feed constraints in 9 ms returned sat
[2025-06-05 07:02:01] [INFO ] Computed and/alt/rep : 27/73/27 causal constraints (skipped 93 transitions) in 6 ms.
[2025-06-05 07:02:02] [INFO ] Added : 15 causal constraints over 3 iterations in 43 ms. Result :sat
Minimization took 89 ms.
[2025-06-05 07:02:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 07:02:02] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 07:02:02] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-05 07:02:02] [INFO ] [Real]Added 46 Read/Feed constraints in 7 ms returned sat
[2025-06-05 07:02:02] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:02:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 07:02:02] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 07:02:02] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-05 07:02:02] [INFO ] [Nat]Added 46 Read/Feed constraints in 10 ms returned sat
[2025-06-05 07:02:02] [INFO ] Computed and/alt/rep : 27/73/27 causal constraints (skipped 93 transitions) in 6 ms.
[2025-06-05 07:02:02] [INFO ] Added : 12 causal constraints over 3 iterations in 36 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[42, 36, 42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[42, 36, 42]
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 121/121 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 104/104 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 121/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2025-06-05 07:02:02] [INFO ] Invariant cache hit.
[2025-06-05 07:02:02] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-05 07:02:02] [INFO ] Invariant cache hit.
[2025-06-05 07:02:02] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-05 07:02:02] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2025-06-05 07:02:02] [INFO ] Redundant transitions in 2 ms returned []
Running 120 sub problems to find dead transitions.
[2025-06-05 07:02:02] [INFO ] Invariant cache hit.
[2025-06-05 07:02:02] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 121/225 variables, 104/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 46/153 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/225 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 153 constraints, problems are : Problem set: 0 solved, 120 unsolved in 2555 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 121/225 variables, 104/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 46/153 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 120/273 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/225 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 273 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5207 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 7871ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 7873ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8078 ms. Remains : 104/104 places, 121/121 transitions.
RANDOM walk for 40000 steps (8890 resets) in 966 ms. (41 steps per ms) remains 6/6 properties
[2025-06-05 07:02:10] [INFO ] Flatten gal took : 76 ms
[2025-06-05 07:02:10] [INFO ] Flatten gal took : 17 ms
BEST_FIRST walk for 40001 steps (4183 resets) in 275 ms. (144 steps per ms) remains 6/6 properties
[2025-06-05 07:02:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17244303595690222020.gal : 22 ms
[2025-06-05 07:02:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17981902248606064213.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17244303595690222020.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17981902248606064213.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality17981902248606064213.prop.
BEST_FIRST walk for 40003 steps (4109 resets) in 372 ms. (107 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :7 after 41
BEST_FIRST walk for 40004 steps (4106 resets) in 137 ms. (289 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :41 after 194
BEST_FIRST walk for 40000 steps (4214 resets) in 95 ms. (416 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :194 after 214
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :214 after 750
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :750 after 2850
Invariant property MIN2 does not hold.
Invariant property MIN0 does not hold.
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :2850 after 4102
BEST_FIRST walk for 40002 steps (4271 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :4102 after 19918
BEST_FIRST walk for 40002 steps (4127 resets) in 117 ms. (339 steps per ms) remains 6/6 properties
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :19918 after 53480
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :53480 after 119819
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :119819 after 858559
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :858559 after 1.43952e+07
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1.43952e+07 after 2.28156e+08
Interrupted probabilistic random walk after 818043 steps, run timeout after 3001 ms. (steps per millisecond=272 ) properties seen :3 out of 6
Probabilistic random walk after 818043 steps, saw 357932 distinct states, run finished after 3006 ms. (steps per millisecond=272 ) properties seen :3
[2025-06-05 07:02:14] [INFO ] Invariant cache hit.
[2025-06-05 07:02:14] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 49/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/60 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 79/139 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2025-06-05 07:02:14] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem MAX0 is UNSAT
Problem MAX2 is UNSAT
At refinement iteration 10 (OVERLAPS) 60/199 variables, 23/87 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 41/128 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2025-06-05 07:02:14] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 1/129 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/199 variables, 0/129 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem MAX1 is UNSAT
After SMT solving in domain Real declared 225/225 variables, and 150 constraints, problems are : Problem set: 3 solved, 0 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 41/46 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 239ms problems are : Problem set: 3 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.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0] Max Struct:[42, 36, 42]
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m36-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[42]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[42]
[2025-06-05 07:02:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[42]
RANDOM walk for 10000 steps (2250 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10001 steps (1002 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[42]
[2025-06-05 07:02:14] [INFO ] Invariant cache hit.
[2025-06-05 07:02:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 07:02:14] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 07:02:14] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-05 07:02:14] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-05 07:02:14] [INFO ] [Real]Added 46 Read/Feed constraints in 7 ms returned sat
[2025-06-05 07:02:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:02:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 07:02:14] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 07:02:14] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-05 07:02:14] [INFO ] [Nat]Added 46 Read/Feed constraints in 8 ms returned sat
[2025-06-05 07:02:14] [INFO ] Computed and/alt/rep : 27/73/27 causal constraints (skipped 93 transitions) in 7 ms.
[2025-06-05 07:02:14] [INFO ] Added : 16 causal constraints over 4 iterations in 53 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[42]
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 121/121 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 102 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 102 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 102 transition count 117
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 100 transition count 114
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 100 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 100 transition count 113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 99 transition count 112
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 99 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 98 transition count 111
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 98 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 98 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 97 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 97 transition count 109
Applied a total of 17 rules in 12 ms. Remains 97 /104 variables (removed 7) and now considering 109/121 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 97/104 places, 109/121 transitions.
// Phase 1: matrix 109 rows 97 cols
[2025-06-05 07:02:14] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[42]
RANDOM walk for 1000000 steps (224568 resets) in 788 ms. (1267 steps per ms)
BEST_FIRST walk for 1000001 steps (103322 resets) in 404 ms. (2469 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[42]
[2025-06-05 07:02:15] [INFO ] Invariant cache hit.
[2025-06-05 07:02:16] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 07:02:16] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-05 07:02:16] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-05 07:02:16] [INFO ] [Real]Added 41 Read/Feed constraints in 8 ms returned sat
[2025-06-05 07:02:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:02:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 07:02:16] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-05 07:02:16] [INFO ] [Nat]Added 41 Read/Feed constraints in 7 ms returned sat
[2025-06-05 07:02:16] [INFO ] Computed and/alt/rep : 25/64/25 causal constraints (skipped 83 transitions) in 5 ms.
[2025-06-05 07:02:16] [INFO ] Added : 15 causal constraints over 3 iterations in 39 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[42]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 97/97 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2025-06-05 07:02:16] [INFO ] Invariant cache hit.
[2025-06-05 07:02:16] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-05 07:02:16] [INFO ] Invariant cache hit.
[2025-06-05 07:02:16] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-05 07:02:16] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2025-06-05 07:02:16] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2025-06-05 07:02:16] [INFO ] Invariant cache hit.
[2025-06-05 07:02:16] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/206 variables, 97/100 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 41/141 constraints. Problems are: Problem set: 0 solved, 108 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/206 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 141 constraints, problems are : Problem set: 0 solved, 108 unsolved in 2118 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/206 variables, 97/100 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 41/141 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 108/249 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/206 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 249 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4398 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 6612ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 6616ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6815 ms. Remains : 97/97 places, 109/109 transitions.
[2025-06-05 07:02:23] [INFO ] Flatten gal took : 12 ms
RANDOM walk for 40000 steps (8972 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
[2025-06-05 07:02:23] [INFO ] Flatten gal took : 15 ms
[2025-06-05 07:02:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10757936479435733344.gal : 3 ms
[2025-06-05 07:02:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15794738307004960910.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10757936479435733344.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15794738307004960910.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality15794738307004960910.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 41
BEST_FIRST walk for 40004 steps (4212 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (4130 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :41 after 194
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :194 after 214
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :214 after 776
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :776 after 2672
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2672 after 4088
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4088 after 21168
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :21168 after 40350
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :40350 after 251976
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :251976 after 1.95423e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.95423e+06 after 1.3275e+07
Interrupted probabilistic random walk after 2967959 steps, run timeout after 3001 ms. (steps per millisecond=988 ) properties seen :1 out of 2
Probabilistic random walk after 2967959 steps, saw 1431564 distinct states, run finished after 3001 ms. (steps per millisecond=988 ) properties seen :1
[2025-06-05 07:02:26] [INFO ] Invariant cache hit.
[2025-06-05 07:02:26] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 84/87 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 45/132 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/140 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 206/206 variables, and 113 constraints, problems are : Problem set: 1 solved, 0 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 13/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 98ms problems are : Problem set: 1 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.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[42]
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m36-UpperBounds-02 in 11759 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m36-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[36]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[36]
// Phase 1: matrix 121 rows 104 cols
[2025-06-05 07:02:26] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[36]
RANDOM walk for 10000 steps (2272 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10000 steps (1007 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[36]
[2025-06-05 07:02:26] [INFO ] Invariant cache hit.
[2025-06-05 07:02:26] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-05 07:02:26] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 07:02:26] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-05 07:02:26] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-05 07:02:26] [INFO ] [Real]Added 46 Read/Feed constraints in 7 ms returned sat
[2025-06-05 07:02:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:02:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 07:02:26] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 07:02:26] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-05 07:02:26] [INFO ] [Nat]Added 46 Read/Feed constraints in 9 ms returned sat
[2025-06-05 07:02:26] [INFO ] Computed and/alt/rep : 27/73/27 causal constraints (skipped 93 transitions) in 7 ms.
[2025-06-05 07:02:26] [INFO ] Added : 15 causal constraints over 3 iterations in 49 ms. Result :sat
Minimization took 88 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[36]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[36]
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 121/121 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 102 transition count 119
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 102 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 102 transition count 118
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 100 transition count 114
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 100 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 100 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 99 transition count 111
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 99 transition count 111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 98 transition count 110
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 98 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 97 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 97 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 97 transition count 108
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 96 transition count 107
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 96 transition count 107
Applied a total of 20 rules in 18 ms. Remains 96 /104 variables (removed 8) and now considering 107/121 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 96/104 places, 107/121 transitions.
// Phase 1: matrix 107 rows 96 cols
[2025-06-05 07:02:26] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[36]
RANDOM walk for 1000000 steps (224427 resets) in 781 ms. (1278 steps per ms)
BEST_FIRST walk for 1000000 steps (103690 resets) in 405 ms. (2463 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[36]
[2025-06-05 07:02:27] [INFO ] Invariant cache hit.
[2025-06-05 07:02:27] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 07:02:27] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-05 07:02:27] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-05 07:02:27] [INFO ] [Real]Added 41 Read/Feed constraints in 5 ms returned sat
[2025-06-05 07:02:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:02:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 07:02:27] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-05 07:02:27] [INFO ] [Nat]Added 41 Read/Feed constraints in 9 ms returned sat
[2025-06-05 07:02:27] [INFO ] Computed and/alt/rep : 24/61/24 causal constraints (skipped 82 transitions) in 6 ms.
[2025-06-05 07:02:27] [INFO ] Added : 12 causal constraints over 3 iterations in 35 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[36]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[36]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 107/107 transitions.
Applied a total of 0 rules in 6 ms. Remains 96 /96 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 96/96 places, 107/107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 107/107 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2025-06-05 07:02:28] [INFO ] Invariant cache hit.
[2025-06-05 07:02:28] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-05 07:02:28] [INFO ] Invariant cache hit.
[2025-06-05 07:02:28] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-05 07:02:28] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2025-06-05 07:02:28] [INFO ] Redundant transitions in 1 ms returned []
Running 106 sub problems to find dead transitions.
[2025-06-05 07:02:28] [INFO ] Invariant cache hit.
[2025-06-05 07:02:28] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/203 variables, 96/99 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 41/140 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/203 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 140 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2265 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 96/96 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/203 variables, 96/99 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 41/140 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 106/246 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/203 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 246 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4589 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 96/96 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 6936ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 6937ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7126 ms. Remains : 96/96 places, 107/107 transitions.
[2025-06-05 07:02:35] [INFO ] Flatten gal took : 14 ms
[2025-06-05 07:02:35] [INFO ] Flatten gal took : 8 ms
RANDOM walk for 40000 steps (8912 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
[2025-06-05 07:02:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9769541680356859703.gal : 9 ms
[2025-06-05 07:02:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9848359848984672698.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9769541680356859703.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9848359848984672698.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (4170 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality9848359848984672698.prop.
BEST_FIRST walk for 40002 steps (4035 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 41
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :41 after 194
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :194 after 218
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :218 after 914
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :914 after 2672
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2672 after 3640
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3640 after 36334
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :36334 after 58459
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :58459 after 526875
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :526875 after 1.05469e+07
Interrupted probabilistic random walk after 3095135 steps, run timeout after 3001 ms. (steps per millisecond=1031 ) properties seen :1 out of 2
Probabilistic random walk after 3095135 steps, saw 1277573 distinct states, run finished after 3001 ms. (steps per millisecond=1031 ) properties seen :1
[2025-06-05 07:02:38] [INFO ] Invariant cache hit.
[2025-06-05 07:02:38] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/55 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 68/123 variables, 55/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-05 07:02:38] [INFO ] Deduced a trap composed of 29 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 40/163 variables, 18/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 24/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-05 07:02:38] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.05469e+07 after 1.22498e+08
[2025-06-05 07:02:38] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 163/203 variables, and 103 constraints, problems are : Problem set: 1 solved, 0 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/96 constraints, ReadFeed: 24/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 179ms problems are : Problem set: 1 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.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[36]
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m36-UpperBounds-08 in 12169 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m36-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[42]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[42]
// Phase 1: matrix 121 rows 104 cols
[2025-06-05 07:02:38] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[42]
RANDOM walk for 10000 steps (2206 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10000 steps (1052 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[42]
[2025-06-05 07:02:38] [INFO ] Invariant cache hit.
[2025-06-05 07:02:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 07:02:38] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 07:02:38] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-05 07:02:38] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-05 07:02:38] [INFO ] [Real]Added 46 Read/Feed constraints in 7 ms returned sat
[2025-06-05 07:02:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:02:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 07:02:38] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 07:02:38] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-05 07:02:38] [INFO ] [Nat]Added 46 Read/Feed constraints in 8 ms returned sat
[2025-06-05 07:02:38] [INFO ] Computed and/alt/rep : 27/73/27 causal constraints (skipped 93 transitions) in 6 ms.
[2025-06-05 07:02:38] [INFO ] Added : 12 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[42]
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 121/121 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 102 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 102 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 102 transition count 116
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 100 transition count 113
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 100 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 100 transition count 112
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 98 transition count 110
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 98 transition count 110
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 96 transition count 108
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 96 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 96 transition count 107
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 22 place count 94 transition count 105
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 94 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 25 place count 94 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 26 place count 93 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 93 transition count 103
Applied a total of 27 rules in 10 ms. Remains 93 /104 variables (removed 11) and now considering 103/121 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 93/104 places, 103/121 transitions.
// Phase 1: matrix 103 rows 93 cols
[2025-06-05 07:02:38] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[42]
RANDOM walk for 1000000 steps (224270 resets) in 751 ms. (1329 steps per ms)
BEST_FIRST walk for 1000001 steps (103385 resets) in 397 ms. (2512 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[42]
[2025-06-05 07:02:39] [INFO ] Invariant cache hit.
[2025-06-05 07:02:39] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 07:02:39] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-05 07:02:39] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-05 07:02:39] [INFO ] [Real]Added 38 Read/Feed constraints in 6 ms returned sat
[2025-06-05 07:02:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:02:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 07:02:39] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-05 07:02:39] [INFO ] [Nat]Added 38 Read/Feed constraints in 7 ms returned sat
[2025-06-05 07:02:39] [INFO ] Computed and/alt/rep : 24/59/24 causal constraints (skipped 78 transitions) in 5 ms.
[2025-06-05 07:02:39] [INFO ] Added : 13 causal constraints over 3 iterations in 31 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[42]
Support contains 1 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 93/93 places, 103/103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2025-06-05 07:02:40] [INFO ] Invariant cache hit.
[2025-06-05 07:02:40] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-05 07:02:40] [INFO ] Invariant cache hit.
[2025-06-05 07:02:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-05 07:02:40] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2025-06-05 07:02:40] [INFO ] Redundant transitions in 0 ms returned []
Running 102 sub problems to find dead transitions.
[2025-06-05 07:02:40] [INFO ] Invariant cache hit.
[2025-06-05 07:02:40] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 103/196 variables, 93/96 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 38/134 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 134 constraints, problems are : Problem set: 0 solved, 102 unsolved in 1974 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 103/196 variables, 93/96 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 38/134 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 102/236 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 236 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3998 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
After SMT, in 6048ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 6049ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6232 ms. Remains : 93/93 places, 103/103 transitions.
[2025-06-05 07:02:46] [INFO ] Flatten gal took : 6 ms
RANDOM walk for 40000 steps (9006 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
[2025-06-05 07:02:46] [INFO ] Flatten gal took : 7 ms
[2025-06-05 07:02:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1691727334030282885.gal : 2 ms
[2025-06-05 07:02:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17675444070804331704.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1691727334030282885.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17675444070804331704.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality17675444070804331704.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 41
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :41 after 194
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :194 after 282
BEST_FIRST walk for 40003 steps (4138 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :282 after 1440
BEST_FIRST walk for 40003 steps (4133 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1440 after 3038
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3038 after 3734
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3734 after 19522
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :19522 after 49852
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :49852 after 414337
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :414337 after 2.99177e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.99177e+06 after 2.57478e+07
Interrupted probabilistic random walk after 3097353 steps, run timeout after 3001 ms. (steps per millisecond=1032 ) properties seen :1 out of 2
Probabilistic random walk after 3097353 steps, saw 1443421 distinct states, run finished after 3001 ms. (steps per millisecond=1032 ) properties seen :1
[2025-06-05 07:02:49] [INFO ] Invariant cache hit.
[2025-06-05 07:02:49] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/73 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 44/117 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/125 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-05 07:02:49] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 196/196 variables, and 99 constraints, problems are : Problem set: 1 solved, 0 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 2/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 111ms problems are : Problem set: 1 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.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[42]
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m36-UpperBounds-10 in 11128 ms.
[2025-06-05 07:02:49] [INFO ] Flatten gal took : 11 ms
[2025-06-05 07:02:49] [INFO ] Applying decomposition
[2025-06-05 07:02:49] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4340435312192089984.txt' '-o' '/tmp/graph4340435312192089984.bin' '-w' '/tmp/graph4340435312192089984.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4340435312192089984.bin' '-l' '-1' '-v' '-w' '/tmp/graph4340435312192089984.weights' '-q' '0' '-e' '0.001'
[2025-06-05 07:02:49] [INFO ] Decomposing Gal with order
[2025-06-05 07:02:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 07:02:49] [INFO ] Removed a total of 103 redundant transitions.
[2025-06-05 07:02:49] [INFO ] Flatten gal took : 37 ms
[2025-06-05 07:02:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 9 ms.
[2025-06-05 07:02:49] [INFO ] Time to serialize gal into /tmp/UpperBounds12485053900823452221.gal : 3 ms
[2025-06-05 07:02:49] [INFO ] Time to serialize properties into /tmp/UpperBounds2335241368865117170.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12485053900823452221.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2335241368865117170.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds2335241368865117170.prop.
Detected timeout of ITS tools.
[2025-06-05 07:23:21] [INFO ] Flatten gal took : 7 ms
[2025-06-05 07:23:21] [INFO ] Time to serialize gal into /tmp/UpperBounds10652263393377537719.gal : 2 ms
[2025-06-05 07:23:21] [INFO ] Time to serialize properties into /tmp/UpperBounds9179664557082504731.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10652263393377537719.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9179664557082504731.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds9179664557082504731.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,7.84742e+15,483.284,6693188,2,39274,5,2.92676e+07,6,0,539,2.07864e+07,0
Total reachable state count : 7847421593579594
Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d2m36-UpperBounds-02 :0 <= p96 <= 1
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d2m36-UpperBounds-02,0,483.293,6693188,1,0,7,2.92676e+07,9,1,712,2.07864e+07,4
Min sum of variable value : 0
Maximum sum along a path : 32
Bounds property SieveSingleMsgMbox-PT-d2m36-UpperBounds-08 :0 <= l1717 <= 32
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-08 32 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d2m36-UpperBounds-08,0,483.402,6693188,1,0,8,2.92676e+07,10,1,850,2.07864e+07,5
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d2m36-UpperBounds-10 :0 <= p133 <= 1
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d2m36-UpperBounds-10,0,483.403,6693188,1,0,9,2.92676e+07,11,1,897,2.07864e+07,6
Total runtime 1810794 ms.
BK_STOP 1749108685254
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="SieveSingleMsgMbox-PT-d2m36"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is SieveSingleMsgMbox-PT-d2m36, 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 r223-tall-174902009200060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m36.tgz
mv SieveSingleMsgMbox-PT-d2m36 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 ;