fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r153-tall-174876824800070
Last Updated
June 24, 2025

About the Execution of 2024-gold for Peterson-COL-3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15688.690 7581.00 13799.00 100.20 4 4 4 4 4 4 3 4 4 4 4 4 3 4 3 4 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r153-tall-174876824800070.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is Peterson-COL-3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-174876824800070
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 114K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 43K May 29 14:32 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 Peterson-COL-3-UpperBounds-00
FORMULA_NAME Peterson-COL-3-UpperBounds-01
FORMULA_NAME Peterson-COL-3-UpperBounds-02
FORMULA_NAME Peterson-COL-3-UpperBounds-03
FORMULA_NAME Peterson-COL-3-UpperBounds-04
FORMULA_NAME Peterson-COL-3-UpperBounds-05
FORMULA_NAME Peterson-COL-3-UpperBounds-06
FORMULA_NAME Peterson-COL-3-UpperBounds-07
FORMULA_NAME Peterson-COL-3-UpperBounds-08
FORMULA_NAME Peterson-COL-3-UpperBounds-09
FORMULA_NAME Peterson-COL-3-UpperBounds-10
FORMULA_NAME Peterson-COL-3-UpperBounds-11
FORMULA_NAME Peterson-COL-3-UpperBounds-12
FORMULA_NAME Peterson-COL-3-UpperBounds-13
FORMULA_NAME Peterson-COL-3-UpperBounds-14
FORMULA_NAME Peterson-COL-3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748841529047

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-02 05:18:50] [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]
[2025-06-02 05:18:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:18:50] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 05:18:50] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 05:18:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 576 ms
[2025-06-02 05:18:51] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 256 PT places and 396.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Reduction of identical properties reduced properties to check from 16 to 8
[2025-06-02 05:18:51] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 3 ms.
[2025-06-02 05:18:51] [INFO ] Skeletonized 8 HLPN properties in 0 ms.
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2025-06-02 05:18:51] [INFO ] Computed 1 invariants in 3 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 4, 3, 0, 0] Max Struct:[4, 4, 4, 4, 4, 3, 4, 4]
FORMULA Peterson-COL-3-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-3-UpperBounds-14 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-3-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-3-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 05:18:51] [INFO ] Invariant cache hit.
[2025-06-02 05:18:51] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-02 05:18:51] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-02 05:18:51] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 05:18:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:51] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-02 05:18:51] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:18:51] [INFO ] Added : 11 causal constraints over 3 iterations in 15 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 05:18:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:51] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:18:51] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:18:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:51] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:18:51] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 05:18:51] [INFO ] Added : 11 causal constraints over 5 iterations in 21 ms. Result :sat
Minimization took 4 ms.
[2025-06-02 05:18:51] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:18:51] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:18:51] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:18:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:51] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:18:51] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:18:51] [INFO ] Added : 11 causal constraints over 4 iterations in 27 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 05:18:51] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-02 05:18:51] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-02 05:18:51] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:18:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:51] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:18:51] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:18:51] [INFO ] Added : 11 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 05:18:51] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:18:51] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:18:51] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:18:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:18:51] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-02 05:18:51] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:18:51] [INFO ] Added : 11 causal constraints over 5 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2025-06-02 05:18:51] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:18:51] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:18:51] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:18:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:51] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:18:51] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:18:51] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 4, 4, 4]
Domain [Process(4), Tour(3), Process(4)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 3)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2025-06-02 05:18:51] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions 1112 arcs in 29 ms.
[2025-06-02 05:18:51] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 24 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 4, 4, 4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 4, 4, 4]
[2025-06-02 05:18:51] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2025-06-02 05:18:51] [INFO ] Computed 15 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 4, 4, 4]
RANDOM walk for 10000 steps (2 resets) in 56 ms. (175 steps per ms)
FORMULA Peterson-COL-3-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-3-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-3-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-3-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-3-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-3-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-3-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-3-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (4 resets) in 26 ms. (740 steps per ms)
FORMULA Peterson-COL-3-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2025-06-02 05:18:51] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-02 05:18:51] [INFO ] Invariant cache hit.
[2025-06-02 05:18:52] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-06-02 05:18:52] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:18:52] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2025-06-02 05:18:52] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-02 05:18:52] [INFO ] [Real]Added 57 Read/Feed constraints in 13 ms returned sat
[2025-06-02 05:18:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-06-02 05:18:52] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-02 05:18:52] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2025-06-02 05:18:52] [INFO ] [Nat]Added 57 Read/Feed constraints in 14 ms returned sat
[2025-06-02 05:18:52] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 21 ms.
[2025-06-02 05:18:53] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 20 ms to minimize.
[2025-06-02 05:18:53] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2025-06-02 05:18:53] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 2 ms to minimize.
[2025-06-02 05:18:53] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 2 ms to minimize.
[2025-06-02 05:18:53] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2025-06-02 05:18:53] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2025-06-02 05:18:53] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 700 ms
[2025-06-02 05:18:53] [INFO ] Added : 150 causal constraints over 30 iterations in 1436 ms. Result :sat
Minimization took 88 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 48 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 244 transition count 296
Reduce places removed 36 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 1 with 72 rules applied. Total rules applied 108 place count 208 transition count 260
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 144 place count 172 transition count 260
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 144 place count 172 transition count 236
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 192 place count 148 transition count 236
Applied a total of 192 rules in 41 ms. Remains 148 /244 variables (removed 96) and now considering 236/332 (removed 96) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 148/244 places, 236/332 transitions.
[2025-06-02 05:18:54] [INFO ] Flow matrix only has 212 transitions (discarded 24 similar events)
// Phase 1: matrix 212 rows 148 cols
[2025-06-02 05:18:54] [INFO ] Computed 15 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (2 resets) in 1552 ms. (643 steps per ms)
FORMULA Peterson-COL-3-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-3-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-3-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 778 ms. (1283 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 )
[2025-06-02 05:18:56] [INFO ] Flatten gal took : 39 ms
[2025-06-02 05:18:56] [INFO ] Flatten gal took : 20 ms
[2025-06-02 05:18:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13453957255805548450.gal : 11 ms
[2025-06-02 05:18:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4779338964728389658.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13453957255805548450.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4779338964728389658.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
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 6285 ms.

BK_STOP 1748841536628

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="Peterson-COL-3"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is Peterson-COL-3, 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 r153-tall-174876824800070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-3.tgz
mv Peterson-COL-3 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 ;