fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r550-tall-171734899000304
Last Updated
July 7, 2024

About the Execution of ITS-Tools for FireWire-PT-17

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1505.920 99221.00 124835.00 352.00 1.8703E+0012 ? 1 9 normal

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.r550-tall-171734899000304.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 FireWire-PT-17, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734899000304
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 153K Jun 2 16:33 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 1717369445040

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-06-02 23:04:06] [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-06-02 23:04:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:04:06] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-06-02 23:04:06] [INFO ] Transformed 428 places.
[2024-06-02 23:04:06] [INFO ] Transformed 656 transitions.
[2024-06-02 23:04:06] [INFO ] Found NUPN structural information;
[2024-06-02 23:04:06] [INFO ] Parsed PT model containing 428 places and 656 transitions and 1904 arcs in 198 ms.
Starting structural reductions in STATESPACE mode, iteration 0 : 428/428 places, 656/656 transitions.
[2024-06-02 23:04:06] [INFO ] Redundant transitions in 36 ms returned []
Running 655 sub problems to find dead transitions.
// Phase 1: matrix 656 rows 428 cols
[2024-06-02 23:04:06] [INFO ] Computed 9 invariants in 29 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 421/421 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 2 (OVERLAPS) 7/428 variables, 9/430 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 7/437 constraints. Problems are: Problem set: 0 solved, 655 unsolved
[2024-06-02 23:04:20] [INFO ] Deduced a trap composed of 217 places in 224 ms of which 33 ms to minimize.
[2024-06-02 23:04:20] [INFO ] Deduced a trap composed of 214 places in 357 ms of which 3 ms to minimize.
[2024-06-02 23:04:20] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 2 ms to minimize.
[2024-06-02 23:04:20] [INFO ] Deduced a trap composed of 102 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:04:21] [INFO ] Deduced a trap composed of 115 places in 123 ms of which 3 ms to minimize.
[2024-06-02 23:04:21] [INFO ] Deduced a trap composed of 118 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:04:21] [INFO ] Deduced a trap composed of 115 places in 56 ms of which 1 ms to minimize.
[2024-06-02 23:04:21] [INFO ] Deduced a trap composed of 119 places in 64 ms of which 2 ms to minimize.
[2024-06-02 23:04:22] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 2 ms to minimize.
[2024-06-02 23:04:23] [INFO ] Deduced a trap composed of 118 places in 61 ms of which 3 ms to minimize.
[2024-06-02 23:04:23] [INFO ] Deduced a trap composed of 112 places in 72 ms of which 2 ms to minimize.
[2024-06-02 23:04:23] [INFO ] Deduced a trap composed of 110 places in 64 ms of which 2 ms to minimize.
[2024-06-02 23:04:23] [INFO ] Deduced a trap composed of 103 places in 65 ms of which 1 ms to minimize.
[2024-06-02 23:04:23] [INFO ] Deduced a trap composed of 112 places in 65 ms of which 1 ms to minimize.
[2024-06-02 23:04:23] [INFO ] Deduced a trap composed of 121 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:04:23] [INFO ] Deduced a trap composed of 123 places in 65 ms of which 1 ms to minimize.
[2024-06-02 23:04:23] [INFO ] Deduced a trap composed of 124 places in 65 ms of which 2 ms to minimize.
[2024-06-02 23:04:23] [INFO ] Deduced a trap composed of 106 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:04:24] [INFO ] Deduced a trap composed of 119 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:04:25] [INFO ] Deduced a trap composed of 173 places in 140 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 20/457 constraints. Problems are: Problem set: 0 solved, 655 unsolved
[2024-06-02 23:04:25] [INFO ] Deduced a trap composed of 108 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:04:25] [INFO ] Deduced a trap composed of 107 places in 60 ms of which 2 ms to minimize.
[2024-06-02 23:04:25] [INFO ] Deduced a trap composed of 107 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:04:25] [INFO ] Deduced a trap composed of 119 places in 73 ms of which 2 ms to minimize.
[2024-06-02 23:04:25] [INFO ] Deduced a trap composed of 119 places in 62 ms of which 2 ms to minimize.
[2024-06-02 23:04:26] [INFO ] Deduced a trap composed of 119 places in 64 ms of which 1 ms to minimize.
[2024-06-02 23:04:27] [INFO ] Deduced a trap composed of 121 places in 64 ms of which 1 ms to minimize.
[2024-06-02 23:04:27] [INFO ] Deduced a trap composed of 121 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:04:28] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 3 ms to minimize.
[2024-06-02 23:04:28] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 2 ms to minimize.
[2024-06-02 23:04:28] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 3 ms to minimize.
[2024-06-02 23:04:29] [INFO ] Deduced a trap composed of 114 places in 118 ms of which 2 ms to minimize.
[2024-06-02 23:04:29] [INFO ] Deduced a trap composed of 211 places in 163 ms of which 3 ms to minimize.
[2024-06-02 23:04:29] [INFO ] Deduced a trap composed of 102 places in 142 ms of which 3 ms to minimize.
[2024-06-02 23:04:29] [INFO ] Deduced a trap composed of 145 places in 134 ms of which 7 ms to minimize.
[2024-06-02 23:04:29] [INFO ] Deduced a trap composed of 95 places in 153 ms of which 3 ms to minimize.
[2024-06-02 23:04:29] [INFO ] Deduced a trap composed of 117 places in 156 ms of which 2 ms to minimize.
[2024-06-02 23:04:30] [INFO ] Deduced a trap composed of 85 places in 132 ms of which 2 ms to minimize.
[2024-06-02 23:04:30] [INFO ] Deduced a trap composed of 109 places in 134 ms of which 2 ms to minimize.
[2024-06-02 23:04:30] [INFO ] Deduced a trap composed of 107 places in 149 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 20/477 constraints. Problems are: Problem set: 0 solved, 655 unsolved
[2024-06-02 23:04:30] [INFO ] Deduced a trap composed of 117 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:04:31] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-06-02 23:04:31] [INFO ] Deduced a trap composed of 123 places in 86 ms of which 2 ms to minimize.
[2024-06-02 23:04:31] [INFO ] Deduced a trap composed of 119 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:04:32] [INFO ] Deduced a trap composed of 121 places in 76 ms of which 2 ms to minimize.
[2024-06-02 23:04:32] [INFO ] Deduced a trap composed of 112 places in 140 ms of which 1 ms to minimize.
[2024-06-02 23:04:34] [INFO ] Deduced a trap composed of 100 places in 150 ms of which 2 ms to minimize.
[2024-06-02 23:04:34] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/1084 variables, and 485 constraints, problems are : Problem set: 0 solved, 655 unsolved in 30036 ms.
Refiners :[Domain max(s): 428/428 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 0/428 constraints, PredecessorRefiner: 655/655 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 655 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 421/421 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 2 (OVERLAPS) 7/428 variables, 9/430 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 7/437 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 48/485 constraints. Problems are: Problem set: 0 solved, 655 unsolved
[2024-06-02 23:04:42] [INFO ] Deduced a trap composed of 211 places in 143 ms of which 3 ms to minimize.
[2024-06-02 23:04:42] [INFO ] Deduced a trap composed of 212 places in 157 ms of which 2 ms to minimize.
[2024-06-02 23:04:42] [INFO ] Deduced a trap composed of 199 places in 145 ms of which 2 ms to minimize.
[2024-06-02 23:04:43] [INFO ] Deduced a trap composed of 212 places in 115 ms of which 2 ms to minimize.
[2024-06-02 23:04:43] [INFO ] Deduced a trap composed of 217 places in 124 ms of which 3 ms to minimize.
[2024-06-02 23:04:43] [INFO ] Deduced a trap composed of 140 places in 134 ms of which 3 ms to minimize.
[2024-06-02 23:04:43] [INFO ] Deduced a trap composed of 247 places in 140 ms of which 2 ms to minimize.
[2024-06-02 23:04:44] [INFO ] Deduced a trap composed of 226 places in 145 ms of which 9 ms to minimize.
[2024-06-02 23:04:45] [INFO ] Deduced a trap composed of 166 places in 127 ms of which 2 ms to minimize.
[2024-06-02 23:04:45] [INFO ] Deduced a trap composed of 175 places in 141 ms of which 2 ms to minimize.
[2024-06-02 23:04:46] [INFO ] Deduced a trap composed of 89 places in 159 ms of which 2 ms to minimize.
[2024-06-02 23:04:50] [INFO ] Deduced a trap composed of 102 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 12/497 constraints. Problems are: Problem set: 0 solved, 655 unsolved
[2024-06-02 23:04:51] [INFO ] Deduced a trap composed of 110 places in 72 ms of which 2 ms to minimize.
[2024-06-02 23:04:51] [INFO ] Deduced a trap composed of 121 places in 62 ms of which 1 ms to minimize.
[2024-06-02 23:04:51] [INFO ] Deduced a trap composed of 142 places in 137 ms of which 2 ms to minimize.
[2024-06-02 23:04:51] [INFO ] Deduced a trap composed of 182 places in 137 ms of which 6 ms to minimize.
[2024-06-02 23:04:51] [INFO ] Deduced a trap composed of 253 places in 136 ms of which 2 ms to minimize.
[2024-06-02 23:04:51] [INFO ] Deduced a trap composed of 214 places in 130 ms of which 2 ms to minimize.
[2024-06-02 23:04:51] [INFO ] Deduced a trap composed of 119 places in 125 ms of which 2 ms to minimize.
[2024-06-02 23:04:51] [INFO ] Deduced a trap composed of 217 places in 136 ms of which 2 ms to minimize.
[2024-06-02 23:04:52] [INFO ] Deduced a trap composed of 161 places in 149 ms of which 3 ms to minimize.
[2024-06-02 23:04:54] [INFO ] Deduced a trap composed of 122 places in 145 ms of which 3 ms to minimize.
[2024-06-02 23:04:55] [INFO ] Deduced a trap composed of 100 places in 126 ms of which 2 ms to minimize.
[2024-06-02 23:04:55] [INFO ] Deduced a trap composed of 104 places in 114 ms of which 2 ms to minimize.
[2024-06-02 23:04:55] [INFO ] Deduced a trap composed of 102 places in 117 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 13/510 constraints. Problems are: Problem set: 0 solved, 655 unsolved
[2024-06-02 23:05:00] [INFO ] Deduced a trap composed of 121 places in 67 ms of which 1 ms to minimize.
[2024-06-02 23:05:01] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:05:02] [INFO ] Deduced a trap composed of 140 places in 144 ms of which 3 ms to minimize.
[2024-06-02 23:05:02] [INFO ] Deduced a trap composed of 137 places in 120 ms of which 3 ms to minimize.
[2024-06-02 23:05:02] [INFO ] Deduced a trap composed of 179 places in 147 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/1084 variables, and 515 constraints, problems are : Problem set: 0 solved, 655 unsolved in 30018 ms.
Refiners :[Domain max(s): 428/428 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 0/428 constraints, PredecessorRefiner: 0/655 constraints, Known Traps: 78/78 constraints]
After SMT, in 60495ms problems are : Problem set: 0 solved, 655 unsolved
Search for dead transitions found 0 dead transitions in 60552ms
Finished structural reductions in STATESPACE mode , in 1 iterations and 60730 ms. Remains : 428/428 places, 656/656 transitions.
Final net has 428 places and 656 transitions.
[2024-06-02 23:05:07] [INFO ] Flatten gal took : 74 ms
[2024-06-02 23:05:07] [INFO ] Applying decomposition
[2024-06-02 23:05:07] [INFO ] Flatten gal took : 34 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/graph15441652759834192160.txt' '-o' '/tmp/graph15441652759834192160.bin' '-w' '/tmp/graph15441652759834192160.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15441652759834192160.bin' '-l' '-1' '-v' '-w' '/tmp/graph15441652759834192160.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:05:07] [INFO ] Decomposing Gal with order
[2024-06-02 23:05:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:05:07] [INFO ] Removed a total of 547 redundant transitions.
[2024-06-02 23:05:07] [INFO ] Flatten gal took : 81 ms
[2024-06-02 23:05:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 14 ms.
[2024-06-02 23:05:07] [INFO ] Time to serialize gal into /tmp/StateSpace2874973049778855279.gal : 10 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/StateSpace2874973049778855279.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,1.8703e+12,36.2009,975388,8609,205,1.04509e+06,3227,1093,7.18593e+06,107,17826,0
Total reachable state count : 1870302369374

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

BK_STOP 1717369544261

--------------------
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="FireWire-PT-17"
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 FireWire-PT-17, 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 r550-tall-171734899000304"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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