Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r083-tall-174860079800100.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is EisenbergMcGuire-PT-08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-174860079800100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.7M May 29 14:32 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748734923120

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 23:42:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 23:42:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 23:42:04] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2025-05-31 23:42:04] [INFO ] Transformed 712 places.
[2025-05-31 23:42:04] [INFO ] Transformed 2816 transitions.
[2025-05-31 23:42:04] [INFO ] Found NUPN structural information;
[2025-05-31 23:42:04] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 308 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 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]
[2025-05-31 23:42:04] [INFO ] Flow matrix only has 1368 transitions (discarded 1448 similar events)
// Phase 1: matrix 1368 rows 712 cols
[2025-05-31 23:42:04] [INFO ] Computed 25 invariants in 36 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 (2 resets) in 55 ms. (178 steps per ms)
FORMULA EisenbergMcGuire-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70007 steps (14 resets) in 74 ms. (933 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2025-05-31 23:42:05] [INFO ] Flow matrix only has 1368 transitions (discarded 1448 similar events)
[2025-05-31 23:42:05] [INFO ] Invariant cache hit.
[2025-05-31 23:42:05] [INFO ] [Real]Absence check using 17 positive place invariants in 23 ms returned sat
[2025-05-31 23:42:05] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 9 ms returned sat
[2025-05-31 23:42:05] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2025-05-31 23:42:06] [INFO ] State equation strengthened by 676 read => feed constraints.
[2025-05-31 23:42:06] [INFO ] [Real]Added 676 Read/Feed constraints in 141 ms returned sat
[2025-05-31 23:42:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:42:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 52 ms returned sat
[2025-05-31 23:42:06] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2025-05-31 23:42:06] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2025-05-31 23:42:06] [INFO ] [Nat]Added 676 Read/Feed constraints in 91 ms returned sat
[2025-05-31 23:42:07] [INFO ] Deduced a trap composed of 3 places in 363 ms of which 35 ms to minimize.
[2025-05-31 23:42:07] [INFO ] Deduced a trap composed of 3 places in 407 ms of which 5 ms to minimize.
[2025-05-31 23:42:08] [INFO ] Deduced a trap composed of 49 places in 304 ms of which 4 ms to minimize.
[2025-05-31 23:42:08] [INFO ] Deduced a trap composed of 3 places in 250 ms of which 4 ms to minimize.
[2025-05-31 23:42:08] [INFO ] Deduced a trap composed of 3 places in 274 ms of which 3 ms to minimize.
[2025-05-31 23:42:08] [INFO ] Deduced a trap composed of 51 places in 280 ms of which 4 ms to minimize.
[2025-05-31 23:42:09] [INFO ] Deduced a trap composed of 34 places in 274 ms of which 4 ms to minimize.
[2025-05-31 23:42:09] [INFO ] Deduced a trap composed of 75 places in 214 ms of which 4 ms to minimize.
[2025-05-31 23:42:09] [INFO ] Deduced a trap composed of 3 places in 216 ms of which 3 ms to minimize.
[2025-05-31 23:42:10] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 3 ms to minimize.
[2025-05-31 23:42:10] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 2 ms to minimize.
[2025-05-31 23:42:10] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 2 ms to minimize.
[2025-05-31 23:42:10] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 1 ms to minimize.
[2025-05-31 23:42:10] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:42:10] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3947 ms
[2025-05-31 23:42:10] [INFO ] Computed and/alt/rep : 889/2057/721 causal constraints (skipped 639 transitions) in 126 ms.
[2025-05-31 23:42:11] [INFO ] Added : 25 causal constraints over 5 iterations in 488 ms. Result :unknown
[2025-05-31 23:42:11] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2025-05-31 23:42:11] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2025-05-31 23:42:11] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2025-05-31 23:42:11] [INFO ] [Real]Added 676 Read/Feed constraints in 73 ms returned sat
[2025-05-31 23:42:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:42:11] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2025-05-31 23:42:11] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2025-05-31 23:42:12] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2025-05-31 23:42:12] [INFO ] [Nat]Added 676 Read/Feed constraints in 82 ms returned sat
[2025-05-31 23:42:12] [INFO ] Deduced a trap composed of 3 places in 231 ms of which 3 ms to minimize.
[2025-05-31 23:42:12] [INFO ] Deduced a trap composed of 3 places in 237 ms of which 3 ms to minimize.
[2025-05-31 23:42:13] [INFO ] Deduced a trap composed of 38 places in 258 ms of which 4 ms to minimize.
[2025-05-31 23:42:13] [INFO ] Deduced a trap composed of 3 places in 211 ms of which 3 ms to minimize.
[2025-05-31 23:42:13] [INFO ] Deduced a trap composed of 46 places in 208 ms of which 3 ms to minimize.
[2025-05-31 23:42:13] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 5 ms to minimize.
[2025-05-31 23:42:14] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 2 ms to minimize.
[2025-05-31 23:42:14] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 4 ms to minimize.
[2025-05-31 23:42:14] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 2 ms to minimize.
[2025-05-31 23:42:14] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 2 ms to minimize.
[2025-05-31 23:42:14] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 1 ms to minimize.
[2025-05-31 23:42:14] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 1 ms to minimize.
[2025-05-31 23:42:15] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:42:15] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2848 ms
[2025-05-31 23:42:15] [INFO ] Computed and/alt/rep : 889/2057/721 causal constraints (skipped 639 transitions) in 102 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-31 23:42:16] [INFO ] [Real]Absence check using 17 positive place invariants in 23 ms returned sat
[2025-05-31 23:42:16] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 7 ms returned sat
[2025-05-31 23:42:17] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2025-05-31 23:42:17] [INFO ] [Real]Added 676 Read/Feed constraints in 83 ms returned sat
[2025-05-31 23:42:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:42:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2025-05-31 23:42:17] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2025-05-31 23:42:17] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2025-05-31 23:42:17] [INFO ] [Nat]Added 676 Read/Feed constraints in 76 ms returned sat
[2025-05-31 23:42:18] [INFO ] Deduced a trap composed of 52 places in 242 ms of which 3 ms to minimize.
[2025-05-31 23:42:18] [INFO ] Deduced a trap composed of 36 places in 241 ms of which 3 ms to minimize.
[2025-05-31 23:42:18] [INFO ] Deduced a trap composed of 3 places in 244 ms of which 3 ms to minimize.
[2025-05-31 23:42:18] [INFO ] Deduced a trap composed of 3 places in 236 ms of which 3 ms to minimize.
[2025-05-31 23:42:19] [INFO ] Deduced a trap composed of 3 places in 245 ms of which 4 ms to minimize.
[2025-05-31 23:42:19] [INFO ] Deduced a trap composed of 67 places in 236 ms of which 3 ms to minimize.
[2025-05-31 23:42:19] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 5 ms to minimize.
[2025-05-31 23:42:20] [INFO ] Deduced a trap composed of 3 places in 245 ms of which 6 ms to minimize.
[2025-05-31 23:42:20] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 4 ms to minimize.
[2025-05-31 23:42:20] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 3 ms to minimize.
[2025-05-31 23:42:20] [INFO ] Deduced a trap composed of 63 places in 166 ms of which 2 ms to minimize.
[2025-05-31 23:42:21] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 2 ms to minimize.
[2025-05-31 23:42:21] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 2 ms to minimize.
[2025-05-31 23:42:21] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 2 ms to minimize.
[2025-05-31 23:42:21] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:42:21] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 2 ms to minimize.
[2025-05-31 23:42:21] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:42:21] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3990 ms
[2025-05-31 23:42:21] [INFO ] Computed and/alt/rep : 889/2057/721 causal constraints (skipped 639 transitions) in 84 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-31 23:42:22] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2025-05-31 23:42:22] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2025-05-31 23:42:22] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2025-05-31 23:42:22] [INFO ] [Real]Added 676 Read/Feed constraints in 81 ms returned sat
[2025-05-31 23:42:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:42:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2025-05-31 23:42:23] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2025-05-31 23:42:23] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2025-05-31 23:42:23] [INFO ] [Nat]Added 676 Read/Feed constraints in 75 ms returned sat
[2025-05-31 23:42:23] [INFO ] Deduced a trap composed of 3 places in 240 ms of which 3 ms to minimize.
[2025-05-31 23:42:23] [INFO ] Deduced a trap composed of 38 places in 237 ms of which 3 ms to minimize.
[2025-05-31 23:42:24] [INFO ] Deduced a trap composed of 34 places in 218 ms of which 3 ms to minimize.
[2025-05-31 23:42:24] [INFO ] Deduced a trap composed of 37 places in 223 ms of which 3 ms to minimize.
[2025-05-31 23:42:24] [INFO ] Deduced a trap composed of 3 places in 226 ms of which 3 ms to minimize.
[2025-05-31 23:42:24] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 2 ms to minimize.
[2025-05-31 23:42:25] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 3 ms to minimize.
[2025-05-31 23:42:25] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 3 ms to minimize.
[2025-05-31 23:42:25] [INFO ] Deduced a trap composed of 63 places in 198 ms of which 3 ms to minimize.
[2025-05-31 23:42:25] [INFO ] Deduced a trap composed of 46 places in 204 ms of which 2 ms to minimize.
[2025-05-31 23:42:26] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 3 ms to minimize.
[2025-05-31 23:42:26] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 3 ms to minimize.
[2025-05-31 23:42:26] [INFO ] Deduced a trap composed of 116 places in 114 ms of which 7 ms to minimize.
[2025-05-31 23:42:26] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2025-05-31 23:42:26] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3315 ms
[2025-05-31 23:42:26] [INFO ] Computed and/alt/rep : 889/2057/721 causal constraints (skipped 639 transitions) in 84 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-31 23:42:28] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2025-05-31 23:42:28] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2025-05-31 23:42:28] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2025-05-31 23:42:28] [INFO ] [Real]Added 676 Read/Feed constraints in 75 ms returned sat
[2025-05-31 23:42:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:42:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2025-05-31 23:42:28] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2025-05-31 23:42:28] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2025-05-31 23:42:28] [INFO ] [Nat]Added 676 Read/Feed constraints in 71 ms returned sat
[2025-05-31 23:42:29] [INFO ] Deduced a trap composed of 3 places in 208 ms of which 3 ms to minimize.
[2025-05-31 23:42:29] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 2 ms to minimize.
[2025-05-31 23:42:29] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 3 ms to minimize.
[2025-05-31 23:42:29] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 2 ms to minimize.
[2025-05-31 23:42:29] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 2 ms to minimize.
[2025-05-31 23:42:30] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 3 ms to minimize.
[2025-05-31 23:42:30] [INFO ] Deduced a trap composed of 3 places in 297 ms of which 4 ms to minimize.
[2025-05-31 23:42:30] [INFO ] Deduced a trap composed of 38 places in 226 ms of which 3 ms to minimize.
[2025-05-31 23:42:31] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 3 ms to minimize.
[2025-05-31 23:42:31] [INFO ] Deduced a trap composed of 74 places in 223 ms of which 3 ms to minimize.
[2025-05-31 23:42:31] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 3 ms to minimize.
[2025-05-31 23:42:31] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
[2025-05-31 23:42:31] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2855 ms
[2025-05-31 23:42:31] [INFO ] Computed and/alt/rep : 889/2057/721 causal constraints (skipped 639 transitions) in 101 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-31 23:42:33] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2025-05-31 23:42:33] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2025-05-31 23:42:33] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2025-05-31 23:42:33] [INFO ] [Real]Added 676 Read/Feed constraints in 76 ms returned sat
[2025-05-31 23:42:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:42:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2025-05-31 23:42:34] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 10 ms returned sat
[2025-05-31 23:42:34] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2025-05-31 23:42:34] [INFO ] [Nat]Added 676 Read/Feed constraints in 67 ms returned sat
[2025-05-31 23:42:34] [INFO ] Deduced a trap composed of 3 places in 274 ms of which 3 ms to minimize.
[2025-05-31 23:42:35] [INFO ] Deduced a trap composed of 3 places in 275 ms of which 4 ms to minimize.
[2025-05-31 23:42:35] [INFO ] Deduced a trap composed of 3 places in 280 ms of which 3 ms to minimize.
[2025-05-31 23:42:35] [INFO ] Deduced a trap composed of 37 places in 282 ms of which 3 ms to minimize.
[2025-05-31 23:42:36] [INFO ] Deduced a trap composed of 3 places in 272 ms of which 4 ms to minimize.
[2025-05-31 23:42:36] [INFO ] Deduced a trap composed of 223 places in 268 ms of which 3 ms to minimize.
[2025-05-31 23:42:36] [INFO ] Deduced a trap composed of 67 places in 243 ms of which 3 ms to minimize.
[2025-05-31 23:42:36] [INFO ] Deduced a trap composed of 55 places in 252 ms of which 4 ms to minimize.
[2025-05-31 23:42:37] [INFO ] Deduced a trap composed of 3 places in 282 ms of which 3 ms to minimize.
[2025-05-31 23:42:37] [INFO ] Deduced a trap composed of 50 places in 276 ms of which 3 ms to minimize.
[2025-05-31 23:42:37] [INFO ] Deduced a trap composed of 229 places in 288 ms of which 3 ms to minimize.
[2025-05-31 23:42:38] [INFO ] Deduced a trap composed of 43 places in 244 ms of which 3 ms to minimize.
[2025-05-31 23:42:38] [INFO ] Deduced a trap composed of 35 places in 237 ms of which 3 ms to minimize.
[2025-05-31 23:42:38] [INFO ] Deduced a trap composed of 3 places in 205 ms of which 2 ms to minimize.
[2025-05-31 23:42:38] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 1 ms to minimize.
[2025-05-31 23:42:39] [INFO ] Deduced a trap composed of 3 places in 318 ms of which 4 ms to minimize.
[2025-05-31 23:42:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-31 23:42:39] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2025-05-31 23:42:39] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2025-05-31 23:42:39] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2025-05-31 23:42:39] [INFO ] [Real]Added 676 Read/Feed constraints in 68 ms returned sat
[2025-05-31 23:42:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:42:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2025-05-31 23:42:39] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2025-05-31 23:42:40] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2025-05-31 23:42:40] [INFO ] [Nat]Added 676 Read/Feed constraints in 74 ms returned sat
[2025-05-31 23:42:40] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 4 ms to minimize.
[2025-05-31 23:42:40] [INFO ] Deduced a trap composed of 3 places in 247 ms of which 4 ms to minimize.
[2025-05-31 23:42:41] [INFO ] Deduced a trap composed of 105 places in 255 ms of which 3 ms to minimize.
[2025-05-31 23:42:41] [INFO ] Deduced a trap composed of 44 places in 231 ms of which 3 ms to minimize.
[2025-05-31 23:42:41] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 3 ms to minimize.
[2025-05-31 23:42:41] [INFO ] Deduced a trap composed of 37 places in 233 ms of which 4 ms to minimize.
[2025-05-31 23:42:42] [INFO ] Deduced a trap composed of 3 places in 234 ms of which 3 ms to minimize.
[2025-05-31 23:42:42] [INFO ] Deduced a trap composed of 3 places in 197 ms of which 3 ms to minimize.
[2025-05-31 23:42:42] [INFO ] Deduced a trap composed of 3 places in 210 ms of which 3 ms to minimize.
[2025-05-31 23:42:42] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 3 ms to minimize.
[2025-05-31 23:42:43] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 3 ms to minimize.
[2025-05-31 23:42:43] [INFO ] Deduced a trap composed of 153 places in 132 ms of which 2 ms to minimize.
[2025-05-31 23:42:43] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 2 ms to minimize.
[2025-05-31 23:42:43] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 2 ms to minimize.
[2025-05-31 23:42:43] [INFO ] Deduced a trap composed of 108 places in 130 ms of which 1 ms to minimize.
[2025-05-31 23:42:44] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
[2025-05-31 23:42:44] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2025-05-31 23:42:44] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 1 ms to minimize.
[2025-05-31 23:42:44] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4197 ms
[2025-05-31 23:42:44] [INFO ] Computed and/alt/rep : 889/2057/721 causal constraints (skipped 639 transitions) in 82 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 1] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 712 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 712 transition count 2808
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 704 transition count 2808
Performed 197 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 197 Pre rules applied. Total rules applied 16 place count 704 transition count 2611
Deduced a syphon composed of 197 places in 3 ms
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 2 with 394 rules applied. Total rules applied 410 place count 507 transition count 2611
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 466 place count 451 transition count 2163
Iterating global reduction 2 with 56 rules applied. Total rules applied 522 place count 451 transition count 2163
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 4 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 634 place count 395 transition count 2107
Applied a total of 634 rules in 266 ms. Remains 395 /712 variables (removed 317) and now considering 2107/2816 (removed 709) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 395/712 places, 2107/2816 transitions.
[2025-05-31 23:42:45] [INFO ] Flow matrix only has 659 transitions (discarded 1448 similar events)
// Phase 1: matrix 659 rows 395 cols
[2025-05-31 23:42:45] [INFO ] Computed 25 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 1] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA EisenbergMcGuire-PT-08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 1920 ms. (520 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 2782 ms. (2155 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-31 23:42:50] [INFO ] Flow matrix only has 659 transitions (discarded 1448 similar events)
[2025-05-31 23:42:50] [INFO ] Invariant cache hit.
[2025-05-31 23:42:50] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-05-31 23:42:50] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2025-05-31 23:42:50] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2025-05-31 23:42:50] [INFO ] State equation strengthened by 284 read => feed constraints.
[2025-05-31 23:42:50] [INFO ] [Real]Added 284 Read/Feed constraints in 35 ms returned sat
[2025-05-31 23:42:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:42:50] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-05-31 23:42:50] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2025-05-31 23:42:50] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2025-05-31 23:42:50] [INFO ] [Nat]Added 284 Read/Feed constraints in 28 ms returned sat
[2025-05-31 23:42:50] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2025-05-31 23:42:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2025-05-31 23:42:50] [INFO ] Computed and/alt/rep : 572/1395/404 causal constraints (skipped 247 transitions) in 48 ms.
[2025-05-31 23:42:51] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2025-05-31 23:42:51] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:42:52] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2025-05-31 23:42:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 349 ms
[2025-05-31 23:42:52] [INFO ] Added : 147 causal constraints over 31 iterations in 1566 ms. Result :sat
Minimization took 182 ms.
[2025-05-31 23:42:52] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2025-05-31 23:42:52] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2025-05-31 23:42:52] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2025-05-31 23:42:52] [INFO ] [Real]Added 284 Read/Feed constraints in 28 ms returned sat
[2025-05-31 23:42:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:42:52] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-05-31 23:42:52] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2025-05-31 23:42:53] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2025-05-31 23:42:53] [INFO ] [Nat]Added 284 Read/Feed constraints in 30 ms returned sat
[2025-05-31 23:42:53] [INFO ] Computed and/alt/rep : 572/1395/404 causal constraints (skipped 247 transitions) in 48 ms.
[2025-05-31 23:42:53] [INFO ] Added : 64 causal constraints over 13 iterations in 521 ms. Result :sat
Minimization took 160 ms.
[2025-05-31 23:42:53] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-05-31 23:42:53] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2025-05-31 23:42:53] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2025-05-31 23:42:53] [INFO ] [Real]Added 284 Read/Feed constraints in 30 ms returned sat
[2025-05-31 23:42:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:42:54] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-05-31 23:42:54] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 8 ms returned sat
[2025-05-31 23:42:54] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2025-05-31 23:42:54] [INFO ] [Nat]Added 284 Read/Feed constraints in 28 ms returned sat
[2025-05-31 23:42:54] [INFO ] Computed and/alt/rep : 572/1395/404 causal constraints (skipped 247 transitions) in 48 ms.
[2025-05-31 23:42:55] [INFO ] Deduced a trap composed of 103 places in 176 ms of which 2 ms to minimize.
[2025-05-31 23:42:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2025-05-31 23:42:55] [INFO ] Added : 78 causal constraints over 16 iterations in 864 ms. Result :sat
Minimization took 165 ms.
[2025-05-31 23:42:55] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-05-31 23:42:55] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2025-05-31 23:42:55] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2025-05-31 23:42:55] [INFO ] [Real]Added 284 Read/Feed constraints in 41 ms returned sat
[2025-05-31 23:42:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:42:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-05-31 23:42:55] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2025-05-31 23:42:55] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2025-05-31 23:42:55] [INFO ] [Nat]Added 284 Read/Feed constraints in 27 ms returned sat
[2025-05-31 23:42:55] [INFO ] Computed and/alt/rep : 572/1395/404 causal constraints (skipped 247 transitions) in 50 ms.
[2025-05-31 23:42:56] [INFO ] Added : 43 causal constraints over 9 iterations in 380 ms. Result :sat
Minimization took 163 ms.
[2025-05-31 23:42:56] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-05-31 23:42:56] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 11 ms returned sat
[2025-05-31 23:42:56] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2025-05-31 23:42:56] [INFO ] [Real]Added 284 Read/Feed constraints in 31 ms returned sat
[2025-05-31 23:42:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:42:56] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-05-31 23:42:56] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2025-05-31 23:42:56] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2025-05-31 23:42:56] [INFO ] [Nat]Added 284 Read/Feed constraints in 27 ms returned sat
[2025-05-31 23:42:56] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:42:56] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:42:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 176 ms
[2025-05-31 23:42:57] [INFO ] Computed and/alt/rep : 572/1395/404 causal constraints (skipped 247 transitions) in 48 ms.
[2025-05-31 23:42:57] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 0 ms to minimize.
[2025-05-31 23:42:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2025-05-31 23:42:57] [INFO ] Added : 84 causal constraints over 17 iterations in 783 ms. Result :sat
Minimization took 166 ms.
[2025-05-31 23:42:58] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-05-31 23:42:58] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2025-05-31 23:42:58] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2025-05-31 23:42:58] [INFO ] [Real]Added 284 Read/Feed constraints in 33 ms returned sat
[2025-05-31 23:42:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:42:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-05-31 23:42:58] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2025-05-31 23:42:58] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2025-05-31 23:42:58] [INFO ] [Nat]Added 284 Read/Feed constraints in 30 ms returned sat
[2025-05-31 23:42:58] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2025-05-31 23:42:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2025-05-31 23:42:58] [INFO ] Computed and/alt/rep : 572/1395/404 causal constraints (skipped 247 transitions) in 49 ms.
[2025-05-31 23:42:59] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2025-05-31 23:42:59] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:42:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 194 ms
[2025-05-31 23:42:59] [INFO ] Added : 120 causal constraints over 24 iterations in 1164 ms. Result :sat
Minimization took 184 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 395 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 395/395 places, 2107/2107 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 395 transition count 2106
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 394 transition count 2106
Applied a total of 2 rules in 104 ms. Remains 394 /395 variables (removed 1) and now considering 2106/2107 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 394/395 places, 2106/2107 transitions.
[2025-05-31 23:43:00] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
// Phase 1: matrix 658 rows 394 cols
[2025-05-31 23:43:00] [INFO ] Computed 25 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA EisenbergMcGuire-PT-08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 1711 ms. (584 steps per ms)
BEST_FIRST walk for 5000005 steps (10 resets) in 2307 ms. (2166 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-05-31 23:43:04] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2025-05-31 23:43:04] [INFO ] Invariant cache hit.
[2025-05-31 23:43:04] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-05-31 23:43:04] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 8 ms returned sat
[2025-05-31 23:43:04] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2025-05-31 23:43:04] [INFO ] State equation strengthened by 284 read => feed constraints.
[2025-05-31 23:43:05] [INFO ] [Real]Added 284 Read/Feed constraints in 42 ms returned sat
[2025-05-31 23:43:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:43:05] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-05-31 23:43:05] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2025-05-31 23:43:05] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2025-05-31 23:43:05] [INFO ] [Nat]Added 284 Read/Feed constraints in 28 ms returned sat
[2025-05-31 23:43:05] [INFO ] Computed and/alt/rep : 571/1394/403 causal constraints (skipped 247 transitions) in 53 ms.
[2025-05-31 23:43:06] [INFO ] Added : 107 causal constraints over 22 iterations in 839 ms. Result :sat
Minimization took 153 ms.
[2025-05-31 23:43:06] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-05-31 23:43:06] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2025-05-31 23:43:06] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2025-05-31 23:43:06] [INFO ] [Real]Added 284 Read/Feed constraints in 36 ms returned sat
[2025-05-31 23:43:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:43:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-05-31 23:43:06] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2025-05-31 23:43:06] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2025-05-31 23:43:06] [INFO ] [Nat]Added 284 Read/Feed constraints in 34 ms returned sat
[2025-05-31 23:43:06] [INFO ] Computed and/alt/rep : 571/1394/403 causal constraints (skipped 247 transitions) in 51 ms.
[2025-05-31 23:43:07] [INFO ] Deduced a trap composed of 58 places in 174 ms of which 3 ms to minimize.
[2025-05-31 23:43:07] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 0 ms to minimize.
[2025-05-31 23:43:08] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2025-05-31 23:43:08] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:43:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 507 ms
[2025-05-31 23:43:08] [INFO ] Added : 114 causal constraints over 24 iterations in 1529 ms. Result :sat
Minimization took 175 ms.
[2025-05-31 23:43:08] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-05-31 23:43:08] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2025-05-31 23:43:08] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2025-05-31 23:43:08] [INFO ] [Real]Added 284 Read/Feed constraints in 37 ms returned sat
[2025-05-31 23:43:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:43:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-05-31 23:43:08] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2025-05-31 23:43:08] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2025-05-31 23:43:08] [INFO ] [Nat]Added 284 Read/Feed constraints in 37 ms returned sat
[2025-05-31 23:43:09] [INFO ] Computed and/alt/rep : 571/1394/403 causal constraints (skipped 247 transitions) in 48 ms.
[2025-05-31 23:43:09] [INFO ] Added : 90 causal constraints over 18 iterations in 683 ms. Result :sat
Minimization took 146 ms.
[2025-05-31 23:43:09] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2025-05-31 23:43:09] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2025-05-31 23:43:10] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2025-05-31 23:43:10] [INFO ] [Real]Added 284 Read/Feed constraints in 37 ms returned sat
[2025-05-31 23:43:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:43:10] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-05-31 23:43:10] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2025-05-31 23:43:10] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2025-05-31 23:43:10] [INFO ] [Nat]Added 284 Read/Feed constraints in 30 ms returned sat
[2025-05-31 23:43:10] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2025-05-31 23:43:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2025-05-31 23:43:10] [INFO ] Computed and/alt/rep : 571/1394/403 causal constraints (skipped 247 transitions) in 48 ms.
[2025-05-31 23:43:11] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2025-05-31 23:43:11] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
[2025-05-31 23:43:11] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2025-05-31 23:43:11] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:43:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 514 ms
[2025-05-31 23:43:11] [INFO ] Added : 110 causal constraints over 23 iterations in 1510 ms. Result :sat
Minimization took 162 ms.
[2025-05-31 23:43:12] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-05-31 23:43:12] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2025-05-31 23:43:12] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2025-05-31 23:43:12] [INFO ] [Real]Added 284 Read/Feed constraints in 36 ms returned sat
[2025-05-31 23:43:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:43:12] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-05-31 23:43:12] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2025-05-31 23:43:12] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2025-05-31 23:43:12] [INFO ] [Nat]Added 284 Read/Feed constraints in 28 ms returned sat
[2025-05-31 23:43:12] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2025-05-31 23:43:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2025-05-31 23:43:12] [INFO ] Computed and/alt/rep : 571/1394/403 causal constraints (skipped 247 transitions) in 48 ms.
[2025-05-31 23:43:13] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2025-05-31 23:43:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2025-05-31 23:43:13] [INFO ] Added : 93 causal constraints over 20 iterations in 913 ms. Result :sat
Minimization took 148 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 63 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 394/394 places, 2106/2106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 62 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
[2025-05-31 23:43:14] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2025-05-31 23:43:14] [INFO ] Invariant cache hit.
[2025-05-31 23:43:14] [INFO ] Implicit Places using invariants in 539 ms returned []
[2025-05-31 23:43:14] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2025-05-31 23:43:14] [INFO ] Invariant cache hit.
[2025-05-31 23:43:15] [INFO ] State equation strengthened by 284 read => feed constraints.
[2025-05-31 23:43:16] [INFO ] Implicit Places using invariants and state equation in 1487 ms returned []
Implicit Place search using SMT with State Equation took 2029 ms to find 0 implicit places.
[2025-05-31 23:43:16] [INFO ] Redundant transitions in 102 ms returned []
Running 2098 sub problems to find dead transitions.
[2025-05-31 23:43:16] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2025-05-31 23:43:16] [INFO ] Invariant cache hit.
[2025-05-31 23:43:16] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2025-05-31 23:43:31] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 2 ms to minimize.
[2025-05-31 23:43:31] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
[2025-05-31 23:43:31] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2025-05-31 23:43:31] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:43:31] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:43:31] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2025-05-31 23:43:31] [INFO ] Deduced a trap composed of 58 places in 119 ms of which 1 ms to minimize.
[2025-05-31 23:43:32] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2025-05-31 23:43:32] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 2 ms to minimize.
[2025-05-31 23:43:32] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 2 ms to minimize.
[2025-05-31 23:43:33] [INFO ] Deduced a trap composed of 54 places in 120 ms of which 2 ms to minimize.
[2025-05-31 23:43:33] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 2 ms to minimize.
[2025-05-31 23:43:33] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 1 ms to minimize.
[2025-05-31 23:43:33] [INFO ] Deduced a trap composed of 75 places in 149 ms of which 2 ms to minimize.
[2025-05-31 23:43:33] [INFO ] Deduced a trap composed of 79 places in 146 ms of which 2 ms to minimize.
[2025-05-31 23:43:33] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 2 ms to minimize.
[2025-05-31 23:43:34] [INFO ] Deduced a trap composed of 67 places in 142 ms of which 3 ms to minimize.
[2025-05-31 23:43:34] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:43:34] [INFO ] Deduced a trap composed of 68 places in 134 ms of which 1 ms to minimize.
[2025-05-31 23:43:34] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2025-05-31 23:43:36] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 2 ms to minimize.
[2025-05-31 23:43:36] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 2 ms to minimize.
[2025-05-31 23:43:37] [INFO ] Deduced a trap composed of 67 places in 116 ms of which 2 ms to minimize.
[2025-05-31 23:43:38] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:43:38] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 2 ms to minimize.
[2025-05-31 23:43:38] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 2 ms to minimize.
[2025-05-31 23:43:39] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 2 ms to minimize.
[2025-05-31 23:43:39] [INFO ] Deduced a trap composed of 52 places in 112 ms of which 1 ms to minimize.
[2025-05-31 23:43:39] [INFO ] Deduced a trap composed of 56 places in 126 ms of which 2 ms to minimize.
[2025-05-31 23:43:40] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 1 ms to minimize.
[2025-05-31 23:43:40] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 2 ms to minimize.
[2025-05-31 23:43:40] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 1 ms to minimize.
[2025-05-31 23:43:41] [INFO ] Deduced a trap composed of 76 places in 128 ms of which 2 ms to minimize.
[2025-05-31 23:43:41] [INFO ] Deduced a trap composed of 71 places in 141 ms of which 2 ms to minimize.
[2025-05-31 23:43:41] [INFO ] Deduced a trap composed of 66 places in 135 ms of which 2 ms to minimize.
[2025-05-31 23:43:41] [INFO ] Deduced a trap composed of 104 places in 159 ms of which 2 ms to minimize.
[2025-05-31 23:43:42] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 2 ms to minimize.
[2025-05-31 23:43:42] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 2 ms to minimize.
[2025-05-31 23:43:42] [INFO ] Deduced a trap composed of 57 places in 145 ms of which 2 ms to minimize.
[2025-05-31 23:43:42] [INFO ] Deduced a trap composed of 47 places in 156 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1052 variables, and 65 constraints, problems are : Problem set: 0 solved, 2098 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2098/2098 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 40/65 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2025-05-31 23:43:54] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 2 ms to minimize.
[2025-05-31 23:43:55] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2025-05-31 23:43:57] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 2 ms to minimize.
[2025-05-31 23:43:57] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2025-05-31 23:44:00] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:44:03] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:44:06] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:44:09] [INFO ] Deduced a trap composed of 18 places in 191 ms of which 3 ms to minimize.
[2025-05-31 23:44:09] [INFO ] Deduced a trap composed of 27 places in 178 ms of which 3 ms to minimize.
[2025-05-31 23:44:10] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 3 ms to minimize.
[2025-05-31 23:44:10] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 3 ms to minimize.
[2025-05-31 23:44:10] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 2 ms to minimize.
[2025-05-31 23:44:10] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 2 ms to minimize.
[2025-05-31 23:44:10] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 2 ms to minimize.
[2025-05-31 23:44:11] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 2 ms to minimize.
[2025-05-31 23:44:11] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2025-05-31 23:44:11] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
[2025-05-31 23:44:11] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2025-05-31 23:44:11] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:44:11] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2025-05-31 23:44:12] [INFO ] Deduced a trap composed of 61 places in 99 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1052 variables, and 86 constraints, problems are : Problem set: 0 solved, 2098 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 0/2098 constraints, Known Traps: 61/61 constraints]
After SMT, in 61303ms problems are : Problem set: 0 solved, 2098 unsolved
Search for dead transitions found 0 dead transitions in 61338ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63567 ms. Remains : 394/394 places, 2106/2106 transitions.
RANDOM walk for 40000 steps (8 resets) in 1076 ms. (37 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 10/10 properties
[2025-05-31 23:44:19] [INFO ] Flatten gal took : 330 ms
[2025-05-31 23:44:19] [INFO ] Flatten gal took : 201 ms
[2025-05-31 23:44:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10103394600272142053.gal : 62 ms
[2025-05-31 23:44:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12826801924478029236.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/ReachabilityCardinality10103394600272142053.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12826801924478029236.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality12826801924478029236.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :8 after 22
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :22 after 23
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :23 after 29
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :29 after 72
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :72 after 283
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :283 after 396
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :396 after 1038
Interrupted probabilistic random walk after 332406 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :8 out of 10
Probabilistic random walk after 332406 steps, saw 186555 distinct states, run finished after 3004 ms. (steps per millisecond=110 ) properties seen :8
[2025-05-31 23:44:21] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2025-05-31 23:44:21] [INFO ] Invariant cache hit.
[2025-05-31 23:44:21] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:44:21] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 254/644 variables, 14/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/644 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 14/658 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/658 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 394/1052 variables, 268/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1052 variables, 247/704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1052 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1052 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1052/1052 variables, and 704 constraints, problems are : Problem set: 0 solved, 2 unsolved in 462 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 254/644 variables, 14/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/644 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 14/658 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/658 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/658 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 394/1052 variables, 268/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1052 variables, 247/706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1052 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :1038 after 4103
At refinement iteration 24 (OVERLAPS) 0/1052 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1052/1052 variables, and 706 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1061 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1554ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 140 ms.
Support contains 1 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 394 transition count 2104
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 392 transition count 2104
Applied a total of 4 rules in 61 ms. Remains 392 /394 variables (removed 2) and now considering 2104/2106 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 392/394 places, 2104/2106 transitions.
RANDOM walk for 40000 steps (8 resets) in 274 ms. (145 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 355617 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 2
Probabilistic random walk after 355617 steps, saw 197617 distinct states, run finished after 3002 ms. (steps per millisecond=118 ) properties seen :0
[2025-05-31 23:44:26] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2025-05-31 23:44:26] [INFO ] Computed 25 invariants in 3 ms
[2025-05-31 23:44:26] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:44:26] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 13/656 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 392/1048 variables, 266/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 247/702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1048 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 702 constraints, problems are : Problem set: 0 solved, 2 unsolved in 446 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:44:27] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/643 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 13/656 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/656 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 392/1048 variables, 266/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 247/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 705 constraints, problems are : Problem set: 0 solved, 2 unsolved in 681 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1146ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 148 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 73 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 54 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2025-05-31 23:44:28] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-05-31 23:44:28] [INFO ] Invariant cache hit.
[2025-05-31 23:44:28] [INFO ] Implicit Places using invariants in 329 ms returned []
[2025-05-31 23:44:28] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-05-31 23:44:28] [INFO ] Invariant cache hit.
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :4103 after 11203
[2025-05-31 23:44:28] [INFO ] State equation strengthened by 284 read => feed constraints.
[2025-05-31 23:44:30] [INFO ] Implicit Places using invariants and state equation in 1626 ms returned []
Implicit Place search using SMT with State Equation took 1956 ms to find 0 implicit places.
[2025-05-31 23:44:30] [INFO ] Redundant transitions in 119 ms returned []
Running 2096 sub problems to find dead transitions.
[2025-05-31 23:44:30] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-05-31 23:44:30] [INFO ] Invariant cache hit.
[2025-05-31 23:44:30] [INFO ] State equation strengthened by 284 read => feed constraints.
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :11203 after 18695
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-05-31 23:44:45] [INFO ] Deduced a trap composed of 3 places in 203 ms of which 2 ms to minimize.
[2025-05-31 23:44:45] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 2 ms to minimize.
[2025-05-31 23:44:45] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 1 ms to minimize.
[2025-05-31 23:44:45] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2025-05-31 23:44:45] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:44:45] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:44:45] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2025-05-31 23:44:46] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 2 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 32768
SDD size :18695 after 79401
[2025-05-31 23:44:46] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 2 ms to minimize.
[2025-05-31 23:44:47] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 2 ms to minimize.
[2025-05-31 23:44:47] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 2 ms to minimize.
[2025-05-31 23:44:47] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 1 ms to minimize.
[2025-05-31 23:44:47] [INFO ] Deduced a trap composed of 48 places in 117 ms of which 2 ms to minimize.
[2025-05-31 23:44:47] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 2 ms to minimize.
[2025-05-31 23:44:48] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 2 ms to minimize.
[2025-05-31 23:44:48] [INFO ] Deduced a trap composed of 71 places in 138 ms of which 2 ms to minimize.
[2025-05-31 23:44:48] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 2 ms to minimize.
[2025-05-31 23:44:48] [INFO ] Deduced a trap composed of 79 places in 148 ms of which 2 ms to minimize.
[2025-05-31 23:44:48] [INFO ] Deduced a trap composed of 77 places in 163 ms of which 2 ms to minimize.
[2025-05-31 23:44:49] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-05-31 23:44:52] [INFO ] Deduced a trap composed of 67 places in 133 ms of which 1 ms to minimize.
[2025-05-31 23:44:52] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 2 ms to minimize.
[2025-05-31 23:44:52] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 2 ms to minimize.
[2025-05-31 23:44:53] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 2 ms to minimize.
[2025-05-31 23:44:53] [INFO ] Deduced a trap composed of 68 places in 142 ms of which 2 ms to minimize.
[2025-05-31 23:44:53] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 1 ms to minimize.
[2025-05-31 23:44:54] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 2 ms to minimize.
[2025-05-31 23:44:55] [INFO ] Deduced a trap composed of 81 places in 145 ms of which 2 ms to minimize.
[2025-05-31 23:44:55] [INFO ] Deduced a trap composed of 73 places in 158 ms of which 2 ms to minimize.
[2025-05-31 23:44:55] [INFO ] Deduced a trap composed of 88 places in 157 ms of which 2 ms to minimize.
[2025-05-31 23:44:55] [INFO ] Deduced a trap composed of 76 places in 159 ms of which 2 ms to minimize.
[2025-05-31 23:44:56] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 3 ms to minimize.
[2025-05-31 23:44:56] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 2 ms to minimize.
[2025-05-31 23:44:56] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 2 ms to minimize.
[2025-05-31 23:44:56] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 2 ms to minimize.
[2025-05-31 23:44:56] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 2 ms to minimize.
[2025-05-31 23:44:56] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 2 ms to minimize.
[2025-05-31 23:44:57] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:44:57] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 1 ms to minimize.
[2025-05-31 23:44:57] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/1048 variables, and 65 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 40/65 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-05-31 23:45:06] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 2 ms to minimize.
[2025-05-31 23:45:06] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 3 ms to minimize.
[2025-05-31 23:45:08] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 1 ms to minimize.
[2025-05-31 23:45:08] [INFO ] Deduced a trap composed of 80 places in 154 ms of which 2 ms to minimize.
[2025-05-31 23:45:08] [INFO ] Deduced a trap composed of 94 places in 153 ms of which 2 ms to minimize.
[2025-05-31 23:45:09] [INFO ] Deduced a trap composed of 83 places in 184 ms of which 2 ms to minimize.
[2025-05-31 23:45:09] [INFO ] Deduced a trap composed of 49 places in 180 ms of which 2 ms to minimize.
[2025-05-31 23:45:09] [INFO ] Deduced a trap composed of 76 places in 180 ms of which 2 ms to minimize.
[2025-05-31 23:45:09] [INFO ] Deduced a trap composed of 67 places in 186 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2025-05-31 23:45:09] [INFO ] Flatten gal took : 149 ms
[2025-05-31 23:45:09] [INFO ] Deduced a trap composed of 69 places in 201 ms of which 2 ms to minimize.
[2025-05-31 23:45:09] [INFO ] Applying decomposition
[2025-05-31 23:45:10] [INFO ] Flatten gal took : 77 ms
[2025-05-31 23:45:10] [INFO ] Deduced a trap composed of 61 places in 177 ms of which 2 ms to minimize.
[2025-05-31 23:45:10] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:45:10] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4290460402327269992.txt' '-o' '/tmp/graph4290460402327269992.bin' '-w' '/tmp/graph4290460402327269992.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4290460402327269992.bin' '-l' '-1' '-v' '-w' '/tmp/graph4290460402327269992.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:45:10] [INFO ] Decomposing Gal with order
[2025-05-31 23:45:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:45:10] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 2 ms to minimize.
[2025-05-31 23:45:10] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 2 ms to minimize.
[2025-05-31 23:45:10] [INFO ] Deduced a trap composed of 82 places in 163 ms of which 2 ms to minimize.
[2025-05-31 23:45:10] [INFO ] Removed a total of 4377 redundant transitions.
[2025-05-31 23:45:11] [INFO ] Deduced a trap composed of 66 places in 170 ms of which 2 ms to minimize.
[2025-05-31 23:45:11] [INFO ] Flatten gal took : 471 ms
[2025-05-31 23:45:11] [INFO ] Deduced a trap composed of 73 places in 166 ms of which 2 ms to minimize.
[2025-05-31 23:45:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 512 labels/synchronizations in 105 ms.
[2025-05-31 23:45:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14242228168654418734.gal : 36 ms
[2025-05-31 23:45:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9588688683047397490.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14242228168654418734.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9588688683047397490.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
[2025-05-31 23:45:11] [INFO ] Deduced a trap composed of 69 places in 187 ms of which 2 ms to minimize.
Loading property file /tmp/ReachabilityCardinality9588688683047397490.prop.
[2025-05-31 23:45:11] [INFO ] Deduced a trap composed of 71 places in 143 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
[2025-05-31 23:45:19] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,251021,8.91814,224756,5625,2718,266673,30241,3197,619124,556,290606,0
Total reachable state count : 251021

Verifying 2 reachability properties.
Reachability property MAX2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,6,8.94308,224756,117,107,266673,30241,3200,619124,559,290606,0
Invariant property MIN2 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,6,8.94501,224756,117,107,266673,30241,3206,619124,561,290606,0
[2025-05-31 23:45:22] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:45:25] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:45:28] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/1048 variables, and 89 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 0/2096 constraints, Known Traps: 64/64 constraints]
After SMT, in 61213ms problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 61265ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63431 ms. Remains : 392/392 places, 2104/2104 transitions.
FORMULA EisenbergMcGuire-PT-08-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
FORMULA EisenbergMcGuire-PT-08-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
FORMULA EisenbergMcGuire-PT-08-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
FORMULA EisenbergMcGuire-PT-08-UpperBounds-08 1 TECHNIQUES REACHABILITY_MAX
FORMULA EisenbergMcGuire-PT-08-UpperBounds-05 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 5 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 207288 ms.

BK_STOP 1748735131716

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="EisenbergMcGuire-PT-08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is EisenbergMcGuire-PT-08, 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 r083-tall-174860079800100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-08.tgz
mv EisenbergMcGuire-PT-08 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;