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.r268-smll-171654407300264.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 itstools
Input is Peterson-PT-3, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654407300264
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 27K Apr 12 02:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 12 02:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 12 02:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 134K Apr 12 02:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 108K Apr 12 02:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 511K Apr 12 02:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 71K Apr 12 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 344K Apr 12 02:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.5K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 143K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

no data necessary for post analysis


=== Now, execution of the tool begins

BK_START 1716762953957

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-26 22:35:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StateSpace, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 22:35:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 22:35:56] [INFO ] Load time of PNML (sax parser for PT used): 280 ms
[2024-05-26 22:35:56] [INFO ] Transformed 244 places.
[2024-05-26 22:35:56] [INFO ] Transformed 332 transitions.
[2024-05-26 22:35:56] [INFO ] Found NUPN structural information;
[2024-05-26 22:35:56] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 492 ms.
Starting structural reductions in STATESPACE mode, iteration 0 : 244/244 places, 332/332 transitions.
[2024-05-26 22:35:56] [INFO ] Redundant transitions in 23 ms returned []
Running 328 sub problems to find dead transitions.
[2024-05-26 22:35:56] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-26 22:35:56] [INFO ] Computed 15 invariants in 19 ms
[2024-05-26 22:35:56] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:36:00] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 20 ms to minimize.
[2024-05-26 22:36:00] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 3 ms to minimize.
[2024-05-26 22:36:01] [INFO ] Deduced a trap composed of 97 places in 82 ms of which 2 ms to minimize.
[2024-05-26 22:36:01] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
[2024-05-26 22:36:02] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 3 ms to minimize.
[2024-05-26 22:36:02] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 6/253 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:36:08] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:36:09] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 4/244 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:36:17] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 4 ms to minimize.
[2024-05-26 22:36:17] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 3 ms to minimize.
[2024-05-26 22:36:17] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 3 ms to minimize.
[2024-05-26 22:36:17] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-05-26 22:36:17] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 2 ms to minimize.
[2024-05-26 22:36:17] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 2 ms to minimize.
[2024-05-26 22:36:18] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 3 ms to minimize.
[2024-05-26 22:36:18] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 3 ms to minimize.
[2024-05-26 22:36:18] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
[2024-05-26 22:36:18] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 2 ms to minimize.
[2024-05-26 22:36:18] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 3 ms to minimize.
[2024-05-26 22:36:18] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 3 ms to minimize.
[2024-05-26 22:36:18] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 2 ms to minimize.
[2024-05-26 22:36:19] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 2 ms to minimize.
[2024-05-26 22:36:19] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-26 22:36:19] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
[2024-05-26 22:36:19] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 3 ms to minimize.
[2024-05-26 22:36:19] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 4 ms to minimize.
[2024-05-26 22:36:19] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 4 ms to minimize.
[2024-05-26 22:36:19] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:36:20] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 3 ms to minimize.
[2024-05-26 22:36:20] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 3 ms to minimize.
[2024-05-26 22:36:20] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 3 ms to minimize.
[2024-05-26 22:36:20] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 3 ms to minimize.
[2024-05-26 22:36:21] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-05-26 22:36:21] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 3 ms to minimize.
[2024-05-26 22:36:21] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 2 ms to minimize.
[2024-05-26 22:36:21] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 2 ms to minimize.
[2024-05-26 22:36:21] [INFO ] Deduced a trap composed of 56 places in 127 ms of which 2 ms to minimize.
[2024-05-26 22:36:21] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 4 ms to minimize.
[2024-05-26 22:36:22] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 3 ms to minimize.
[2024-05-26 22:36:22] [INFO ] Deduced a trap composed of 61 places in 150 ms of which 4 ms to minimize.
[2024-05-26 22:36:22] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 3 ms to minimize.
[2024-05-26 22:36:22] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 3 ms to minimize.
[2024-05-26 22:36:22] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 3 ms to minimize.
[2024-05-26 22:36:23] [INFO ] Deduced a trap composed of 56 places in 113 ms of which 2 ms to minimize.
[2024-05-26 22:36:23] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 3 ms to minimize.
[2024-05-26 22:36:23] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 2 ms to minimize.
[2024-05-26 22:36:23] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 3 ms to minimize.
[2024-05-26 22:36:23] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 20/307 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:36:24] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 2 ms to minimize.
[2024-05-26 22:36:24] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 2 ms to minimize.
[2024-05-26 22:36:24] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 3 ms to minimize.
[2024-05-26 22:36:25] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 3 ms to minimize.
[2024-05-26 22:36:25] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 2 ms to minimize.
[2024-05-26 22:36:25] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 2 ms to minimize.
[2024-05-26 22:36:25] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 3 ms to minimize.
[2024-05-26 22:36:25] [INFO ] Deduced a trap composed of 43 places in 192 ms of which 4 ms to minimize.
[2024-05-26 22:36:26] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 4 ms to minimize.
[2024-05-26 22:36:26] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 2 ms to minimize.
[2024-05-26 22:36:26] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 2 ms to minimize.
[2024-05-26 22:36:26] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 1 ms to minimize.
[2024-05-26 22:36:26] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 244/552 variables, and 320 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30045 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 56/303 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (OVERLAPS) 4/244 variables, 6/309 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 4/313 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:36:38] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 3 ms to minimize.
[2024-05-26 22:36:41] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 2 ms to minimize.
[2024-05-26 22:36:41] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:36:46] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 2 ms to minimize.
[2024-05-26 22:36:52] [INFO ] Deduced a trap composed of 73 places in 174 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 244/552 variables, and 325 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30020 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 0/328 constraints, Known Traps: 66/66 constraints]
After SMT, in 60311ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60350ms
Finished structural reductions in STATESPACE mode , in 1 iterations and 60554 ms. Remains : 244/244 places, 332/332 transitions.
Final net has 244 places and 332 transitions.
[2024-05-26 22:36:57] [INFO ] Flatten gal took : 96 ms
[2024-05-26 22:36:57] [INFO ] Applying decomposition
[2024-05-26 22:36:57] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17059772514317699632.txt' '-o' '/tmp/graph17059772514317699632.bin' '-w' '/tmp/graph17059772514317699632.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17059772514317699632.bin' '-l' '-1' '-v' '-w' '/tmp/graph17059772514317699632.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:36:57] [INFO ] Decomposing Gal with order
[2024-05-26 22:36:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:36:57] [INFO ] Removed a total of 216 redundant transitions.
[2024-05-26 22:36:58] [INFO ] Flatten gal took : 150 ms
[2024-05-26 22:36:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 22 ms.
[2024-05-26 22:36:58] [INFO ] Time to serialize gal into /tmp/StateSpace8319007405303868869.gal : 29 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/StateSpace8319007405303868869.gal' '-t' 'CGAL' '--stats'

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 ...219
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.40795e+06,11.2289,207900,3588,183,255094,5368,722,1.37849e+06,105,45785,0
Total reachable state count : 3407946

Max variable value : 1
STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 11
STATE_SPACE MAX_TOKEN_PER_MARKING 11 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 3407946
STATE_SPACE STATES 3407946 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 73396 ms.

BK_STOP 1716763029451

--------------------
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
+ [[ StateSpace = StateSpace ]]
+ [[ -f modelMain.xml ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StateSpace -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 StateSpace -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-PT-3"
export BK_EXAMINATION="StateSpace"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Peterson-PT-3, examination is StateSpace"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r268-smll-171654407300264"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-3.tgz
mv Peterson-PT-3 execution
cd execution
if [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "UpperBounds" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] || [ "StateSpace" = "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 [ "StateSpace" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StateSpace" != "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 "StateSpace.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StateSpace.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StateSpace.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 '' StateSpace.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] ; then
echo "FORMULA_NAME StateSpace"
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 ;