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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 5.0K Feb 25 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Feb 25 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 11:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 11:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 11:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 25 11:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:19 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 14K 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 Kanban-PT-00050-CTLCardinality-00
FORMULA_NAME Kanban-PT-00050-CTLCardinality-01
FORMULA_NAME Kanban-PT-00050-CTLCardinality-02
FORMULA_NAME Kanban-PT-00050-CTLCardinality-03
FORMULA_NAME Kanban-PT-00050-CTLCardinality-04
FORMULA_NAME Kanban-PT-00050-CTLCardinality-05
FORMULA_NAME Kanban-PT-00050-CTLCardinality-06
FORMULA_NAME Kanban-PT-00050-CTLCardinality-07
FORMULA_NAME Kanban-PT-00050-CTLCardinality-08
FORMULA_NAME Kanban-PT-00050-CTLCardinality-09
FORMULA_NAME Kanban-PT-00050-CTLCardinality-10
FORMULA_NAME Kanban-PT-00050-CTLCardinality-11
FORMULA_NAME Kanban-PT-00050-CTLCardinality-12
FORMULA_NAME Kanban-PT-00050-CTLCardinality-13
FORMULA_NAME Kanban-PT-00050-CTLCardinality-14
FORMULA_NAME Kanban-PT-00050-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679466570012

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=Kanban-PT-00050
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 06:29:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 06:29:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 06:29:31] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-03-22 06:29:31] [INFO ] Transformed 16 places.
[2023-03-22 06:29:31] [INFO ] Transformed 16 transitions.
[2023-03-22 06:29:31] [INFO ] Parsed PT model containing 16 places and 16 transitions and 40 arcs in 76 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Support contains 16 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 8 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2023-03-22 06:29:31] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-22 06:29:31] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-22 06:29:31] [INFO ] Invariant cache hit.
[2023-03-22 06:29:31] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2023-03-22 06:29:31] [INFO ] Invariant cache hit.
[2023-03-22 06:29:31] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 243 ms. Remains : 16/16 places, 16/16 transitions.
Support contains 16 out of 16 places after structural reductions.
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 14 ms
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 4 ms
[2023-03-22 06:29:32] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 57) seen :55
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 06:29:32] [INFO ] Invariant cache hit.
[2023-03-22 06:29:32] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned sat
[2023-03-22 06:29:32] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 06:29:32] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 3 ms
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 3 ms
[2023-03-22 06:29:32] [INFO ] Input system was already deterministic with 16 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 15/16 places, 16/16 transitions.
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:29:32] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 3 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 14/16 places, 15/16 transitions.
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:29:32] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/16 places, 15/16 transitions.
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:29:32] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 15/16 places, 16/16 transitions.
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:29:32] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 12 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
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 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 10 transition count 11
Applied a total of 5 rules in 10 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 10/16 places, 11/16 transitions.
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 0 ms
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:29:32] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 15/16 places, 16/16 transitions.
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 0 ms
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:29:32] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/16 places, 15/16 transitions.
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:29:32] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 9 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
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 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 10 transition count 11
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 10 transition count 11
Applied a total of 5 rules in 3 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 10/16 places, 11/16 transitions.
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:29:32] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 4 edges and 16 vertex of which 2 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 2 place count 15 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 14
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 13 transition count 13
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 13 transition count 13
Applied a total of 5 rules in 2 ms. Remains 13 /16 variables (removed 3) and now considering 13/16 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 13/16 places, 13/16 transitions.
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 0 ms
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:29:32] [INFO ] Input system was already deterministic with 13 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 0 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 15/16 places, 16/16 transitions.
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:29:32] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 0 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 15/16 places, 16/16 transitions.
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:29:32] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 11 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
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 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 10 transition count 11
Applied a total of 5 rules in 3 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 10/16 places, 11/16 transitions.
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:29:32] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/16 places, 15/16 transitions.
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:29:32] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 12 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
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 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 10 transition count 11
Applied a total of 5 rules in 3 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 10/16 places, 11/16 transitions.
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:29:32] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 0 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 15/16 places, 16/16 transitions.
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 0 ms
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:29:32] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 7 edges and 16 vertex of which 4 / 16 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Ensure Unique test removed 1 places
Applied a total of 1 rules in 2 ms. Remains 13 /16 variables (removed 3) and now considering 14/16 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 13/16 places, 14/16 transitions.
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:29:32] [INFO ] Input system was already deterministic with 14 transitions.
Finished random walk after 51 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=51 )
FORMULA Kanban-PT-00050-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:29:32] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:29:32] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-22 06:29:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 16 places, 16 transitions and 40 arcs took 0 ms.
Total runtime 1236 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: 16 NrTr: 16 NrArc: 40)

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

net check time: 0m 0.000sec

init dd package: 0m 2.742sec


RS generation: 0m 0.139sec


-> reachability set: #nodes 3216 (3.2e+03) #states 10,425,941,194,901,336 (16)



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

checking: EF [AG [[~ [8<=p3] | EX [0<=0]]]]
normalized: E [true U ~ [E [true U ~ [[~ [8<=p3] | EX [0<=0]]]]]]

abstracting: (0<=0)
states: 10,425,941,194,901,336 (16)
.abstracting: (8<=p3)
states: 6,826,217,780,200,104 (15)
-> the formula is TRUE

FORMULA Kanban-PT-00050-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

checking: EF [EX [EF [8<=p15]]]
normalized: E [true U EX [E [true U 8<=p15]]]

abstracting: (8<=p15)
states: 6,826,217,780,200,104 (15)
.-> the formula is TRUE

FORMULA Kanban-PT-00050-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.146sec

checking: AF [AG [p6<=40]]
normalized: ~ [EG [E [true U ~ [p6<=40]]]]

abstracting: (p6<=40)
states: 10,328,028,317,633,416 (16)

EG iterations: 0
-> the formula is FALSE

FORMULA Kanban-PT-00050-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.139sec

checking: EG [AG [[30<=p13 | AX [1<=0]]]]
normalized: EG [~ [E [true U ~ [[30<=p13 | ~ [EX [~ [1<=0]]]]]]]]

abstracting: (1<=0)
states: 0
.abstracting: (30<=p13)
states: 140,923,311,949,420 (14)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Kanban-PT-00050-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.081sec

checking: EX [AG [p6<=10]]
normalized: EX [~ [E [true U ~ [p6<=10]]]]

abstracting: (p6<=10)
states: 5,316,669,235,648,056 (15)
.-> the formula is FALSE

FORMULA Kanban-PT-00050-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.133sec

checking: AF [[EG [EF [~ [17<=p13]]] | 10<=p6]]
normalized: ~ [EG [~ [[10<=p6 | EG [E [true U ~ [17<=p13]]]]]]]

abstracting: (17<=p13)
states: 1,439,181,003,914,472 (15)

EG iterations: 0
abstracting: (10<=p6)
states: 5,492,467,356,197,276 (15)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Kanban-PT-00050-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.068sec

checking: AG [E [~ [15<=p5] U [42<=p5 & EG [p14<=37]]]]
normalized: ~ [E [true U ~ [E [~ [15<=p5] U [42<=p5 & EG [p14<=37]]]]]]

abstracting: (p14<=37)
states: 10,131,402,445,537,568 (16)
.
EG iterations: 1
abstracting: (42<=p5)
states: 73,434,657,950,940 (13)
abstracting: (15<=p5)
states: 3,754,513,784,691,696 (15)
-> the formula is FALSE

FORMULA Kanban-PT-00050-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.065sec

checking: EF [[~ [E [50<=p0 U p15<=25]] & ~ [38<=p14]]]
normalized: E [true U [~ [38<=p14] & ~ [E [50<=p0 U p15<=25]]]]

abstracting: (p15<=25)
states: 8,744,360,789,617,856 (15)
abstracting: (50<=p0)
states: 548,777,476 (8)
abstracting: (38<=p14)
states: 294,538,749,363,768 (14)
-> the formula is TRUE

FORMULA Kanban-PT-00050-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.156sec

checking: AG [[AF [10<=p3] | [EX [0<=0] & EG [p15<=p13]]]]
normalized: ~ [E [true U ~ [[[EG [p15<=p13] & EX [0<=0]] | ~ [EG [~ [10<=p3]]]]]]]

abstracting: (10<=p3)
states: 6,054,581,771,196,504 (15)
.
EG iterations: 1
abstracting: (0<=0)
states: 10,425,941,194,901,336 (16)
.abstracting: (p15<=p13)
states: 3,871,551,556,998,216 (15)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Kanban-PT-00050-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.634sec

checking: [EX [~ [A [p15<=p0 U p4<=5]]] & ~ [E [EF [[[~ [p2<=25] | 4<=p5] & ~ [23<=p15]]] U 40<=p6]]]
normalized: [~ [E [E [true U [~ [23<=p15] & [4<=p5 | ~ [p2<=25]]]] U 40<=p6]] & EX [~ [[~ [EG [~ [p4<=5]]] & ~ [E [~ [p4<=5] U [~ [p15<=p0] & ~ [p4<=5]]]]]]]]

abstracting: (p4<=5)
states: 3,209,317,081,722,596 (15)
abstracting: (p15<=p0)
states: 3,871,551,556,998,216 (15)
abstracting: (p4<=5)
states: 3,209,317,081,722,596 (15)
abstracting: (p4<=5)
states: 3,209,317,081,722,596 (15)
.
EG iterations: 1
.abstracting: (40<=p6)
states: 127,286,740,448,296 (14)
abstracting: (p2<=25)
states: 8,744,360,789,617,856 (15)
abstracting: (4<=p5)
states: 8,199,758,412,655,264 (15)
abstracting: (23<=p15)
states: 2,265,578,968,470,636 (15)
-> the formula is FALSE

FORMULA Kanban-PT-00050-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.958sec

checking: EX [[AG [EF [p6<=p15]] | [EX [[p4<=47 & p1<=p0]] & [EX [~ [p7<=6]] | [~ [9<=p12] & ~ [p0<=40]]]]]]
normalized: EX [[[[EX [~ [p7<=6]] | [~ [p0<=40] & ~ [9<=p12]]] & EX [[p4<=47 & p1<=p0]]] | ~ [E [true U ~ [E [true U p6<=p15]]]]]]

abstracting: (p6<=p15)
states: 5,785,450,047,027,846 (15)
abstracting: (p1<=p0)
states: 3,871,551,556,998,216 (15)
abstracting: (p4<=47)
states: 10,421,490,609,570,976 (16)
.abstracting: (9<=p12)
states: 6,434,004,871,770,476 (15)
abstracting: (p0<=40)
states: 10,421,582,804,186,944 (16)
abstracting: (p7<=6)
states: 3,669,952,663,414,856 (15)
..-> the formula is TRUE

FORMULA Kanban-PT-00050-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.424sec

checking: EG [E [[E [[EF [p6<=p10] & EX [39<=p7]] U p1<=45] | [AG [A [p15<=32 U p2<=48]] & A [AF [p8<=p9] U AX [p3<=11]]]] U 24<=p5]]
normalized: EG [E [[[[~ [EG [EX [~ [p3<=11]]]] & ~ [E [EX [~ [p3<=11]] U [EG [~ [p8<=p9]] & EX [~ [p3<=11]]]]]] & ~ [E [true U ~ [[~ [EG [~ [p2<=48]]] & ~ [E [~ [p2<=48] U [~ [p15<=32] & ~ [p2<=48]]]]]]]]] | E [[EX [39<=p7] & E [true U p6<=p10]] U p1<=45]] U 24<=p5]]

abstracting: (24<=p5)
states: 1,626,243,879,713,544 (15)
abstracting: (p1<=45)
states: 10,401,440,475,707,840 (16)
abstracting: (p6<=p10)
states: 5,393,441,832,596,766 (15)
abstracting: (39<=p7)
states: 162,001,306,025,104 (14)
.abstracting: (p2<=48)
states: 10,423,058,466,819,908 (16)
abstracting: (p15<=32)
states: 9,723,479,135,525,012 (15)
abstracting: (p2<=48)
states: 10,423,058,466,819,908 (16)
abstracting: (p2<=48)
states: 10,423,058,466,819,908 (16)
.
EG iterations: 1
abstracting: (p3<=11)
states: 5,091,940,469,006,248 (15)
.abstracting: (p8<=p9)
states: 5,363,400,381,616,836 (15)
..
EG iterations: 2
abstracting: (p3<=11)
states: 5,091,940,469,006,248 (15)
.abstracting: (p3<=11)
states: 5,091,940,469,006,248 (15)
..
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA Kanban-PT-00050-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.005sec

checking: AG [EF [[EF [p3<=32] | [[E [p14<=p7 U p14<=p13] & [43<=p7 | p5<=48]] | [p7<=p11 & p0<=p12]]]]]
normalized: ~ [E [true U ~ [E [true U [E [true U p3<=32] | [[E [p14<=p7 U p14<=p13] & [43<=p7 | p5<=48]] | [p7<=p11 & p0<=p12]]]]]]]

abstracting: (p0<=p12)
states: 6,909,504,091,400,196 (15)
abstracting: (p7<=p11)
states: 5,393,441,832,596,766 (15)
abstracting: (p5<=48)
states: 10,424,160,960,769,192 (16)
abstracting: (43<=p7)
states: 53,407,023,964,320 (13)
abstracting: (p14<=p13)
states: 3,871,551,556,998,216 (15)
abstracting: (p14<=p7)
states: 4,979,492,122,731,516 (15)
abstracting: (p3<=32)
states: 9,723,479,135,525,012 (15)
-> the formula is TRUE

FORMULA Kanban-PT-00050-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.855sec

checking: [EX [[EG [p8<=p7] | EX [AF [p4<=p13]]]] & ~ [E [[EG [[~ [p2<=p1] & ~ [33<=p3]]] | AG [~ [p6<=p14]]] U AG [[EX [p14<=15] | ~ [p14<=39]]]]]]
normalized: [~ [E [[~ [E [true U p6<=p14]] | EG [[~ [33<=p3] & ~ [p2<=p1]]]] U ~ [E [true U ~ [[~ [p14<=39] | EX [p14<=15]]]]]]] & EX [[EX [~ [EG [~ [p4<=p13]]]] | EG [p8<=p7]]]]

abstracting: (p8<=p7)
states: 5,393,441,832,596,766 (15)
.
EG iterations: 1
abstracting: (p4<=p13)
states: 4,126,144,519,495,206 (15)
....................................................
EG iterations: 52
..abstracting: (p14<=15)
states: 6,381,109,857,191,264 (15)
.abstracting: (p14<=39)
states: 10,237,129,914,063,728 (16)
abstracting: (p2<=p1)
states: 5,338,359,665,386,956 (15)
abstracting: (33<=p3)
states: 702,462,059,376,324 (14)
....................................................
EG iterations: 52
abstracting: (p6<=p14)
states: 5,785,450,047,027,846 (15)
-> the formula is TRUE

FORMULA Kanban-PT-00050-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.154sec

checking: E [[p6<=p9 | AG [~ [EX [~ [15<=p14]]]]] U [AG [[EX [A [p8<=7 U p14<=10]] | A [[p12<=p5 & 32<=p5] U A [p5<=p10 U 16<=p0]]]] | ~ [[AG [[AG [p15<=p1] & E [p4<=32 U 13<=p12]]] | ~ [p9<=1]]]]]
normalized: E [[p6<=p9 | ~ [E [true U EX [~ [15<=p14]]]]] U [~ [[~ [p9<=1] | ~ [E [true U ~ [[E [p4<=32 U 13<=p12] & ~ [E [true U ~ [p15<=p1]]]]]]]]] | ~ [E [true U ~ [[[~ [EG [~ [[~ [EG [~ [16<=p0]]] & ~ [E [~ [16<=p0] U [~ [p5<=p10] & ~ [16<=p0]]]]]]]] & ~ [E [~ [[~ [EG [~ [16<=p0]]] & ~ [E [~ [16<=p0] U [~ [p5<=p10] & ~ [16<=p0]]]]]] U [~ [[p12<=p5 & 32<=p5]] & ~ [[~ [EG [~ [16<=p0]]] & ~ [E [~ [16<=p0] U [~ [p5<=p10] & ~ [16<=p0]]]]]]]]]] | EX [[~ [EG [~ [p14<=10]]] & ~ [E [~ [p14<=10] U [~ [p8<=7] & ~ [p14<=10]]]]]]]]]]]]

abstracting: (p14<=10)
states: 4,738,017,411,409,568 (15)
abstracting: (p8<=7)
states: 4,110,560,611,120,496 (15)
abstracting: (p14<=10)
states: 4,738,017,411,409,568 (15)
abstracting: (p14<=10)
states: 4,738,017,411,409,568 (15)
.
EG iterations: 1
.abstracting: (16<=p0)
states: 1,656,990,784,138,872 (15)
abstracting: (p5<=p10)
states: 5,393,441,832,596,766 (15)
abstracting: (16<=p0)
states: 1,656,990,784,138,872 (15)
abstracting: (16<=p0)
states: 1,656,990,784,138,872 (15)
.
EG iterations: 1
abstracting: (32<=p5)
states: 591,927,848,937,880 (14)
abstracting: (p12<=p5)
states: 4,979,492,122,731,516 (15)
abstracting: (16<=p0)
states: 1,656,990,784,138,872 (15)
abstracting: (p5<=p10)
states: 5,393,441,832,596,766 (15)
abstracting: (16<=p0)
states: 1,656,990,784,138,872 (15)
abstracting: (16<=p0)
states: 1,656,990,784,138,872 (15)
.
EG iterations: 1
abstracting: (16<=p0)
states: 1,656,990,784,138,872 (15)
abstracting: (p5<=p10)
states: 5,393,441,832,596,766 (15)
abstracting: (16<=p0)
states: 1,656,990,784,138,872 (15)
abstracting: (16<=p0)
states: 1,656,990,784,138,872 (15)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p15<=p1)
states: 5,380,094,192,436,756 (15)
abstracting: (13<=p12)
states: 4,992,776,379,093,048 (15)
abstracting: (p4<=32)
states: 9,918,574,467,240,296 (15)
abstracting: (p9<=1)
states: 1,157,597,244,426,636 (15)
abstracting: (15<=p14)
states: 4,348,245,465,193,188 (15)
.abstracting: (p6<=p9)
states: 5,393,441,832,596,766 (15)
-> the formula is TRUE

FORMULA Kanban-PT-00050-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.463sec

totally nodes used: 10463631 (1.0e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 113889122 22542762 136431884
used/not used/entry size/cache size: 24589653 42519211 16 1024MB
basic ops cache: hits/miss/sum: 51578495 14449944 66028439
used/not used/entry size/cache size: 11864039 4913177 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: 1724728 781696 2506424
used/not used/entry size/cache size: 749427 7639181 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 57617934
1 8725945
2 705923
3 45735
4 4802
5 953
6 634
7 508
8 330
9 281
>= 10 5819

Total processing time: 0m35.663sec


BK_STOP 1679466609362

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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:3566 (222), effective:1100 (68)

initing FirstDep: 0m 0.000sec


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

iterations count:360 (22), effective:109 (6)

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

iterations count:2566 (160), effective:730 (45)

iterations count:331 (20), effective:84 (5)

iterations count:676 (42), effective:190 (11)

iterations count:526 (32), effective:136 (8)

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

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

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

iterations count:1152 (72), effective:361 (22)

iterations count:3299 (206), effective:885 (55)

iterations count:787 (49), effective:207 (12)

iterations count:347 (21), effective:104 (6)

iterations count:2503 (156), effective:712 (44)

iterations count:116 (7), effective:50 (3)

iterations count:116 (7), effective:50 (3)

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

iterations count:1925 (120), effective:583 (36)

iterations count:3880 (242), effective:1063 (66)

iterations count:1269 (79), effective:340 (21)

iterations count:1751 (109), effective:532 (33)

iterations count:683 (42), effective:222 (13)

iterations count:1094 (68), effective:291 (18)

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

iterations count:679 (42), effective:198 (12)

iterations count:116 (7), effective:50 (3)

iterations count:320 (20), effective:88 (5)

iterations count:432 (27), effective:173 (10)

iterations count:432 (27), effective:173 (10)

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

iterations count:432 (27), effective:173 (10)

iterations count:640 (40), effective:168 (10)

iterations count:152 (9), effective:61 (3)

iterations count:590 (36), effective:178 (11)

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

iterations count:973 (60), effective:320 (20)

iterations count:1633 (102), effective:441 (27)

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="Kanban-PT-00050"
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 Kanban-PT-00050, 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-167856420000257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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