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

About the Execution of Marcie+red for ShieldIIPs-PT-003B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9163.388 3600000.00 3669144.00 155.10 TTT?TTTFTFF?TFTT 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-167903717400047.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-003B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717400047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 16:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 16:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:39 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.3K Feb 25 16:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 16:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 16:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 25 16:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 25 16:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:54 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 49K 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-003B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679484525757

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-003B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 11:28:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 11:28:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 11:28:48] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2023-03-22 11:28:48] [INFO ] Transformed 183 places.
[2023-03-22 11:28:48] [INFO ] Transformed 180 transitions.
[2023-03-22 11:28:48] [INFO ] Found NUPN structural information;
[2023-03-22 11:28:48] [INFO ] Parsed PT model containing 183 places and 180 transitions and 540 arcs in 121 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 22 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 16) seen :11
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :1
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 180 rows 183 cols
[2023-03-22 11:28:49] [INFO ] Computed 28 place invariants in 7 ms
[2023-03-22 11:28:49] [INFO ] After 307ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 11:28:49] [INFO ] [Nat]Absence check using 28 positive place invariants in 13 ms returned sat
[2023-03-22 11:28:49] [INFO ] After 279ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-22 11:28:50] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 32 ms to minimize.
[2023-03-22 11:28:50] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2023-03-22 11:28:50] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 14 ms to minimize.
[2023-03-22 11:28:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 406 ms
[2023-03-22 11:28:50] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 1 ms to minimize.
[2023-03-22 11:28:50] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2023-03-22 11:28:50] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 9 ms to minimize.
[2023-03-22 11:28:50] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2023-03-22 11:28:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 455 ms
[2023-03-22 11:28:51] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 22 ms to minimize.
[2023-03-22 11:28:51] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 15 ms to minimize.
[2023-03-22 11:28:51] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 1 ms to minimize.
[2023-03-22 11:28:51] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2023-03-22 11:28:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 480 ms
[2023-03-22 11:28:51] [INFO ] After 1792ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 209 ms.
[2023-03-22 11:28:51] [INFO ] After 2183ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 65 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 180/180 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 183 transition count 174
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 177 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 176 transition count 173
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 14 place count 176 transition count 166
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 28 place count 169 transition count 166
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 39 place count 158 transition count 155
Iterating global reduction 3 with 11 rules applied. Total rules applied 50 place count 158 transition count 155
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 50 place count 158 transition count 154
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 157 transition count 154
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 90 place count 138 transition count 135
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 138 transition count 135
Applied a total of 94 rules in 86 ms. Remains 138 /183 variables (removed 45) and now considering 135/180 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 138/183 places, 135/180 transitions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1122176 steps, run timeout after 3001 ms. (steps per millisecond=373 ) properties seen :{}
Probabilistic random walk after 1122176 steps, saw 171454 distinct states, run finished after 3003 ms. (steps per millisecond=373 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 135 rows 138 cols
[2023-03-22 11:28:55] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-22 11:28:55] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 11:28:55] [INFO ] [Nat]Absence check using 28 positive place invariants in 20 ms returned sat
[2023-03-22 11:28:55] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 11:28:55] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2023-03-22 11:28:55] [INFO ] Deduced a trap composed of 18 places in 259 ms of which 1 ms to minimize.
[2023-03-22 11:28:55] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 0 ms to minimize.
[2023-03-22 11:28:55] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2023-03-22 11:28:56] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2023-03-22 11:28:56] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2023-03-22 11:28:56] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2023-03-22 11:28:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 883 ms
[2023-03-22 11:28:56] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
[2023-03-22 11:28:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-03-22 11:28:56] [INFO ] After 1249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-22 11:28:56] [INFO ] After 1468ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 65 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 135/135 transitions.
Applied a total of 0 rules in 10 ms. Remains 138 /138 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 138/138 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 135/135 transitions.
Applied a total of 0 rules in 10 ms. Remains 138 /138 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2023-03-22 11:28:56] [INFO ] Invariant cache hit.
[2023-03-22 11:28:56] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-22 11:28:56] [INFO ] Invariant cache hit.
[2023-03-22 11:28:56] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2023-03-22 11:28:56] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-22 11:28:56] [INFO ] Invariant cache hit.
[2023-03-22 11:28:57] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 499 ms. Remains : 138/138 places, 135/135 transitions.
Applied a total of 0 rules in 4 ms. Remains 138 /138 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-22 11:28:57] [INFO ] Invariant cache hit.
[2023-03-22 11:28:57] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 11:28:57] [INFO ] [Nat]Absence check using 28 positive place invariants in 9 ms returned sat
[2023-03-22 11:28:57] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 11:28:57] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2023-03-22 11:28:57] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 0 ms to minimize.
[2023-03-22 11:28:57] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 1 ms to minimize.
[2023-03-22 11:28:57] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 0 ms to minimize.
[2023-03-22 11:28:58] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 0 ms to minimize.
[2023-03-22 11:28:58] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2023-03-22 11:28:58] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 0 ms to minimize.
[2023-03-22 11:28:58] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2023-03-22 11:28:58] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 1 ms to minimize.
[2023-03-22 11:28:58] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 1 ms to minimize.
[2023-03-22 11:28:58] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2023-03-22 11:28:58] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 0 ms to minimize.
[2023-03-22 11:28:58] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1507 ms
[2023-03-22 11:28:59] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 1 ms to minimize.
[2023-03-22 11:28:59] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 13 ms to minimize.
[2023-03-22 11:28:59] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2023-03-22 11:28:59] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2023-03-22 11:28:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 408 ms
[2023-03-22 11:28:59] [INFO ] After 2132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 146 ms.
[2023-03-22 11:28:59] [INFO ] After 2352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-22 11:28:59] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-22 11:28:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 138 places, 135 transitions and 456 arcs took 3 ms.
[2023-03-22 11:28:59] [INFO ] Flatten gal took : 54 ms
Total runtime 11557 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_003B
(NrP: 138 NrTr: 135 NrArc: 456)

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

net check time: 0m 0.000sec

init dd package: 0m 2.845sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 6987640 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16101324 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
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.000sec

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-003B"
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-003B, 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-167903717400047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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