About the Execution of Marcie+red for ShieldPPPs-PT-030A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
10126.315 | 3600000.00 | 3682296.00 | 181.20 | TFFTTTTFFF?FF?FF | 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.r394-oct2-167903717900471.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 marciexred
Input is ShieldPPPs-PT-030A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717900471
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 7.4K Feb 26 01:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 01:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 01:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 26 02:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 02:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 02:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 265K 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 ShieldPPPs-PT-030A-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1679516762430
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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-030A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 20:26:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 20:26:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 20:26:06] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2023-03-22 20:26:06] [INFO ] Transformed 933 places.
[2023-03-22 20:26:06] [INFO ] Transformed 783 transitions.
[2023-03-22 20:26:06] [INFO ] Found NUPN structural information;
[2023-03-22 20:26:06] [INFO ] Parsed PT model containing 933 places and 783 transitions and 3006 arcs in 348 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 4 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 16) seen :14
FORMULA ShieldPPPs-PT-030A-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 783 rows 933 cols
[2023-03-22 20:26:07] [INFO ] Computed 331 place invariants in 41 ms
[2023-03-22 20:26:08] [INFO ] After 826ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 20:26:08] [INFO ] [Nat]Absence check using 331 positive place invariants in 221 ms returned sat
[2023-03-22 20:26:10] [INFO ] After 1187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 20:26:10] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 7 ms to minimize.
[2023-03-22 20:26:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 298 ms
[2023-03-22 20:26:11] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 1 ms to minimize.
[2023-03-22 20:26:11] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 29 ms to minimize.
[2023-03-22 20:26:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 492 ms
[2023-03-22 20:26:11] [INFO ] After 2622ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 746 ms.
[2023-03-22 20:26:12] [INFO ] After 4079ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 139 ms.
Support contains 81 out of 933 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 933/933 places, 783/783 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 4 place count 931 transition count 781
Partial Free-agglomeration rule applied 229 times.
Drop transitions removed 229 transitions
Iterating global reduction 0 with 229 rules applied. Total rules applied 233 place count 931 transition count 781
Applied a total of 233 rules in 215 ms. Remains 931 /933 variables (removed 2) and now considering 781/783 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 931/933 places, 781/783 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 124700 steps, run timeout after 3010 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 124700 steps, saw 116082 distinct states, run finished after 3014 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 781 rows 931 cols
[2023-03-22 20:26:16] [INFO ] Computed 331 place invariants in 46 ms
[2023-03-22 20:26:16] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 20:26:17] [INFO ] [Nat]Absence check using 316 positive place invariants in 387 ms returned sat
[2023-03-22 20:26:17] [INFO ] [Nat]Absence check using 316 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-22 20:26:20] [INFO ] After 3043ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 20:26:21] [INFO ] Deduced a trap composed of 5 places in 335 ms of which 38 ms to minimize.
[2023-03-22 20:26:22] [INFO ] Deduced a trap composed of 7 places in 380 ms of which 0 ms to minimize.
[2023-03-22 20:26:22] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 10 ms to minimize.
[2023-03-22 20:26:23] [INFO ] Deduced a trap composed of 7 places in 649 ms of which 1 ms to minimize.
[2023-03-22 20:26:23] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
[2023-03-22 20:26:23] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2023-03-22 20:26:24] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 0 ms to minimize.
[2023-03-22 20:26:24] [INFO ] Deduced a trap composed of 7 places in 303 ms of which 1 ms to minimize.
[2023-03-22 20:26:24] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
[2023-03-22 20:26:25] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 1 ms to minimize.
[2023-03-22 20:26:25] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 1 ms to minimize.
[2023-03-22 20:26:25] [INFO ] Deduced a trap composed of 12 places in 187 ms of which 1 ms to minimize.
[2023-03-22 20:26:25] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 0 ms to minimize.
[2023-03-22 20:26:26] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4584 ms
[2023-03-22 20:26:35] [INFO ] After 18066ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2006 ms.
[2023-03-22 20:26:37] [INFO ] After 20754ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 153 ms.
Support contains 81 out of 931 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 43 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 931/931 places, 781/781 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 70 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
[2023-03-22 20:26:37] [INFO ] Invariant cache hit.
[2023-03-22 20:26:38] [INFO ] Implicit Places using invariants in 1280 ms returned []
[2023-03-22 20:26:38] [INFO ] Invariant cache hit.
[2023-03-22 20:26:40] [INFO ] Implicit Places using invariants and state equation in 1793 ms returned []
Implicit Place search using SMT with State Equation took 3076 ms to find 0 implicit places.
[2023-03-22 20:26:40] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-22 20:26:40] [INFO ] Invariant cache hit.
[2023-03-22 20:26:41] [INFO ] Dead Transitions using invariants and state equation in 959 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4208 ms. Remains : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 30 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-22 20:26:41] [INFO ] Invariant cache hit.
[2023-03-22 20:26:41] [INFO ] After 283ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 20:26:42] [INFO ] [Nat]Absence check using 316 positive place invariants in 57 ms returned sat
[2023-03-22 20:26:42] [INFO ] [Nat]Absence check using 316 positive and 15 generalized place invariants in 14 ms returned sat
[2023-03-22 20:26:48] [INFO ] After 6272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 20:26:49] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 1 ms to minimize.
[2023-03-22 20:26:50] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 1 ms to minimize.
[2023-03-22 20:26:51] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 1 ms to minimize.
[2023-03-22 20:26:52] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2023-03-22 20:26:52] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 18 ms to minimize.
[2023-03-22 20:26:52] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 1 ms to minimize.
[2023-03-22 20:26:53] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 1 ms to minimize.
[2023-03-22 20:26:53] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 1 ms to minimize.
[2023-03-22 20:27:02] [INFO ] Trap strengthening (SAT) tested/added 8/8 trap constraints in 12847 ms
[2023-03-22 20:27:05] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2023-03-22 20:27:05] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 1 ms to minimize.
[2023-03-22 20:27:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 869 ms
[2023-03-22 20:27:06] [INFO ] After 23869ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9023 ms.
[2023-03-22 20:27:15] [INFO ] After 33224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-22 20:27:15] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 18 ms.
[2023-03-22 20:27:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 931 places, 781 transitions and 3639 arcs took 14 ms.
[2023-03-22 20:27:15] [INFO ] Flatten gal took : 145 ms
Total runtime 69488 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=ReachabilityFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: ShieldPPPs_PT_030A
(NrP: 931 NrTr: 781 NrArc: 3639)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.062sec
net check time: 0m 0.000sec
init dd package: 0m 2.943sec
before gc: list nodes free: 750313
after gc: idd nodes used:450715, unused:63549285; list nodes free:285225628
before gc: list nodes free: 1085124
after gc: idd nodes used:615969, unused:63384031; list nodes free:290735188
before gc: list nodes free: 3551600
after gc: idd nodes used:1340524, unused:62659476; list nodes free:287392208
before gc: list nodes free: 6192259
after gc: idd nodes used:1403254, unused:62596746; list nodes free:287114942
before gc: list nodes free: 2421620
after gc: idd nodes used:1425669, unused:62574331; list nodes free:287009775
before gc: list nodes free: 3476701
after gc: idd nodes used:1392157, unused:62607843; list nodes free:287167734
before gc: list nodes free: 4751569
after gc: idd nodes used:1437424, unused:62562576; list nodes free:286946486
before gc: list nodes free: 695502
after gc: idd nodes used:1400797, unused:62599203; list nodes free:287127322
before gc: list nodes free: 250004
after gc: idd nodes used:1776467, unused:62223533; list nodes free:289540331
before gc: list nodes free: 991412
after gc: idd nodes used:1889456, unused:62110544; list nodes free:290890803
before gc: list nodes free: 2234401
after gc: idd nodes used:2013109, unused:61986891; list nodes free:290455140
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6029292 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16098188 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
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.003sec
354199 449867 573993 1301619 1393243 1393809 1391628 1428159 1402628 1391418 1409200 1445849 1772056 2043312
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="ShieldPPPs-PT-030A"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldPPPs-PT-030A, 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 r394-oct2-167903717900471"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-030A.tgz
mv ShieldPPPs-PT-030A 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 '
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 ;