About the Execution of ITS-Tools for SieveSingleMsgMbox-PT-d1m04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 53472.00 | 0.00 | 0.00 | 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r212-tall-174901994300405.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 itstools
Input is SieveSingleMsgMbox-PT-d1m04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901994300405
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K 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 450K 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-d1m04-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1749156560767
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-05 20:49:21] [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 20:49:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 20:49:22] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2025-06-05 20:49:22] [INFO ] Transformed 1295 places.
[2025-06-05 20:49:22] [INFO ] Transformed 749 transitions.
[2025-06-05 20:49:22] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 1036 places in 8 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
// Phase 1: matrix 749 rows 259 cols
[2025-06-05 20:49:22] [INFO ] Computed 6 invariants in 38 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[10, 10, 1, 29]
RANDOM walk for 10000 steps (2215 resets) in 162 ms. (61 steps per ms)
BEST_FIRST walk for 40004 steps (3816 resets) in 227 ms. (175 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[10, 10, 1, 29]
[2025-06-05 20:49:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 20:49:22] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-05 20:49:22] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2025-06-05 20:49:22] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2025-06-05 20:49:23] [INFO ] State equation strengthened by 587 read => feed constraints.
[2025-06-05 20:49:23] [INFO ] [Real]Added 587 Read/Feed constraints in 88 ms returned sat
[2025-06-05 20:49:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 20:49:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-05 20:49:23] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-05 20:49:23] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2025-06-05 20:49:23] [INFO ] [Nat]Added 587 Read/Feed constraints in 130 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:23] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 9 ms to minimize.
[2025-06-05 20:49:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 207 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 20:49:23] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-05 20:49:23] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-05 20:49:23] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2025-06-05 20:49:23] [INFO ] [Real]Added 587 Read/Feed constraints in 75 ms returned sat
[2025-06-05 20:49:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 20:49:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 20:49:24] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 20:49:24] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2025-06-05 20:49:24] [INFO ] [Nat]Added 587 Read/Feed constraints in 138 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:24] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:24] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:24] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:25] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:25] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:25] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:25] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:25] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:26] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:26] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:26] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:26] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:26] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:27] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:27] [INFO ] Deduced a trap composed of 137 places in 103 ms of which 16 ms to minimize.
[2025-06-05 20:49:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 15 trap constraints in 3124 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 20:49:27] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 20:49:27] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 20:49:27] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2025-06-05 20:49:27] [INFO ] [Real]Added 587 Read/Feed constraints in 80 ms returned sat
[2025-06-05 20:49:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 20:49:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-05 20:49:27] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2025-06-05 20:49:27] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2025-06-05 20:49:27] [INFO ] [Nat]Added 587 Read/Feed constraints in 72 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:28] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:28] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:28] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:28] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:28] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:29] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 25 ms to minimize.
[2025-06-05 20:49:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1123 ms
[2025-06-05 20:49:29] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 110 ms.
[2025-06-05 20:49:29] [INFO ] Added : 13 causal constraints over 3 iterations in 326 ms. Result :sat
Minimization took 582 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 20:49:30] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 20:49:30] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2025-06-05 20:49:30] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2025-06-05 20:49:30] [INFO ] [Real]Added 587 Read/Feed constraints in 115 ms returned sat
[2025-06-05 20:49:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 20:49:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-05 20:49:30] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 20:49:30] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2025-06-05 20:49:30] [INFO ] [Nat]Added 587 Read/Feed constraints in 149 ms returned sat
[2025-06-05 20:49:30] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 51 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:31] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 6 ms to minimize.
[2025-06-05 20:49:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2025-06-05 20:49:31] [INFO ] Added : 23 causal constraints over 6 iterations in 711 ms. Result :sat
Minimization took 544 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[0, 0, 1, 29]
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 29]
Support contains 2 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 241 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.3 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 242 transitions.
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 241 transition count 507
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 304 place count 180 transition count 230
Iterating global reduction 1 with 61 rules applied. Total rules applied 365 place count 180 transition count 230
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 371 place count 180 transition count 224
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 415 place count 136 transition count 180
Iterating global reduction 2 with 44 rules applied. Total rules applied 459 place count 136 transition count 180
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 475 place count 136 transition count 164
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 501 place count 110 transition count 137
Iterating global reduction 3 with 26 rules applied. Total rules applied 527 place count 110 transition count 137
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 542 place count 110 transition count 122
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 550 place count 102 transition count 111
Iterating global reduction 4 with 8 rules applied. Total rules applied 558 place count 102 transition count 111
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 566 place count 94 transition count 103
Iterating global reduction 4 with 8 rules applied. Total rules applied 574 place count 94 transition count 103
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 579 place count 89 transition count 97
Iterating global reduction 4 with 5 rules applied. Total rules applied 584 place count 89 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 586 place count 89 transition count 95
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 591 place count 84 transition count 90
Iterating global reduction 5 with 5 rules applied. Total rules applied 596 place count 84 transition count 90
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 599 place count 81 transition count 87
Iterating global reduction 5 with 3 rules applied. Total rules applied 602 place count 81 transition count 87
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 603 place count 80 transition count 85
Iterating global reduction 5 with 1 rules applied. Total rules applied 604 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 605 place count 79 transition count 84
Iterating global reduction 5 with 1 rules applied. Total rules applied 606 place count 79 transition count 84
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 607 place count 78 transition count 83
Iterating global reduction 5 with 1 rules applied. Total rules applied 608 place count 78 transition count 83
Applied a total of 608 rules in 77 ms. Remains 78 /259 variables (removed 181) and now considering 83/749 (removed 666) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 78/259 places, 83/749 transitions.
// Phase 1: matrix 83 rows 78 cols
[2025-06-05 20:49:32] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 29]
RANDOM walk for 1000000 steps (224280 resets) in 855 ms. (1168 steps per ms)
BEST_FIRST walk for 2000001 steps (206896 resets) in 866 ms. (2306 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 29]
[2025-06-05 20:49:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 20:49:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 20:49:33] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 20:49:33] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-05 20:49:33] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-05 20:49:33] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2025-06-05 20:49:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 20:49:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 20:49:33] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2025-06-05 20:49:33] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-05 20:49:33] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:33] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 5 ms to minimize.
[2025-06-05 20:49:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2025-06-05 20:49:33] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 61 transitions) in 6 ms.
[2025-06-05 20:49:34] [INFO ] Added : 8 causal constraints over 2 iterations in 37 ms. Result :sat
Minimization took 30 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 20:49:34] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 20:49:34] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 20:49:34] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-05 20:49:34] [INFO ] [Real]Added 31 Read/Feed constraints in 11 ms returned sat
[2025-06-05 20:49:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 20:49:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 20:49:34] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 20:49:34] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-05 20:49:34] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2025-06-05 20:49:34] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 61 transitions) in 4 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:34] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 2 ms to minimize.
[2025-06-05 20:49:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2025-06-05 20:49:34] [INFO ] Added : 10 causal constraints over 2 iterations in 94 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 29]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 29]
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 83/83 transitions.
Applied a total of 0 rules in 4 ms. Remains 78 /78 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 78/78 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 83/83 transitions.
Applied a total of 0 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2025-06-05 20:49:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:49:34] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-05 20:49:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:49:34] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-05 20:49:34] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:49:34] [INFO ] Redundant transitions in 1 ms returned []
Running 82 sub problems to find dead transitions.
[2025-06-05 20:49:34] [INFO ] Invariant cache hit.
[2025-06-05 20:49:34] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 1/78 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:35] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 83/161 variables, 78/83 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 31/114 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:36] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 10 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 1/115 constraints. Problems are: Problem set: 7 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/115 constraints. Problems are: Problem set: 7 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/161 variables, 0/115 constraints. Problems are: Problem set: 7 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 115 constraints, problems are : Problem set: 7 solved, 75 unsolved in 5036 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 75 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 7 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 7 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/3 constraints. Problems are: Problem set: 7 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 7 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 2/68 variables, 2/5 constraints. Problems are: Problem set: 7 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 1/6 constraints. Problems are: Problem set: 7 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 7 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 83/151 variables, 68/74 constraints. Problems are: Problem set: 7 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 31/105 constraints. Problems are: Problem set: 7 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 5/110 constraints. Problems are: Problem set: 7 solved, 75 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:40] [INFO ] Deduced a trap along path composed of 17 places in 28 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 1/111 constraints. Problems are: Problem set: 7 solved, 75 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 0/111 constraints. Problems are: Problem set: 7 solved, 75 unsolved
At refinement iteration 12 (OVERLAPS) 10/161 variables, 10/121 constraints. Problems are: Problem set: 7 solved, 75 unsolved
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/161 variables, 70/191 constraints. Problems are: Problem set: 10 solved, 72 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/161 variables, 0/191 constraints. Problems are: Problem set: 10 solved, 72 unsolved
At refinement iteration 15 (OVERLAPS) 0/161 variables, 0/191 constraints. Problems are: Problem set: 10 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 191 constraints, problems are : Problem set: 10 solved, 72 unsolved in 11725 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 75/82 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 16863ms problems are : Problem set: 10 solved, 72 unsolved
Search for dead transitions found 10 dead transitions in 16875ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 78/78 places, 73/83 transitions.
Graph (complete) has 185 edges and 78 vertex of which 59 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 0 output transitions
Reduce places removed 3 places and 9 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 56 transition count 56
Reduce places removed 4 places and 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 16 place count 52 transition count 52
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 51 transition count 51
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 51 transition count 51
Applied a total of 18 rules in 10 ms. Remains 51 /78 variables (removed 27) and now considering 51/73 (removed 22) transitions.
// Phase 1: matrix 51 rows 51 cols
[2025-06-05 20:49:51] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:49:51] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-05 20:49:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:49:51] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-05 20:49:51] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 51/78 places, 51/83 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 17246 ms. Remains : 51/78 places, 51/83 transitions.
[2025-06-05 20:49:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 29]
RANDOM walk for 1000000 steps (224353 resets) in 608 ms. (1642 steps per ms)
BEST_FIRST walk for 2000000 steps (207300 resets) in 652 ms. (3062 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 29]
[2025-06-05 20:49:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 20:49:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 20:49:52] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-05 20:49:52] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-05 20:49:52] [INFO ] [Real]Added 20 Read/Feed constraints in 6 ms returned sat
[2025-06-05 20:49:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 20:49:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 20:49:52] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-05 20:49:52] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:53] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:53] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
[2025-06-05 20:49:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 85 ms
[2025-06-05 20:49:53] [INFO ] Computed and/alt/rep : 11/19/11 causal constraints (skipped 39 transitions) in 3 ms.
[2025-06-05 20:49:53] [INFO ] Added : 9 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 16 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 20:49:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 20:49:53] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-05 20:49:53] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2025-06-05 20:49:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 20:49:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 20:49:53] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-05 20:49:53] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:53] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 4 ms to minimize.
[2025-06-05 20:49:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2025-06-05 20:49:53] [INFO ] Computed and/alt/rep : 11/19/11 causal constraints (skipped 39 transitions) in 3 ms.
[2025-06-05 20:49:53] [INFO ] Added : 10 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 29]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 29]
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 51/51 places, 51/51 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2025-06-05 20:49:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:49:53] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-05 20:49:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:49:53] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-05 20:49:53] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:49:53] [INFO ] Redundant transitions in 0 ms returned []
Running 50 sub problems to find dead transitions.
[2025-06-05 20:49:53] [INFO ] Invariant cache hit.
[2025-06-05 20:49:53] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:53] [INFO ] Deduced a trap composed of 24 places in 20 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:49:53] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 51/101 variables, 50/55 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 1/102 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 11 (OVERLAPS) 0/102 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 76 constraints, problems are : Problem set: 0 solved, 50 unsolved in 2291 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 51/51 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 51/101 variables, 50/55 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 1/102 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 45/126 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 12 (OVERLAPS) 0/102 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 126 constraints, problems are : Problem set: 0 solved, 50 unsolved in 4001 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 51/51 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6316ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 6317ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6456 ms. Remains : 51/51 places, 51/51 transitions.
RANDOM walk for 40000 steps (8944 resets) in 704 ms. (56 steps per ms) remains 4/4 properties
[2025-06-05 20:50:00] [INFO ] Flatten gal took : 42 ms
[2025-06-05 20:50:00] [INFO ] Flatten gal took : 9 ms
BEST_FIRST walk for 40001 steps (4148 resets) in 268 ms. (148 steps per ms) remains 4/4 properties
[2025-06-05 20:50:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14905160934712173193.gal : 8 ms
[2025-06-05 20:50:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9461965351558746999.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14905160934712173193.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9461965351558746999.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40002 steps (4166 resets) in 188 ms. (211 steps per ms) remains 4/4 properties
Loading property file /tmp/ReachabilityCardinality9461965351558746999.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :7 after 37
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :37 after 63
BEST_FIRST walk for 40003 steps (4109 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :63 after 91
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :91 after 157
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :157 after 357
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,879,0.030854,4728,2,582,11,3855,10,0,258,2319,0
Total reachable state count : 879
Verifying 4 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,28,0.031291,4856,2,120,11,3855,10,0,260,2319,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,28,0.031667,5112,2,120,11,3855,10,0,260,2319,0
Reachability property MAX1 does not hold.
No reachable states exhibit your property : MAX1
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,0,0.031829,5112,1,0,11,3855,10,0,260,2319,0
Invariant property MIN1 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,4,0.031979,5112,2,57,11,3855,10,0,261,2319,0
BEST_FIRST walk for 40003 steps (4238 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
Probably explored full state space saw : 879 states, properties seen :3
Probabilistic random walk after 2124 steps, saw 879 distinct states, run finished after 13 ms. (steps per millisecond=163 ) properties seen :3
Explored full state space saw : 879 states, properties seen :0
Exhaustive walk after 2124 steps, saw 879 distinct states, run finished after 4 ms. (steps per millisecond=531 ) properties seen :0
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0] Max Struct:[29]
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m04-UpperBounds-13
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:[29]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[29]
[2025-06-05 20:50:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[29]
RANDOM walk for 10000 steps (2219 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10000 steps (1073 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[29]
[2025-06-05 20:50:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 20:50:00] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 20:50:00] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-05 20:50:00] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-05 20:50:00] [INFO ] [Real]Added 20 Read/Feed constraints in 4 ms returned sat
[2025-06-05 20:50:00] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 20:50:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 20:50:00] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-05 20:50:00] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:00] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 4 ms to minimize.
[2025-06-05 20:50:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2025-06-05 20:50:00] [INFO ] Computed and/alt/rep : 11/19/11 causal constraints (skipped 39 transitions) in 3 ms.
[2025-06-05 20:50:00] [INFO ] Added : 10 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[29]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[29]
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 51/51 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 51 transition count 51
Applied a total of 1 rules in 5 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 51/51 places, 51/51 transitions.
// Phase 1: matrix 51 rows 51 cols
[2025-06-05 20:50:00] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[29]
RANDOM walk for 1000000 steps (224378 resets) in 693 ms. (1440 steps per ms)
BEST_FIRST walk for 1000001 steps (103420 resets) in 334 ms. (2985 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[29]
[2025-06-05 20:50:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 20:50:01] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 20:50:01] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-05 20:50:01] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-05 20:50:01] [INFO ] [Real]Added 21 Read/Feed constraints in 3 ms returned sat
[2025-06-05 20:50:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 20:50:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 20:50:01] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-05 20:50:01] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:01] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 3 ms to minimize.
[2025-06-05 20:50:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2025-06-05 20:50:01] [INFO ] Computed and/alt/rep : 11/18/11 causal constraints (skipped 39 transitions) in 4 ms.
[2025-06-05 20:50:01] [INFO ] Added : 10 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[29]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[29]
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 51/51 places, 51/51 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2025-06-05 20:50:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:50:01] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-05 20:50:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:50:01] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-05 20:50:01] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:50:01] [INFO ] Redundant transitions in 0 ms returned []
Running 50 sub problems to find dead transitions.
[2025-06-05 20:50:01] [INFO ] Invariant cache hit.
[2025-06-05 20:50:01] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:02] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:02] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Problem TDEAD50 is UNSAT
At refinement iteration 5 (OVERLAPS) 51/101 variables, 50/55 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 21/76 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/76 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 1/102 variables, 1/77 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 77 constraints, problems are : Problem set: 1 solved, 49 unsolved in 2032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 51/51 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 49 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 2/50 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 49 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:03] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 51/101 variables, 50/56 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 21/77 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 5/82 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 1/102 variables, 1/83 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 44/127 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 12 (OVERLAPS) 0/102 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 127 constraints, problems are : Problem set: 1 solved, 49 unsolved in 3696 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 51/51 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 49/50 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5748ms problems are : Problem set: 1 solved, 49 unsolved
Search for dead transitions found 1 dead transitions in 5748ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 51/51 places, 50/51 transitions.
Graph (complete) has 128 edges and 51 vertex of which 48 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 48 transition count 48
Applied a total of 3 rules in 8 ms. Remains 48 /51 variables (removed 3) and now considering 48/50 (removed 2) transitions.
// Phase 1: matrix 48 rows 48 cols
[2025-06-05 20:50:07] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:50:07] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-05 20:50:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:50:07] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-05 20:50:07] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 48/51 places, 48/51 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5989 ms. Remains : 48/51 places, 48/51 transitions.
[2025-06-05 20:50:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[29]
RANDOM walk for 1000000 steps (224191 resets) in 562 ms. (1776 steps per ms)
BEST_FIRST walk for 1000000 steps (103612 resets) in 314 ms. (3174 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[29]
[2025-06-05 20:50:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 20:50:08] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-05 20:50:08] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 0 ms returned sat
[2025-06-05 20:50:08] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-05 20:50:08] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-05 20:50:08] [INFO ] [Real]Added 18 Read/Feed constraints in 2 ms returned sat
[2025-06-05 20:50:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 20:50:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-05 20:50:08] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 0 ms returned sat
[2025-06-05 20:50:08] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-05 20:50:08] [INFO ] [Nat]Added 18 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:50:08] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 3 ms to minimize.
[2025-06-05 20:50:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2025-06-05 20:50:08] [INFO ] Computed and/alt/rep : 11/18/11 causal constraints (skipped 36 transitions) in 3 ms.
[2025-06-05 20:50:08] [INFO ] Added : 9 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[29]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[29]
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 48/48 places, 48/48 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2025-06-05 20:50:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:50:08] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-05 20:50:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:50:08] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-05 20:50:08] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:50:08] [INFO ] Redundant transitions in 0 ms returned []
Running 47 sub problems to find dead transitions.
[2025-06-05 20:50:08] [INFO ] Invariant cache hit.
[2025-06-05 20:50:08] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 48/95 variables, 47/50 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 18/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 1/96 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 69 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1994 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 48/95 variables, 47/50 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 18/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 1/96 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 42/116 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/96 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 0/96 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 116 constraints, problems are : Problem set: 0 solved, 47 unsolved in 3227 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5234ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 5234ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5340 ms. Remains : 48/48 places, 48/48 transitions.
[2025-06-05 20:50:13] [INFO ] Flatten gal took : 21 ms
[2025-06-05 20:50:14] [INFO ] Flatten gal took : 14 ms
[2025-06-05 20:50:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17670330660631109955.gal : 1 ms
[2025-06-05 20:50:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5223984663313519085.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17670330660631109955.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5223984663313519085.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (8954 resets) in 127 ms. (312 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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5223984663313519085.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 33
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :33 after 63
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :63 after 91
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :145 after 157
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :161 after 361
BEST_FIRST walk for 40002 steps (4169 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
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,627,0.019658,4844,2,515,13,3340,8,0,241,2100,0
Total reachable state count : 627
Verifying 2 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,0.01987,4844,1,0,13,3340,8,0,242,2100,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,6,0.020181,5100,2,60,13,3340,8,0,243,2100,0
BEST_FIRST walk for 40001 steps (4136 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
ITS tools runner thread asked to quit. Dying gracefully.
Probably explored full state space saw : 627 states, properties seen :1
Probabilistic random walk after 1464 steps, saw 627 distinct states, run finished after 7 ms. (steps per millisecond=209 ) properties seen :1
Explored full state space saw : 627 states, properties seen :0
Exhaustive walk after 1464 steps, saw 627 distinct states, run finished after 3 ms. (steps per millisecond=488 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[29]
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m04-UpperBounds-13 in 13863 ms.
[2025-06-05 20:50:14] [INFO ] Flatten gal took : 5 ms
[2025-06-05 20:50:14] [INFO ] Applying decomposition
[2025-06-05 20:50:14] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8378649135069812999.txt' '-o' '/tmp/graph8378649135069812999.bin' '-w' '/tmp/graph8378649135069812999.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8378649135069812999.bin' '-l' '-1' '-v' '-w' '/tmp/graph8378649135069812999.weights' '-q' '0' '-e' '0.001'
[2025-06-05 20:50:14] [INFO ] Decomposing Gal with order
[2025-06-05 20:50:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 20:50:14] [INFO ] Removed a total of 33 redundant transitions.
[2025-06-05 20:50:14] [INFO ] Flatten gal took : 31 ms
[2025-06-05 20:50:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 4 ms.
[2025-06-05 20:50:14] [INFO ] Time to serialize gal into /tmp/UpperBounds6801403675098069529.gal : 2 ms
[2025-06-05 20:50:14] [INFO ] Time to serialize properties into /tmp/UpperBounds14144555527344330746.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6801403675098069529.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14144555527344330746.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds14144555527344330746.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\_mod\_flat,879,0.015973,4688,181,159,989,620,163,1109,64,1435,0
Total reachable state count : 879
Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m04-UpperBounds-13 :0 <= i8.u0.p80 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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-d1m04-UpperBounds-13,0,0.017787,4688,1,0,989,620,244,1109,88,1500,239
Total runtime 52315 ms.
BK_STOP 1749156614239
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d1m04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is SieveSingleMsgMbox-PT-d1m04, 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 r212-tall-174901994300405"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m04.tgz
mv SieveSingleMsgMbox-PT-d1m04 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 ;