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.r330-tall-167889203300473.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 Referendum-PT-0015, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203300473
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 19K Feb 26 17:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 26 17:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 26 17:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Feb 26 17:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 172K Feb 26 17:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 25K Feb 26 17:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 209K Feb 26 17:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 18K 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 Referendum-PT-0015-CTLCardinality-00
FORMULA_NAME Referendum-PT-0015-CTLCardinality-01
FORMULA_NAME Referendum-PT-0015-CTLCardinality-02
FORMULA_NAME Referendum-PT-0015-CTLCardinality-03
FORMULA_NAME Referendum-PT-0015-CTLCardinality-04
FORMULA_NAME Referendum-PT-0015-CTLCardinality-05
FORMULA_NAME Referendum-PT-0015-CTLCardinality-06
FORMULA_NAME Referendum-PT-0015-CTLCardinality-07
FORMULA_NAME Referendum-PT-0015-CTLCardinality-08
FORMULA_NAME Referendum-PT-0015-CTLCardinality-09
FORMULA_NAME Referendum-PT-0015-CTLCardinality-10
FORMULA_NAME Referendum-PT-0015-CTLCardinality-11
FORMULA_NAME Referendum-PT-0015-CTLCardinality-12
FORMULA_NAME Referendum-PT-0015-CTLCardinality-13
FORMULA_NAME Referendum-PT-0015-CTLCardinality-14
FORMULA_NAME Referendum-PT-0015-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679164258080

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=Referendum-PT-0015
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 18:30:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 18:30:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 18:30:59] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2023-03-18 18:30:59] [INFO ] Transformed 46 places.
[2023-03-18 18:30:59] [INFO ] Transformed 31 transitions.
[2023-03-18 18:30:59] [INFO ] Found NUPN structural information;
[2023-03-18 18:30:59] [INFO ] Parsed PT model containing 46 places and 31 transitions and 76 arcs in 88 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Referendum-PT-0015-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Applied a total of 0 rules in 7 ms. Remains 46 /46 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 46 cols
[2023-03-18 18:31:00] [INFO ] Computed 15 place invariants in 8 ms
[2023-03-18 18:31:00] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-18 18:31:00] [INFO ] Invariant cache hit.
[2023-03-18 18:31:00] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2023-03-18 18:31:00] [INFO ] Invariant cache hit.
[2023-03-18 18:31:00] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 290 ms. Remains : 46/46 places, 31/31 transitions.
Support contains 46 out of 46 places after structural reductions.
[2023-03-18 18:31:00] [INFO ] Flatten gal took : 17 ms
[2023-03-18 18:31:00] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Referendum-PT-0015-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 18:31:00] [INFO ] Flatten gal took : 6 ms
[2023-03-18 18:31:00] [INFO ] Input system was already deterministic with 31 transitions.
Incomplete random walk after 10000 steps, including 588 resets, run finished after 619 ms. (steps per millisecond=16 ) properties (out of 52) seen :40
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-18 18:31:01] [INFO ] Invariant cache hit.
[2023-03-18 18:31:01] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :12 sat :0
Fused 12 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 12 atomic propositions for a total of 14 simplifications.
FORMULA Referendum-PT-0015-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 18:31:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-18 18:31:01] [INFO ] Flatten gal took : 4 ms
FORMULA Referendum-PT-0015-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 18:31:01] [INFO ] Flatten gal took : 3 ms
[2023-03-18 18:31:01] [INFO ] Input system was already deterministic with 31 transitions.
Computed a total of 46 stabilizing places and 31 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 46 transition count 31
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA Referendum-PT-0015-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in SI_CTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Applied a total of 0 rules in 4 ms. Remains 46 /46 variables (removed 0) and now considering 31/31 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 46/46 places, 31/31 transitions.
[2023-03-18 18:31:01] [INFO ] Flatten gal took : 2 ms
[2023-03-18 18:31:01] [INFO ] Flatten gal took : 2 ms
[2023-03-18 18:31:01] [INFO ] Input system was already deterministic with 31 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 31 transition count 31
Applied a total of 15 rules in 1 ms. Remains 31 /46 variables (removed 15) and now considering 31/31 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/46 places, 31/31 transitions.
[2023-03-18 18:31:01] [INFO ] Flatten gal took : 2 ms
[2023-03-18 18:31:01] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:31:01] [INFO ] Input system was already deterministic with 31 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Graph (complete) has 45 edges and 46 vertex of which 31 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 0 output transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 31
Applied a total of 2 rules in 6 ms. Remains 31 /46 variables (removed 15) and now considering 31/31 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 31/46 places, 31/31 transitions.
[2023-03-18 18:31:01] [INFO ] Flatten gal took : 2 ms
[2023-03-18 18:31:01] [INFO ] Flatten gal took : 2 ms
[2023-03-18 18:31:01] [INFO ] Input system was already deterministic with 31 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Graph (complete) has 45 edges and 46 vertex of which 2 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.0 ms
Discarding 44 places :
Also discarding 28 output transitions
Drop transitions removed 28 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2 transition count 2
Applied a total of 2 rules in 1 ms. Remains 2 /46 variables (removed 44) and now considering 2/31 (removed 29) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 2/46 places, 2/31 transitions.
[2023-03-18 18:31:01] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:31:01] [INFO ] Flatten gal took : 0 ms
[2023-03-18 18:31:01] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Graph (complete) has 45 edges and 46 vertex of which 6 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Discarding 40 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6 transition count 6
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 6 transition count 6
Applied a total of 3 rules in 1 ms. Remains 6 /46 variables (removed 40) and now considering 6/31 (removed 25) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 6/46 places, 6/31 transitions.
[2023-03-18 18:31:01] [INFO ] Flatten gal took : 0 ms
[2023-03-18 18:31:01] [INFO ] Flatten gal took : 0 ms
[2023-03-18 18:31:01] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 21 transition count 21
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 15 transition count 15
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 15 transition count 15
Applied a total of 47 rules in 2 ms. Remains 15 /46 variables (removed 31) and now considering 15/31 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 15/46 places, 15/31 transitions.
[2023-03-18 18:31:01] [INFO ] Flatten gal took : 0 ms
[2023-03-18 18:31:01] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:31:01] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Graph (complete) has 45 edges and 46 vertex of which 13 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.0 ms
Discarding 33 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 1 ms. Remains 12 /46 variables (removed 34) and now considering 12/31 (removed 19) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 12/46 places, 12/31 transitions.
[2023-03-18 18:31:01] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:31:01] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:31:01] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 22 transition count 21
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 15 transition count 14
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 15 transition count 14
Applied a total of 48 rules in 1 ms. Remains 15 /46 variables (removed 31) and now considering 14/31 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 15/46 places, 14/31 transitions.
[2023-03-18 18:31:01] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:31:01] [INFO ] Flatten gal took : 0 ms
[2023-03-18 18:31:01] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Graph (complete) has 45 edges and 46 vertex of which 23 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.0 ms
Discarding 23 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 23 transition count 22
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 23 transition count 22
Applied a total of 3 rules in 2 ms. Remains 23 /46 variables (removed 23) and now considering 22/31 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 23/46 places, 22/31 transitions.
[2023-03-18 18:31:01] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:31:01] [INFO ] Flatten gal took : 1 ms
[2023-03-18 18:31:01] [INFO ] Input system was already deterministic with 22 transitions.
[2023-03-18 18:31:01] [INFO ] Flatten gal took : 3 ms
[2023-03-18 18:31:01] [INFO ] Flatten gal took : 2 ms
[2023-03-18 18:31:01] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-18 18:31:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 46 places, 31 transitions and 76 arcs took 0 ms.
Total runtime 2160 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: 46 NrTr: 31 NrArc: 76)

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

net check time: 0m 0.000sec

init dd package: 0m 2.705sec


RS generation: 0m 0.006sec


-> reachability set: #nodes 1349 (1.3e+03) #states 14,348,908 (7)



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

checking: EF [AG [EF [~ [[p13<=1 & 1<=p13]]]]]
normalized: E [true U ~ [E [true U ~ [E [true U ~ [[p13<=1 & 1<=p13]]]]]]]

abstracting: (1<=p13)
states: 4,782,969 (6)
abstracting: (p13<=1)
states: 14,348,908 (7)
-> the formula is TRUE

FORMULA Referendum-PT-0015-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EG [AG [[AG [~ [[p43<=1 & 1<=p43]]] | EF [[[p14<=0 & 0<=p14] & [p26<=1 & 1<=p26]]]]]]
normalized: EG [~ [E [true U ~ [[E [true U [[p26<=1 & 1<=p26] & [p14<=0 & 0<=p14]]] | ~ [E [true U [p43<=1 & 1<=p43]]]]]]]]

abstracting: (1<=p43)
states: 4,782,969 (6)
abstracting: (p43<=1)
states: 14,348,908 (7)
abstracting: (0<=p14)
states: 14,348,908 (7)
abstracting: (p14<=0)
states: 9,565,939 (6)
abstracting: (1<=p26)
states: 4,782,969 (6)
abstracting: (p26<=1)
states: 14,348,908 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Referendum-PT-0015-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: EF [EG [AG [[[EF [[p33<=1 & 1<=p33]] & [p21<=0 & 0<=p21]] & [[p42<=1 & 1<=p42] & [[p34<=0 & 0<=p34] | [[p40<=0 & 0<=p40] | [p29<=1 & 1<=p29]]]]]]]]
normalized: E [true U EG [~ [E [true U ~ [[[[[[p29<=1 & 1<=p29] | [p40<=0 & 0<=p40]] | [p34<=0 & 0<=p34]] & [p42<=1 & 1<=p42]] & [[p21<=0 & 0<=p21] & E [true U [p33<=1 & 1<=p33]]]]]]]]]

abstracting: (1<=p33)
states: 4,782,969 (6)
abstracting: (p33<=1)
states: 14,348,908 (7)
abstracting: (0<=p21)
states: 14,348,908 (7)
abstracting: (p21<=0)
states: 9,565,939 (6)
abstracting: (1<=p42)
states: 4,782,969 (6)
abstracting: (p42<=1)
states: 14,348,908 (7)
abstracting: (0<=p34)
states: 14,348,908 (7)
abstracting: (p34<=0)
states: 9,565,939 (6)
abstracting: (0<=p40)
states: 14,348,908 (7)
abstracting: (p40<=0)
states: 9,565,939 (6)
abstracting: (1<=p29)
states: 4,782,969 (6)
abstracting: (p29<=1)
states: 14,348,908 (7)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Referendum-PT-0015-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.048sec

checking: AG [AF [EG [sum(p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p20, p19, p18, p17, p16)<=p0]]]
normalized: ~ [E [true U EG [~ [EG [sum(p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p20, p19, p18, p17, p16)<=p0]]]]]

abstracting: (sum(p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p20, p19, p18, p17, p16)<=p0)
states: 32,769 (4)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA Referendum-PT-0015-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.213sec

checking: [EF [EG [AF [[[[p29<=0 & 0<=p29] | [p30<=1 & 1<=p30]] & AG [[p20<=0 & 0<=p20]]]]]] | A [AG [[p23<=0 & 0<=p23]] U [~ [[E [AG [[p11<=0 & 0<=p11]] U ~ [[[p23<=0 & 0<=p23] | [p10<=1 & 1<=p10]]]] | ~ [EX [[[p9<=0 & 0<=p9] | [p45<=1 & 1<=p45]]]]]] | AG [[p39<=1 & 1<=p39]]]]]
normalized: [[~ [EG [~ [[~ [E [true U ~ [[p39<=1 & 1<=p39]]]] | ~ [[~ [EX [[[p45<=1 & 1<=p45] | [p9<=0 & 0<=p9]]]] | E [~ [E [true U ~ [[p11<=0 & 0<=p11]]]] U ~ [[[p10<=1 & 1<=p10] | [p23<=0 & 0<=p23]]]]]]]]]] & ~ [E [~ [[~ [E [true U ~ [[p39<=1 & 1<=p39]]]] | ~ [[~ [EX [[[p45<=1 & 1<=p45] | [p9<=0 & 0<=p9]]]] | E [~ [E [true U ~ [[p11<=0 & 0<=p11]]]] U ~ [[[p10<=1 & 1<=p10] | [p23<=0 & 0<=p23]]]]]]]] U [E [true U ~ [[p23<=0 & 0<=p23]]] & ~ [[~ [E [true U ~ [[p39<=1 & 1<=p39]]]] | ~ [[~ [EX [[[p45<=1 & 1<=p45] | [p9<=0 & 0<=p9]]]] | E [~ [E [true U ~ [[p11<=0 & 0<=p11]]]] U ~ [[[p10<=1 & 1<=p10] | [p23<=0 & 0<=p23]]]]]]]]]]]] | E [true U EG [~ [EG [~ [[~ [E [true U ~ [[p20<=0 & 0<=p20]]]] & [[p30<=1 & 1<=p30] | [p29<=0 & 0<=p29]]]]]]]]]

abstracting: (0<=p29)
states: 14,348,908 (7)
abstracting: (p29<=0)
states: 9,565,939 (6)
abstracting: (1<=p30)
states: 4,782,969 (6)
abstracting: (p30<=1)
states: 14,348,908 (7)
abstracting: (0<=p20)
states: 14,348,908 (7)
abstracting: (p20<=0)
states: 9,565,939 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (0<=p23)
states: 14,348,908 (7)
abstracting: (p23<=0)
states: 9,565,939 (6)
abstracting: (1<=p10)
states: 4,782,969 (6)
abstracting: (p10<=1)
states: 14,348,908 (7)
abstracting: (0<=p11)
states: 14,348,908 (7)
abstracting: (p11<=0)
states: 9,565,939 (6)
abstracting: (0<=p9)
states: 14,348,908 (7)
abstracting: (p9<=0)
states: 9,565,939 (6)
abstracting: (1<=p45)
states: 4,782,969 (6)
abstracting: (p45<=1)
states: 14,348,908 (7)
.abstracting: (1<=p39)
states: 4,782,969 (6)
abstracting: (p39<=1)
states: 14,348,908 (7)
abstracting: (0<=p23)
states: 14,348,908 (7)
abstracting: (p23<=0)
states: 9,565,939 (6)
abstracting: (0<=p23)
states: 14,348,908 (7)
abstracting: (p23<=0)
states: 9,565,939 (6)
abstracting: (1<=p10)
states: 4,782,969 (6)
abstracting: (p10<=1)
states: 14,348,908 (7)
abstracting: (0<=p11)
states: 14,348,908 (7)
abstracting: (p11<=0)
states: 9,565,939 (6)
abstracting: (0<=p9)
states: 14,348,908 (7)
abstracting: (p9<=0)
states: 9,565,939 (6)
abstracting: (1<=p45)
states: 4,782,969 (6)
abstracting: (p45<=1)
states: 14,348,908 (7)
.abstracting: (1<=p39)
states: 4,782,969 (6)
abstracting: (p39<=1)
states: 14,348,908 (7)
abstracting: (0<=p23)
states: 14,348,908 (7)
abstracting: (p23<=0)
states: 9,565,939 (6)
abstracting: (1<=p10)
states: 4,782,969 (6)
abstracting: (p10<=1)
states: 14,348,908 (7)
abstracting: (0<=p11)
states: 14,348,908 (7)
abstracting: (p11<=0)
states: 9,565,939 (6)
abstracting: (0<=p9)
states: 14,348,908 (7)
abstracting: (p9<=0)
states: 9,565,939 (6)
abstracting: (1<=p45)
states: 4,782,969 (6)
abstracting: (p45<=1)
states: 14,348,908 (7)
.abstracting: (1<=p39)
states: 4,782,969 (6)
abstracting: (p39<=1)
states: 14,348,908 (7)
..
EG iterations: 2
-> the formula is TRUE

FORMULA Referendum-PT-0015-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.091sec

checking: [AF [~ [[p44<=0 & 0<=p44]]] & [EX [EX [[~ [E [[p44<=0 & 0<=p44] U [p40<=0 & 0<=p40]]] | EF [[[p24<=0 & 0<=p24] & [p5<=1 & 1<=p5]]]]]] & [EG [[AX [[p1<=0 & 0<=p1]] | E [[p20<=0 & 0<=p20] U [p28<=0 & 0<=p28]]]] | EG [[AF [[p10<=1 & 1<=p10]] | [[p40<=0 & 0<=p40] | [[p6<=1 & 1<=p6] & [p3<=0 & 0<=p3]]]]]]]]
normalized: [[[EG [[[[[p3<=0 & 0<=p3] & [p6<=1 & 1<=p6]] | [p40<=0 & 0<=p40]] | ~ [EG [~ [[p10<=1 & 1<=p10]]]]]] | EG [[E [[p20<=0 & 0<=p20] U [p28<=0 & 0<=p28]] | ~ [EX [~ [[p1<=0 & 0<=p1]]]]]]] & EX [EX [[E [true U [[p5<=1 & 1<=p5] & [p24<=0 & 0<=p24]]] | ~ [E [[p44<=0 & 0<=p44] U [p40<=0 & 0<=p40]]]]]]] & ~ [EG [[p44<=0 & 0<=p44]]]]

abstracting: (0<=p44)
states: 14,348,908 (7)
abstracting: (p44<=0)
states: 9,565,939 (6)
.
EG iterations: 1
abstracting: (0<=p40)
states: 14,348,908 (7)
abstracting: (p40<=0)
states: 9,565,939 (6)
abstracting: (0<=p44)
states: 14,348,908 (7)
abstracting: (p44<=0)
states: 9,565,939 (6)
abstracting: (0<=p24)
states: 14,348,908 (7)
abstracting: (p24<=0)
states: 9,565,939 (6)
abstracting: (1<=p5)
states: 4,782,969 (6)
abstracting: (p5<=1)
states: 14,348,908 (7)
..abstracting: (0<=p1)
states: 14,348,908 (7)
abstracting: (p1<=0)
states: 9,565,939 (6)
.abstracting: (0<=p28)
states: 14,348,908 (7)
abstracting: (p28<=0)
states: 9,565,939 (6)
abstracting: (0<=p20)
states: 14,348,908 (7)
abstracting: (p20<=0)
states: 9,565,939 (6)
.
EG iterations: 1
abstracting: (1<=p10)
states: 4,782,969 (6)
abstracting: (p10<=1)
states: 14,348,908 (7)
..
EG iterations: 2
abstracting: (0<=p40)
states: 14,348,908 (7)
abstracting: (p40<=0)
states: 9,565,939 (6)
abstracting: (1<=p6)
states: 4,782,969 (6)
abstracting: (p6<=1)
states: 14,348,908 (7)
abstracting: (0<=p3)
states: 14,348,908 (7)
abstracting: (p3<=0)
states: 9,565,939 (6)
..............
EG iterations: 14
-> the formula is FALSE

FORMULA Referendum-PT-0015-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.103sec

checking: E [[EF [[AG [[[p7<=0 & 0<=p7] | [[p26<=1 & 1<=p26] | [p23<=1 & 1<=p23]]]] & [AG [[p43<=1 & 1<=p43]] | [[[[p32<=1 & 1<=p32] | [[p20<=0 & 0<=p20] | [p4<=1 & 1<=p4]]] & ~ [[[p31<=0 & 0<=p31] | [p19<=1 & 1<=p19]]]] | [[p27<=1 & 1<=p27] & [[p34<=0 & 0<=p34] | [p5<=1 & 1<=p5]]]]]]] & [p19<=1 & 1<=p19]] U ~ [[[[p1<=1 & 1<=p1] | ~ [E [AG [[p10<=1 & 1<=p10]] U AG [[p24<=0 & 0<=p24]]]]] & A [EF [[p5<=1 & 1<=p5]] U [[p40<=1 & 1<=p40] & [[p11<=0 & 0<=p11] | [p10<=1 & 1<=p10]]]]]]]
normalized: E [[[p19<=1 & 1<=p19] & E [true U [[[[[[p5<=1 & 1<=p5] | [p34<=0 & 0<=p34]] & [p27<=1 & 1<=p27]] | [~ [[[p19<=1 & 1<=p19] | [p31<=0 & 0<=p31]]] & [[[p4<=1 & 1<=p4] | [p20<=0 & 0<=p20]] | [p32<=1 & 1<=p32]]]] | ~ [E [true U ~ [[p43<=1 & 1<=p43]]]]] & ~ [E [true U ~ [[[[p23<=1 & 1<=p23] | [p26<=1 & 1<=p26]] | [p7<=0 & 0<=p7]]]]]]]] U ~ [[[~ [EG [~ [[[[p10<=1 & 1<=p10] | [p11<=0 & 0<=p11]] & [p40<=1 & 1<=p40]]]]] & ~ [E [~ [[[[p10<=1 & 1<=p10] | [p11<=0 & 0<=p11]] & [p40<=1 & 1<=p40]]] U [~ [E [true U [p5<=1 & 1<=p5]]] & ~ [[[[p10<=1 & 1<=p10] | [p11<=0 & 0<=p11]] & [p40<=1 & 1<=p40]]]]]]] & [~ [E [~ [E [true U ~ [[p10<=1 & 1<=p10]]]] U ~ [E [true U ~ [[p24<=0 & 0<=p24]]]]]] | [p1<=1 & 1<=p1]]]]]

abstracting: (1<=p1)
states: 4,782,969 (6)
abstracting: (p1<=1)
states: 14,348,908 (7)
abstracting: (0<=p24)
states: 14,348,908 (7)
abstracting: (p24<=0)
states: 9,565,939 (6)
abstracting: (1<=p10)
states: 4,782,969 (6)
abstracting: (p10<=1)
states: 14,348,908 (7)
abstracting: (1<=p40)
states: 4,782,969 (6)
abstracting: (p40<=1)
states: 14,348,908 (7)
abstracting: (0<=p11)
states: 14,348,908 (7)
abstracting: (p11<=0)
states: 9,565,939 (6)
abstracting: (1<=p10)
states: 4,782,969 (6)
abstracting: (p10<=1)
states: 14,348,908 (7)
abstracting: (1<=p5)
states: 4,782,969 (6)
abstracting: (p5<=1)
states: 14,348,908 (7)
abstracting: (1<=p40)
states: 4,782,969 (6)
abstracting: (p40<=1)
states: 14,348,908 (7)
abstracting: (0<=p11)
states: 14,348,908 (7)
abstracting: (p11<=0)
states: 9,565,939 (6)
abstracting: (1<=p10)
states: 4,782,969 (6)
abstracting: (p10<=1)
states: 14,348,908 (7)
abstracting: (1<=p40)
states: 4,782,969 (6)
abstracting: (p40<=1)
states: 14,348,908 (7)
abstracting: (0<=p11)
states: 14,348,908 (7)
abstracting: (p11<=0)
states: 9,565,939 (6)
abstracting: (1<=p10)
states: 4,782,969 (6)
abstracting: (p10<=1)
states: 14,348,908 (7)
...............
EG iterations: 15
abstracting: (0<=p7)
states: 14,348,908 (7)
abstracting: (p7<=0)
states: 9,565,939 (6)
abstracting: (1<=p26)
states: 4,782,969 (6)
abstracting: (p26<=1)
states: 14,348,908 (7)
abstracting: (1<=p23)
states: 4,782,969 (6)
abstracting: (p23<=1)
states: 14,348,908 (7)
abstracting: (1<=p43)
states: 4,782,969 (6)
abstracting: (p43<=1)
states: 14,348,908 (7)
abstracting: (1<=p32)
states: 4,782,969 (6)
abstracting: (p32<=1)
states: 14,348,908 (7)
abstracting: (0<=p20)
states: 14,348,908 (7)
abstracting: (p20<=0)
states: 9,565,939 (6)
abstracting: (1<=p4)
states: 4,782,969 (6)
abstracting: (p4<=1)
states: 14,348,908 (7)
abstracting: (0<=p31)
states: 14,348,908 (7)
abstracting: (p31<=0)
states: 9,565,939 (6)
abstracting: (1<=p19)
states: 4,782,969 (6)
abstracting: (p19<=1)
states: 14,348,908 (7)
abstracting: (1<=p27)
states: 4,782,969 (6)
abstracting: (p27<=1)
states: 14,348,908 (7)
abstracting: (0<=p34)
states: 14,348,908 (7)
abstracting: (p34<=0)
states: 9,565,939 (6)
abstracting: (1<=p5)
states: 4,782,969 (6)
abstracting: (p5<=1)
states: 14,348,908 (7)
abstracting: (1<=p19)
states: 4,782,969 (6)
abstracting: (p19<=1)
states: 14,348,908 (7)
-> the formula is TRUE

FORMULA Referendum-PT-0015-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.101sec

checking: EG [E [EF [[p0<=sum(p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p20, p19, p18, p17, p16) | 89<=sum(p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31)]] U sum(p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31)<=7]]
normalized: EG [E [E [true U [p0<=sum(p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p20, p19, p18, p17, p16) | 89<=sum(p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31)]] U sum(p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31)<=7]]

abstracting: (sum(p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31)<=7)
states: 13,082,881 (7)
abstracting: (89<=sum(p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31))
states: 0
abstracting: (p0<=sum(p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p20, p19, p18, p17, p16))
states: 14,348,907 (7)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Referendum-PT-0015-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.423sec

checking: EF [[AX [1<=0] | [~ [p0<=sum(p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31)] & [AF [13<=sum(p15, p14, p13, p12, p11, p10, p9, p8, p7, p6, p5, p4, p3, p2, p1)] & EG [[[sum(p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31)<=41 & ~ [p0<=sum(p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31)]] & sum(p15, p14, p13, p12, p11, p10, p9, p8, p7, p6, p5, p4, p3, p2, p1)<=sum(p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31)]]]]]]
normalized: E [true U [~ [EX [~ [1<=0]]] | [[~ [EG [~ [13<=sum(p15, p14, p13, p12, p11, p10, p9, p8, p7, p6, p5, p4, p3, p2, p1)]]] & EG [[sum(p15, p14, p13, p12, p11, p10, p9, p8, p7, p6, p5, p4, p3, p2, p1)<=sum(p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31) & [sum(p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31)<=41 & ~ [p0<=sum(p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31)]]]]] & ~ [p0<=sum(p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31)]]]]

abstracting: (p0<=sum(p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31))
states: 14,348,907 (7)
abstracting: (p0<=sum(p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31))
states: 14,348,907 (7)
abstracting: (sum(p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31)<=41)
states: 14,348,908 (7)
abstracting: (sum(p15, p14, p13, p12, p11, p10, p9, p8, p7, p6, p5, p4, p3, p2, p1)<=sum(p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31))
states: 8,068,258 (6)
..
EG iterations: 2
abstracting: (13<=sum(p15, p14, p13, p12, p11, p10, p9, p8, p7, p6, p5, p4, p3, p2, p1))
states: 451
..
EG iterations: 2
abstracting: (1<=0)
states: 0
.-> the formula is TRUE

FORMULA Referendum-PT-0015-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 9m16.167sec

totally nodes used: 302955 (3.0e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 563586 1423059 1986645
used/not used/entry size/cache size: 1618972 65489892 16 1024MB
basic ops cache: hits/miss/sum: 91891 231097 322988
used/not used/entry size/cache size: 428301 16348915 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 1074069496 1074069496
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 14787 35320 50107
used/not used/entry size/cache size: 35295 8353313 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 66824922
1 266825
2 15360
3 1622
4 131
5 4
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 9m21.473sec


BK_STOP 1679164824279

--------------------
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:191 (6), effective:31 (1)

initing FirstDep: 0m 0.000sec


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

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

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

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

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

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

iterations count:45 (1), effective:4 (0)

iterations count:75 (2), effective:7 (0)

iterations count:91 (2), effective:16 (0)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:71 (2), effective:6 (0)

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

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

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

iterations count:91 (2), effective:16 (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="Referendum-PT-0015"
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 Referendum-PT-0015, 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 r330-tall-167889203300473"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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