fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r298-tall-167873951300109
Last Updated
May 14, 2023

About the Execution of Marcie+red for Philosophers-COL-000050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
257.855 5120.00 9340.00 306.50 50 50 50 50 50 25 50 50 50 50 50 50 50 25 25 50 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r298-tall-167873951300109.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is Philosophers-COL-000050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873951300109
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 7.9K Feb 25 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 13:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 13:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 13:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 25 13:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 120K Feb 25 13:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 12K Mar 5 18:23 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 Philosophers-COL-000050-UpperBounds-00
FORMULA_NAME Philosophers-COL-000050-UpperBounds-01
FORMULA_NAME Philosophers-COL-000050-UpperBounds-02
FORMULA_NAME Philosophers-COL-000050-UpperBounds-03
FORMULA_NAME Philosophers-COL-000050-UpperBounds-04
FORMULA_NAME Philosophers-COL-000050-UpperBounds-05
FORMULA_NAME Philosophers-COL-000050-UpperBounds-06
FORMULA_NAME Philosophers-COL-000050-UpperBounds-07
FORMULA_NAME Philosophers-COL-000050-UpperBounds-08
FORMULA_NAME Philosophers-COL-000050-UpperBounds-09
FORMULA_NAME Philosophers-COL-000050-UpperBounds-10
FORMULA_NAME Philosophers-COL-000050-UpperBounds-11
FORMULA_NAME Philosophers-COL-000050-UpperBounds-12
FORMULA_NAME Philosophers-COL-000050-UpperBounds-13
FORMULA_NAME Philosophers-COL-000050-UpperBounds-14
FORMULA_NAME Philosophers-COL-000050-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679451632005

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-000050
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 02:20:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 02:20:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 02:20:33] [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.
[2023-03-22 02:20:33] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 02:20:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 371 ms
[2023-03-22 02:20:33] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 250 PT places and 250.0 transition bindings in 200 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-22 02:20:34] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 3 ms.
[2023-03-22 02:20:34] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 5 cols
[2023-03-22 02:20:34] [INFO ] Computed 2 place invariants in 3 ms
FORMULA Philosophers-COL-000050-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000050-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000050-UpperBounds-09 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000050-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000050-UpperBounds-06 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000050-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000050-UpperBounds-01 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-22 02:20:34] [INFO ] Invariant cache hit.
[2023-03-22 02:20:34] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-22 02:20:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:20:34] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 02:20:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:20:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 02:20:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:20:34] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-22 02:20:34] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 02:20:34] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 02:20:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 02:20:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:20:34] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-22 02:20:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:20:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 02:20:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:20:34] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 02:20:34] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 02:20:34] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 02:20:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 02:20:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:20:34] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-22 02:20:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:20:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 02:20:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:20:34] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 02:20:34] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 02:20:34] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 02:20:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 02:20:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:20:34] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-22 02:20:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:20:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 02:20:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:20:34] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 02:20:34] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 02:20:34] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2023-03-22 02:20:34] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-22 02:20:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:20:34] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-22 02:20:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:20:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 02:20:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:20:34] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-22 02:20:34] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 02:20:34] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
[2023-03-22 02:20:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 02:20:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:20:34] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 02:20:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:20:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 02:20:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:20:34] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 02:20:34] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 02:20:34] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2023-03-22 02:20:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 02:20:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:20:34] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-22 02:20:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:20:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-22 02:20:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:20:34] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 02:20:34] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 02:20:34] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 2 ms.
[2023-03-22 02:20:34] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-22 02:20:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:20:34] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 02:20:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:20:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 02:20:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:20:34] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 02:20:34] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 02:20:34] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2023-03-22 02:20:34] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-22 02:20:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:20:34] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 02:20:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:20:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 02:20:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:20:34] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 02:20:34] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 02:20:34] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : [50, 50, 50, 25, 50, 50, 25, 25, 50]
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 50) 50) 50)]] contains successor/predecessor on variables of sort Philo
[2023-03-22 02:20:34] [INFO ] Unfolded HLPN to a Petri net with 250 places and 250 transitions 800 arcs in 21 ms.
[2023-03-22 02:20:34] [INFO ] Unfolded 9 HLPN properties in 1 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 9) seen :328
FORMULA Philosophers-COL-000050-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :250
FORMULA Philosophers-COL-000050-UpperBounds-10 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-COL-000050-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-COL-000050-UpperBounds-03 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-COL-000050-UpperBounds-02 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-COL-000050-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :54
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :57
// Phase 1: matrix 250 rows 250 cols
[2023-03-22 02:20:34] [INFO ] Computed 100 place invariants in 12 ms
[2023-03-22 02:20:34] [INFO ] [Real]Absence check using 100 positive place invariants in 23 ms returned sat
[2023-03-22 02:20:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:20:34] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-22 02:20:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:20:35] [INFO ] [Nat]Absence check using 100 positive place invariants in 22 ms returned sat
[2023-03-22 02:20:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:20:35] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-22 02:20:35] [INFO ] Computed and/alt/rep : 150/200/150 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-22 02:20:35] [INFO ] Added : 20 causal constraints over 4 iterations in 94 ms. Result :sat
Minimization took 31 ms.
[2023-03-22 02:20:35] [INFO ] [Real]Absence check using 100 positive place invariants in 14 ms returned sat
[2023-03-22 02:20:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:20:35] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-22 02:20:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:20:35] [INFO ] [Nat]Absence check using 100 positive place invariants in 14 ms returned sat
[2023-03-22 02:20:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:20:35] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-22 02:20:35] [INFO ] Computed and/alt/rep : 150/200/150 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-22 02:20:35] [INFO ] Added : 20 causal constraints over 4 iterations in 87 ms. Result :sat
Minimization took 31 ms.
[2023-03-22 02:20:35] [INFO ] [Real]Absence check using 100 positive place invariants in 12 ms returned sat
[2023-03-22 02:20:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:20:35] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2023-03-22 02:20:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:20:35] [INFO ] [Nat]Absence check using 100 positive place invariants in 12 ms returned sat
[2023-03-22 02:20:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:20:35] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-22 02:20:35] [INFO ] Computed and/alt/rep : 150/200/150 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-22 02:20:35] [INFO ] Added : 20 causal constraints over 4 iterations in 79 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [25, 25, 25] Max seen :[19, 19, 19]
FORMULA Philosophers-COL-000050-UpperBounds-14 25 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000050-UpperBounds-13 25 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000050-UpperBounds-05 25 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 2836 ms.
ITS solved all properties within timeout

BK_STOP 1679451637125

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="Philosophers-COL-000050"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is Philosophers-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 r298-tall-167873951300109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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