Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r217-smll-167840359100203.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is HealthRecord-PT-12, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r217-smll-167840359100203
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.5K Feb 26 18:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 18:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 17:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 17:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 18:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 26 18:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 18:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 18:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 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 71K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678626494043

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=smartxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-12
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-12 13:08:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-12 13:08:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 13:08:16] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2023-03-12 13:08:16] [INFO ] Transformed 160 places.
[2023-03-12 13:08:16] [INFO ] Transformed 340 transitions.
[2023-03-12 13:08:16] [INFO ] Found NUPN structural information;
[2023-03-12 13:08:16] [INFO ] Parsed PT model containing 160 places and 340 transitions and 895 arcs in 252 ms.
Graph (trivial) has 274 edges and 160 vertex of which 8 / 160 are part of one of the 4 SCC in 6 ms
Free SCC test removed 4 places
Structural test allowed to assert that 31 places are NOT stable. Took 17 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
Incomplete random walk after 10000 steps, including 808 resets, run finished after 722 ms. (steps per millisecond=13 ) properties (out of 129) seen :78
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Running SMT prover for 51 properties.
[2023-03-12 13:08:18] [INFO ] Flow matrix only has 292 transitions (discarded 16 similar events)
// Phase 1: matrix 292 rows 156 cols
[2023-03-12 13:08:18] [INFO ] Computed 18 place invariants in 15 ms
[2023-03-12 13:08:18] [INFO ] After 641ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:51
[2023-03-12 13:08:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2023-03-12 13:08:19] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 16 ms returned sat
[2023-03-12 13:08:20] [INFO ] After 806ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :51
[2023-03-12 13:08:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 13:08:21] [INFO ] After 639ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :51
[2023-03-12 13:08:21] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 12 ms to minimize.
[2023-03-12 13:08:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2023-03-12 13:08:22] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2023-03-12 13:08:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-03-12 13:08:22] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2023-03-12 13:08:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-03-12 13:08:22] [INFO ] After 2033ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :51
Attempting to minimize the solution found.
Minimization took 610 ms.
[2023-03-12 13:08:23] [INFO ] After 4120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :51
Fused 51 Parikh solutions to 39 different solutions.
Parikh walk visited 1 properties in 443 ms.
Support contains 50 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 308/308 transitions.
Graph (complete) has 678 edges and 156 vertex of which 147 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 147 transition count 289
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 16 place count 145 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 144 transition count 286
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 17 place count 144 transition count 285
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 143 transition count 285
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 63 place count 99 transition count 197
Iterating global reduction 3 with 44 rules applied. Total rules applied 107 place count 99 transition count 197
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 112 place count 94 transition count 187
Iterating global reduction 3 with 5 rules applied. Total rules applied 117 place count 94 transition count 187
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 123 place count 94 transition count 181
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 135 place count 88 transition count 203
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 140 place count 88 transition count 198
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 142 place count 88 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 144 place count 86 transition count 196
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 159 place count 86 transition count 196
Applied a total of 159 rules in 85 ms. Remains 86 /156 variables (removed 70) and now considering 196/308 (removed 112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 86/156 places, 196/308 transitions.
Incomplete random walk after 1000000 steps, including 67706 resets, run finished after 16854 ms. (steps per millisecond=59 ) properties (out of 50) seen :47
Incomplete Best-First random walk after 1000001 steps, including 12277 resets, run finished after 2441 ms. (steps per millisecond=409 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 12403 resets, run finished after 2354 ms. (steps per millisecond=424 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 12245 resets, run finished after 2461 ms. (steps per millisecond=406 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 13:08:47] [INFO ] Flow matrix only has 184 transitions (discarded 12 similar events)
// Phase 1: matrix 184 rows 86 cols
[2023-03-12 13:08:47] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-12 13:08:47] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 13:08:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 13:08:47] [INFO ] [Nat]Absence check using 1 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-12 13:08:47] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 13:08:47] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-12 13:08:47] [INFO ] After 24ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 13:08:47] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-12 13:08:47] [INFO ] After 234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 64 ms.
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 196/196 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 86 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 85 transition count 195
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 36 place count 51 transition count 127
Iterating global reduction 2 with 34 rules applied. Total rules applied 70 place count 51 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 51 transition count 125
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 76 place count 47 transition count 117
Iterating global reduction 3 with 4 rules applied. Total rules applied 80 place count 47 transition count 117
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 83 place count 44 transition count 108
Iterating global reduction 3 with 3 rules applied. Total rules applied 86 place count 44 transition count 108
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 41 transition count 102
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 41 transition count 102
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 103 place count 41 transition count 91
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 107 place count 39 transition count 89
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 113 place count 36 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 115 place count 36 transition count 100
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 116 place count 36 transition count 99
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 127 place count 36 transition count 99
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 129 place count 36 transition count 99
Applied a total of 129 rules in 48 ms. Remains 36 /86 variables (removed 50) and now considering 99/196 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 36/86 places, 99/196 transitions.
Finished random walk after 692999 steps, including 52427 resets, run visited all 3 properties in 8283 ms. (steps per millisecond=83 )
Able to resolve query StableMarking after proving 131 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 39701 ms.
ITS solved all properties within timeout

BK_STOP 1678626537381

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-12"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 smartxred"
echo " Input is HealthRecord-PT-12, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r217-smll-167840359100203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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