Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 101K May 29 14:32 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748676231779

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 07:23:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 07:23:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 07:23:55] [INFO ] Load time of PNML (sax parser for PT used): 215 ms
[2025-05-31 07:23:55] [INFO ] Transformed 131 places.
[2025-05-31 07:23:55] [INFO ] Transformed 409 transitions.
[2025-05-31 07:23:55] [INFO ] Found NUPN structural information;
[2025-05-31 07:23:55] [INFO ] Parsed PT model containing 131 places and 409 transitions and 1529 arcs in 539 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 26 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
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 07:23:55] [INFO ] Flow matrix only has 321 transitions (discarded 32 similar events)
// Phase 1: matrix 321 rows 131 cols
[2025-05-31 07:23:55] [INFO ] Computed 8 invariants in 55 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 (557 resets) in 90 ms. (109 steps per ms)
FORMULA FireWire-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80004 steps (1099 resets) in 141 ms. (563 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-31 07:23:55] [INFO ] Flow matrix only has 321 transitions (discarded 32 similar events)
[2025-05-31 07:23:55] [INFO ] Invariant cache hit.
[2025-05-31 07:23:56] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2025-05-31 07:23:56] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2025-05-31 07:23:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:23:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2025-05-31 07:23:56] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2025-05-31 07:23:56] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-31 07:23:56] [INFO ] [Nat]Added 45 Read/Feed constraints in 45 ms returned sat
[2025-05-31 07:23:56] [INFO ] Computed and/alt/rep : 126/467/126 causal constraints (skipped 194 transitions) in 88 ms.
[2025-05-31 07:23:57] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 23 ms to minimize.
[2025-05-31 07:23:57] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 3 ms to minimize.
[2025-05-31 07:23:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 310 ms
[2025-05-31 07:23:57] [INFO ] Added : 31 causal constraints over 7 iterations in 739 ms. Result :sat
Minimization took 94 ms.
[2025-05-31 07:23:57] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:23:57] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2025-05-31 07:23:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:23:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-05-31 07:23:58] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2025-05-31 07:23:58] [INFO ] [Nat]Added 45 Read/Feed constraints in 33 ms returned sat
[2025-05-31 07:23:58] [INFO ] Computed and/alt/rep : 126/467/126 causal constraints (skipped 194 transitions) in 76 ms.
[2025-05-31 07:23:58] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 3 ms to minimize.
[2025-05-31 07:23:58] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 2 ms to minimize.
[2025-05-31 07:23:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 309 ms
[2025-05-31 07:23:58] [INFO ] Added : 32 causal constraints over 7 iterations in 645 ms. Result :sat
Minimization took 93 ms.
[2025-05-31 07:23:59] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-31 07:23:59] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2025-05-31 07:23:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:23:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:23:59] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2025-05-31 07:23:59] [INFO ] [Nat]Added 45 Read/Feed constraints in 31 ms returned sat
[2025-05-31 07:23:59] [INFO ] Computed and/alt/rep : 126/467/126 causal constraints (skipped 194 transitions) in 57 ms.
[2025-05-31 07:23:59] [INFO ] Added : 18 causal constraints over 4 iterations in 192 ms. Result :sat
Minimization took 88 ms.
[2025-05-31 07:23:59] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-31 07:24:00] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2025-05-31 07:24:00] [INFO ] [Real]Added 45 Read/Feed constraints in 17 ms returned sat
[2025-05-31 07:24:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:24:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-05-31 07:24:00] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2025-05-31 07:24:00] [INFO ] [Nat]Added 45 Read/Feed constraints in 33 ms returned sat
[2025-05-31 07:24:00] [INFO ] Computed and/alt/rep : 126/467/126 causal constraints (skipped 194 transitions) in 50 ms.
[2025-05-31 07:24:00] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2025-05-31 07:24:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2025-05-31 07:24:00] [INFO ] Added : 17 causal constraints over 4 iterations in 274 ms. Result :sat
Minimization took 88 ms.
[2025-05-31 07:24:00] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-05-31 07:24:01] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2025-05-31 07:24:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:24:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2025-05-31 07:24:01] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2025-05-31 07:24:01] [INFO ] [Nat]Added 45 Read/Feed constraints in 26 ms returned sat
[2025-05-31 07:24:01] [INFO ] Computed and/alt/rep : 126/467/126 causal constraints (skipped 194 transitions) in 49 ms.
[2025-05-31 07:24:01] [INFO ] Added : 30 causal constraints over 8 iterations in 323 ms. Result :sat
Minimization took 127 ms.
[2025-05-31 07:24:01] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:24:01] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2025-05-31 07:24:01] [INFO ] [Real]Added 45 Read/Feed constraints in 25 ms returned sat
[2025-05-31 07:24:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:24:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:24:02] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2025-05-31 07:24:02] [INFO ] [Nat]Added 45 Read/Feed constraints in 42 ms returned sat
[2025-05-31 07:24:02] [INFO ] Computed and/alt/rep : 126/467/126 causal constraints (skipped 194 transitions) in 36 ms.
[2025-05-31 07:24:02] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2025-05-31 07:24:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2025-05-31 07:24:02] [INFO ] Added : 20 causal constraints over 7 iterations in 376 ms. Result :sat
Minimization took 91 ms.
[2025-05-31 07:24:02] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:24:02] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2025-05-31 07:24:02] [INFO ] [Real]Added 45 Read/Feed constraints in 16 ms returned sat
[2025-05-31 07:24:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:24:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:24:03] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2025-05-31 07:24:03] [INFO ] [Nat]Added 45 Read/Feed constraints in 18 ms returned sat
[2025-05-31 07:24:03] [INFO ] Computed and/alt/rep : 126/467/126 causal constraints (skipped 194 transitions) in 31 ms.
[2025-05-31 07:24:03] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 3 ms to minimize.
[2025-05-31 07:24:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2025-05-31 07:24:03] [INFO ] Deduced a trap composed of 42 places in 178 ms of which 3 ms to minimize.
[2025-05-31 07:24:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2025-05-31 07:24:03] [INFO ] Added : 26 causal constraints over 7 iterations in 722 ms. Result :sat
Minimization took 99 ms.
[2025-05-31 07:24:04] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-31 07:24:04] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2025-05-31 07:24:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:24:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2025-05-31 07:24:04] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2025-05-31 07:24:04] [INFO ] [Nat]Added 45 Read/Feed constraints in 24 ms returned sat
[2025-05-31 07:24:04] [INFO ] Computed and/alt/rep : 126/467/126 causal constraints (skipped 194 transitions) in 31 ms.
[2025-05-31 07:24:04] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 2 ms to minimize.
[2025-05-31 07:24:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2025-05-31 07:24:04] [INFO ] Added : 24 causal constraints over 6 iterations in 313 ms. Result :sat
Minimization took 89 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 353/353 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 131 transition count 350
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 7 place count 127 transition count 342
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 127 transition count 342
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 14 place count 127 transition count 339
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 126 transition count 336
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 126 transition count 336
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 125 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 125 transition count 334
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 124 transition count 331
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 123 transition count 329
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 123 transition count 329
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 122 transition count 326
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 121 transition count 324
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 121 transition count 324
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 120 transition count 323
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 117 transition count 329
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 40 place count 117 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 49 place count 117 transition count 314
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 117 transition count 316
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 53 place count 116 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 55 place count 116 transition count 312
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 115 transition count 311
Applied a total of 56 rules in 234 ms. Remains 115 /131 variables (removed 16) and now considering 311/353 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 115/131 places, 311/353 transitions.
[2025-05-31 07:24:05] [INFO ] Flow matrix only has 282 transitions (discarded 29 similar events)
// Phase 1: matrix 282 rows 115 cols
[2025-05-31 07:24:05] [INFO ] Computed 8 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (57980 resets) in 1857 ms. (538 steps per ms)
BEST_FIRST walk for 4000002 steps (56398 resets) in 2040 ms. (1959 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-05-31 07:24:09] [INFO ] Flow matrix only has 282 transitions (discarded 29 similar events)
[2025-05-31 07:24:09] [INFO ] Invariant cache hit.
[2025-05-31 07:24:09] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-31 07:24:09] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2025-05-31 07:24:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:24:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:24:09] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2025-05-31 07:24:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-05-31 07:24:09] [INFO ] [Nat]Added 42 Read/Feed constraints in 25 ms returned sat
[2025-05-31 07:24:09] [INFO ] Computed and/alt/rep : 128/525/128 causal constraints (skipped 152 transitions) in 33 ms.
[2025-05-31 07:24:10] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 2 ms to minimize.
[2025-05-31 07:24:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2025-05-31 07:24:10] [INFO ] Added : 46 causal constraints over 10 iterations in 499 ms. Result :sat
Minimization took 178 ms.
[2025-05-31 07:24:10] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:24:10] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2025-05-31 07:24:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:24:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:24:10] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2025-05-31 07:24:10] [INFO ] [Nat]Added 42 Read/Feed constraints in 19 ms returned sat
[2025-05-31 07:24:10] [INFO ] Computed and/alt/rep : 128/525/128 causal constraints (skipped 152 transitions) in 39 ms.
[2025-05-31 07:24:11] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
[2025-05-31 07:24:11] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 2 ms to minimize.
[2025-05-31 07:24:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 236 ms
[2025-05-31 07:24:11] [INFO ] Added : 47 causal constraints over 11 iterations in 565 ms. Result :sat
Minimization took 165 ms.
[2025-05-31 07:24:11] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:24:11] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2025-05-31 07:24:11] [INFO ] [Real]Added 42 Read/Feed constraints in 25 ms returned sat
[2025-05-31 07:24:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:24:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-31 07:24:12] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2025-05-31 07:24:12] [INFO ] [Nat]Added 42 Read/Feed constraints in 44 ms returned sat
[2025-05-31 07:24:12] [INFO ] Computed and/alt/rep : 128/525/128 causal constraints (skipped 152 transitions) in 26 ms.
[2025-05-31 07:24:12] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 3 ms to minimize.
[2025-05-31 07:24:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2025-05-31 07:24:12] [INFO ] Added : 33 causal constraints over 8 iterations in 360 ms. Result :sat
Minimization took 153 ms.
[2025-05-31 07:24:12] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-31 07:24:12] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2025-05-31 07:24:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:24:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:24:12] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2025-05-31 07:24:12] [INFO ] [Nat]Added 42 Read/Feed constraints in 26 ms returned sat
[2025-05-31 07:24:13] [INFO ] Computed and/alt/rep : 128/525/128 causal constraints (skipped 152 transitions) in 33 ms.
[2025-05-31 07:24:13] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 2 ms to minimize.
[2025-05-31 07:24:13] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 3 ms to minimize.
[2025-05-31 07:24:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 332 ms
[2025-05-31 07:24:13] [INFO ] Added : 41 causal constraints over 9 iterations in 621 ms. Result :sat
Minimization took 201 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA FireWire-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 311/311 transitions.
Applied a total of 0 rules in 19 ms. Remains 115 /115 variables (removed 0) and now considering 311/311 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 115/115 places, 311/311 transitions.
[2025-05-31 07:24:14] [INFO ] Flow matrix only has 282 transitions (discarded 29 similar events)
[2025-05-31 07:24:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (58063 resets) in 1562 ms. (639 steps per ms)
BEST_FIRST walk for 3000001 steps (42518 resets) in 1869 ms. (1604 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-31 07:24:17] [INFO ] Flow matrix only has 282 transitions (discarded 29 similar events)
[2025-05-31 07:24:17] [INFO ] Invariant cache hit.
[2025-05-31 07:24:17] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:24:17] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2025-05-31 07:24:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:24:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:24:17] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2025-05-31 07:24:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-05-31 07:24:17] [INFO ] [Nat]Added 42 Read/Feed constraints in 24 ms returned sat
[2025-05-31 07:24:17] [INFO ] Computed and/alt/rep : 128/525/128 causal constraints (skipped 152 transitions) in 35 ms.
[2025-05-31 07:24:18] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 7 ms to minimize.
[2025-05-31 07:24:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2025-05-31 07:24:18] [INFO ] Added : 46 causal constraints over 10 iterations in 564 ms. Result :sat
Minimization took 145 ms.
[2025-05-31 07:24:18] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-31 07:24:18] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2025-05-31 07:24:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:24:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:24:18] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2025-05-31 07:24:18] [INFO ] [Nat]Added 42 Read/Feed constraints in 19 ms returned sat
[2025-05-31 07:24:18] [INFO ] Computed and/alt/rep : 128/525/128 causal constraints (skipped 152 transitions) in 24 ms.
[2025-05-31 07:24:19] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 2 ms to minimize.
[2025-05-31 07:24:19] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 2 ms to minimize.
[2025-05-31 07:24:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 240 ms
[2025-05-31 07:24:19] [INFO ] Added : 47 causal constraints over 11 iterations in 562 ms. Result :sat
Minimization took 185 ms.
[2025-05-31 07:24:19] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:24:19] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2025-05-31 07:24:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:24:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:24:20] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2025-05-31 07:24:20] [INFO ] [Nat]Added 42 Read/Feed constraints in 30 ms returned sat
[2025-05-31 07:24:20] [INFO ] Computed and/alt/rep : 128/525/128 causal constraints (skipped 152 transitions) in 34 ms.
[2025-05-31 07:24:20] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 4 ms to minimize.
[2025-05-31 07:24:20] [INFO ] Deduced a trap composed of 66 places in 125 ms of which 2 ms to minimize.
[2025-05-31 07:24:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 377 ms
[2025-05-31 07:24:20] [INFO ] Added : 41 causal constraints over 9 iterations in 722 ms. Result :sat
Minimization took 205 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 311/311 transitions.
Applied a total of 0 rules in 16 ms. Remains 115 /115 variables (removed 0) and now considering 311/311 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 115/115 places, 311/311 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 311/311 transitions.
Applied a total of 0 rules in 15 ms. Remains 115 /115 variables (removed 0) and now considering 311/311 (removed 0) transitions.
[2025-05-31 07:24:21] [INFO ] Flow matrix only has 282 transitions (discarded 29 similar events)
[2025-05-31 07:24:21] [INFO ] Invariant cache hit.
[2025-05-31 07:24:21] [INFO ] Implicit Places using invariants in 253 ms returned []
[2025-05-31 07:24:21] [INFO ] Flow matrix only has 282 transitions (discarded 29 similar events)
[2025-05-31 07:24:21] [INFO ] Invariant cache hit.
[2025-05-31 07:24:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-05-31 07:24:22] [INFO ] Implicit Places using invariants and state equation in 517 ms returned [12, 36]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 784 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 113/115 places, 311/311 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 309
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 111 transition count 309
Applied a total of 4 rules in 32 ms. Remains 111 /113 variables (removed 2) and now considering 309/311 (removed 2) transitions.
[2025-05-31 07:24:22] [INFO ] Flow matrix only has 280 transitions (discarded 29 similar events)
// Phase 1: matrix 280 rows 111 cols
[2025-05-31 07:24:22] [INFO ] Computed 6 invariants in 4 ms
[2025-05-31 07:24:22] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-05-31 07:24:22] [INFO ] Flow matrix only has 280 transitions (discarded 29 similar events)
[2025-05-31 07:24:22] [INFO ] Invariant cache hit.
[2025-05-31 07:24:22] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-05-31 07:24:22] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 111/115 places, 309/311 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1481 ms. Remains : 111/115 places, 309/311 transitions.
[2025-05-31 07:24:22] [INFO ] Flow matrix only has 280 transitions (discarded 29 similar events)
[2025-05-31 07:24:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (57690 resets) in 1657 ms. (603 steps per ms)
BEST_FIRST walk for 3000001 steps (42358 resets) in 1955 ms. (1533 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-31 07:24:26] [INFO ] Flow matrix only has 280 transitions (discarded 29 similar events)
[2025-05-31 07:24:26] [INFO ] Invariant cache hit.
[2025-05-31 07:24:26] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-05-31 07:24:26] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2025-05-31 07:24:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:24:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-05-31 07:24:26] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2025-05-31 07:24:26] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-05-31 07:24:26] [INFO ] [Nat]Added 42 Read/Feed constraints in 22 ms returned sat
[2025-05-31 07:24:26] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
[2025-05-31 07:24:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2025-05-31 07:24:26] [INFO ] Computed and/alt/rep : 126/519/126 causal constraints (skipped 152 transitions) in 40 ms.
[2025-05-31 07:24:27] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 2 ms to minimize.
[2025-05-31 07:24:27] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 2 ms to minimize.
[2025-05-31 07:24:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 206 ms
[2025-05-31 07:24:27] [INFO ] Added : 37 causal constraints over 9 iterations in 551 ms. Result :sat
Minimization took 156 ms.
[2025-05-31 07:24:27] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-05-31 07:24:27] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2025-05-31 07:24:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:24:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-05-31 07:24:27] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2025-05-31 07:24:27] [INFO ] [Nat]Added 42 Read/Feed constraints in 18 ms returned sat
[2025-05-31 07:24:27] [INFO ] Computed and/alt/rep : 126/519/126 causal constraints (skipped 152 transitions) in 22 ms.
[2025-05-31 07:24:28] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 2 ms to minimize.
[2025-05-31 07:24:28] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2025-05-31 07:24:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 244 ms
[2025-05-31 07:24:28] [INFO ] Added : 57 causal constraints over 12 iterations in 574 ms. Result :sat
Minimization took 161 ms.
[2025-05-31 07:24:28] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-05-31 07:24:28] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2025-05-31 07:24:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:24:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-05-31 07:24:28] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2025-05-31 07:24:28] [INFO ] [Nat]Added 42 Read/Feed constraints in 14 ms returned sat
[2025-05-31 07:24:28] [INFO ] Computed and/alt/rep : 126/519/126 causal constraints (skipped 152 transitions) in 23 ms.
[2025-05-31 07:24:29] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 2 ms to minimize.
[2025-05-31 07:24:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2025-05-31 07:24:29] [INFO ] Added : 48 causal constraints over 10 iterations in 356 ms. Result :sat
Minimization took 148 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 309/309 transitions.
Applied a total of 0 rules in 10 ms. Remains 111 /111 variables (removed 0) and now considering 309/309 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 111/111 places, 309/309 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 309/309 transitions.
Applied a total of 0 rules in 9 ms. Remains 111 /111 variables (removed 0) and now considering 309/309 (removed 0) transitions.
[2025-05-31 07:24:29] [INFO ] Flow matrix only has 280 transitions (discarded 29 similar events)
[2025-05-31 07:24:29] [INFO ] Invariant cache hit.
[2025-05-31 07:24:29] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-05-31 07:24:29] [INFO ] Flow matrix only has 280 transitions (discarded 29 similar events)
[2025-05-31 07:24:29] [INFO ] Invariant cache hit.
[2025-05-31 07:24:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-05-31 07:24:30] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
[2025-05-31 07:24:30] [INFO ] Redundant transitions in 42 ms returned []
Running 307 sub problems to find dead transitions.
[2025-05-31 07:24:30] [INFO ] Flow matrix only has 280 transitions (discarded 29 similar events)
[2025-05-31 07:24:30] [INFO ] Invariant cache hit.
[2025-05-31 07:24:30] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2025-05-31 07:24:32] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 3 ms to minimize.
[2025-05-31 07:24:32] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 2 ms to minimize.
[2025-05-31 07:24:33] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 2 ms to minimize.
[2025-05-31 07:24:33] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 2 ms to minimize.
[2025-05-31 07:24:33] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 3 ms to minimize.
[2025-05-31 07:24:33] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 2 ms to minimize.
[2025-05-31 07:24:34] [INFO ] Deduced a trap composed of 47 places in 167 ms of which 2 ms to minimize.
[2025-05-31 07:24:34] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2025-05-31 07:24:35] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (OVERLAPS) 280/390 variables, 110/125 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 42/167 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (OVERLAPS) 1/391 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 0/391 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 168 constraints, problems are : Problem set: 0 solved, 307 unsolved in 18373 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 111/111 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (OVERLAPS) 280/390 variables, 110/125 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 42/167 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 307/474 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2025-05-31 07:24:57] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2025-05-31 07:24:58] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2025-05-31 07:24:59] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 3/477 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 1/391 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2025-05-31 07:25:15] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/391 variables, and 479 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 111/111 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 13/13 constraints]
After SMT, in 49194ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 49222ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49823 ms. Remains : 111/111 places, 309/309 transitions.
RANDOM walk for 40000 steps (2330 resets) in 2036 ms. (19 steps per ms) remains 6/6 properties
[2025-05-31 07:25:20] [INFO ] Flatten gal took : 257 ms
BEST_FIRST walk for 40001 steps (606 resets) in 139 ms. (285 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (490 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (540 resets) in 122 ms. (325 steps per ms) remains 6/6 properties
[2025-05-31 07:25:20] [INFO ] Flatten gal took : 139 ms
BEST_FIRST walk for 40002 steps (584 resets) in 139 ms. (285 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (540 resets) in 198 ms. (201 steps per ms) remains 6/6 properties
[2025-05-31 07:25:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14423775394397100227.gal : 57 ms
[2025-05-31 07:25:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14078096854380769810.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/ReachabilityCardinality14423775394397100227.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14078096854380769810.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40003 steps (579 resets) in 154 ms. (258 steps per ms) remains 6/6 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14078096854380769810.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 12
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :12 after 13
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :13 after 21
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :21 after 43
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :43 after 111
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :111 after 252
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :252 after 1678
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :1678 after 5407
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :5407 after 31296
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,7.56095e+06,1.4502,29576,2,1921,15,79727,12,0,761,93873,0
Total reachable state count : 7560950

Verifying 6 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,6395,1.45218,29836,2,537,15,79727,12,0,763,93873,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,6395,1.4534,29836,2,537,15,79727,12,0,763,93873,0
Reachability property MAX1 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
MAX1,8750,1.45416,29836,2,564,15,79727,12,0,764,93873,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,8750,1.45462,29836,2,564,15,79727,12,0,764,93873,0
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,6395,1.45556,29836,2,537,15,79727,12,0,765,93873,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,6395,1.45634,29836,2,537,15,79727,12,0,765,93873,0
Interrupted probabilistic random walk after 510893 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :0 out of 6
Probabilistic random walk after 510893 steps, saw 110318 distinct states, run finished after 3006 ms. (steps per millisecond=169 ) properties seen :0
FORMULA FireWire-PT-10-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-10-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-10-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 3 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 88933 ms.

BK_STOP 1748676323566

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is FireWire-PT-10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r097-smll-174860111800040"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-10.tgz
mv FireWire-PT-10 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 ;