About the Execution of 2024-gold for FireWire-PT-16
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15690.310 | 167466.00 | 216184.00 | 584.90 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r097-smll-174860111800046.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 FireWire-PT-16, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r097-smll-174860111800046
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 84K May 29 14:32 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 FireWire-PT-16-UpperBounds-00
FORMULA_NAME FireWire-PT-16-UpperBounds-01
FORMULA_NAME FireWire-PT-16-UpperBounds-02
FORMULA_NAME FireWire-PT-16-UpperBounds-03
FORMULA_NAME FireWire-PT-16-UpperBounds-04
FORMULA_NAME FireWire-PT-16-UpperBounds-05
FORMULA_NAME FireWire-PT-16-UpperBounds-06
FORMULA_NAME FireWire-PT-16-UpperBounds-07
FORMULA_NAME FireWire-PT-16-UpperBounds-08
FORMULA_NAME FireWire-PT-16-UpperBounds-09
FORMULA_NAME FireWire-PT-16-UpperBounds-10
FORMULA_NAME FireWire-PT-16-UpperBounds-11
FORMULA_NAME FireWire-PT-16-UpperBounds-12
FORMULA_NAME FireWire-PT-16-UpperBounds-13
FORMULA_NAME FireWire-PT-16-UpperBounds-14
FORMULA_NAME FireWire-PT-16-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748678303620
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 07:58:26] [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-05-31 07:58:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 07:58:27] [INFO ] Load time of PNML (sax parser for PT used): 449 ms
[2025-05-31 07:58:27] [INFO ] Transformed 254 places.
[2025-05-31 07:58:27] [INFO ] Transformed 368 transitions.
[2025-05-31 07:58:27] [INFO ] Found NUPN structural information;
[2025-05-31 07:58:27] [INFO ] Parsed PT model containing 254 places and 368 transitions and 1032 arcs in 785 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 368 rows 254 cols
[2025-05-31 07:58:27] [INFO ] Computed 5 invariants in 85 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (3 resets) in 63 ms. (156 steps per ms)
FORMULA FireWire-PT-16-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-16-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-16-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-16-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-16-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-16-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-16-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-16-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80000 steps (27 resets) in 309 ms. (258 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-31 07:58:27] [INFO ] Invariant cache hit.
[2025-05-31 07:58:28] [INFO ] [Real]Absence check using 5 positive place invariants in 17 ms returned sat
[2025-05-31 07:58:28] [INFO ] [Real]Absence check using state equation in 475 ms returned sat
[2025-05-31 07:58:29] [INFO ] Deduced a trap composed of 102 places in 741 ms of which 24 ms to minimize.
[2025-05-31 07:58:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:58:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2025-05-31 07:58:30] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2025-05-31 07:58:30] [INFO ] Deduced a trap composed of 102 places in 404 ms of which 42 ms to minimize.
[2025-05-31 07:58:31] [INFO ] Deduced a trap composed of 141 places in 357 ms of which 5 ms to minimize.
[2025-05-31 07:58:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 905 ms
[2025-05-31 07:58:31] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 94 ms.
[2025-05-31 07:58:34] [INFO ] Deduced a trap composed of 152 places in 247 ms of which 4 ms to minimize.
[2025-05-31 07:58:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 350 ms
[2025-05-31 07:58:34] [INFO ] Added : 282 causal constraints over 57 iterations in 3493 ms. Result :sat
Minimization took 66 ms.
[2025-05-31 07:58:35] [INFO ] [Real]Absence check using 5 positive place invariants in 39 ms returned sat
[2025-05-31 07:58:35] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2025-05-31 07:58:35] [INFO ] Deduced a trap composed of 98 places in 318 ms of which 8 ms to minimize.
[2025-05-31 07:58:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:58:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2025-05-31 07:58:36] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2025-05-31 07:58:36] [INFO ] Deduced a trap composed of 98 places in 331 ms of which 17 ms to minimize.
[2025-05-31 07:58:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 376 ms
[2025-05-31 07:58:36] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 49 ms.
[2025-05-31 07:58:39] [INFO ] Deduced a trap composed of 102 places in 224 ms of which 6 ms to minimize.
[2025-05-31 07:58:39] [INFO ] Deduced a trap composed of 106 places in 227 ms of which 4 ms to minimize.
[2025-05-31 07:58:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 609 ms
[2025-05-31 07:58:40] [INFO ] Added : 279 causal constraints over 57 iterations in 3400 ms. Result :sat
Minimization took 426 ms.
[2025-05-31 07:58:40] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2025-05-31 07:58:40] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2025-05-31 07:58:40] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 42 ms.
[2025-05-31 07:58:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:58:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2025-05-31 07:58:41] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2025-05-31 07:58:41] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 42 ms.
[2025-05-31 07:58:44] [INFO ] Deduced a trap composed of 115 places in 162 ms of which 4 ms to minimize.
[2025-05-31 07:58:44] [INFO ] Deduced a trap composed of 102 places in 200 ms of which 3 ms to minimize.
[2025-05-31 07:58:44] [INFO ] Deduced a trap composed of 89 places in 172 ms of which 3 ms to minimize.
[2025-05-31 07:58:44] [INFO ] Deduced a trap composed of 93 places in 165 ms of which 4 ms to minimize.
[2025-05-31 07:58:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 968 ms
[2025-05-31 07:58:45] [INFO ] Added : 286 causal constraints over 58 iterations in 3558 ms. Result :sat
Minimization took 422 ms.
[2025-05-31 07:58:45] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2025-05-31 07:58:45] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2025-05-31 07:58:45] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 2 ms to minimize.
[2025-05-31 07:58:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:58:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2025-05-31 07:58:46] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2025-05-31 07:58:46] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 33 ms.
[2025-05-31 07:58:49] [INFO ] Added : 313 causal constraints over 63 iterations in 2819 ms. Result :sat
Minimization took 487 ms.
[2025-05-31 07:58:49] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2025-05-31 07:58:49] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2025-05-31 07:58:50] [INFO ] Deduced a trap composed of 89 places in 167 ms of which 4 ms to minimize.
[2025-05-31 07:58:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:58:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2025-05-31 07:58:50] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2025-05-31 07:58:50] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 51 ms.
[2025-05-31 07:58:53] [INFO ] Deduced a trap composed of 89 places in 264 ms of which 5 ms to minimize.
[2025-05-31 07:58:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 366 ms
[2025-05-31 07:58:53] [INFO ] Added : 281 causal constraints over 57 iterations in 2865 ms. Result :sat
Minimization took 411 ms.
[2025-05-31 07:58:53] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2025-05-31 07:58:54] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2025-05-31 07:58:54] [INFO ] Deduced a trap composed of 96 places in 212 ms of which 4 ms to minimize.
[2025-05-31 07:58:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:58:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2025-05-31 07:58:54] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2025-05-31 07:58:54] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 48 ms.
[2025-05-31 07:58:58] [INFO ] Deduced a trap composed of 89 places in 221 ms of which 4 ms to minimize.
[2025-05-31 07:58:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
[2025-05-31 07:58:58] [INFO ] Added : 283 causal constraints over 59 iterations in 3368 ms. Result :sat
Minimization took 328 ms.
[2025-05-31 07:58:58] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2025-05-31 07:58:58] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2025-05-31 07:58:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:58:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2025-05-31 07:58:59] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2025-05-31 07:58:59] [INFO ] Deduced a trap composed of 16 places in 232 ms of which 4 ms to minimize.
[2025-05-31 07:58:59] [INFO ] Deduced a trap composed of 102 places in 209 ms of which 4 ms to minimize.
[2025-05-31 07:58:59] [INFO ] Deduced a trap composed of 89 places in 219 ms of which 3 ms to minimize.
[2025-05-31 07:59:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 753 ms
[2025-05-31 07:59:00] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 41 ms.
[2025-05-31 07:59:02] [INFO ] Added : 279 causal constraints over 56 iterations in 2661 ms. Result :sat
Minimization took 442 ms.
[2025-05-31 07:59:03] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2025-05-31 07:59:03] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2025-05-31 07:59:03] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 42 ms.
[2025-05-31 07:59:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:59:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2025-05-31 07:59:04] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2025-05-31 07:59:04] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 45 ms.
[2025-05-31 07:59:07] [INFO ] Added : 307 causal constraints over 62 iterations in 3507 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 368/368 transitions.
Graph (trivial) has 204 edges and 254 vertex of which 19 / 254 are part of one of the 3 SCC in 6 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 581 edges and 238 vertex of which 235 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 235 transition count 281
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 69 rules applied. Total rules applied 138 place count 169 transition count 278
Reduce places removed 2 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 8 rules applied. Total rules applied 146 place count 167 transition count 272
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 152 place count 161 transition count 272
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 152 place count 161 transition count 268
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 160 place count 157 transition count 268
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 185 place count 132 transition count 242
Iterating global reduction 4 with 25 rules applied. Total rules applied 210 place count 132 transition count 242
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 211 place count 132 transition count 241
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 211 place count 132 transition count 236
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 221 place count 127 transition count 236
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 227 place count 121 transition count 209
Iterating global reduction 5 with 6 rules applied. Total rules applied 233 place count 121 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 236 place count 121 transition count 206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 237 place count 120 transition count 206
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 279 place count 99 transition count 185
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 307 place count 85 transition count 227
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 309 place count 85 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 324 place count 85 transition count 210
Free-agglomeration rule applied 11 times.
Iterating global reduction 8 with 11 rules applied. Total rules applied 335 place count 85 transition count 199
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 346 place count 74 transition count 199
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 9 with 20 rules applied. Total rules applied 366 place count 74 transition count 179
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 367 place count 74 transition count 179
Applied a total of 367 rules in 192 ms. Remains 74 /254 variables (removed 180) and now considering 179/368 (removed 189) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 74/254 places, 179/368 transitions.
[2025-05-31 07:59:11] [INFO ] Flow matrix only has 177 transitions (discarded 2 similar events)
// Phase 1: matrix 177 rows 74 cols
[2025-05-31 07:59:11] [INFO ] Computed 4 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (108263 resets) in 1106 ms. (903 steps per ms)
FORMULA FireWire-PT-16-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 7000007 steps (259952 resets) in 3254 ms. (2150 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2025-05-31 07:59:15] [INFO ] Flow matrix only has 177 transitions (discarded 2 similar events)
[2025-05-31 07:59:15] [INFO ] Invariant cache hit.
[2025-05-31 07:59:15] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2025-05-31 07:59:16] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2025-05-31 07:59:16] [INFO ] State equation strengthened by 29 read => feed constraints.
[2025-05-31 07:59:16] [INFO ] [Real]Added 29 Read/Feed constraints in 12 ms returned sat
[2025-05-31 07:59:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:59:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 07:59:16] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2025-05-31 07:59:16] [INFO ] [Nat]Added 29 Read/Feed constraints in 10 ms returned sat
[2025-05-31 07:59:16] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
[2025-05-31 07:59:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2025-05-31 07:59:16] [INFO ] Computed and/alt/rep : 109/610/109 causal constraints (skipped 66 transitions) in 17 ms.
[2025-05-31 07:59:16] [INFO ] Added : 42 causal constraints over 9 iterations in 211 ms. Result :sat
Minimization took 113 ms.
[2025-05-31 07:59:16] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 07:59:16] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2025-05-31 07:59:16] [INFO ] [Real]Added 29 Read/Feed constraints in 13 ms returned sat
[2025-05-31 07:59:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:59:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 07:59:16] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2025-05-31 07:59:16] [INFO ] [Nat]Added 29 Read/Feed constraints in 11 ms returned sat
[2025-05-31 07:59:17] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2025-05-31 07:59:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2025-05-31 07:59:17] [INFO ] Computed and/alt/rep : 109/610/109 causal constraints (skipped 66 transitions) in 16 ms.
[2025-05-31 07:59:17] [INFO ] Added : 41 causal constraints over 9 iterations in 210 ms. Result :sat
Minimization took 111 ms.
[2025-05-31 07:59:17] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 07:59:17] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2025-05-31 07:59:17] [INFO ] [Real]Added 29 Read/Feed constraints in 9 ms returned sat
[2025-05-31 07:59:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:59:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 07:59:17] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2025-05-31 07:59:17] [INFO ] [Nat]Added 29 Read/Feed constraints in 11 ms returned sat
[2025-05-31 07:59:17] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2025-05-31 07:59:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2025-05-31 07:59:17] [INFO ] Computed and/alt/rep : 109/610/109 causal constraints (skipped 66 transitions) in 15 ms.
[2025-05-31 07:59:17] [INFO ] Added : 17 causal constraints over 4 iterations in 103 ms. Result :sat
Minimization took 78 ms.
[2025-05-31 07:59:18] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 07:59:18] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2025-05-31 07:59:18] [INFO ] [Real]Added 29 Read/Feed constraints in 9 ms returned sat
[2025-05-31 07:59:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:59:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 07:59:18] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2025-05-31 07:59:18] [INFO ] [Nat]Added 29 Read/Feed constraints in 8 ms returned sat
[2025-05-31 07:59:18] [INFO ] Computed and/alt/rep : 109/610/109 causal constraints (skipped 66 transitions) in 17 ms.
[2025-05-31 07:59:18] [INFO ] Added : 1 causal constraints over 1 iterations in 48 ms. Result :sat
Minimization took 68 ms.
[2025-05-31 07:59:18] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 07:59:18] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2025-05-31 07:59:18] [INFO ] [Real]Added 29 Read/Feed constraints in 7 ms returned sat
[2025-05-31 07:59:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:59:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 07:59:18] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2025-05-31 07:59:18] [INFO ] [Nat]Added 29 Read/Feed constraints in 9 ms returned sat
[2025-05-31 07:59:18] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2025-05-31 07:59:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2025-05-31 07:59:18] [INFO ] Computed and/alt/rep : 109/610/109 causal constraints (skipped 66 transitions) in 16 ms.
[2025-05-31 07:59:18] [INFO ] Added : 8 causal constraints over 3 iterations in 78 ms. Result :sat
Minimization took 60 ms.
[2025-05-31 07:59:18] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 07:59:18] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2025-05-31 07:59:18] [INFO ] [Real]Added 29 Read/Feed constraints in 8 ms returned sat
[2025-05-31 07:59:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:59:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2025-05-31 07:59:19] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2025-05-31 07:59:19] [INFO ] [Nat]Added 29 Read/Feed constraints in 8 ms returned sat
[2025-05-31 07:59:19] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2025-05-31 07:59:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2025-05-31 07:59:19] [INFO ] Computed and/alt/rep : 109/610/109 causal constraints (skipped 66 transitions) in 15 ms.
[2025-05-31 07:59:19] [INFO ] Added : 9 causal constraints over 3 iterations in 79 ms. Result :sat
Minimization took 62 ms.
[2025-05-31 07:59:19] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 07:59:19] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2025-05-31 07:59:19] [INFO ] [Real]Added 29 Read/Feed constraints in 7 ms returned sat
[2025-05-31 07:59:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:59:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 07:59:19] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2025-05-31 07:59:19] [INFO ] [Nat]Added 29 Read/Feed constraints in 7 ms returned sat
[2025-05-31 07:59:19] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2025-05-31 07:59:19] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2025-05-31 07:59:19] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 2 ms to minimize.
[2025-05-31 07:59:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 294 ms
[2025-05-31 07:59:19] [INFO ] Computed and/alt/rep : 109/610/109 causal constraints (skipped 66 transitions) in 14 ms.
[2025-05-31 07:59:20] [INFO ] Added : 32 causal constraints over 7 iterations in 148 ms. Result :sat
Minimization took 88 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-16-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-16-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 179/179 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 72 transition count 182
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 72 transition count 181
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 72 transition count 180
Applied a total of 6 rules in 24 ms. Remains 72 /74 variables (removed 2) and now considering 180/179 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 72/74 places, 180/179 transitions.
[2025-05-31 07:59:20] [INFO ] Flow matrix only has 176 transitions (discarded 4 similar events)
// Phase 1: matrix 176 rows 72 cols
[2025-05-31 07:59:20] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (108166 resets) in 902 ms. (1107 steps per ms)
BEST_FIRST walk for 5000005 steps (185554 resets) in 2010 ms. (2486 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-05-31 07:59:23] [INFO ] Flow matrix only has 176 transitions (discarded 4 similar events)
[2025-05-31 07:59:23] [INFO ] Invariant cache hit.
[2025-05-31 07:59:23] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 07:59:23] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2025-05-31 07:59:23] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-05-31 07:59:23] [INFO ] [Real]Added 30 Read/Feed constraints in 22 ms returned sat
[2025-05-31 07:59:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:59:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 07:59:23] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2025-05-31 07:59:23] [INFO ] [Nat]Added 30 Read/Feed constraints in 16 ms returned sat
[2025-05-31 07:59:23] [INFO ] Computed and/alt/rep : 107/615/107 causal constraints (skipped 67 transitions) in 18 ms.
[2025-05-31 07:59:23] [INFO ] Added : 41 causal constraints over 9 iterations in 242 ms. Result :sat
Minimization took 148 ms.
[2025-05-31 07:59:23] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 07:59:24] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2025-05-31 07:59:24] [INFO ] [Real]Added 30 Read/Feed constraints in 7 ms returned sat
[2025-05-31 07:59:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:59:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 07:59:24] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2025-05-31 07:59:24] [INFO ] [Nat]Added 30 Read/Feed constraints in 9 ms returned sat
[2025-05-31 07:59:24] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 3 ms to minimize.
[2025-05-31 07:59:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2025-05-31 07:59:24] [INFO ] Computed and/alt/rep : 107/615/107 causal constraints (skipped 67 transitions) in 18 ms.
[2025-05-31 07:59:24] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
[2025-05-31 07:59:24] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 3 ms to minimize.
[2025-05-31 07:59:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 271 ms
[2025-05-31 07:59:24] [INFO ] Added : 40 causal constraints over 9 iterations in 525 ms. Result :sat
Minimization took 159 ms.
[2025-05-31 07:59:25] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 07:59:25] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2025-05-31 07:59:25] [INFO ] [Real]Added 30 Read/Feed constraints in 9 ms returned sat
[2025-05-31 07:59:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:59:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 07:59:25] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2025-05-31 07:59:25] [INFO ] [Nat]Added 30 Read/Feed constraints in 11 ms returned sat
[2025-05-31 07:59:25] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 2 ms to minimize.
[2025-05-31 07:59:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2025-05-31 07:59:25] [INFO ] Computed and/alt/rep : 107/615/107 causal constraints (skipped 67 transitions) in 17 ms.
[2025-05-31 07:59:25] [INFO ] Added : 15 causal constraints over 4 iterations in 118 ms. Result :sat
Minimization took 123 ms.
[2025-05-31 07:59:25] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 07:59:25] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2025-05-31 07:59:25] [INFO ] [Real]Added 30 Read/Feed constraints in 10 ms returned sat
[2025-05-31 07:59:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:59:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 07:59:25] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2025-05-31 07:59:25] [INFO ] [Nat]Added 30 Read/Feed constraints in 11 ms returned sat
[2025-05-31 07:59:26] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2025-05-31 07:59:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2025-05-31 07:59:26] [INFO ] Computed and/alt/rep : 107/615/107 causal constraints (skipped 67 transitions) in 17 ms.
[2025-05-31 07:59:26] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 3 ms to minimize.
[2025-05-31 07:59:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2025-05-31 07:59:26] [INFO ] Added : 37 causal constraints over 8 iterations in 318 ms. Result :sat
Minimization took 120 ms.
[2025-05-31 07:59:26] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 07:59:26] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2025-05-31 07:59:26] [INFO ] [Real]Added 30 Read/Feed constraints in 10 ms returned sat
[2025-05-31 07:59:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:59:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 07:59:26] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2025-05-31 07:59:26] [INFO ] [Nat]Added 30 Read/Feed constraints in 12 ms returned sat
[2025-05-31 07:59:26] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 8 ms to minimize.
[2025-05-31 07:59:26] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
[2025-05-31 07:59:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 197 ms
[2025-05-31 07:59:27] [INFO ] Computed and/alt/rep : 107/615/107 causal constraints (skipped 67 transitions) in 15 ms.
[2025-05-31 07:59:27] [INFO ] Added : 35 causal constraints over 8 iterations in 179 ms. Result :sat
Minimization took 119 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 180/180 transitions.
Applied a total of 0 rules in 9 ms. Remains 72 /72 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 72/72 places, 180/180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 180/180 transitions.
Applied a total of 0 rules in 7 ms. Remains 72 /72 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2025-05-31 07:59:27] [INFO ] Flow matrix only has 176 transitions (discarded 4 similar events)
[2025-05-31 07:59:27] [INFO ] Invariant cache hit.
[2025-05-31 07:59:27] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-05-31 07:59:27] [INFO ] Flow matrix only has 176 transitions (discarded 4 similar events)
[2025-05-31 07:59:27] [INFO ] Invariant cache hit.
[2025-05-31 07:59:27] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-05-31 07:59:27] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2025-05-31 07:59:27] [INFO ] Redundant transitions in 7 ms returned []
Running 178 sub problems to find dead transitions.
[2025-05-31 07:59:27] [INFO ] Flow matrix only has 176 transitions (discarded 4 similar events)
[2025-05-31 07:59:27] [INFO ] Invariant cache hit.
[2025-05-31 07:59:27] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2025-05-31 07:59:29] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 2 ms to minimize.
[2025-05-31 07:59:29] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 1 ms to minimize.
[2025-05-31 07:59:29] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 2 ms to minimize.
[2025-05-31 07:59:29] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2025-05-31 07:59:29] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD45 is UNSAT
[2025-05-31 07:59:30] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
[2025-05-31 07:59:30] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 2 ms to minimize.
Problem TDEAD136 is UNSAT
Problem TDEAD158 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 7/11 constraints. Problems are: Problem set: 12 solved, 166 unsolved
[2025-05-31 07:59:30] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/12 constraints. Problems are: Problem set: 12 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 12 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 176/248 variables, 72/84 constraints. Problems are: Problem set: 12 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 30/114 constraints. Problems are: Problem set: 12 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 0/114 constraints. Problems are: Problem set: 12 solved, 166 unsolved
[2025-05-31 07:59:35] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/248 variables, 1/115 constraints. Problems are: Problem set: 12 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/115 constraints. Problems are: Problem set: 12 solved, 166 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/115 constraints. Problems are: Problem set: 12 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 115 constraints, problems are : Problem set: 12 solved, 166 unsolved in 12831 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 72/72 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 12 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 4/4 constraints. Problems are: Problem set: 12 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 9/13 constraints. Problems are: Problem set: 12 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/13 constraints. Problems are: Problem set: 12 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 176/248 variables, 72/85 constraints. Problems are: Problem set: 12 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 30/115 constraints. Problems are: Problem set: 12 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 166/281 constraints. Problems are: Problem set: 12 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 0/281 constraints. Problems are: Problem set: 12 solved, 166 unsolved
At refinement iteration 8 (OVERLAPS) 0/248 variables, 0/281 constraints. Problems are: Problem set: 12 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 281 constraints, problems are : Problem set: 12 solved, 166 unsolved in 10427 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 72/72 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 166/178 constraints, Known Traps: 9/9 constraints]
After SMT, in 23481ms problems are : Problem set: 12 solved, 166 unsolved
Search for dead transitions found 12 dead transitions in 23501ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 72/72 places, 168/180 transitions.
Applied a total of 0 rules in 8 ms. Remains 72 /72 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2025-05-31 07:59:51] [INFO ] Redundant transitions in 6 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 23938 ms. Remains : 72/72 places, 168/180 transitions.
[2025-05-31 07:59:51] [INFO ] Flow matrix only has 164 transitions (discarded 4 similar events)
// Phase 1: matrix 164 rows 72 cols
[2025-05-31 07:59:51] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA FireWire-PT-16-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (108142 resets) in 866 ms. (1153 steps per ms)
BEST_FIRST walk for 4000002 steps (148313 resets) in 1570 ms. (2546 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-05-31 07:59:53] [INFO ] Flow matrix only has 164 transitions (discarded 4 similar events)
[2025-05-31 07:59:53] [INFO ] Invariant cache hit.
[2025-05-31 07:59:53] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 07:59:53] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2025-05-31 07:59:53] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-05-31 07:59:53] [INFO ] [Real]Added 30 Read/Feed constraints in 16 ms returned sat
[2025-05-31 07:59:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:59:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 07:59:53] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2025-05-31 07:59:54] [INFO ] [Nat]Added 30 Read/Feed constraints in 15 ms returned sat
[2025-05-31 07:59:54] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2025-05-31 07:59:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2025-05-31 07:59:54] [INFO ] Computed and/alt/rep : 100/509/100 causal constraints (skipped 62 transitions) in 13 ms.
[2025-05-31 07:59:54] [INFO ] Added : 69 causal constraints over 14 iterations in 279 ms. Result :sat
Minimization took 127 ms.
[2025-05-31 07:59:54] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 07:59:54] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2025-05-31 07:59:54] [INFO ] [Real]Added 30 Read/Feed constraints in 7 ms returned sat
[2025-05-31 07:59:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:59:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 07:59:54] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2025-05-31 07:59:54] [INFO ] [Nat]Added 30 Read/Feed constraints in 7 ms returned sat
[2025-05-31 07:59:54] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2025-05-31 07:59:54] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 2 ms to minimize.
[2025-05-31 07:59:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2025-05-31 07:59:54] [INFO ] Computed and/alt/rep : 100/509/100 causal constraints (skipped 62 transitions) in 15 ms.
[2025-05-31 07:59:55] [INFO ] Added : 47 causal constraints over 10 iterations in 212 ms. Result :sat
Minimization took 103 ms.
[2025-05-31 07:59:55] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 07:59:55] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2025-05-31 07:59:55] [INFO ] [Real]Added 30 Read/Feed constraints in 7 ms returned sat
[2025-05-31 07:59:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:59:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 07:59:55] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2025-05-31 07:59:55] [INFO ] [Nat]Added 30 Read/Feed constraints in 10 ms returned sat
[2025-05-31 07:59:55] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2025-05-31 07:59:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2025-05-31 07:59:55] [INFO ] Computed and/alt/rep : 100/509/100 causal constraints (skipped 62 transitions) in 15 ms.
[2025-05-31 07:59:55] [INFO ] Added : 11 causal constraints over 3 iterations in 81 ms. Result :sat
Minimization took 63 ms.
[2025-05-31 07:59:55] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 07:59:55] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2025-05-31 07:59:55] [INFO ] [Real]Added 30 Read/Feed constraints in 7 ms returned sat
[2025-05-31 07:59:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:59:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 07:59:55] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2025-05-31 07:59:55] [INFO ] [Nat]Added 30 Read/Feed constraints in 8 ms returned sat
[2025-05-31 07:59:55] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2025-05-31 07:59:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2025-05-31 07:59:55] [INFO ] Computed and/alt/rep : 100/509/100 causal constraints (skipped 62 transitions) in 14 ms.
[2025-05-31 07:59:56] [INFO ] Added : 48 causal constraints over 10 iterations in 213 ms. Result :sat
Minimization took 100 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 168/168 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 72 transition count 167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 71 transition count 167
Applied a total of 2 rules in 13 ms. Remains 71 /72 variables (removed 1) and now considering 167/168 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 71/72 places, 167/168 transitions.
[2025-05-31 07:59:56] [INFO ] Flow matrix only has 163 transitions (discarded 4 similar events)
// Phase 1: matrix 163 rows 71 cols
[2025-05-31 07:59:56] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (108276 resets) in 830 ms. (1203 steps per ms)
BEST_FIRST walk for 4000003 steps (148377 resets) in 1515 ms. (2638 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-05-31 07:59:58] [INFO ] Flow matrix only has 163 transitions (discarded 4 similar events)
[2025-05-31 07:59:58] [INFO ] Invariant cache hit.
[2025-05-31 07:59:58] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 07:59:58] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2025-05-31 07:59:58] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-05-31 07:59:58] [INFO ] [Real]Added 30 Read/Feed constraints in 19 ms returned sat
[2025-05-31 07:59:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:59:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 07:59:58] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2025-05-31 07:59:58] [INFO ] [Nat]Added 30 Read/Feed constraints in 17 ms returned sat
[2025-05-31 07:59:59] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2025-05-31 07:59:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2025-05-31 07:59:59] [INFO ] Computed and/alt/rep : 99/512/99 causal constraints (skipped 62 transitions) in 19 ms.
[2025-05-31 07:59:59] [INFO ] Added : 56 causal constraints over 12 iterations in 288 ms. Result :sat
Minimization took 110 ms.
[2025-05-31 07:59:59] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 07:59:59] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2025-05-31 07:59:59] [INFO ] [Real]Added 30 Read/Feed constraints in 10 ms returned sat
[2025-05-31 07:59:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:59:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 07:59:59] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2025-05-31 07:59:59] [INFO ] [Nat]Added 30 Read/Feed constraints in 11 ms returned sat
[2025-05-31 07:59:59] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2025-05-31 07:59:59] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2025-05-31 07:59:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 211 ms
[2025-05-31 08:00:00] [INFO ] Computed and/alt/rep : 99/512/99 causal constraints (skipped 62 transitions) in 19 ms.
[2025-05-31 08:00:00] [INFO ] Added : 21 causal constraints over 5 iterations in 146 ms. Result :sat
Minimization took 99 ms.
[2025-05-31 08:00:00] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 08:00:00] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2025-05-31 08:00:00] [INFO ] [Real]Added 30 Read/Feed constraints in 8 ms returned sat
[2025-05-31 08:00:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:00:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 08:00:00] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2025-05-31 08:00:00] [INFO ] [Nat]Added 30 Read/Feed constraints in 8 ms returned sat
[2025-05-31 08:00:00] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2025-05-31 08:00:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2025-05-31 08:00:00] [INFO ] Computed and/alt/rep : 99/512/99 causal constraints (skipped 62 transitions) in 18 ms.
[2025-05-31 08:00:00] [INFO ] Added : 10 causal constraints over 3 iterations in 90 ms. Result :sat
Minimization took 67 ms.
[2025-05-31 08:00:00] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 08:00:00] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2025-05-31 08:00:00] [INFO ] [Real]Added 30 Read/Feed constraints in 11 ms returned sat
[2025-05-31 08:00:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:00:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 08:00:01] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2025-05-31 08:00:01] [INFO ] [Nat]Added 30 Read/Feed constraints in 13 ms returned sat
[2025-05-31 08:00:01] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2025-05-31 08:00:01] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 2 ms to minimize.
[2025-05-31 08:00:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 208 ms
[2025-05-31 08:00:01] [INFO ] Computed and/alt/rep : 99/512/99 causal constraints (skipped 62 transitions) in 18 ms.
[2025-05-31 08:00:01] [INFO ] Added : 52 causal constraints over 11 iterations in 279 ms. Result :sat
Minimization took 125 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 167/167 transitions.
Applied a total of 0 rules in 9 ms. Remains 71 /71 variables (removed 0) and now considering 167/167 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 71/71 places, 167/167 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 167/167 transitions.
Applied a total of 0 rules in 8 ms. Remains 71 /71 variables (removed 0) and now considering 167/167 (removed 0) transitions.
[2025-05-31 08:00:01] [INFO ] Flow matrix only has 163 transitions (discarded 4 similar events)
[2025-05-31 08:00:01] [INFO ] Invariant cache hit.
[2025-05-31 08:00:01] [INFO ] Implicit Places using invariants in 172 ms returned []
[2025-05-31 08:00:01] [INFO ] Flow matrix only has 163 transitions (discarded 4 similar events)
[2025-05-31 08:00:01] [INFO ] Invariant cache hit.
[2025-05-31 08:00:02] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-05-31 08:00:02] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2025-05-31 08:00:02] [INFO ] Redundant transitions in 3 ms returned []
Running 165 sub problems to find dead transitions.
[2025-05-31 08:00:02] [INFO ] Flow matrix only has 163 transitions (discarded 4 similar events)
[2025-05-31 08:00:02] [INFO ] Invariant cache hit.
[2025-05-31 08:00:02] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2025-05-31 08:00:03] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2025-05-31 08:00:03] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
[2025-05-31 08:00:03] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
[2025-05-31 08:00:03] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 2 ms to minimize.
[2025-05-31 08:00:04] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 3 ms to minimize.
Problem TDEAD23 is UNSAT
[2025-05-31 08:00:04] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 2 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
[2025-05-31 08:00:04] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2025-05-31 08:00:04] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2025-05-31 08:00:04] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 2 ms to minimize.
Problem TDEAD126 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 9/13 constraints. Problems are: Problem set: 24 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/13 constraints. Problems are: Problem set: 24 solved, 141 unsolved
At refinement iteration 4 (OVERLAPS) 163/234 variables, 71/84 constraints. Problems are: Problem set: 24 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 30/114 constraints. Problems are: Problem set: 24 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/114 constraints. Problems are: Problem set: 24 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 0/234 variables, 0/114 constraints. Problems are: Problem set: 24 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 114 constraints, problems are : Problem set: 24 solved, 141 unsolved in 7382 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 71/71 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 24 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 4/4 constraints. Problems are: Problem set: 24 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 9/13 constraints. Problems are: Problem set: 24 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/13 constraints. Problems are: Problem set: 24 solved, 141 unsolved
At refinement iteration 4 (OVERLAPS) 163/234 variables, 71/84 constraints. Problems are: Problem set: 24 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 30/114 constraints. Problems are: Problem set: 24 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 141/255 constraints. Problems are: Problem set: 24 solved, 141 unsolved
[2025-05-31 08:00:13] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 1/256 constraints. Problems are: Problem set: 24 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/256 constraints. Problems are: Problem set: 24 solved, 141 unsolved
At refinement iteration 9 (OVERLAPS) 0/234 variables, 0/256 constraints. Problems are: Problem set: 24 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 256 constraints, problems are : Problem set: 24 solved, 141 unsolved in 11526 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 71/71 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 141/165 constraints, Known Traps: 10/10 constraints]
After SMT, in 19061ms problems are : Problem set: 24 solved, 141 unsolved
Search for dead transitions found 24 dead transitions in 19066ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 71/71 places, 143/167 transitions.
Applied a total of 0 rules in 6 ms. Remains 71 /71 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2025-05-31 08:00:21] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 19571 ms. Remains : 71/71 places, 143/167 transitions.
[2025-05-31 08:00:21] [INFO ] Flow matrix only has 139 transitions (discarded 4 similar events)
// Phase 1: matrix 139 rows 71 cols
[2025-05-31 08:00:21] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (108221 resets) in 831 ms. (1201 steps per ms)
BEST_FIRST walk for 4000003 steps (148505 resets) in 1527 ms. (2617 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-05-31 08:00:23] [INFO ] Flow matrix only has 139 transitions (discarded 4 similar events)
[2025-05-31 08:00:23] [INFO ] Invariant cache hit.
[2025-05-31 08:00:23] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 08:00:23] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2025-05-31 08:00:23] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-31 08:00:23] [INFO ] [Real]Added 23 Read/Feed constraints in 17 ms returned sat
[2025-05-31 08:00:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:00:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 08:00:23] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2025-05-31 08:00:23] [INFO ] [Nat]Added 23 Read/Feed constraints in 20 ms returned sat
[2025-05-31 08:00:24] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2025-05-31 08:00:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2025-05-31 08:00:24] [INFO ] Computed and/alt/rep : 89/465/89 causal constraints (skipped 48 transitions) in 13 ms.
[2025-05-31 08:00:24] [INFO ] Added : 41 causal constraints over 9 iterations in 211 ms. Result :sat
Minimization took 93 ms.
[2025-05-31 08:00:24] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 08:00:24] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2025-05-31 08:00:24] [INFO ] [Real]Added 23 Read/Feed constraints in 11 ms returned sat
[2025-05-31 08:00:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:00:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 08:00:24] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2025-05-31 08:00:24] [INFO ] [Nat]Added 23 Read/Feed constraints in 14 ms returned sat
[2025-05-31 08:00:24] [INFO ] Computed and/alt/rep : 89/465/89 causal constraints (skipped 48 transitions) in 12 ms.
[2025-05-31 08:00:24] [INFO ] Added : 23 causal constraints over 5 iterations in 126 ms. Result :sat
Minimization took 80 ms.
[2025-05-31 08:00:24] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 08:00:25] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2025-05-31 08:00:25] [INFO ] [Real]Added 23 Read/Feed constraints in 12 ms returned sat
[2025-05-31 08:00:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:00:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 08:00:25] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2025-05-31 08:00:25] [INFO ] [Nat]Added 23 Read/Feed constraints in 8 ms returned sat
[2025-05-31 08:00:25] [INFO ] Computed and/alt/rep : 89/465/89 causal constraints (skipped 48 transitions) in 14 ms.
[2025-05-31 08:00:25] [INFO ] Added : 5 causal constraints over 2 iterations in 67 ms. Result :sat
Minimization took 63 ms.
[2025-05-31 08:00:25] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 08:00:25] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2025-05-31 08:00:25] [INFO ] [Real]Added 23 Read/Feed constraints in 7 ms returned sat
[2025-05-31 08:00:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:00:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 08:00:25] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2025-05-31 08:00:25] [INFO ] [Nat]Added 23 Read/Feed constraints in 9 ms returned sat
[2025-05-31 08:00:25] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2025-05-31 08:00:25] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2025-05-31 08:00:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 193 ms
[2025-05-31 08:00:25] [INFO ] Computed and/alt/rep : 89/465/89 causal constraints (skipped 48 transitions) in 18 ms.
[2025-05-31 08:00:26] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2025-05-31 08:00:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2025-05-31 08:00:26] [INFO ] Added : 36 causal constraints over 8 iterations in 300 ms. Result :sat
Minimization took 101 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 143/143 transitions.
Applied a total of 0 rules in 10 ms. Remains 71 /71 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 71/71 places, 143/143 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 143/143 transitions.
Applied a total of 0 rules in 7 ms. Remains 71 /71 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2025-05-31 08:00:26] [INFO ] Flow matrix only has 139 transitions (discarded 4 similar events)
[2025-05-31 08:00:26] [INFO ] Invariant cache hit.
[2025-05-31 08:00:26] [INFO ] Implicit Places using invariants in 180 ms returned []
[2025-05-31 08:00:26] [INFO ] Flow matrix only has 139 transitions (discarded 4 similar events)
[2025-05-31 08:00:26] [INFO ] Invariant cache hit.
[2025-05-31 08:00:26] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-31 08:00:26] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2025-05-31 08:00:26] [INFO ] Redundant transitions in 1 ms returned []
Running 141 sub problems to find dead transitions.
[2025-05-31 08:00:26] [INFO ] Flow matrix only has 139 transitions (discarded 4 similar events)
[2025-05-31 08:00:26] [INFO ] Invariant cache hit.
[2025-05-31 08:00:26] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2025-05-31 08:00:28] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2025-05-31 08:00:28] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 1 ms to minimize.
[2025-05-31 08:00:28] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
[2025-05-31 08:00:28] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 1 ms to minimize.
[2025-05-31 08:00:28] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 140 unsolved
[2025-05-31 08:00:29] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 139/210 variables, 71/81 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 23/104 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/210 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 104 constraints, problems are : Problem set: 1 solved, 140 unsolved in 7154 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 71/71 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 1 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 139/210 variables, 71/81 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 23/104 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 140/244 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/244 constraints. Problems are: Problem set: 1 solved, 140 unsolved
[2025-05-31 08:00:40] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/210 variables, 1/245 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/245 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/245 constraints. Problems are: Problem set: 1 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 245 constraints, problems are : Problem set: 1 solved, 140 unsolved in 11773 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 71/71 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 140/141 constraints, Known Traps: 7/7 constraints]
After SMT, in 19038ms problems are : Problem set: 1 solved, 140 unsolved
Search for dead transitions found 1 dead transitions in 19042ms
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 : 71/71 places, 142/143 transitions.
Applied a total of 0 rules in 20 ms. Remains 71 /71 variables (removed 0) and now considering 142/142 (removed 0) transitions.
[2025-05-31 08:00:45] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 19528 ms. Remains : 71/71 places, 142/143 transitions.
[2025-05-31 08:00:45] [INFO ] Flow matrix only has 138 transitions (discarded 4 similar events)
// Phase 1: matrix 138 rows 71 cols
[2025-05-31 08:00:45] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (108286 resets) in 953 ms. (1048 steps per ms)
BEST_FIRST walk for 4000004 steps (148690 resets) in 1529 ms. (2614 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-05-31 08:00:48] [INFO ] Flow matrix only has 138 transitions (discarded 4 similar events)
[2025-05-31 08:00:48] [INFO ] Invariant cache hit.
[2025-05-31 08:00:48] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 08:00:48] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2025-05-31 08:00:48] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-31 08:00:48] [INFO ] [Real]Added 23 Read/Feed constraints in 12 ms returned sat
[2025-05-31 08:00:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:00:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 08:00:48] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2025-05-31 08:00:48] [INFO ] [Nat]Added 23 Read/Feed constraints in 15 ms returned sat
[2025-05-31 08:00:48] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2025-05-31 08:00:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2025-05-31 08:00:48] [INFO ] Computed and/alt/rep : 88/459/88 causal constraints (skipped 48 transitions) in 16 ms.
[2025-05-31 08:00:48] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 2 ms to minimize.
[2025-05-31 08:00:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2025-05-31 08:00:48] [INFO ] Added : 54 causal constraints over 11 iterations in 351 ms. Result :sat
Minimization took 116 ms.
[2025-05-31 08:00:49] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 08:00:49] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2025-05-31 08:00:49] [INFO ] [Real]Added 23 Read/Feed constraints in 9 ms returned sat
[2025-05-31 08:00:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:00:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 08:00:49] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2025-05-31 08:00:49] [INFO ] [Nat]Added 23 Read/Feed constraints in 9 ms returned sat
[2025-05-31 08:00:49] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2025-05-31 08:00:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2025-05-31 08:00:49] [INFO ] Computed and/alt/rep : 88/459/88 causal constraints (skipped 48 transitions) in 16 ms.
[2025-05-31 08:00:49] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 2 ms to minimize.
[2025-05-31 08:00:49] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 2 ms to minimize.
[2025-05-31 08:00:50] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2025-05-31 08:00:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 325 ms
[2025-05-31 08:00:50] [INFO ] Added : 53 causal constraints over 11 iterations in 599 ms. Result :sat
Minimization took 113 ms.
[2025-05-31 08:00:50] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 08:00:50] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2025-05-31 08:00:50] [INFO ] [Real]Added 23 Read/Feed constraints in 9 ms returned sat
[2025-05-31 08:00:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:00:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 08:00:50] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2025-05-31 08:00:50] [INFO ] [Nat]Added 23 Read/Feed constraints in 10 ms returned sat
[2025-05-31 08:00:50] [INFO ] Computed and/alt/rep : 88/459/88 causal constraints (skipped 48 transitions) in 15 ms.
[2025-05-31 08:00:50] [INFO ] Added : 5 causal constraints over 2 iterations in 69 ms. Result :sat
Minimization took 66 ms.
[2025-05-31 08:00:50] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 08:00:50] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2025-05-31 08:00:50] [INFO ] [Real]Added 23 Read/Feed constraints in 13 ms returned sat
[2025-05-31 08:00:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:00:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 08:00:50] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2025-05-31 08:00:50] [INFO ] [Nat]Added 23 Read/Feed constraints in 10 ms returned sat
[2025-05-31 08:00:51] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2025-05-31 08:00:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2025-05-31 08:00:51] [INFO ] Computed and/alt/rep : 88/459/88 causal constraints (skipped 48 transitions) in 15 ms.
[2025-05-31 08:00:51] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2025-05-31 08:00:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2025-05-31 08:00:51] [INFO ] Added : 26 causal constraints over 7 iterations in 279 ms. Result :sat
Minimization took 84 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 142/142 transitions.
Applied a total of 0 rules in 7 ms. Remains 71 /71 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 71/71 places, 142/142 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 142/142 transitions.
Applied a total of 0 rules in 6 ms. Remains 71 /71 variables (removed 0) and now considering 142/142 (removed 0) transitions.
[2025-05-31 08:00:51] [INFO ] Flow matrix only has 138 transitions (discarded 4 similar events)
[2025-05-31 08:00:51] [INFO ] Invariant cache hit.
[2025-05-31 08:00:51] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-05-31 08:00:51] [INFO ] Flow matrix only has 138 transitions (discarded 4 similar events)
[2025-05-31 08:00:51] [INFO ] Invariant cache hit.
[2025-05-31 08:00:51] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-31 08:00:52] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
[2025-05-31 08:00:52] [INFO ] Redundant transitions in 0 ms returned []
Running 140 sub problems to find dead transitions.
[2025-05-31 08:00:52] [INFO ] Flow matrix only has 138 transitions (discarded 4 similar events)
[2025-05-31 08:00:52] [INFO ] Invariant cache hit.
[2025-05-31 08:00:52] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2025-05-31 08:00:53] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2025-05-31 08:00:53] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2025-05-31 08:00:53] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 2 ms to minimize.
[2025-05-31 08:00:53] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2025-05-31 08:00:53] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 138/209 variables, 71/80 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 23/103 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2025-05-31 08:00:58] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/209 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 104 constraints, problems are : Problem set: 0 solved, 140 unsolved in 9330 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 71/71 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 138/209 variables, 71/81 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 23/104 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 140/244 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 244 constraints, problems are : Problem set: 0 solved, 140 unsolved in 7607 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 71/71 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 6/6 constraints]
After SMT, in 17052ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 17056ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17619 ms. Remains : 71/71 places, 142/142 transitions.
RANDOM walk for 40000 steps (4313 resets) in 2690 ms. (14 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1484 resets) in 344 ms. (115 steps per ms) remains 8/8 properties
[2025-05-31 08:01:10] [INFO ] Flatten gal took : 170 ms
BEST_FIRST walk for 40002 steps (1491 resets) in 335 ms. (119 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1497 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
[2025-05-31 08:01:10] [INFO ] Flatten gal took : 120 ms
BEST_FIRST walk for 40003 steps (1465 resets) in 135 ms. (294 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1480 resets) in 116 ms. (341 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1495 resets) in 135 ms. (294 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1476 resets) in 102 ms. (388 steps per ms) remains 8/8 properties
[2025-05-31 08:01:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16963159100907441514.gal : 117 ms
BEST_FIRST walk for 40003 steps (1491 resets) in 109 ms. (363 steps per ms) remains 8/8 properties
[2025-05-31 08:01:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12943407161377797875.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/ReachabilityCardinality16963159100907441514.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12943407161377797875.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/ReachabilityCardinality12943407161377797875.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :7 after 9
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :9 after 13
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :13 after 18
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :18 after 55
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :55 after 91
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :91 after 347
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :347 after 660
Finished probabilistic random walk after 6377 steps, run visited all 8 properties in 165 ms. (steps per millisecond=38 )
Probabilistic random walk after 6377 steps, saw 2141 distinct states, run finished after 172 ms. (steps per millisecond=37 ) properties seen :8
ITS runner timed out or was interrupted.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :660 after 1461
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA FireWire-PT-16-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-16-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-16-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-16-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 4 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 164556 ms.
BK_STOP 1748678471086
--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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="FireWire-PT-16"
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 FireWire-PT-16, 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 r097-smll-174860111800046"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-16.tgz
mv FireWire-PT-16 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 ;