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-174860111800038.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-08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r097-smll-174860111800038
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K 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.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.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 97K 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-08-UpperBounds-00
FORMULA_NAME FireWire-PT-08-UpperBounds-01
FORMULA_NAME FireWire-PT-08-UpperBounds-02
FORMULA_NAME FireWire-PT-08-UpperBounds-03
FORMULA_NAME FireWire-PT-08-UpperBounds-04
FORMULA_NAME FireWire-PT-08-UpperBounds-05
FORMULA_NAME FireWire-PT-08-UpperBounds-06
FORMULA_NAME FireWire-PT-08-UpperBounds-07
FORMULA_NAME FireWire-PT-08-UpperBounds-08
FORMULA_NAME FireWire-PT-08-UpperBounds-09
FORMULA_NAME FireWire-PT-08-UpperBounds-10
FORMULA_NAME FireWire-PT-08-UpperBounds-11
FORMULA_NAME FireWire-PT-08-UpperBounds-12
FORMULA_NAME FireWire-PT-08-UpperBounds-13
FORMULA_NAME FireWire-PT-08-UpperBounds-14
FORMULA_NAME FireWire-PT-08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748675951736

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-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 07:19:14] [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:19:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 07:19:15] [INFO ] Load time of PNML (sax parser for PT used): 229 ms
[2025-05-31 07:19:15] [INFO ] Transformed 127 places.
[2025-05-31 07:19:15] [INFO ] Transformed 397 transitions.
[2025-05-31 07:19:15] [INFO ] Found NUPN structural information;
[2025-05-31 07:19:15] [INFO ] Parsed PT model containing 127 places and 397 transitions and 1475 arcs in 494 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 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:19:15] [INFO ] Flow matrix only has 312 transitions (discarded 32 similar events)
// Phase 1: matrix 312 rows 127 cols
[2025-05-31 07:19:15] [INFO ] Computed 8 invariants in 40 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 (531 resets) in 112 ms. (88 steps per ms)
FORMULA FireWire-PT-08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70004 steps (1040 resets) in 183 ms. (380 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2025-05-31 07:19:15] [INFO ] Flow matrix only has 312 transitions (discarded 32 similar events)
[2025-05-31 07:19:15] [INFO ] Invariant cache hit.
[2025-05-31 07:19:16] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2025-05-31 07:19:16] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2025-05-31 07:19:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:19:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-31 07:19:16] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2025-05-31 07:19:16] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-31 07:19:16] [INFO ] [Nat]Added 45 Read/Feed constraints in 37 ms returned sat
[2025-05-31 07:19:16] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 86 ms.
[2025-05-31 07:19:17] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 17 ms to minimize.
[2025-05-31 07:19:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2025-05-31 07:19:17] [INFO ] Added : 38 causal constraints over 9 iterations in 590 ms. Result :sat
Minimization took 131 ms.
[2025-05-31 07:19:17] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:19:17] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2025-05-31 07:19:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:19:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-31 07:19:17] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2025-05-31 07:19:17] [INFO ] [Nat]Added 45 Read/Feed constraints in 18 ms returned sat
[2025-05-31 07:19:18] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 61 ms.
[2025-05-31 07:19:18] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 4 ms to minimize.
[2025-05-31 07:19:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2025-05-31 07:19:18] [INFO ] Added : 24 causal constraints over 5 iterations in 345 ms. Result :sat
Minimization took 106 ms.
[2025-05-31 07:19:18] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:19:18] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2025-05-31 07:19:18] [INFO ] [Real]Added 45 Read/Feed constraints in 22 ms returned sat
[2025-05-31 07:19:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:19:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:19:18] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2025-05-31 07:19:18] [INFO ] [Nat]Added 45 Read/Feed constraints in 32 ms returned sat
[2025-05-31 07:19:18] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 43 ms.
[2025-05-31 07:19:19] [INFO ] Added : 17 causal constraints over 5 iterations in 189 ms. Result :sat
Minimization took 101 ms.
[2025-05-31 07:19:19] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:19:19] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2025-05-31 07:19:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:19:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-05-31 07:19:19] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2025-05-31 07:19:19] [INFO ] [Nat]Added 45 Read/Feed constraints in 42 ms returned sat
[2025-05-31 07:19:19] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 64 ms.
[2025-05-31 07:19:19] [INFO ] Added : 29 causal constraints over 6 iterations in 263 ms. Result :sat
Minimization took 117 ms.
[2025-05-31 07:19:20] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-31 07:19:20] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2025-05-31 07:19:20] [INFO ] [Real]Added 45 Read/Feed constraints in 16 ms returned sat
[2025-05-31 07:19:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:19:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-05-31 07:19:20] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2025-05-31 07:19:20] [INFO ] [Nat]Added 45 Read/Feed constraints in 46 ms returned sat
[2025-05-31 07:19:20] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 52 ms.
[2025-05-31 07:19:21] [INFO ] Added : 28 causal constraints over 6 iterations in 318 ms. Result :sat
Minimization took 211 ms.
[2025-05-31 07:19:21] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-31 07:19:21] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2025-05-31 07:19:21] [INFO ] [Real]Added 45 Read/Feed constraints in 18 ms returned sat
[2025-05-31 07:19:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:19:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-05-31 07:19:21] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2025-05-31 07:19:21] [INFO ] [Nat]Added 45 Read/Feed constraints in 35 ms returned sat
[2025-05-31 07:19:21] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 49 ms.
[2025-05-31 07:19:22] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 3 ms to minimize.
[2025-05-31 07:19:22] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2025-05-31 07:19:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 302 ms
[2025-05-31 07:19:22] [INFO ] Added : 36 causal constraints over 8 iterations in 615 ms. Result :sat
Minimization took 137 ms.
[2025-05-31 07:19:22] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:19:22] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2025-05-31 07:19:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:19:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:19:23] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2025-05-31 07:19:23] [INFO ] [Nat]Added 45 Read/Feed constraints in 27 ms returned sat
[2025-05-31 07:19:23] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 27 ms.
[2025-05-31 07:19:23] [INFO ] Added : 29 causal constraints over 7 iterations in 228 ms. Result :sat
Minimization took 105 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 344/344 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 127 transition count 341
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 9 place count 121 transition count 327
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 121 transition count 327
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 18 place count 121 transition count 324
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 21 place count 118 transition count 317
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 117 transition count 315
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 117 transition count 315
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 116 transition count 312
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 115 transition count 310
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 115 transition count 310
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 114 transition count 309
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 111 transition count 315
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 44 place count 111 transition count 309
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 53 place count 111 transition count 300
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 111 transition count 302
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 57 place count 110 transition count 300
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 59 place count 110 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 60 place count 109 transition count 297
Applied a total of 60 rules in 248 ms. Remains 109 /127 variables (removed 18) and now considering 297/344 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 109/127 places, 297/344 transitions.
[2025-05-31 07:19:24] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
// Phase 1: matrix 268 rows 109 cols
[2025-05-31 07:19:24] [INFO ] Computed 8 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (57819 resets) in 1747 ms. (572 steps per ms)
FORMULA FireWire-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000003 steps (56259 resets) in 2243 ms. (1782 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:19:28] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2025-05-31 07:19:28] [INFO ] Invariant cache hit.
[2025-05-31 07:19:28] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-31 07:19:28] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2025-05-31 07:19:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:19:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2025-05-31 07:19:28] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2025-05-31 07:19:28] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-05-31 07:19:28] [INFO ] [Nat]Added 41 Read/Feed constraints in 25 ms returned sat
[2025-05-31 07:19:28] [INFO ] Computed and/alt/rep : 123/495/123 causal constraints (skipped 143 transitions) in 31 ms.
[2025-05-31 07:19:29] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2025-05-31 07:19:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2025-05-31 07:19:29] [INFO ] Added : 59 causal constraints over 13 iterations in 564 ms. Result :sat
Minimization took 166 ms.
[2025-05-31 07:19:29] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-31 07:19:29] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2025-05-31 07:19:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:19:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-31 07:19:29] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2025-05-31 07:19:29] [INFO ] [Nat]Added 41 Read/Feed constraints in 25 ms returned sat
[2025-05-31 07:19:29] [INFO ] Computed and/alt/rep : 123/495/123 causal constraints (skipped 143 transitions) in 36 ms.
[2025-05-31 07:19:30] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 2 ms to minimize.
[2025-05-31 07:19:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2025-05-31 07:19:30] [INFO ] Added : 36 causal constraints over 8 iterations in 388 ms. Result :sat
Minimization took 136 ms.
[2025-05-31 07:19:30] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-31 07:19:30] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2025-05-31 07:19:30] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:19:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:19:30] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2025-05-31 07:19:30] [INFO ] [Nat]Added 41 Read/Feed constraints in 25 ms returned sat
[2025-05-31 07:19:30] [INFO ] Computed and/alt/rep : 123/495/123 causal constraints (skipped 143 transitions) in 25 ms.
[2025-05-31 07:19:30] [INFO ] Added : 43 causal constraints over 10 iterations in 255 ms. Result :sat
Minimization took 125 ms.
[2025-05-31 07:19:31] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:19:31] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2025-05-31 07:19:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:19:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:19:31] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2025-05-31 07:19:31] [INFO ] [Nat]Added 41 Read/Feed constraints in 46 ms returned sat
[2025-05-31 07:19:31] [INFO ] Computed and/alt/rep : 123/495/123 causal constraints (skipped 143 transitions) in 40 ms.
[2025-05-31 07:19:31] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 2 ms to minimize.
[2025-05-31 07:19:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2025-05-31 07:19:31] [INFO ] Added : 50 causal constraints over 10 iterations in 388 ms. Result :sat
Minimization took 132 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA FireWire-PT-08-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 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 297/297 transitions.
Applied a total of 0 rules in 15 ms. Remains 109 /109 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 109/109 places, 297/297 transitions.
[2025-05-31 07:19:32] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2025-05-31 07:19:32] [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 (57666 resets) in 1511 ms. (661 steps per ms)
BEST_FIRST walk for 3000001 steps (42183 resets) in 1534 ms. (1954 steps per ms)
FORMULA FireWire-PT-08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-05-31 07:19:35] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2025-05-31 07:19:35] [INFO ] Invariant cache hit.
[2025-05-31 07:19:35] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:19:35] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2025-05-31 07:19:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:19:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-31 07:19:35] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2025-05-31 07:19:35] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-05-31 07:19:35] [INFO ] [Nat]Added 41 Read/Feed constraints in 37 ms returned sat
[2025-05-31 07:19:35] [INFO ] Computed and/alt/rep : 123/495/123 causal constraints (skipped 143 transitions) in 30 ms.
[2025-05-31 07:19:36] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2025-05-31 07:19:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2025-05-31 07:19:36] [INFO ] Added : 59 causal constraints over 13 iterations in 569 ms. Result :sat
Minimization took 178 ms.
[2025-05-31 07:19:36] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:19:36] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2025-05-31 07:19:36] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:19:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:19:36] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2025-05-31 07:19:36] [INFO ] [Nat]Added 41 Read/Feed constraints in 23 ms returned sat
[2025-05-31 07:19:36] [INFO ] Computed and/alt/rep : 123/495/123 causal constraints (skipped 143 transitions) in 32 ms.
[2025-05-31 07:19:37] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 2 ms to minimize.
[2025-05-31 07:19:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2025-05-31 07:19:37] [INFO ] Added : 36 causal constraints over 8 iterations in 356 ms. Result :sat
Minimization took 158 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 297/297 transitions.
Applied a total of 0 rules in 11 ms. Remains 109 /109 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 109/109 places, 297/297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 297/297 transitions.
Applied a total of 0 rules in 10 ms. Remains 109 /109 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2025-05-31 07:19:37] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2025-05-31 07:19:37] [INFO ] Invariant cache hit.
[2025-05-31 07:19:37] [INFO ] Implicit Places using invariants in 175 ms returned []
[2025-05-31 07:19:37] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2025-05-31 07:19:37] [INFO ] Invariant cache hit.
[2025-05-31 07:19:37] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-05-31 07:19:38] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
[2025-05-31 07:19:38] [INFO ] Redundant transitions in 19 ms returned []
Running 295 sub problems to find dead transitions.
[2025-05-31 07:19:38] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2025-05-31 07:19:38] [INFO ] Invariant cache hit.
[2025-05-31 07:19:38] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2025-05-31 07:19:41] [INFO ] Deduced a trap composed of 39 places in 213 ms of which 2 ms to minimize.
[2025-05-31 07:19:41] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 2 ms to minimize.
[2025-05-31 07:19:41] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 2 ms to minimize.
[2025-05-31 07:19:41] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 3 ms to minimize.
[2025-05-31 07:19:41] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 4 ms to minimize.
[2025-05-31 07:19:41] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 2 ms to minimize.
[2025-05-31 07:19:42] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2025-05-31 07:19:42] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 2 ms to minimize.
[2025-05-31 07:19:43] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2025-05-31 07:19:43] [INFO ] Deduced a trap composed of 21 places in 220 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 268/376 variables, 108/126 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 41/167 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2025-05-31 07:19:49] [INFO ] Deduced a trap composed of 38 places in 220 ms of which 3 ms to minimize.
[2025-05-31 07:19:50] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 1/377 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (OVERLAPS) 0/377 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 170 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 268/376 variables, 108/128 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 41/169 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 295/464 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 1/377 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 377/377 variables, and 465 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 12/12 constraints]
After SMT, in 60706ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60741ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61492 ms. Remains : 109/109 places, 297/297 transitions.
[2025-05-31 07:20:38] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2025-05-31 07:20:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (57748 resets) in 1528 ms. (654 steps per ms)
BEST_FIRST walk for 2000002 steps (28379 resets) in 1234 ms. (1619 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-05-31 07:20:41] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2025-05-31 07:20:41] [INFO ] Invariant cache hit.
[2025-05-31 07:20:41] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-31 07:20:41] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2025-05-31 07:20:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:20:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:20:42] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2025-05-31 07:20:42] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-05-31 07:20:42] [INFO ] [Nat]Added 41 Read/Feed constraints in 57 ms returned sat
[2025-05-31 07:20:42] [INFO ] Computed and/alt/rep : 123/495/123 causal constraints (skipped 143 transitions) in 60 ms.
[2025-05-31 07:20:42] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 2 ms to minimize.
[2025-05-31 07:20:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2025-05-31 07:20:42] [INFO ] Added : 59 causal constraints over 13 iterations in 755 ms. Result :sat
Minimization took 193 ms.
[2025-05-31 07:20:43] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:20:43] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2025-05-31 07:20:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:20:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:20:43] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2025-05-31 07:20:43] [INFO ] [Nat]Added 41 Read/Feed constraints in 30 ms returned sat
[2025-05-31 07:20:43] [INFO ] Computed and/alt/rep : 123/495/123 causal constraints (skipped 143 transitions) in 41 ms.
[2025-05-31 07:20:44] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2025-05-31 07:20:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2025-05-31 07:20:44] [INFO ] Added : 36 causal constraints over 8 iterations in 450 ms. Result :sat
Minimization took 181 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 297/297 transitions.
Applied a total of 0 rules in 14 ms. Remains 109 /109 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 109/109 places, 297/297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 297/297 transitions.
Applied a total of 0 rules in 12 ms. Remains 109 /109 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2025-05-31 07:20:44] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2025-05-31 07:20:44] [INFO ] Invariant cache hit.
[2025-05-31 07:20:44] [INFO ] Implicit Places using invariants in 320 ms returned []
[2025-05-31 07:20:44] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2025-05-31 07:20:44] [INFO ] Invariant cache hit.
[2025-05-31 07:20:45] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-05-31 07:20:45] [INFO ] Implicit Places using invariants and state equation in 601 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
[2025-05-31 07:20:45] [INFO ] Redundant transitions in 5 ms returned []
Running 295 sub problems to find dead transitions.
[2025-05-31 07:20:45] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2025-05-31 07:20:45] [INFO ] Invariant cache hit.
[2025-05-31 07:20:45] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2025-05-31 07:20:47] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 1 ms to minimize.
[2025-05-31 07:20:48] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2025-05-31 07:20:48] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 2 ms to minimize.
[2025-05-31 07:20:48] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2025-05-31 07:20:48] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 1 ms to minimize.
[2025-05-31 07:20:48] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2025-05-31 07:20:48] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2025-05-31 07:20:49] [INFO ] Deduced a trap composed of 23 places in 216 ms of which 2 ms to minimize.
[2025-05-31 07:20:49] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2025-05-31 07:20:50] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 268/376 variables, 108/126 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 41/167 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2025-05-31 07:20:55] [INFO ] Deduced a trap composed of 38 places in 192 ms of which 4 ms to minimize.
[2025-05-31 07:20:56] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 1/377 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (OVERLAPS) 0/377 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 170 constraints, problems are : Problem set: 0 solved, 295 unsolved in 27544 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 268/376 variables, 108/128 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 41/169 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 295/464 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 1/377 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 377/377 variables, and 465 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 12/12 constraints]
After SMT, in 58161ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 58167ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59126 ms. Remains : 109/109 places, 297/297 transitions.
RANDOM walk for 40000 steps (2360 resets) in 2318 ms. (17 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (507 resets) in 320 ms. (124 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (571 resets) in 205 ms. (194 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (551 resets) in 200 ms. (199 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (604 resets) in 216 ms. (184 steps per ms) remains 4/4 properties
[2025-05-31 07:21:44] [INFO ] Flatten gal took : 279 ms
[2025-05-31 07:21:45] [INFO ] Flatten gal took : 118 ms
[2025-05-31 07:21:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5628422996752569325.gal : 50 ms
[2025-05-31 07:21:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2854557446545535328.prop : 4 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/ReachabilityCardinality5628422996752569325.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2854557446545535328.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 ...328
Loading property file /tmp/ReachabilityCardinality2854557446545535328.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 11
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :11 after 12
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :12 after 19
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :19 after 31
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :31 after 61
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :61 after 228
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :228 after 1182
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1182 after 5868
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :5868 after 34038
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
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,3.51763e+06,1.14329,20000,2,2142,18,58649,6,0,735,54339,0
Total reachable state count : 3517630

Verifying 4 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,4197,1.14556,20000,2,550,18,58649,7,0,738,54339,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,4197,1.14702,20000,2,550,18,58649,8,0,739,54339,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,4197,1.14822,20000,2,550,18,58649,9,0,741,54339,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,4197,1.14956,20000,2,550,18,58649,10,0,742,54339,0
Interrupted probabilistic random walk after 375260 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :0 out of 4
Probabilistic random walk after 375260 steps, saw 89452 distinct states, run finished after 3010 ms. (steps per millisecond=124 ) properties seen :0
FORMULA FireWire-PT-08-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-08-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 153402 ms.

BK_STOP 1748676107997

--------------------
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-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 FireWire-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 r097-smll-174860111800038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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