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-171734910200091.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-19, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910200091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 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 8.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K 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 332K 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-19-UpperBounds-00
FORMULA_NAME CO4-PT-19-UpperBounds-01
FORMULA_NAME CO4-PT-19-UpperBounds-02
FORMULA_NAME CO4-PT-19-UpperBounds-03
FORMULA_NAME CO4-PT-19-UpperBounds-04
FORMULA_NAME CO4-PT-19-UpperBounds-05
FORMULA_NAME CO4-PT-19-UpperBounds-06
FORMULA_NAME CO4-PT-19-UpperBounds-07
FORMULA_NAME CO4-PT-19-UpperBounds-08
FORMULA_NAME CO4-PT-19-UpperBounds-09
FORMULA_NAME CO4-PT-19-UpperBounds-10
FORMULA_NAME CO4-PT-19-UpperBounds-11
FORMULA_NAME CO4-PT-19-UpperBounds-12
FORMULA_NAME CO4-PT-19-UpperBounds-13
FORMULA_NAME CO4-PT-19-UpperBounds-14
FORMULA_NAME CO4-PT-19-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717368883612

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-19
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 22:54:45] [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:54:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:54:45] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-06-02 22:54:45] [INFO ] Transformed 1174 places.
[2024-06-02 22:54:45] [INFO ] Transformed 1447 transitions.
[2024-06-02 22:54:45] [INFO ] Found NUPN structural information;
[2024-06-02 22:54:45] [INFO ] Parsed PT model containing 1174 places and 1447 transitions and 3662 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 201 places in 16 ms
Reduce places removed 201 places and 274 transitions.
FORMULA CO4-PT-19-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1173 rows 973 cols
[2024-06-02 22:54:45] [INFO ] Computed 12 invariants in 31 ms
Incomplete random walk after 10000 steps, including 210 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :2
FORMULA CO4-PT-19-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-19-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 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 35 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :1
FORMULA CO4-PT-19-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
[2024-06-02 22:54:45] [INFO ] Invariant cache hit.
[2024-06-02 22:54:46] [INFO ] [Real]Absence check using 11 positive place invariants in 23 ms returned sat
[2024-06-02 22:54:46] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 22:54:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:54:46] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2024-06-02 22:54:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:54:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 33 ms returned sat
[2024-06-02 22:54:46] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 22:54:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:54:47] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2024-06-02 22:54:47] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 117 ms.
[2024-06-02 22:54:48] [INFO ] Added : 93 causal constraints over 19 iterations in 1397 ms. Result :sat
Minimization took 125 ms.
[2024-06-02 22:54:49] [INFO ] [Real]Absence check using 11 positive place invariants in 28 ms returned sat
[2024-06-02 22:54:49] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:54:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:54:49] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2024-06-02 22:54:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:54:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2024-06-02 22:54:49] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:54:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:54:49] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2024-06-02 22:54:50] [INFO ] Deduced a trap composed of 602 places in 245 ms of which 3 ms to minimize.
[2024-06-02 22:54:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 359 ms
[2024-06-02 22:54:50] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 65 ms.
[2024-06-02 22:54:51] [INFO ] Added : 143 causal constraints over 29 iterations in 1696 ms. Result :sat
Minimization took 139 ms.
[2024-06-02 22:54:52] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2024-06-02 22:54:52] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:54:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:54:52] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2024-06-02 22:54:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:54:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2024-06-02 22:54:52] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:54:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:54:53] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2024-06-02 22:54:53] [INFO ] Deduced a trap composed of 458 places in 278 ms of which 4 ms to minimize.
[2024-06-02 22:54:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 407 ms
[2024-06-02 22:54:53] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 68 ms.
[2024-06-02 22:54:55] [INFO ] Added : 145 causal constraints over 29 iterations in 1748 ms. Result :sat
Minimization took 133 ms.
[2024-06-02 22:54:55] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2024-06-02 22:54:55] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:54:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:54:55] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2024-06-02 22:54:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:54:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2024-06-02 22:54:56] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:54:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:54:56] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2024-06-02 22:54:56] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 65 ms.
[2024-06-02 22:54:58] [INFO ] Added : 128 causal constraints over 26 iterations in 1520 ms. Result :sat
Minimization took 134 ms.
[2024-06-02 22:54:58] [INFO ] [Real]Absence check using 11 positive place invariants in 23 ms returned sat
[2024-06-02 22:54:58] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:54:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:54:58] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2024-06-02 22:54:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:54:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2024-06-02 22:54:58] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-02 22:54:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:54:59] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2024-06-02 22:54:59] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 58 ms.
[2024-06-02 22:55:00] [INFO ] Added : 121 causal constraints over 25 iterations in 1437 ms. Result :sat
Minimization took 123 ms.
[2024-06-02 22:55:00] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2024-06-02 22:55:00] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:55:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:01] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2024-06-02 22:55:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:55:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2024-06-02 22:55:01] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:55:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:01] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2024-06-02 22:55:01] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 61 ms.
[2024-06-02 22:55:02] [INFO ] Added : 87 causal constraints over 18 iterations in 1072 ms. Result :sat
Minimization took 112 ms.
[2024-06-02 22:55:03] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2024-06-02 22:55:03] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:55:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:03] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2024-06-02 22:55:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:55:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2024-06-02 22:55:03] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:55:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:04] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2024-06-02 22:55:04] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 55 ms.
[2024-06-02 22:55:05] [INFO ] Added : 127 causal constraints over 26 iterations in 1508 ms. Result :sat
Minimization took 132 ms.
[2024-06-02 22:55:05] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2024-06-02 22:55:05] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:55:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:06] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2024-06-02 22:55:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:55:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2024-06-02 22:55:06] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-02 22:55:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:06] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2024-06-02 22:55:06] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 58 ms.
[2024-06-02 22:55:08] [INFO ] Deduced a trap composed of 508 places in 202 ms of which 1 ms to minimize.
[2024-06-02 22:55:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2024-06-02 22:55:08] [INFO ] Added : 151 causal constraints over 31 iterations in 2112 ms. Result :sat
Minimization took 158 ms.
[2024-06-02 22:55:09] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2024-06-02 22:55:09] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:55:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:09] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2024-06-02 22:55:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:55:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2024-06-02 22:55:09] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:55:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:10] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2024-06-02 22:55:10] [INFO ] Deduced a trap composed of 430 places in 271 ms of which 2 ms to minimize.
[2024-06-02 22:55:10] [INFO ] Deduced a trap composed of 458 places in 270 ms of which 1 ms to minimize.
[2024-06-02 22:55:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 675 ms
[2024-06-02 22:55:10] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 51 ms.
[2024-06-02 22:55:12] [INFO ] Added : 152 causal constraints over 31 iterations in 1725 ms. Result :sat
Minimization took 165 ms.
[2024-06-02 22:55:12] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2024-06-02 22:55:12] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:55:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:13] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2024-06-02 22:55:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:55:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2024-06-02 22:55:13] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:55:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:13] [INFO ] [Nat]Absence check using state equation in 326 ms returned sat
[2024-06-02 22:55:13] [INFO ] Computed and/alt/rep : 988/1274/988 causal constraints (skipped 184 transitions) in 59 ms.
[2024-06-02 22:55:15] [INFO ] Added : 180 causal constraints over 36 iterations in 2016 ms. Result :sat
Minimization took 154 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA CO4-PT-19-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-19-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-19-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-19-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-19-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-19-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 973 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 973/973 places, 1173/1173 transitions.
Graph (trivial) has 1000 edges and 973 vertex of which 3 / 973 are part of one of the 1 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1567 edges and 971 vertex of which 912 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.3 ms
Discarding 59 places :
Also discarding 26 output transitions
Drop transitions removed 26 transitions
Drop transitions removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions removed 597 transitions
Trivial Post-agglo rules discarded 597 transitions
Performed 597 trivial Post agglomeration. Transition count delta: 597
Iterating post reduction 0 with 632 rules applied. Total rules applied 634 place count 912 transition count 512
Reduce places removed 597 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 627 rules applied. Total rules applied 1261 place count 315 transition count 482
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 2 with 32 rules applied. Total rules applied 1293 place count 301 transition count 464
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 12 rules applied. Total rules applied 1305 place count 295 transition count 458
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 9 rules applied. Total rules applied 1314 place count 292 transition count 452
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 5 with 9 rules applied. Total rules applied 1323 place count 289 transition count 446
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1326 place count 286 transition count 446
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1326 place count 286 transition count 445
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1328 place count 285 transition count 445
Discarding 46 places :
Symmetric choice reduction at 7 with 46 rule applications. Total rules 1374 place count 239 transition count 399
Iterating global reduction 7 with 46 rules applied. Total rules applied 1420 place count 239 transition count 399
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 15 Pre rules applied. Total rules applied 1420 place count 239 transition count 384
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 1450 place count 224 transition count 384
Discarding 25 places :
Symmetric choice reduction at 7 with 25 rule applications. Total rules 1475 place count 199 transition count 346
Iterating global reduction 7 with 25 rules applied. Total rules applied 1500 place count 199 transition count 346
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 7 with 7 rules applied. Total rules applied 1507 place count 199 transition count 339
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1508 place count 198 transition count 339
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1511 place count 195 transition count 336
Iterating global reduction 9 with 3 rules applied. Total rules applied 1514 place count 195 transition count 336
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1517 place count 195 transition count 333
Performed 74 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 10 with 148 rules applied. Total rules applied 1665 place count 121 transition count 249
Drop transitions removed 1 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1670 place count 121 transition count 244
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 11 with 80 rules applied. Total rules applied 1750 place count 81 transition count 289
Drop transitions removed 62 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 82 transitions.
Iterating post reduction 11 with 82 rules applied. Total rules applied 1832 place count 81 transition count 207
Discarding 28 places :
Symmetric choice reduction at 12 with 28 rule applications. Total rules 1860 place count 53 transition count 140
Iterating global reduction 12 with 28 rules applied. Total rules applied 1888 place count 53 transition count 140
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 12 with 21 rules applied. Total rules applied 1909 place count 53 transition count 119
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 1915 place count 47 transition count 94
Iterating global reduction 13 with 6 rules applied. Total rules applied 1921 place count 47 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 1925 place count 47 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1927 place count 46 transition count 105
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 1930 place count 46 transition count 102
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 15 with 14 rules applied. Total rules applied 1944 place count 46 transition count 88
Free-agglomeration rule applied 8 times.
Iterating global reduction 15 with 8 rules applied. Total rules applied 1952 place count 46 transition count 80
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 10 rules applied. Total rules applied 1962 place count 38 transition count 78
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1963 place count 38 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1964 place count 37 transition count 77
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t731.t732.t1159 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 17 edges and 33 vertex of which 3 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 16 with 3 rules applied. Total rules applied 1967 place count 31 transition count 75
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 17 edges and 30 vertex of which 6 / 30 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 17 with 8 rules applied. Total rules applied 1975 place count 25 transition count 69
Drop transitions removed 15 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 18 with 23 rules applied. Total rules applied 1998 place count 25 transition count 46
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 1999 place count 24 transition count 44
Iterating global reduction 19 with 1 rules applied. Total rules applied 2000 place count 24 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 2001 place count 24 transition count 43
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 20 with 4 rules applied. Total rules applied 2005 place count 24 transition count 39
Free-agglomeration rule applied 4 times.
Iterating global reduction 20 with 4 rules applied. Total rules applied 2009 place count 24 transition count 35
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 2013 place count 20 transition count 35
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 21 with 2 rules applied. Total rules applied 2015 place count 20 transition count 33
Free-agglomeration rule applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 2016 place count 20 transition count 32
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 3 rules applied. Total rules applied 2019 place count 19 transition count 30
Applied a total of 2019 rules in 156 ms. Remains 19 /973 variables (removed 954) and now considering 30/1173 (removed 1143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 19/973 places, 30/1173 transitions.
Successfully produced net in file /tmp/petri1000_16181611225287707384.dot
Successfully produced net in file /tmp/petri1001_2047230158014174107.dot
Drop transitions removed 2 transitions
Dominated transitions for bounds rules discarded 2 transitions
Reduce places removed 1 places and 0 transitions.
Normalized transition count is 19 out of 28 initially.
// Phase 1: matrix 19 rows 18 cols
[2024-06-02 22:55:16] [INFO ] Computed 6 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1084 ms. (steps per millisecond=922 ) properties (out of 4) seen :4
FORMULA CO4-PT-19-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-19-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-19-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-19-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 32064 ms.

BK_STOP 1717368918378

--------------------
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-19"
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-19, 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-171734910200091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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