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.r490-tall-167912708800513.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 TCPcondis-PT-15, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708800513
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.9K Feb 26 16:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 16:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 16:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 16:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 16:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Feb 26 16:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 16:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 26 16:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 24K 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 TCPcondis-PT-15-CTLCardinality-00
FORMULA_NAME TCPcondis-PT-15-CTLCardinality-01
FORMULA_NAME TCPcondis-PT-15-CTLCardinality-02
FORMULA_NAME TCPcondis-PT-15-CTLCardinality-03
FORMULA_NAME TCPcondis-PT-15-CTLCardinality-04
FORMULA_NAME TCPcondis-PT-15-CTLCardinality-05
FORMULA_NAME TCPcondis-PT-15-CTLCardinality-06
FORMULA_NAME TCPcondis-PT-15-CTLCardinality-07
FORMULA_NAME TCPcondis-PT-15-CTLCardinality-08
FORMULA_NAME TCPcondis-PT-15-CTLCardinality-09
FORMULA_NAME TCPcondis-PT-15-CTLCardinality-10
FORMULA_NAME TCPcondis-PT-15-CTLCardinality-11
FORMULA_NAME TCPcondis-PT-15-CTLCardinality-12
FORMULA_NAME TCPcondis-PT-15-CTLCardinality-13
FORMULA_NAME TCPcondis-PT-15-CTLCardinality-14
FORMULA_NAME TCPcondis-PT-15-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679273660941

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=TCPcondis-PT-15
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 00:54:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 00:54:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 00:54:22] [WARNING] Skipping unknown tool specific annotation : Tina
[2023-03-20 00:54:22] [WARNING] Unknown XML tag in source file: size
[2023-03-20 00:54:22] [WARNING] Unknown XML tag in source file: color
[2023-03-20 00:54:22] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2023-03-20 00:54:22] [INFO ] Transformed 30 places.
[2023-03-20 00:54:22] [INFO ] Transformed 32 transitions.
[2023-03-20 00:54:22] [INFO ] Parsed PT model containing 30 places and 32 transitions and 108 arcs in 86 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-20 00:54:22] [INFO ] Computed 9 place invariants in 7 ms
[2023-03-20 00:54:22] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-20 00:54:22] [INFO ] Invariant cache hit.
[2023-03-20 00:54:22] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2023-03-20 00:54:22] [INFO ] Invariant cache hit.
[2023-03-20 00:54:22] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 270 ms. Remains : 30/30 places, 32/32 transitions.
Support contains 30 out of 30 places after structural reductions.
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 19 ms
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 7 ms
[2023-03-20 00:54:23] [INFO ] Input system was already deterministic with 32 transitions.
Incomplete random walk after 10014 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=69 ) properties (out of 91) seen :85
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-20 00:54:23] [INFO ] Invariant cache hit.
[2023-03-20 00:54:23] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-20 00:54:23] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-20 00:54:23] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
FORMULA TCPcondis-PT-15-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 4 ms
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 4 ms
[2023-03-20 00:54:23] [INFO ] Input system was already deterministic with 32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 3 ms
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 3 ms
[2023-03-20 00:54:23] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:54:23] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 3 ms
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:54:23] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:54:23] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 29
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 27 transition count 27
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 8 place count 27 transition count 25
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 25 transition count 25
Applied a total of 12 rules in 12 ms. Remains 25 /30 variables (removed 5) and now considering 25/32 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 25/30 places, 25/32 transitions.
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:54:23] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:54:23] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:54:23] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:54:23] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:54:23] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 25 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 11 place count 25 transition count 25
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 24 transition count 25
Applied a total of 13 rules in 5 ms. Remains 24 /30 variables (removed 6) and now considering 25/32 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 24/30 places, 25/32 transitions.
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:54:23] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:54:23] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:54:23] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:54:23] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:54:23] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 24 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 14 place count 24 transition count 22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 22 transition count 22
Applied a total of 18 rules in 5 ms. Remains 22 /30 variables (removed 8) and now considering 22/32 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 22/30 places, 22/32 transitions.
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 1 ms
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:54:23] [INFO ] Input system was already deterministic with 22 transitions.
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:54:23] [INFO ] Flatten gal took : 3 ms
[2023-03-20 00:54:23] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-20 00:54:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 32 transitions and 108 arcs took 0 ms.
Total runtime 1563 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: 30 NrTr: 32 NrArc: 108)

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

net check time: 0m 0.000sec

init dd package: 0m 2.745sec


RS generation: 3m23.449sec


-> reachability set: #nodes 894059 (8.9e+05) #states 5,397,066,447,019 (12)



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

checking: AF [EG [~ [p20<=3]]]
normalized: ~ [EG [~ [EG [~ [p20<=3]]]]]

abstracting: (p20<=3)
states: 3,562,571,748,320 (12)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA TCPcondis-PT-15-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m42.877sec

checking: AF [AG [[EG [6<=p24] | [AX [EX [p29<=3]] & EG [~ [13<=p5]]]]]]
normalized: ~ [EG [E [true U ~ [[[EG [~ [13<=p5]] & ~ [EX [~ [EX [p29<=3]]]]] | EG [6<=p24]]]]]]

abstracting: (6<=p24)
states: 92,097,158,841 (10)
.
EG iterations: 1
abstracting: (p29<=3)
states: 4,937,024,320,504 (12)
..abstracting: (13<=p5)
states: 451,814,067 (8)
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA TCPcondis-PT-15-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m17.738sec

checking: AF [[AX [AG [2<=p21]] | [4<=p0 & 14<=p23]]]
normalized: ~ [EG [~ [[[4<=p0 & 14<=p23] | ~ [EX [E [true U ~ [2<=p21]]]]]]]]

abstracting: (2<=p21)
states: 2,481,842,454,735 (12)
.abstracting: (14<=p23)
states: 3,420,154 (6)
abstracting: (4<=p0)
states: 460,042,126,515 (11)
.
EG iterations: 1
-> the formula is FALSE

FORMULA TCPcondis-PT-15-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m30.868sec

checking: AF [E [[AX [EX [p23<=p12]] | ~ [EF [~ [3<=p4]]]] U p0<=6]]
normalized: ~ [EG [~ [E [[~ [E [true U ~ [3<=p4]]] | ~ [EX [~ [EX [p23<=p12]]]]] U p0<=6]]]]

abstracting: (p0<=6)
states: 5,360,847,260,920 (12)
abstracting: (p23<=p12)
states: 3,294,056,525,240 (12)
..abstracting: (3<=p4)
states: 1,869,826,574,216 (12)

before gc: list nodes free: 685232

after gc: idd nodes used:4352645, unused:59647355; list nodes free:493227821
......................................................................................
EG iterations: 86
-> the formula is TRUE

FORMULA TCPcondis-PT-15-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m 3.944sec

checking: A [p23<=0 U [EF [AX [p13<=11]] & AG [AF [E [p10<=p19 U p23<=3]]]]]
normalized: [~ [EG [~ [[~ [E [true U EG [~ [E [p10<=p19 U p23<=3]]]]] & E [true U ~ [EX [~ [p13<=11]]]]]]]] & ~ [E [~ [[~ [E [true U EG [~ [E [p10<=p19 U p23<=3]]]]] & E [true U ~ [EX [~ [p13<=11]]]]]] U [~ [p23<=0] & ~ [[~ [E [true U EG [~ [E [p10<=p19 U p23<=3]]]]] & E [true U ~ [EX [~ [p13<=11]]]]]]]]]]

abstracting: (p13<=11)
states: 5,396,954,679,578 (12)
.abstracting: (p23<=3)
states: 4,683,885,234,577 (12)
abstracting: (p10<=p19)
states: 3,564,259,750,442 (12)
.
EG iterations: 1
MC time: 4m38.668sec

checking: AG [[AX [EF [p4<=1]] & AF [[~ [p27<=p19] & ~ [p16<=p27]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[~ [p16<=p27] & ~ [p27<=p19]]]]] & ~ [EX [~ [E [true U p4<=1]]]]]]]]

abstracting: (p4<=1)
states: 2,471,733,589,807 (12)
.abstracting: (p27<=p19)
states: 3,600,801,296,067 (12)
abstracting: (p16<=p27)
states: 3,924,701,184,241 (12)
.
EG iterations: 1
-> the formula is FALSE

FORMULA TCPcondis-PT-15-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m33.813sec

checking: E [5<=p4 U [E [EG [AF [p7<=p8]] U AG [~ [[p4<=p16 & p10<=6]]]] & p20<=p13]]
normalized: E [5<=p4 U [p20<=p13 & E [EG [~ [EG [~ [p7<=p8]]]] U ~ [E [true U [p4<=p16 & p10<=6]]]]]]

abstracting: (p10<=6)
states: 5,331,265,506,466 (12)
abstracting: (p4<=p16)
states: 2,268,641,184,620 (12)
abstracting: (p7<=p8)
states: 3,561,413,290,298 (12)

before gc: list nodes free: 7698961

after gc: idd nodes used:11323226, unused:52676774; list nodes free:439442415
.....................
EG iterations: 21
.
EG iterations: 1
abstracting: (p20<=p13)
states: 2,265,385,578,153 (12)
abstracting: (5<=p4)
states: 564,708,201,303 (11)
-> the formula is FALSE

FORMULA TCPcondis-PT-15-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m 0.921sec

checking: [EG [~ [E [~ [AX [p4<=5]] U EX [11<=p13]]]] & [AF [[AX [[~ [p24<=5] & ~ [9<=p12]]] | p15<=p19]] | [AF [[AX [~ [p15<=14]] & AX [~ [13<=p5]]]] & [AF [~ [p28<=p24]] & EG [AF [~ [5<=p11]]]]]]]
normalized: [[[[EG [~ [EG [5<=p11]]] & ~ [EG [p28<=p24]]] & ~ [EG [~ [[~ [EX [13<=p5]] & ~ [EX [p15<=14]]]]]]] | ~ [EG [~ [[p15<=p19 | ~ [EX [~ [[~ [9<=p12] & ~ [p24<=5]]]]]]]]]] & EG [~ [E [EX [~ [p4<=5]] U EX [11<=p13]]]]]

abstracting: (11<=p13)
states: 583,374,944 (8)
.abstracting: (p4<=5)
states: 5,132,594,698,559 (12)
..
EG iterations: 1
abstracting: (p24<=5)
states: 5,304,969,288,178 (12)
abstracting: (9<=p12)
states: 2,627,345,125 (9)
.abstracting: (p15<=p19)
states: 3,971,586,804,808 (12)
.....................................................................................................
before gc: list nodes free: 1963823

after gc: idd nodes used:14284593, unused:49715407; list nodes free:426930140
.................................................................
EG iterations: 166
abstracting: (p15<=14)
states: 5,397,066,431,515 (12)
.abstracting: (13<=p5)
states: 451,814,067 (8)
.
EG iterations: 0
abstracting: (p28<=p24)
states: 2,924,891,256,804 (12)
.
EG iterations: 1
abstracting: (5<=p11)
states: 251,320,689,186 (11)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA TCPcondis-PT-15-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m12.892sec

checking: AG [[[EF [~ [p5<=p12]] & AF [p21<=12]] & [[~ [8<=p18] | [11<=p6 | [p7<=p9 & p19<=p21]]] & [EF [14<=p9] | [p7<=7 | 13<=p16]]]]]
normalized: ~ [E [true U ~ [[[[[p7<=7 | 13<=p16] | E [true U 14<=p9]] & [[11<=p6 | [p7<=p9 & p19<=p21]] | ~ [8<=p18]]] & [~ [EG [~ [p21<=12]]] & E [true U ~ [p5<=p12]]]]]]]

abstracting: (p5<=p12)
states: 2,186,165,572,746 (12)
abstracting: (p21<=12)
states: 5,397,057,802,236 (12)
.
EG iterations: 1
abstracting: (8<=p18)
states: 3,829,972,858 (9)
abstracting: (p19<=p21)
states: 2,988,597,470,148 (12)
abstracting: (p7<=p9)
states: 3,291,424,185,135 (12)
abstracting: (11<=p6)
states: 443,426,803 (8)
abstracting: (14<=p9)
states: 427,584 (5)
abstracting: (13<=p16)
states: 36,463 (4)
abstracting: (p7<=7)
states: 5,391,548,377,217 (12)
-> the formula is FALSE

FORMULA TCPcondis-PT-15-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m19.836sec

checking: AG [EF [[AX [p6<=p17] | [[p7<=15 & p12<=p24] | [~ [A [p6<=p25 U p25<=p10]] & [~ [p24<=p27] | AF [~ [p14<=p24]]]]]]]]
normalized: ~ [E [true U ~ [E [true U [[[[~ [EG [p14<=p24]] | ~ [p24<=p27]] & ~ [[~ [EG [~ [p25<=p10]]] & ~ [E [~ [p25<=p10] U [~ [p6<=p25] & ~ [p25<=p10]]]]]]] | [p7<=15 & p12<=p24]] | ~ [EX [~ [p6<=p17]]]]]]]]

abstracting: (p6<=p17)
states: 3,117,892,363,805 (12)
.abstracting: (p12<=p24)
states: 3,013,009,078,056 (12)
abstracting: (p7<=15)
states: 5,397,066,447,019 (12)
abstracting: (p25<=p10)
states: 3,242,568,925,347 (12)
abstracting: (p6<=p25)
states: 3,159,879,505,735 (12)
abstracting: (p25<=p10)
states: 3,242,568,925,347 (12)

before gc: list nodes free: 14401966

after gc: idd nodes used:18392713, unused:45607287; list nodes free:388810735
abstracting: (p25<=p10)
states: 3,242,568,925,347 (12)
.
EG iterations: 1
abstracting: (p24<=p27)
states: 3,665,440,877,421 (12)
abstracting: (p14<=p24)
states: 3,458,024,733,218 (12)
MC time: 4m47.737sec

checking: EX [E [E [[~ [[p12<=p4 | 15<=p2]] | EG [p14<=8]] U [AF [9<=p16] | [AG [p9<=p0] & [10<=p18 & p14<=p13]]]] U ~ [[AX [p12<=3] | EX [p6<=p23]]]]]
normalized: EX [E [E [[EG [p14<=8] | ~ [[p12<=p4 | 15<=p2]]] U [[[10<=p18 & p14<=p13] & ~ [E [true U ~ [p9<=p0]]]] | ~ [EG [~ [9<=p16]]]]] U ~ [[EX [p6<=p23] | ~ [EX [~ [p12<=3]]]]]]]

abstracting: (p12<=3)
states: 4,820,500,892,199 (12)
.abstracting: (p6<=p23)
states: 3,117,892,363,805 (12)
.abstracting: (9<=p16)
states: 285,664,485 (8)
.
EG iterations: 1
abstracting: (p9<=p0)
states: 3,389,750,553,079 (12)
abstracting: (p14<=p13)
states: 3,671,432,910,603 (12)
abstracting: (10<=p18)
states: 165,315,970 (8)
abstracting: (15<=p2)
states: 170,544 (5)
abstracting: (p12<=p4)
states: 3,600,801,296,067 (12)
abstracting: (p14<=8)
states: 5,393,062,373,016 (12)
.
EG iterations: 1
MC time: 4m 4.004sec

checking: EX [[AX [AX [~ [p23<=1]]] | [EG [[[[2<=p3 & ~ [p29<=p2]] | ~ [p17<=p27]] | [~ [13<=p9] | ~ [p15<=8]]]] | [EG [p10<=p27] & A [p0<=p23 U p13<=p8]]]]]
normalized: EX [[[[[~ [EG [~ [p13<=p8]]] & ~ [E [~ [p13<=p8] U [~ [p0<=p23] & ~ [p13<=p8]]]]] & EG [p10<=p27]] | EG [[[~ [p15<=8] | ~ [13<=p9]] | [~ [p17<=p27] | [2<=p3 & ~ [p29<=p2]]]]]] | ~ [EX [EX [p23<=1]]]]]

abstracting: (p23<=1)
states: 3,171,971,556,880 (12)

before gc: list nodes free: 19623454

after gc: idd nodes used:21741338, unused:42258662; list nodes free:365057120
..abstracting: (p29<=p2)
states: 3,683,993,230,845 (12)
abstracting: (2<=p3)
states: 1,623,953,577,402 (12)
abstracting: (p17<=p27)
states: 3,292,937,453,781 (12)
abstracting: (13<=p9)
states: 5,354,210 (6)
abstracting: (p15<=8)
states: 5,393,062,373,016 (12)
.
EG iterations: 1
abstracting: (p10<=p27)
states: 3,164,712,544,733 (12)
................................................................MC time: 3m29.106sec

checking: AG [[~ [A [~ [[AG [p17<=9] | p29<=p13]] U EG [~ [p9<=p21]]]] & [AX [p14<=p28] | [AX [[EG [p24<=p29] & [p9<=p24 | p0<=11]]] & [8<=p3 | AF [[5<=p8 & 15<=p5]]]]]]]
normalized: ~ [E [true U ~ [[[[[8<=p3 | ~ [EG [~ [[5<=p8 & 15<=p5]]]]] & ~ [EX [~ [[[p9<=p24 | p0<=11] & EG [p24<=p29]]]]]] | ~ [EX [~ [p14<=p28]]]] & ~ [[~ [EG [~ [EG [~ [p9<=p21]]]]] & ~ [E [~ [EG [~ [p9<=p21]]] U [[p29<=p13 | ~ [E [true U ~ [p17<=9]]]] & ~ [EG [~ [p9<=p21]]]]]]]]]]]]

abstracting: (p9<=p21)
states: 3,768,128,688,713 (12)
.
EG iterations: 1
abstracting: (p17<=9)
states: 5,393,652,961,524 (12)
abstracting: (p29<=p13)
states: 3,745,634,127,663 (12)
abstracting: (p9<=p21)
states: 3,768,128,688,713 (12)
.
EG iterations: 1

before gc: list nodes free: 38247095

after gc: idd nodes used:24731482, unused:39268518; list nodes free:343829740
MC time: 3m11.939sec

checking: E [~ [[~ [[[E [10<=p23 U 6<=p2] | p0<=0] & AF [13<=p15]]] | ~ [EX [~ [[p0<=p28 | p14<=p9]]]]]] U [A [[EF [[4<=p11 | p19<=2]] & [EF [p22<=p19] | AX [p29<=8]]] U AG [[13<=p1 | ~ [2<=p11]]]] | EF [[[[EF [p19<=10] | p0<=14] | [14<=p25 | ~ [p11<=p3]]] & 4<=p17]]]]
normalized: E [~ [[~ [EX [~ [[p0<=p28 | p14<=p9]]]] | ~ [[~ [EG [~ [13<=p15]]] & [p0<=0 | E [10<=p23 U 6<=p2]]]]]] U [E [true U [4<=p17 & [[14<=p25 | ~ [p11<=p3]] | [p0<=14 | E [true U p19<=10]]]]] | [~ [EG [E [true U ~ [[13<=p1 | ~ [2<=p11]]]]]] & ~ [E [E [true U ~ [[13<=p1 | ~ [2<=p11]]]] U [~ [[[~ [EX [~ [p29<=8]]] | E [true U p22<=p19]] & E [true U [4<=p11 | p19<=2]]]] & E [true U ~ [[13<=p1 | ~ [2<=p11]]]]]]]]]]

abstracting: (2<=p11)
states: 2,219,760,017,827 (12)
abstracting: (13<=p1)
states: 36,463 (4)
abstracting: (p19<=2)
states: 3,527,239,872,803 (12)
abstracting: (4<=p11)
states: 576,565,554,820 (11)
abstracting: (p22<=p19)
states: 3,942,998,896,902 (12)
MC time: 2m32.013sec

checking: A [[EF [[p27<=5 | EG [8<=p2]]] & [A [[[[p21<=4 | p1<=p2] & ~ [1<=p0]] | ~ [EG [p15<=p2]]] U ~ [10<=p17]] | AX [[EF [p1<=p20] | [3<=p26 | 10<=p24]]]]] U ~ [[[~ [AF [EG [6<=p0]]] | [~ [AG [10<=p2]] | EX [p15<=p12]]] | [[[AF [p0<=p5] | ~ [A [p21<=p13 U p27<=14]]] & ~ [AF [p23<=p10]]] | [p15<=p23 | ~ [p15<=p28]]]]]]
normalized: [~ [EG [[[[p15<=p23 | ~ [p15<=p28]] | [EG [~ [p23<=p10]] & [~ [[~ [EG [~ [p27<=14]]] & ~ [E [~ [p27<=14] U [~ [p21<=p13] & ~ [p27<=14]]]]]] | ~ [EG [~ [p0<=p5]]]]]] | [[EX [p15<=p12] | E [true U ~ [10<=p2]]] | EG [~ [EG [6<=p0]]]]]]] & ~ [E [[[[p15<=p23 | ~ [p15<=p28]] | [EG [~ [p23<=p10]] & [~ [[~ [EG [~ [p27<=14]]] & ~ [E [~ [p27<=14] U [~ [p21<=p13] & ~ [p27<=14]]]]]] | ~ [EG [~ [p0<=p5]]]]]] | [[EX [p15<=p12] | E [true U ~ [10<=p2]]] | EG [~ [EG [6<=p0]]]]] U [~ [[[~ [EX [~ [[[3<=p26 | 10<=p24] | E [true U p1<=p20]]]]] | [~ [EG [10<=p17]] & ~ [E [10<=p17 U [10<=p17 & ~ [[~ [EG [p15<=p2]] | [~ [1<=p0] & [p21<=4 | p1<=p2]]]]]]]]] & E [true U [p27<=5 | EG [8<=p2]]]]] & [[[p15<=p23 | ~ [p15<=p28]] | [EG [~ [p23<=p10]] & [~ [[~ [EG [~ [p27<=14]]] & ~ [E [~ [p27<=14] U [~ [p21<=p13] & ~ [p27<=14]]]]]] | ~ [EG [~ [p0<=p5]]]]]] | [[EX [p15<=p12] | E [true U ~ [10<=p2]]] | EG [~ [EG [6<=p0]]]]]]]]]

abstracting: (6<=p0)
states: 92,097,158,841 (10)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (10<=p2)
states: 3,413,485,495 (9)
abstracting: (p15<=p12)
states: 3,655,547,663,131 (12)
.abstracting: (p0<=p5)
states: 4,370,180,488,317 (12)
.............................................MC time: 2m10.024sec

checking: A [p23<=0 U [EF [AX [p13<=11]] & AG [AF [E [p10<=p19 U p23<=3]]]]]
normalized: [~ [EG [~ [[~ [E [true U EG [~ [E [p10<=p19 U p23<=3]]]]] & E [true U ~ [EX [~ [p13<=11]]]]]]]] & ~ [E [~ [[~ [E [true U EG [~ [E [p10<=p19 U p23<=3]]]]] & E [true U ~ [EX [~ [p13<=11]]]]]] U [~ [p23<=0] & ~ [[~ [E [true U EG [~ [E [p10<=p19 U p23<=3]]]]] & E [true U ~ [EX [~ [p13<=11]]]]]]]]]]

abstracting: (p13<=11)
states: 5,396,954,679,578 (12)
.abstracting: (p23<=3)
states: 4,683,885,234,577 (12)
abstracting: (p10<=p19)
states: 3,564,259,750,442 (12)

before gc: list nodes free: 20654039

after gc: idd nodes used:27672291, unused:36327709; list nodes free:321887357
.
EG iterations: 1
abstracting: (p23<=0)
states: 1,822,110,374,077 (12)
abstracting: (p13<=11)
states: 5,396,954,679,578 (12)
.abstracting: (p23<=3)
states: 4,683,885,234,577 (12)
abstracting: (p10<=p19)
states: 3,564,259,750,442 (12)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 2004976 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098692 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ 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:9728 (304), effective:1358 (42)

initing FirstDep: 0m 0.000sec


iterations count:3923 (122), effective:607 (18)

iterations count:592 (18), effective:84 (2)

iterations count:617 (19), effective:52 (1)

iterations count:185 (5), effective:9 (0)

iterations count:1019 (31), effective:103 (3)

iterations count:1241 (38), effective:115 (3)

sat_reach.icc:155: Timeout: after 277 sec


iterations count:662 (20), effective:56 (1)

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

iterations count:2746 (85), effective:286 (8)

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

iterations count:923 (28), effective:120 (3)

iterations count:5519 (172), effective:673 (21)

iterations count:6390 (199), effective:897 (28)

iterations count:3569 (111), effective:521 (16)

net_ddint.h:600: Timeout: after 284 sec


iterations count:379 (11), effective:34 (1)

sat_reach.icc:155: Timeout: after 243 sec


net_ddint.h:600: Timeout: after 208 sec


iterations count:5872 (183), effective:855 (26)

sat_reach.icc:155: Timeout: after 178 sec


iterations count:1158 (36), effective:169 (5)

iterations count:500 (15), effective:65 (2)

sat_reach.icc:155: Timeout: after 151 sec


iterations count:230 (7), effective:21 (0)

net_ddint.h:600: Timeout: after 129 sec


iterations count:1019 (31), effective:103 (3)

iterations count:1241 (38), effective:115 (3)

iterations count:3493 (109), effective:540 (16)

iterations count:1019 (31), effective:103 (3)

iterations count:1241 (38), effective:115 (3)

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="TCPcondis-PT-15"
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 TCPcondis-PT-15, 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 r490-tall-167912708800513"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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