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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K 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 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K 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 132K 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-10-UpperBounds-00
FORMULA_NAME CO4-PT-10-UpperBounds-01
FORMULA_NAME CO4-PT-10-UpperBounds-02
FORMULA_NAME CO4-PT-10-UpperBounds-03
FORMULA_NAME CO4-PT-10-UpperBounds-04
FORMULA_NAME CO4-PT-10-UpperBounds-05
FORMULA_NAME CO4-PT-10-UpperBounds-06
FORMULA_NAME CO4-PT-10-UpperBounds-07
FORMULA_NAME CO4-PT-10-UpperBounds-08
FORMULA_NAME CO4-PT-10-UpperBounds-09
FORMULA_NAME CO4-PT-10-UpperBounds-10
FORMULA_NAME CO4-PT-10-UpperBounds-11
FORMULA_NAME CO4-PT-10-UpperBounds-12
FORMULA_NAME CO4-PT-10-UpperBounds-13
FORMULA_NAME CO4-PT-10-UpperBounds-14
FORMULA_NAME CO4-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717368663888

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-10
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 22:51:05] [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:51:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:51:05] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-06-02 22:51:05] [INFO ] Transformed 544 places.
[2024-06-02 22:51:05] [INFO ] Transformed 615 transitions.
[2024-06-02 22:51:05] [INFO ] Found NUPN structural information;
[2024-06-02 22:51:05] [INFO ] Parsed PT model containing 544 places and 615 transitions and 1338 arcs in 143 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 157 places in 8 ms
Reduce places removed 157 places and 177 transitions.
FORMULA CO4-PT-10-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 438 rows 387 cols
[2024-06-02 22:51:05] [INFO ] Computed 6 invariants in 22 ms
Incomplete random walk after 10000 steps, including 14 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :2
FORMULA CO4-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
[2024-06-02 22:51:06] [INFO ] Invariant cache hit.
[2024-06-02 22:51:06] [INFO ] [Real]Absence check using 6 positive place invariants in 13 ms returned sat
[2024-06-02 22:51:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:06] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2024-06-02 22:51:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:51:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 22:51:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:06] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2024-06-02 22:51:06] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 33 ms.
[2024-06-02 22:51:07] [INFO ] Added : 69 causal constraints over 14 iterations in 447 ms. Result :sat
Minimization took 47 ms.
[2024-06-02 22:51:07] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 22:51:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:07] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2024-06-02 22:51:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:51:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 22:51:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:07] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2024-06-02 22:51:07] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 26 ms.
[2024-06-02 22:51:08] [INFO ] Added : 66 causal constraints over 14 iterations in 394 ms. Result :sat
Minimization took 45 ms.
[2024-06-02 22:51:08] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 22:51:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:08] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2024-06-02 22:51:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:51:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 22:51:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:08] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2024-06-02 22:51:08] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 25 ms.
[2024-06-02 22:51:09] [INFO ] Added : 82 causal constraints over 17 iterations in 487 ms. Result :sat
Minimization took 56 ms.
[2024-06-02 22:51:09] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 22:51:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:09] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-06-02 22:51:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:51:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 22:51:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:09] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2024-06-02 22:51:09] [INFO ] Deduced a trap composed of 315 places in 127 ms of which 3 ms to minimize.
[2024-06-02 22:51:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2024-06-02 22:51:09] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 41 ms.
[2024-06-02 22:51:10] [INFO ] Added : 75 causal constraints over 15 iterations in 458 ms. Result :sat
Minimization took 44 ms.
[2024-06-02 22:51:10] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-02 22:51:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:10] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2024-06-02 22:51:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:51:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 22:51:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:10] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2024-06-02 22:51:10] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 25 ms.
[2024-06-02 22:51:10] [INFO ] Added : 63 causal constraints over 13 iterations in 387 ms. Result :sat
Minimization took 45 ms.
[2024-06-02 22:51:11] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 22:51:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:11] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2024-06-02 22:51:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:51:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 22:51:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:11] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2024-06-02 22:51:11] [INFO ] Deduced a trap composed of 257 places in 103 ms of which 1 ms to minimize.
[2024-06-02 22:51:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2024-06-02 22:51:11] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 25 ms.
[2024-06-02 22:51:12] [INFO ] Added : 71 causal constraints over 15 iterations in 378 ms. Result :sat
Minimization took 46 ms.
[2024-06-02 22:51:12] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 22:51:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:12] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2024-06-02 22:51:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:51:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 22:51:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:12] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-06-02 22:51:12] [INFO ] Deduced a trap composed of 315 places in 92 ms of which 1 ms to minimize.
[2024-06-02 22:51:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2024-06-02 22:51:12] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 23 ms.
[2024-06-02 22:51:13] [INFO ] Added : 75 causal constraints over 16 iterations in 392 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA CO4-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 387 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 387/387 places, 438/438 transitions.
Graph (trivial) has 382 edges and 387 vertex of which 3 / 387 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 529 edges and 385 vertex of which 351 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.2 ms
Discarding 34 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 235 rules applied. Total rules applied 237 place count 351 transition count 181
Reduce places removed 217 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 1 with 223 rules applied. Total rules applied 460 place count 134 transition count 175
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 11 rules applied. Total rules applied 471 place count 131 transition count 167
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 477 place count 126 transition count 166
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 477 place count 126 transition count 164
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 481 place count 124 transition count 164
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 498 place count 107 transition count 147
Iterating global reduction 4 with 17 rules applied. Total rules applied 515 place count 107 transition count 147
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 515 place count 107 transition count 143
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 523 place count 103 transition count 143
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 532 place count 94 transition count 134
Iterating global reduction 4 with 9 rules applied. Total rules applied 541 place count 94 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 542 place count 94 transition count 133
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 543 place count 93 transition count 132
Iterating global reduction 5 with 1 rules applied. Total rules applied 544 place count 93 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 545 place count 93 transition count 131
Performed 37 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 6 with 74 rules applied. Total rules applied 619 place count 56 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 620 place count 56 transition count 88
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 644 place count 44 transition count 89
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 652 place count 44 transition count 81
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 661 place count 35 transition count 63
Iterating global reduction 8 with 9 rules applied. Total rules applied 670 place count 35 transition count 63
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 677 place count 35 transition count 56
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 678 place count 34 transition count 53
Iterating global reduction 9 with 1 rules applied. Total rules applied 679 place count 34 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 680 place count 34 transition count 52
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 681 place count 34 transition count 51
Free-agglomeration rule applied 7 times.
Iterating global reduction 10 with 7 rules applied. Total rules applied 688 place count 34 transition count 44
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 72 edges and 27 vertex of which 26 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 10 with 9 rules applied. Total rules applied 697 place count 26 transition count 43
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 698 place count 26 transition count 42
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 699 place count 26 transition count 41
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 700 place count 26 transition count 41
Graph (complete) has 68 edges and 26 vertex of which 25 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 12 with 1 rules applied. Total rules applied 701 place count 25 transition count 41
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 702 place count 25 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 703 place count 24 transition count 39
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t130.t131.t558.t38.t39.t40 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 705 place count 21 transition count 37
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 15 with 4 rules applied. Total rules applied 709 place count 21 transition count 33
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 711 place count 19 transition count 31
Iterating global reduction 15 with 2 rules applied. Total rules applied 713 place count 19 transition count 31
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 715 place count 19 transition count 29
Free-agglomeration rule applied 3 times.
Iterating global reduction 16 with 3 rules applied. Total rules applied 718 place count 19 transition count 26
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 721 place count 16 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 722 place count 16 transition count 25
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 723 place count 16 transition count 24
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 725 place count 15 transition count 23
Applied a total of 725 rules in 79 ms. Remains 15 /387 variables (removed 372) and now considering 23/438 (removed 415) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 15/387 places, 23/438 transitions.
Normalized transition count is 19 out of 23 initially.
// Phase 1: matrix 19 rows 15 cols
[2024-06-02 22:51:13] [INFO ] Computed 2 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 707 ms. (steps per millisecond=1414 ) properties (out of 5) seen :5
FORMULA CO4-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 8518 ms.

BK_STOP 1717368674968

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

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