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.r362-smll-167891812300129.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 RwMutex-PT-r0010w0100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r362-smll-167891812300129
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 6.7K Feb 25 22:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 22:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 22:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 22:48 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.7K Feb 25 16:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 25 22:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 25 22:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 22:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 22:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 183K 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 RwMutex-PT-r0010w0100-CTLCardinality-00
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-01
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-02
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-03
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-04
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-05
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-06
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-07
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-08
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-09
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-10
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-11
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-12
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-13
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-14
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678992158500

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RwMutex-PT-r0010w0100
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-16 18:42:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 18:42:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 18:42:42] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2023-03-16 18:42:42] [INFO ] Transformed 230 places.
[2023-03-16 18:42:42] [INFO ] Transformed 220 transitions.
[2023-03-16 18:42:42] [INFO ] Found NUPN structural information;
[2023-03-16 18:42:42] [INFO ] Parsed PT model containing 230 places and 220 transitions and 2460 arcs in 278 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Initial state reduction rules removed 7 formulas.
FORMULA RwMutex-PT-r0010w0100-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0100-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0100-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0100-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0100-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0100-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0100-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0100-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 68 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 220/220 transitions.
Applied a total of 0 rules in 45 ms. Remains 230 /230 variables (removed 0) and now considering 220/220 (removed 0) transitions.
// Phase 1: matrix 220 rows 230 cols
[2023-03-16 18:42:42] [INFO ] Computed 120 place invariants in 33 ms
[2023-03-16 18:42:43] [INFO ] Implicit Places using invariants in 923 ms returned [1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 12, 14, 23, 34, 45, 56, 67, 78, 89, 100, 111, 112, 123, 134, 145, 147, 148, 149, 150, 151, 152, 153, 154, 155, 158, 159, 161, 162, 163, 164, 165, 166, 168, 169, 171, 172, 173, 176, 177, 178, 179, 180, 181, 183, 184, 190, 191, 193, 195, 196, 197, 198, 199, 201, 202, 203, 204, 206, 207, 208, 210, 211, 212, 213, 214, 215, 216, 217, 220, 221, 223, 224, 225, 226, 229]
Discarding 85 places :
Implicit Place search using SMT only with invariants took 1003 ms to find 85 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/230 places, 220/220 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 96 transition count 171
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 96 transition count 171
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 147 place count 96 transition count 122
Applied a total of 147 rules in 31 ms. Remains 96 /145 variables (removed 49) and now considering 122/220 (removed 98) transitions.
// Phase 1: matrix 122 rows 96 cols
[2023-03-16 18:42:43] [INFO ] Computed 35 place invariants in 8 ms
[2023-03-16 18:42:43] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-16 18:42:43] [INFO ] Invariant cache hit.
[2023-03-16 18:42:44] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 96/230 places, 122/220 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1486 ms. Remains : 96/230 places, 122/220 transitions.
Support contains 68 out of 96 places after structural reductions.
[2023-03-16 18:42:44] [INFO ] Flatten gal took : 114 ms
[2023-03-16 18:42:44] [INFO ] Flatten gal took : 70 ms
[2023-03-16 18:42:44] [INFO ] Input system was already deterministic with 122 transitions.
Support contains 56 out of 96 places (down from 68) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 841 ms. (steps per millisecond=11 ) properties (out of 35) seen :29
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) 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 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-16 18:42:45] [INFO ] Invariant cache hit.
[2023-03-16 18:42:46] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 18:42:46] [INFO ] [Nat]Absence check using 35 positive place invariants in 22 ms returned sat
[2023-03-16 18:42:46] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 4 atomic propositions for a total of 8 simplifications.
[2023-03-16 18:42:46] [INFO ] Flatten gal took : 35 ms
[2023-03-16 18:42:46] [INFO ] Flatten gal took : 36 ms
[2023-03-16 18:42:46] [INFO ] Input system was already deterministic with 122 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 122/122 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 71 transition count 97
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 71 transition count 97
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 75 place count 71 transition count 72
Applied a total of 75 rules in 14 ms. Remains 71 /96 variables (removed 25) and now considering 72/122 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 71/96 places, 72/122 transitions.
[2023-03-16 18:42:46] [INFO ] Flatten gal took : 19 ms
[2023-03-16 18:42:46] [INFO ] Flatten gal took : 18 ms
[2023-03-16 18:42:46] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 122/122 transitions.
Graph (trivial) has 14 edges and 96 vertex of which 14 / 96 are part of one of the 7 SCC in 5 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 89 transition count 68
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 1 with 111 rules applied. Total rules applied 159 place count 22 transition count 24
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 22 transition count 23
Applied a total of 160 rules in 28 ms. Remains 22 /96 variables (removed 74) and now considering 23/122 (removed 99) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 22/96 places, 23/122 transitions.
[2023-03-16 18:42:46] [INFO ] Flatten gal took : 5 ms
[2023-03-16 18:42:46] [INFO ] Flatten gal took : 5 ms
[2023-03-16 18:42:46] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 122/122 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 70 transition count 96
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 70 transition count 96
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 78 place count 70 transition count 70
Applied a total of 78 rules in 11 ms. Remains 70 /96 variables (removed 26) and now considering 70/122 (removed 52) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 70/96 places, 70/122 transitions.
[2023-03-16 18:42:46] [INFO ] Flatten gal took : 16 ms
[2023-03-16 18:42:46] [INFO ] Flatten gal took : 16 ms
[2023-03-16 18:42:46] [INFO ] Input system was already deterministic with 70 transitions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 122/122 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 71 transition count 97
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 71 transition count 97
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 75 place count 71 transition count 72
Applied a total of 75 rules in 10 ms. Remains 71 /96 variables (removed 25) and now considering 72/122 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 71/96 places, 72/122 transitions.
[2023-03-16 18:42:46] [INFO ] Flatten gal took : 17 ms
[2023-03-16 18:42:46] [INFO ] Flatten gal took : 18 ms
[2023-03-16 18:42:46] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 122/122 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 70 transition count 96
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 70 transition count 96
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 78 place count 70 transition count 70
Applied a total of 78 rules in 7 ms. Remains 70 /96 variables (removed 26) and now considering 70/122 (removed 52) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 70/96 places, 70/122 transitions.
[2023-03-16 18:42:46] [INFO ] Flatten gal took : 14 ms
[2023-03-16 18:42:46] [INFO ] Flatten gal took : 13 ms
[2023-03-16 18:42:46] [INFO ] Input system was already deterministic with 70 transitions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 122/122 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 73 transition count 99
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 73 transition count 99
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 69 place count 73 transition count 76
Applied a total of 69 rules in 6 ms. Remains 73 /96 variables (removed 23) and now considering 76/122 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 73/96 places, 76/122 transitions.
[2023-03-16 18:42:46] [INFO ] Flatten gal took : 13 ms
[2023-03-16 18:42:46] [INFO ] Flatten gal took : 13 ms
[2023-03-16 18:42:46] [INFO ] Input system was already deterministic with 76 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 122/122 transitions.
Graph (trivial) has 14 edges and 96 vertex of which 14 / 96 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 89 transition count 62
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 1 with 127 rules applied. Total rules applied 181 place count 11 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 11 transition count 12
Applied a total of 182 rules in 10 ms. Remains 11 /96 variables (removed 85) and now considering 12/122 (removed 110) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 11/96 places, 12/122 transitions.
[2023-03-16 18:42:46] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:42:46] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:42:46] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 122/122 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 68 transition count 94
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 68 transition count 94
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 84 place count 68 transition count 66
Applied a total of 84 rules in 5 ms. Remains 68 /96 variables (removed 28) and now considering 66/122 (removed 56) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 68/96 places, 66/122 transitions.
[2023-03-16 18:42:46] [INFO ] Flatten gal took : 10 ms
[2023-03-16 18:42:46] [INFO ] Flatten gal took : 10 ms
[2023-03-16 18:42:46] [INFO ] Input system was already deterministic with 66 transitions.
[2023-03-16 18:42:46] [INFO ] Flatten gal took : 21 ms
[2023-03-16 18:42:46] [INFO ] Flatten gal took : 25 ms
[2023-03-16 18:42:46] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-16 18:42:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 96 places, 122 transitions and 1212 arcs took 3 ms.
Total runtime 4729 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 96 NrTr: 122 NrArc: 1212)

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

net check time: 0m 0.000sec

init dd package: 0m 3.789sec


RS generation: 0m 0.128sec


-> reachability set: #nodes 12724 (1.3e+04) #states 1,075 (3)



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

checking: EF [EX [AX [1<=0]]]
normalized: E [true U EX [~ [EX [~ [1<=0]]]]]

abstracting: (1<=0)
states: 0
..-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0100-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.126sec

checking: AF [[p35<=1 & 1<=p35]]
normalized: ~ [EG [~ [[p35<=1 & 1<=p35]]]]

abstracting: (1<=p35)
states: 1
abstracting: (p35<=1)
states: 1,075 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0100-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [AX [EF [[[0<=p55 & p55<=0] | [[p38<=1 & 1<=p38] | [[p85<=0 & 0<=p85] & [p62<=1 & 1<=p62]]]]]]]
normalized: E [true U ~ [EX [~ [E [true U [[[[p62<=1 & 1<=p62] & [p85<=0 & 0<=p85]] | [p38<=1 & 1<=p38]] | [0<=p55 & p55<=0]]]]]]]

abstracting: (p55<=0)
states: 1,074 (3)
abstracting: (0<=p55)
states: 1,075 (3)
abstracting: (1<=p38)
states: 1
abstracting: (p38<=1)
states: 1,075 (3)
abstracting: (0<=p85)
states: 1,075 (3)
abstracting: (p85<=0)
states: 1
abstracting: (1<=p62)
states: 1
abstracting: (p62<=1)
states: 1,075 (3)
.-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0100-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: AG [AX [[[[p51<=0 & 0<=p51] | [p71<=1 & 1<=p71]] & [[p80<=0 & 0<=p80] | [[p92<=1 & 1<=p92] | [[p65<=0 & 0<=p65] & [p71<=1 & 1<=p71]]]]]]]
normalized: ~ [E [true U EX [~ [[[[[[p71<=1 & 1<=p71] & [p65<=0 & 0<=p65]] | [p92<=1 & 1<=p92]] | [p80<=0 & 0<=p80]] & [[p71<=1 & 1<=p71] | [p51<=0 & 0<=p51]]]]]]]

abstracting: (0<=p51)
states: 1,075 (3)
abstracting: (p51<=0)
states: 1,074 (3)
abstracting: (1<=p71)
states: 1
abstracting: (p71<=1)
states: 1,075 (3)
abstracting: (0<=p80)
states: 1,075 (3)
abstracting: (p80<=0)
states: 1
abstracting: (1<=p92)
states: 563
abstracting: (p92<=1)
states: 1,075 (3)
abstracting: (0<=p65)
states: 1,075 (3)
abstracting: (p65<=0)
states: 1,074 (3)
abstracting: (1<=p71)
states: 1
abstracting: (p71<=1)
states: 1,075 (3)
.-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0100-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.067sec

checking: [AX [[AG [[[p35<=1 & 1<=p35] | [p87<=1 & 1<=p87]]] | AG [[[AX [[p72<=1 & 1<=p72]] & [p81<=0 & 0<=p81]] | [p29<=0 & 0<=p29]]]]] | EG [EX [AF [[p75<=1 & 1<=p75]]]]]
normalized: [EG [EX [~ [EG [~ [[p75<=1 & 1<=p75]]]]]] | ~ [EX [~ [[~ [E [true U ~ [[[p29<=0 & 0<=p29] | [[p81<=0 & 0<=p81] & ~ [EX [~ [[p72<=1 & 1<=p72]]]]]]]]] | ~ [E [true U ~ [[[p87<=1 & 1<=p87] | [p35<=1 & 1<=p35]]]]]]]]]]

abstracting: (1<=p35)
states: 1
abstracting: (p35<=1)
states: 1,075 (3)
abstracting: (1<=p87)
states: 1,074 (3)
abstracting: (p87<=1)
states: 1,075 (3)
abstracting: (1<=p72)
states: 1
abstracting: (p72<=1)
states: 1,075 (3)
.abstracting: (0<=p81)
states: 1,075 (3)
abstracting: (p81<=0)
states: 1
abstracting: (0<=p29)
states: 1,075 (3)
abstracting: (p29<=0)
states: 1,074 (3)
.abstracting: (1<=p75)
states: 1,074 (3)
abstracting: (p75<=1)
states: 1,075 (3)
..
EG iterations: 2
.
EG iterations: 0
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0100-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: A [[[p28<=1 & 1<=p28] | ~ [[AF [[p32<=1 & 1<=p32]] | AG [[p28<=0 & 0<=p28]]]]] U A [EG [AF [[p84<=1 & 1<=p84]]] U [A [[[p10<=0 & 0<=p10] & [p83<=1 & 1<=p83]] U ~ [[p87<=0 & 0<=p87]]] & ~ [[p76<=1 & 1<=p76]]]]]
normalized: [~ [EG [~ [[~ [EG [~ [[~ [[p76<=1 & 1<=p76]] & [~ [EG [[p87<=0 & 0<=p87]]] & ~ [E [[p87<=0 & 0<=p87] U [~ [[[p83<=1 & 1<=p83] & [p10<=0 & 0<=p10]]] & [p87<=0 & 0<=p87]]]]]]]]] & ~ [E [~ [[~ [[p76<=1 & 1<=p76]] & [~ [EG [[p87<=0 & 0<=p87]]] & ~ [E [[p87<=0 & 0<=p87] U [~ [[[p83<=1 & 1<=p83] & [p10<=0 & 0<=p10]]] & [p87<=0 & 0<=p87]]]]]]] U [~ [EG [~ [EG [~ [[p84<=1 & 1<=p84]]]]]] & ~ [[~ [[p76<=1 & 1<=p76]] & [~ [EG [[p87<=0 & 0<=p87]]] & ~ [E [[p87<=0 & 0<=p87] U [~ [[[p83<=1 & 1<=p83] & [p10<=0 & 0<=p10]]] & [p87<=0 & 0<=p87]]]]]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[~ [[p76<=1 & 1<=p76]] & [~ [EG [[p87<=0 & 0<=p87]]] & ~ [E [[p87<=0 & 0<=p87] U [~ [[[p83<=1 & 1<=p83] & [p10<=0 & 0<=p10]]] & [p87<=0 & 0<=p87]]]]]]]]] & ~ [E [~ [[~ [[p76<=1 & 1<=p76]] & [~ [EG [[p87<=0 & 0<=p87]]] & ~ [E [[p87<=0 & 0<=p87] U [~ [[[p83<=1 & 1<=p83] & [p10<=0 & 0<=p10]]] & [p87<=0 & 0<=p87]]]]]]] U [~ [EG [~ [EG [~ [[p84<=1 & 1<=p84]]]]]] & ~ [[~ [[p76<=1 & 1<=p76]] & [~ [EG [[p87<=0 & 0<=p87]]] & ~ [E [[p87<=0 & 0<=p87] U [~ [[[p83<=1 & 1<=p83] & [p10<=0 & 0<=p10]]] & [p87<=0 & 0<=p87]]]]]]]]]]]] U [~ [[~ [[~ [E [true U ~ [[p28<=0 & 0<=p28]]]] | ~ [EG [~ [[p32<=1 & 1<=p32]]]]]] | [p28<=1 & 1<=p28]]] & ~ [[~ [EG [~ [[~ [[p76<=1 & 1<=p76]] & [~ [EG [[p87<=0 & 0<=p87]]] & ~ [E [[p87<=0 & 0<=p87] U [~ [[[p83<=1 & 1<=p83] & [p10<=0 & 0<=p10]]] & [p87<=0 & 0<=p87]]]]]]]]] & ~ [E [~ [[~ [[p76<=1 & 1<=p76]] & [~ [EG [[p87<=0 & 0<=p87]]] & ~ [E [[p87<=0 & 0<=p87] U [~ [[[p83<=1 & 1<=p83] & [p10<=0 & 0<=p10]]] & [p87<=0 & 0<=p87]]]]]]] U [~ [EG [~ [EG [~ [[p84<=1 & 1<=p84]]]]]] & ~ [[~ [[p76<=1 & 1<=p76]] & [~ [EG [[p87<=0 & 0<=p87]]] & ~ [E [[p87<=0 & 0<=p87] U [~ [[[p83<=1 & 1<=p83] & [p10<=0 & 0<=p10]]] & [p87<=0 & 0<=p87]]]]]]]]]]]]]]]]

abstracting: (0<=p87)
states: 1,075 (3)
abstracting: (p87<=0)
states: 1
abstracting: (0<=p10)
states: 1,075 (3)
abstracting: (p10<=0)
states: 563
abstracting: (1<=p83)
states: 1,074 (3)
abstracting: (p83<=1)
states: 1,075 (3)
abstracting: (0<=p87)
states: 1,075 (3)
abstracting: (p87<=0)
states: 1
abstracting: (0<=p87)
states: 1,075 (3)
abstracting: (p87<=0)
states: 1
..
EG iterations: 2
abstracting: (1<=p76)
states: 1,074 (3)
abstracting: (p76<=1)
states: 1,075 (3)
abstracting: (1<=p84)
states: 1,074 (3)
abstracting: (p84<=1)
states: 1,075 (3)
..
EG iterations: 2

EG iterations: 0
abstracting: (0<=p87)
states: 1,075 (3)
abstracting: (p87<=0)
states: 1
abstracting: (0<=p10)
states: 1,075 (3)
abstracting: (p10<=0)
states: 563
abstracting: (1<=p83)
states: 1,074 (3)
abstracting: (p83<=1)
states: 1,075 (3)
abstracting: (0<=p87)
states: 1,075 (3)
abstracting: (p87<=0)
states: 1
abstracting: (0<=p87)
states: 1,075 (3)
abstracting: (p87<=0)
states: 1
..
EG iterations: 2
abstracting: (1<=p76)
states: 1,074 (3)
abstracting: (p76<=1)
states: 1,075 (3)
abstracting: (0<=p87)
states: 1,075 (3)
abstracting: (p87<=0)
states: 1
abstracting: (0<=p10)
states: 1,075 (3)
abstracting: (p10<=0)
states: 563
abstracting: (1<=p83)
states: 1,074 (3)
abstracting: (p83<=1)
states: 1,075 (3)
abstracting: (0<=p87)
states: 1,075 (3)
abstracting: (p87<=0)
states: 1
abstracting: (0<=p87)
states: 1,075 (3)
abstracting: (p87<=0)
states: 1
..
EG iterations: 2
abstracting: (1<=p76)
states: 1,074 (3)
abstracting: (p76<=1)
states: 1,075 (3)
.
EG iterations: 1
abstracting: (1<=p28)
states: 1
abstracting: (p28<=1)
states: 1,075 (3)
abstracting: (1<=p32)
states: 1
abstracting: (p32<=1)
states: 1,075 (3)
.
EG iterations: 1
abstracting: (0<=p28)
states: 1,075 (3)
abstracting: (p28<=0)
states: 1,074 (3)
abstracting: (0<=p87)
states: 1,075 (3)
abstracting: (p87<=0)
states: 1
abstracting: (0<=p10)
states: 1,075 (3)
abstracting: (p10<=0)
states: 563
abstracting: (1<=p83)
states: 1,074 (3)
abstracting: (p83<=1)
states: 1,075 (3)
abstracting: (0<=p87)
states: 1,075 (3)
abstracting: (p87<=0)
states: 1
abstracting: (0<=p87)
states: 1,075 (3)
abstracting: (p87<=0)
states: 1
..
EG iterations: 2
abstracting: (1<=p76)
states: 1,074 (3)
abstracting: (p76<=1)
states: 1,075 (3)
abstracting: (1<=p84)
states: 1,074 (3)
abstracting: (p84<=1)
states: 1,075 (3)
..
EG iterations: 2

EG iterations: 0
abstracting: (0<=p87)
states: 1,075 (3)
abstracting: (p87<=0)
states: 1
abstracting: (0<=p10)
states: 1,075 (3)
abstracting: (p10<=0)
states: 563
abstracting: (1<=p83)
states: 1,074 (3)
abstracting: (p83<=1)
states: 1,075 (3)
abstracting: (0<=p87)
states: 1,075 (3)
abstracting: (p87<=0)
states: 1
abstracting: (0<=p87)
states: 1,075 (3)
abstracting: (p87<=0)
states: 1
..
EG iterations: 2
abstracting: (1<=p76)
states: 1,074 (3)
abstracting: (p76<=1)
states: 1,075 (3)
abstracting: (0<=p87)
states: 1,075 (3)
abstracting: (p87<=0)
states: 1
abstracting: (0<=p10)
states: 1,075 (3)
abstracting: (p10<=0)
states: 563
abstracting: (1<=p83)
states: 1,074 (3)
abstracting: (p83<=1)
states: 1,075 (3)
abstracting: (0<=p87)
states: 1,075 (3)
abstracting: (p87<=0)
states: 1
abstracting: (0<=p87)
states: 1,075 (3)
abstracting: (p87<=0)
states: 1
..
EG iterations: 2
abstracting: (1<=p76)
states: 1,074 (3)
abstracting: (p76<=1)
states: 1,075 (3)
.
EG iterations: 1
abstracting: (0<=p87)
states: 1,075 (3)
abstracting: (p87<=0)
states: 1
abstracting: (0<=p10)
states: 1,075 (3)
abstracting: (p10<=0)
states: 563
abstracting: (1<=p83)
states: 1,074 (3)
abstracting: (p83<=1)
states: 1,075 (3)
abstracting: (0<=p87)
states: 1,075 (3)
abstracting: (p87<=0)
states: 1
abstracting: (0<=p87)
states: 1,075 (3)
abstracting: (p87<=0)
states: 1
..
EG iterations: 2
abstracting: (1<=p76)
states: 1,074 (3)
abstracting: (p76<=1)
states: 1,075 (3)
abstracting: (1<=p84)
states: 1,074 (3)
abstracting: (p84<=1)
states: 1,075 (3)
..
EG iterations: 2

EG iterations: 0
abstracting: (0<=p87)
states: 1,075 (3)
abstracting: (p87<=0)
states: 1
abstracting: (0<=p10)
states: 1,075 (3)
abstracting: (p10<=0)
states: 563
abstracting: (1<=p83)
states: 1,074 (3)
abstracting: (p83<=1)
states: 1,075 (3)
abstracting: (0<=p87)
states: 1,075 (3)
abstracting: (p87<=0)
states: 1
abstracting: (0<=p87)
states: 1,075 (3)
abstracting: (p87<=0)
states: 1
..
EG iterations: 2
abstracting: (1<=p76)
states: 1,074 (3)
abstracting: (p76<=1)
states: 1,075 (3)
abstracting: (0<=p87)
states: 1,075 (3)
abstracting: (p87<=0)
states: 1
abstracting: (0<=p10)
states: 1,075 (3)
abstracting: (p10<=0)
states: 563
abstracting: (1<=p83)
states: 1,074 (3)
abstracting: (p83<=1)
states: 1,075 (3)
abstracting: (0<=p87)
states: 1,075 (3)
abstracting: (p87<=0)
states: 1
abstracting: (0<=p87)
states: 1,075 (3)
abstracting: (p87<=0)
states: 1
..
EG iterations: 2
abstracting: (1<=p76)
states: 1,074 (3)
abstracting: (p76<=1)
states: 1,075 (3)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0100-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.056sec

checking: [~ [E [[p56<=1 & 1<=p56] U ~ [[EX [[p91<=1 & 1<=p91]] & ~ [AF [[p58<=1 & 1<=p58]]]]]]] & ~ [A [[AF [[EX [[p91<=0 & 0<=p91]] & [[p94<=1 & 1<=p94] & [[p2<=0 & 0<=p2] | [p77<=1 & 1<=p77]]]]] | ~ [EG [[[p0<=0 & 0<=p0] | [p54<=1 & 1<=p54]]]]] U AG [[p73<=1 & 1<=p73]]]]]
normalized: [~ [[~ [EG [E [true U ~ [[p73<=1 & 1<=p73]]]]] & ~ [E [E [true U ~ [[p73<=1 & 1<=p73]]] U [~ [[~ [EG [[[p54<=1 & 1<=p54] | [p0<=0 & 0<=p0]]]] | ~ [EG [~ [[[[[p77<=1 & 1<=p77] | [p2<=0 & 0<=p2]] & [p94<=1 & 1<=p94]] & EX [[p91<=0 & 0<=p91]]]]]]]] & E [true U ~ [[p73<=1 & 1<=p73]]]]]]]] & ~ [E [[p56<=1 & 1<=p56] U ~ [[EG [~ [[p58<=1 & 1<=p58]]] & EX [[p91<=1 & 1<=p91]]]]]]]

abstracting: (1<=p91)
states: 1,074 (3)
abstracting: (p91<=1)
states: 1,075 (3)
.abstracting: (1<=p58)
states: 1
abstracting: (p58<=1)
states: 1,075 (3)
.
EG iterations: 1
abstracting: (1<=p56)
states: 1
abstracting: (p56<=1)
states: 1,075 (3)
abstracting: (1<=p73)
states: 1,074 (3)
abstracting: (p73<=1)
states: 1,075 (3)
abstracting: (0<=p91)
states: 1,075 (3)
abstracting: (p91<=0)
states: 1
.abstracting: (1<=p94)
states: 1,074 (3)
abstracting: (p94<=1)
states: 1,075 (3)
abstracting: (0<=p2)
states: 1,075 (3)
abstracting: (p2<=0)
states: 1
abstracting: (1<=p77)
states: 1,074 (3)
abstracting: (p77<=1)
states: 1,075 (3)
..
EG iterations: 2
abstracting: (0<=p0)
states: 1,075 (3)
abstracting: (p0<=0)
states: 1,074 (3)
abstracting: (1<=p54)
states: 1
abstracting: (p54<=1)
states: 1,075 (3)
.
EG iterations: 1
abstracting: (1<=p73)
states: 1,074 (3)
abstracting: (p73<=1)
states: 1,075 (3)
abstracting: (1<=p73)
states: 1,074 (3)
abstracting: (p73<=1)
states: 1,075 (3)

EG iterations: 0
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0100-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.062sec

checking: [EX [EX [[[[p27<=1 & 1<=p27] & [p60<=0 & 0<=p60]] & [[p78<=1 & 1<=p78] & [p20<=0 & 0<=p20]]]]] & EX [[E [~ [EX [[p90<=1 & 1<=p90]]] U EG [[[p43<=0 & 0<=p43] | [p49<=1 & 1<=p49]]]] | AG [[EX [[p26<=0 & 0<=p26]] & [[p44<=0 & 0<=p44] & [p10<=1 & 1<=p10]]]]]]]
normalized: [EX [[~ [E [true U ~ [[[[p10<=1 & 1<=p10] & [p44<=0 & 0<=p44]] & EX [[p26<=0 & 0<=p26]]]]]] | E [~ [EX [[p90<=1 & 1<=p90]]] U EG [[[p49<=1 & 1<=p49] | [p43<=0 & 0<=p43]]]]]] & EX [EX [[[[p20<=0 & 0<=p20] & [p78<=1 & 1<=p78]] & [[p60<=0 & 0<=p60] & [p27<=1 & 1<=p27]]]]]]

abstracting: (1<=p27)
states: 1
abstracting: (p27<=1)
states: 1,075 (3)
abstracting: (0<=p60)
states: 1,075 (3)
abstracting: (p60<=0)
states: 1,074 (3)
abstracting: (1<=p78)
states: 1,074 (3)
abstracting: (p78<=1)
states: 1,075 (3)
abstracting: (0<=p20)
states: 1,075 (3)
abstracting: (p20<=0)
states: 563
..abstracting: (0<=p43)
states: 1,075 (3)
abstracting: (p43<=0)
states: 1,074 (3)
abstracting: (1<=p49)
states: 1
abstracting: (p49<=1)
states: 1,075 (3)
.
EG iterations: 1
abstracting: (1<=p90)
states: 1,074 (3)
abstracting: (p90<=1)
states: 1,075 (3)
.abstracting: (0<=p26)
states: 1,075 (3)
abstracting: (p26<=0)
states: 1,074 (3)
.abstracting: (0<=p44)
states: 1,075 (3)
abstracting: (p44<=0)
states: 1,074 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,075 (3)
.-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0100-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.038sec

totally nodes used: 36778 (3.7e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 130144 1085062 1215206
used/not used/entry size/cache size: 1111905 65996959 16 1024MB
basic ops cache: hits/miss/sum: 34141 109802 143943
used/not used/entry size/cache size: 147715 16629501 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: 2159 15629 17788
used/not used/entry size/cache size: 15628 8372980 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 67072450
1 36053
2 358
3 3
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 6.053sec


BK_STOP 1678992174466

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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:3861 (31), effective:61 (0)

initing FirstDep: 0m 0.000sec


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

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

iterations count:3694 (30), effective:51 (0)

iterations count:3707 (30), effective:61 (0)

iterations count:3717 (30), effective:61 (0)

iterations count:3717 (30), effective:61 (0)

iterations count:3632 (29), effective:60 (0)

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

iterations count:3707 (30), effective:61 (0)

iterations count:3707 (30), effective:61 (0)

iterations count:3696 (30), effective:52 (0)

iterations count:3707 (30), effective:61 (0)

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

iterations count:123 (1), effective:1 (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="RwMutex-PT-r0010w0100"
export BK_EXAMINATION="CTLCardinality"
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 RwMutex-PT-r0010w0100, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r362-smll-167891812300129"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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