fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r395-oct2-167903719000607
Last Updated
May 14, 2023

About the Execution of Smart+red for ShieldPPPt-PT-005B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5659.359 3600000.00 3675288.00 147.60 FFFTTFFFTTTTFFTF normal

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.r395-oct2-167903719000607.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldPPPt-PT-005B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903719000607
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.4K Feb 25 20:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 20:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 20:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 20:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 20:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 20:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 20:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 20:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 92K Mar 5 18:23 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 ShieldPPPt-PT-005B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679573644254

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-005B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 12:14:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 12:14:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 12:14:07] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2023-03-23 12:14:07] [INFO ] Transformed 393 places.
[2023-03-23 12:14:07] [INFO ] Transformed 358 transitions.
[2023-03-23 12:14:07] [INFO ] Found NUPN structural information;
[2023-03-23 12:14:07] [INFO ] Parsed PT model containing 393 places and 358 transitions and 896 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 16) seen :12
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :1
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 358 rows 393 cols
[2023-03-23 12:14:07] [INFO ] Computed 56 place invariants in 9 ms
[2023-03-23 12:14:08] [INFO ] After 359ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:14:08] [INFO ] [Nat]Absence check using 56 positive place invariants in 74 ms returned sat
[2023-03-23 12:14:09] [INFO ] After 320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 12:14:09] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 4 ms to minimize.
[2023-03-23 12:14:09] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 1 ms to minimize.
[2023-03-23 12:14:09] [INFO ] Deduced a trap composed of 24 places in 237 ms of which 25 ms to minimize.
[2023-03-23 12:14:09] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 4 ms to minimize.
[2023-03-23 12:14:09] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 3 ms to minimize.
[2023-03-23 12:14:10] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2023-03-23 12:14:10] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 0 ms to minimize.
[2023-03-23 12:14:10] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2023-03-23 12:14:10] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2023-03-23 12:14:10] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2023-03-23 12:14:10] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1359 ms
[2023-03-23 12:14:10] [INFO ] Deduced a trap composed of 12 places in 365 ms of which 1 ms to minimize.
[2023-03-23 12:14:11] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 1 ms to minimize.
[2023-03-23 12:14:11] [INFO ] Deduced a trap composed of 18 places in 275 ms of which 1 ms to minimize.
[2023-03-23 12:14:11] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 9 ms to minimize.
[2023-03-23 12:14:11] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 22 ms to minimize.
[2023-03-23 12:14:11] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 1 ms to minimize.
[2023-03-23 12:14:11] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2023-03-23 12:14:12] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2023-03-23 12:14:12] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1476 ms
[2023-03-23 12:14:12] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 1 ms to minimize.
[2023-03-23 12:14:12] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 0 ms to minimize.
[2023-03-23 12:14:12] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2023-03-23 12:14:12] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 1 ms to minimize.
[2023-03-23 12:14:12] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 1 ms to minimize.
[2023-03-23 12:14:13] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 0 ms to minimize.
[2023-03-23 12:14:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 891 ms
[2023-03-23 12:14:13] [INFO ] After 4326ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 307 ms.
[2023-03-23 12:14:13] [INFO ] After 5005ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 35 ms.
Support contains 66 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 358/358 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 393 transition count 305
Reduce places removed 53 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 69 rules applied. Total rules applied 122 place count 340 transition count 289
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 139 place count 324 transition count 288
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 139 place count 324 transition count 267
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 181 place count 303 transition count 267
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 205 place count 279 transition count 243
Iterating global reduction 3 with 24 rules applied. Total rules applied 229 place count 279 transition count 243
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 229 place count 279 transition count 236
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 243 place count 272 transition count 236
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 357 place count 215 transition count 179
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 367 place count 210 transition count 179
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 370 place count 210 transition count 176
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 373 place count 207 transition count 176
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 380 place count 207 transition count 176
Applied a total of 380 rules in 121 ms. Remains 207 /393 variables (removed 186) and now considering 176/358 (removed 182) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 207/393 places, 176/358 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 3) seen :1
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :1
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 176 rows 207 cols
[2023-03-23 12:14:13] [INFO ] Computed 56 place invariants in 2 ms
[2023-03-23 12:14:13] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 12:14:13] [INFO ] [Nat]Absence check using 56 positive place invariants in 15 ms returned sat
[2023-03-23 12:14:13] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 12:14:13] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-23 12:14:13] [INFO ] After 33ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 12:14:14] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 0 ms to minimize.
[2023-03-23 12:14:14] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2023-03-23 12:14:14] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2023-03-23 12:14:14] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2023-03-23 12:14:14] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2023-03-23 12:14:14] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2023-03-23 12:14:14] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2023-03-23 12:14:14] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2023-03-23 12:14:14] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 511 ms
[2023-03-23 12:14:14] [INFO ] After 566ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-23 12:14:14] [INFO ] After 751ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 25 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 176/176 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 207 transition count 167
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 198 transition count 166
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 197 transition count 166
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 20 place count 197 transition count 157
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 38 place count 188 transition count 157
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 40 place count 186 transition count 155
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 186 transition count 155
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 42 place count 186 transition count 154
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 44 place count 185 transition count 154
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 92 place count 161 transition count 130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 100 place count 157 transition count 130
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 104 place count 157 transition count 130
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 156 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 106 place count 155 transition count 129
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 106 place count 155 transition count 128
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 108 place count 154 transition count 128
Applied a total of 108 rules in 27 ms. Remains 154 /207 variables (removed 53) and now considering 128/176 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 154/207 places, 128/176 transitions.
Finished random walk after 6430 steps, including 2 resets, run visited all 1 properties in 20 ms. (steps per millisecond=321 )
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 7665 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldPPPt (PT), instance 005B
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 393 places, 358 transitions, 896 arcs.
Final Score: 11441.343
Took : 9 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 10493620 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16106856 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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="ShieldPPPt-PT-005B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is ShieldPPPt-PT-005B, 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 r395-oct2-167903719000607"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-005B.tgz
mv ShieldPPPt-PT-005B 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;