Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r207-tall-177969919700001.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool gold2025
Input is MultiwaySync-PT-none, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r207-tall-177969919700001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.8K Mar 7 18:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 7 18:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 7 18:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 7 18:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 11:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 11:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Mar 7 18:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 7 18:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 7 18:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Mar 7 18:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 11:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 111K Mar 3 18:30 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

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

=== Now, execution of the tool begins

BK_START 1779719110940

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiwaySync-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-25 14:25:12] [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]
[2026-05-25 14:25:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 14:25:12] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2026-05-25 14:25:12] [INFO ] Transformed 222 places.
[2026-05-25 14:25:12] [INFO ] Transformed 472 transitions.
[2026-05-25 14:25:12] [INFO ] Found NUPN structural information;
[2026-05-25 14:25:12] [INFO ] Parsed PT model containing 222 places and 472 transitions and 1496 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 83 transitions
Reduce redundant transitions removed 83 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-25 14:25:12] [INFO ] Flow matrix only has 384 transitions (discarded 5 similar events)
// Phase 1: matrix 384 rows 222 cols
[2026-05-25 14:25:12] [INFO ] Computed 25 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 80 ms. (123 steps per ms)
FORMULA MultiwaySync-PT-none-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiwaySync-PT-none-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiwaySync-PT-none-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiwaySync-PT-none-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiwaySync-PT-none-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiwaySync-PT-none-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiwaySync-PT-none-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiwaySync-PT-none-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiwaySync-PT-none-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiwaySync-PT-none-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiwaySync-PT-none-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiwaySync-PT-none-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiwaySync-PT-none-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (6 resets) in 53 ms. (555 steps per ms)
FORMULA MultiwaySync-PT-none-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-25 14:25:12] [INFO ] Flow matrix only has 384 transitions (discarded 5 similar events)
[2026-05-25 14:25:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:25:13] [INFO ] [Real]Absence check using 25 positive place invariants in 17 ms returned sat
[2026-05-25 14:25:13] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2026-05-25 14:25:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 14:25:13] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2026-05-25 14:25:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:25:13] [INFO ] [Nat]Absence check using 25 positive place invariants in 15 ms returned sat
[2026-05-25 14:25:13] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2026-05-25 14:25:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 23 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:25:13] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:25:13] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:25:13] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:25:13] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 5 ms to minimize.
[2026-05-25 14:25:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 518 ms
[2026-05-25 14:25:14] [INFO ] Computed and/alt/rep : 364/1019/364 causal constraints (skipped 19 transitions) in 44 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:25:14] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
[2026-05-25 14:25:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2026-05-25 14:25:14] [INFO ] Added : 119 causal constraints over 25 iterations in 822 ms. Result :sat
Minimization took 110 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:25:15] [INFO ] [Real]Absence check using 25 positive place invariants in 7 ms returned sat
[2026-05-25 14:25:15] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2026-05-25 14:25:15] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 14:25:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:25:15] [INFO ] [Nat]Absence check using 25 positive place invariants in 8 ms returned sat
[2026-05-25 14:25:15] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2026-05-25 14:25:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:25:15] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:25:15] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:25:15] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:25:15] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 3 ms to minimize.
[2026-05-25 14:25:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 337 ms
[2026-05-25 14:25:15] [INFO ] Computed and/alt/rep : 364/1019/364 causal constraints (skipped 19 transitions) in 23 ms.
[2026-05-25 14:25:16] [INFO ] Added : 109 causal constraints over 23 iterations in 592 ms. Result :sat
Minimization took 105 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
FORMULA MultiwaySync-PT-none-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 222 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p82) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 388/388 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 222 transition count 386
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 220 transition count 386
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 629 edges and 220 vertex of which 43 are kept as prefixes of interest. Removing 177 places using SCC suffix rule.1 ms
Discarding 177 places :
Also discarding 177 output transitions
Drop transitions (Output transitions of discarded places.) removed 177 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 8 rules applied. Total rules applied 12 place count 43 transition count 202
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 1 with 124 rules applied. Total rules applied 136 place count 42 transition count 79
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 140 place count 38 transition count 75
Iterating global reduction 2 with 4 rules applied. Total rules applied 144 place count 38 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 145 place count 38 transition count 74
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 148 place count 35 transition count 65
Iterating global reduction 3 with 3 rules applied. Total rules applied 151 place count 35 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 152 place count 35 transition count 64
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 156 place count 33 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 165 place count 33 transition count 53
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 165 place count 33 transition count 52
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 167 place count 32 transition count 52
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 168 place count 31 transition count 51
Iterating global reduction 4 with 1 rules applied. Total rules applied 169 place count 31 transition count 51
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 169 place count 31 transition count 50
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 171 place count 30 transition count 50
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 172 place count 30 transition count 49
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 178 place count 27 transition count 46
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 180 place count 27 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 184 place count 25 transition count 42
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 185 place count 24 transition count 35
Iterating global reduction 6 with 1 rules applied. Total rules applied 186 place count 24 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 187 place count 24 transition count 34
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 188 place count 24 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 189 place count 23 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 190 place count 22 transition count 32
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 9 edges and 21 vertex of which 4 / 21 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 193 place count 18 transition count 31
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 200 place count 17 transition count 25
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 201 place count 16 transition count 18
Iterating global reduction 9 with 1 rules applied. Total rules applied 202 place count 16 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 203 place count 16 transition count 17
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 204 place count 16 transition count 16
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 15 edges and 14 vertex of which 12 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 11 places
Iterating post reduction 10 with 3 rules applied. Total rules applied 207 place count 3 transition count 16
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 11 with 14 rules applied. Total rules applied 221 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 221 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 223 place count 2 transition count 1
Applied a total of 223 rules in 79 ms. Remains 2 /222 variables (removed 220) and now considering 1/388 (removed 387) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 2/222 places, 1/388 transitions.
// Phase 1: matrix 1 rows 2 cols
[2026-05-25 14:25:16] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (500000 resets) in 269 ms. (3703 steps per ms)
FORMULA MultiwaySync-PT-none-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (500000 resets) in 257 ms. (3875 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2026-05-25 14:25:17] [INFO ] Flatten gal took : 122 ms
[2026-05-25 14:25:17] [INFO ] Flatten gal took : 1 ms
[2026-05-25 14:25:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3251173899216034963.gal : 2 ms
[2026-05-25 14:25:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16869920229885578257.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3251173899216034963.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16869920229885578257.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

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

BK_STOP 1779719117516

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="MultiwaySync-PT-none"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is MultiwaySync-PT-none, 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 r207-tall-177969919700001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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