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.r597-smll-171734926400041.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 MedleyA-PT-09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926400041
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 99K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717362063551

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=MedleyA-PT-09
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 21:01:06] [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 21:01:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:01:06] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-06-02 21:01:06] [INFO ] Transformed 147 places.
[2024-06-02 21:01:06] [INFO ] Transformed 315 transitions.
[2024-06-02 21:01:06] [INFO ] Found NUPN structural information;
[2024-06-02 21:01:06] [INFO ] Parsed PT model containing 147 places and 315 transitions and 1583 arcs in 238 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 2 transitions.
// Phase 1: matrix 313 rows 145 cols
[2024-06-02 21:01:06] [INFO ] Computed 12 invariants in 33 ms
Incomplete random walk after 10000 steps, including 325 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 16) seen :10
FORMULA MedleyA-PT-09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-09-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-09-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :1
FORMULA MedleyA-PT-09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :1
FORMULA MedleyA-PT-09-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-06-02 21:01:06] [INFO ] Invariant cache hit.
[2024-06-02 21:01:07] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 21:01:07] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 21:01:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:01:07] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2024-06-02 21:01:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:01:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 21:01:07] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 21:01:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:01:07] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2024-06-02 21:01:07] [INFO ] Deduced a trap composed of 29 places in 243 ms of which 4 ms to minimize.
[2024-06-02 21:01:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 300 ms
[2024-06-02 21:01:07] [INFO ] Computed and/alt/rep : 104/256/104 causal constraints (skipped 208 transitions) in 74 ms.
[2024-06-02 21:01:08] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 1 ms to minimize.
[2024-06-02 21:01:08] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-06-02 21:01:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 239 ms
[2024-06-02 21:01:08] [INFO ] Added : 81 causal constraints over 17 iterations in 841 ms. Result :sat
Minimization took 83 ms.
[2024-06-02 21:01:08] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 21:01:08] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 21:01:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:01:09] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2024-06-02 21:01:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:01:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 21:01:09] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 12 ms returned sat
[2024-06-02 21:01:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:01:09] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2024-06-02 21:01:09] [INFO ] Computed and/alt/rep : 104/256/104 causal constraints (skipped 208 transitions) in 55 ms.
[2024-06-02 21:01:09] [INFO ] Added : 75 causal constraints over 15 iterations in 408 ms. Result :sat
Minimization took 63 ms.
[2024-06-02 21:01:09] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 21:01:09] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 21:01:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:01:09] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2024-06-02 21:01:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:01:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 21:01:10] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 21:01:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:01:10] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2024-06-02 21:01:10] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 1 ms to minimize.
[2024-06-02 21:01:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2024-06-02 21:01:10] [INFO ] Computed and/alt/rep : 104/256/104 causal constraints (skipped 208 transitions) in 31 ms.
[2024-06-02 21:01:10] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:01:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2024-06-02 21:01:10] [INFO ] Added : 76 causal constraints over 16 iterations in 506 ms. Result :sat
Minimization took 55 ms.
[2024-06-02 21:01:10] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 21:01:10] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 21:01:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:01:10] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2024-06-02 21:01:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:01:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 21:01:11] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 21:01:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:01:11] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2024-06-02 21:01:11] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2024-06-02 21:01:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2024-06-02 21:01:11] [INFO ] Computed and/alt/rep : 104/256/104 causal constraints (skipped 208 transitions) in 26 ms.
[2024-06-02 21:01:11] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 1 ms to minimize.
[2024-06-02 21:01:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2024-06-02 21:01:11] [INFO ] Added : 69 causal constraints over 15 iterations in 493 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA MedleyA-PT-09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 313/313 transitions.
Graph (complete) has 480 edges and 145 vertex of which 140 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 140 transition count 281
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 31 rules applied. Total rules applied 61 place count 112 transition count 278
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 111 transition count 276
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 66 place count 110 transition count 275
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 66 place count 110 transition count 270
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 76 place count 105 transition count 270
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 107 place count 74 transition count 231
Iterating global reduction 4 with 31 rules applied. Total rules applied 138 place count 74 transition count 231
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 138 place count 74 transition count 229
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 142 place count 72 transition count 229
Performed 20 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 182 place count 52 transition count 208
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 184 place count 52 transition count 206
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 192 place count 48 transition count 214
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 201 place count 48 transition count 205
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 201 place count 48 transition count 204
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 203 place count 47 transition count 204
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 207 place count 45 transition count 227
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 212 place count 45 transition count 222
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 217 place count 40 transition count 222
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 219 place count 40 transition count 220
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 221 place count 38 transition count 220
Applied a total of 221 rules in 160 ms. Remains 38 /145 variables (removed 107) and now considering 220/313 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 38/145 places, 220/313 transitions.
Successfully produced net in file /tmp/petri1000_16070508122721174793.dot
Successfully produced net in file /tmp/petri1001_6196272676153958320.dot
Successfully produced net in file /tmp/petri1002_12045019701214834674.dot
Successfully produced net in file /tmp/petri1003_12862717309989655460.dot
Successfully produced net in file /tmp/petri1004_7256029795739173032.dot
Successfully produced net in file /tmp/petri1005_10185982327866995785.dot
Successfully produced net in file /tmp/petri1006_5568711225461938281.dot
Successfully produced net in file /tmp/petri1007_447392183714039032.dot
Successfully produced net in file /tmp/petri1008_12889891012290703193.dot
Successfully produced net in file /tmp/petri1009_5849658300513288432.dot
Successfully produced net in file /tmp/petri1010_16540832986805974476.dot
Successfully produced net in file /tmp/petri1011_13258113541419085065.dot
Successfully produced net in file /tmp/petri1012_13730179474044215827.dot
Successfully produced net in file /tmp/petri1013_18237599991290202186.dot
Successfully produced net in file /tmp/petri1014_6367516807778611170.dot
Successfully produced net in file /tmp/petri1015_12789257878366190794.dot
Successfully produced net in file /tmp/petri1016_6665812985011222408.dot
Successfully produced net in file /tmp/petri1017_6354383397654676895.dot
Successfully produced net in file /tmp/petri1018_13946713825590671123.dot
Successfully produced net in file /tmp/petri1019_9925604850308052941.dot
Successfully produced net in file /tmp/petri1020_10601202574953515987.dot
Successfully produced net in file /tmp/petri1021_15314971177315254122.dot
Successfully produced net in file /tmp/petri1022_14265492494616055175.dot
Successfully produced net in file /tmp/petri1023_5887002471565010107.dot
Successfully produced net in file /tmp/petri1024_12959440215149052388.dot
Successfully produced net in file /tmp/petri1025_17052488695484584379.dot
Successfully produced net in file /tmp/petri1026_13904230246835569983.dot
Successfully produced net in file /tmp/petri1027_8326867849447188916.dot
Successfully produced net in file /tmp/petri1028_5482106753858249588.dot
Successfully produced net in file /tmp/petri1029_18404409082272699306.dot
Successfully produced net in file /tmp/petri1030_2529799833945357073.dot
Successfully produced net in file /tmp/petri1031_13187623290431828403.dot
Successfully produced net in file /tmp/petri1032_8576101046052670529.dot
Successfully produced net in file /tmp/petri1033_13883361555664432380.dot
Successfully produced net in file /tmp/petri1034_1903591291834120888.dot
Successfully produced net in file /tmp/petri1035_13747798494617936234.dot
Drop transitions removed 36 transitions
Dominated transitions for bounds rules discarded 36 transitions
Normalized transition count is 148 out of 184 initially.
// Phase 1: matrix 148 rows 38 cols
[2024-06-02 21:01:12] [INFO ] Computed 11 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 255409 resets, run finished after 4295 ms. (steps per millisecond=232 ) properties (out of 2) seen :2
FORMULA MedleyA-PT-09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 10518 ms.

BK_STOP 1717362077669

--------------------
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="MedleyA-PT-09"
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 MedleyA-PT-09, 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 r597-smll-171734926400041"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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