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.r127-smll-177955743800039.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 EnergyBus-PT-none, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r127-smll-177955743800039
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 8.1K Mar 7 04:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 7 04:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 7 04:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 7 04:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Mar 17 09:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 17 09:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 17 09:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 17 09:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 04:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Mar 7 04:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Mar 7 04:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Mar 7 04:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 17 09:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 17 09:02 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 3.2M 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 EnergyBus-PT-none-UpperBounds-00
FORMULA_NAME EnergyBus-PT-none-UpperBounds-01
FORMULA_NAME EnergyBus-PT-none-UpperBounds-02
FORMULA_NAME EnergyBus-PT-none-UpperBounds-03
FORMULA_NAME EnergyBus-PT-none-UpperBounds-04
FORMULA_NAME EnergyBus-PT-none-UpperBounds-05
FORMULA_NAME EnergyBus-PT-none-UpperBounds-06
FORMULA_NAME EnergyBus-PT-none-UpperBounds-07
FORMULA_NAME EnergyBus-PT-none-UpperBounds-08
FORMULA_NAME EnergyBus-PT-none-UpperBounds-09
FORMULA_NAME EnergyBus-PT-none-UpperBounds-10
FORMULA_NAME EnergyBus-PT-none-UpperBounds-11
FORMULA_NAME EnergyBus-PT-none-UpperBounds-12
FORMULA_NAME EnergyBus-PT-none-UpperBounds-13
FORMULA_NAME EnergyBus-PT-none-UpperBounds-14
FORMULA_NAME EnergyBus-PT-none-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779571016579

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EnergyBus-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 21:16:58] [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-23 21:16:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 21:16:59] [INFO ] Load time of PNML (sax parser for PT used): 533 ms
[2026-05-23 21:16:59] [INFO ] Transformed 157 places.
[2026-05-23 21:16:59] [INFO ] Transformed 4430 transitions.
[2026-05-23 21:16:59] [INFO ] Found NUPN structural information;
[2026-05-23 21:16:59] [INFO ] Parsed PT model containing 157 places and 4430 transitions and 63389 arcs in 770 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Deduced a syphon composed of 4 places in 26 ms
Reduce places removed 4 places and 825 transitions.
Ensure Unique test removed 1692 transitions
Reduce redundant transitions removed 1692 transitions.
FORMULA EnergyBus-PT-none-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 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]
FORMULA EnergyBus-PT-none-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[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]
[2026-05-23 21:16:59] [INFO ] Flow matrix only has 647 transitions (discarded 1266 similar events)
// Phase 1: matrix 647 rows 153 cols
[2026-05-23 21:16:59] [INFO ] Computed 23 invariants in 41 ms
Current structural bounds on expressions (after invariants) : Max Seen:[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]
RANDOM walk for 10000 steps (2 resets) in 283 ms. (35 steps per ms)
FORMULA EnergyBus-PT-none-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (6 resets) in 220 ms. (135 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-23 21:17:00] [INFO ] Flow matrix only has 647 transitions (discarded 1266 similar events)
[2026-05-23 21:17:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 21:17:00] [INFO ] [Real]Absence check using 21 positive place invariants in 21 ms returned sat
[2026-05-23 21:17:00] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 21:17:00] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2026-05-23 21:17:00] [INFO ] State equation strengthened by 463 read => feed constraints.
[2026-05-23 21:17:01] [INFO ] [Real]Added 463 Read/Feed constraints in 175 ms returned sat
[2026-05-23 21:17:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 21:17:01] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned sat
[2026-05-23 21:17:01] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 10 ms returned sat
[2026-05-23 21:17:01] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2026-05-23 21:17:01] [INFO ] [Nat]Added 463 Read/Feed constraints in 179 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 21:17:02] [INFO ] Deduced a trap composed of 7 places in 516 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 21:17:02] [INFO ] Deduced a trap composed of 22 places in 390 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 21:17:03] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 4 ms to minimize.
[2026-05-23 21:17:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1481 ms
[2026-05-23 21:17:03] [INFO ] Computed and/alt/rep : 161/446/160 causal constraints (skipped 486 transitions) in 216 ms.
[2026-05-23 21:17:05] [INFO ] Added : 133 causal constraints over 27 iterations in 2184 ms. Result :sat
Minimization took 594 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 21:17:06] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned sat
[2026-05-23 21:17:06] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 21:17:06] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2026-05-23 21:17:06] [INFO ] [Real]Added 463 Read/Feed constraints in 112 ms returned sat
[2026-05-23 21:17:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 21:17:06] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2026-05-23 21:17:06] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-23 21:17:06] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2026-05-23 21:17:06] [INFO ] [Nat]Added 463 Read/Feed constraints in 104 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 21:17:07] [INFO ] Deduced a trap composed of 7 places in 740 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 21:17:08] [INFO ] Deduced a trap composed of 10 places in 681 ms of which 12 ms to minimize.
[2026-05-23 21:17:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1663 ms
[2026-05-23 21:17:09] [INFO ] Computed and/alt/rep : 161/446/160 causal constraints (skipped 486 transitions) in 490 ms.
[2026-05-23 21:17:11] [INFO ] Added : 102 causal constraints over 22 iterations in 2895 ms. Result :sat
Minimization took 52 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 21:17:11] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned sat
[2026-05-23 21:17:11] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 21:17:11] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2026-05-23 21:17:12] [INFO ] [Real]Added 463 Read/Feed constraints in 108 ms returned sat
[2026-05-23 21:17:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 21:17:12] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2026-05-23 21:17:12] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 21:17:12] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2026-05-23 21:17:12] [INFO ] [Nat]Added 463 Read/Feed constraints in 112 ms returned sat
[2026-05-23 21:17:12] [INFO ] Computed and/alt/rep : 161/446/160 causal constraints (skipped 486 transitions) in 90 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 21:17:14] [INFO ] Deduced a trap composed of 7 places in 232 ms of which 7 ms to minimize.
[2026-05-23 21:17:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 487 ms
[2026-05-23 21:17:15] [INFO ] Added : 42 causal constraints over 9 iterations in 2617 ms. Result :sat
Minimization took 530 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 1913/1913 transitions.
Graph (trivial) has 134 edges and 153 vertex of which 17 / 153 are part of one of the 6 SCC in 4 ms
Free SCC test removed 11 places
Drop transitions (Empty/Sink Transition effects.) removed 29 transitions
Ensure Unique test removed 1038 transitions
Reduce isomorphic transitions removed 1067 transitions.
Graph (complete) has 751 edges and 142 vertex of which 138 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.15 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 138 transition count 838
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 135 transition count 834
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 134 transition count 834
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 15 place count 134 transition count 825
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 33 place count 125 transition count 825
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 55 place count 103 transition count 544
Iterating global reduction 3 with 22 rules applied. Total rules applied 77 place count 103 transition count 544
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 107 place count 103 transition count 514
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 121 place count 96 transition count 507
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 148 place count 96 transition count 480
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 149 place count 95 transition count 478
Iterating global reduction 5 with 1 rules applied. Total rules applied 150 place count 95 transition count 478
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 166 place count 87 transition count 503
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 174 place count 87 transition count 495
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 6 with 40 rules applied. Total rules applied 214 place count 87 transition count 455
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 214 place count 87 transition count 450
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 228 place count 78 transition count 450
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 242 place count 71 transition count 443
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 22 edges and 71 vertex of which 2 / 71 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 6 with 2 rules applied. Total rules applied 244 place count 70 transition count 442
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 180 transitions
Reduce isomorphic transitions removed 182 transitions.
Iterating post reduction 7 with 182 rules applied. Total rules applied 426 place count 70 transition count 260
Ensure Unique test removed 1 places
Iterating post reduction 8 with 1 rules applied. Total rules applied 427 place count 69 transition count 260
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 9 with 15 rules applied. Total rules applied 442 place count 69 transition count 245
Free-agglomeration rule applied 10 times.
Iterating global reduction 9 with 10 rules applied. Total rules applied 452 place count 69 transition count 235
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 462 place count 59 transition count 235
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 468 place count 59 transition count 229
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 469 place count 59 transition count 229
Applied a total of 469 rules in 425 ms. Remains 59 /153 variables (removed 94) and now considering 229/1913 (removed 1684) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 439 ms. Remains : 59/153 places, 229/1913 transitions.
[2026-05-23 21:17:16] [INFO ] Flow matrix only has 136 transitions (discarded 93 similar events)
// Phase 1: matrix 136 rows 59 cols
[2026-05-23 21:17:16] [INFO ] Computed 17 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1638 ms. (610 steps per ms)
FORMULA EnergyBus-PT-none-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000000 steps (4 resets) in 1495 ms. (1336 steps per ms)
FORMULA EnergyBus-PT-none-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
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-23 21:17:19] [INFO ] Flatten gal took : 93 ms
[2026-05-23 21:17:19] [INFO ] Flatten gal took : 38 ms
[2026-05-23 21:17:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3962906253137932596.gal : 29 ms
[2026-05-23 21:17:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality975656876329833165.prop : 1 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/ReachabilityCardinality3962906253137932596.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality975656876329833165.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 21144 ms.

BK_STOP 1779571039793

--------------------
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="EnergyBus-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 EnergyBus-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 r127-smll-177955743800039"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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