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.r107-tall-167814484200439.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 DES-PT-20b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-tall-167814484200439
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.6K Feb 26 15:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 15:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 15:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 91K 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 DES-PT-20b-ReachabilityFireability-00
FORMULA_NAME DES-PT-20b-ReachabilityFireability-01
FORMULA_NAME DES-PT-20b-ReachabilityFireability-02
FORMULA_NAME DES-PT-20b-ReachabilityFireability-03
FORMULA_NAME DES-PT-20b-ReachabilityFireability-04
FORMULA_NAME DES-PT-20b-ReachabilityFireability-05
FORMULA_NAME DES-PT-20b-ReachabilityFireability-06
FORMULA_NAME DES-PT-20b-ReachabilityFireability-07
FORMULA_NAME DES-PT-20b-ReachabilityFireability-08
FORMULA_NAME DES-PT-20b-ReachabilityFireability-09
FORMULA_NAME DES-PT-20b-ReachabilityFireability-10
FORMULA_NAME DES-PT-20b-ReachabilityFireability-11
FORMULA_NAME DES-PT-20b-ReachabilityFireability-12
FORMULA_NAME DES-PT-20b-ReachabilityFireability-13
FORMULA_NAME DES-PT-20b-ReachabilityFireability-14
FORMULA_NAME DES-PT-20b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678370421052

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=DES-PT-20b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 14:00:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 14:00:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 14:00:22] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2023-03-09 14:00:22] [INFO ] Transformed 360 places.
[2023-03-09 14:00:22] [INFO ] Transformed 311 transitions.
[2023-03-09 14:00:22] [INFO ] Found NUPN structural information;
[2023-03-09 14:00:22] [INFO ] Parsed PT model containing 360 places and 311 transitions and 987 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 79 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 16) seen :12
FORMULA DES-PT-20b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 311 rows 360 cols
[2023-03-09 14:00:23] [INFO ] Computed 65 place invariants in 32 ms
[2023-03-09 14:00:23] [INFO ] After 254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 14:00:23] [INFO ] [Nat]Absence check using 39 positive place invariants in 14 ms returned sat
[2023-03-09 14:00:23] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 44 ms returned sat
[2023-03-09 14:00:24] [INFO ] After 330ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-09 14:00:24] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 4 ms to minimize.
[2023-03-09 14:00:24] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 1 ms to minimize.
[2023-03-09 14:00:25] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 1 ms to minimize.
[2023-03-09 14:00:25] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
[2023-03-09 14:00:25] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 1 ms to minimize.
[2023-03-09 14:00:25] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 0 ms to minimize.
[2023-03-09 14:00:25] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 0 ms to minimize.
[2023-03-09 14:00:25] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2023-03-09 14:00:25] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1068 ms
[2023-03-09 14:00:25] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2023-03-09 14:00:25] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2023-03-09 14:00:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 156 ms
[2023-03-09 14:00:25] [INFO ] After 1693ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 215 ms.
[2023-03-09 14:00:26] [INFO ] After 2453ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
FORMULA DES-PT-20b-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-20b-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 36 ms.
Support contains 18 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 311/311 transitions.
Graph (complete) has 741 edges and 360 vertex of which 349 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 349 transition count 284
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 43 place count 329 transition count 284
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 43 place count 329 transition count 274
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 63 place count 319 transition count 274
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 81 place count 301 transition count 256
Iterating global reduction 2 with 18 rules applied. Total rules applied 99 place count 301 transition count 256
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 99 place count 301 transition count 255
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 300 transition count 255
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 115 place count 286 transition count 241
Iterating global reduction 2 with 14 rules applied. Total rules applied 129 place count 286 transition count 241
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 2 with 14 rules applied. Total rules applied 143 place count 286 transition count 227
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 146 place count 284 transition count 226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 146 place count 284 transition count 225
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 148 place count 283 transition count 225
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 270 place count 222 transition count 164
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 274 place count 220 transition count 166
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 276 place count 220 transition count 164
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 278 place count 218 transition count 164
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 279 place count 218 transition count 164
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 280 place count 217 transition count 163
Applied a total of 280 rules in 131 ms. Remains 217 /360 variables (removed 143) and now considering 163/311 (removed 148) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 217/360 places, 163/311 transitions.
Incomplete random walk after 10000 steps, including 302 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1543782 steps, run timeout after 3001 ms. (steps per millisecond=514 ) properties seen :{0=1}
Probabilistic random walk after 1543782 steps, saw 264709 distinct states, run finished after 3001 ms. (steps per millisecond=514 ) properties seen :1
FORMULA DES-PT-20b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 163 rows 217 cols
[2023-03-09 14:00:29] [INFO ] Computed 61 place invariants in 9 ms
[2023-03-09 14:00:29] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:00:29] [INFO ] [Nat]Absence check using 37 positive place invariants in 8 ms returned sat
[2023-03-09 14:00:29] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 51 ms returned sat
[2023-03-09 14:00:29] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:00:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 14:00:29] [INFO ] After 31ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:00:29] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2023-03-09 14:00:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-09 14:00:29] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-09 14:00:29] [INFO ] After 357ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 13 out of 217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 163/163 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 213 transition count 159
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 213 transition count 159
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 212 transition count 158
Applied a total of 10 rules in 29 ms. Remains 212 /217 variables (removed 5) and now considering 158/163 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 212/217 places, 158/163 transitions.
Incomplete random walk after 10000 steps, including 317 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1716652 steps, run timeout after 3001 ms. (steps per millisecond=572 ) properties seen :{}
Probabilistic random walk after 1716652 steps, saw 278959 distinct states, run finished after 3001 ms. (steps per millisecond=572 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 158 rows 212 cols
[2023-03-09 14:00:32] [INFO ] Computed 61 place invariants in 7 ms
[2023-03-09 14:00:32] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:00:33] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2023-03-09 14:00:33] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 78 ms returned sat
[2023-03-09 14:00:33] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:00:33] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-09 14:00:33] [INFO ] After 40ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:00:33] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2023-03-09 14:00:33] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2023-03-09 14:00:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 128 ms
[2023-03-09 14:00:33] [INFO ] After 204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 156 ms.
[2023-03-09 14:00:33] [INFO ] After 622ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 13 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 158/158 transitions.
Applied a total of 0 rules in 7 ms. Remains 212 /212 variables (removed 0) and now considering 158/158 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 212/212 places, 158/158 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 158/158 transitions.
Applied a total of 0 rules in 6 ms. Remains 212 /212 variables (removed 0) and now considering 158/158 (removed 0) transitions.
[2023-03-09 14:00:33] [INFO ] Invariant cache hit.
[2023-03-09 14:00:33] [INFO ] Implicit Places using invariants in 124 ms returned [93]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 126 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 211/212 places, 158/158 transitions.
Applied a total of 0 rules in 6 ms. Remains 211 /211 variables (removed 0) and now considering 158/158 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 139 ms. Remains : 211/212 places, 158/158 transitions.
Incomplete random walk after 10000 steps, including 311 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Finished Best-First random walk after 2541 steps, including 15 resets, run visited all 1 properties in 5 ms. (steps per millisecond=508 )
FORMULA DES-PT-20b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 11268 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DES (PT), instance 20b
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: 360 places, 311 transitions, 987 arcs.
Final Score: 5764.913
Took : 11 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5676088 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16108296 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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="DES-PT-20b"
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 DES-PT-20b, 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 r107-tall-167814484200439"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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