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.r351-tall-171679102400451.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 SharedMemory-COL-000050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-tall-171679102400451
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.5K Apr 12 18:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 12 18:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 12 18:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 12 18:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 21:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 177K Apr 12 21:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 20:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 12 20:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14K May 18 16:43 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 SharedMemory-COL-000050-UpperBounds-00
FORMULA_NAME SharedMemory-COL-000050-UpperBounds-01
FORMULA_NAME SharedMemory-COL-000050-UpperBounds-02
FORMULA_NAME SharedMemory-COL-000050-UpperBounds-03
FORMULA_NAME SharedMemory-COL-000050-UpperBounds-04
FORMULA_NAME SharedMemory-COL-000050-UpperBounds-05
FORMULA_NAME SharedMemory-COL-000050-UpperBounds-06
FORMULA_NAME SharedMemory-COL-000050-UpperBounds-07
FORMULA_NAME SharedMemory-COL-000050-UpperBounds-08
FORMULA_NAME SharedMemory-COL-000050-UpperBounds-09
FORMULA_NAME SharedMemory-COL-000050-UpperBounds-10
FORMULA_NAME SharedMemory-COL-000050-UpperBounds-11
FORMULA_NAME SharedMemory-COL-000050-UpperBounds-12
FORMULA_NAME SharedMemory-COL-000050-UpperBounds-13
FORMULA_NAME SharedMemory-COL-000050-UpperBounds-14
FORMULA_NAME SharedMemory-COL-000050-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716900055866

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=SharedMemory-COL-000050
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-28 12:40:57] [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-05-28 12:40:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 12:40:57] [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.
[2024-05-28 12:40:57] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 12:40:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 406 ms
[2024-05-28 12:40:58] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 2701 PT places and 7600.0 transition bindings in 134 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
[2024-05-28 12:40:58] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 16 arcs in 4 ms.
[2024-05-28 12:40:58] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 6 cols
[2024-05-28 12:40:58] [INFO ] Computed 3 invariants in 6 ms
FORMULA SharedMemory-COL-000050-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-000050-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-000050-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-000050-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-000050-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-000050-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-000050-UpperBounds-03 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-000050-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-28 12:40:58] [INFO ] Invariant cache hit.
[2024-05-28 12:40:58] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 12:40:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 12:40:58] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-28 12:40:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:40:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 12:40:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 12:40:58] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-28 12:40:58] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 12:40:58] [INFO ] Added : 1 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 4 ms.
[2024-05-28 12:40:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 12:40:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 12:40:58] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-28 12:40:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:40:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 12:40:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 12:40:58] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-28 12:40:58] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 12:40:58] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 3 ms.
[2024-05-28 12:40:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 12:40:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 12:40:58] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-28 12:40:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:40:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-28 12:40:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 12:40:58] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-28 12:40:58] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-28 12:40:58] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 2 ms.
[2024-05-28 12:40:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 12:40:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 12:40:58] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-28 12:40:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:40:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 12:40:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 12:40:58] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-28 12:40:58] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 12:40:58] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 2 ms.
[2024-05-28 12:40:58] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-28 12:40:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 12:40:58] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-28 12:40:58] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 12:40:58] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 1 ms.
[2024-05-28 12:40:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 12:40:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 12:40:58] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-28 12:40:58] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 12:40:58] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2024-05-28 12:40:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 12:40:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 12:40:58] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-28 12:40:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:40:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 12:40:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 12:40:58] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-28 12:40:58] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-28 12:40:58] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
[2024-05-28 12:40:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 12:40:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 12:40:58] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-28 12:40:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:40:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 12:40:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 12:40:58] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-28 12:40:58] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 12:40:58] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [1, 50, 1, 1, 50, 50, 50, 1]
Domain [P(50), P(50)] of place Ext_Mem_Acc breaks symmetries in sort P
[2024-05-28 12:40:58] [INFO ] Unfolded HLPN to a Petri net with 2701 places and 5100 transitions 20200 arcs in 75 ms.
[2024-05-28 12:40:58] [INFO ] Unfolded 8 HLPN properties in 2 ms.
Deduced a syphon composed of 50 places in 12 ms
Reduce places removed 50 places and 50 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5757 ms. (steps per millisecond=1 ) properties (out of 8) seen :144
FORMULA SharedMemory-COL-000050-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-COL-000050-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-COL-000050-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-COL-000050-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :84
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :84
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :22
// Phase 1: matrix 5050 rows 2651 cols
[2024-05-28 12:41:04] [INFO ] Computed 101 invariants in 263 ms
[2024-05-28 12:41:05] [INFO ] [Real]Absence check using 101 positive place invariants in 129 ms returned sat
[2024-05-28 12:41:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 12:41:06] [INFO ] [Real]Absence check using state equation in 1457 ms returned sat
[2024-05-28 12:41:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:41:07] [INFO ] [Nat]Absence check using 101 positive place invariants in 94 ms returned sat
[2024-05-28 12:41:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 12:41:08] [INFO ] [Nat]Absence check using state equation in 1399 ms returned sat
[2024-05-28 12:41:09] [INFO ] Computed and/alt/rep : 4950/4950/4950 causal constraints (skipped 0 transitions) in 281 ms.
[2024-05-28 12:41:09] [INFO ] Added : 0 causal constraints over 0 iterations in 638 ms. Result :sat
[2024-05-28 12:41:10] [INFO ] [Real]Absence check using 101 positive place invariants in 100 ms returned sat
[2024-05-28 12:41:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 12:41:11] [INFO ] [Real]Absence check using state equation in 1391 ms returned sat
[2024-05-28 12:41:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:41:11] [INFO ] [Nat]Absence check using 101 positive place invariants in 102 ms returned sat
[2024-05-28 12:41:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 12:41:13] [INFO ] [Nat]Absence check using state equation in 1363 ms returned sat
[2024-05-28 12:41:13] [INFO ] Computed and/alt/rep : 4950/4950/4950 causal constraints (skipped 0 transitions) in 280 ms.
[2024-05-28 12:41:14] [INFO ] Added : 1 causal constraints over 1 iterations in 744 ms. Result :sat
[2024-05-28 12:41:14] [INFO ] [Real]Absence check using 101 positive place invariants in 86 ms returned sat
[2024-05-28 12:41:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 12:41:16] [INFO ] [Real]Absence check using state equation in 1377 ms returned sat
[2024-05-28 12:41:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:41:16] [INFO ] [Nat]Absence check using 101 positive place invariants in 89 ms returned sat
[2024-05-28 12:41:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 12:41:17] [INFO ] [Nat]Absence check using state equation in 1355 ms returned sat
[2024-05-28 12:41:18] [INFO ] Computed and/alt/rep : 4950/4950/4950 causal constraints (skipped 0 transitions) in 225 ms.
[2024-05-28 12:41:18] [INFO ] Added : 1 causal constraints over 1 iterations in 669 ms. Result :sat
[2024-05-28 12:41:19] [INFO ] [Real]Absence check using 101 positive place invariants in 90 ms returned sat
[2024-05-28 12:41:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 12:41:20] [INFO ] [Real]Absence check using state equation in 1355 ms returned sat
[2024-05-28 12:41:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:41:20] [INFO ] [Nat]Absence check using 101 positive place invariants in 102 ms returned sat
[2024-05-28 12:41:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 12:41:22] [INFO ] [Nat]Absence check using state equation in 1402 ms returned sat
[2024-05-28 12:41:22] [INFO ] Computed and/alt/rep : 4950/4950/4950 causal constraints (skipped 0 transitions) in 226 ms.
[2024-05-28 12:41:22] [INFO ] Added : 0 causal constraints over 0 iterations in 524 ms. Result :sat
Current structural bounds on expressions (after SMT) : [50, 50, 50, 50] Max seen :[49, 42, 42, 49]
FORMULA SharedMemory-COL-000050-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA SharedMemory-COL-000050-UpperBounds-01 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 50 out of 2651 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Drop transitions removed 2450 transitions
Trivial Post-agglo rules discarded 2450 transitions
Performed 2450 trivial Post agglomeration. Transition count delta: 2450
Iterating post reduction 0 with 2450 rules applied. Total rules applied 2450 place count 2651 transition count 2600
Reduce places removed 2501 places and 0 transitions.
Ensure Unique test removed 2400 transitions
Reduce isomorphic transitions removed 2400 transitions.
Graph (trivial) has 100 edges and 150 vertex of which 100 / 150 are part of one of the 50 SCC in 3 ms
Free SCC test removed 50 places
Iterating post reduction 1 with 4902 rules applied. Total rules applied 7352 place count 100 transition count 200
Drop transitions removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 7452 place count 100 transition count 100
Applied a total of 7452 rules in 108 ms. Remains 100 /2651 variables (removed 2551) and now considering 100/5050 (removed 4950) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 100/2651 places, 100/5050 transitions.
// Phase 1: matrix 100 rows 100 cols
[2024-05-28 12:41:23] [INFO ] Computed 50 invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5507 ms. (steps per millisecond=181 ) properties (out of 2) seen :82
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1454 ms. (steps per millisecond=687 ) properties (out of 2) seen :100
FORMULA SharedMemory-COL-000050-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SharedMemory-COL-000050-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 33035 ms.

BK_STOP 1716900091132

--------------------
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="SharedMemory-COL-000050"
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 SharedMemory-COL-000050, 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 r351-tall-171679102400451"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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