Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 86K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717353609026

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:40:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 18:40:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:40:10] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-06-02 18:40:10] [INFO ] Transformed 112 places.
[2024-06-02 18:40:10] [INFO ] Transformed 356 transitions.
[2024-06-02 18:40:10] [INFO ] Found NUPN structural information;
[2024-06-02 18:40:10] [INFO ] Parsed PT model containing 112 places and 356 transitions and 1308 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 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]
[2024-06-02 18:40:10] [INFO ] Flow matrix only has 271 transitions (discarded 32 similar events)
// Phase 1: matrix 271 rows 112 cols
[2024-06-02 18:40:10] [INFO ] Computed 9 invariants in 19 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 (502 resets) in 44 ms. (222 steps per ms)
FORMULA FireWire-PT-03-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-03-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-03-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-03-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120011 steps (1516 resets) in 152 ms. (784 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[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]
[2024-06-02 18:40:10] [INFO ] Flow matrix only has 271 transitions (discarded 32 similar events)
[2024-06-02 18:40:10] [INFO ] Invariant cache hit.
[2024-06-02 18:40:10] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-06-02 18:40:10] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-06-02 18:40:11] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 18:40:11] [INFO ] [Real]Added 41 Read/Feed constraints in 9 ms returned sat
[2024-06-02 18:40:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:40:11] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 18:40:11] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-06-02 18:40:11] [INFO ] [Nat]Added 41 Read/Feed constraints in 21 ms returned sat
[2024-06-02 18:40:11] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 41 ms.
[2024-06-02 18:40:11] [INFO ] Added : 6 causal constraints over 2 iterations in 122 ms. Result :sat
Minimization took 108 ms.
[2024-06-02 18:40:11] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-02 18:40:11] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-06-02 18:40:11] [INFO ] [Real]Added 41 Read/Feed constraints in 6 ms returned sat
[2024-06-02 18:40:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:40:11] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 18:40:11] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-06-02 18:40:11] [INFO ] [Nat]Added 41 Read/Feed constraints in 23 ms returned sat
[2024-06-02 18:40:11] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 35 ms.
[2024-06-02 18:40:11] [INFO ] Added : 6 causal constraints over 2 iterations in 110 ms. Result :sat
Minimization took 99 ms.
[2024-06-02 18:40:11] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-06-02 18:40:12] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-06-02 18:40:12] [INFO ] [Real]Added 41 Read/Feed constraints in 14 ms returned sat
[2024-06-02 18:40:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:40:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 18:40:12] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-06-02 18:40:12] [INFO ] [Nat]Added 41 Read/Feed constraints in 9 ms returned sat
[2024-06-02 18:40:12] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 23 ms.
[2024-06-02 18:40:12] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 14 ms to minimize.
[2024-06-02 18:40:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2024-06-02 18:40:12] [INFO ] Added : 47 causal constraints over 10 iterations in 360 ms. Result :sat
Minimization took 119 ms.
[2024-06-02 18:40:12] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 18:40:12] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-06-02 18:40:12] [INFO ] [Real]Added 41 Read/Feed constraints in 29 ms returned sat
[2024-06-02 18:40:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:40:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-06-02 18:40:12] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-06-02 18:40:12] [INFO ] [Nat]Added 41 Read/Feed constraints in 9 ms returned sat
[2024-06-02 18:40:12] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 37 ms.
[2024-06-02 18:40:13] [INFO ] Added : 49 causal constraints over 12 iterations in 268 ms. Result :sat
Minimization took 121 ms.
[2024-06-02 18:40:13] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 18:40:13] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-06-02 18:40:13] [INFO ] [Real]Added 41 Read/Feed constraints in 14 ms returned sat
[2024-06-02 18:40:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:40:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-06-02 18:40:13] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-06-02 18:40:13] [INFO ] [Nat]Added 41 Read/Feed constraints in 19 ms returned sat
[2024-06-02 18:40:13] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 29 ms.
[2024-06-02 18:40:13] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:40:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-06-02 18:40:13] [INFO ] Added : 16 causal constraints over 4 iterations in 211 ms. Result :sat
Minimization took 103 ms.
[2024-06-02 18:40:13] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 18:40:13] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-06-02 18:40:14] [INFO ] [Real]Added 41 Read/Feed constraints in 34 ms returned sat
[2024-06-02 18:40:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:40:14] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 18:40:14] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-02 18:40:14] [INFO ] [Nat]Added 41 Read/Feed constraints in 17 ms returned sat
[2024-06-02 18:40:14] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 38 ms.
[2024-06-02 18:40:14] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:40:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2024-06-02 18:40:14] [INFO ] Added : 36 causal constraints over 8 iterations in 297 ms. Result :sat
Minimization took 109 ms.
[2024-06-02 18:40:14] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 18:40:14] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-06-02 18:40:14] [INFO ] [Real]Added 41 Read/Feed constraints in 26 ms returned sat
[2024-06-02 18:40:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:40:14] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 18:40:14] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-06-02 18:40:14] [INFO ] [Nat]Added 41 Read/Feed constraints in 17 ms returned sat
[2024-06-02 18:40:14] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 37 ms.
[2024-06-02 18:40:15] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:40:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-06-02 18:40:15] [INFO ] Added : 63 causal constraints over 14 iterations in 375 ms. Result :sat
Minimization took 113 ms.
[2024-06-02 18:40:15] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 18:40:15] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-06-02 18:40:15] [INFO ] [Real]Added 41 Read/Feed constraints in 6 ms returned sat
[2024-06-02 18:40:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:40:15] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 18:40:15] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-06-02 18:40:15] [INFO ] [Nat]Added 41 Read/Feed constraints in 27 ms returned sat
[2024-06-02 18:40:15] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 17 ms.
[2024-06-02 18:40:15] [INFO ] Added : 7 causal constraints over 2 iterations in 65 ms. Result :sat
Minimization took 103 ms.
[2024-06-02 18:40:15] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 18:40:15] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-06-02 18:40:15] [INFO ] [Real]Added 41 Read/Feed constraints in 17 ms returned sat
[2024-06-02 18:40:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:40:15] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 18:40:15] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-06-02 18:40:15] [INFO ] [Nat]Added 41 Read/Feed constraints in 13 ms returned sat
[2024-06-02 18:40:15] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 15 ms.
[2024-06-02 18:40:16] [INFO ] Added : 64 causal constraints over 15 iterations in 251 ms. Result :sat
Minimization took 110 ms.
[2024-06-02 18:40:16] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-02 18:40:16] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-02 18:40:16] [INFO ] [Real]Added 41 Read/Feed constraints in 7 ms returned sat
[2024-06-02 18:40:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:40:16] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 18:40:16] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-02 18:40:16] [INFO ] [Nat]Added 41 Read/Feed constraints in 18 ms returned sat
[2024-06-02 18:40:16] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 20 ms.
[2024-06-02 18:40:16] [INFO ] Added : 12 causal constraints over 3 iterations in 93 ms. Result :sat
Minimization took 106 ms.
[2024-06-02 18:40:16] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 18:40:16] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-06-02 18:40:16] [INFO ] [Real]Added 41 Read/Feed constraints in 6 ms returned sat
[2024-06-02 18:40:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:40:16] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-06-02 18:40:16] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-02 18:40:16] [INFO ] [Nat]Added 41 Read/Feed constraints in 9 ms returned sat
[2024-06-02 18:40:16] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 16 ms.
[2024-06-02 18:40:17] [INFO ] Added : 14 causal constraints over 5 iterations in 151 ms. Result :sat
Minimization took 99 ms.
[2024-06-02 18:40:17] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 18:40:17] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-06-02 18:40:17] [INFO ] [Real]Added 41 Read/Feed constraints in 5 ms returned sat
[2024-06-02 18:40:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:40:17] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 18:40:17] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-06-02 18:40:17] [INFO ] [Nat]Added 41 Read/Feed constraints in 18 ms returned sat
[2024-06-02 18:40:17] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 14 ms.
[2024-06-02 18:40:17] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:40:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2024-06-02 18:40:17] [INFO ] Added : 10 causal constraints over 4 iterations in 229 ms. Result :sat
Minimization took 100 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[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]
FORMULA FireWire-PT-03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-03-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-03-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-03-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-03-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-03-UpperBounds-01 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 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 303/303 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 112 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 112 transition count 299
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 111 transition count 299
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 8 place count 108 transition count 291
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 108 transition count 291
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 106 transition count 287
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 106 transition count 287
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 104 transition count 285
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 101 transition count 292
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 31 place count 101 transition count 286
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 42 place count 101 transition count 275
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 101 transition count 277
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 2 with 3 rules applied. Total rules applied 46 place count 100 transition count 275
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 100 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 99 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 98 transition count 272
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 50 place count 98 transition count 271
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 52 place count 97 transition count 271
Applied a total of 52 rules in 113 ms. Remains 97 /112 variables (removed 15) and now considering 271/303 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 97/112 places, 271/303 transitions.
[2024-06-02 18:40:18] [INFO ] Flow matrix only has 243 transitions (discarded 28 similar events)
// Phase 1: matrix 243 rows 97 cols
[2024-06-02 18:40:18] [INFO ] Computed 8 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (60867 resets) in 1090 ms. (916 steps per ms)
BEST_FIRST walk for 3000002 steps (45240 resets) in 1131 ms. (2650 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 18:40:20] [INFO ] Flow matrix only has 243 transitions (discarded 28 similar events)
[2024-06-02 18:40:20] [INFO ] Invariant cache hit.
[2024-06-02 18:40:20] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:40:20] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-06-02 18:40:20] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:40:20] [INFO ] [Real]Added 37 Read/Feed constraints in 10 ms returned sat
[2024-06-02 18:40:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:40:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:40:20] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-06-02 18:40:20] [INFO ] [Nat]Added 37 Read/Feed constraints in 13 ms returned sat
[2024-06-02 18:40:20] [INFO ] Computed and/alt/rep : 108/429/108 causal constraints (skipped 133 transitions) in 17 ms.
[2024-06-02 18:40:20] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:40:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-06-02 18:40:20] [INFO ] Added : 42 causal constraints over 11 iterations in 251 ms. Result :sat
Minimization took 81 ms.
[2024-06-02 18:40:20] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:40:20] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-06-02 18:40:21] [INFO ] [Real]Added 37 Read/Feed constraints in 14 ms returned sat
[2024-06-02 18:40:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:40:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:40:21] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-06-02 18:40:21] [INFO ] [Nat]Added 37 Read/Feed constraints in 15 ms returned sat
[2024-06-02 18:40:21] [INFO ] Computed and/alt/rep : 108/429/108 causal constraints (skipped 133 transitions) in 18 ms.
[2024-06-02 18:40:21] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-06-02 18:40:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-06-02 18:40:21] [INFO ] Added : 52 causal constraints over 12 iterations in 270 ms. Result :sat
Minimization took 79 ms.
[2024-06-02 18:40:21] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:40:21] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-06-02 18:40:21] [INFO ] [Real]Added 37 Read/Feed constraints in 5 ms returned sat
[2024-06-02 18:40:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:40:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:40:21] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-06-02 18:40:21] [INFO ] [Nat]Added 37 Read/Feed constraints in 8 ms returned sat
[2024-06-02 18:40:21] [INFO ] Computed and/alt/rep : 108/429/108 causal constraints (skipped 133 transitions) in 17 ms.
[2024-06-02 18:40:21] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:40:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-06-02 18:40:21] [INFO ] Added : 11 causal constraints over 3 iterations in 135 ms. Result :sat
Minimization took 70 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 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 271/271 transitions.
Applied a total of 0 rules in 6 ms. Remains 97 /97 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 97/97 places, 271/271 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 271/271 transitions.
Applied a total of 0 rules in 7 ms. Remains 97 /97 variables (removed 0) and now considering 271/271 (removed 0) transitions.
[2024-06-02 18:40:21] [INFO ] Flow matrix only has 243 transitions (discarded 28 similar events)
[2024-06-02 18:40:21] [INFO ] Invariant cache hit.
[2024-06-02 18:40:22] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 18:40:22] [INFO ] Flow matrix only has 243 transitions (discarded 28 similar events)
[2024-06-02 18:40:22] [INFO ] Invariant cache hit.
[2024-06-02 18:40:22] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:40:22] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2024-06-02 18:40:22] [INFO ] Redundant transitions in 10 ms returned []
Running 269 sub problems to find dead transitions.
[2024-06-02 18:40:22] [INFO ] Flow matrix only has 243 transitions (discarded 28 similar events)
[2024-06-02 18:40:22] [INFO ] Invariant cache hit.
[2024-06-02 18:40:22] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 18:40:23] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:40:23] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:40:23] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:40:23] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 0 ms to minimize.
[2024-06-02 18:40:23] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:40:23] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-06-02 18:40:23] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2024-06-02 18:40:23] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-06-02 18:40:24] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:40:24] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 18:40:24] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 18:40:25] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (OVERLAPS) 243/340 variables, 97/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 37/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 18:40:28] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 155 constraints, problems are : Problem set: 0 solved, 269 unsolved in 11347 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 18:40:34] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/340 variables, 97/119 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 37/156 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 269/425 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 425 constraints, problems are : Problem set: 0 solved, 269 unsolved in 9392 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 14/14 constraints]
After SMT, in 20961ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 20975ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21193 ms. Remains : 97/97 places, 271/271 transitions.
RANDOM walk for 40000 steps (2477 resets) in 1317 ms. (30 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (560 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (598 resets) in 209 ms. (190 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (592 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (598 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (555 resets) in 122 ms. (325 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (578 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 4293 steps, run visited all 6 properties in 46 ms. (steps per millisecond=93 )
Probabilistic random walk after 4293 steps, saw 2047 distinct states, run finished after 51 ms. (steps per millisecond=84 ) properties seen :6
FORMULA FireWire-PT-03-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-03-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-03-UpperBounds-03 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 33782 ms.
ITS solved all properties within timeout

BK_STOP 1717353644086

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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