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-167903717500103.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 ShieldIIPs-PT-020A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717500103
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.7K Feb 25 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 16:41 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 3.5K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 16:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 16:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 25 16:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 169K 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 ShieldIIPs-PT-020A-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679489822477

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=ShieldIIPs-PT-020A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 12:57:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 12:57:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 12:57:04] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2023-03-22 12:57:04] [INFO ] Transformed 503 places.
[2023-03-22 12:57:04] [INFO ] Transformed 483 transitions.
[2023-03-22 12:57:04] [INFO ] Found NUPN structural information;
[2023-03-22 12:57:04] [INFO ] Parsed PT model containing 503 places and 483 transitions and 2166 arcs in 163 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 9 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 16) seen :14
FORMULA ShieldIIPs-PT-020A-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020A-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020A-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020A-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020A-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020A-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 483 rows 503 cols
[2023-03-22 12:57:05] [INFO ] Computed 181 place invariants in 25 ms
[2023-03-22 12:57:05] [INFO ] After 389ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 12:57:05] [INFO ] [Nat]Absence check using 181 positive place invariants in 31 ms returned sat
[2023-03-22 12:57:06] [INFO ] After 490ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-22 12:57:06] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 12 ms to minimize.
[2023-03-22 12:57:06] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2023-03-22 12:57:07] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2023-03-22 12:57:07] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2023-03-22 12:57:07] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2023-03-22 12:57:07] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2023-03-22 12:57:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 809 ms
[2023-03-22 12:57:07] [INFO ] After 1505ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 207 ms.
[2023-03-22 12:57:07] [INFO ] After 1972ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA ShieldIIPs-PT-020A-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 99 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 483/483 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 503 transition count 482
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 482
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 102 place count 502 transition count 482
Applied a total of 102 rules in 91 ms. Remains 502 /503 variables (removed 1) and now considering 482/483 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 502/503 places, 482/483 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 418022 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :{}
Probabilistic random walk after 418022 steps, saw 167000 distinct states, run finished after 3004 ms. (steps per millisecond=139 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 482 rows 502 cols
[2023-03-22 12:57:10] [INFO ] Computed 181 place invariants in 17 ms
[2023-03-22 12:57:11] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 12:57:11] [INFO ] [Nat]Absence check using 179 positive place invariants in 61 ms returned sat
[2023-03-22 12:57:11] [INFO ] [Nat]Absence check using 179 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-22 12:57:11] [INFO ] After 441ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 12:57:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 12:57:12] [INFO ] After 253ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 12:57:12] [INFO ] After 556ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 257 ms.
[2023-03-22 12:57:12] [INFO ] After 1479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 99 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 482/482 transitions.
Applied a total of 0 rules in 19 ms. Remains 502 /502 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 502/502 places, 482/482 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 482/482 transitions.
Applied a total of 0 rules in 19 ms. Remains 502 /502 variables (removed 0) and now considering 482/482 (removed 0) transitions.
[2023-03-22 12:57:12] [INFO ] Invariant cache hit.
[2023-03-22 12:57:12] [INFO ] Implicit Places using invariants in 342 ms returned [487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 345 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 501/502 places, 482/482 transitions.
Applied a total of 0 rules in 12 ms. Remains 501 /501 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 376 ms. Remains : 501/502 places, 482/482 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 471525 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :{}
Probabilistic random walk after 471525 steps, saw 175372 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 482 rows 501 cols
[2023-03-22 12:57:16] [INFO ] Computed 180 place invariants in 5 ms
[2023-03-22 12:57:16] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 12:57:16] [INFO ] [Nat]Absence check using 178 positive place invariants in 87 ms returned sat
[2023-03-22 12:57:16] [INFO ] [Nat]Absence check using 178 positive and 2 generalized place invariants in 22 ms returned sat
[2023-03-22 12:57:17] [INFO ] After 551ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 12:57:17] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 2 ms to minimize.
[2023-03-22 12:57:17] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2023-03-22 12:57:17] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2023-03-22 12:57:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 345 ms
[2023-03-22 12:57:17] [INFO ] After 1171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 380 ms.
[2023-03-22 12:57:18] [INFO ] After 1785ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 26 ms.
Support contains 99 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 482/482 transitions.
Applied a total of 0 rules in 27 ms. Remains 501 /501 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 501/501 places, 482/482 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 482/482 transitions.
Applied a total of 0 rules in 18 ms. Remains 501 /501 variables (removed 0) and now considering 482/482 (removed 0) transitions.
[2023-03-22 12:57:18] [INFO ] Invariant cache hit.
[2023-03-22 12:57:18] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-22 12:57:18] [INFO ] Invariant cache hit.
[2023-03-22 12:57:19] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 1197 ms to find 0 implicit places.
[2023-03-22 12:57:19] [INFO ] Redundant transitions in 75 ms returned []
[2023-03-22 12:57:19] [INFO ] Invariant cache hit.
[2023-03-22 12:57:19] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1628 ms. Remains : 501/501 places, 482/482 transitions.
Applied a total of 0 rules in 11 ms. Remains 501 /501 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 12:57:19] [INFO ] Invariant cache hit.
[2023-03-22 12:57:19] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 12:57:20] [INFO ] [Nat]Absence check using 178 positive place invariants in 29 ms returned sat
[2023-03-22 12:57:20] [INFO ] [Nat]Absence check using 178 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-22 12:57:20] [INFO ] After 516ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 12:57:20] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2023-03-22 12:57:20] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2023-03-22 12:57:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2023-03-22 12:57:21] [INFO ] After 957ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 249 ms.
[2023-03-22 12:57:21] [INFO ] After 1425ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 12:57:21] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2023-03-22 12:57:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 501 places, 482 transitions and 2371 arcs took 9 ms.
[2023-03-22 12:57:21] [INFO ] Flatten gal took : 107 ms
Total runtime 17320 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: ShieldIIPs_PT_020A
(NrP: 501 NrTr: 482 NrArc: 2371)

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

net check time: 0m 0.000sec

init dd package: 0m 2.866sec


before gc: list nodes free: 2009445

after gc: idd nodes used:314368, unused:63685632; list nodes free:287936344

before gc: list nodes free: 854611

after gc: idd nodes used:405884, unused:63594116; list nodes free:289616084

before gc: list nodes free: 500388

after gc: idd nodes used:418618, unused:63581382; list nodes free:289557307

before gc: list nodes free: 2448046

after gc: idd nodes used:434417, unused:63565583; list nodes free:289481502

before gc: list nodes free: 1660211

after gc: idd nodes used:535437, unused:63464563; list nodes free:291118190

before gc: list nodes free: 1902917

after gc: idd nodes used:617582, unused:63382418; list nodes free:290733032

before gc: list nodes free: 2271480

after gc: idd nodes used:595026, unused:63404974; list nodes free:290844157

before gc: list nodes free: 1362185

after gc: idd nodes used:678693, unused:63321307; list nodes free:290451114

before gc: list nodes free: 3405534

after gc: idd nodes used:623555, unused:63376445; list nodes free:290712966
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6029920 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16098084 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:
++ 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.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.001sec

51122 154349 165011 213645 231102 259931 263968 300801 333982 352540 382093 407048 399220 387632 395606 394558 410619 412891 407792 406115 403738 391539 416264 456420 403450 411750 412792 436338 459316 480437 514989 527616 541134 500427 512214 521631 527130 538723 552599 602413 559510 553681 599382 599898 586126 590642 608269 580554 604009 617372 612464 639521 597165 586850 654362 621781 610569 1327585

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="ShieldIIPs-PT-020A"
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 ShieldIIPs-PT-020A, 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-167903717500103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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