About the Execution of ITS-Tools for BusinessProcesses-PT-14
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 461.647 | 10750.00 | 27368.00 | 1662.30 | TTTFFFFFTTTFFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).

Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r034-tall-177946842000559.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is BusinessProcesses-PT-14, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842000559
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.8K Mar 5 17:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 5 17:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 5 17:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 5 17:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Mar 15 07:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 07:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 17:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Mar 5 17:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 5 17:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 5 17:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 156K Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1779622963232
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-24 11:42:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 11:42:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 11:42:44] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2026-05-24 11:42:44] [INFO ] Transformed 624 places.
[2026-05-24 11:42:44] [INFO ] Transformed 564 transitions.
[2026-05-24 11:42:44] [INFO ] Found NUPN structural information;
[2026-05-24 11:42:44] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
[2026-05-24 11:42:45] [INFO ] Flatten gal took : 190 ms
RANDOM walk for 40000 steps (268 resets) in 1763 ms. (22 steps per ms) remains 5/16 properties
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 11:42:45] [INFO ] Flatten gal took : 108 ms
BEST_FIRST walk for 40003 steps (44 resets) in 282 ms. (141 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (47 resets) in 188 ms. (211 steps per ms) remains 5/5 properties
[2026-05-24 11:42:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16366643699844719591.gal : 99 ms
[2026-05-24 11:42:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14239298224612624241.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16366643699844719591.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14239298224612624241.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (48 resets) in 271 ms. (147 steps per ms) remains 4/5 properties
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40002 steps (45 resets) in 141 ms. (281 steps per ms) remains 4/4 properties
Loading property file /tmp/ReachabilityCardinality14239298224612624241.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :19 after 29
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :29 after 141
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :141 after 279
BEST_FIRST walk for 40004 steps (49 resets) in 910 ms. (43 steps per ms) remains 4/4 properties
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :279 after 2.73815e+14
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16663661683317732517.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16642344691931779420.kers'
[2026-05-24 11:42:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16663661683317732517.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16642344691931779420.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 556 rows 616 cols 1641 entries
Finished phase 1 with 440 SingleSign rule and 77 generalized
[2026-05-24 11:42:45] [INFO ] Computed 99 invariants in 3 ms
Computed 99 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16642344691931779420.kers
Total runtime 4 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 407/435 variables, 72/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 407/507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 43/478 variables, 9/516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 43/559 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 132/610 variables, 15/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 132/706 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 6/616 variables, 3/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/616 variables, 6/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/616 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 556/1172 variables, 616/1331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1172 variables, 0/1331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/1172 variables, 0/1331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1172/1172 variables, and 1331 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2234 ms.
Refiners :[Domain max(s): 616/616 constraints, Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 616/616 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 407/435 variables, 72/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 407/507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 16/523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 43/478 variables, 9/533 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 43/576 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 5/581 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 132/610 variables, 15/596 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/610 variables, 132/728 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SMT process timed out in 7406ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 28 out of 616 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 616/616 places, 556/556 transitions.
Graph (complete) has 1260 edges and 616 vertex of which 610 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 610 transition count 467
Reduce places removed 88 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 95 rules applied. Total rules applied 184 place count 522 transition count 460
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 191 place count 515 transition count 460
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 121 Pre rules applied. Total rules applied 191 place count 515 transition count 339
Deduced a syphon composed of 121 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 447 place count 380 transition count 339
Discarding 80 places :
Symmetric choice reduction at 3 with 80 rule applications. Total rules 527 place count 300 transition count 259
Iterating global reduction 3 with 80 rules applied. Total rules applied 607 place count 300 transition count 259
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 607 place count 300 transition count 252
Deduced a syphon composed of 7 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 623 place count 291 transition count 252
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 799 place count 202 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 800 place count 202 transition count 164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 802 place count 201 transition count 168
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 803 place count 201 transition count 168
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 804 place count 200 transition count 167
Applied a total of 804 rules in 160 ms. Remains 200 /616 variables (removed 416) and now considering 167/556 (removed 389) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 200/616 places, 167/556 transitions.
RANDOM walk for 40000 steps (2194 resets) in 438 ms. (91 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (493 resets) in 140 ms. (283 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (491 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (493 resets) in 201 ms. (198 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (484 resets) in 180 ms. (221 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 32583 steps, run visited all 4 properties in 163 ms. (steps per millisecond=199 )
Probabilistic random walk after 32583 steps, saw 7816 distinct states, run finished after 167 ms. (steps per millisecond=195 ) properties seen :4
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 9564 ms.
BK_STOP 1779622973982
--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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
++ 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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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="BusinessProcesses-PT-14"
export BK_EXAMINATION="ReachabilityFireability"
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-5973"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-14, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r034-tall-177946842000559"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-14.tgz
mv BusinessProcesses-PT-14 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;
