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.r522-tall-167987247200330.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is Murphy-PT-D1N010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247200330
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.6K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 13K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 7.6K Mar 31 16:48 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Murphy-PT-D1N010-CTLFireability-00
FORMULA_NAME Murphy-PT-D1N010-CTLFireability-01
FORMULA_NAME Murphy-PT-D1N010-CTLFireability-02
FORMULA_NAME Murphy-PT-D1N010-CTLFireability-03
FORMULA_NAME Murphy-PT-D1N010-CTLFireability-04
FORMULA_NAME Murphy-PT-D1N010-CTLFireability-05
FORMULA_NAME Murphy-PT-D1N010-CTLFireability-06
FORMULA_NAME Murphy-PT-D1N010-CTLFireability-07
FORMULA_NAME Murphy-PT-D1N010-CTLFireability-08
FORMULA_NAME Murphy-PT-D1N010-CTLFireability-09
FORMULA_NAME Murphy-PT-D1N010-CTLFireability-10
FORMULA_NAME Murphy-PT-D1N010-CTLFireability-11
FORMULA_NAME Murphy-PT-D1N010-CTLFireability-12
FORMULA_NAME Murphy-PT-D1N010-CTLFireability-13
FORMULA_NAME Murphy-PT-D1N010-CTLFireability-14
FORMULA_NAME Murphy-PT-D1N010-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1680892653949

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D1N010
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 18:37:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 18:37:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 18:37:35] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2023-04-07 18:37:35] [INFO ] Transformed 12 places.
[2023-04-07 18:37:35] [INFO ] Transformed 14 transitions.
[2023-04-07 18:37:35] [INFO ] Parsed PT model containing 12 places and 14 transitions and 54 arcs in 76 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 8 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
// Phase 1: matrix 14 rows 12 cols
[2023-04-07 18:37:35] [INFO ] Computed 3 invariants in 7 ms
[2023-04-07 18:37:35] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
[2023-04-07 18:37:35] [INFO ] Invariant cache hit.
[2023-04-07 18:37:35] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-07 18:37:35] [INFO ] Invariant cache hit.
[2023-04-07 18:37:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-07 18:37:35] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-07 18:37:35] [INFO ] Invariant cache hit.
[2023-04-07 18:37:35] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 262 ms. Remains : 12/12 places, 14/14 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-04-07 18:37:36] [INFO ] Flatten gal took : 13 ms
[2023-04-07 18:37:36] [INFO ] Flatten gal took : 5 ms
[2023-04-07 18:37:36] [INFO ] Input system was already deterministic with 14 transitions.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 31) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-04-07 18:37:36] [INFO ] Invariant cache hit.
[2023-04-07 18:37:36] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:37:36] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-07 18:37:36] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 18:37:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:37:36] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-07 18:37:36] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 18:37:36] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-07 18:37:36] [INFO ] After 19ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 18:37:36] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-04-07 18:37:36] [INFO ] After 114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 7 ms.
Support contains 7 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 3 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 18:37:36] [INFO ] Invariant cache hit.
[2023-04-07 18:37:36] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 12/12 places, 14/14 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Probably explored full state space saw : 39780 states, properties seen :0
Probabilistic random walk after 307764 steps, saw 39780 distinct states, run finished after 891 ms. (steps per millisecond=345 ) properties seen :0
Explored full state space saw : 39780 states, properties seen :0
Exhaustive walk after 307764 steps, saw 39780 distinct states, run finished after 682 ms. (steps per millisecond=451 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2023-04-07 18:37:38] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-04-07 18:37:38] [INFO ] Flatten gal took : 4 ms
FORMULA Murphy-PT-D1N010-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D1N010-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 18:37:38] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:37:38] [INFO ] Input system was already deterministic with 14 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 18:37:38] [INFO ] Invariant cache hit.
[2023-04-07 18:37:38] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 18:37:38] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:37:38] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:37:38] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 18:37:38] [INFO ] Invariant cache hit.
[2023-04-07 18:37:38] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 18:37:38] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:37:38] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:37:38] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 18:37:38] [INFO ] Invariant cache hit.
[2023-04-07 18:37:38] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 18:37:38] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:37:38] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:37:38] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 18:37:38] [INFO ] Invariant cache hit.
[2023-04-07 18:37:39] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 18:37:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:37:39] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:39] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 18:37:39] [INFO ] Invariant cache hit.
[2023-04-07 18:37:39] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 18:37:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:37:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:37:39] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 18:37:39] [INFO ] Invariant cache hit.
[2023-04-07 18:37:39] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 18:37:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:37:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:37:39] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 18:37:39] [INFO ] Invariant cache hit.
[2023-04-07 18:37:39] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 18:37:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:37:39] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:39] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 18:37:39] [INFO ] Invariant cache hit.
[2023-04-07 18:37:39] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 18:37:39] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:37:39] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 18:37:39] [INFO ] Invariant cache hit.
[2023-04-07 18:37:39] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 18:37:39] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:39] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:39] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 18:37:39] [INFO ] Invariant cache hit.
[2023-04-07 18:37:39] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 18:37:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:37:39] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:39] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 18:37:39] [INFO ] Invariant cache hit.
[2023-04-07 18:37:39] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 18:37:39] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:39] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:39] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 18:37:39] [INFO ] Invariant cache hit.
[2023-04-07 18:37:39] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 18:37:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:37:39] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:39] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 18:37:39] [INFO ] Invariant cache hit.
[2023-04-07 18:37:39] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 18:37:39] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:39] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:39] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 18:37:39] [INFO ] Invariant cache hit.
[2023-04-07 18:37:39] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 18:37:39] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:39] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:39] [INFO ] Input system was already deterministic with 14 transitions.
[2023-04-07 18:37:39] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:39] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:39] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-04-07 18:37:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 12 places, 14 transitions and 54 arcs took 1 ms.
Total runtime 4023 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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 12 NrTr: 14 NrArc: 54)

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

net check time: 0m 0.000sec

init dd package: 0m 2.760sec


RS generation: 0m 0.002sec


-> reachability set: #nodes 237 (2.4e+02) #states 39,780 (4)



starting MCC model checker
--------------------------

checking: EX [1<=p6]
normalized: EX [1<=p6]

abstracting: (1<=p6)
states: 19,890 (4)
.-> the formula is TRUE

FORMULA Murphy-PT-D1N010-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EX [EF [EG [AX [3<=p10]]]]
normalized: EX [E [true U EG [~ [EX [~ [3<=p10]]]]]]

abstracting: (3<=p10)
states: 6,630 (3)
..
EG iterations: 1
.-> the formula is FALSE

FORMULA Murphy-PT-D1N010-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [AF [[1<=p6 & [p7<=0 & [AX [1<=0] | EF [1<=p7]]]]]]
normalized: ~ [E [true U EG [~ [[[[E [true U 1<=p7] | ~ [EX [~ [1<=0]]]] & p7<=0] & 1<=p6]]]]]

abstracting: (1<=p6)
states: 19,890 (4)
abstracting: (p7<=0)
states: 19,890 (4)
abstracting: (1<=0)
states: 0
.abstracting: (1<=p7)
states: 19,890 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Murphy-PT-D1N010-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: AF [EG [E [p9<=0 U AG [[3<=p1 & [1<=p5 & 1<=p9]]]]]]
normalized: ~ [EG [~ [EG [E [p9<=0 U ~ [E [true U ~ [[[1<=p5 & 1<=p9] & 3<=p1]]]]]]]]]

abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (p9<=0)
states: 13,260 (4)
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA Murphy-PT-D1N010-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [AG [[[EX [EG [3<=p11]] & AX [p7<=0]] & [EF [[1<=p1 & 1<=p3]] & 1<=p8]]]]
normalized: E [true U ~ [E [true U ~ [[[E [true U [1<=p1 & 1<=p3]] & 1<=p8] & [~ [EX [~ [p7<=0]]] & EX [EG [3<=p11]]]]]]]]

abstracting: (3<=p11)
states: 6,630 (3)
.
EG iterations: 1
.abstracting: (p7<=0)
states: 19,890 (4)
.abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p3)
states: 35,136 (4)
abstracting: (1<=p1)
states: 35,892 (4)
-> the formula is FALSE

FORMULA Murphy-PT-D1N010-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [~ [E [EX [0<=0] U ~ [[1<=p6 | [1<=p8 & [1<=p7 & [1<=p7 | [2<=p7 & 1<=p9]]]]]]]]]
normalized: E [true U ~ [E [EX [0<=0] U ~ [[1<=p6 | [1<=p8 & [1<=p7 & [1<=p7 | [2<=p7 & 1<=p9]]]]]]]]]

abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (2<=p7)
states: 0
abstracting: (1<=p7)
states: 19,890 (4)
abstracting: (1<=p7)
states: 19,890 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p6)
states: 19,890 (4)
abstracting: (0<=0)
states: 39,780 (4)
.-> the formula is FALSE

FORMULA Murphy-PT-D1N010-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [EX [[1<=p0 & [1<=p2 & 1<=p4]]] | [AX [AX [[p1<=2 | [p5<=0 | p9<=0]]]] | AG [EX [0<=0]]]]
normalized: [[~ [E [true U ~ [EX [0<=0]]]] | ~ [EX [EX [~ [[[p5<=0 | p9<=0] | p1<=2]]]]]] | EX [[[1<=p2 & 1<=p4] & 1<=p0]]]

abstracting: (1<=p0)
states: 35,892 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (1<=p2)
states: 35,136 (4)
.abstracting: (p1<=2)
states: 12,096 (4)
abstracting: (p9<=0)
states: 13,260 (4)
abstracting: (p5<=0)
states: 3,888 (3)
..abstracting: (0<=0)
states: 39,780 (4)
.-> the formula is TRUE

FORMULA Murphy-PT-D1N010-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EX [EF [[3<=p10 | [1<=p7 | [[AF [p8<=0] & 1<=p1] & [1<=p3 & [1<=p5 & 1<=p8]]]]]]]
normalized: EX [E [true U [[[[[1<=p5 & 1<=p8] & 1<=p3] & [~ [EG [~ [p8<=0]]] & 1<=p1]] | 1<=p7] | 3<=p10]]]

abstracting: (3<=p10)
states: 6,630 (3)
abstracting: (1<=p7)
states: 19,890 (4)
abstracting: (1<=p1)
states: 35,892 (4)
abstracting: (p8<=0)
states: 13,260 (4)
.
EG iterations: 1
abstracting: (1<=p3)
states: 35,136 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
.-> the formula is TRUE

FORMULA Murphy-PT-D1N010-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AX [E [EF [[A [1<=p8 U [3<=p1 & [1<=p5 & 1<=p9]]] & ~ [A [[1<=p0 & 1<=p2] U 1<=p7]]]] U AG [1<=p9]]]
normalized: ~ [EX [~ [E [E [true U [~ [[~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [[1<=p0 & 1<=p2]] & ~ [1<=p7]]]]]] & [~ [EG [~ [[[1<=p5 & 1<=p9] & 3<=p1]]]] & ~ [E [~ [[[1<=p5 & 1<=p9] & 3<=p1]] U [~ [1<=p8] & ~ [[[1<=p5 & 1<=p9] & 3<=p1]]]]]]]] U ~ [E [true U ~ [1<=p9]]]]]]]

abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
.
EG iterations: 1
abstracting: (1<=p7)
states: 19,890 (4)
abstracting: (1<=p2)
states: 35,136 (4)
abstracting: (1<=p0)
states: 35,892 (4)
abstracting: (1<=p7)
states: 19,890 (4)
abstracting: (1<=p7)
states: 19,890 (4)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA Murphy-PT-D1N010-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [EX [[EF [[[1<=p6 & 1<=p9] | [2<=p6 & 1<=p8]]] & [~ [E [[3<=p1 & [1<=p5 & 1<=p9]] U 3<=p10]] | EG [[3<=p0 & [1<=p4 & 1<=p8]]]]]]]
normalized: E [true U EX [[[EG [[[1<=p4 & 1<=p8] & 3<=p0]] | ~ [E [[[1<=p5 & 1<=p9] & 3<=p1] U 3<=p10]]] & E [true U [[2<=p6 & 1<=p8] | [1<=p6 & 1<=p9]]]]]]

abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p6)
states: 19,890 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (2<=p6)
states: 0
abstracting: (3<=p10)
states: 6,630 (3)
abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA Murphy-PT-D1N010-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: E [AG [EF [p8<=0]] U [[~ [EG [[~ [[p0<=0 | [p2<=0 | p4<=0]]] | [EX [[1<=p1 & 1<=p3]] & ~ [[3<=p0 & [1<=p4 & 1<=p8]]]]]]] & 1<=p1] & [1<=p3 & 1<=p5]]]
normalized: E [~ [E [true U ~ [E [true U p8<=0]]]] U [[1<=p3 & 1<=p5] & [~ [EG [[[~ [[[1<=p4 & 1<=p8] & 3<=p0]] & EX [[1<=p1 & 1<=p3]]] | ~ [[[p2<=0 | p4<=0] | p0<=0]]]]] & 1<=p1]]]

abstracting: (1<=p1)
states: 35,892 (4)
abstracting: (p0<=0)
states: 3,888 (3)
abstracting: (p4<=0)
states: 3,888 (3)
abstracting: (p2<=0)
states: 4,644 (3)
abstracting: (1<=p3)
states: 35,136 (4)
abstracting: (1<=p1)
states: 35,892 (4)
.abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
.
EG iterations: 1
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (1<=p3)
states: 35,136 (4)
abstracting: (p8<=0)
states: 13,260 (4)
-> the formula is TRUE

FORMULA Murphy-PT-D1N010-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: E [~ [AX [[[~ [[[2<=p7 & 1<=p9] | [3<=p0 & [1<=p4 & 1<=p8]]]] | AX [[3<=p0 & [1<=p4 & 1<=p8]]]] & AG [AF [[1<=p0 & 1<=p2]]]]]] U E [[~ [EX [1<=p9]] | p10<=2] U [AF [p7<=0] & 1<=p7]]]
normalized: E [EX [~ [[~ [E [true U EG [~ [[1<=p0 & 1<=p2]]]]] & [~ [EX [~ [[[1<=p4 & 1<=p8] & 3<=p0]]]] | ~ [[[[1<=p4 & 1<=p8] & 3<=p0] | [2<=p7 & 1<=p9]]]]]]] U E [[~ [EX [1<=p9]] | p10<=2] U [~ [EG [~ [p7<=0]]] & 1<=p7]]]

abstracting: (1<=p7)
states: 19,890 (4)
abstracting: (p7<=0)
states: 19,890 (4)
.
EG iterations: 1
abstracting: (p10<=2)
states: 33,150 (4)
abstracting: (1<=p9)
states: 26,520 (4)
.abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (2<=p7)
states: 0
abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
.abstracting: (1<=p2)
states: 35,136 (4)
abstracting: (1<=p0)
states: 35,892 (4)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA Murphy-PT-D1N010-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: E [E [EX [0<=0] U [A [~ [AX [~ [[p0<=0 | [p2<=0 | p4<=0]]]]] U ~ [AG [[1<=p1 & [1<=p3 & 1<=p5]]]]] & ~ [E [[[2<=p6 & 1<=p8] | [3<=p1 & [1<=p5 & 1<=p9]]] U 3<=p11]]]] U [3<=p0 & [1<=p4 & 1<=p8]]]
normalized: E [E [EX [0<=0] U [~ [E [[[[1<=p5 & 1<=p9] & 3<=p1] | [2<=p6 & 1<=p8]] U 3<=p11]] & [~ [EG [~ [E [true U ~ [[[1<=p3 & 1<=p5] & 1<=p1]]]]]] & ~ [E [~ [E [true U ~ [[[1<=p3 & 1<=p5] & 1<=p1]]]] U [~ [EX [[[p2<=0 | p4<=0] | p0<=0]]] & ~ [E [true U ~ [[[1<=p3 & 1<=p5] & 1<=p1]]]]]]]]]] U [[1<=p4 & 1<=p8] & 3<=p0]]

abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (1<=p1)
states: 35,892 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (1<=p3)
states: 35,136 (4)
abstracting: (p0<=0)
states: 3,888 (3)
abstracting: (p4<=0)
states: 3,888 (3)
abstracting: (p2<=0)
states: 4,644 (3)
.abstracting: (1<=p1)
states: 35,892 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (1<=p3)
states: 35,136 (4)
abstracting: (1<=p1)
states: 35,892 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (1<=p3)
states: 35,136 (4)
.
EG iterations: 1
abstracting: (3<=p11)
states: 6,630 (3)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (2<=p6)
states: 0
abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (0<=0)
states: 39,780 (4)
.-> the formula is TRUE

FORMULA Murphy-PT-D1N010-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [AF [[p8<=0 & [p1<=0 | p3<=0]]] & [EX [[EF [[p1<=0 | [p3<=0 | p5<=0]]] & [[p7<=1 | p9<=0] & [[[2<=p7 & 1<=p9] & [2<=p6 & 1<=p8]] | [1<=p6 | [2<=p7 & 1<=p9]]]]]] & EF [[1<=p1 & [1<=p3 & 1<=p5]]]]]
normalized: [[E [true U [[1<=p3 & 1<=p5] & 1<=p1]] & EX [[[[[[2<=p7 & 1<=p9] | 1<=p6] | [[2<=p6 & 1<=p8] & [2<=p7 & 1<=p9]]] & [p7<=1 | p9<=0]] & E [true U [[p3<=0 | p5<=0] | p1<=0]]]]] & ~ [EG [~ [[[p1<=0 | p3<=0] & p8<=0]]]]]

abstracting: (p8<=0)
states: 13,260 (4)
abstracting: (p3<=0)
states: 4,644 (3)
abstracting: (p1<=0)
states: 3,888 (3)
.
EG iterations: 1
abstracting: (p1<=0)
states: 3,888 (3)
abstracting: (p5<=0)
states: 3,888 (3)
abstracting: (p3<=0)
states: 4,644 (3)
abstracting: (p9<=0)
states: 13,260 (4)
abstracting: (p7<=1)
states: 39,780 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (2<=p7)
states: 0
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (2<=p6)
states: 0
abstracting: (1<=p6)
states: 19,890 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (2<=p7)
states: 0
.abstracting: (1<=p1)
states: 35,892 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (1<=p3)
states: 35,136 (4)
-> the formula is FALSE

FORMULA Murphy-PT-D1N010-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 10042 (1.0e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 31632 19966 51598
used/not used/entry size/cache size: 27239 67081625 16 1024MB
basic ops cache: hits/miss/sum: 13542 10235 23777
used/not used/entry size/cache size: 19391 16757825 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 1688 776 2464
used/not used/entry size/cache size: 776 8387832 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67099341
1 9176
2 260
3 57
4 15
5 6
6 1
7 1
8 2
9 0
>= 10 5

Total processing time: 0m 4.385sec


BK_STOP 1680892664988

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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


iterations count:277 (19), effective:98 (7)

initing FirstDep: 0m 0.000sec


iterations count:25 (1), effective:3 (0)

iterations count:18 (1), effective:1 (0)

iterations count:131 (9), effective:19 (1)

iterations count:44 (3), effective:7 (0)

iterations count:22 (1), effective:2 (0)

iterations count:26 (1), effective:3 (0)

iterations count:26 (1), effective:3 (0)

iterations count:22 (1), effective:2 (0)

iterations count:22 (1), effective:2 (0)

iterations count:33 (2), effective:19 (1)

iterations count:57 (4), effective:15 (1)

iterations count:32 (2), effective:5 (0)

iterations count:26 (1), effective:3 (0)

iterations count:63 (4), effective:15 (1)

iterations count:22 (1), effective:2 (0)

iterations count:75 (5), effective:28 (2)

iterations count:33 (2), effective:19 (1)

iterations count:44 (3), effective:10 (0)

iterations count:44 (3), effective:10 (0)

iterations count:44 (3), effective:10 (0)

iterations count:26 (1), effective:3 (0)

iterations count:134 (9), effective:20 (1)

iterations count:42 (3), effective:8 (0)

iterations count:44 (3), effective:10 (0)

iterations count:44 (3), effective:7 (0)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Murphy-PT-D1N010"
export BK_EXAMINATION="CTLFireability"
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 Murphy-PT-D1N010, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r522-tall-167987247200330"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-PT-D1N010.tgz
mv Murphy-PT-D1N010 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;