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.r522-tall-167987247200329.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 Murphy-PT-D1N010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247200329
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.6K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 13K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 7.6K Mar 31 16:48 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 Murphy-PT-D1N010-CTLCardinality-00
FORMULA_NAME Murphy-PT-D1N010-CTLCardinality-01
FORMULA_NAME Murphy-PT-D1N010-CTLCardinality-02
FORMULA_NAME Murphy-PT-D1N010-CTLCardinality-03
FORMULA_NAME Murphy-PT-D1N010-CTLCardinality-04
FORMULA_NAME Murphy-PT-D1N010-CTLCardinality-05
FORMULA_NAME Murphy-PT-D1N010-CTLCardinality-06
FORMULA_NAME Murphy-PT-D1N010-CTLCardinality-07
FORMULA_NAME Murphy-PT-D1N010-CTLCardinality-08
FORMULA_NAME Murphy-PT-D1N010-CTLCardinality-09
FORMULA_NAME Murphy-PT-D1N010-CTLCardinality-10
FORMULA_NAME Murphy-PT-D1N010-CTLCardinality-11
FORMULA_NAME Murphy-PT-D1N010-CTLCardinality-12
FORMULA_NAME Murphy-PT-D1N010-CTLCardinality-13
FORMULA_NAME Murphy-PT-D1N010-CTLCardinality-14
FORMULA_NAME Murphy-PT-D1N010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680892634811

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=Murphy-PT-D1N010
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 18:37:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 18:37:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 18:37:16] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-04-07 18:37:16] [INFO ] Transformed 12 places.
[2023-04-07 18:37:16] [INFO ] Transformed 14 transitions.
[2023-04-07 18:37:16] [INFO ] Parsed PT model containing 12 places and 14 transitions and 54 arcs in 75 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 8 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
// Phase 1: matrix 14 rows 12 cols
[2023-04-07 18:37:16] [INFO ] Computed 3 invariants in 5 ms
[2023-04-07 18:37:16] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
[2023-04-07 18:37:16] [INFO ] Invariant cache hit.
[2023-04-07 18:37:16] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 18:37:16] [INFO ] Invariant cache hit.
[2023-04-07 18:37:16] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-07 18:37:16] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-04-07 18:37:16] [INFO ] Invariant cache hit.
[2023-04-07 18:37:16] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 262 ms. Remains : 12/12 places, 14/14 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-04-07 18:37:16] [INFO ] Flatten gal took : 13 ms
[2023-04-07 18:37:16] [INFO ] Flatten gal took : 5 ms
[2023-04-07 18:37:16] [INFO ] Input system was already deterministic with 14 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 82) seen :52
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) 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 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) 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 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Running SMT prover for 30 properties.
[2023-04-07 18:37:17] [INFO ] Invariant cache hit.
[2023-04-07 18:37:17] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:37:17] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-07 18:37:17] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
[2023-04-07 18:37:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:37:17] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-07 18:37:17] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :29
[2023-04-07 18:37:17] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-07 18:37:17] [INFO ] After 49ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :1 sat :29
[2023-04-07 18:37:17] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :29
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-04-07 18:37:17] [INFO ] After 301ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :29
Fused 30 Parikh solutions to 29 different solutions.
Parikh walk visited 1 properties in 70 ms.
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 3 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 18:37:17] [INFO ] Invariant cache hit.
[2023-04-07 18:37:17] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 12/12 places, 14/14 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) 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 28) 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 28) 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 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Probably explored full state space saw : 39780 states, properties seen :1
Probabilistic random walk after 307764 steps, saw 39780 distinct states, run finished after 924 ms. (steps per millisecond=333 ) properties seen :1
Explored full state space saw : 39780 states, properties seen :0
Exhaustive walk after 307764 steps, saw 39780 distinct states, run finished after 818 ms. (steps per millisecond=376 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 28 atomic propositions for a total of 15 simplifications.
FORMULA Murphy-PT-D1N010-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 18:37:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-04-07 18:37:19] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:37:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Murphy-PT-D1N010-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D1N010-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 18:37:19] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:37:19] [INFO ] Input system was already deterministic with 14 transitions.
FORMULA Murphy-PT-D1N010-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 18:37:19] [INFO ] Invariant cache hit.
[2023-04-07 18:37:19] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 18:37:19] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:37:19] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:37:19] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 18:37:19] [INFO ] Invariant cache hit.
[2023-04-07 18:37:19] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 18:37:19] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:37:19] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:37:19] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 18:37:19] [INFO ] Invariant cache hit.
[2023-04-07 18:37:19] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 18:37:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:19] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:37:19] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 18:37:19] [INFO ] Invariant cache hit.
[2023-04-07 18:37:19] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 18:37:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:19] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 18:37:19] [INFO ] Invariant cache hit.
[2023-04-07 18:37:19] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 18:37:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:19] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 18:37:19] [INFO ] Invariant cache hit.
[2023-04-07 18:37:19] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 18:37:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:19] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 18:37:19] [INFO ] Invariant cache hit.
[2023-04-07 18:37:19] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 18:37:19] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:37:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:19] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 18:37:19] [INFO ] Invariant cache hit.
[2023-04-07 18:37:20] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 18:37:20] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:20] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:20] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 18:37:20] [INFO ] Invariant cache hit.
[2023-04-07 18:37:20] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 18:37:20] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:20] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:20] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 18:37:20] [INFO ] Invariant cache hit.
[2023-04-07 18:37:20] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 18:37:20] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:20] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:20] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 18:37:20] [INFO ] Invariant cache hit.
[2023-04-07 18:37:20] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 18:37:20] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:20] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:20] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 18:37:20] [INFO ] Invariant cache hit.
[2023-04-07 18:37:20] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 18:37:20] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:20] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:20] [INFO ] Input system was already deterministic with 14 transitions.
[2023-04-07 18:37:20] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:20] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:37:20] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-04-07 18:37:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 12 places, 14 transitions and 54 arcs took 0 ms.
Total runtime 3956 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: 12 NrTr: 14 NrArc: 54)

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

net check time: 0m 0.000sec

init dd package: 0m 2.710sec


RS generation: 0m 0.002sec


-> reachability set: #nodes 237 (2.4e+02) #states 39,780 (4)



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

checking: EG [AX [1<=0]]
normalized: EG [~ [EX [~ [1<=0]]]]

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

FORMULA Murphy-PT-D1N010-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: EX [0<=0]
normalized: EX [0<=0]

abstracting: (0<=0)
states: 39,780 (4)
.-> the formula is TRUE

FORMULA Murphy-PT-D1N010-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [EX [EG [EX [[8<=p8 | 2<=p0]]]]]
normalized: ~ [E [true U ~ [EX [EG [EX [[8<=p8 | 2<=p0]]]]]]]

abstracting: (2<=p0)
states: 31,608 (4)
abstracting: (8<=p8)
states: 0
..
EG iterations: 1
.-> the formula is FALSE

FORMULA Murphy-PT-D1N010-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

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

abstracting: (p2<=p6)
states: 6,966 (3)
abstracting: (1<=0)
states: 0
.-> the formula is TRUE

FORMULA Murphy-PT-D1N010-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [E [A [AX [1<=0] U p3<=p2] U EF [~ [AF [3<=p2]]]]]
normalized: ~ [E [true U ~ [E [[~ [EG [~ [p3<=p2]]] & ~ [E [~ [p3<=p2] U [EX [~ [1<=0]] & ~ [p3<=p2]]]]] U E [true U EG [~ [3<=p2]]]]]]]

abstracting: (3<=p2)
states: 26,568 (4)
.
EG iterations: 1
abstracting: (p3<=p2)
states: 21,168 (4)
abstracting: (1<=0)
states: 0
.abstracting: (p3<=p2)
states: 21,168 (4)
abstracting: (p3<=p2)
states: 21,168 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Murphy-PT-D1N010-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [~ [E [[p8<=1 | 7<=p3] U p1<=8]]]
normalized: E [true U ~ [E [[p8<=1 | 7<=p3] U p1<=8]]]

abstracting: (p1<=8)
states: 29,700 (4)
abstracting: (7<=p3)
states: 13,752 (4)
abstracting: (p8<=1)
states: 26,520 (4)
-> the formula is TRUE

FORMULA Murphy-PT-D1N010-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EG [AX [[AG [[~ [10<=p0] & ~ [4<=p7]]] & ~ [6<=p5]]]]
normalized: EG [~ [EX [~ [[~ [6<=p5] & ~ [E [true U ~ [[~ [4<=p7] & ~ [10<=p0]]]]]]]]]]

abstracting: (10<=p0)
states: 8,064 (3)
abstracting: (4<=p7)
states: 0
abstracting: (6<=p5)
states: 17,280 (4)
..
EG iterations: 1
-> the formula is FALSE

FORMULA Murphy-PT-D1N010-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: ~ [A [EG [p11<=2] U E [AF [p9<=p6] U ~ [p6<=0]]]]
normalized: ~ [[~ [EG [~ [E [~ [EG [~ [p9<=p6]]] U ~ [p6<=0]]]]] & ~ [E [~ [E [~ [EG [~ [p9<=p6]]] U ~ [p6<=0]]] U [~ [EG [p11<=2]] & ~ [E [~ [EG [~ [p9<=p6]]] U ~ [p6<=0]]]]]]]]

abstracting: (p6<=0)
states: 19,890 (4)
abstracting: (p9<=p6)
states: 19,890 (4)
...
EG iterations: 3
abstracting: (p11<=2)
states: 33,150 (4)
.
EG iterations: 1
abstracting: (p6<=0)
states: 19,890 (4)
abstracting: (p9<=p6)
states: 19,890 (4)
...
EG iterations: 3
abstracting: (p6<=0)
states: 19,890 (4)
abstracting: (p9<=p6)
states: 19,890 (4)
...
EG iterations: 3
...
EG iterations: 3
-> the formula is FALSE

FORMULA Murphy-PT-D1N010-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [EX [[~ [p10<=p8] | ~ [p4<=p2]]]]
normalized: E [true U EX [[~ [p4<=p2] | ~ [p10<=p8]]]]

abstracting: (p10<=p8)
states: 19,890 (4)
abstracting: (p4<=p2)
states: 19,332 (4)
.-> the formula is TRUE

FORMULA Murphy-PT-D1N010-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: A [[EX [AG [[p4<=p8 | [p3<=9 | p6<=p1]]]] & [~ [[EF [8<=p4] | [p0<=p6 & p7<=p4]]] | p11<=p5]] U EF [~ [p1<=10]]]
normalized: [~ [EG [~ [E [true U ~ [p1<=10]]]]] & ~ [E [~ [E [true U ~ [p1<=10]]] U [~ [[[~ [[[p0<=p6 & p7<=p4] | E [true U 8<=p4]]] | p11<=p5] & EX [~ [E [true U ~ [[[p3<=9 | p6<=p1] | p4<=p8]]]]]]] & ~ [E [true U ~ [p1<=10]]]]]]]

abstracting: (p1<=10)
states: 33,228 (4)
abstracting: (p4<=p8)
states: 8,052 (3)
abstracting: (p6<=p1)
states: 37,836 (4)
abstracting: (p3<=9)
states: 32,472 (4)
.abstracting: (p11<=p5)
states: 33,744 (4)
abstracting: (8<=p4)
states: 12,096 (4)
abstracting: (p7<=p4)
states: 37,836 (4)
abstracting: (p0<=p6)
states: 6,030 (3)
abstracting: (p1<=10)
states: 33,228 (4)
abstracting: (p1<=10)
states: 33,228 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Murphy-PT-D1N010-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EF [[[[EX [~ [p0<=p1]] & [~ [E [3<=p10 U p5<=5]] & ~ [4<=p2]]] & [~ [3<=p3] & [~ [1<=p0] & ~ [10<=p6]]]] | [[EG [~ [9<=p3]] & AF [~ [p9<=p3]]] & [~ [p2<=8] & [~ [p3<=p9] | [~ [p7<=p8] | ~ [p3<=p7]]]]]]]
normalized: E [true U [[[[[~ [p3<=p7] | ~ [p7<=p8]] | ~ [p3<=p9]] & ~ [p2<=8]] & [~ [EG [p9<=p3]] & EG [~ [9<=p3]]]] | [[[~ [10<=p6] & ~ [1<=p0]] & ~ [3<=p3]] & [[~ [4<=p2] & ~ [E [3<=p10 U p5<=5]]] & EX [~ [p0<=p1]]]]]]

abstracting: (p0<=p1)
states: 20,952 (4)
.abstracting: (p5<=5)
states: 22,500 (4)
abstracting: (3<=p10)
states: 6,630 (3)
abstracting: (4<=p2)
states: 22,680 (4)
abstracting: (3<=p3)
states: 26,568 (4)
abstracting: (1<=p0)
states: 35,892 (4)
abstracting: (10<=p6)
states: 0
abstracting: (9<=p3)
states: 9,252 (3)
.
EG iterations: 1
abstracting: (p9<=p3)
states: 35,136 (4)
.
EG iterations: 1
abstracting: (p2<=8)
states: 30,528 (4)
abstracting: (p3<=p9)
states: 9,048 (3)
abstracting: (p7<=p8)
states: 33,150 (4)
abstracting: (p3<=p7)
states: 6,966 (3)
-> the formula is TRUE

FORMULA Murphy-PT-D1N010-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: AF [[EG [[[[~ [2<=p0] & ~ [10<=p6]] | ~ [p4<=p7]] & [4<=p10 | p9<=p6]]] & E [AG [EX [5<=p3]] U [[AG [p1<=6] & [p6<=p2 | 10<=p11]] & [AX [p8<=p4] & [[p10<=5 & [p3<=p10 & [p10<=3 | p1<=p10]]] | AG [2<=p1]]]]]]]
normalized: ~ [EG [~ [[E [~ [E [true U ~ [EX [5<=p3]]]] U [[[~ [E [true U ~ [2<=p1]]] | [p10<=5 & [p3<=p10 & [p10<=3 | p1<=p10]]]] & ~ [EX [~ [p8<=p4]]]] & [[p6<=p2 | 10<=p11] & ~ [E [true U ~ [p1<=6]]]]]] & EG [[[4<=p10 | p9<=p6] & [~ [p4<=p7] | [~ [10<=p6] & ~ [2<=p0]]]]]]]]]

abstracting: (2<=p0)
states: 31,608 (4)
abstracting: (10<=p6)
states: 0
abstracting: (p4<=p7)
states: 6,030 (3)
abstracting: (p9<=p6)
states: 19,890 (4)
abstracting: (4<=p10)
states: 0
.
EG iterations: 1
abstracting: (p1<=6)
states: 25,092 (4)
abstracting: (10<=p11)
states: 0
abstracting: (p6<=p2)
states: 37,458 (4)
abstracting: (p8<=p4)
states: 35,760 (4)
.abstracting: (p1<=p10)
states: 10,074 (4)
abstracting: (p10<=3)
states: 39,780 (4)
abstracting: (p3<=p10)
states: 11,124 (4)
abstracting: (p10<=5)
states: 39,780 (4)
abstracting: (2<=p1)
states: 31,608 (4)
abstracting: (5<=p3)
states: 19,476 (4)
.
EG iterations: 0
-> the formula is FALSE

FORMULA Murphy-PT-D1N010-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

totally nodes used: 31195 (3.1e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 88962 55764 144726
used/not used/entry size/cache size: 76824 67032040 16 1024MB
basic ops cache: hits/miss/sum: 47112 35457 82569
used/not used/entry size/cache size: 68617 16708599 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: 4165 1909 6074
used/not used/entry size/cache size: 1909 8386699 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 67081216
1 26304
2 844
3 281
4 88
5 23
6 10
7 6
8 6
9 11
>= 10 75

Total processing time: 0m 4.283sec


BK_STOP 1680892645452

--------------------
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.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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:277 (19), effective:98 (7)

initing FirstDep: 0m 0.000sec


iterations count:195 (13), effective:55 (3)

iterations count:63 (4), effective:26 (1)

iterations count:50 (3), effective:21 (1)

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

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

iterations count:106 (7), effective:16 (1)

iterations count:137 (9), effective:44 (3)

iterations count:117 (8), effective:30 (2)

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

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

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

iterations count:29 (2), effective:10 (0)

iterations count:143 (10), effective:49 (3)

iterations count:373 (26), effective:83 (5)

iterations count:98 (7), effective:24 (1)

iterations count:143 (10), effective:49 (3)

iterations count:143 (10), effective:49 (3)

iterations count:117 (8), effective:18 (1)

iterations count:335 (23), effective:84 (6)

iterations count:104 (7), effective:33 (2)

iterations count:141 (10), effective:22 (1)

iterations count:101 (7), effective:41 (2)

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="Murphy-PT-D1N010"
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 Murphy-PT-D1N010, 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 r522-tall-167987247200329"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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