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.r138-smll-167819419200002.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 Dekker-PT-010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819419200002
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.0K Feb 26 01:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 01:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 01:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 01:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 01:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 26 01:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 01:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Feb 26 01:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 65K 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 Dekker-PT-010-CTLFireability-00
FORMULA_NAME Dekker-PT-010-CTLFireability-01
FORMULA_NAME Dekker-PT-010-CTLFireability-02
FORMULA_NAME Dekker-PT-010-CTLFireability-03
FORMULA_NAME Dekker-PT-010-CTLFireability-04
FORMULA_NAME Dekker-PT-010-CTLFireability-05
FORMULA_NAME Dekker-PT-010-CTLFireability-06
FORMULA_NAME Dekker-PT-010-CTLFireability-07
FORMULA_NAME Dekker-PT-010-CTLFireability-08
FORMULA_NAME Dekker-PT-010-CTLFireability-09
FORMULA_NAME Dekker-PT-010-CTLFireability-10
FORMULA_NAME Dekker-PT-010-CTLFireability-11
FORMULA_NAME Dekker-PT-010-CTLFireability-12
FORMULA_NAME Dekker-PT-010-CTLFireability-13
FORMULA_NAME Dekker-PT-010-CTLFireability-14
FORMULA_NAME Dekker-PT-010-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678531213463

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 10:40:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 10:40:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 10:40:17] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2023-03-11 10:40:17] [INFO ] Transformed 50 places.
[2023-03-11 10:40:17] [INFO ] Transformed 120 transitions.
[2023-03-11 10:40:17] [INFO ] Found NUPN structural information;
[2023-03-11 10:40:17] [INFO ] Parsed PT model containing 50 places and 120 transitions and 820 arcs in 288 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Dekker-PT-010-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-010-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-010-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 120/120 transitions.
Applied a total of 0 rules in 27 ms. Remains 50 /50 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2023-03-11 10:40:17] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
// Phase 1: matrix 40 rows 50 cols
[2023-03-11 10:40:17] [INFO ] Computed 30 place invariants in 21 ms
[2023-03-11 10:40:17] [INFO ] Implicit Places using invariants in 363 ms returned [29, 32, 38, 41]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 427 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/50 places, 120/120 transitions.
Applied a total of 0 rules in 4 ms. Remains 46 /46 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 461 ms. Remains : 46/50 places, 120/120 transitions.
Support contains 41 out of 46 places after structural reductions.
[2023-03-11 10:40:18] [INFO ] Flatten gal took : 100 ms
[2023-03-11 10:40:18] [INFO ] Flatten gal took : 36 ms
[2023-03-11 10:40:18] [INFO ] Input system was already deterministic with 120 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 852 ms. (steps per millisecond=11 ) properties (out of 59) seen :55
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 10:40:19] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
// Phase 1: matrix 40 rows 46 cols
[2023-03-11 10:40:19] [INFO ] Computed 26 place invariants in 3 ms
[2023-03-11 10:40:19] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2023-03-11 10:40:19] [INFO ] [Real]Absence check using 20 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-11 10:40:19] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2023-03-11 10:40:19] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2023-03-11 10:40:19] [INFO ] [Nat]Absence check using 20 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-11 10:40:19] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-11 10:40:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-11 10:40:19] [INFO ] After 14ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2023-03-11 10:40:19] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 7 ms to minimize.
[2023-03-11 10:40:19] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2023-03-11 10:40:19] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
[2023-03-11 10:40:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 166 ms
[2023-03-11 10:40:19] [INFO ] After 193ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-11 10:40:19] [INFO ] After 354ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 120/120 transitions.
Applied a total of 0 rules in 21 ms. Remains 46 /46 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 46/46 places, 120/120 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 49613 steps, run visited all 1 properties in 140 ms. (steps per millisecond=354 )
Probabilistic random walk after 49613 steps, saw 4693 distinct states, run finished after 140 ms. (steps per millisecond=354 ) properties seen :1
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 16 ms
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 17 ms
[2023-03-11 10:40:20] [INFO ] Input system was already deterministic with 120 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 120/120 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 46/46 places, 120/120 transitions.
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 12 ms
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 13 ms
[2023-03-11 10:40:20] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 120/120 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 46/46 places, 120/120 transitions.
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 19 ms
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 12 ms
[2023-03-11 10:40:20] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 46/46 places, 120/120 transitions.
Applied a total of 0 rules in 11 ms. Remains 46 /46 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 46/46 places, 120/120 transitions.
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 11 ms
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 13 ms
[2023-03-11 10:40:20] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 120/120 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 46/46 places, 120/120 transitions.
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 9 ms
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 15 ms
[2023-03-11 10:40:20] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 120/120 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 46/46 places, 120/120 transitions.
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 14 ms
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 15 ms
[2023-03-11 10:40:20] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 120/120 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 46/46 places, 120/120 transitions.
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 13 ms
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 13 ms
[2023-03-11 10:40:20] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 120/120 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 46/46 places, 120/120 transitions.
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 12 ms
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 13 ms
[2023-03-11 10:40:20] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 120/120 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 46/46 places, 120/120 transitions.
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 11 ms
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 10 ms
[2023-03-11 10:40:20] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 120/120 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 46/46 places, 120/120 transitions.
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 10 ms
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 11 ms
[2023-03-11 10:40:20] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 120/120 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 46/46 places, 120/120 transitions.
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 10 ms
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 11 ms
[2023-03-11 10:40:20] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 120/120 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 46/46 places, 120/120 transitions.
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 10 ms
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 10 ms
[2023-03-11 10:40:20] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 120/120 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 46/46 places, 120/120 transitions.
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 9 ms
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 9 ms
[2023-03-11 10:40:20] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 120/120 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 46/46 places, 120/120 transitions.
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 8 ms
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 10 ms
[2023-03-11 10:40:20] [INFO ] Input system was already deterministic with 120 transitions.
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 7 ms
[2023-03-11 10:40:21] [INFO ] Flatten gal took : 7 ms
[2023-03-11 10:40:21] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-11 10:40:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 46 places, 120 transitions and 776 arcs took 2 ms.
Total runtime 4339 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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 46 NrTr: 120 NrArc: 776)

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

net check time: 0m 0.000sec

init dd package: 0m 3.481sec


RS generation: 0m 0.018sec


-> reachability set: #nodes 433 (4.3e+02) #states 6,144 (3)



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

checking: EF [AX [[[p7<=1 & 1<=p7] & [[p13<=1 & 1<=p13] & [p36<=1 & 1<=p36]]]]]
normalized: E [true U ~ [EX [~ [[[p7<=1 & 1<=p7] & [[p13<=1 & 1<=p13] & [p36<=1 & 1<=p36]]]]]]]

abstracting: (1<=p36)
states: 2,816 (3)
abstracting: (p36<=1)
states: 6,144 (3)
abstracting: (1<=p13)
states: 3,328 (3)
abstracting: (p13<=1)
states: 6,144 (3)
abstracting: (1<=p7)
states: 3,328 (3)
abstracting: (p7<=1)
states: 6,144 (3)
.-> the formula is FALSE

FORMULA Dekker-PT-010-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: AG [EX [EG [AF [[[p1<=0 & 0<=p1] | [[p11<=0 & 0<=p11] | [p21<=0 & 0<=p21]]]]]]]
normalized: ~ [E [true U ~ [EX [EG [~ [EG [~ [[[[p21<=0 & 0<=p21] | [p11<=0 & 0<=p11]] | [p1<=0 & 0<=p1]]]]]]]]]]

abstracting: (0<=p1)
states: 6,144 (3)
abstracting: (p1<=0)
states: 2,816 (3)
abstracting: (0<=p11)
states: 6,144 (3)
abstracting: (p11<=0)
states: 2,816 (3)
abstracting: (0<=p21)
states: 6,144 (3)
abstracting: (p21<=0)
states: 3,328 (3)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is TRUE

FORMULA Dekker-PT-010-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: EX [[[p5<=0 & 0<=p5] | [[p17<=0 & 0<=p17] | [p41<=0 & 0<=p41]]]]
normalized: EX [[[[p41<=0 & 0<=p41] | [p17<=0 & 0<=p17]] | [p5<=0 & 0<=p5]]]

abstracting: (0<=p5)
states: 6,144 (3)
abstracting: (p5<=0)
states: 2,816 (3)
abstracting: (0<=p17)
states: 6,144 (3)
abstracting: (p17<=0)
states: 2,816 (3)
abstracting: (0<=p41)
states: 6,144 (3)
abstracting: (p41<=0)
states: 3,328 (3)
.-> the formula is TRUE

FORMULA Dekker-PT-010-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [EF [[[A [[[p7<=1 & 1<=p7] & [[p19<=1 & 1<=p19] & [p29<=1 & 1<=p29]]] U [[p17<=1 & 1<=p17] & [[p19<=1 & 1<=p19] & [p44<=1 & 1<=p44]]]] & [[p7<=1 & 1<=p7] & [p11<=1 & 1<=p11]]] & [[p34<=1 & 1<=p34] & [[p2<=1 & 1<=p2] & [p23<=1 & 1<=p23]]]]]]
normalized: ~ [E [true U ~ [E [true U [[[[p23<=1 & 1<=p23] & [p2<=1 & 1<=p2]] & [p34<=1 & 1<=p34]] & [[[p11<=1 & 1<=p11] & [p7<=1 & 1<=p7]] & [~ [EG [~ [[[[p44<=1 & 1<=p44] & [p19<=1 & 1<=p19]] & [p17<=1 & 1<=p17]]]]] & ~ [E [~ [[[[p44<=1 & 1<=p44] & [p19<=1 & 1<=p19]] & [p17<=1 & 1<=p17]]] U [~ [[[[p29<=1 & 1<=p29] & [p19<=1 & 1<=p19]] & [p7<=1 & 1<=p7]]] & ~ [[[[p44<=1 & 1<=p44] & [p19<=1 & 1<=p19]] & [p17<=1 & 1<=p17]]]]]]]]]]]]]

abstracting: (1<=p17)
states: 3,328 (3)
abstracting: (p17<=1)
states: 6,144 (3)
abstracting: (1<=p19)
states: 3,328 (3)
abstracting: (p19<=1)
states: 6,144 (3)
abstracting: (1<=p44)
states: 2,816 (3)
abstracting: (p44<=1)
states: 6,144 (3)
abstracting: (1<=p7)
states: 3,328 (3)
abstracting: (p7<=1)
states: 6,144 (3)
abstracting: (1<=p19)
states: 3,328 (3)
abstracting: (p19<=1)
states: 6,144 (3)
abstracting: (1<=p29)
states: 2,816 (3)
abstracting: (p29<=1)
states: 6,144 (3)
abstracting: (1<=p17)
states: 3,328 (3)
abstracting: (p17<=1)
states: 6,144 (3)
abstracting: (1<=p19)
states: 3,328 (3)
abstracting: (p19<=1)
states: 6,144 (3)
abstracting: (1<=p44)
states: 2,816 (3)
abstracting: (p44<=1)
states: 6,144 (3)
abstracting: (1<=p17)
states: 3,328 (3)
abstracting: (p17<=1)
states: 6,144 (3)
abstracting: (1<=p19)
states: 3,328 (3)
abstracting: (p19<=1)
states: 6,144 (3)
abstracting: (1<=p44)
states: 2,816 (3)
abstracting: (p44<=1)
states: 6,144 (3)
.
EG iterations: 1
abstracting: (1<=p7)
states: 3,328 (3)
abstracting: (p7<=1)
states: 6,144 (3)
abstracting: (1<=p11)
states: 3,328 (3)
abstracting: (p11<=1)
states: 6,144 (3)
abstracting: (1<=p34)
states: 2,816 (3)
abstracting: (p34<=1)
states: 6,144 (3)
abstracting: (1<=p2)
states: 2,816 (3)
abstracting: (p2<=1)
states: 6,144 (3)
abstracting: (1<=p23)
states: 2,816 (3)
abstracting: (p23<=1)
states: 6,144 (3)
-> the formula is TRUE

FORMULA Dekker-PT-010-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: ~ [A [[[~ [EX [[[p7<=1 & 1<=p7] & [[p19<=1 & 1<=p19] & [p29<=1 & 1<=p29]]]]] & EX [[[p9<=1 & 1<=p9] & [[p15<=1 & 1<=p15] & [p38<=1 & 1<=p38]]]]] | [[[p7<=1 & 1<=p7] & [[p17<=1 & 1<=p17] & [p29<=1 & 1<=p29]]] | [[p4<=1 & 1<=p4] & [p26<=1 & 1<=p26]]]] U [[p5<=1 & 1<=p5] & [[p19<=1 & 1<=p19] & [p27<=1 & 1<=p27]]]]]
normalized: ~ [[~ [EG [~ [[[[p27<=1 & 1<=p27] & [p19<=1 & 1<=p19]] & [p5<=1 & 1<=p5]]]]] & ~ [E [~ [[[[p27<=1 & 1<=p27] & [p19<=1 & 1<=p19]] & [p5<=1 & 1<=p5]]] U [~ [[[[[p26<=1 & 1<=p26] & [p4<=1 & 1<=p4]] | [[[p29<=1 & 1<=p29] & [p17<=1 & 1<=p17]] & [p7<=1 & 1<=p7]]] | [EX [[[[p38<=1 & 1<=p38] & [p15<=1 & 1<=p15]] & [p9<=1 & 1<=p9]]] & ~ [EX [[[[p29<=1 & 1<=p29] & [p19<=1 & 1<=p19]] & [p7<=1 & 1<=p7]]]]]]] & ~ [[[[p27<=1 & 1<=p27] & [p19<=1 & 1<=p19]] & [p5<=1 & 1<=p5]]]]]]]]

abstracting: (1<=p5)
states: 3,328 (3)
abstracting: (p5<=1)
states: 6,144 (3)
abstracting: (1<=p19)
states: 3,328 (3)
abstracting: (p19<=1)
states: 6,144 (3)
abstracting: (1<=p27)
states: 2,816 (3)
abstracting: (p27<=1)
states: 6,144 (3)
abstracting: (1<=p7)
states: 3,328 (3)
abstracting: (p7<=1)
states: 6,144 (3)
abstracting: (1<=p19)
states: 3,328 (3)
abstracting: (p19<=1)
states: 6,144 (3)
abstracting: (1<=p29)
states: 2,816 (3)
abstracting: (p29<=1)
states: 6,144 (3)
.abstracting: (1<=p9)
states: 3,328 (3)
abstracting: (p9<=1)
states: 6,144 (3)
abstracting: (1<=p15)
states: 3,328 (3)
abstracting: (p15<=1)
states: 6,144 (3)
abstracting: (1<=p38)
states: 2,816 (3)
abstracting: (p38<=1)
states: 6,144 (3)
.abstracting: (1<=p7)
states: 3,328 (3)
abstracting: (p7<=1)
states: 6,144 (3)
abstracting: (1<=p17)
states: 3,328 (3)
abstracting: (p17<=1)
states: 6,144 (3)
abstracting: (1<=p29)
states: 2,816 (3)
abstracting: (p29<=1)
states: 6,144 (3)
abstracting: (1<=p4)
states: 2,816 (3)
abstracting: (p4<=1)
states: 6,144 (3)
abstracting: (1<=p26)
states: 2,816 (3)
abstracting: (p26<=1)
states: 6,144 (3)
abstracting: (1<=p5)
states: 3,328 (3)
abstracting: (p5<=1)
states: 6,144 (3)
abstracting: (1<=p19)
states: 3,328 (3)
abstracting: (p19<=1)
states: 6,144 (3)
abstracting: (1<=p27)
states: 2,816 (3)
abstracting: (p27<=1)
states: 6,144 (3)
abstracting: (1<=p5)
states: 3,328 (3)
abstracting: (p5<=1)
states: 6,144 (3)
abstracting: (1<=p19)
states: 3,328 (3)
abstracting: (p19<=1)
states: 6,144 (3)
abstracting: (1<=p27)
states: 2,816 (3)
abstracting: (p27<=1)
states: 6,144 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Dekker-PT-010-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.038sec

checking: EF [[[AF [[[p0<=1 & 1<=p0] & [p20<=1 & 1<=p20]]] & [EF [[[[p7<=0 & 0<=p7] | [[p11<=0 & 0<=p11] | [p34<=0 & 0<=p34]]] & AG [[[p3<=1 & 1<=p3] & [[p7<=1 & 1<=p7] & [p24<=1 & 1<=p24]]]]]] & [p3<=1 & 1<=p3]]] & [[p17<=1 & 1<=p17] & [[p24<=1 & 1<=p24] & [EX [[[p13<=0 & 0<=p13] | [p37<=0 & 0<=p37]]] | [[p13<=1 & 1<=p13] & [p36<=1 & 1<=p36]]]]]]]
normalized: E [true U [[[[[[p13<=1 & 1<=p13] & [p36<=1 & 1<=p36]] | EX [[[p37<=0 & 0<=p37] | [p13<=0 & 0<=p13]]]] & [p24<=1 & 1<=p24]] & [p17<=1 & 1<=p17]] & [[[p3<=1 & 1<=p3] & E [true U [~ [E [true U ~ [[[[p24<=1 & 1<=p24] & [p7<=1 & 1<=p7]] & [p3<=1 & 1<=p3]]]]] & [[[p34<=0 & 0<=p34] | [p11<=0 & 0<=p11]] | [p7<=0 & 0<=p7]]]]] & ~ [EG [~ [[[p20<=1 & 1<=p20] & [p0<=1 & 1<=p0]]]]]]]]

abstracting: (1<=p0)
states: 2,816 (3)
abstracting: (p0<=1)
states: 6,144 (3)
abstracting: (1<=p20)
states: 2,816 (3)
abstracting: (p20<=1)
states: 6,144 (3)
.
EG iterations: 1
abstracting: (0<=p7)
states: 6,144 (3)
abstracting: (p7<=0)
states: 2,816 (3)
abstracting: (0<=p11)
states: 6,144 (3)
abstracting: (p11<=0)
states: 2,816 (3)
abstracting: (0<=p34)
states: 6,144 (3)
abstracting: (p34<=0)
states: 3,328 (3)
abstracting: (1<=p3)
states: 3,328 (3)
abstracting: (p3<=1)
states: 6,144 (3)
abstracting: (1<=p7)
states: 3,328 (3)
abstracting: (p7<=1)
states: 6,144 (3)
abstracting: (1<=p24)
states: 2,816 (3)
abstracting: (p24<=1)
states: 6,144 (3)
abstracting: (1<=p3)
states: 3,328 (3)
abstracting: (p3<=1)
states: 6,144 (3)
abstracting: (1<=p17)
states: 3,328 (3)
abstracting: (p17<=1)
states: 6,144 (3)
abstracting: (1<=p24)
states: 2,816 (3)
abstracting: (p24<=1)
states: 6,144 (3)
abstracting: (0<=p13)
states: 6,144 (3)
abstracting: (p13<=0)
states: 2,816 (3)
abstracting: (0<=p37)
states: 6,144 (3)
abstracting: (p37<=0)
states: 5,632 (3)
.abstracting: (1<=p36)
states: 2,816 (3)
abstracting: (p36<=1)
states: 6,144 (3)
abstracting: (1<=p13)
states: 3,328 (3)
abstracting: (p13<=1)
states: 6,144 (3)
-> the formula is FALSE

FORMULA Dekker-PT-010-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: EF [AG [[EX [AG [[[p7<=0 & 0<=p7] | [[p15<=0 & 0<=p15] | [p38<=0 & 0<=p38]]]]] & [[[p1<=0 & 0<=p1] | [[p17<=0 & 0<=p17] | [p41<=0 & 0<=p41]]] & [[[[p11<=0 & 0<=p11] | [p35<=0 & 0<=p35]] | [[p15<=0 & 0<=p15] | [p17<=0 & 0<=p17]]] | [[[p38<=0 & 0<=p38] | [p7<=0 & 0<=p7]] | [[p30<=0 & 0<=p30] | [[p19<=0 & 0<=p19] | [p29<=0 & 0<=p29]]]]]]]]]
normalized: E [true U ~ [E [true U ~ [[[[[[[[p29<=0 & 0<=p29] | [p19<=0 & 0<=p19]] | [p30<=0 & 0<=p30]] | [[p7<=0 & 0<=p7] | [p38<=0 & 0<=p38]]] | [[[p17<=0 & 0<=p17] | [p15<=0 & 0<=p15]] | [[p35<=0 & 0<=p35] | [p11<=0 & 0<=p11]]]] & [[[p41<=0 & 0<=p41] | [p17<=0 & 0<=p17]] | [p1<=0 & 0<=p1]]] & EX [~ [E [true U ~ [[[[p38<=0 & 0<=p38] | [p15<=0 & 0<=p15]] | [p7<=0 & 0<=p7]]]]]]]]]]]

abstracting: (0<=p7)
states: 6,144 (3)
abstracting: (p7<=0)
states: 2,816 (3)
abstracting: (0<=p15)
states: 6,144 (3)
abstracting: (p15<=0)
states: 2,816 (3)
abstracting: (0<=p38)
states: 6,144 (3)
abstracting: (p38<=0)
states: 3,328 (3)
.abstracting: (0<=p1)
states: 6,144 (3)
abstracting: (p1<=0)
states: 2,816 (3)
abstracting: (0<=p17)
states: 6,144 (3)
abstracting: (p17<=0)
states: 2,816 (3)
abstracting: (0<=p41)
states: 6,144 (3)
abstracting: (p41<=0)
states: 3,328 (3)
abstracting: (0<=p11)
states: 6,144 (3)
abstracting: (p11<=0)
states: 2,816 (3)
abstracting: (0<=p35)
states: 6,144 (3)
abstracting: (p35<=0)
states: 5,632 (3)
abstracting: (0<=p15)
states: 6,144 (3)
abstracting: (p15<=0)
states: 2,816 (3)
abstracting: (0<=p17)
states: 6,144 (3)
abstracting: (p17<=0)
states: 2,816 (3)
abstracting: (0<=p38)
states: 6,144 (3)
abstracting: (p38<=0)
states: 3,328 (3)
abstracting: (0<=p7)
states: 6,144 (3)
abstracting: (p7<=0)
states: 2,816 (3)
abstracting: (0<=p30)
states: 6,144 (3)
abstracting: (p30<=0)
states: 5,632 (3)
abstracting: (0<=p19)
states: 6,144 (3)
abstracting: (p19<=0)
states: 2,816 (3)
abstracting: (0<=p29)
states: 6,144 (3)
abstracting: (p29<=0)
states: 3,328 (3)
-> the formula is FALSE

FORMULA Dekker-PT-010-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AG [[AF [AX [[[[p19<=0 & 0<=p19] | [p24<=0 & 0<=p24]] | [p3<=0 & 0<=p3]]]] | [EF [[[p5<=0 & 0<=p5] | [[p28<=0 & 0<=p28] | [[[p3<=0 & 0<=p3] | [[p17<=0 & 0<=p17] | [p24<=0 & 0<=p24]]] & [[p16<=0 & 0<=p16] | [p40<=0 & 0<=p40]]]]]] | EX [~ [A [[[p3<=1 & 1<=p3] & [[p13<=1 & 1<=p13] & [p24<=1 & 1<=p24]]] U EX [[[p7<=1 & 1<=p7] & [[p15<=1 & 1<=p15] & [p29<=1 & 1<=p29]]]]]]]]]]
normalized: ~ [E [true U ~ [[[EX [~ [[~ [EG [~ [EX [[[[p29<=1 & 1<=p29] & [p15<=1 & 1<=p15]] & [p7<=1 & 1<=p7]]]]]] & ~ [E [~ [EX [[[[p29<=1 & 1<=p29] & [p15<=1 & 1<=p15]] & [p7<=1 & 1<=p7]]]] U [~ [[[[p24<=1 & 1<=p24] & [p13<=1 & 1<=p13]] & [p3<=1 & 1<=p3]]] & ~ [EX [[[[p29<=1 & 1<=p29] & [p15<=1 & 1<=p15]] & [p7<=1 & 1<=p7]]]]]]]]]] | E [true U [[[[[p40<=0 & 0<=p40] | [p16<=0 & 0<=p16]] & [[[p24<=0 & 0<=p24] | [p17<=0 & 0<=p17]] | [p3<=0 & 0<=p3]]] | [p28<=0 & 0<=p28]] | [p5<=0 & 0<=p5]]]] | ~ [EG [EX [~ [[[p3<=0 & 0<=p3] | [[p24<=0 & 0<=p24] | [p19<=0 & 0<=p19]]]]]]]]]]]

abstracting: (0<=p19)
states: 6,144 (3)
abstracting: (p19<=0)
states: 2,816 (3)
abstracting: (0<=p24)
states: 6,144 (3)
abstracting: (p24<=0)
states: 3,328 (3)
abstracting: (0<=p3)
states: 6,144 (3)
abstracting: (p3<=0)
states: 2,816 (3)
..
EG iterations: 1
abstracting: (0<=p5)
states: 6,144 (3)
abstracting: (p5<=0)
states: 2,816 (3)
abstracting: (0<=p28)
states: 6,144 (3)
abstracting: (p28<=0)
states: 5,632 (3)
abstracting: (0<=p3)
states: 6,144 (3)
abstracting: (p3<=0)
states: 2,816 (3)
abstracting: (0<=p17)
states: 6,144 (3)
abstracting: (p17<=0)
states: 2,816 (3)
abstracting: (0<=p24)
states: 6,144 (3)
abstracting: (p24<=0)
states: 3,328 (3)
abstracting: (0<=p16)
states: 6,144 (3)
abstracting: (p16<=0)
states: 3,328 (3)
abstracting: (0<=p40)
states: 6,144 (3)
abstracting: (p40<=0)
states: 3,328 (3)
abstracting: (1<=p7)
states: 3,328 (3)
abstracting: (p7<=1)
states: 6,144 (3)
abstracting: (1<=p15)
states: 3,328 (3)
abstracting: (p15<=1)
states: 6,144 (3)
abstracting: (1<=p29)
states: 2,816 (3)
abstracting: (p29<=1)
states: 6,144 (3)
.abstracting: (1<=p3)
states: 3,328 (3)
abstracting: (p3<=1)
states: 6,144 (3)
abstracting: (1<=p13)
states: 3,328 (3)
abstracting: (p13<=1)
states: 6,144 (3)
abstracting: (1<=p24)
states: 2,816 (3)
abstracting: (p24<=1)
states: 6,144 (3)
abstracting: (1<=p7)
states: 3,328 (3)
abstracting: (p7<=1)
states: 6,144 (3)
abstracting: (1<=p15)
states: 3,328 (3)
abstracting: (p15<=1)
states: 6,144 (3)
abstracting: (1<=p29)
states: 2,816 (3)
abstracting: (p29<=1)
states: 6,144 (3)
.abstracting: (1<=p7)
states: 3,328 (3)
abstracting: (p7<=1)
states: 6,144 (3)
abstracting: (1<=p15)
states: 3,328 (3)
abstracting: (p15<=1)
states: 6,144 (3)
abstracting: (1<=p29)
states: 2,816 (3)
abstracting: (p29<=1)
states: 6,144 (3)
..
EG iterations: 1
.-> the formula is TRUE

FORMULA Dekker-PT-010-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.066sec

checking: EX [A [EF [[[[p1<=1 & 1<=p1] & [p17<=1 & 1<=p17]] & [[p41<=1 & 1<=p41] & [[p18<=1 & 1<=p18] & [p43<=1 & 1<=p43]]]]] U [~ [AX [[[[p7<=1 & 1<=p7] & [[p13<=1 & 1<=p13] & [p36<=1 & 1<=p36]]] | [[p1<=1 & 1<=p1] & [[p3<=1 & 1<=p3] & [p21<=1 & 1<=p21]]]]]] | AF [[[[[p2<=1 & 1<=p2] & [p4<=1 & 1<=p4]] & [[p6<=1 & 1<=p6] & [[p8<=1 & 1<=p8] & [p10<=1 & 1<=p10]]]] & [[[p12<=1 & 1<=p12] & [p14<=1 & 1<=p14]] & [[p16<=1 & 1<=p16] & [[p18<=1 & 1<=p18] & [p21<=1 & 1<=p21]]]]]]]]]
normalized: EX [[~ [EG [~ [[~ [EG [~ [[[[[[p21<=1 & 1<=p21] & [p18<=1 & 1<=p18]] & [p16<=1 & 1<=p16]] & [[p14<=1 & 1<=p14] & [p12<=1 & 1<=p12]]] & [[[[p10<=1 & 1<=p10] & [p8<=1 & 1<=p8]] & [p6<=1 & 1<=p6]] & [[p4<=1 & 1<=p4] & [p2<=1 & 1<=p2]]]]]]] | EX [~ [[[[[p21<=1 & 1<=p21] & [p3<=1 & 1<=p3]] & [p1<=1 & 1<=p1]] | [[[p36<=1 & 1<=p36] & [p13<=1 & 1<=p13]] & [p7<=1 & 1<=p7]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[[[[p21<=1 & 1<=p21] & [p18<=1 & 1<=p18]] & [p16<=1 & 1<=p16]] & [[p14<=1 & 1<=p14] & [p12<=1 & 1<=p12]]] & [[[[p10<=1 & 1<=p10] & [p8<=1 & 1<=p8]] & [p6<=1 & 1<=p6]] & [[p4<=1 & 1<=p4] & [p2<=1 & 1<=p2]]]]]]] | EX [~ [[[[[p21<=1 & 1<=p21] & [p3<=1 & 1<=p3]] & [p1<=1 & 1<=p1]] | [[[p36<=1 & 1<=p36] & [p13<=1 & 1<=p13]] & [p7<=1 & 1<=p7]]]]]]] U [~ [E [true U [[[[p43<=1 & 1<=p43] & [p18<=1 & 1<=p18]] & [p41<=1 & 1<=p41]] & [[p17<=1 & 1<=p17] & [p1<=1 & 1<=p1]]]]] & ~ [[~ [EG [~ [[[[[[p21<=1 & 1<=p21] & [p18<=1 & 1<=p18]] & [p16<=1 & 1<=p16]] & [[p14<=1 & 1<=p14] & [p12<=1 & 1<=p12]]] & [[[[p10<=1 & 1<=p10] & [p8<=1 & 1<=p8]] & [p6<=1 & 1<=p6]] & [[p4<=1 & 1<=p4] & [p2<=1 & 1<=p2]]]]]]] | EX [~ [[[[[p21<=1 & 1<=p21] & [p3<=1 & 1<=p3]] & [p1<=1 & 1<=p1]] | [[[p36<=1 & 1<=p36] & [p13<=1 & 1<=p13]] & [p7<=1 & 1<=p7]]]]]]]]]]]]

abstracting: (1<=p7)
states: 3,328 (3)
abstracting: (p7<=1)
states: 6,144 (3)
abstracting: (1<=p13)
states: 3,328 (3)
abstracting: (p13<=1)
states: 6,144 (3)
abstracting: (1<=p36)
states: 2,816 (3)
abstracting: (p36<=1)
states: 6,144 (3)
abstracting: (1<=p1)
states: 3,328 (3)
abstracting: (p1<=1)
states: 6,144 (3)
abstracting: (1<=p3)
states: 3,328 (3)
abstracting: (p3<=1)
states: 6,144 (3)
abstracting: (1<=p21)
states: 2,816 (3)
abstracting: (p21<=1)
states: 6,144 (3)
.abstracting: (1<=p2)
states: 2,816 (3)
abstracting: (p2<=1)
states: 6,144 (3)
abstracting: (1<=p4)
states: 2,816 (3)
abstracting: (p4<=1)
states: 6,144 (3)
abstracting: (1<=p6)
states: 2,816 (3)
abstracting: (p6<=1)
states: 6,144 (3)
abstracting: (1<=p8)
states: 2,816 (3)
abstracting: (p8<=1)
states: 6,144 (3)
abstracting: (1<=p10)
states: 2,816 (3)
abstracting: (p10<=1)
states: 6,144 (3)
abstracting: (1<=p12)
states: 2,816 (3)
abstracting: (p12<=1)
states: 6,144 (3)
abstracting: (1<=p14)
states: 2,816 (3)
abstracting: (p14<=1)
states: 6,144 (3)
abstracting: (1<=p16)
states: 2,816 (3)
abstracting: (p16<=1)
states: 6,144 (3)
abstracting: (1<=p18)
states: 2,816 (3)
abstracting: (p18<=1)
states: 6,144 (3)
abstracting: (1<=p21)
states: 2,816 (3)
abstracting: (p21<=1)
states: 6,144 (3)
.
EG iterations: 1
abstracting: (1<=p1)
states: 3,328 (3)
abstracting: (p1<=1)
states: 6,144 (3)
abstracting: (1<=p17)
states: 3,328 (3)
abstracting: (p17<=1)
states: 6,144 (3)
abstracting: (1<=p41)
states: 2,816 (3)
abstracting: (p41<=1)
states: 6,144 (3)
abstracting: (1<=p18)
states: 2,816 (3)
abstracting: (p18<=1)
states: 6,144 (3)
abstracting: (1<=p43)
states: 2,816 (3)
abstracting: (p43<=1)
states: 6,144 (3)
abstracting: (1<=p7)
states: 3,328 (3)
abstracting: (p7<=1)
states: 6,144 (3)
abstracting: (1<=p13)
states: 3,328 (3)
abstracting: (p13<=1)
states: 6,144 (3)
abstracting: (1<=p36)
states: 2,816 (3)
abstracting: (p36<=1)
states: 6,144 (3)
abstracting: (1<=p1)
states: 3,328 (3)
abstracting: (p1<=1)
states: 6,144 (3)
abstracting: (1<=p3)
states: 3,328 (3)
abstracting: (p3<=1)
states: 6,144 (3)
abstracting: (1<=p21)
states: 2,816 (3)
abstracting: (p21<=1)
states: 6,144 (3)
.abstracting: (1<=p2)
states: 2,816 (3)
abstracting: (p2<=1)
states: 6,144 (3)
abstracting: (1<=p4)
states: 2,816 (3)
abstracting: (p4<=1)
states: 6,144 (3)
abstracting: (1<=p6)
states: 2,816 (3)
abstracting: (p6<=1)
states: 6,144 (3)
abstracting: (1<=p8)
states: 2,816 (3)
abstracting: (p8<=1)
states: 6,144 (3)
abstracting: (1<=p10)
states: 2,816 (3)
abstracting: (p10<=1)
states: 6,144 (3)
abstracting: (1<=p12)
states: 2,816 (3)
abstracting: (p12<=1)
states: 6,144 (3)
abstracting: (1<=p14)
states: 2,816 (3)
abstracting: (p14<=1)
states: 6,144 (3)
abstracting: (1<=p16)
states: 2,816 (3)
abstracting: (p16<=1)
states: 6,144 (3)
abstracting: (1<=p18)
states: 2,816 (3)
abstracting: (p18<=1)
states: 6,144 (3)
abstracting: (1<=p21)
states: 2,816 (3)
abstracting: (p21<=1)
states: 6,144 (3)
.
EG iterations: 1
abstracting: (1<=p7)
states: 3,328 (3)
abstracting: (p7<=1)
states: 6,144 (3)
abstracting: (1<=p13)
states: 3,328 (3)
abstracting: (p13<=1)
states: 6,144 (3)
abstracting: (1<=p36)
states: 2,816 (3)
abstracting: (p36<=1)
states: 6,144 (3)
abstracting: (1<=p1)
states: 3,328 (3)
abstracting: (p1<=1)
states: 6,144 (3)
abstracting: (1<=p3)
states: 3,328 (3)
abstracting: (p3<=1)
states: 6,144 (3)
abstracting: (1<=p21)
states: 2,816 (3)
abstracting: (p21<=1)
states: 6,144 (3)
.abstracting: (1<=p2)
states: 2,816 (3)
abstracting: (p2<=1)
states: 6,144 (3)
abstracting: (1<=p4)
states: 2,816 (3)
abstracting: (p4<=1)
states: 6,144 (3)
abstracting: (1<=p6)
states: 2,816 (3)
abstracting: (p6<=1)
states: 6,144 (3)
abstracting: (1<=p8)
states: 2,816 (3)
abstracting: (p8<=1)
states: 6,144 (3)
abstracting: (1<=p10)
states: 2,816 (3)
abstracting: (p10<=1)
states: 6,144 (3)
abstracting: (1<=p12)
states: 2,816 (3)
abstracting: (p12<=1)
states: 6,144 (3)
abstracting: (1<=p14)
states: 2,816 (3)
abstracting: (p14<=1)
states: 6,144 (3)
abstracting: (1<=p16)
states: 2,816 (3)
abstracting: (p16<=1)
states: 6,144 (3)
abstracting: (1<=p18)
states: 2,816 (3)
abstracting: (p18<=1)
states: 6,144 (3)
abstracting: (1<=p21)
states: 2,816 (3)
abstracting: (p21<=1)
states: 6,144 (3)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is TRUE

FORMULA Dekker-PT-010-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.046sec

checking: E [[[p18<=1 & 1<=p18] & [p43<=1 & 1<=p43]] U [AF [~ [AF [EX [[[p5<=1 & 1<=p5] & [[p19<=1 & 1<=p19] & [p44<=1 & 1<=p44]]]]]]] | ~ [A [[~ [[[p11<=1 & 1<=p11] & [[p13<=1 & 1<=p13] & [p34<=1 & 1<=p34]]]] | EF [[[p1<=1 & 1<=p1] & [[p17<=1 & 1<=p17] & [p21<=1 & 1<=p21]]]]] U [[E [[[p3<=1 & 1<=p3] & [[p7<=1 & 1<=p7] & [p29<=1 & 1<=p29]]] U [[p3<=1 & 1<=p3] & [[p17<=1 & 1<=p17] & [p41<=1 & 1<=p41]]]] & EX [[[p1<=1 & 1<=p1] & [[p3<=1 & 1<=p3] & [p24<=1 & 1<=p24]]]]] | EX [[[p3<=1 & 1<=p3] & [[p9<=1 & 1<=p9] & [p31<=1 & 1<=p31]]]]]]]]]
normalized: E [[[p43<=1 & 1<=p43] & [p18<=1 & 1<=p18]] U [~ [[~ [EG [~ [[EX [[[[p31<=1 & 1<=p31] & [p9<=1 & 1<=p9]] & [p3<=1 & 1<=p3]]] | [EX [[[[p24<=1 & 1<=p24] & [p3<=1 & 1<=p3]] & [p1<=1 & 1<=p1]]] & E [[[[p29<=1 & 1<=p29] & [p7<=1 & 1<=p7]] & [p3<=1 & 1<=p3]] U [[[p41<=1 & 1<=p41] & [p17<=1 & 1<=p17]] & [p3<=1 & 1<=p3]]]]]]]] & ~ [E [~ [[EX [[[[p31<=1 & 1<=p31] & [p9<=1 & 1<=p9]] & [p3<=1 & 1<=p3]]] | [EX [[[[p24<=1 & 1<=p24] & [p3<=1 & 1<=p3]] & [p1<=1 & 1<=p1]]] & E [[[[p29<=1 & 1<=p29] & [p7<=1 & 1<=p7]] & [p3<=1 & 1<=p3]] U [[[p41<=1 & 1<=p41] & [p17<=1 & 1<=p17]] & [p3<=1 & 1<=p3]]]]]] U [~ [[E [true U [[[p21<=1 & 1<=p21] & [p17<=1 & 1<=p17]] & [p1<=1 & 1<=p1]]] | ~ [[[[p34<=1 & 1<=p34] & [p13<=1 & 1<=p13]] & [p11<=1 & 1<=p11]]]]] & ~ [[EX [[[[p31<=1 & 1<=p31] & [p9<=1 & 1<=p9]] & [p3<=1 & 1<=p3]]] | [EX [[[[p24<=1 & 1<=p24] & [p3<=1 & 1<=p3]] & [p1<=1 & 1<=p1]]] & E [[[[p29<=1 & 1<=p29] & [p7<=1 & 1<=p7]] & [p3<=1 & 1<=p3]] U [[[p41<=1 & 1<=p41] & [p17<=1 & 1<=p17]] & [p3<=1 & 1<=p3]]]]]]]]]]] | ~ [EG [~ [EG [~ [EX [[[[p44<=1 & 1<=p44] & [p19<=1 & 1<=p19]] & [p5<=1 & 1<=p5]]]]]]]]]]

abstracting: (1<=p5)
states: 3,328 (3)
abstracting: (p5<=1)
states: 6,144 (3)
abstracting: (1<=p19)
states: 3,328 (3)
abstracting: (p19<=1)
states: 6,144 (3)
abstracting: (1<=p44)
states: 2,816 (3)
abstracting: (p44<=1)
states: 6,144 (3)
..
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p3)
states: 3,328 (3)
abstracting: (p3<=1)
states: 6,144 (3)
abstracting: (1<=p17)
states: 3,328 (3)
abstracting: (p17<=1)
states: 6,144 (3)
abstracting: (1<=p41)
states: 2,816 (3)
abstracting: (p41<=1)
states: 6,144 (3)
abstracting: (1<=p3)
states: 3,328 (3)
abstracting: (p3<=1)
states: 6,144 (3)
abstracting: (1<=p7)
states: 3,328 (3)
abstracting: (p7<=1)
states: 6,144 (3)
abstracting: (1<=p29)
states: 2,816 (3)
abstracting: (p29<=1)
states: 6,144 (3)
abstracting: (1<=p1)
states: 3,328 (3)
abstracting: (p1<=1)
states: 6,144 (3)
abstracting: (1<=p3)
states: 3,328 (3)
abstracting: (p3<=1)
states: 6,144 (3)
abstracting: (1<=p24)
states: 2,816 (3)
abstracting: (p24<=1)
states: 6,144 (3)
.abstracting: (1<=p3)
states: 3,328 (3)
abstracting: (p3<=1)
states: 6,144 (3)
abstracting: (1<=p9)
states: 3,328 (3)
abstracting: (p9<=1)
states: 6,144 (3)
abstracting: (1<=p31)
states: 2,816 (3)
abstracting: (p31<=1)
states: 6,144 (3)
.abstracting: (1<=p11)
states: 3,328 (3)
abstracting: (p11<=1)
states: 6,144 (3)
abstracting: (1<=p13)
states: 3,328 (3)
abstracting: (p13<=1)
states: 6,144 (3)
abstracting: (1<=p34)
states: 2,816 (3)
abstracting: (p34<=1)
states: 6,144 (3)
abstracting: (1<=p1)
states: 3,328 (3)
abstracting: (p1<=1)
states: 6,144 (3)
abstracting: (1<=p17)
states: 3,328 (3)
abstracting: (p17<=1)
states: 6,144 (3)
abstracting: (1<=p21)
states: 2,816 (3)
abstracting: (p21<=1)
states: 6,144 (3)
abstracting: (1<=p3)
states: 3,328 (3)
abstracting: (p3<=1)
states: 6,144 (3)
abstracting: (1<=p17)
states: 3,328 (3)
abstracting: (p17<=1)
states: 6,144 (3)
abstracting: (1<=p41)
states: 2,816 (3)
abstracting: (p41<=1)
states: 6,144 (3)
abstracting: (1<=p3)
states: 3,328 (3)
abstracting: (p3<=1)
states: 6,144 (3)
abstracting: (1<=p7)
states: 3,328 (3)
abstracting: (p7<=1)
states: 6,144 (3)
abstracting: (1<=p29)
states: 2,816 (3)
abstracting: (p29<=1)
states: 6,144 (3)
abstracting: (1<=p1)
states: 3,328 (3)
abstracting: (p1<=1)
states: 6,144 (3)
abstracting: (1<=p3)
states: 3,328 (3)
abstracting: (p3<=1)
states: 6,144 (3)
abstracting: (1<=p24)
states: 2,816 (3)
abstracting: (p24<=1)
states: 6,144 (3)
.abstracting: (1<=p3)
states: 3,328 (3)
abstracting: (p3<=1)
states: 6,144 (3)
abstracting: (1<=p9)
states: 3,328 (3)
abstracting: (p9<=1)
states: 6,144 (3)
abstracting: (1<=p31)
states: 2,816 (3)
abstracting: (p31<=1)
states: 6,144 (3)
.abstracting: (1<=p3)
states: 3,328 (3)
abstracting: (p3<=1)
states: 6,144 (3)
abstracting: (1<=p17)
states: 3,328 (3)
abstracting: (p17<=1)
states: 6,144 (3)
abstracting: (1<=p41)
states: 2,816 (3)
abstracting: (p41<=1)
states: 6,144 (3)
abstracting: (1<=p3)
states: 3,328 (3)
abstracting: (p3<=1)
states: 6,144 (3)
abstracting: (1<=p7)
states: 3,328 (3)
abstracting: (p7<=1)
states: 6,144 (3)
abstracting: (1<=p29)
states: 2,816 (3)
abstracting: (p29<=1)
states: 6,144 (3)
abstracting: (1<=p1)
states: 3,328 (3)
abstracting: (p1<=1)
states: 6,144 (3)
abstracting: (1<=p3)
states: 3,328 (3)
abstracting: (p3<=1)
states: 6,144 (3)
abstracting: (1<=p24)
states: 2,816 (3)
abstracting: (p24<=1)
states: 6,144 (3)
.abstracting: (1<=p3)
states: 3,328 (3)
abstracting: (p3<=1)
states: 6,144 (3)
abstracting: (1<=p9)
states: 3,328 (3)
abstracting: (p9<=1)
states: 6,144 (3)
abstracting: (1<=p31)
states: 2,816 (3)
abstracting: (p31<=1)
states: 6,144 (3)
..
EG iterations: 1
abstracting: (1<=p18)
states: 2,816 (3)
abstracting: (p18<=1)
states: 6,144 (3)
abstracting: (1<=p43)
states: 2,816 (3)
abstracting: (p43<=1)
states: 6,144 (3)
-> the formula is TRUE

FORMULA Dekker-PT-010-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.074sec

checking: [EX [[[EG [[[p9<=1 & 1<=p9] & [[p11<=1 & 1<=p11] & [p31<=1 & 1<=p31]]]] | [[p3<=0 & 0<=p3] | [p7<=0 & 0<=p7]]] | [[[p29<=0 & 0<=p29] | [p5<=0 & 0<=p5]] | [[p9<=0 & 0<=p9] | [p31<=0 & 0<=p31]]]]] & [EG [[[[EX [[[p1<=1 & 1<=p1] & [[p5<=1 & 1<=p5] & [p27<=1 & 1<=p27]]]] & [[p10<=1 & 1<=p10] & [p33<=1 & 1<=p33]]] | [AG [[[[p7<=1 & 1<=p7] & [p9<=1 & 1<=p9]] & [[p29<=1 & 1<=p29] & [[p15<=1 & 1<=p15] & [p39<=1 & 1<=p39]]]]] | [[p7<=1 & 1<=p7] & [[p13<=1 & 1<=p13] & [p36<=1 & 1<=p36]]]]] | [[p13<=0 & 0<=p13] | [[p15<=0 & 0<=p15] | [p38<=0 & 0<=p38]]]]] | [EF [EX [E [[[p5<=1 & 1<=p5] & [[p13<=1 & 1<=p13] & [p27<=1 & 1<=p27]]] U [[p5<=1 & 1<=p5] & [[p11<=1 & 1<=p11] & [p34<=1 & 1<=p34]]]]]] & AX [[[p1<=0 & 0<=p1] | [[p5<=0 & 0<=p5] | [p27<=0 & 0<=p27]]]]]]]
normalized: [[[~ [EX [~ [[[[p27<=0 & 0<=p27] | [p5<=0 & 0<=p5]] | [p1<=0 & 0<=p1]]]]] & E [true U EX [E [[[[p27<=1 & 1<=p27] & [p13<=1 & 1<=p13]] & [p5<=1 & 1<=p5]] U [[[p34<=1 & 1<=p34] & [p11<=1 & 1<=p11]] & [p5<=1 & 1<=p5]]]]]] | EG [[[[[p38<=0 & 0<=p38] | [p15<=0 & 0<=p15]] | [p13<=0 & 0<=p13]] | [[[[[p36<=1 & 1<=p36] & [p13<=1 & 1<=p13]] & [p7<=1 & 1<=p7]] | ~ [E [true U ~ [[[[[p39<=1 & 1<=p39] & [p15<=1 & 1<=p15]] & [p29<=1 & 1<=p29]] & [[p9<=1 & 1<=p9] & [p7<=1 & 1<=p7]]]]]]] | [[[p33<=1 & 1<=p33] & [p10<=1 & 1<=p10]] & EX [[[[p27<=1 & 1<=p27] & [p5<=1 & 1<=p5]] & [p1<=1 & 1<=p1]]]]]]]] & EX [[[[[p31<=0 & 0<=p31] | [p9<=0 & 0<=p9]] | [[p5<=0 & 0<=p5] | [p29<=0 & 0<=p29]]] | [[[p7<=0 & 0<=p7] | [p3<=0 & 0<=p3]] | EG [[[[p31<=1 & 1<=p31] & [p11<=1 & 1<=p11]] & [p9<=1 & 1<=p9]]]]]]]

abstracting: (1<=p9)
states: 3,328 (3)
abstracting: (p9<=1)
states: 6,144 (3)
abstracting: (1<=p11)
states: 3,328 (3)
abstracting: (p11<=1)
states: 6,144 (3)
abstracting: (1<=p31)
states: 2,816 (3)
abstracting: (p31<=1)
states: 6,144 (3)
.
EG iterations: 1
abstracting: (0<=p3)
states: 6,144 (3)
abstracting: (p3<=0)
states: 2,816 (3)
abstracting: (0<=p7)
states: 6,144 (3)
abstracting: (p7<=0)
states: 2,816 (3)
abstracting: (0<=p29)
states: 6,144 (3)
abstracting: (p29<=0)
states: 3,328 (3)
abstracting: (0<=p5)
states: 6,144 (3)
abstracting: (p5<=0)
states: 2,816 (3)
abstracting: (0<=p9)
states: 6,144 (3)
abstracting: (p9<=0)
states: 2,816 (3)
abstracting: (0<=p31)
states: 6,144 (3)
abstracting: (p31<=0)
states: 3,328 (3)
.abstracting: (1<=p1)
states: 3,328 (3)
abstracting: (p1<=1)
states: 6,144 (3)
abstracting: (1<=p5)
states: 3,328 (3)
abstracting: (p5<=1)
states: 6,144 (3)
abstracting: (1<=p27)
states: 2,816 (3)
abstracting: (p27<=1)
states: 6,144 (3)
.abstracting: (1<=p10)
states: 2,816 (3)
abstracting: (p10<=1)
states: 6,144 (3)
abstracting: (1<=p33)
states: 2,816 (3)
abstracting: (p33<=1)
states: 6,144 (3)
abstracting: (1<=p7)
states: 3,328 (3)
abstracting: (p7<=1)
states: 6,144 (3)
abstracting: (1<=p9)
states: 3,328 (3)
abstracting: (p9<=1)
states: 6,144 (3)
abstracting: (1<=p29)
states: 2,816 (3)
abstracting: (p29<=1)
states: 6,144 (3)
abstracting: (1<=p15)
states: 3,328 (3)
abstracting: (p15<=1)
states: 6,144 (3)
abstracting: (1<=p39)
states: 512
abstracting: (p39<=1)
states: 6,144 (3)
abstracting: (1<=p7)
states: 3,328 (3)
abstracting: (p7<=1)
states: 6,144 (3)
abstracting: (1<=p13)
states: 3,328 (3)
abstracting: (p13<=1)
states: 6,144 (3)
abstracting: (1<=p36)
states: 2,816 (3)
abstracting: (p36<=1)
states: 6,144 (3)
abstracting: (0<=p13)
states: 6,144 (3)
abstracting: (p13<=0)
states: 2,816 (3)
abstracting: (0<=p15)
states: 6,144 (3)
abstracting: (p15<=0)
states: 2,816 (3)
abstracting: (0<=p38)
states: 6,144 (3)
abstracting: (p38<=0)
states: 3,328 (3)
.
EG iterations: 1
abstracting: (1<=p5)
states: 3,328 (3)
abstracting: (p5<=1)
states: 6,144 (3)
abstracting: (1<=p11)
states: 3,328 (3)
abstracting: (p11<=1)
states: 6,144 (3)
abstracting: (1<=p34)
states: 2,816 (3)
abstracting: (p34<=1)
states: 6,144 (3)
abstracting: (1<=p5)
states: 3,328 (3)
abstracting: (p5<=1)
states: 6,144 (3)
abstracting: (1<=p13)
states: 3,328 (3)
abstracting: (p13<=1)
states: 6,144 (3)
abstracting: (1<=p27)
states: 2,816 (3)
abstracting: (p27<=1)
states: 6,144 (3)
.abstracting: (0<=p1)
states: 6,144 (3)
abstracting: (p1<=0)
states: 2,816 (3)
abstracting: (0<=p5)
states: 6,144 (3)
abstracting: (p5<=0)
states: 2,816 (3)
abstracting: (0<=p27)
states: 6,144 (3)
abstracting: (p27<=0)
states: 3,328 (3)
.-> the formula is TRUE

FORMULA Dekker-PT-010-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.049sec

checking: E [[[[p9<=1 & 1<=p9] & [p11<=1 & 1<=p11]] & [[p34<=1 & 1<=p34] & [EX [EF [[[p11<=1 & 1<=p11] & [[p13<=1 & 1<=p13] & [p36<=1 & 1<=p36]]]]] | [[p3<=1 & 1<=p3] & [[p15<=1 & 1<=p15] & [p24<=1 & 1<=p24]]]]]] U E [[[EF [AG [[[p11<=1 & 1<=p11] & [[p15<=1 & 1<=p15] & [p38<=1 & 1<=p38]]]]] & AF [[[p5<=1 & 1<=p5] & [[p17<=1 & 1<=p17] & [p27<=1 & 1<=p27]]]]] & [AF [AX [[[[[p0<=1 & 1<=p0] & [p2<=1 & 1<=p2]] & [[p4<=1 & 1<=p4] & [[p6<=1 & 1<=p6] & [p8<=1 & 1<=p8]]]] & [[[p10<=1 & 1<=p10] & [p12<=1 & 1<=p12]] & [[p14<=1 & 1<=p14] & [[p16<=1 & 1<=p16] & [p44<=1 & 1<=p44]]]]]]] & [EX [[[p3<=1 & 1<=p3] & [[p11<=1 & 1<=p11] & [p34<=1 & 1<=p34]]]] | [[p1<=1 & 1<=p1] & [[p3<=1 & 1<=p3] & [p24<=1 & 1<=p24]]]]]] U [[p1<=1 & 1<=p1] & [[p15<=1 & 1<=p15] & [p21<=1 & 1<=p21]]]]]
normalized: E [[[[[[[p24<=1 & 1<=p24] & [p15<=1 & 1<=p15]] & [p3<=1 & 1<=p3]] | EX [E [true U [[[p36<=1 & 1<=p36] & [p13<=1 & 1<=p13]] & [p11<=1 & 1<=p11]]]]] & [p34<=1 & 1<=p34]] & [[p11<=1 & 1<=p11] & [p9<=1 & 1<=p9]]] U E [[[[[[[p24<=1 & 1<=p24] & [p3<=1 & 1<=p3]] & [p1<=1 & 1<=p1]] | EX [[[[p34<=1 & 1<=p34] & [p11<=1 & 1<=p11]] & [p3<=1 & 1<=p3]]]] & ~ [EG [EX [~ [[[[[[p44<=1 & 1<=p44] & [p16<=1 & 1<=p16]] & [p14<=1 & 1<=p14]] & [[p12<=1 & 1<=p12] & [p10<=1 & 1<=p10]]] & [[[[p8<=1 & 1<=p8] & [p6<=1 & 1<=p6]] & [p4<=1 & 1<=p4]] & [[p2<=1 & 1<=p2] & [p0<=1 & 1<=p0]]]]]]]]] & [~ [EG [~ [[[[p27<=1 & 1<=p27] & [p17<=1 & 1<=p17]] & [p5<=1 & 1<=p5]]]]] & E [true U ~ [E [true U ~ [[[[p38<=1 & 1<=p38] & [p15<=1 & 1<=p15]] & [p11<=1 & 1<=p11]]]]]]]] U [[[p21<=1 & 1<=p21] & [p15<=1 & 1<=p15]] & [p1<=1 & 1<=p1]]]]

abstracting: (1<=p1)
states: 3,328 (3)
abstracting: (p1<=1)
states: 6,144 (3)
abstracting: (1<=p15)
states: 3,328 (3)
abstracting: (p15<=1)
states: 6,144 (3)
abstracting: (1<=p21)
states: 2,816 (3)
abstracting: (p21<=1)
states: 6,144 (3)
abstracting: (1<=p11)
states: 3,328 (3)
abstracting: (p11<=1)
states: 6,144 (3)
abstracting: (1<=p15)
states: 3,328 (3)
abstracting: (p15<=1)
states: 6,144 (3)
abstracting: (1<=p38)
states: 2,816 (3)
abstracting: (p38<=1)
states: 6,144 (3)
abstracting: (1<=p5)
states: 3,328 (3)
abstracting: (p5<=1)
states: 6,144 (3)
abstracting: (1<=p17)
states: 3,328 (3)
abstracting: (p17<=1)
states: 6,144 (3)
abstracting: (1<=p27)
states: 2,816 (3)
abstracting: (p27<=1)
states: 6,144 (3)
.
EG iterations: 1
abstracting: (1<=p0)
states: 2,816 (3)
abstracting: (p0<=1)
states: 6,144 (3)
abstracting: (1<=p2)
states: 2,816 (3)
abstracting: (p2<=1)
states: 6,144 (3)
abstracting: (1<=p4)
states: 2,816 (3)
abstracting: (p4<=1)
states: 6,144 (3)
abstracting: (1<=p6)
states: 2,816 (3)
abstracting: (p6<=1)
states: 6,144 (3)
abstracting: (1<=p8)
states: 2,816 (3)
abstracting: (p8<=1)
states: 6,144 (3)
abstracting: (1<=p10)
states: 2,816 (3)
abstracting: (p10<=1)
states: 6,144 (3)
abstracting: (1<=p12)
states: 2,816 (3)
abstracting: (p12<=1)
states: 6,144 (3)
abstracting: (1<=p14)
states: 2,816 (3)
abstracting: (p14<=1)
states: 6,144 (3)
abstracting: (1<=p16)
states: 2,816 (3)
abstracting: (p16<=1)
states: 6,144 (3)
abstracting: (1<=p44)
states: 2,816 (3)
abstracting: (p44<=1)
states: 6,144 (3)
.
EG iterations: 0
abstracting: (1<=p3)
states: 3,328 (3)
abstracting: (p3<=1)
states: 6,144 (3)
abstracting: (1<=p11)
states: 3,328 (3)
abstracting: (p11<=1)
states: 6,144 (3)
abstracting: (1<=p34)
states: 2,816 (3)
abstracting: (p34<=1)
states: 6,144 (3)
.abstracting: (1<=p1)
states: 3,328 (3)
abstracting: (p1<=1)
states: 6,144 (3)
abstracting: (1<=p3)
states: 3,328 (3)
abstracting: (p3<=1)
states: 6,144 (3)
abstracting: (1<=p24)
states: 2,816 (3)
abstracting: (p24<=1)
states: 6,144 (3)
abstracting: (1<=p9)
states: 3,328 (3)
abstracting: (p9<=1)
states: 6,144 (3)
abstracting: (1<=p11)
states: 3,328 (3)
abstracting: (p11<=1)
states: 6,144 (3)
abstracting: (1<=p34)
states: 2,816 (3)
abstracting: (p34<=1)
states: 6,144 (3)
abstracting: (1<=p11)
states: 3,328 (3)
abstracting: (p11<=1)
states: 6,144 (3)
abstracting: (1<=p13)
states: 3,328 (3)
abstracting: (p13<=1)
states: 6,144 (3)
abstracting: (1<=p36)
states: 2,816 (3)
abstracting: (p36<=1)
states: 6,144 (3)
.abstracting: (1<=p3)
states: 3,328 (3)
abstracting: (p3<=1)
states: 6,144 (3)
abstracting: (1<=p15)
states: 3,328 (3)
abstracting: (p15<=1)
states: 6,144 (3)
abstracting: (1<=p24)
states: 2,816 (3)
abstracting: (p24<=1)
states: 6,144 (3)
-> the formula is FALSE

FORMULA Dekker-PT-010-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.034sec

checking: E [A [AX [EG [[[p7<=1 & 1<=p7] & [[p19<=1 & 1<=p19] & [p44<=1 & 1<=p44]]]]] U [AX [[[p11<=1 & 1<=p11] & [[p13<=1 & 1<=p13] & [p36<=1 & 1<=p36]]]] | [[[p3<=1 & 1<=p3] & [[p19<=1 & 1<=p19] & [p24<=1 & 1<=p24]]] | [[p3<=1 & 1<=p3] & [[p11<=1 & 1<=p11] & [p24<=1 & 1<=p24]]]]]] U [AX [[[p7<=1 & 1<=p7] & [p30<=1 & 1<=p30]]] & ~ [[[[p5<=1 & 1<=p5] & [[p7<=1 & 1<=p7] & [p29<=1 & 1<=p29]]] | [[AF [[[p11<=1 & 1<=p11] & [[p19<=1 & 1<=p19] & [p34<=1 & 1<=p34]]]] & [[p13<=1 & 1<=p13] & [p37<=1 & 1<=p37]]] | E [~ [A [[[p11<=1 & 1<=p11] & [[p19<=1 & 1<=p19] & [p34<=1 & 1<=p34]]] U [[[[p0<=1 & 1<=p0] & [p2<=1 & 1<=p2]] & [[p4<=1 & 1<=p4] & [[p6<=1 & 1<=p6] & [p8<=1 & 1<=p8]]]] & [[[p12<=1 & 1<=p12] & [p14<=1 & 1<=p14]] & [[p16<=1 & 1<=p16] & [[p18<=1 & 1<=p18] & [p34<=1 & 1<=p34]]]]]]] U [~ [[[p7<=1 & 1<=p7] & [[p9<=1 & 1<=p9] & [p31<=1 & 1<=p31]]]] | [[[[[p0<=1 & 1<=p0] & [p4<=1 & 1<=p4]] & [[p6<=1 & 1<=p6] & [[p8<=1 & 1<=p8] & [p10<=1 & 1<=p10]]]] & [[[p12<=1 & 1<=p12] & [p14<=1 & 1<=p14]] & [[p16<=1 & 1<=p16] & [[p18<=1 & 1<=p18] & [p24<=1 & 1<=p24]]]]] | [[p7<=1 & 1<=p7] & [p30<=1 & 1<=p30]]]]]]]]]]
normalized: E [[~ [EG [~ [[[[[[p24<=1 & 1<=p24] & [p11<=1 & 1<=p11]] & [p3<=1 & 1<=p3]] | [[[p24<=1 & 1<=p24] & [p19<=1 & 1<=p19]] & [p3<=1 & 1<=p3]]] | ~ [EX [~ [[[[p36<=1 & 1<=p36] & [p13<=1 & 1<=p13]] & [p11<=1 & 1<=p11]]]]]]]]] & ~ [E [~ [[[[[[p24<=1 & 1<=p24] & [p11<=1 & 1<=p11]] & [p3<=1 & 1<=p3]] | [[[p24<=1 & 1<=p24] & [p19<=1 & 1<=p19]] & [p3<=1 & 1<=p3]]] | ~ [EX [~ [[[[p36<=1 & 1<=p36] & [p13<=1 & 1<=p13]] & [p11<=1 & 1<=p11]]]]]]] U [EX [~ [EG [[[[p44<=1 & 1<=p44] & [p19<=1 & 1<=p19]] & [p7<=1 & 1<=p7]]]]] & ~ [[[[[[p24<=1 & 1<=p24] & [p11<=1 & 1<=p11]] & [p3<=1 & 1<=p3]] | [[[p24<=1 & 1<=p24] & [p19<=1 & 1<=p19]] & [p3<=1 & 1<=p3]]] | ~ [EX [~ [[[[p36<=1 & 1<=p36] & [p13<=1 & 1<=p13]] & [p11<=1 & 1<=p11]]]]]]]]]]] U [~ [[[E [~ [[~ [EG [~ [[[[[[p34<=1 & 1<=p34] & [p18<=1 & 1<=p18]] & [p16<=1 & 1<=p16]] & [[p14<=1 & 1<=p14] & [p12<=1 & 1<=p12]]] & [[[[p8<=1 & 1<=p8] & [p6<=1 & 1<=p6]] & [p4<=1 & 1<=p4]] & [[p2<=1 & 1<=p2] & [p0<=1 & 1<=p0]]]]]]] & ~ [E [~ [[[[[[p34<=1 & 1<=p34] & [p18<=1 & 1<=p18]] & [p16<=1 & 1<=p16]] & [[p14<=1 & 1<=p14] & [p12<=1 & 1<=p12]]] & [[[[p8<=1 & 1<=p8] & [p6<=1 & 1<=p6]] & [p4<=1 & 1<=p4]] & [[p2<=1 & 1<=p2] & [p0<=1 & 1<=p0]]]]] U [~ [[[[p34<=1 & 1<=p34] & [p19<=1 & 1<=p19]] & [p11<=1 & 1<=p11]]] & ~ [[[[[[p34<=1 & 1<=p34] & [p18<=1 & 1<=p18]] & [p16<=1 & 1<=p16]] & [[p14<=1 & 1<=p14] & [p12<=1 & 1<=p12]]] & [[[[p8<=1 & 1<=p8] & [p6<=1 & 1<=p6]] & [p4<=1 & 1<=p4]] & [[p2<=1 & 1<=p2] & [p0<=1 & 1<=p0]]]]]]]]]] U [[[[p30<=1 & 1<=p30] & [p7<=1 & 1<=p7]] | [[[[[p24<=1 & 1<=p24] & [p18<=1 & 1<=p18]] & [p16<=1 & 1<=p16]] & [[p14<=1 & 1<=p14] & [p12<=1 & 1<=p12]]] & [[[[p10<=1 & 1<=p10] & [p8<=1 & 1<=p8]] & [p6<=1 & 1<=p6]] & [[p4<=1 & 1<=p4] & [p0<=1 & 1<=p0]]]]] | ~ [[[[p31<=1 & 1<=p31] & [p9<=1 & 1<=p9]] & [p7<=1 & 1<=p7]]]]] | [[[p37<=1 & 1<=p37] & [p13<=1 & 1<=p13]] & ~ [EG [~ [[[[p34<=1 & 1<=p34] & [p19<=1 & 1<=p19]] & [p11<=1 & 1<=p11]]]]]]] | [[[p29<=1 & 1<=p29] & [p7<=1 & 1<=p7]] & [p5<=1 & 1<=p5]]]] & ~ [EX [~ [[[p30<=1 & 1<=p30] & [p7<=1 & 1<=p7]]]]]]]

abstracting: (1<=p7)
states: 3,328 (3)
abstracting: (p7<=1)
states: 6,144 (3)
abstracting: (1<=p30)
states: 512
abstracting: (p30<=1)
states: 6,144 (3)
.abstracting: (1<=p5)
states: 3,328 (3)
abstracting: (p5<=1)
states: 6,144 (3)
abstracting: (1<=p7)
states: 3,328 (3)
abstracting: (p7<=1)
states: 6,144 (3)
abstracting: (1<=p29)
states: 2,816 (3)
abstracting: (p29<=1)
states: 6,144 (3)
abstracting: (1<=p11)
states: 3,328 (3)
abstracting: (p11<=1)
states: 6,144 (3)
abstracting: (1<=p19)
states: 3,328 (3)
abstracting: (p19<=1)
states: 6,144 (3)
abstracting: (1<=p34)
states: 2,816 (3)
abstracting: (p34<=1)
states: 6,144 (3)
.
EG iterations: 1
abstracting: (1<=p13)
states: 3,328 (3)
abstracting: (p13<=1)
states: 6,144 (3)
abstracting: (1<=p37)
states: 512
abstracting: (p37<=1)
states: 6,144 (3)
abstracting: (1<=p7)
states: 3,328 (3)
abstracting: (p7<=1)
states: 6,144 (3)
abstracting: (1<=p9)
states: 3,328 (3)
abstracting: (p9<=1)
states: 6,144 (3)
abstracting: (1<=p31)
states: 2,816 (3)
abstracting: (p31<=1)
states: 6,144 (3)
abstracting: (1<=p0)
states: 2,816 (3)
abstracting: (p0<=1)
states: 6,144 (3)
abstracting: (1<=p4)
states: 2,816 (3)
abstracting: (p4<=1)
states: 6,144 (3)
abstracting: (1<=p6)
states: 2,816 (3)
abstracting: (p6<=1)
states: 6,144 (3)
abstracting: (1<=p8)
states: 2,816 (3)
abstracting: (p8<=1)
states: 6,144 (3)
abstracting: (1<=p10)
states: 2,816 (3)
abstracting: (p10<=1)
states: 6,144 (3)
abstracting: (1<=p12)
states: 2,816 (3)
abstracting: (p12<=1)
states: 6,144 (3)
abstracting: (1<=p14)
states: 2,816 (3)
abstracting: (p14<=1)
states: 6,144 (3)
abstracting: (1<=p16)
states: 2,816 (3)
abstracting: (p16<=1)
states: 6,144 (3)
abstracting: (1<=p18)
states: 2,816 (3)
abstracting: (p18<=1)
states: 6,144 (3)
abstracting: (1<=p24)
states: 2,816 (3)
abstracting: (p24<=1)
states: 6,144 (3)
abstracting: (1<=p7)
states: 3,328 (3)
abstracting: (p7<=1)
states: 6,144 (3)
abstracting: (1<=p30)
states: 512
abstracting: (p30<=1)
states: 6,144 (3)
abstracting: (1<=p0)
states: 2,816 (3)
abstracting: (p0<=1)
states: 6,144 (3)
abstracting: (1<=p2)
states: 2,816 (3)
abstracting: (p2<=1)
states: 6,144 (3)
abstracting: (1<=p4)
states: 2,816 (3)
abstracting: (p4<=1)
states: 6,144 (3)
abstracting: (1<=p6)
states: 2,816 (3)
abstracting: (p6<=1)
states: 6,144 (3)
abstracting: (1<=p8)
states: 2,816 (3)
abstracting: (p8<=1)
states: 6,144 (3)
abstracting: (1<=p12)
states: 2,816 (3)
abstracting: (p12<=1)
states: 6,144 (3)
abstracting: (1<=p14)
states: 2,816 (3)
abstracting: (p14<=1)
states: 6,144 (3)
abstracting: (1<=p16)
states: 2,816 (3)
abstracting: (p16<=1)
states: 6,144 (3)
abstracting: (1<=p18)
states: 2,816 (3)
abstracting: (p18<=1)
states: 6,144 (3)
abstracting: (1<=p34)
states: 2,816 (3)
abstracting: (p34<=1)
states: 6,144 (3)
abstracting: (1<=p11)
states: 3,328 (3)
abstracting: (p11<=1)
states: 6,144 (3)
abstracting: (1<=p19)
states: 3,328 (3)
abstracting: (p19<=1)
states: 6,144 (3)
abstracting: (1<=p34)
states: 2,816 (3)
abstracting: (p34<=1)
states: 6,144 (3)
abstracting: (1<=p0)
states: 2,816 (3)
abstracting: (p0<=1)
states: 6,144 (3)
abstracting: (1<=p2)
states: 2,816 (3)
abstracting: (p2<=1)
states: 6,144 (3)
abstracting: (1<=p4)
states: 2,816 (3)
abstracting: (p4<=1)
states: 6,144 (3)
abstracting: (1<=p6)
states: 2,816 (3)
abstracting: (p6<=1)
states: 6,144 (3)
abstracting: (1<=p8)
states: 2,816 (3)
abstracting: (p8<=1)
states: 6,144 (3)
abstracting: (1<=p12)
states: 2,816 (3)
abstracting: (p12<=1)
states: 6,144 (3)
abstracting: (1<=p14)
states: 2,816 (3)
abstracting: (p14<=1)
states: 6,144 (3)
abstracting: (1<=p16)
states: 2,816 (3)
abstracting: (p16<=1)
states: 6,144 (3)
abstracting: (1<=p18)
states: 2,816 (3)
abstracting: (p18<=1)
states: 6,144 (3)
abstracting: (1<=p34)
states: 2,816 (3)
abstracting: (p34<=1)
states: 6,144 (3)
abstracting: (1<=p0)
states: 2,816 (3)
abstracting: (p0<=1)
states: 6,144 (3)
abstracting: (1<=p2)
states: 2,816 (3)
abstracting: (p2<=1)
states: 6,144 (3)
abstracting: (1<=p4)
states: 2,816 (3)
abstracting: (p4<=1)
states: 6,144 (3)
abstracting: (1<=p6)
states: 2,816 (3)
abstracting: (p6<=1)
states: 6,144 (3)
abstracting: (1<=p8)
states: 2,816 (3)
abstracting: (p8<=1)
states: 6,144 (3)
abstracting: (1<=p12)
states: 2,816 (3)
abstracting: (p12<=1)
states: 6,144 (3)
abstracting: (1<=p14)
states: 2,816 (3)
abstracting: (p14<=1)
states: 6,144 (3)
abstracting: (1<=p16)
states: 2,816 (3)
abstracting: (p16<=1)
states: 6,144 (3)
abstracting: (1<=p18)
states: 2,816 (3)
abstracting: (p18<=1)
states: 6,144 (3)
abstracting: (1<=p34)
states: 2,816 (3)
abstracting: (p34<=1)
states: 6,144 (3)
.
EG iterations: 1
abstracting: (1<=p11)
states: 3,328 (3)
abstracting: (p11<=1)
states: 6,144 (3)
abstracting: (1<=p13)
states: 3,328 (3)
abstracting: (p13<=1)
states: 6,144 (3)
abstracting: (1<=p36)
states: 2,816 (3)
abstracting: (p36<=1)
states: 6,144 (3)
.abstracting: (1<=p3)
states: 3,328 (3)
abstracting: (p3<=1)
states: 6,144 (3)
abstracting: (1<=p19)
states: 3,328 (3)
abstracting: (p19<=1)
states: 6,144 (3)
abstracting: (1<=p24)
states: 2,816 (3)
abstracting: (p24<=1)
states: 6,144 (3)
abstracting: (1<=p3)
states: 3,328 (3)
abstracting: (p3<=1)
states: 6,144 (3)
abstracting: (1<=p11)
states: 3,328 (3)
abstracting: (p11<=1)
states: 6,144 (3)
abstracting: (1<=p24)
states: 2,816 (3)
abstracting: (p24<=1)
states: 6,144 (3)
abstracting: (1<=p7)
states: 3,328 (3)
abstracting: (p7<=1)
states: 6,144 (3)
abstracting: (1<=p19)
states: 3,328 (3)
abstracting: (p19<=1)
states: 6,144 (3)
abstracting: (1<=p44)
states: 2,816 (3)
abstracting: (p44<=1)
states: 6,144 (3)
.
EG iterations: 1
.abstracting: (1<=p11)
states: 3,328 (3)
abstracting: (p11<=1)
states: 6,144 (3)
abstracting: (1<=p13)
states: 3,328 (3)
abstracting: (p13<=1)
states: 6,144 (3)
abstracting: (1<=p36)
states: 2,816 (3)
abstracting: (p36<=1)
states: 6,144 (3)
.abstracting: (1<=p3)
states: 3,328 (3)
abstracting: (p3<=1)
states: 6,144 (3)
abstracting: (1<=p19)
states: 3,328 (3)
abstracting: (p19<=1)
states: 6,144 (3)
abstracting: (1<=p24)
states: 2,816 (3)
abstracting: (p24<=1)
states: 6,144 (3)
abstracting: (1<=p3)
states: 3,328 (3)
abstracting: (p3<=1)
states: 6,144 (3)
abstracting: (1<=p11)
states: 3,328 (3)
abstracting: (p11<=1)
states: 6,144 (3)
abstracting: (1<=p24)
states: 2,816 (3)
abstracting: (p24<=1)
states: 6,144 (3)
abstracting: (1<=p11)
states: 3,328 (3)
abstracting: (p11<=1)
states: 6,144 (3)
abstracting: (1<=p13)
states: 3,328 (3)
abstracting: (p13<=1)
states: 6,144 (3)
abstracting: (1<=p36)
states: 2,816 (3)
abstracting: (p36<=1)
states: 6,144 (3)
.abstracting: (1<=p3)
states: 3,328 (3)
abstracting: (p3<=1)
states: 6,144 (3)
abstracting: (1<=p19)
states: 3,328 (3)
abstracting: (p19<=1)
states: 6,144 (3)
abstracting: (1<=p24)
states: 2,816 (3)
abstracting: (p24<=1)
states: 6,144 (3)
abstracting: (1<=p3)
states: 3,328 (3)
abstracting: (p3<=1)
states: 6,144 (3)
abstracting: (1<=p11)
states: 3,328 (3)
abstracting: (p11<=1)
states: 6,144 (3)
abstracting: (1<=p24)
states: 2,816 (3)
abstracting: (p24<=1)
states: 6,144 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Dekker-PT-010-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.056sec

totally nodes used: 170994 (1.7e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 147630 1105582 1253212
used/not used/entry size/cache size: 1223312 65885552 16 1024MB
basic ops cache: hits/miss/sum: 26002 127746 153748
used/not used/entry size/cache size: 217379 16559837 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: 2094 8126 10220
used/not used/entry size/cache size: 8125 8380483 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 66949538
1 148737
2 9584
3 936
4 64
5 5
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.540sec


BK_STOP 1678531228198

--------------------
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 CTLFireability -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:1461 (12), effective:80 (0)

initing FirstDep: 0m 0.000sec


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

iterations count:443 (3), effective:9 (0)

iterations count:381 (3), effective:19 (0)

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

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

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

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

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

iterations count:411 (3), effective:6 (0)

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

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

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

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

iterations count:173 (1), effective:6 (0)

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

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

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

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

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

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

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

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

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

iterations count:120 (1), effective:0 (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="Dekker-PT-010"
export BK_EXAMINATION="CTLFireability"
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 Dekker-PT-010, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r138-smll-167819419200002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-010.tgz
mv Dekker-PT-010 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;