Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813695700374.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is BugTracking-PT-q3m128, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695700374
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.0K Feb 26 07:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 07:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 06:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 06:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 07:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 07:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 07:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 26 07:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q3m128-ReachabilityCardinality-00
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-01
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-02
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-03
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-04
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-05
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-06
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-07
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-08
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-09
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-10
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-11
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-12
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-13
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-14
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678716890922

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m128
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 14:14:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 14:14:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 14:14:53] [INFO ] Load time of PNML (sax parser for PT used): 840 ms
[2023-03-13 14:14:53] [INFO ] Transformed 754 places.
[2023-03-13 14:14:53] [INFO ] Transformed 27370 transitions.
[2023-03-13 14:14:53] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1103 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 514 places in 101 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m128-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10118 steps, including 8 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 129596 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 129596 steps, saw 62286 distinct states, run finished after 3002 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-13 14:14:57] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2023-03-13 14:14:57] [INFO ] Computed 10 place invariants in 27 ms
[2023-03-13 14:14:58] [INFO ] [Real]Absence check using 10 positive place invariants in 19 ms returned sat
[2023-03-13 14:14:58] [INFO ] After 341ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 14:14:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-13 14:14:59] [INFO ] After 943ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-13 14:14:59] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-13 14:14:59] [INFO ] After 529ms SMT Verify possible using 255 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-13 14:15:00] [INFO ] Deduced a trap composed of 49 places in 455 ms of which 9 ms to minimize.
[2023-03-13 14:15:00] [INFO ] Deduced a trap composed of 12 places in 347 ms of which 2 ms to minimize.
[2023-03-13 14:15:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 952 ms
[2023-03-13 14:15:01] [INFO ] Deduced a trap composed of 12 places in 393 ms of which 2 ms to minimize.
[2023-03-13 14:15:01] [INFO ] Deduced a trap composed of 8 places in 306 ms of which 1 ms to minimize.
[2023-03-13 14:15:02] [INFO ] Deduced a trap composed of 18 places in 280 ms of which 1 ms to minimize.
[2023-03-13 14:15:02] [INFO ] Deduced a trap composed of 7 places in 211 ms of which 1 ms to minimize.
[2023-03-13 14:15:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1556 ms
[2023-03-13 14:15:03] [INFO ] Deduced a trap composed of 64 places in 337 ms of which 0 ms to minimize.
[2023-03-13 14:15:03] [INFO ] Deduced a trap composed of 21 places in 265 ms of which 1 ms to minimize.
[2023-03-13 14:15:03] [INFO ] Deduced a trap composed of 46 places in 333 ms of which 1 ms to minimize.
[2023-03-13 14:15:04] [INFO ] Deduced a trap composed of 18 places in 302 ms of which 1 ms to minimize.
[2023-03-13 14:15:04] [INFO ] Deduced a trap composed of 55 places in 309 ms of which 1 ms to minimize.
[2023-03-13 14:15:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1977 ms
[2023-03-13 14:15:04] [INFO ] After 5355ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 313 ms.
[2023-03-13 14:15:05] [INFO ] After 6880ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
FORMULA BugTracking-PT-q3m128-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BugTracking-PT-q3m128-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 485 ms.
Support contains 8 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 237 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 2750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 235 transition count 2753
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 10 place count 235 transition count 2750
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 232 transition count 2750
Applied a total of 13 rules in 299 ms. Remains 232 /240 variables (removed 8) and now considering 2750/2769 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 301 ms. Remains : 232/240 places, 2750/2769 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 113660 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 113660 steps, saw 73368 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-13 14:15:09] [INFO ] Flow matrix only has 2621 transitions (discarded 129 similar events)
// Phase 1: matrix 2621 rows 232 cols
[2023-03-13 14:15:09] [INFO ] Computed 8 place invariants in 13 ms
[2023-03-13 14:15:09] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 14:15:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 14:15:09] [INFO ] After 509ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 14:15:09] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-13 14:15:10] [INFO ] After 383ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 14:15:10] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 0 ms to minimize.
[2023-03-13 14:15:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 366 ms
[2023-03-13 14:15:10] [INFO ] After 1101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 242 ms.
[2023-03-13 14:15:11] [INFO ] After 1918ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 90 ms.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 2750/2750 transitions.
Applied a total of 0 rules in 54 ms. Remains 232 /232 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 232/232 places, 2750/2750 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 2750/2750 transitions.
Applied a total of 0 rules in 56 ms. Remains 232 /232 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
[2023-03-13 14:15:11] [INFO ] Flow matrix only has 2621 transitions (discarded 129 similar events)
[2023-03-13 14:15:11] [INFO ] Invariant cache hit.
[2023-03-13 14:15:11] [INFO ] Implicit Places using invariants in 422 ms returned []
[2023-03-13 14:15:11] [INFO ] Flow matrix only has 2621 transitions (discarded 129 similar events)
[2023-03-13 14:15:11] [INFO ] Invariant cache hit.
[2023-03-13 14:15:12] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-13 14:15:13] [INFO ] Implicit Places using invariants and state equation in 1516 ms returned []
Implicit Place search using SMT with State Equation took 1942 ms to find 0 implicit places.
[2023-03-13 14:15:13] [INFO ] Redundant transitions in 334 ms returned []
[2023-03-13 14:15:13] [INFO ] Flow matrix only has 2621 transitions (discarded 129 similar events)
[2023-03-13 14:15:13] [INFO ] Invariant cache hit.
[2023-03-13 14:15:14] [INFO ] Dead Transitions using invariants and state equation in 884 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3227 ms. Remains : 232/232 places, 2750/2750 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 232 transition count 2620
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 231 transition count 2619
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 231 transition count 2618
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 137 place count 231 transition count 2614
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 141 place count 227 transition count 2614
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 168 place count 227 transition count 2614
Applied a total of 168 rules in 179 ms. Remains 227 /232 variables (removed 5) and now considering 2614/2750 (removed 136) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 2614 rows 227 cols
[2023-03-13 14:15:14] [INFO ] Computed 9 place invariants in 26 ms
[2023-03-13 14:15:14] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 14:15:14] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-13 14:15:15] [INFO ] After 454ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 14:15:15] [INFO ] After 835ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 272 ms.
[2023-03-13 14:15:16] [INFO ] After 1151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-13 14:15:16] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-13 14:15:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 232 places, 2750 transitions and 13491 arcs took 29 ms.
[2023-03-13 14:15:16] [INFO ] Flatten gal took : 338 ms
Total runtime 23828 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: BugTracking_PT_q3
(NrP: 232 NrTr: 2750 NrArc: 13491)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.074sec

net check time: 0m 0.002sec

init dd package: 0m 3.230sec


before gc: list nodes free: 434483

after gc: idd nodes used:731, unused:63999269; list nodes free:260025013

before gc: list nodes free: 1189913

after gc: idd nodes used:731, unused:63999269; list nodes free:260025143

before gc: list nodes free: 1189913

after gc: idd nodes used:731, unused:63999269; list nodes free:260025143

before gc: list nodes free: 1189913

after gc: idd nodes used:731, unused:63999269; list nodes free:260025143

before gc: list nodes free: 1189913

after gc: idd nodes used:731, unused:63999269; list nodes free:260025143

before gc: list nodes free: 1189913

after gc: idd nodes used:731, unused:63999269; list nodes free:260025143

before gc: list nodes free: 1189913

after gc: idd nodes used:731, unused:63999269; list nodes free:260025143

before gc: list nodes free: 1189913

after gc: idd nodes used:731, unused:63999269; list nodes free:260025143

before gc: list nodes free: 1189913

after gc: idd nodes used:731, unused:63999269; list nodes free:260025143
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6630804 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16082648 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 ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.045sec

501 501 501 488 488 488 488 501 501 501 488 488 488 488 501 501 501 488 488 488 488 501 501 501 488 488 488 488 501 501 501 488 488 488 488 501 501 501 488 488 488 488 501 501 501 488 488 488 488 501 501 501 488 488 488 488 501 501 501 488 488 488 488 501 501 501 488 488 488 488 501 501 501 488 488 488 488 501 501 501 488 488 488 488 501 501 501 488 488 488 488 501 501 501 488 488 488 488 501 501 501 488 488 488 488 501 501 501 488 488 488 488 501 501 501 488 488 488 488 501 501 501 488 488 488 488 501 501 501 488 488 488 488 501 501 501

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="BugTracking-PT-q3m128"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is BugTracking-PT-q3m128, 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 r042-tajo-167813695700374"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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