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.r576-smll-171734919900053.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is MedleyA-PT-07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734919900053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K 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 82K 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 MedleyA-PT-07-UpperBounds-00
FORMULA_NAME MedleyA-PT-07-UpperBounds-01
FORMULA_NAME MedleyA-PT-07-UpperBounds-02
FORMULA_NAME MedleyA-PT-07-UpperBounds-03
FORMULA_NAME MedleyA-PT-07-UpperBounds-04
FORMULA_NAME MedleyA-PT-07-UpperBounds-05
FORMULA_NAME MedleyA-PT-07-UpperBounds-06
FORMULA_NAME MedleyA-PT-07-UpperBounds-07
FORMULA_NAME MedleyA-PT-07-UpperBounds-08
FORMULA_NAME MedleyA-PT-07-UpperBounds-09
FORMULA_NAME MedleyA-PT-07-UpperBounds-10
FORMULA_NAME MedleyA-PT-07-UpperBounds-11
FORMULA_NAME MedleyA-PT-07-UpperBounds-12
FORMULA_NAME MedleyA-PT-07-UpperBounds-13
FORMULA_NAME MedleyA-PT-07-UpperBounds-14
FORMULA_NAME MedleyA-PT-07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717356684878

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-06-02 19:31:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 19:31:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:31:27] [INFO ] Load time of PNML (sax parser for PT used): 215 ms
[2024-06-02 19:31:27] [INFO ] Transformed 145 places.
[2024-06-02 19:31:27] [INFO ] Transformed 287 transitions.
[2024-06-02 19:31:27] [INFO ] Found NUPN structural information;
[2024-06-02 19:31:27] [INFO ] Parsed PT model containing 145 places and 287 transitions and 1240 arcs in 412 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 2 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]
// Phase 1: matrix 285 rows 143 cols
[2024-06-02 19:31:27] [INFO ] Computed 11 invariants in 41 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 (355 resets) in 59 ms. (166 steps per ms)
FORMULA MedleyA-PT-07-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-07-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-07-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80007 steps (632 resets) in 108 ms. (734 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 19:31:27] [INFO ] Invariant cache hit.
[2024-06-02 19:31:28] [INFO ] [Real]Absence check using 6 positive place invariants in 12 ms returned sat
[2024-06-02 19:31:28] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 6 ms returned sat
[2024-06-02 19:31:28] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2024-06-02 19:31:28] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 16 ms to minimize.
[2024-06-02 19:31:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:31:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2024-06-02 19:31:28] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-02 19:31:29] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2024-06-02 19:31:29] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 2 ms to minimize.
[2024-06-02 19:31:29] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-06-02 19:31:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 316 ms
[2024-06-02 19:31:29] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 62 ms.
[2024-06-02 19:31:30] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 3 ms to minimize.
[2024-06-02 19:31:30] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 2 ms to minimize.
[2024-06-02 19:31:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 367 ms
[2024-06-02 19:31:30] [INFO ] Added : 88 causal constraints over 19 iterations in 1213 ms. Result :sat
Minimization took 253 ms.
[2024-06-02 19:31:30] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-02 19:31:30] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 19:31:31] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-06-02 19:31:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:31:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2024-06-02 19:31:31] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-02 19:31:31] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-06-02 19:31:31] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 2 ms to minimize.
[2024-06-02 19:31:31] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 2 ms to minimize.
[2024-06-02 19:31:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 308 ms
[2024-06-02 19:31:31] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 57 ms.
[2024-06-02 19:31:32] [INFO ] Added : 91 causal constraints over 19 iterations in 559 ms. Result :sat
Minimization took 236 ms.
[2024-06-02 19:31:32] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-02 19:31:32] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 6 ms returned sat
[2024-06-02 19:31:32] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2024-06-02 19:31:32] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 61 ms.
[2024-06-02 19:31:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:31:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2024-06-02 19:31:33] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-02 19:31:33] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-06-02 19:31:33] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 45 ms.
[2024-06-02 19:31:34] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 2 ms to minimize.
[2024-06-02 19:31:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2024-06-02 19:31:34] [INFO ] Added : 102 causal constraints over 21 iterations in 931 ms. Result :sat
Minimization took 246 ms.
[2024-06-02 19:31:34] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2024-06-02 19:31:34] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 19:31:34] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-06-02 19:31:34] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
[2024-06-02 19:31:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:31:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2024-06-02 19:31:34] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-02 19:31:35] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-06-02 19:31:35] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2024-06-02 19:31:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2024-06-02 19:31:35] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 42 ms.
[2024-06-02 19:31:35] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 2 ms to minimize.
[2024-06-02 19:31:36] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 3 ms to minimize.
[2024-06-02 19:31:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 342 ms
[2024-06-02 19:31:36] [INFO ] Added : 90 causal constraints over 19 iterations in 1011 ms. Result :sat
Minimization took 245 ms.
[2024-06-02 19:31:36] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-02 19:31:36] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-02 19:31:36] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-06-02 19:31:36] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-06-02 19:31:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:31:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2024-06-02 19:31:36] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:31:37] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-06-02 19:31:37] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
[2024-06-02 19:31:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2024-06-02 19:31:37] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 37 ms.
[2024-06-02 19:31:37] [INFO ] Added : 101 causal constraints over 21 iterations in 746 ms. Result :sat
Minimization took 237 ms.
[2024-06-02 19:31:38] [INFO ] [Real]Absence check using 6 positive place invariants in 13 ms returned sat
[2024-06-02 19:31:38] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 8 ms returned sat
[2024-06-02 19:31:38] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2024-06-02 19:31:38] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 38 ms.
[2024-06-02 19:31:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:31:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 19:31:38] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:31:38] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2024-06-02 19:31:38] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 28 ms.
[2024-06-02 19:31:39] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 3 ms to minimize.
[2024-06-02 19:31:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2024-06-02 19:31:39] [INFO ] Added : 84 causal constraints over 17 iterations in 619 ms. Result :sat
Minimization took 215 ms.
[2024-06-02 19:31:39] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 19:31:39] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-02 19:31:39] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2024-06-02 19:31:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:31:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 19:31:39] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 19:31:40] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2024-06-02 19:31:40] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 3 ms to minimize.
[2024-06-02 19:31:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2024-06-02 19:31:40] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 41 ms.
[2024-06-02 19:31:40] [INFO ] Added : 90 causal constraints over 18 iterations in 588 ms. Result :sat
Minimization took 151 ms.
[2024-06-02 19:31:41] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 19:31:41] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:31:41] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-06-02 19:31:41] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 23 ms.
[2024-06-02 19:31:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:31:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 19:31:41] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:31:41] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2024-06-02 19:31:41] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 34 ms.
[2024-06-02 19:31:42] [INFO ] Deduced a trap composed of 29 places in 156 ms of which 14 ms to minimize.
[2024-06-02 19:31:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2024-06-02 19:31:42] [INFO ] Added : 96 causal constraints over 20 iterations in 806 ms. Result :sat
Minimization took 244 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA MedleyA-PT-07-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-07-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-07-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-07-UpperBounds-06 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 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 285/285 transitions.
Graph (complete) has 445 edges and 143 vertex of which 136 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 136 transition count 242
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 73 place count 108 transition count 238
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 77 place count 106 transition count 236
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 77 place count 106 transition count 231
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 87 place count 101 transition count 231
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 117 place count 71 transition count 193
Iterating global reduction 3 with 30 rules applied. Total rules applied 147 place count 71 transition count 193
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 147 place count 71 transition count 191
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 151 place count 69 transition count 191
Performed 18 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 187 place count 51 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 188 place count 51 transition count 171
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 196 place count 47 transition count 188
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 203 place count 47 transition count 181
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
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 205 place count 46 transition count 193
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 210 place count 46 transition count 188
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 215 place count 41 transition count 188
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 217 place count 41 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 219 place count 41 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 221 place count 39 transition count 184
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 222 place count 39 transition count 184
Applied a total of 222 rules in 169 ms. Remains 39 /143 variables (removed 104) and now considering 184/285 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 39/143 places, 184/285 transitions.
[2024-06-02 19:31:43] [INFO ] Flow matrix only has 149 transitions (discarded 35 similar events)
// Phase 1: matrix 149 rows 39 cols
[2024-06-02 19:31:43] [INFO ] Computed 11 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (18 resets) in 839 ms. (1190 steps per ms)
FORMULA MedleyA-PT-07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000000 steps (10 resets) in 936 ms. (2134 steps per ms)
FORMULA MedleyA-PT-07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 19:31:44] [INFO ] Flow matrix only has 149 transitions (discarded 35 similar events)
[2024-06-02 19:31:44] [INFO ] Invariant cache hit.
[2024-06-02 19:31:45] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-02 19:31:45] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 19:31:45] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-06-02 19:31:45] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-06-02 19:31:45] [INFO ] [Real]Added 81 Read/Feed constraints in 15 ms returned sat
[2024-06-02 19:31:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:31:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-02 19:31:45] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 19:31:45] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-02 19:31:45] [INFO ] [Nat]Added 81 Read/Feed constraints in 17 ms returned sat
[2024-06-02 19:31:45] [INFO ] Computed and/alt/rep : 8/29/8 causal constraints (skipped 137 transitions) in 14 ms.
[2024-06-02 19:31:45] [INFO ] Added : 2 causal constraints over 1 iterations in 42 ms. Result :sat
Minimization took 98 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 39 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p32) removed 18 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 166/166 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 39 transition count 165
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 38 transition count 165
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 37 transition count 164
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 37 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 36 transition count 163
Applied a total of 6 rules in 20 ms. Remains 36 /39 variables (removed 3) and now considering 163/166 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 36/39 places, 163/166 transitions.
[2024-06-02 19:31:45] [INFO ] Flow matrix only has 134 transitions (discarded 29 similar events)
// Phase 1: matrix 134 rows 36 cols
[2024-06-02 19:31:45] [INFO ] Computed 11 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (9 resets) in 691 ms. (1445 steps per ms)
BEST_FIRST walk for 1000000 steps (20 resets) in 447 ms. (2232 steps per ms)
FORMULA MedleyA-PT-07-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-06-02 19:31:47] [INFO ] Flatten gal took : 109 ms
[2024-06-02 19:31:47] [INFO ] Flatten gal took : 42 ms
[2024-06-02 19:31:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6018255274290721500.gal : 28 ms
[2024-06-02 19:31:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5975592495169707415.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6018255274290721500.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5975592495169707415.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

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
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 20112 ms.

BK_STOP 1717356707264

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-07, 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 r576-smll-171734919900053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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