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.r571-tall-171734910200086.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 gold2023
Input is CO4-PT-18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910200086
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 239K 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 CO4-PT-18-UpperBounds-00
FORMULA_NAME CO4-PT-18-UpperBounds-01
FORMULA_NAME CO4-PT-18-UpperBounds-02
FORMULA_NAME CO4-PT-18-UpperBounds-03
FORMULA_NAME CO4-PT-18-UpperBounds-04
FORMULA_NAME CO4-PT-18-UpperBounds-05
FORMULA_NAME CO4-PT-18-UpperBounds-06
FORMULA_NAME CO4-PT-18-UpperBounds-07
FORMULA_NAME CO4-PT-18-UpperBounds-08
FORMULA_NAME CO4-PT-18-UpperBounds-09
FORMULA_NAME CO4-PT-18-UpperBounds-10
FORMULA_NAME CO4-PT-18-UpperBounds-11
FORMULA_NAME CO4-PT-18-UpperBounds-12
FORMULA_NAME CO4-PT-18-UpperBounds-13
FORMULA_NAME CO4-PT-18-UpperBounds-14
FORMULA_NAME CO4-PT-18-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717368817836

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-18
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 22:53:39] [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 22:53:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:53:39] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-06-02 22:53:39] [INFO ] Transformed 979 places.
[2024-06-02 22:53:39] [INFO ] Transformed 1111 transitions.
[2024-06-02 22:53:39] [INFO ] Found NUPN structural information;
[2024-06-02 22:53:39] [INFO ] Parsed PT model containing 979 places and 1111 transitions and 2420 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 157 places in 13 ms
Reduce places removed 157 places and 177 transitions.
FORMULA CO4-PT-18-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 934 rows 822 cols
[2024-06-02 22:53:39] [INFO ] Computed 8 invariants in 32 ms
Incomplete random walk after 10000 steps, including 14 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :1
FORMULA CO4-PT-18-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 11) seen :0
[2024-06-02 22:53:40] [INFO ] Invariant cache hit.
[2024-06-02 22:53:40] [INFO ] [Real]Absence check using 8 positive place invariants in 20 ms returned sat
[2024-06-02 22:53:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:53:40] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2024-06-02 22:53:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:53:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2024-06-02 22:53:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:53:41] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2024-06-02 22:53:41] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 54 ms.
[2024-06-02 22:53:43] [INFO ] Added : 191 causal constraints over 39 iterations in 1880 ms. Result :sat
Minimization took 105 ms.
[2024-06-02 22:53:43] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2024-06-02 22:53:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:53:43] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2024-06-02 22:53:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:53:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2024-06-02 22:53:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:53:43] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2024-06-02 22:53:44] [INFO ] Deduced a trap composed of 125 places in 193 ms of which 3 ms to minimize.
[2024-06-02 22:53:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2024-06-02 22:53:44] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 58 ms.
[2024-06-02 22:53:45] [INFO ] Deduced a trap composed of 82 places in 143 ms of which 1 ms to minimize.
[2024-06-02 22:53:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2024-06-02 22:53:45] [INFO ] Added : 119 causal constraints over 25 iterations in 1449 ms. Result :sat
Minimization took 98 ms.
[2024-06-02 22:53:45] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2024-06-02 22:53:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:53:46] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2024-06-02 22:53:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:53:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2024-06-02 22:53:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:53:46] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2024-06-02 22:53:46] [INFO ] Deduced a trap composed of 125 places in 141 ms of which 1 ms to minimize.
[2024-06-02 22:53:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2024-06-02 22:53:46] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 46 ms.
[2024-06-02 22:53:48] [INFO ] Added : 176 causal constraints over 36 iterations in 1748 ms. Result :sat
Minimization took 129 ms.
[2024-06-02 22:53:48] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2024-06-02 22:53:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:53:49] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2024-06-02 22:53:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:53:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2024-06-02 22:53:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:53:49] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2024-06-02 22:53:49] [INFO ] Deduced a trap composed of 296 places in 188 ms of which 3 ms to minimize.
[2024-06-02 22:53:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2024-06-02 22:53:49] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 55 ms.
[2024-06-02 22:53:52] [INFO ] Added : 241 causal constraints over 49 iterations in 2369 ms. Result :sat
Minimization took 113 ms.
[2024-06-02 22:53:52] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2024-06-02 22:53:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:53:52] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2024-06-02 22:53:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:53:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2024-06-02 22:53:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:53:53] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2024-06-02 22:53:53] [INFO ] Deduced a trap composed of 296 places in 198 ms of which 1 ms to minimize.
[2024-06-02 22:53:53] [INFO ] Deduced a trap composed of 459 places in 218 ms of which 0 ms to minimize.
[2024-06-02 22:53:53] [INFO ] Deduced a trap composed of 547 places in 227 ms of which 1 ms to minimize.
[2024-06-02 22:53:54] [INFO ] Deduced a trap composed of 601 places in 172 ms of which 1 ms to minimize.
[2024-06-02 22:53:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1022 ms
[2024-06-02 22:53:54] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 49 ms.
[2024-06-02 22:53:55] [INFO ] Added : 155 causal constraints over 31 iterations in 1481 ms. Result :sat
Minimization took 126 ms.
[2024-06-02 22:53:55] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2024-06-02 22:53:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:53:56] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2024-06-02 22:53:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:53:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2024-06-02 22:53:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:53:56] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2024-06-02 22:53:56] [INFO ] Deduced a trap composed of 125 places in 130 ms of which 1 ms to minimize.
[2024-06-02 22:53:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2024-06-02 22:53:56] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 46 ms.
[2024-06-02 22:53:58] [INFO ] Added : 176 causal constraints over 36 iterations in 1624 ms. Result :sat
Minimization took 100 ms.
[2024-06-02 22:53:58] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2024-06-02 22:53:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:53:58] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2024-06-02 22:53:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:53:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2024-06-02 22:53:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:53:59] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2024-06-02 22:53:59] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 45 ms.
[2024-06-02 22:54:00] [INFO ] Added : 96 causal constraints over 20 iterations in 925 ms. Result :sat
Minimization took 96 ms.
[2024-06-02 22:54:00] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2024-06-02 22:54:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:54:00] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2024-06-02 22:54:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:54:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2024-06-02 22:54:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:54:01] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2024-06-02 22:54:01] [INFO ] Deduced a trap composed of 296 places in 207 ms of which 1 ms to minimize.
[2024-06-02 22:54:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
[2024-06-02 22:54:01] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 49 ms.
[2024-06-02 22:54:02] [INFO ] Added : 132 causal constraints over 27 iterations in 1290 ms. Result :sat
Minimization took 102 ms.
[2024-06-02 22:54:02] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2024-06-02 22:54:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:54:03] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2024-06-02 22:54:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:54:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2024-06-02 22:54:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:54:03] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2024-06-02 22:54:03] [INFO ] Deduced a trap composed of 125 places in 193 ms of which 1 ms to minimize.
[2024-06-02 22:54:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2024-06-02 22:54:03] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 44 ms.
[2024-06-02 22:54:05] [INFO ] Added : 173 causal constraints over 35 iterations in 1634 ms. Result :sat
Minimization took 100 ms.
[2024-06-02 22:54:05] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2024-06-02 22:54:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:54:06] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2024-06-02 22:54:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:54:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2024-06-02 22:54:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:54:06] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2024-06-02 22:54:06] [INFO ] Deduced a trap composed of 296 places in 203 ms of which 1 ms to minimize.
[2024-06-02 22:54:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2024-06-02 22:54:06] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 44 ms.
[2024-06-02 22:54:08] [INFO ] Added : 173 causal constraints over 35 iterations in 1609 ms. Result :sat
Minimization took 97 ms.
[2024-06-02 22:54:08] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2024-06-02 22:54:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:54:08] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2024-06-02 22:54:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:54:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2024-06-02 22:54:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:54:09] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2024-06-02 22:54:09] [INFO ] Deduced a trap composed of 125 places in 140 ms of which 0 ms to minimize.
[2024-06-02 22:54:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2024-06-02 22:54:09] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 41 ms.
[2024-06-02 22:54:11] [INFO ] Added : 176 causal constraints over 36 iterations in 1632 ms. Result :sat
Minimization took 99 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA CO4-PT-18-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-18-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-18-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-18-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-18-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-18-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-18-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-18-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-18-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-18-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 822 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 822/822 places, 933/933 transitions.
Graph (trivial) has 842 edges and 822 vertex of which 3 / 822 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1117 edges and 820 vertex of which 778 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.3 ms
Discarding 42 places :
Also discarding 23 output transitions
Drop transitions removed 23 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 513 transitions
Trivial Post-agglo rules discarded 513 transitions
Performed 513 trivial Post agglomeration. Transition count delta: 513
Iterating post reduction 0 with 537 rules applied. Total rules applied 539 place count 777 transition count 370
Reduce places removed 514 places and 1 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 526 rules applied. Total rules applied 1065 place count 263 transition count 357
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 13 rules applied. Total rules applied 1078 place count 257 transition count 350
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 1082 place count 255 transition count 348
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 1085 place count 254 transition count 346
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1087 place count 253 transition count 345
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1087 place count 253 transition count 343
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 3 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1093 place count 249 transition count 340
Discarding 38 places :
Symmetric choice reduction at 6 with 38 rule applications. Total rules 1131 place count 211 transition count 302
Iterating global reduction 6 with 38 rules applied. Total rules applied 1169 place count 211 transition count 302
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 13 Pre rules applied. Total rules applied 1169 place count 211 transition count 289
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 1195 place count 198 transition count 289
Discarding 23 places :
Symmetric choice reduction at 6 with 23 rule applications. Total rules 1218 place count 175 transition count 266
Iterating global reduction 6 with 23 rules applied. Total rules applied 1241 place count 175 transition count 266
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 5 rules applied. Total rules applied 1246 place count 175 transition count 261
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1247 place count 174 transition count 261
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1249 place count 172 transition count 258
Iterating global reduction 8 with 2 rules applied. Total rules applied 1251 place count 172 transition count 258
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1253 place count 172 transition count 256
Performed 75 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 9 with 150 rules applied. Total rules applied 1403 place count 97 transition count 171
Drop transitions removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1409 place count 97 transition count 165
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1412 place count 94 transition count 162
Iterating global reduction 10 with 3 rules applied. Total rules applied 1415 place count 94 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1416 place count 94 transition count 161
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 1420 place count 92 transition count 159
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1422 place count 92 transition count 157
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 1424 place count 90 transition count 155
Iterating global reduction 12 with 2 rules applied. Total rules applied 1426 place count 90 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1427 place count 90 transition count 154
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1428 place count 89 transition count 153
Iterating global reduction 13 with 1 rules applied. Total rules applied 1429 place count 89 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1430 place count 89 transition count 152
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 14 with 56 rules applied. Total rules applied 1486 place count 61 transition count 154
Drop transitions removed 16 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 14 with 36 rules applied. Total rules applied 1522 place count 61 transition count 118
Discarding 25 places :
Symmetric choice reduction at 15 with 25 rule applications. Total rules 1547 place count 36 transition count 82
Iterating global reduction 15 with 25 rules applied. Total rules applied 1572 place count 36 transition count 82
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 15 with 20 rules applied. Total rules applied 1592 place count 36 transition count 62
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 1596 place count 32 transition count 51
Iterating global reduction 16 with 4 rules applied. Total rules applied 1600 place count 32 transition count 51
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 1603 place count 32 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 1605 place count 31 transition count 55
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 1608 place count 31 transition count 52
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 18 with 5 rules applied. Total rules applied 1613 place count 31 transition count 47
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 1614 place count 30 transition count 46
Iterating global reduction 18 with 1 rules applied. Total rules applied 1615 place count 30 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 1616 place count 30 transition count 45
Free-agglomeration rule applied 5 times.
Iterating global reduction 19 with 5 rules applied. Total rules applied 1621 place count 30 transition count 40
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 7 rules applied. Total rules applied 1628 place count 25 transition count 38
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 20 with 2 rules applied. Total rules applied 1630 place count 25 transition count 38
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 69 edges and 25 vertex of which 24 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 20 with 2 rules applied. Total rules applied 1632 place count 24 transition count 37
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 1633 place count 24 transition count 36
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 1634 place count 24 transition count 36
Graph (complete) has 66 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 22 with 1 rules applied. Total rules applied 1635 place count 23 transition count 36
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 1636 place count 23 transition count 35
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 24 with 1 rules applied. Total rules applied 1637 place count 23 transition count 35
Graph (complete) has 63 edges and 23 vertex of which 22 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 24 with 1 rules applied. Total rules applied 1638 place count 22 transition count 35
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 1639 place count 22 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 26 with 1 rules applied. Total rules applied 1640 place count 21 transition count 33
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t154.t155.t973 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 15 edges and 17 vertex of which 3 / 17 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 26 with 3 rules applied. Total rules applied 1643 place count 15 transition count 31
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t62.t63.t64.t955.t298.t299.t300.t1068.t37.t317 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 12 edges and 13 vertex of which 3 / 13 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 27 with 9 rules applied. Total rules applied 1652 place count 11 transition count 23
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 17 edges and 10 vertex of which 3 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Iterating post reduction 28 with 12 rules applied. Total rules applied 1664 place count 3 transition count 7
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 29 with 5 rules applied. Total rules applied 1669 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 30 with 1 Pre rules applied. Total rules applied 1669 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 30 with 2 rules applied. Total rules applied 1671 place count 2 transition count 1
Applied a total of 1671 rules in 137 ms. Remains 2 /822 variables (removed 820) and now considering 1/933 (removed 932) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 2/822 places, 1/933 transitions.
// Phase 1: matrix 1 rows 2 cols
[2024-06-02 22:54:11] [INFO ] Computed 1 invariants in 0 ms
Incomplete random walk after 1000000 steps, including 500000 resets, run finished after 246 ms. (steps per millisecond=4065 ) properties (out of 1) seen :1
FORMULA CO4-PT-18-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 32440 ms.

BK_STOP 1717368852839

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="CO4-PT-18"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is CO4-PT-18, 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 r571-tall-171734910200086"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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