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.r234-tall-167856420500561.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 MAPK-PT-00040, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420500561
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 8.5K Feb 26 10:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 10:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 10:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 10:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 10:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 10:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 10:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 10:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 25K Mar 5 18:22 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 MAPK-PT-00040-CTLCardinality-00
FORMULA_NAME MAPK-PT-00040-CTLCardinality-01
FORMULA_NAME MAPK-PT-00040-CTLCardinality-02
FORMULA_NAME MAPK-PT-00040-CTLCardinality-03
FORMULA_NAME MAPK-PT-00040-CTLCardinality-04
FORMULA_NAME MAPK-PT-00040-CTLCardinality-05
FORMULA_NAME MAPK-PT-00040-CTLCardinality-06
FORMULA_NAME MAPK-PT-00040-CTLCardinality-07
FORMULA_NAME MAPK-PT-00040-CTLCardinality-08
FORMULA_NAME MAPK-PT-00040-CTLCardinality-09
FORMULA_NAME MAPK-PT-00040-CTLCardinality-10
FORMULA_NAME MAPK-PT-00040-CTLCardinality-11
FORMULA_NAME MAPK-PT-00040-CTLCardinality-12
FORMULA_NAME MAPK-PT-00040-CTLCardinality-13
FORMULA_NAME MAPK-PT-00040-CTLCardinality-14
FORMULA_NAME MAPK-PT-00040-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679532619080

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=MAPK-PT-00040
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 00:50:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 00:50:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 00:50:20] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2023-03-23 00:50:20] [INFO ] Transformed 22 places.
[2023-03-23 00:50:20] [INFO ] Transformed 30 transitions.
[2023-03-23 00:50:20] [INFO ] Parsed PT model containing 22 places and 30 transitions and 90 arcs in 80 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 8 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2023-03-23 00:50:20] [INFO ] Computed 7 place invariants in 8 ms
[2023-03-23 00:50:20] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-23 00:50:20] [INFO ] Invariant cache hit.
[2023-03-23 00:50:21] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2023-03-23 00:50:21] [INFO ] Invariant cache hit.
[2023-03-23 00:50:21] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 427 ms. Remains : 22/22 places, 30/30 transitions.
Support contains 22 out of 22 places after structural reductions.
[2023-03-23 00:50:21] [INFO ] Flatten gal took : 18 ms
[2023-03-23 00:50:21] [INFO ] Flatten gal took : 5 ms
[2023-03-23 00:50:21] [INFO ] Input system was already deterministic with 30 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 96) seen :77
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-03-23 00:50:21] [INFO ] Invariant cache hit.
[2023-03-23 00:50:21] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-23 00:50:21] [INFO ] After 12ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:17
[2023-03-23 00:50:21] [INFO ] After 17ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1 real:17
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-23 00:50:21] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1 real:17
[2023-03-23 00:50:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-23 00:50:21] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :16 sat :3
[2023-03-23 00:50:21] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :16 sat :3
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-23 00:50:21] [INFO ] After 115ms SMT Verify possible using all constraints in natural domain returned unsat :16 sat :3
Fused 19 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 20 transition count 28
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 16 place count 13 transition count 23
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 4 edges and 13 vertex of which 2 / 13 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 22 place count 12 transition count 18
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 12 transition count 16
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 12 transition count 15
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 12 transition count 14
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 28 place count 11 transition count 13
Applied a total of 28 rules in 16 ms. Remains 11 /22 variables (removed 11) and now considering 13/30 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 11/22 places, 13/30 transitions.
Finished random walk after 2844 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=568 )
Successfully simplified 16 atomic propositions for a total of 16 simplifications.
FORMULA MAPK-PT-00040-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 00:50:21] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-23 00:50:21] [INFO ] Flatten gal took : 5 ms
FORMULA MAPK-PT-00040-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00040-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 00:50:21] [INFO ] Flatten gal took : 3 ms
[2023-03-23 00:50:21] [INFO ] Input system was already deterministic with 30 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:50:21] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:21] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:21] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:50:21] [INFO ] Flatten gal took : 3 ms
[2023-03-23 00:50:21] [INFO ] Flatten gal took : 3 ms
[2023-03-23 00:50:21] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 20 transition count 28
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 20 transition count 27
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 3 edges and 18 vertex of which 2 / 18 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 17 transition count 27
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 17 transition count 25
Applied a total of 10 rules in 5 ms. Remains 17 /22 variables (removed 5) and now considering 25/30 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 17/22 places, 25/30 transitions.
[2023-03-23 00:50:22] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:22] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:22] [INFO ] Input system was already deterministic with 25 transitions.
Finished random walk after 514 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=257 )
FORMULA MAPK-PT-00040-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:50:22] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:50:22] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:22] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 20 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 20 transition count 27
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 18 transition count 27
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 18 transition count 27
Applied a total of 8 rules in 5 ms. Remains 18 /22 variables (removed 4) and now considering 27/30 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 18/22 places, 27/30 transitions.
[2023-03-23 00:50:22] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:22] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:22] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:50:22] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:50:22] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:22] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:50:22] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:22] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:50:22] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 30
Applied a total of 2 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:50:22] [INFO ] Flatten gal took : 6 ms
[2023-03-23 00:50:22] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:22] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 20 transition count 28
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 20 transition count 27
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 3 edges and 18 vertex of which 2 / 18 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 17 transition count 27
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 17 transition count 25
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 17 transition count 25
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 16 place count 15 transition count 23
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 15 transition count 23
Applied a total of 18 rules in 7 ms. Remains 15 /22 variables (removed 7) and now considering 23/30 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 15/22 places, 23/30 transitions.
[2023-03-23 00:50:22] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:22] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:50:22] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:50:22] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:50:22] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:50:22] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:50:22] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:22] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:22] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:50:22] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:50:22] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:22] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:50:22] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:22] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:22] [INFO ] Input system was already deterministic with 30 transitions.
[2023-03-23 00:50:22] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:22] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:22] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-23 00:50:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 22 places, 30 transitions and 90 arcs took 1 ms.
Total runtime 1643 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: 22 NrTr: 30 NrArc: 90)

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

net check time: 0m 0.000sec

init dd package: 0m 2.723sec


RS generation: 0m 0.296sec


-> reachability set: #nodes 27287 (2.7e+04) #states 478,293,389,221,095 (14)



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

checking: EF [EG [AG [~ [15<=p6]]]]
normalized: E [true U EG [~ [E [true U 15<=p6]]]]

abstracting: (15<=p6)
states: 26,974,968,633,294 (13)
.
EG iterations: 1
-> the formula is FALSE

FORMULA MAPK-PT-00040-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.962sec

checking: AG [EF [p16<=p7]]
normalized: ~ [E [true U ~ [E [true U p16<=p7]]]]

abstracting: (p16<=p7)
states: 90,803,333,845,215 (13)
-> the formula is TRUE

FORMULA MAPK-PT-00040-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.383sec

checking: EX [EF [AG [p5<=p3]]]
normalized: EX [E [true U ~ [E [true U ~ [p5<=p3]]]]]

abstracting: (p5<=p3)
states: 175,833,833,481,000 (14)
.-> the formula is FALSE

FORMULA MAPK-PT-00040-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.231sec

checking: AG [EF [EX [E [EX [3<=p16] U p11<=13]]]]
normalized: ~ [E [true U ~ [E [true U EX [E [EX [3<=p16] U p11<=13]]]]]]

abstracting: (p11<=13)
states: 443,122,846,852,700 (14)
abstracting: (3<=p16)
states: 396,985,919,387,714 (14)
..-> the formula is TRUE

FORMULA MAPK-PT-00040-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.569sec

checking: AF [E [2<=p20 U ~ [EF [p3<=p16]]]]
normalized: ~ [EG [~ [E [2<=p20 U ~ [E [true U p3<=p16]]]]]]

abstracting: (p3<=p16)
states: 413,702,200,969,875 (14)
abstracting: (2<=p20)
states: 413,850,356,086,890 (14)

EG iterations: 0
-> the formula is FALSE

FORMULA MAPK-PT-00040-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.187sec

checking: AX [EF [[EX [EX [p8<=p21]] & p15<=p20]]]
normalized: ~ [EX [~ [E [true U [p15<=p20 & EX [EX [p8<=p21]]]]]]]

abstracting: (p8<=p21)
states: 146,680,858,261,689 (14)
..abstracting: (p15<=p20)
states: 287,360,350,873,690 (14)
.-> the formula is TRUE

FORMULA MAPK-PT-00040-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m12.287sec

checking: EX [[AX [[p18<=p17 & p17<=p11]] | AX [AG [~ [p9<=1]]]]]
normalized: EX [[~ [EX [E [true U p9<=1]]] | ~ [EX [~ [[p18<=p17 & p17<=p11]]]]]]

abstracting: (p17<=p11)
states: 270,273,791,568,918 (14)
abstracting: (p18<=p17)
states: 369,668,527,879,475 (14)
.abstracting: (p9<=1)
states: 204,377,550,245 (11)
..-> the formula is FALSE

FORMULA MAPK-PT-00040-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.267sec

checking: [AX [[AX [EF [15<=p7]] & E [[EX [p21<=1] | [~ [25<=p4] | AG [p11<=p4]]] U AX [p0<=13]]]] & EF [EG [~ [20<=p12]]]]
normalized: [E [true U EG [~ [20<=p12]]] & ~ [EX [~ [[E [[[~ [E [true U ~ [p11<=p4]]] | ~ [25<=p4]] | EX [p21<=1]] U ~ [EX [~ [p0<=13]]]] & ~ [EX [~ [E [true U 15<=p7]]]]]]]]]

abstracting: (15<=p7)
states: 354,006,039,243 (11)
.abstracting: (p0<=13)
states: 478,219,250,592,109 (14)
.abstracting: (p21<=1)
states: 54,740,879,736,015 (13)
.abstracting: (25<=p4)
states: 409,814,982,874 (11)
abstracting: (p11<=p4)
states: 255,714,555,085,625 (14)
.abstracting: (20<=p12)
states: 71,929,176 (7)
.
EG iterations: 1
-> the formula is TRUE

FORMULA MAPK-PT-00040-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.585sec

checking: AG [A [[AX [[12<=p14 | p17<=p11]] & [~ [[~ [30<=p16] & [p14<=p13 | p4<=11]]] & AX [p10<=4]]] U p12<=13]]
normalized: ~ [E [true U ~ [[~ [EG [~ [p12<=13]]] & ~ [E [~ [p12<=13] U [~ [[[~ [EX [~ [p10<=4]]] & ~ [[[p14<=p13 | p4<=11] & ~ [30<=p16]]]] & ~ [EX [~ [[12<=p14 | p17<=p11]]]]]] & ~ [p12<=13]]]]]]]]

abstracting: (p12<=13)
states: 477,994,548,816,144 (14)
abstracting: (p17<=p11)
states: 270,273,791,568,918 (14)
abstracting: (12<=p14)
states: 3,156,891,980,964 (12)
.abstracting: (30<=p16)
states: 8,256,490,171,602 (12)
abstracting: (p4<=11)
states: 421,090,877,502,945 (14)
abstracting: (p14<=p13)
states: 273,715,601,971,329 (14)
abstracting: (p10<=4)
states: 386,553,529,672,595 (14)
.abstracting: (p12<=13)
states: 477,994,548,816,144 (14)
abstracting: (p12<=13)
states: 477,994,548,816,144 (14)
.
EG iterations: 1
-> the formula is FALSE

FORMULA MAPK-PT-00040-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.817sec

checking: AF [[EF [AX [[p8<=p13 & p19<=p9]]] & [AG [AX [~ [p4<=p9]]] | [AX [~ [p15<=p18]] | [14<=p18 & [A [AG [p15<=p21] U [p19<=35 & 4<=p11]] | [EF [p8<=15] | EG [p13<=16]]]]]]]]
normalized: ~ [EG [~ [[[[[14<=p18 & [[EG [p13<=16] | E [true U p8<=15]] | [~ [EG [~ [[p19<=35 & 4<=p11]]]] & ~ [E [~ [[p19<=35 & 4<=p11]] U [E [true U ~ [p15<=p21]] & ~ [[p19<=35 & 4<=p11]]]]]]]] | ~ [EX [p15<=p18]]] | ~ [E [true U EX [p4<=p9]]]] & E [true U ~ [EX [~ [[p8<=p13 & p19<=p9]]]]]]]]]

abstracting: (p19<=p9)
states: 397,317,929,065,140 (14)
abstracting: (p8<=p13)
states: 15,677,159,357,996 (13)
.abstracting: (p4<=p9)
states: 437,617,024,271,435 (14)
.abstracting: (p15<=p18)
states: 160,083,257,504,690 (14)
.abstracting: (4<=p11)
states: 263,680,200,784,880 (14)
abstracting: (p19<=35)
states: 478,293,389,221,095 (14)
abstracting: (p15<=p21)
states: 346,914,866,108,663 (14)
abstracting: (4<=p11)
states: 263,680,200,784,880 (14)
abstracting: (p19<=35)
states: 478,293,389,221,095 (14)
abstracting: (4<=p11)
states: 263,680,200,784,880 (14)
abstracting: (p19<=35)
states: 478,293,389,221,095 (14)
.
EG iterations: 1
abstracting: (p8<=15)
states: 239,412,629,099,500 (14)
abstracting: (p13<=16)
states: 478,244,431,418,707 (14)
.
EG iterations: 1
abstracting: (14<=p18)
states: 298,840,404,951 (11)
.
EG iterations: 1
-> the formula is TRUE

FORMULA MAPK-PT-00040-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m10.201sec

checking: [EG [[[[~ [p18<=p17] & AX [~ [p12<=p18]]] | EF [~ [16<=p1]]] & [~ [A [~ [p9<=10] U AF [p3<=9]]] & [EF [11<=p14] | [AG [~ [36<=p16]] | [EX [12<=p0] & ~ [p10<=6]]]]]]] & AX [E [[[A [EX [15<=p21] U ~ [p11<=p3]] | ~ [EX [p5<=p20]]] | [~ [p2<=16] | [p12<=p10 & 27<=p2]]] U p5<=p15]]]
normalized: [~ [EX [~ [E [[[~ [EX [p5<=p20]] | [~ [EG [p11<=p3]] & ~ [E [p11<=p3 U [p11<=p3 & ~ [EX [15<=p21]]]]]]] | [[p12<=p10 & 27<=p2] | ~ [p2<=16]]] U p5<=p15]]]] & EG [[[[[[~ [p10<=6] & EX [12<=p0]] | ~ [E [true U 36<=p16]]] | E [true U 11<=p14]] & ~ [[~ [EG [EG [~ [p3<=9]]]] & ~ [E [EG [~ [p3<=9]] U [p9<=10 & EG [~ [p3<=9]]]]]]]] & [E [true U ~ [16<=p1]] | [~ [EX [p12<=p18]] & ~ [p18<=p17]]]]]]

abstracting: (p18<=p17)
states: 369,668,527,879,475 (14)
abstracting: (p12<=p18)
states: 280,534,440,802,347 (14)
.abstracting: (16<=p1)
states: 8,469,108,785 (9)
abstracting: (p3<=9)
states: 468,354,570,507,319 (14)
.
EG iterations: 1
abstracting: (p9<=10)
states: 40,777,146,330,492 (13)
abstracting: (p3<=9)
states: 468,354,570,507,319 (14)
.
EG iterations: 1
abstracting: (p3<=9)
states: 468,354,570,507,319 (14)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (11<=p14)
states: 5,738,340,644,220 (12)
abstracting: (36<=p16)
states: 519,363,534,415 (11)
abstracting: (12<=p0)
states: 442,731,418,902 (11)
.abstracting: (p10<=6)
states: 437,139,776,346,281 (14)
.
EG iterations: 1
abstracting: (p5<=p15)
states: 255,714,555,085,625 (14)
abstracting: (p2<=16)
states: 151,838,862,841,366 (14)
abstracting: (27<=p2)
states: 112,146,493,136,370 (14)
abstracting: (p12<=p10)
states: 296,508,544,270,819 (14)
abstracting: (15<=p21)
states: 141,475,277,766,700 (14)
.abstracting: (p11<=p3)
states: 175,833,833,481,000 (14)
abstracting: (p11<=p3)
states: 175,833,833,481,000 (14)
abstracting: (p11<=p3)
states: 175,833,833,481,000 (14)
.
EG iterations: 1
abstracting: (p5<=p20)
states: 287,360,350,873,690 (14)
..-> the formula is TRUE

FORMULA MAPK-PT-00040-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m 9.284sec

checking: [EF [[[AX [EF [p1<=13]] & AX [A [18<=p1 U p10<=13]]] & [~ [p10<=19] & [p19<=p16 | 31<=p18]]]] & E [[A [AG [~ [p1<=16]] U ~ [[EF [p2<=25] & [p6<=21 & p6<=p2]]]] | ~ [[[EX [0<=0] | ~ [[6<=p20 & p19<=23]]] | [~ [p7<=p21] | [p7<=7 | ~ [p11<=26]]]]]] U ~ [[AF [[~ [p12<=p20] & AX [p20<=p3]]] & p21<=33]]]]
normalized: [E [[~ [[[[p7<=7 | ~ [p11<=26]] | ~ [p7<=p21]] | [~ [[6<=p20 & p19<=23]] | EX [0<=0]]]] | [~ [EG [[[p6<=21 & p6<=p2] & E [true U p2<=25]]]] & ~ [E [[[p6<=21 & p6<=p2] & E [true U p2<=25]] U [E [true U p1<=16] & [[p6<=21 & p6<=p2] & E [true U p2<=25]]]]]]] U ~ [[p21<=33 & ~ [EG [~ [[~ [EX [~ [p20<=p3]]] & ~ [p12<=p20]]]]]]]] & E [true U [[[p19<=p16 | 31<=p18] & ~ [p10<=19]] & [~ [EX [~ [[~ [EG [~ [p10<=13]]] & ~ [E [~ [p10<=13] U [~ [18<=p1] & ~ [p10<=13]]]]]]]] & ~ [EX [~ [E [true U p1<=13]]]]]]]]

abstracting: (p1<=13)
states: 478,219,250,592,109 (14)
.abstracting: (p10<=13)
states: 477,498,230,053,605 (14)
abstracting: (18<=p1)
states: 511,489,433 (8)
abstracting: (p10<=13)
states: 477,498,230,053,605 (14)
abstracting: (p10<=13)
states: 477,498,230,053,605 (14)
.
EG iterations: 1
.abstracting: (p10<=19)
states: 478,293,057,122,559 (14)
abstracting: (31<=p18)
states: 0
abstracting: (p19<=p16)
states: 249,566,393,962,831 (14)
abstracting: (p12<=p20)
states: 405,893,543,550,255 (14)
abstracting: (p20<=p3)
states: 126,000,953,900,500 (14)
..
EG iterations: 1
abstracting: (p21<=33)
states: 476,634,345,275,819 (14)
abstracting: (p2<=25)
states: 340,469,494,578,045 (14)
abstracting: (p6<=p2)
states: 447,848,730,924,810 (14)
abstracting: (p6<=21)
states: 476,073,343,209,010 (14)
abstracting: (p1<=16)
states: 478,291,074,803,836 (14)
abstracting: (p2<=25)
states: 340,469,494,578,045 (14)
abstracting: (p6<=p2)
states: 447,848,730,924,810 (14)
abstracting: (p6<=21)
states: 476,073,343,209,010 (14)
abstracting: (p2<=25)
states: 340,469,494,578,045 (14)
abstracting: (p6<=p2)
states: 447,848,730,924,810 (14)
abstracting: (p6<=21)
states: 476,073,343,209,010 (14)
.
EG iterations: 1
abstracting: (0<=0)
states: 478,293,389,221,095 (14)
.abstracting: (p19<=23)
states: 446,576,636,934,868 (14)
abstracting: (6<=p20)
states: 255,739,755,924,370 (14)
abstracting: (p7<=p21)
states: 413,702,200,969,875 (14)
abstracting: (p11<=26)
states: 478,208,967,436,945 (14)
abstracting: (p7<=7)
states: 451,810,000,924,805 (14)
-> the formula is FALSE

FORMULA MAPK-PT-00040-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m53.884sec

totally nodes used: 62813026 (6.3e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1101867106 213103941 1314971047
used/not used/entry size/cache size: 65845271 1263593 16 1024MB
basic ops cache: hits/miss/sum: 306018616 66343258 372361874
used/not used/entry size/cache size: 16686682 90534 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: 9393446 1385865 10779311
used/not used/entry size/cache size: 1274052 7114556 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 32023179
1 22701952
2 8614445
3 2437582
4 676384
5 214721
6 83693
7 45649
8 34316
9 28701
>= 10 248242

Total processing time: 11m46.997sec


BK_STOP 1679533330230

--------------------
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:3665 (122), effective:560 (18)

initing FirstDep: 0m 0.000sec


iterations count:619 (20), effective:114 (3)

iterations count:890 (29), effective:140 (4)

iterations count:667 (22), effective:132 (4)

iterations count:132 (4), effective:17 (0)

iterations count:126 (4), effective:16 (0)

iterations count:887 (29), effective:78 (2)

iterations count:1924 (64), effective:316 (10)

iterations count:689 (22), effective:154 (5)

iterations count:1556 (51), effective:165 (5)

iterations count:353 (11), effective:46 (1)

iterations count:38 (1), effective:8 (0)

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

iterations count:163 (5), effective:19 (0)

iterations count:1010 (33), effective:154 (5)

iterations count:2069 (68), effective:303 (10)

iterations count:212 (7), effective:28 (0)

iterations count:905 (30), effective:172 (5)

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

iterations count:434 (14), effective:46 (1)

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

iterations count:509 (16), effective:109 (3)

iterations count:1155 (38), effective:121 (4)

iterations count:1340 (44), effective:142 (4)

iterations count:654 (21), effective:78 (2)

iterations count:671 (22), effective:143 (4)

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

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

iterations count:270 (9), effective:25 (0)

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

iterations count:270 (9), effective:25 (0)

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

iterations count:270 (9), effective:25 (0)

iterations count:372 (12), effective:19 (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="MAPK-PT-00040"
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 MAPK-PT-00040, 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 r234-tall-167856420500561"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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