Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r550-tall-171734899000285.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is FireWire-PT-15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734899000285
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 90K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FireWire-PT-15-UpperBounds-00
FORMULA_NAME FireWire-PT-15-UpperBounds-01
FORMULA_NAME FireWire-PT-15-UpperBounds-02
FORMULA_NAME FireWire-PT-15-UpperBounds-03
FORMULA_NAME FireWire-PT-15-UpperBounds-04
FORMULA_NAME FireWire-PT-15-UpperBounds-05
FORMULA_NAME FireWire-PT-15-UpperBounds-06
FORMULA_NAME FireWire-PT-15-UpperBounds-07
FORMULA_NAME FireWire-PT-15-UpperBounds-08
FORMULA_NAME FireWire-PT-15-UpperBounds-09
FORMULA_NAME FireWire-PT-15-UpperBounds-10
FORMULA_NAME FireWire-PT-15-UpperBounds-11
FORMULA_NAME FireWire-PT-15-UpperBounds-12
FORMULA_NAME FireWire-PT-15-UpperBounds-13
FORMULA_NAME FireWire-PT-15-UpperBounds-14
FORMULA_NAME FireWire-PT-15-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717368075157

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-06-02 22:41:16] [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]
[2024-06-02 22:41:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:41:16] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-06-02 22:41:16] [INFO ] Transformed 248 places.
[2024-06-02 22:41:16] [INFO ] Transformed 383 transitions.
[2024-06-02 22:41:16] [INFO ] Found NUPN structural information;
[2024-06-02 22:41:16] [INFO ] Parsed PT model containing 248 places and 383 transitions and 1144 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 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 383 rows 248 cols
[2024-06-02 22:41:16] [INFO ] Computed 5 invariants in 24 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 (5 resets) in 28 ms. (344 steps per ms)
FORMULA FireWire-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 140000 steps (41 resets) in 231 ms. (603 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[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]
[2024-06-02 22:41:16] [INFO ] Invariant cache hit.
[2024-06-02 22:41:17] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2024-06-02 22:41:17] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2024-06-02 22:41:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:41:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2024-06-02 22:41:17] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2024-06-02 22:41:17] [INFO ] Deduced a trap composed of 92 places in 230 ms of which 14 ms to minimize.
[2024-06-02 22:41:17] [INFO ] Deduced a trap composed of 105 places in 122 ms of which 12 ms to minimize.
[2024-06-02 22:41:17] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 2 ms to minimize.
[2024-06-02 22:41:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 548 ms
[2024-06-02 22:41:18] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 33 ms.
[2024-06-02 22:41:20] [INFO ] Deduced a trap composed of 112 places in 108 ms of which 2 ms to minimize.
[2024-06-02 22:41:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2024-06-02 22:41:20] [INFO ] Added : 281 causal constraints over 58 iterations in 2126 ms. Result :sat
Minimization took 170 ms.
[2024-06-02 22:41:20] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-02 22:41:20] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-06-02 22:41:20] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 3 ms to minimize.
[2024-06-02 22:41:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:41:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-02 22:41:20] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-06-02 22:41:20] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 5 ms to minimize.
[2024-06-02 22:41:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2024-06-02 22:41:20] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 30 ms.
[2024-06-02 22:41:22] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 2 ms to minimize.
[2024-06-02 22:41:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2024-06-02 22:41:22] [INFO ] Added : 246 causal constraints over 50 iterations in 1677 ms. Result :sat
Minimization took 182 ms.
[2024-06-02 22:41:22] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-02 22:41:22] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-06-02 22:41:23] [INFO ] Deduced a trap composed of 142 places in 99 ms of which 2 ms to minimize.
[2024-06-02 22:41:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:41:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-02 22:41:23] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-06-02 22:41:23] [INFO ] Deduced a trap composed of 142 places in 102 ms of which 1 ms to minimize.
[2024-06-02 22:41:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2024-06-02 22:41:23] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 29 ms.
[2024-06-02 22:41:25] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 1 ms to minimize.
[2024-06-02 22:41:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2024-06-02 22:41:25] [INFO ] Added : 259 causal constraints over 54 iterations in 1800 ms. Result :sat
Minimization took 190 ms.
[2024-06-02 22:41:25] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-02 22:41:25] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-06-02 22:41:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:41:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-02 22:41:25] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-06-02 22:41:25] [INFO ] Deduced a trap composed of 145 places in 95 ms of which 2 ms to minimize.
[2024-06-02 22:41:25] [INFO ] Deduced a trap composed of 130 places in 87 ms of which 2 ms to minimize.
[2024-06-02 22:41:26] [INFO ] Deduced a trap composed of 145 places in 87 ms of which 2 ms to minimize.
[2024-06-02 22:41:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 331 ms
[2024-06-02 22:41:26] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 22 ms.
[2024-06-02 22:41:28] [INFO ] Added : 299 causal constraints over 63 iterations in 1986 ms. Result :sat
Minimization took 191 ms.
[2024-06-02 22:41:28] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-02 22:41:28] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-06-02 22:41:28] [INFO ] Deduced a trap composed of 138 places in 99 ms of which 2 ms to minimize.
[2024-06-02 22:41:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:41:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-02 22:41:28] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-06-02 22:41:28] [INFO ] Deduced a trap composed of 138 places in 96 ms of which 2 ms to minimize.
[2024-06-02 22:41:28] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 2 ms to minimize.
[2024-06-02 22:41:28] [INFO ] Deduced a trap composed of 121 places in 92 ms of which 2 ms to minimize.
[2024-06-02 22:41:29] [INFO ] Deduced a trap composed of 114 places in 89 ms of which 2 ms to minimize.
[2024-06-02 22:41:29] [INFO ] Deduced a trap composed of 136 places in 87 ms of which 2 ms to minimize.
[2024-06-02 22:41:29] [INFO ] Deduced a trap composed of 136 places in 90 ms of which 2 ms to minimize.
[2024-06-02 22:41:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 638 ms
[2024-06-02 22:41:29] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 22 ms.
[2024-06-02 22:41:30] [INFO ] Deduced a trap composed of 136 places in 88 ms of which 2 ms to minimize.
[2024-06-02 22:41:30] [INFO ] Deduced a trap composed of 140 places in 90 ms of which 2 ms to minimize.
[2024-06-02 22:41:31] [INFO ] Deduced a trap composed of 134 places in 88 ms of which 2 ms to minimize.
[2024-06-02 22:41:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 418 ms
[2024-06-02 22:41:31] [INFO ] Added : 252 causal constraints over 51 iterations in 1928 ms. Result :sat
Minimization took 180 ms.
[2024-06-02 22:41:31] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-02 22:41:31] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-06-02 22:41:31] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 1 ms to minimize.
[2024-06-02 22:41:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:41:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-02 22:41:31] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-06-02 22:41:31] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 1 ms to minimize.
[2024-06-02 22:41:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2024-06-02 22:41:31] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 21 ms.
[2024-06-02 22:41:33] [INFO ] Added : 289 causal constraints over 60 iterations in 1935 ms. Result :sat
Minimization took 188 ms.
[2024-06-02 22:41:34] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-02 22:41:34] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-06-02 22:41:34] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 2 ms to minimize.
[2024-06-02 22:41:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:41:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-02 22:41:34] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2024-06-02 22:41:34] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
[2024-06-02 22:41:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2024-06-02 22:41:34] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 24 ms.
[2024-06-02 22:41:36] [INFO ] Added : 268 causal constraints over 54 iterations in 1526 ms. Result :sat
Minimization took 152 ms.
[2024-06-02 22:41:36] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-02 22:41:36] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-06-02 22:41:36] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 2 ms to minimize.
[2024-06-02 22:41:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:41:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-02 22:41:36] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-06-02 22:41:36] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 2 ms to minimize.
[2024-06-02 22:41:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2024-06-02 22:41:36] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 20 ms.
[2024-06-02 22:41:38] [INFO ] Added : 273 causal constraints over 55 iterations in 1499 ms. Result :sat
Minimization took 142 ms.
[2024-06-02 22:41:38] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-02 22:41:38] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-06-02 22:41:38] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 1 ms to minimize.
[2024-06-02 22:41:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:41:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-02 22:41:39] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-06-02 22:41:39] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 2 ms to minimize.
[2024-06-02 22:41:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2024-06-02 22:41:39] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 20 ms.
[2024-06-02 22:41:40] [INFO ] Added : 266 causal constraints over 54 iterations in 1576 ms. Result :sat
Minimization took 201 ms.
[2024-06-02 22:41:40] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-02 22:41:41] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-06-02 22:41:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:41:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-02 22:41:41] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-06-02 22:41:41] [INFO ] Deduced a trap composed of 139 places in 87 ms of which 2 ms to minimize.
[2024-06-02 22:41:41] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 4 ms to minimize.
[2024-06-02 22:41:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 209 ms
[2024-06-02 22:41:41] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 21 ms.
[2024-06-02 22:41:43] [INFO ] Added : 259 causal constraints over 52 iterations in 1586 ms. Result :sat
Minimization took 162 ms.
[2024-06-02 22:41:43] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2024-06-02 22:41:43] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2024-06-02 22:41:43] [INFO ] Deduced a trap composed of 76 places in 130 ms of which 3 ms to minimize.
[2024-06-02 22:41:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:41:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2024-06-02 22:41:43] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2024-06-02 22:41:43] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 3 ms to minimize.
[2024-06-02 22:41:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2024-06-02 22:41:43] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 20 ms.
[2024-06-02 22:41:45] [INFO ] Added : 271 causal constraints over 55 iterations in 1665 ms. Result :sat
Minimization took 173 ms.
[2024-06-02 22:41:45] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-02 22:41:45] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-06-02 22:41:45] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 2 ms to minimize.
[2024-06-02 22:41:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:41:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-02 22:41:46] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-06-02 22:41:46] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 2 ms to minimize.
[2024-06-02 22:41:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2024-06-02 22:41:46] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 19 ms.
[2024-06-02 22:41:47] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:41:47] [INFO ] Deduced a trap composed of 91 places in 83 ms of which 1 ms to minimize.
[2024-06-02 22:41:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 238 ms
[2024-06-02 22:41:47] [INFO ] Added : 210 causal constraints over 42 iterations in 1379 ms. Result :sat
Minimization took 151 ms.
[2024-06-02 22:41:47] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-02 22:41:47] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-06-02 22:41:47] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 2 ms to minimize.
[2024-06-02 22:41:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:41:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-02 22:41:48] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-06-02 22:41:48] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 2 ms to minimize.
[2024-06-02 22:41:48] [INFO ] Deduced a trap composed of 78 places in 82 ms of which 2 ms to minimize.
[2024-06-02 22:41:48] [INFO ] Deduced a trap composed of 136 places in 82 ms of which 1 ms to minimize.
[2024-06-02 22:41:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 295 ms
[2024-06-02 22:41:48] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 18 ms.
[2024-06-02 22:41:49] [INFO ] Added : 258 causal constraints over 52 iterations in 1428 ms. Result :sat
Minimization took 170 ms.
[2024-06-02 22:41:50] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-02 22:41:50] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-06-02 22:41:50] [INFO ] Deduced a trap composed of 124 places in 85 ms of which 2 ms to minimize.
[2024-06-02 22:41:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:41:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-02 22:41:50] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-06-02 22:41:50] [INFO ] Deduced a trap composed of 124 places in 90 ms of which 2 ms to minimize.
[2024-06-02 22:41:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2024-06-02 22:41:50] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 19 ms.
[2024-06-02 22:41:52] [INFO ] Added : 276 causal constraints over 56 iterations in 1660 ms. Result :sat
Minimization took 163 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[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]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[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]
Support contains 14 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 383/383 transitions.
Graph (trivial) has 175 edges and 248 vertex of which 12 / 248 are part of one of the 3 SCC in 3 ms
Free SCC test removed 9 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 667 edges and 239 vertex of which 234 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 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 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 234 transition count 328
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 43 rules applied. Total rules applied 87 place count 193 transition count 326
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 90 place count 192 transition count 324
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 92 place count 190 transition count 324
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 92 place count 190 transition count 318
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 104 place count 184 transition count 318
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 133 place count 155 transition count 289
Iterating global reduction 4 with 29 rules applied. Total rules applied 162 place count 155 transition count 289
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 163 place count 155 transition count 288
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 163 place count 155 transition count 287
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 165 place count 154 transition count 287
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 173 place count 146 transition count 267
Iterating global reduction 5 with 8 rules applied. Total rules applied 181 place count 146 transition count 267
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 182 place count 145 transition count 265
Iterating global reduction 5 with 1 rules applied. Total rules applied 183 place count 145 transition count 265
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 229 place count 122 transition count 242
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 259 place count 107 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 262 place count 107 transition count 338
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 6 with 17 rules applied. Total rules applied 279 place count 107 transition count 321
Free-agglomeration rule applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 289 place count 107 transition count 311
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 299 place count 97 transition count 311
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 300 place count 96 transition count 310
Iterating global reduction 7 with 1 rules applied. Total rules applied 301 place count 96 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 304 place count 96 transition count 307
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 305 place count 96 transition count 307
Applied a total of 305 rules in 175 ms. Remains 96 /248 variables (removed 152) and now considering 307/383 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 96/248 places, 307/383 transitions.
[2024-06-02 22:41:53] [INFO ] Flow matrix only has 298 transitions (discarded 9 similar events)
// Phase 1: matrix 298 rows 96 cols
[2024-06-02 22:41:53] [INFO ] Computed 4 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[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]
RANDOM walk for 1000000 steps (98077 resets) in 926 ms. (1078 steps per ms)
FORMULA FireWire-PT-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 9000006 steps (295740 resets) in 3423 ms. (2628 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 22:41:57] [INFO ] Flow matrix only has 298 transitions (discarded 9 similar events)
[2024-06-02 22:41:58] [INFO ] Invariant cache hit.
[2024-06-02 22:41:58] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:41:58] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-06-02 22:41:58] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 22:41:58] [INFO ] [Real]Added 38 Read/Feed constraints in 16 ms returned sat
[2024-06-02 22:41:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:41:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:41:58] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-06-02 22:41:58] [INFO ] [Nat]Added 38 Read/Feed constraints in 29 ms returned sat
[2024-06-02 22:41:58] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:41:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-06-02 22:41:58] [INFO ] Computed and/alt/rep : 124/676/124 causal constraints (skipped 172 transitions) in 18 ms.
[2024-06-02 22:41:58] [INFO ] Added : 31 causal constraints over 7 iterations in 145 ms. Result :sat
Minimization took 75 ms.
[2024-06-02 22:41:58] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 22:41:58] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-06-02 22:41:58] [INFO ] [Real]Added 38 Read/Feed constraints in 4 ms returned sat
[2024-06-02 22:41:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:41:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:41:58] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-06-02 22:41:58] [INFO ] [Nat]Added 38 Read/Feed constraints in 10 ms returned sat
[2024-06-02 22:41:58] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:41:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-06-02 22:41:58] [INFO ] Computed and/alt/rep : 124/676/124 causal constraints (skipped 172 transitions) in 16 ms.
[2024-06-02 22:41:59] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:41:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2024-06-02 22:41:59] [INFO ] Added : 41 causal constraints over 10 iterations in 296 ms. Result :sat
Minimization took 80 ms.
[2024-06-02 22:41:59] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:41:59] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-02 22:41:59] [INFO ] [Real]Added 38 Read/Feed constraints in 6 ms returned sat
[2024-06-02 22:41:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:41:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 22:41:59] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-06-02 22:41:59] [INFO ] [Nat]Added 38 Read/Feed constraints in 34 ms returned sat
[2024-06-02 22:41:59] [INFO ] Computed and/alt/rep : 124/676/124 causal constraints (skipped 172 transitions) in 17 ms.
[2024-06-02 22:41:59] [INFO ] Added : 11 causal constraints over 3 iterations in 131 ms. Result :sat
Minimization took 66 ms.
[2024-06-02 22:41:59] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:41:59] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-06-02 22:41:59] [INFO ] [Real]Added 38 Read/Feed constraints in 8 ms returned sat
[2024-06-02 22:41:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:41:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 22:41:59] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-06-02 22:41:59] [INFO ] [Nat]Added 38 Read/Feed constraints in 13 ms returned sat
[2024-06-02 22:41:59] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 0 ms to minimize.
[2024-06-02 22:41:59] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 0 ms to minimize.
[2024-06-02 22:41:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
[2024-06-02 22:41:59] [INFO ] Computed and/alt/rep : 124/676/124 causal constraints (skipped 172 transitions) in 16 ms.
[2024-06-02 22:42:00] [INFO ] Added : 36 causal constraints over 9 iterations in 171 ms. Result :sat
Minimization took 81 ms.
[2024-06-02 22:42:00] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 22:42:00] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-06-02 22:42:00] [INFO ] [Real]Added 38 Read/Feed constraints in 15 ms returned sat
[2024-06-02 22:42:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:42:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 22:42:00] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-06-02 22:42:00] [INFO ] [Nat]Added 38 Read/Feed constraints in 23 ms returned sat
[2024-06-02 22:42:00] [INFO ] Computed and/alt/rep : 124/676/124 causal constraints (skipped 172 transitions) in 19 ms.
[2024-06-02 22:42:00] [INFO ] Added : 14 causal constraints over 3 iterations in 127 ms. Result :sat
Minimization took 71 ms.
[2024-06-02 22:42:00] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:00] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-02 22:42:00] [INFO ] [Real]Added 38 Read/Feed constraints in 4 ms returned sat
[2024-06-02 22:42:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:42:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:00] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-06-02 22:42:00] [INFO ] [Nat]Added 38 Read/Feed constraints in 11 ms returned sat
[2024-06-02 22:42:00] [INFO ] Computed and/alt/rep : 124/676/124 causal constraints (skipped 172 transitions) in 19 ms.
[2024-06-02 22:42:00] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
[2024-06-02 22:42:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2024-06-02 22:42:01] [INFO ] Added : 26 causal constraints over 7 iterations in 226 ms. Result :sat
Minimization took 74 ms.
[2024-06-02 22:42:01] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:01] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-06-02 22:42:01] [INFO ] [Real]Added 38 Read/Feed constraints in 11 ms returned sat
[2024-06-02 22:42:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:42:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:01] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-06-02 22:42:01] [INFO ] [Nat]Added 38 Read/Feed constraints in 13 ms returned sat
[2024-06-02 22:42:01] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 0 ms to minimize.
[2024-06-02 22:42:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-06-02 22:42:01] [INFO ] Computed and/alt/rep : 124/676/124 causal constraints (skipped 172 transitions) in 15 ms.
[2024-06-02 22:42:01] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:42:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2024-06-02 22:42:01] [INFO ] Added : 38 causal constraints over 9 iterations in 260 ms. Result :sat
Minimization took 86 ms.
[2024-06-02 22:42:01] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 22:42:01] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-02 22:42:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:42:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 22:42:01] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-06-02 22:42:01] [INFO ] [Nat]Added 38 Read/Feed constraints in 27 ms returned sat
[2024-06-02 22:42:01] [INFO ] Computed and/alt/rep : 124/676/124 causal constraints (skipped 172 transitions) in 17 ms.
[2024-06-02 22:42:02] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:42:02] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:42:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 153 ms
[2024-06-02 22:42:02] [INFO ] Added : 55 causal constraints over 12 iterations in 401 ms. Result :sat
Minimization took 92 ms.
[2024-06-02 22:42:02] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 22:42:02] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-06-02 22:42:02] [INFO ] [Real]Added 38 Read/Feed constraints in 8 ms returned sat
[2024-06-02 22:42:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:42:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 22:42:02] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-02 22:42:02] [INFO ] [Nat]Added 38 Read/Feed constraints in 8 ms returned sat
[2024-06-02 22:42:02] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:42:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-06-02 22:42:02] [INFO ] Computed and/alt/rep : 124/676/124 causal constraints (skipped 172 transitions) in 14 ms.
[2024-06-02 22:42:02] [INFO ] Added : 24 causal constraints over 6 iterations in 127 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-15-UpperBounds-09 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 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 307/307 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 0 with 2 rules applied. Total rules applied 2 place count 96 transition count 305
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 94 transition count 305
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 7 place count 91 transition count 301
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 91 transition count 301
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 36 place count 91 transition count 275
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 89 transition count 273
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 43 place count 89 transition count 270
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 44 place count 88 transition count 269
Iterating global reduction 4 with 1 rules applied. Total rules applied 45 place count 88 transition count 269
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 50 place count 88 transition count 264
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 56 place count 85 transition count 277
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 57 place count 84 transition count 269
Iterating global reduction 5 with 1 rules applied. Total rules applied 58 place count 84 transition count 269
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 59 place count 83 transition count 267
Iterating global reduction 5 with 1 rules applied. Total rules applied 60 place count 83 transition count 267
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 61 place count 82 transition count 263
Iterating global reduction 5 with 1 rules applied. Total rules applied 62 place count 82 transition count 263
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 63 place count 81 transition count 261
Iterating global reduction 5 with 1 rules applied. Total rules applied 64 place count 81 transition count 261
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 65 place count 80 transition count 257
Iterating global reduction 5 with 1 rules applied. Total rules applied 66 place count 80 transition count 257
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 67 place count 79 transition count 255
Iterating global reduction 5 with 1 rules applied. Total rules applied 68 place count 79 transition count 255
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 69 place count 78 transition count 251
Iterating global reduction 5 with 1 rules applied. Total rules applied 70 place count 78 transition count 251
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 71 place count 77 transition count 249
Iterating global reduction 5 with 1 rules applied. Total rules applied 72 place count 77 transition count 249
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 73 place count 76 transition count 245
Iterating global reduction 5 with 1 rules applied. Total rules applied 74 place count 76 transition count 245
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 75 place count 75 transition count 243
Iterating global reduction 5 with 1 rules applied. Total rules applied 76 place count 75 transition count 243
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 77 place count 74 transition count 241
Iterating global reduction 5 with 1 rules applied. Total rules applied 78 place count 74 transition count 241
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 79 place count 73 transition count 239
Iterating global reduction 5 with 1 rules applied. Total rules applied 80 place count 73 transition count 239
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 5 with 45 rules applied. Total rules applied 125 place count 73 transition count 194
Applied a total of 125 rules in 57 ms. Remains 73 /96 variables (removed 23) and now considering 194/307 (removed 113) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 73/96 places, 194/307 transitions.
[2024-06-02 22:42:03] [INFO ] Flow matrix only has 176 transitions (discarded 18 similar events)
// Phase 1: matrix 176 rows 73 cols
[2024-06-02 22:42:03] [INFO ] Computed 4 invariants in 5 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 (98043 resets) in 655 ms. (1524 steps per ms)
BEST_FIRST walk for 5000004 steps (164163 resets) in 1506 ms. (3317 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-06-02 22:42:05] [INFO ] Flow matrix only has 176 transitions (discarded 18 similar events)
[2024-06-02 22:42:05] [INFO ] Invariant cache hit.
[2024-06-02 22:42:05] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:05] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-06-02 22:42:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:42:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:05] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-06-02 22:42:05] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-02 22:42:05] [INFO ] [Nat]Added 32 Read/Feed constraints in 8 ms returned sat
[2024-06-02 22:42:05] [INFO ] Computed and/alt/rep : 85/450/85 causal constraints (skipped 89 transitions) in 11 ms.
[2024-06-02 22:42:05] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:42:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-06-02 22:42:05] [INFO ] Added : 38 causal constraints over 9 iterations in 181 ms. Result :sat
Minimization took 55 ms.
[2024-06-02 22:42:05] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:05] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-06-02 22:42:05] [INFO ] [Real]Added 32 Read/Feed constraints in 6 ms returned sat
[2024-06-02 22:42:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:42:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:05] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-06-02 22:42:05] [INFO ] [Nat]Added 32 Read/Feed constraints in 26 ms returned sat
[2024-06-02 22:42:05] [INFO ] Computed and/alt/rep : 85/450/85 causal constraints (skipped 89 transitions) in 11 ms.
[2024-06-02 22:42:05] [INFO ] Added : 9 causal constraints over 4 iterations in 72 ms. Result :sat
Minimization took 38 ms.
[2024-06-02 22:42:05] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 22:42:06] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-06-02 22:42:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:42:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:06] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-06-02 22:42:06] [INFO ] [Nat]Added 32 Read/Feed constraints in 9 ms returned sat
[2024-06-02 22:42:06] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-02 22:42:06] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:42:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2024-06-02 22:42:06] [INFO ] Computed and/alt/rep : 85/450/85 causal constraints (skipped 89 transitions) in 10 ms.
[2024-06-02 22:42:06] [INFO ] Added : 41 causal constraints over 10 iterations in 124 ms. Result :sat
Minimization took 62 ms.
[2024-06-02 22:42:06] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:06] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-06-02 22:42:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:42:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:06] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-06-02 22:42:06] [INFO ] [Nat]Added 32 Read/Feed constraints in 22 ms returned sat
[2024-06-02 22:42:06] [INFO ] Computed and/alt/rep : 85/450/85 causal constraints (skipped 89 transitions) in 11 ms.
[2024-06-02 22:42:06] [INFO ] Added : 11 causal constraints over 4 iterations in 75 ms. Result :sat
Minimization took 41 ms.
[2024-06-02 22:42:06] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 22:42:06] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-06-02 22:42:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:42:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:06] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-06-02 22:42:06] [INFO ] [Nat]Added 32 Read/Feed constraints in 7 ms returned sat
[2024-06-02 22:42:06] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-02 22:42:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-06-02 22:42:06] [INFO ] Computed and/alt/rep : 85/450/85 causal constraints (skipped 89 transitions) in 9 ms.
[2024-06-02 22:42:06] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:42:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-06-02 22:42:06] [INFO ] Added : 32 causal constraints over 7 iterations in 159 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA FireWire-PT-15-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
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 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 194/194 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 73 transition count 193
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 72 transition count 193
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 72 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 71 transition count 192
Applied a total of 4 rules in 10 ms. Remains 71 /73 variables (removed 2) and now considering 192/194 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 71/73 places, 192/194 transitions.
[2024-06-02 22:42:07] [INFO ] Flow matrix only has 174 transitions (discarded 18 similar events)
// Phase 1: matrix 174 rows 71 cols
[2024-06-02 22:42:07] [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 (98199 resets) in 655 ms. (1524 steps per ms)
BEST_FIRST walk for 4000003 steps (131179 resets) in 1140 ms. (3505 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-06-02 22:42:08] [INFO ] Flow matrix only has 174 transitions (discarded 18 similar events)
[2024-06-02 22:42:08] [INFO ] Invariant cache hit.
[2024-06-02 22:42:08] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 22:42:08] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-06-02 22:42:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:42:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:09] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-06-02 22:42:09] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-02 22:42:09] [INFO ] [Nat]Added 32 Read/Feed constraints in 12 ms returned sat
[2024-06-02 22:42:09] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:42:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-06-02 22:42:09] [INFO ] Computed and/alt/rep : 83/450/83 causal constraints (skipped 89 transitions) in 10 ms.
[2024-06-02 22:42:09] [INFO ] Added : 33 causal constraints over 7 iterations in 96 ms. Result :sat
Minimization took 51 ms.
[2024-06-02 22:42:09] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:09] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-06-02 22:42:09] [INFO ] [Real]Added 32 Read/Feed constraints in 8 ms returned sat
[2024-06-02 22:42:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:42:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:09] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-06-02 22:42:09] [INFO ] [Nat]Added 32 Read/Feed constraints in 7 ms returned sat
[2024-06-02 22:42:09] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 0 ms to minimize.
[2024-06-02 22:42:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-06-02 22:42:09] [INFO ] Computed and/alt/rep : 83/450/83 causal constraints (skipped 89 transitions) in 11 ms.
[2024-06-02 22:42:09] [INFO ] Added : 31 causal constraints over 7 iterations in 99 ms. Result :sat
Minimization took 50 ms.
[2024-06-02 22:42:09] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 22:42:09] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-06-02 22:42:09] [INFO ] [Real]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-06-02 22:42:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:42:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 22:42:09] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-06-02 22:42:09] [INFO ] [Nat]Added 32 Read/Feed constraints in 22 ms returned sat
[2024-06-02 22:42:09] [INFO ] Computed and/alt/rep : 83/450/83 causal constraints (skipped 89 transitions) in 10 ms.
[2024-06-02 22:42:09] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-02 22:42:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-06-02 22:42:09] [INFO ] Added : 38 causal constraints over 10 iterations in 200 ms. Result :sat
Minimization took 61 ms.
[2024-06-02 22:42:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:10] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-06-02 22:42:10] [INFO ] [Real]Added 32 Read/Feed constraints in 5 ms returned sat
[2024-06-02 22:42:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:42:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:10] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-06-02 22:42:10] [INFO ] [Nat]Added 32 Read/Feed constraints in 11 ms returned sat
[2024-06-02 22:42:10] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-06-02 22:42:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-06-02 22:42:10] [INFO ] Computed and/alt/rep : 83/450/83 causal constraints (skipped 89 transitions) in 11 ms.
[2024-06-02 22:42:10] [INFO ] Added : 3 causal constraints over 1 iterations in 29 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA FireWire-PT-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 192/192 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 0 with 1 rules applied. Total rules applied 1 place count 71 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 70 transition count 191
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 70 transition count 190
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 5 place count 69 transition count 189
Applied a total of 5 rules in 9 ms. Remains 69 /71 variables (removed 2) and now considering 189/192 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 69/71 places, 189/192 transitions.
[2024-06-02 22:42:10] [INFO ] Flow matrix only has 171 transitions (discarded 18 similar events)
// Phase 1: matrix 171 rows 69 cols
[2024-06-02 22:42:10] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (97810 resets) in 638 ms. (1564 steps per ms)
BEST_FIRST walk for 3000002 steps (98450 resets) in 848 ms. (3533 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 22:42:11] [INFO ] Flow matrix only has 171 transitions (discarded 18 similar events)
[2024-06-02 22:42:11] [INFO ] Invariant cache hit.
[2024-06-02 22:42:11] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 22:42:11] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-06-02 22:42:11] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-02 22:42:11] [INFO ] [Real]Added 32 Read/Feed constraints in 9 ms returned sat
[2024-06-02 22:42:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:42:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:11] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-06-02 22:42:11] [INFO ] [Nat]Added 32 Read/Feed constraints in 13 ms returned sat
[2024-06-02 22:42:11] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-06-02 22:42:12] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-06-02 22:42:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
[2024-06-02 22:42:12] [INFO ] Computed and/alt/rep : 80/437/80 causal constraints (skipped 89 transitions) in 9 ms.
[2024-06-02 22:42:12] [INFO ] Added : 32 causal constraints over 9 iterations in 105 ms. Result :sat
Minimization took 58 ms.
[2024-06-02 22:42:12] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 22:42:12] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-06-02 22:42:12] [INFO ] [Real]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-06-02 22:42:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:42:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:12] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-06-02 22:42:12] [INFO ] [Nat]Added 32 Read/Feed constraints in 22 ms returned sat
[2024-06-02 22:42:12] [INFO ] Computed and/alt/rep : 80/437/80 causal constraints (skipped 89 transitions) in 13 ms.
[2024-06-02 22:42:12] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 0 ms to minimize.
[2024-06-02 22:42:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-06-02 22:42:12] [INFO ] Added : 34 causal constraints over 8 iterations in 177 ms. Result :sat
Minimization took 51 ms.
[2024-06-02 22:42:12] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:12] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-06-02 22:42:12] [INFO ] [Real]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-06-02 22:42:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:42:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:12] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-06-02 22:42:12] [INFO ] [Nat]Added 32 Read/Feed constraints in 17 ms returned sat
[2024-06-02 22:42:12] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-02 22:42:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-06-02 22:42:12] [INFO ] Computed and/alt/rep : 80/437/80 causal constraints (skipped 89 transitions) in 8 ms.
[2024-06-02 22:42:12] [INFO ] Added : 1 causal constraints over 1 iterations in 29 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 189/189 transitions.
Applied a total of 0 rules in 3 ms. Remains 69 /69 variables (removed 0) and now considering 189/189 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 69/69 places, 189/189 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 189/189 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2024-06-02 22:42:12] [INFO ] Flow matrix only has 171 transitions (discarded 18 similar events)
[2024-06-02 22:42:12] [INFO ] Invariant cache hit.
[2024-06-02 22:42:12] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 22:42:12] [INFO ] Flow matrix only has 171 transitions (discarded 18 similar events)
[2024-06-02 22:42:12] [INFO ] Invariant cache hit.
[2024-06-02 22:42:13] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-02 22:42:13] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-06-02 22:42:13] [INFO ] Redundant transitions in 5 ms returned []
Running 187 sub problems to find dead transitions.
[2024-06-02 22:42:13] [INFO ] Flow matrix only has 171 transitions (discarded 18 similar events)
[2024-06-02 22:42:13] [INFO ] Invariant cache hit.
[2024-06-02 22:42:13] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-02 22:42:13] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-06-02 22:42:14] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:42:14] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-02 22:42:14] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD30 is UNSAT
[2024-06-02 22:42:14] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2024-06-02 22:42:14] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-06-02 22:42:14] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:42:14] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
[2024-06-02 22:42:14] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
Problem TDEAD131 is UNSAT
Problem TDEAD152 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 9/13 constraints. Problems are: Problem set: 13 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/13 constraints. Problems are: Problem set: 13 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 171/240 variables, 69/82 constraints. Problems are: Problem set: 13 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 32/114 constraints. Problems are: Problem set: 13 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/114 constraints. Problems are: Problem set: 13 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/240 variables, 0/114 constraints. Problems are: Problem set: 13 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 114 constraints, problems are : Problem set: 13 solved, 174 unsolved in 3999 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 69/69 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 13 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 4/4 constraints. Problems are: Problem set: 13 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 9/13 constraints. Problems are: Problem set: 13 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/13 constraints. Problems are: Problem set: 13 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 171/240 variables, 69/82 constraints. Problems are: Problem set: 13 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 32/114 constraints. Problems are: Problem set: 13 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 174/288 constraints. Problems are: Problem set: 13 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/288 constraints. Problems are: Problem set: 13 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/240 variables, 0/288 constraints. Problems are: Problem set: 13 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 288 constraints, problems are : Problem set: 13 solved, 174 unsolved in 7823 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 69/69 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 174/187 constraints, Known Traps: 9/9 constraints]
After SMT, in 11966ms problems are : Problem set: 13 solved, 174 unsolved
Search for dead transitions found 13 dead transitions in 11977ms
Found 13 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 13 transitions
Dead transitions reduction (with SMT) removed 13 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 69/69 places, 176/189 transitions.
Applied a total of 0 rules in 9 ms. Remains 69 /69 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-06-02 22:42:25] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 12248 ms. Remains : 69/69 places, 176/189 transitions.
[2024-06-02 22:42:25] [INFO ] Flow matrix only has 158 transitions (discarded 18 similar events)
// Phase 1: matrix 158 rows 69 cols
[2024-06-02 22:42:25] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (97910 resets) in 595 ms. (1677 steps per ms)
BEST_FIRST walk for 3000003 steps (98647 resets) in 814 ms. (3680 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 22:42:26] [INFO ] Flow matrix only has 158 transitions (discarded 18 similar events)
[2024-06-02 22:42:26] [INFO ] Invariant cache hit.
[2024-06-02 22:42:26] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:26] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-06-02 22:42:26] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-02 22:42:26] [INFO ] [Real]Added 32 Read/Feed constraints in 7 ms returned sat
[2024-06-02 22:42:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:42:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:26] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-02 22:42:26] [INFO ] [Nat]Added 32 Read/Feed constraints in 5 ms returned sat
[2024-06-02 22:42:26] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:42:26] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-06-02 22:42:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 93 ms
[2024-06-02 22:42:26] [INFO ] Computed and/alt/rep : 80/381/80 causal constraints (skipped 76 transitions) in 8 ms.
[2024-06-02 22:42:26] [INFO ] Added : 36 causal constraints over 8 iterations in 109 ms. Result :sat
Minimization took 55 ms.
[2024-06-02 22:42:26] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:26] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-06-02 22:42:26] [INFO ] [Real]Added 32 Read/Feed constraints in 8 ms returned sat
[2024-06-02 22:42:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:42:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 22:42:27] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-02 22:42:27] [INFO ] [Nat]Added 32 Read/Feed constraints in 10 ms returned sat
[2024-06-02 22:42:27] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2024-06-02 22:42:27] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-06-02 22:42:27] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:42:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 135 ms
[2024-06-02 22:42:27] [INFO ] Computed and/alt/rep : 80/381/80 causal constraints (skipped 76 transitions) in 9 ms.
[2024-06-02 22:42:27] [INFO ] Added : 35 causal constraints over 9 iterations in 112 ms. Result :sat
Minimization took 46 ms.
[2024-06-02 22:42:27] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:27] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-02 22:42:27] [INFO ] [Real]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-06-02 22:42:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:42:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:27] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-06-02 22:42:27] [INFO ] [Nat]Added 32 Read/Feed constraints in 7 ms returned sat
[2024-06-02 22:42:27] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:42:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-06-02 22:42:27] [INFO ] Computed and/alt/rep : 80/381/80 causal constraints (skipped 76 transitions) in 11 ms.
[2024-06-02 22:42:27] [INFO ] Added : 23 causal constraints over 6 iterations in 77 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 69 /69 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 69/69 places, 176/176 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 69 /69 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-06-02 22:42:27] [INFO ] Flow matrix only has 158 transitions (discarded 18 similar events)
[2024-06-02 22:42:27] [INFO ] Invariant cache hit.
[2024-06-02 22:42:27] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 22:42:27] [INFO ] Flow matrix only has 158 transitions (discarded 18 similar events)
[2024-06-02 22:42:27] [INFO ] Invariant cache hit.
[2024-06-02 22:42:27] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-02 22:42:27] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-06-02 22:42:27] [INFO ] Redundant transitions in 2 ms returned []
Running 174 sub problems to find dead transitions.
[2024-06-02 22:42:27] [INFO ] Flow matrix only has 158 transitions (discarded 18 similar events)
[2024-06-02 22:42:27] [INFO ] Invariant cache hit.
[2024-06-02 22:42:27] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-02 22:42:28] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 0 ms to minimize.
[2024-06-02 22:42:28] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 0 ms to minimize.
[2024-06-02 22:42:28] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-02 22:42:28] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
[2024-06-02 22:42:28] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-02 22:42:28] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
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
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD126 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 6/10 constraints. Problems are: Problem set: 24 solved, 150 unsolved
[2024-06-02 22:42:29] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 1/11 constraints. Problems are: Problem set: 24 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 24 solved, 150 unsolved
At refinement iteration 5 (OVERLAPS) 158/227 variables, 69/80 constraints. Problems are: Problem set: 24 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 32/112 constraints. Problems are: Problem set: 24 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/112 constraints. Problems are: Problem set: 24 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/112 constraints. Problems are: Problem set: 24 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 112 constraints, problems are : Problem set: 24 solved, 150 unsolved in 3348 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 69/69 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 24 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 4/4 constraints. Problems are: Problem set: 24 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 7/11 constraints. Problems are: Problem set: 24 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 24 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 158/227 variables, 69/80 constraints. Problems are: Problem set: 24 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 32/112 constraints. Problems are: Problem set: 24 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 150/262 constraints. Problems are: Problem set: 24 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/262 constraints. Problems are: Problem set: 24 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/262 constraints. Problems are: Problem set: 24 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 262 constraints, problems are : Problem set: 24 solved, 150 unsolved in 7056 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 69/69 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 150/174 constraints, Known Traps: 7/7 constraints]
After SMT, in 10476ms problems are : Problem set: 24 solved, 150 unsolved
Search for dead transitions found 24 dead transitions in 10478ms
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 : 69/69 places, 152/176 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 68 transition count 157
Applied a total of 2 rules in 12 ms. Remains 68 /69 variables (removed 1) and now considering 157/152 (removed -5) transitions.
[2024-06-02 22:42:38] [INFO ] Flow matrix only has 139 transitions (discarded 18 similar events)
// Phase 1: matrix 139 rows 68 cols
[2024-06-02 22:42:38] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:42:38] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 22:42:38] [INFO ] Flow matrix only has 139 transitions (discarded 18 similar events)
[2024-06-02 22:42:38] [INFO ] Invariant cache hit.
[2024-06-02 22:42:38] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-02 22:42:38] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 68/69 places, 157/176 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 10805 ms. Remains : 68/69 places, 157/176 transitions.
[2024-06-02 22:42:38] [INFO ] Flow matrix only has 139 transitions (discarded 18 similar events)
[2024-06-02 22:42:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (97993 resets) in 579 ms. (1724 steps per ms)
BEST_FIRST walk for 3000002 steps (98557 resets) in 809 ms. (3703 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 22:42:39] [INFO ] Flow matrix only has 139 transitions (discarded 18 similar events)
[2024-06-02 22:42:39] [INFO ] Invariant cache hit.
[2024-06-02 22:42:39] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 22:42:39] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-02 22:42:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:42:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:39] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-06-02 22:42:39] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-02 22:42:39] [INFO ] [Nat]Added 25 Read/Feed constraints in 6 ms returned sat
[2024-06-02 22:42:40] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:42:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-06-02 22:42:40] [INFO ] Computed and/alt/rep : 75/412/75 causal constraints (skipped 62 transitions) in 7 ms.
[2024-06-02 22:42:40] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2024-06-02 22:42:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-06-02 22:42:40] [INFO ] Added : 35 causal constraints over 8 iterations in 142 ms. Result :sat
Minimization took 43 ms.
[2024-06-02 22:42:40] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:40] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-02 22:42:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:42:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 22:42:40] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-06-02 22:42:40] [INFO ] [Nat]Added 25 Read/Feed constraints in 7 ms returned sat
[2024-06-02 22:42:40] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:42:40] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:42:40] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
[2024-06-02 22:42:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 126 ms
[2024-06-02 22:42:40] [INFO ] Computed and/alt/rep : 75/412/75 causal constraints (skipped 62 transitions) in 7 ms.
[2024-06-02 22:42:40] [INFO ] Added : 38 causal constraints over 9 iterations in 104 ms. Result :sat
Minimization took 45 ms.
[2024-06-02 22:42:40] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:40] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-02 22:42:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:42:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:40] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-06-02 22:42:40] [INFO ] [Nat]Added 25 Read/Feed constraints in 18 ms returned sat
[2024-06-02 22:42:40] [INFO ] Computed and/alt/rep : 75/412/75 causal constraints (skipped 62 transitions) in 7 ms.
[2024-06-02 22:42:40] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:42:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-06-02 22:42:40] [INFO ] Added : 36 causal constraints over 9 iterations in 159 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 157/157 transitions.
Applied a total of 0 rules in 8 ms. Remains 68 /68 variables (removed 0) and now considering 157/157 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 68/68 places, 157/157 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 157/157 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 157/157 (removed 0) transitions.
[2024-06-02 22:42:40] [INFO ] Flow matrix only has 139 transitions (discarded 18 similar events)
[2024-06-02 22:42:40] [INFO ] Invariant cache hit.
[2024-06-02 22:42:41] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-02 22:42:41] [INFO ] Flow matrix only has 139 transitions (discarded 18 similar events)
[2024-06-02 22:42:41] [INFO ] Invariant cache hit.
[2024-06-02 22:42:41] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-02 22:42:41] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-06-02 22:42:41] [INFO ] Redundant transitions in 2 ms returned []
Running 155 sub problems to find dead transitions.
[2024-06-02 22:42:41] [INFO ] Flow matrix only has 139 transitions (discarded 18 similar events)
[2024-06-02 22:42:41] [INFO ] Invariant cache hit.
[2024-06-02 22:42:41] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-06-02 22:42:41] [INFO ] Deduced a trap composed of 45 places in 29 ms of which 0 ms to minimize.
[2024-06-02 22:42:41] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:42:41] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-02 22:42:41] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 0 ms to minimize.
[2024-06-02 22:42:41] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-06-02 22:42:42] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:42:42] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 7/11 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 139/207 variables, 68/79 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 25/104 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/104 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/207 variables, 0/104 constraints. Problems are: Problem set: 3 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 104 constraints, problems are : Problem set: 3 solved, 152 unsolved in 2789 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 3 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 7/11 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 139/207 variables, 68/79 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 25/104 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 152/256 constraints. Problems are: Problem set: 3 solved, 152 unsolved
[2024-06-02 22:42:46] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 1/257 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/257 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 9 (OVERLAPS) 0/207 variables, 0/257 constraints. Problems are: Problem set: 3 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 257 constraints, problems are : Problem set: 3 solved, 152 unsolved in 9670 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 152/155 constraints, Known Traps: 8/8 constraints]
After SMT, in 12528ms problems are : Problem set: 3 solved, 152 unsolved
Search for dead transitions found 3 dead transitions in 12531ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 68/68 places, 154/157 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2024-06-02 22:42:53] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 12681 ms. Remains : 68/68 places, 154/157 transitions.
[2024-06-02 22:42:53] [INFO ] Flow matrix only has 136 transitions (discarded 18 similar events)
// Phase 1: matrix 136 rows 68 cols
[2024-06-02 22:42:53] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (97845 resets) in 588 ms. (1697 steps per ms)
BEST_FIRST walk for 3000002 steps (98561 resets) in 793 ms. (3778 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 22:42:55] [INFO ] Flow matrix only has 136 transitions (discarded 18 similar events)
[2024-06-02 22:42:55] [INFO ] Invariant cache hit.
[2024-06-02 22:42:55] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:55] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-02 22:42:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:42:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:55] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-02 22:42:55] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-02 22:42:55] [INFO ] [Nat]Added 25 Read/Feed constraints in 5 ms returned sat
[2024-06-02 22:42:55] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:42:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-06-02 22:42:55] [INFO ] Computed and/alt/rep : 72/382/72 causal constraints (skipped 62 transitions) in 10 ms.
[2024-06-02 22:42:55] [INFO ] Added : 35 causal constraints over 7 iterations in 85 ms. Result :sat
Minimization took 39 ms.
[2024-06-02 22:42:55] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:55] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-02 22:42:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:42:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:55] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-06-02 22:42:55] [INFO ] [Nat]Added 25 Read/Feed constraints in 9 ms returned sat
[2024-06-02 22:42:55] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-06-02 22:42:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-06-02 22:42:55] [INFO ] Computed and/alt/rep : 72/382/72 causal constraints (skipped 62 transitions) in 6 ms.
[2024-06-02 22:42:55] [INFO ] Added : 40 causal constraints over 9 iterations in 95 ms. Result :sat
Minimization took 45 ms.
[2024-06-02 22:42:55] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:55] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-02 22:42:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:42:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:42:55] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-06-02 22:42:55] [INFO ] [Nat]Added 25 Read/Feed constraints in 10 ms returned sat
[2024-06-02 22:42:55] [INFO ] Computed and/alt/rep : 72/382/72 causal constraints (skipped 62 transitions) in 9 ms.
[2024-06-02 22:42:55] [INFO ] Added : 1 causal constraints over 1 iterations in 29 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 154/154 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 68/68 places, 154/154 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 154/154 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2024-06-02 22:42:55] [INFO ] Flow matrix only has 136 transitions (discarded 18 similar events)
[2024-06-02 22:42:55] [INFO ] Invariant cache hit.
[2024-06-02 22:42:55] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 22:42:55] [INFO ] Flow matrix only has 136 transitions (discarded 18 similar events)
[2024-06-02 22:42:55] [INFO ] Invariant cache hit.
[2024-06-02 22:42:55] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-02 22:42:55] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-06-02 22:42:55] [INFO ] Redundant transitions in 0 ms returned []
Running 152 sub problems to find dead transitions.
[2024-06-02 22:42:55] [INFO ] Flow matrix only has 136 transitions (discarded 18 similar events)
[2024-06-02 22:42:55] [INFO ] Invariant cache hit.
[2024-06-02 22:42:55] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-02 22:42:56] [INFO ] Deduced a trap composed of 45 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:42:56] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-06-02 22:42:56] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
[2024-06-02 22:42:56] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:42:56] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 0 ms to minimize.
[2024-06-02 22:42:56] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:42:57] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 136/204 variables, 68/79 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 25/104 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 104 constraints, problems are : Problem set: 0 solved, 152 unsolved in 2834 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 136/204 variables, 68/79 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 25/104 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 152/256 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 0/204 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 256 constraints, problems are : Problem set: 0 solved, 152 unsolved in 4908 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 7/7 constraints]
After SMT, in 7804ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 7806ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7949 ms. Remains : 68/68 places, 154/154 transitions.
RANDOM walk for 40000 steps (3896 resets) in 1020 ms. (39 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1317 resets) in 111 ms. (357 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1314 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1327 resets) in 59 ms. (666 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1318 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1293 resets) in 76 ms. (519 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1311 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 2001 steps, run visited all 6 properties in 38 ms. (steps per millisecond=52 )
Probabilistic random walk after 2001 steps, saw 766 distinct states, run finished after 42 ms. (steps per millisecond=47 ) properties seen :6
[2024-06-02 22:43:04] [INFO ] Flatten gal took : 57 ms
[2024-06-02 22:43:04] [INFO ] Flatten gal took : 21 ms
[2024-06-02 22:43:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5907266740582104234.gal : 15 ms
[2024-06-02 22:43:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10489512997027012645.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/ReachabilityCardinality5907266740582104234.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10489512997027012645.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA FireWire-PT-15-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-15-UpperBounds-05 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-15-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 3 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 108333 ms.

BK_STOP 1717368184660

--------------------
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-15"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is FireWire-PT-15, 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 r550-tall-171734899000285"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-15.tgz
mv FireWire-PT-15 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;