About the Execution of ITS-Tools for BusinessProcesses-PT-07
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
708.336 | 13626.00 | 34019.00 | 120.90 | TTTTTFTFFFFFFTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690400502.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is BusinessProcesses-PT-07, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690400502
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 16:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 100K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678360755683
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=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-07
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-09 11:19:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 11:19:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:19:17] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-09 11:19:17] [INFO ] Transformed 386 places.
[2023-03-09 11:19:17] [INFO ] Transformed 360 transitions.
[2023-03-09 11:19:17] [INFO ] Found NUPN structural information;
[2023-03-09 11:19:17] [INFO ] Parsed PT model containing 386 places and 360 transitions and 1110 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 111 resets, run finished after 514 ms. (steps per millisecond=19 ) properties (out of 14) seen :5
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 9) seen :0
[2023-03-09 11:19:18] [INFO ] Flatten gal took : 132 ms
[2023-03-09 11:19:18] [INFO ] Flatten gal took : 42 ms
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 9) seen :1
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :4
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :1
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-09 11:19:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13316139031367398550.gal : 44 ms
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
[2023-03-09 11:19:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5214440524799820681.prop : 6 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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13316139031367398550.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5214440524799820681.prop' '--nowitness' '--gen-order' 'FOLLOW'
Running SMT prover for 3 properties.
// Phase 1: matrix 360 rows 386 cols
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
[2023-03-09 11:19:18] [INFO ] Computed 62 place invariants in 25 ms
Loading property file /tmp/ReachabilityCardinality5214440524799820681.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :7 after 11
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :11 after 81
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :81 after 289
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :289 after 381
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :381 after 3545
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :3545 after 5064
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :5064 after 2.65586e+07
[2023-03-09 11:19:18] [INFO ] After 382ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :2.65586e+07 after 4.07074e+09
[2023-03-09 11:19:19] [INFO ] [Nat]Absence check using 33 positive place invariants in 29 ms returned sat
[2023-03-09 11:19:19] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 24 ms returned sat
[2023-03-09 11:19:19] [INFO ] After 438ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-09 11:19:19] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 11 ms to minimize.
[2023-03-09 11:19:20] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 1 ms to minimize.
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :4.07074e+09 after 4.07388e+09
[2023-03-09 11:19:20] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 1 ms to minimize.
[2023-03-09 11:19:20] [INFO ] Deduced a trap composed of 16 places in 273 ms of which 1 ms to minimize.
[2023-03-09 11:19:20] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 1 ms to minimize.
[2023-03-09 11:19:20] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2023-03-09 11:19:21] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2023-03-09 11:19:21] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 0 ms to minimize.
[2023-03-09 11:19:21] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 0 ms to minimize.
[2023-03-09 11:19:21] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2023-03-09 11:19:21] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 0 ms to minimize.
[2023-03-09 11:19:21] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 1 ms to minimize.
[2023-03-09 11:19:21] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 1 ms to minimize.
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :4.07388e+09 after 4.11846e+09
[2023-03-09 11:19:22] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 1 ms to minimize.
[2023-03-09 11:19:22] [INFO ] Deduced a trap composed of 104 places in 114 ms of which 2 ms to minimize.
[2023-03-09 11:19:22] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 0 ms to minimize.
[2023-03-09 11:19:22] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2023-03-09 11:19:22] [INFO ] Deduced a trap composed of 105 places in 121 ms of which 0 ms to minimize.
[2023-03-09 11:19:22] [INFO ] Deduced a trap composed of 99 places in 148 ms of which 1 ms to minimize.
[2023-03-09 11:19:22] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 0 ms to minimize.
[2023-03-09 11:19:23] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 1 ms to minimize.
[2023-03-09 11:19:23] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 0 ms to minimize.
[2023-03-09 11:19:23] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 1 ms to minimize.
[2023-03-09 11:19:23] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 0 ms to minimize.
[2023-03-09 11:19:23] [INFO ] Deduced a trap composed of 97 places in 249 ms of which 0 ms to minimize.
[2023-03-09 11:19:24] [INFO ] Deduced a trap composed of 91 places in 344 ms of which 1 ms to minimize.
[2023-03-09 11:19:24] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 1 ms to minimize.
[2023-03-09 11:19:24] [INFO ] Deduced a trap composed of 98 places in 343 ms of which 0 ms to minimize.
SDD proceeding with computation,9 properties remain. new max is 32768
SDD size :4.11846e+09 after 4.12507e+09
[2023-03-09 11:19:24] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 1 ms to minimize.
[2023-03-09 11:19:25] [INFO ] Deduced a trap composed of 109 places in 380 ms of which 0 ms to minimize.
[2023-03-09 11:19:25] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 2 ms to minimize.
[2023-03-09 11:19:25] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 1 ms to minimize.
[2023-03-09 11:19:25] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 5770 ms
[2023-03-09 11:19:25] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 0 ms to minimize.
[2023-03-09 11:19:25] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 4 ms to minimize.
[2023-03-09 11:19:25] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2023-03-09 11:19:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 281 ms
[2023-03-09 11:19:25] [INFO ] After 6724ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 264 ms.
[2023-03-09 11:19:26] [INFO ] After 7223ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 44 out of 386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 360/360 transitions.
Graph (trivial) has 170 edges and 386 vertex of which 7 / 386 are part of one of the 1 SCC in 12 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 805 edges and 380 vertex of which 378 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 378 transition count 302
Reduce places removed 49 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 57 rules applied. Total rules applied 108 place count 329 transition count 294
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 116 place count 321 transition count 294
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 116 place count 321 transition count 234
Deduced a syphon composed of 60 places in 2 ms
Ensure Unique test removed 5 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 125 rules applied. Total rules applied 241 place count 256 transition count 234
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 275 place count 222 transition count 200
Iterating global reduction 3 with 34 rules applied. Total rules applied 309 place count 222 transition count 200
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 309 place count 222 transition count 197
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 315 place count 219 transition count 197
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 405 place count 174 transition count 152
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 407 place count 174 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 409 place count 172 transition count 150
Applied a total of 409 rules in 160 ms. Remains 172 /386 variables (removed 214) and now considering 150/360 (removed 210) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 172/386 places, 150/360 transitions.
Incomplete random walk after 10000 steps, including 198 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
SDD proceeding with computation,9 properties remain. new max is 65536
SDD size :4.12507e+09 after 4.40355e+09
Finished probabilistic random walk after 1296121 steps, run visited all 1 properties in 2182 ms. (steps per millisecond=594 )
Probabilistic random walk after 1296121 steps, saw 216484 distinct states, run finished after 2183 ms. (steps per millisecond=593 ) properties seen :1
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
All properties solved without resorting to model-checking.
Total runtime 11339 ms.
BK_STOP 1678360769309
--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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-07"
export BK_EXAMINATION="ReachabilityCardinality"
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-5348"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-07, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-167813690400502"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-07.tgz
mv BusinessProcesses-PT-07 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;