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

About the Execution of LTSMin+red for Murphy-PT-D3N050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15888.960 3586307.00 14250221.00 721.00 ?FFT?T??TT????FT 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.r521-tall-167987246600358.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 ltsminxred
Input is Murphy-PT-D3N050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246600358
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 15K Mar 31 16:48 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 Murphy-PT-D3N050-ReachabilityCardinality-00
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-01
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-02
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-03
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-04
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-05
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-06
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-07
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-08
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-09
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-10
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-11
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-12
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-13
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-14
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680906403434

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D3N050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 22:26:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 22:26:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 22:26:47] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-04-07 22:26:47] [INFO ] Transformed 24 places.
[2023-04-07 22:26:47] [INFO ] Transformed 28 transitions.
[2023-04-07 22:26:47] [INFO ] Parsed PT model containing 24 places and 28 transitions and 108 arcs in 285 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10044 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 16) seen :8
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 28 rows 24 cols
[2023-04-07 22:26:49] [INFO ] Computed 5 invariants in 4 ms
[2023-04-07 22:26:49] [INFO ] After 391ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 22:26:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 22:26:49] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-04-07 22:26:49] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 22:26:49] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 22:26:50] [INFO ] After 579ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 22:26:50] [INFO ] After 794ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 219 ms.
[2023-04-07 22:26:50] [INFO ] After 1412ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 58 ms.
Support contains 24 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 25 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 22:26:50] [INFO ] Invariant cache hit.
[2023-04-07 22:26:51] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 24/24 places, 28/28 transitions.
Incomplete random walk after 10022 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=233 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 269162 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 269162 steps, saw 182281 distinct states, run finished after 3007 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 8 properties.
[2023-04-07 22:26:54] [INFO ] Invariant cache hit.
[2023-04-07 22:26:54] [INFO ] After 452ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 22:26:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 22:26:55] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 22:26:55] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 22:26:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 22:26:55] [INFO ] After 59ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 22:26:55] [INFO ] After 158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-04-07 22:26:55] [INFO ] After 491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 122 ms.
Support contains 24 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 24/24 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 22:26:55] [INFO ] Invariant cache hit.
[2023-04-07 22:26:55] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-04-07 22:26:55] [INFO ] Invariant cache hit.
[2023-04-07 22:26:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 22:26:55] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-04-07 22:26:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 22:26:55] [INFO ] Invariant cache hit.
[2023-04-07 22:26:55] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running SMT prover for 8 properties.
[2023-04-07 22:26:55] [INFO ] Invariant cache hit.
[2023-04-07 22:26:55] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 22:26:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 27 ms returned sat
[2023-04-07 22:26:56] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 19 ms returned sat
[2023-04-07 22:26:56] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 22:26:56] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 22:26:56] [INFO ] After 79ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 22:26:56] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2023-04-07 22:26:56] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 2 ms to minimize.
[2023-04-07 22:26:56] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2023-04-07 22:26:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 144 ms
[2023-04-07 22:26:56] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2023-04-07 22:26:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-04-07 22:26:56] [INFO ] After 355ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-04-07 22:26:56] [INFO ] After 1025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-04-07 22:26:57] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-04-07 22:26:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 28 transitions and 108 arcs took 1 ms.
[2023-04-07 22:26:57] [INFO ] Flatten gal took : 30 ms
Total runtime 9677 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/513/inv_0_ --invariant=/tmp/513/inv_1_ --invariant=/tmp/513/inv_2_ --invariant=/tmp/513/inv_3_ --invariant=/tmp/513/inv_4_ --invariant=/tmp/513/inv_5_ --invariant=/tmp/513/inv_6_ --invariant=/tmp/513/inv_7_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393232 kB
MemFree: 390256 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16104128 kB
Could not compute solution for formula : Murphy-PT-D3N050-ReachabilityCardinality-00
Could not compute solution for formula : Murphy-PT-D3N050-ReachabilityCardinality-04
Could not compute solution for formula : Murphy-PT-D3N050-ReachabilityCardinality-06
Could not compute solution for formula : Murphy-PT-D3N050-ReachabilityCardinality-07
Could not compute solution for formula : Murphy-PT-D3N050-ReachabilityCardinality-10
Could not compute solution for formula : Murphy-PT-D3N050-ReachabilityCardinality-11
Could not compute solution for formula : Murphy-PT-D3N050-ReachabilityCardinality-12
Could not compute solution for formula : Murphy-PT-D3N050-ReachabilityCardinality-13

BK_STOP 1680909989741

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name Murphy-PT-D3N050-ReachabilityCardinality-00
rfs formula type EF
rfs formula formula --invariant=/tmp/513/inv_0_
rfs formula name Murphy-PT-D3N050-ReachabilityCardinality-04
rfs formula type AG
rfs formula formula --invariant=/tmp/513/inv_1_
rfs formula name Murphy-PT-D3N050-ReachabilityCardinality-06
rfs formula type EF
rfs formula formula --invariant=/tmp/513/inv_2_
rfs formula name Murphy-PT-D3N050-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/513/inv_3_
rfs formula name Murphy-PT-D3N050-ReachabilityCardinality-10
rfs formula type EF
rfs formula formula --invariant=/tmp/513/inv_4_
rfs formula name Murphy-PT-D3N050-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/513/inv_5_
rfs formula name Murphy-PT-D3N050-ReachabilityCardinality-12
rfs formula type EF
rfs formula formula --invariant=/tmp/513/inv_6_
rfs formula name Murphy-PT-D3N050-ReachabilityCardinality-13
rfs formula type AG
rfs formula formula --invariant=/tmp/513/inv_7_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 24 places, 28 transitions and 108 arcs
pnml2lts-sym: Petri net Murphy_PT_D3N050 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 28->12 groups
pnml2lts-sym: Regrouping took 0.010 real 0.000 user 0.010 sys
pnml2lts-sym: state vector length is 24; there are 12 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 519
Killing (9) : 519

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="Murphy-PT-D3N050"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Murphy-PT-D3N050, 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 r521-tall-167987246600358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-PT-D3N050.tgz
mv Murphy-PT-D3N050 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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;