About the Execution of Marcie for Dekker-PT-015
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5453.476 | 7350.00 | 7131.00 | 101.00 | TTTFTFFFFTTTFFFF | normal |
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.r129-smll-167819403200014.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 marcie
Input is Dekker-PT-015, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r129-smll-167819403200014
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.8K Feb 26 01:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 01:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 01:41 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.6K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 26 01:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 01:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 01:44 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 141K 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-015-ReachabilityCardinality-00
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-01
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-02
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-03
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-04
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-05
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-06
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-07
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-08
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-09
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-10
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-11
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-12
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-13
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-14
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678256705028
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=marcie
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-015
Not applying reductions.
Model is PT
ReachabilityCardinality PT
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//../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Dekker_PT_015
(NrP: 75 NrTr: 255 NrArc: 1830)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.007sec
net check time: 0m 0.001sec
init dd package: 0m 4.438sec
RS generation: 0m 0.155sec
-> reachability set: #nodes 2175 (2.2e+03) #states 278,528 (5)
starting MCC model checker
--------------------------
checking: AG [flag_0_14<=1]
normalized: ~ [E [true U ~ [flag_0_14<=1]]]
abstracting: (flag_0_14<=1)
states: 278,528 (5)
-> the formula is TRUE
FORMULA Dekker-PT-015-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [~ [flag_1_13<=1]]
normalized: ~ [E [true U flag_1_13<=1]]
abstracting: (flag_1_13<=1)
states: 278,528 (5)
-> the formula is FALSE
FORMULA Dekker-PT-015-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.158sec
checking: EF [[1<=p1_7 | 1<=p1_14]]
normalized: E [true U [1<=p1_7 | 1<=p1_14]]
abstracting: (1<=p1_14)
states: 131,072 (5)
abstracting: (1<=p1_7)
states: 131,072 (5)
-> the formula is TRUE
FORMULA Dekker-PT-015-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.029sec
checking: AG [p0_11<=p0_8]
normalized: ~ [E [true U ~ [p0_11<=p0_8]]]
abstracting: (p0_11<=p0_8)
states: 208,896 (5)
-> the formula is FALSE
FORMULA Dekker-PT-015-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.017sec
checking: AG [flag_1_2<=p3_10]
normalized: ~ [E [true U ~ [flag_1_2<=p3_10]]]
abstracting: (flag_1_2<=p3_10)
states: 139,264 (5)
-> the formula is FALSE
FORMULA Dekker-PT-015-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.016sec
checking: AG [[flag_0_12<=p1_12 | ~ [[~ [p0_10<=1] & ~ [p0_12<=flag_0_13]]]]]
normalized: ~ [E [true U ~ [[flag_0_12<=p1_12 | ~ [[~ [p0_12<=flag_0_13] & ~ [p0_10<=1]]]]]]]
abstracting: (p0_10<=1)
states: 278,528 (5)
abstracting: (p0_12<=flag_0_13)
states: 208,896 (5)
abstracting: (flag_0_12<=p1_12)
states: 147,456 (5)
-> the formula is TRUE
FORMULA Dekker-PT-015-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [[p3_9<=p3_0 & [~ [p3_5<=1] | ~ [[[1<=p0_14 & ~ [[~ [1<=p3_12] | [[flag_1_1<=0 & p1_14<=1] | p3_0<=flag_1_3]]]] | p1_9<=1]]]]]
normalized: E [true U [p3_9<=p3_0 & [~ [[p1_9<=1 | [1<=p0_14 & ~ [[[p3_0<=flag_1_3 | [flag_1_1<=0 & p1_14<=1]] | ~ [1<=p3_12]]]]]] | ~ [p3_5<=1]]]]
abstracting: (p3_5<=1)
states: 278,528 (5)
abstracting: (1<=p3_12)
states: 16,384 (4)
abstracting: (p1_14<=1)
states: 278,528 (5)
abstracting: (flag_1_1<=0)
states: 131,072 (5)
abstracting: (p3_0<=flag_1_3)
states: 270,336 (5)
abstracting: (1<=p0_14)
states: 131,072 (5)
abstracting: (p1_9<=1)
states: 278,528 (5)
abstracting: (p3_9<=p3_0)
states: 262,144 (5)
-> the formula is FALSE
FORMULA Dekker-PT-015-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.012sec
checking: EF [~ [[~ [[~ [[[[p1_5<=p1_1 | [1<=flag_0_10 & p0_5<=p0_13]] | [[flag_0_8<=0 & p0_8<=p3_9] | [flag_0_4<=p3_1 | p3_12<=0]]] & ~ [[p0_10<=1 | [flag_1_4<=0 & flag_1_14<=1]]]]] & ~ [p0_5<=1]]] | [p1_10<=p0_5 & p3_14<=0]]]]
normalized: E [true U ~ [[[p1_10<=p0_5 & p3_14<=0] | ~ [[~ [p0_5<=1] & ~ [[~ [[p0_10<=1 | [flag_1_4<=0 & flag_1_14<=1]]] & [[[flag_0_4<=p3_1 | p3_12<=0] | [flag_0_8<=0 & p0_8<=p3_9]] | [p1_5<=p1_1 | [1<=flag_0_10 & p0_5<=p0_13]]]]]]]]]]
abstracting: (p0_5<=p0_13)
states: 208,896 (5)
abstracting: (1<=flag_0_10)
states: 131,072 (5)
abstracting: (p1_5<=p1_1)
states: 208,896 (5)
abstracting: (p0_8<=p3_9)
states: 155,648 (5)
abstracting: (flag_0_8<=0)
states: 147,456 (5)
abstracting: (p3_12<=0)
states: 262,144 (5)
abstracting: (flag_0_4<=p3_1)
states: 155,648 (5)
abstracting: (flag_1_14<=1)
states: 278,528 (5)
abstracting: (flag_1_4<=0)
states: 131,072 (5)
abstracting: (p0_10<=1)
states: 278,528 (5)
abstracting: (p0_5<=1)
states: 278,528 (5)
abstracting: (p3_14<=0)
states: 262,144 (5)
abstracting: (p1_10<=p0_5)
states: 208,896 (5)
-> the formula is FALSE
FORMULA Dekker-PT-015-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.023sec
checking: EF [~ [[[[[flag_1_5<=0 & [1<=p1_1 & [[[p3_12<=flag_1_2 & 1<=p1_4] & 1<=flag_0_9] | [[p3_6<=0 | p0_6<=flag_0_14] & ~ [flag_0_5<=1]]]]] | ~ [[flag_0_14<=1 & p1_13<=1]]] & ~ [[~ [[flag_0_14<=p1_2 | p0_13<=flag_0_2]] | 1<=p1_10]]] | [p1_11<=p0_12 | [p1_4<=0 | p3_8<=0]]]]]
normalized: E [true U ~ [[[p1_11<=p0_12 | [p1_4<=0 | p3_8<=0]] | [~ [[1<=p1_10 | ~ [[flag_0_14<=p1_2 | p0_13<=flag_0_2]]]] & [~ [[flag_0_14<=1 & p1_13<=1]] | [flag_1_5<=0 & [1<=p1_1 & [[~ [flag_0_5<=1] & [p3_6<=0 | p0_6<=flag_0_14]] | [1<=flag_0_9 & [p3_12<=flag_1_2 & 1<=p1_4]]]]]]]]]]
abstracting: (1<=p1_4)
states: 131,072 (5)
abstracting: (p3_12<=flag_1_2)
states: 270,336 (5)
abstracting: (1<=flag_0_9)
states: 131,072 (5)
abstracting: (p0_6<=flag_0_14)
states: 208,896 (5)
abstracting: (p3_6<=0)
states: 262,144 (5)
abstracting: (flag_0_5<=1)
states: 278,528 (5)
abstracting: (1<=p1_1)
states: 131,072 (5)
abstracting: (flag_1_5<=0)
states: 131,072 (5)
abstracting: (p1_13<=1)
states: 278,528 (5)
abstracting: (flag_0_14<=1)
states: 278,528 (5)
abstracting: (p0_13<=flag_0_2)
states: 208,896 (5)
abstracting: (flag_0_14<=p1_2)
states: 208,896 (5)
abstracting: (1<=p1_10)
states: 131,072 (5)
abstracting: (p3_8<=0)
states: 262,144 (5)
abstracting: (p1_4<=0)
states: 147,456 (5)
abstracting: (p1_11<=p0_12)
states: 208,896 (5)
-> the formula is TRUE
FORMULA Dekker-PT-015-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.088sec
checking: AG [[[[[[[p0_8<=0 | [[~ [p1_10<=0] & [p1_5<=1 | p3_14<=0]] & ~ [flag_0_9<=1]]] | ~ [p0_14<=0]] | flag_1_3<=0] | [[[[~ [p3_0<=p3_6] | ~ [[p0_0<=0 | 1<=p0_5]]] | ~ [[[flag_0_1<=p3_5 | 1<=flag_1_6] | [p0_9<=p1_10 & 1<=p0_13]]]] & p1_4<=flag_0_0] & p0_3<=1]] | ~ [[[p3_13<=0 & ~ [flag_0_3<=1]] | [~ [[[flag_1_14<=flag_0_13 & flag_0_12<=1] | flag_1_3<=p1_8]] | p0_9<=flag_0_7]]]] | p3_2<=p1_4]]
normalized: ~ [E [true U ~ [[p3_2<=p1_4 | [~ [[[p0_9<=flag_0_7 | ~ [[flag_1_3<=p1_8 | [flag_1_14<=flag_0_13 & flag_0_12<=1]]]] | [p3_13<=0 & ~ [flag_0_3<=1]]]] | [[p0_3<=1 & [p1_4<=flag_0_0 & [~ [[[p0_9<=p1_10 & 1<=p0_13] | [flag_0_1<=p3_5 | 1<=flag_1_6]]] | [~ [[p0_0<=0 | 1<=p0_5]] | ~ [p3_0<=p3_6]]]]] | [flag_1_3<=0 | [~ [p0_14<=0] | [p0_8<=0 | [~ [flag_0_9<=1] & [[p1_5<=1 | p3_14<=0] & ~ [p1_10<=0]]]]]]]]]]]]
abstracting: (p1_10<=0)
states: 147,456 (5)
abstracting: (p3_14<=0)
states: 262,144 (5)
abstracting: (p1_5<=1)
states: 278,528 (5)
abstracting: (flag_0_9<=1)
states: 278,528 (5)
abstracting: (p0_8<=0)
states: 147,456 (5)
abstracting: (p0_14<=0)
states: 147,456 (5)
abstracting: (flag_1_3<=0)
states: 131,072 (5)
abstracting: (p3_0<=p3_6)
states: 262,144 (5)
abstracting: (1<=p0_5)
states: 131,072 (5)
abstracting: (p0_0<=0)
states: 147,456 (5)
abstracting: (1<=flag_1_6)
states: 147,456 (5)
abstracting: (flag_0_1<=p3_5)
states: 155,648 (5)
abstracting: (1<=p0_13)
states: 131,072 (5)
abstracting: (p0_9<=p1_10)
states: 208,896 (5)
abstracting: (p1_4<=flag_0_0)
states: 208,896 (5)
abstracting: (p0_3<=1)
states: 278,528 (5)
abstracting: (flag_0_3<=1)
states: 278,528 (5)
abstracting: (p3_13<=0)
states: 262,144 (5)
abstracting: (flag_0_12<=1)
states: 278,528 (5)
abstracting: (flag_1_14<=flag_0_13)
states: 200,704 (5)
abstracting: (flag_1_3<=p1_8)
states: 200,704 (5)
abstracting: (p0_9<=flag_0_7)
states: 208,896 (5)
abstracting: (p3_2<=p1_4)
states: 270,336 (5)
-> the formula is FALSE
FORMULA Dekker-PT-015-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.119sec
checking: AG [~ [[~ [[[~ [[1<=flag_0_13 | ~ [p0_11<=1]]] | [~ [[[p0_10<=p0_0 | 1<=p3_8] | ~ [1<=flag_0_10]]] | p1_8<=1]] | [[1<=p1_9 & p1_0<=flag_0_10] & ~ [[[[p0_2<=0 | flag_0_3<=flag_1_0] | p3_1<=0] & [[p3_12<=p0_9 | 1<=p1_1] & ~ [p3_3<=1]]]]]]] & [[p3_5<=0 | ~ [p0_2<=flag_1_8]] | ~ [[[p0_8<=p0_6 & [[~ [1<=flag_0_2] & [p0_11<=1 & p3_10<=1]] & [1<=p0_13 | [1<=p3_9 | 1<=flag_1_5]]]] & ~ [[p3_1<=p0_9 & ~ [1<=p1_9]]]]]]]]]
normalized: ~ [E [true U [[~ [[~ [[p3_1<=p0_9 & ~ [1<=p1_9]]] & [p0_8<=p0_6 & [[1<=p0_13 | [1<=p3_9 | 1<=flag_1_5]] & [[p0_11<=1 & p3_10<=1] & ~ [1<=flag_0_2]]]]]] | [p3_5<=0 | ~ [p0_2<=flag_1_8]]] & ~ [[[~ [[[~ [p3_3<=1] & [p3_12<=p0_9 | 1<=p1_1]] & [p3_1<=0 | [p0_2<=0 | flag_0_3<=flag_1_0]]]] & [1<=p1_9 & p1_0<=flag_0_10]] | [[p1_8<=1 | ~ [[~ [1<=flag_0_10] | [p0_10<=p0_0 | 1<=p3_8]]]] | ~ [[1<=flag_0_13 | ~ [p0_11<=1]]]]]]]]]
abstracting: (p0_11<=1)
states: 278,528 (5)
abstracting: (1<=flag_0_13)
states: 131,072 (5)
abstracting: (1<=p3_8)
states: 16,384 (4)
abstracting: (p0_10<=p0_0)
states: 208,896 (5)
abstracting: (1<=flag_0_10)
states: 131,072 (5)
abstracting: (p1_8<=1)
states: 278,528 (5)
abstracting: (p1_0<=flag_0_10)
states: 208,896 (5)
abstracting: (1<=p1_9)
states: 131,072 (5)
abstracting: (flag_0_3<=flag_1_0)
states: 217,088 (5)
abstracting: (p0_2<=0)
states: 147,456 (5)
abstracting: (p3_1<=0)
states: 262,144 (5)
abstracting: (1<=p1_1)
states: 131,072 (5)
abstracting: (p3_12<=p0_9)
states: 270,336 (5)
abstracting: (p3_3<=1)
states: 278,528 (5)
abstracting: (p0_2<=flag_1_8)
states: 217,088 (5)
abstracting: (p3_5<=0)
states: 262,144 (5)
abstracting: (1<=flag_0_2)
states: 131,072 (5)
abstracting: (p3_10<=1)
states: 278,528 (5)
abstracting: (p0_11<=1)
states: 278,528 (5)
abstracting: (1<=flag_1_5)
states: 147,456 (5)
abstracting: (1<=p3_9)
states: 16,384 (4)
abstracting: (1<=p0_13)
states: 131,072 (5)
abstracting: (p0_8<=p0_6)
states: 208,896 (5)
abstracting: (1<=p1_9)
states: 131,072 (5)
abstracting: (p3_1<=p0_9)
states: 270,336 (5)
-> the formula is TRUE
FORMULA Dekker-PT-015-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.041sec
checking: AG [[flag_1_9<=1 | [~ [[[[[~ [1<=p1_10] | [~ [1<=flag_1_7] & [flag_1_11<=0 & flag_1_2<=1]]] & [~ [[1<=p1_3 & 1<=flag_0_0]] & ~ [p3_5<=1]]] & [p0_10<=p3_3 | flag_0_11<=p1_8]] & [~ [[[[p1_8<=p3_14 & flag_1_5<=flag_1_5] & ~ [1<=p0_10]] & [~ [flag_1_0<=1] & 1<=flag_0_4]]] | ~ [1<=p1_11]]]] & [1<=flag_1_14 | [~ [[[p3_3<=flag_0_4 & [flag_0_3<=1 & 1<=p3_7]] | 1<=p1_1]] & [[~ [p3_13<=1] | [~ [flag_0_7<=0] | 1<=p3_4]] & [[~ [flag_0_8<=flag_1_7] | ~ [[p1_1<=0 & 1<=flag_1_13]]] | ~ [1<=p0_14]]]]]]]]
normalized: ~ [E [true U ~ [[flag_1_9<=1 | [[1<=flag_1_14 | [[[~ [1<=p0_14] | [~ [[p1_1<=0 & 1<=flag_1_13]] | ~ [flag_0_8<=flag_1_7]]] & [[1<=p3_4 | ~ [flag_0_7<=0]] | ~ [p3_13<=1]]] & ~ [[1<=p1_1 | [p3_3<=flag_0_4 & [flag_0_3<=1 & 1<=p3_7]]]]]] & ~ [[[~ [1<=p1_11] | ~ [[[1<=flag_0_4 & ~ [flag_1_0<=1]] & [~ [1<=p0_10] & [p1_8<=p3_14 & flag_1_5<=flag_1_5]]]]] & [[p0_10<=p3_3 | flag_0_11<=p1_8] & [[~ [p3_5<=1] & ~ [[1<=p1_3 & 1<=flag_0_0]]] & [[[flag_1_11<=0 & flag_1_2<=1] & ~ [1<=flag_1_7]] | ~ [1<=p1_10]]]]]]]]]]]
abstracting: (1<=p1_10)
states: 131,072 (5)
abstracting: (1<=flag_1_7)
states: 147,456 (5)
abstracting: (flag_1_2<=1)
states: 278,528 (5)
abstracting: (flag_1_11<=0)
states: 131,072 (5)
abstracting: (1<=flag_0_0)
states: 131,072 (5)
abstracting: (1<=p1_3)
states: 131,072 (5)
abstracting: (p3_5<=1)
states: 278,528 (5)
abstracting: (flag_0_11<=p1_8)
states: 208,896 (5)
abstracting: (p0_10<=p3_3)
states: 155,648 (5)
abstracting: (flag_1_5<=flag_1_5)
states: 278,528 (5)
abstracting: (p1_8<=p3_14)
states: 155,648 (5)
abstracting: (1<=p0_10)
states: 131,072 (5)
abstracting: (flag_1_0<=1)
states: 278,528 (5)
abstracting: (1<=flag_0_4)
states: 131,072 (5)
abstracting: (1<=p1_11)
states: 131,072 (5)
abstracting: (1<=p3_7)
states: 16,384 (4)
abstracting: (flag_0_3<=1)
states: 278,528 (5)
abstracting: (p3_3<=flag_0_4)
states: 270,336 (5)
abstracting: (1<=p1_1)
states: 131,072 (5)
abstracting: (p3_13<=1)
states: 278,528 (5)
abstracting: (flag_0_7<=0)
states: 147,456 (5)
abstracting: (1<=p3_4)
states: 16,384 (4)
abstracting: (flag_0_8<=flag_1_7)
states: 217,088 (5)
abstracting: (1<=flag_1_13)
states: 147,456 (5)
abstracting: (p1_1<=0)
states: 147,456 (5)
abstracting: (1<=p0_14)
states: 131,072 (5)
abstracting: (1<=flag_1_14)
states: 147,456 (5)
abstracting: (flag_1_9<=1)
states: 278,528 (5)
-> the formula is TRUE
FORMULA Dekker-PT-015-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.046sec
checking: AG [[[~ [p0_9<=flag_1_2] | [~ [p0_1<=1] & [[p3_8<=p3_10 | 1<=flag_0_9] & [[~ [[~ [p3_2<=0] & p1_3<=0]] & [1<=flag_1_6 & [~ [p1_2<=1] | [p3_5<=flag_1_8 | flag_0_4<=1]]]] & [~ [1<=p1_6] & [~ [[flag_0_7<=p1_2 | 1<=p3_8]] | [[1<=p3_12 | p1_13<=0] & [flag_0_11<=flag_1_13 | p1_4<=1]]]]]]]] | [p3_14<=p3_8 | [[p3_7<=flag_0_2 | [~ [[1<=p3_12 & [~ [p1_10<=p1_3] | [1<=flag_1_0 | p3_14<=1]]]] | ~ [[[~ [p3_5<=1] | [1<=flag_0_10 | p0_7<=0]] | ~ [p3_0<=1]]]]] & [~ [p0_14<=p0_1] | [~ [1<=p0_9] | ~ [[1<=flag_1_6 & p3_1<=0]]]]]]]]
normalized: ~ [E [true U ~ [[[p3_14<=p3_8 | [[[~ [[1<=flag_1_6 & p3_1<=0]] | ~ [1<=p0_9]] | ~ [p0_14<=p0_1]] & [p3_7<=flag_0_2 | [~ [[~ [p3_0<=1] | [[1<=flag_0_10 | p0_7<=0] | ~ [p3_5<=1]]]] | ~ [[1<=p3_12 & [[1<=flag_1_0 | p3_14<=1] | ~ [p1_10<=p1_3]]]]]]]] | [[[[[[[[flag_0_11<=flag_1_13 | p1_4<=1] & [1<=p3_12 | p1_13<=0]] | ~ [[flag_0_7<=p1_2 | 1<=p3_8]]] & ~ [1<=p1_6]] & [[1<=flag_1_6 & [[p3_5<=flag_1_8 | flag_0_4<=1] | ~ [p1_2<=1]]] & ~ [[p1_3<=0 & ~ [p3_2<=0]]]]] & [p3_8<=p3_10 | 1<=flag_0_9]] & ~ [p0_1<=1]] | ~ [p0_9<=flag_1_2]]]]]]
abstracting: (p0_9<=flag_1_2)
states: 217,088 (5)
abstracting: (p0_1<=1)
states: 278,528 (5)
abstracting: (1<=flag_0_9)
states: 131,072 (5)
abstracting: (p3_8<=p3_10)
states: 262,144 (5)
abstracting: (p3_2<=0)
states: 262,144 (5)
abstracting: (p1_3<=0)
states: 147,456 (5)
abstracting: (p1_2<=1)
states: 278,528 (5)
abstracting: (flag_0_4<=1)
states: 278,528 (5)
abstracting: (p3_5<=flag_1_8)
states: 270,336 (5)
abstracting: (1<=flag_1_6)
states: 147,456 (5)
abstracting: (1<=p1_6)
states: 131,072 (5)
abstracting: (1<=p3_8)
states: 16,384 (4)
abstracting: (flag_0_7<=p1_2)
states: 208,896 (5)
abstracting: (p1_13<=0)
states: 147,456 (5)
abstracting: (1<=p3_12)
states: 16,384 (4)
abstracting: (p1_4<=1)
states: 278,528 (5)
abstracting: (flag_0_11<=flag_1_13)
states: 217,088 (5)
abstracting: (p1_10<=p1_3)
states: 208,896 (5)
abstracting: (p3_14<=1)
states: 278,528 (5)
abstracting: (1<=flag_1_0)
states: 147,456 (5)
abstracting: (1<=p3_12)
states: 16,384 (4)
abstracting: (p3_5<=1)
states: 278,528 (5)
abstracting: (p0_7<=0)
states: 147,456 (5)
abstracting: (1<=flag_0_10)
states: 131,072 (5)
abstracting: (p3_0<=1)
states: 278,528 (5)
abstracting: (p3_7<=flag_0_2)
states: 270,336 (5)
abstracting: (p0_14<=p0_1)
states: 208,896 (5)
abstracting: (1<=p0_9)
states: 131,072 (5)
abstracting: (p3_1<=0)
states: 262,144 (5)
abstracting: (1<=flag_1_6)
states: 147,456 (5)
abstracting: (p3_14<=p3_8)
states: 262,144 (5)
-> the formula is FALSE
FORMULA Dekker-PT-015-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.114sec
checking: AG [[[[p0_1<=p3_3 | [~ [[[[[1<=p1_6 | flag_0_0<=flag_0_0] | ~ [p1_6<=0]] | [[1<=flag_0_3 | flag_1_10<=flag_0_11] | flag_0_11<=1]] & [p0_4<=p3_3 & ~ [[1<=p3_4 & 1<=p3_8]]]]] & p0_2<=1]] | p3_8<=flag_0_7] | [[[p3_9<=flag_0_14 | [[~ [1<=p1_10] | [~ [[1<=flag_0_7 | p1_7<=1]] | [~ [p3_10<=0] & flag_0_10<=0]]] & 1<=p3_5]] | ~ [[[[p0_4<=p3_10 & p1_1<=p1_5] | [[[1<=p3_0 | 1<=p1_4] & p1_2<=flag_1_9] | ~ [[1<=flag_1_11 & 1<=p1_7]]]] & [~ [flag_1_0<=0] | [[[flag_0_4<=0 | p1_9<=flag_1_9] | [p0_4<=0 | 1<=flag_0_8]] | [[p3_5<=0 | flag_0_14<=1] | flag_0_10<=1]]]]]] & [[[[~ [flag_1_7<=1] | [1<=flag_1_12 & [p1_4<=flag_0_0 | ~ [1<=flag_1_14]]]] | [p3_4<=0 & [~ [[flag_0_1<=1 | 1<=p0_11]] & [[1<=p0_5 | flag_0_1<=0] & ~ [flag_0_6<=0]]]]] | p3_3<=1] & [[[[[[p0_5<=0 & p0_12<=0] & ~ [p3_11<=1]] & ~ [p3_1<=flag_0_1]] & flag_1_0<=p3_4] & flag_1_13<=0] & 1<=flag_1_6]]]]]
normalized: ~ [E [true U ~ [[[[[1<=flag_1_6 & [flag_1_13<=0 & [flag_1_0<=p3_4 & [~ [p3_1<=flag_0_1] & [~ [p3_11<=1] & [p0_5<=0 & p0_12<=0]]]]]] & [p3_3<=1 | [[p3_4<=0 & [[~ [flag_0_6<=0] & [1<=p0_5 | flag_0_1<=0]] & ~ [[flag_0_1<=1 | 1<=p0_11]]]] | [[1<=flag_1_12 & [p1_4<=flag_0_0 | ~ [1<=flag_1_14]]] | ~ [flag_1_7<=1]]]]] & [~ [[[[[flag_0_10<=1 | [p3_5<=0 | flag_0_14<=1]] | [[p0_4<=0 | 1<=flag_0_8] | [flag_0_4<=0 | p1_9<=flag_1_9]]] | ~ [flag_1_0<=0]] & [[~ [[1<=flag_1_11 & 1<=p1_7]] | [p1_2<=flag_1_9 & [1<=p3_0 | 1<=p1_4]]] | [p0_4<=p3_10 & p1_1<=p1_5]]]] | [p3_9<=flag_0_14 | [1<=p3_5 & [[[flag_0_10<=0 & ~ [p3_10<=0]] | ~ [[1<=flag_0_7 | p1_7<=1]]] | ~ [1<=p1_10]]]]]] | [p3_8<=flag_0_7 | [p0_1<=p3_3 | [p0_2<=1 & ~ [[[p0_4<=p3_3 & ~ [[1<=p3_4 & 1<=p3_8]]] & [[flag_0_11<=1 | [1<=flag_0_3 | flag_1_10<=flag_0_11]] | [~ [p1_6<=0] | [1<=p1_6 | flag_0_0<=flag_0_0]]]]]]]]]]]]
abstracting: (flag_0_0<=flag_0_0)
states: 278,528 (5)
abstracting: (1<=p1_6)
states: 131,072 (5)
abstracting: (p1_6<=0)
states: 147,456 (5)
abstracting: (flag_1_10<=flag_0_11)
states: 200,704 (5)
abstracting: (1<=flag_0_3)
states: 131,072 (5)
abstracting: (flag_0_11<=1)
states: 278,528 (5)
abstracting: (1<=p3_8)
states: 16,384 (4)
abstracting: (1<=p3_4)
states: 16,384 (4)
abstracting: (p0_4<=p3_3)
states: 155,648 (5)
abstracting: (p0_2<=1)
states: 278,528 (5)
abstracting: (p0_1<=p3_3)
states: 155,648 (5)
abstracting: (p3_8<=flag_0_7)
states: 270,336 (5)
abstracting: (1<=p1_10)
states: 131,072 (5)
abstracting: (p1_7<=1)
states: 278,528 (5)
abstracting: (1<=flag_0_7)
states: 131,072 (5)
abstracting: (p3_10<=0)
states: 262,144 (5)
abstracting: (flag_0_10<=0)
states: 147,456 (5)
abstracting: (1<=p3_5)
states: 16,384 (4)
abstracting: (p3_9<=flag_0_14)
states: 270,336 (5)
abstracting: (p1_1<=p1_5)
states: 208,896 (5)
abstracting: (p0_4<=p3_10)
states: 155,648 (5)
abstracting: (1<=p1_4)
states: 131,072 (5)
abstracting: (1<=p3_0)
states: 16,384 (4)
abstracting: (p1_2<=flag_1_9)
states: 217,088 (5)
abstracting: (1<=p1_7)
states: 131,072 (5)
abstracting: (1<=flag_1_11)
states: 147,456 (5)
abstracting: (flag_1_0<=0)
states: 131,072 (5)
abstracting: (p1_9<=flag_1_9)
states: 278,528 (5)
abstracting: (flag_0_4<=0)
states: 147,456 (5)
abstracting: (1<=flag_0_8)
states: 131,072 (5)
abstracting: (p0_4<=0)
states: 147,456 (5)
abstracting: (flag_0_14<=1)
states: 278,528 (5)
abstracting: (p3_5<=0)
states: 262,144 (5)
abstracting: (flag_0_10<=1)
states: 278,528 (5)
abstracting: (flag_1_7<=1)
states: 278,528 (5)
abstracting: (1<=flag_1_14)
states: 147,456 (5)
abstracting: (p1_4<=flag_0_0)
states: 208,896 (5)
abstracting: (1<=flag_1_12)
states: 147,456 (5)
abstracting: (1<=p0_11)
states: 131,072 (5)
abstracting: (flag_0_1<=1)
states: 278,528 (5)
abstracting: (flag_0_1<=0)
states: 147,456 (5)
abstracting: (1<=p0_5)
states: 131,072 (5)
abstracting: (flag_0_6<=0)
states: 147,456 (5)
abstracting: (p3_4<=0)
states: 262,144 (5)
abstracting: (p3_3<=1)
states: 278,528 (5)
abstracting: (p0_12<=0)
states: 147,456 (5)
abstracting: (p0_5<=0)
states: 147,456 (5)
abstracting: (p3_11<=1)
states: 278,528 (5)
abstracting: (p3_1<=flag_0_1)
states: 262,144 (5)
abstracting: (flag_1_0<=p3_4)
states: 139,264 (5)
abstracting: (flag_1_13<=0)
states: 131,072 (5)
abstracting: (1<=flag_1_6)
states: 147,456 (5)
-> the formula is FALSE
FORMULA Dekker-PT-015-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.097sec
checking: AG [[[[~ [[[~ [flag_0_3<=flag_0_6] | ~ [[[p3_0<=p3_2 | 1<=flag_1_8] | flag_1_8<=p1_10]]] & [~ [[flag_1_11<=p1_9 & [p0_14<=p3_2 & p3_9<=p1_0]]] | [[[1<=p1_3 & 1<=flag_1_0] | p1_0<=0] & [[p0_14<=1 | 1<=p1_0] & [p3_6<=flag_0_12 | 1<=flag_0_9]]]]]] & [1<=p3_10 | [[~ [[[flag_1_12<=flag_1_14 | 1<=flag_0_3] | ~ [p0_7<=0]]] | [[~ [flag_1_1<=1] & p0_12<=p1_4] & [[1<=flag_0_11 | 1<=p0_5] & [1<=flag_0_4 | flag_1_10<=1]]]] & [[p1_4<=flag_0_6 & ~ [[1<=p1_0 | p1_12<=1]]] & ~ [p3_2<=flag_0_9]]]]] | ~ [[1<=p3_8 & [~ [[[~ [p0_8<=0] & p1_10<=0] | [p0_3<=0 | [p1_12<=1 & flag_1_14<=p0_0]]]] | [~ [[~ [p1_13<=0] & ~ [flag_1_13<=1]]] & p3_12<=0]]]]] | [[[p0_5<=p1_3 & p3_0<=flag_1_1] | ~ [[~ [[p1_4<=0 & ~ [1<=p1_10]]] & ~ [[~ [[p3_10<=flag_0_4 | flag_1_2<=0]] & ~ [[p0_13<=p3_5 & p0_7<=p0_10]]]]]]] & ~ [[[~ [flag_0_10<=0] | ~ [[[p0_1<=flag_0_0 | p0_6<=p1_4] & [flag_1_10<=flag_0_11 | p0_2<=p1_5]]]] & [[~ [1<=p3_5] & [~ [1<=flag_0_5] | ~ [1<=p1_3]]] | ~ [p0_2<=1]]]]]]]
normalized: ~ [E [true U ~ [[[~ [[[~ [p0_2<=1] | [[~ [1<=p1_3] | ~ [1<=flag_0_5]] & ~ [1<=p3_5]]] & [~ [[[flag_1_10<=flag_0_11 | p0_2<=p1_5] & [p0_1<=flag_0_0 | p0_6<=p1_4]]] | ~ [flag_0_10<=0]]]] & [~ [[~ [[~ [[p0_13<=p3_5 & p0_7<=p0_10]] & ~ [[p3_10<=flag_0_4 | flag_1_2<=0]]]] & ~ [[p1_4<=0 & ~ [1<=p1_10]]]]] | [p0_5<=p1_3 & p3_0<=flag_1_1]]] | [~ [[1<=p3_8 & [[p3_12<=0 & ~ [[~ [flag_1_13<=1] & ~ [p1_13<=0]]]] | ~ [[[p0_3<=0 | [p1_12<=1 & flag_1_14<=p0_0]] | [p1_10<=0 & ~ [p0_8<=0]]]]]]] | [[1<=p3_10 | [[~ [p3_2<=flag_0_9] & [p1_4<=flag_0_6 & ~ [[1<=p1_0 | p1_12<=1]]]] & [[[[1<=flag_0_4 | flag_1_10<=1] & [1<=flag_0_11 | 1<=p0_5]] & [p0_12<=p1_4 & ~ [flag_1_1<=1]]] | ~ [[~ [p0_7<=0] | [flag_1_12<=flag_1_14 | 1<=flag_0_3]]]]]] & ~ [[[[[[p3_6<=flag_0_12 | 1<=flag_0_9] & [p0_14<=1 | 1<=p1_0]] & [p1_0<=0 | [1<=p1_3 & 1<=flag_1_0]]] | ~ [[flag_1_11<=p1_9 & [p0_14<=p3_2 & p3_9<=p1_0]]]] & [~ [[flag_1_8<=p1_10 | [p3_0<=p3_2 | 1<=flag_1_8]]] | ~ [flag_0_3<=flag_0_6]]]]]]]]]]
abstracting: (flag_0_3<=flag_0_6)
states: 208,896 (5)
abstracting: (1<=flag_1_8)
states: 147,456 (5)
abstracting: (p3_0<=p3_2)
states: 262,144 (5)
abstracting: (flag_1_8<=p1_10)
states: 200,704 (5)
abstracting: (p3_9<=p1_0)
states: 270,336 (5)
abstracting: (p0_14<=p3_2)
states: 155,648 (5)
abstracting: (flag_1_11<=p1_9)
states: 200,704 (5)
abstracting: (1<=flag_1_0)
states: 147,456 (5)
abstracting: (1<=p1_3)
states: 131,072 (5)
abstracting: (p1_0<=0)
states: 147,456 (5)
abstracting: (1<=p1_0)
states: 131,072 (5)
abstracting: (p0_14<=1)
states: 278,528 (5)
abstracting: (1<=flag_0_9)
states: 131,072 (5)
abstracting: (p3_6<=flag_0_12)
states: 270,336 (5)
abstracting: (1<=flag_0_3)
states: 131,072 (5)
abstracting: (flag_1_12<=flag_1_14)
states: 208,896 (5)
abstracting: (p0_7<=0)
states: 147,456 (5)
abstracting: (flag_1_1<=1)
states: 278,528 (5)
abstracting: (p0_12<=p1_4)
states: 208,896 (5)
abstracting: (1<=p0_5)
states: 131,072 (5)
abstracting: (1<=flag_0_11)
states: 131,072 (5)
abstracting: (flag_1_10<=1)
states: 278,528 (5)
abstracting: (1<=flag_0_4)
states: 131,072 (5)
abstracting: (p1_12<=1)
states: 278,528 (5)
abstracting: (1<=p1_0)
states: 131,072 (5)
abstracting: (p1_4<=flag_0_6)
states: 208,896 (5)
abstracting: (p3_2<=flag_0_9)
states: 270,336 (5)
abstracting: (1<=p3_10)
states: 16,384 (4)
abstracting: (p0_8<=0)
states: 147,456 (5)
abstracting: (p1_10<=0)
states: 147,456 (5)
abstracting: (flag_1_14<=p0_0)
states: 200,704 (5)
abstracting: (p1_12<=1)
states: 278,528 (5)
abstracting: (p0_3<=0)
states: 147,456 (5)
abstracting: (p1_13<=0)
states: 147,456 (5)
abstracting: (flag_1_13<=1)
states: 278,528 (5)
abstracting: (p3_12<=0)
states: 262,144 (5)
abstracting: (1<=p3_8)
states: 16,384 (4)
abstracting: (p3_0<=flag_1_1)
states: 270,336 (5)
abstracting: (p0_5<=p1_3)
states: 208,896 (5)
abstracting: (1<=p1_10)
states: 131,072 (5)
abstracting: (p1_4<=0)
states: 147,456 (5)
abstracting: (flag_1_2<=0)
states: 131,072 (5)
abstracting: (p3_10<=flag_0_4)
states: 270,336 (5)
abstracting: (p0_7<=p0_10)
states: 208,896 (5)
abstracting: (p0_13<=p3_5)
states: 155,648 (5)
abstracting: (flag_0_10<=0)
states: 147,456 (5)
abstracting: (p0_6<=p1_4)
states: 208,896 (5)
abstracting: (p0_1<=flag_0_0)
states: 208,896 (5)
abstracting: (p0_2<=p1_5)
states: 208,896 (5)
abstracting: (flag_1_10<=flag_0_11)
states: 200,704 (5)
abstracting: (1<=p3_5)
states: 16,384 (4)
abstracting: (1<=flag_0_5)
states: 131,072 (5)
abstracting: (1<=p1_3)
states: 131,072 (5)
abstracting: (p0_2<=1)
states: 278,528 (5)
-> the formula is FALSE
FORMULA Dekker-PT-015-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.105sec
checking: EF [[~ [[~ [flag_0_5<=0] & [~ [[[p1_5<=1 & [~ [p1_3<=p3_10] | [1<=p0_10 | p1_8<=1]]] & flag_0_11<=0]] | [[[[[p3_2<=0 & flag_0_4<=1] & p1_9<=0] | [[p3_1<=1 | 1<=p0_6] & [p3_12<=flag_0_3 & p3_9<=p0_0]]] & [[~ [p0_14<=p0_7] | [1<=flag_0_11 | p3_3<=flag_1_3]] & ~ [flag_0_13<=1]]] | [1<=p0_14 | [~ [[flag_1_11<=p3_6 & p0_0<=1]] | 1<=p1_14]]]]]] & [[[[[~ [1<=p3_4] & [~ [[p1_12<=p3_10 & 1<=p0_0]] & p0_11<=0]] | [~ [[[p0_1<=p0_6 | p3_12<=0] | [1<=flag_1_10 | p0_14<=p1_14]]] & 1<=flag_0_6]] & [[[[1<=p1_7 | [1<=p1_13 & p0_0<=flag_1_3]] & [~ [1<=p0_13] & 1<=p0_12]] & ~ [[~ [1<=p1_9] | ~ [flag_0_9<=p3_10]]]] & ~ [flag_0_3<=0]]] & ~ [[1<=flag_0_14 & [~ [p0_10<=flag_0_12] | ~ [p3_0<=p0_1]]]]] | ~ [[[[[[[flag_0_2<=p0_3 & 1<=p0_5] & ~ [flag_1_2<=1]] | [[1<=p1_14 & 1<=flag_1_13] & [p0_12<=p3_0 | 1<=flag_0_10]]] | [[p1_3<=flag_1_12 | p1_12<=0] & [1<=p3_7 & [1<=p1_9 | 1<=p1_14]]]] | p1_6<=flag_1_0] | [[flag_0_1<=p0_5 | [[[p0_10<=p0_10 | flag_0_7<=0] | [flag_1_13<=p3_11 & p3_3<=flag_0_10]] & [~ [1<=flag_1_4] & p0_9<=flag_1_2]]] | p0_4<=1]]]]]]
normalized: E [true U [[~ [[[p0_4<=1 | [flag_0_1<=p0_5 | [[p0_9<=flag_1_2 & ~ [1<=flag_1_4]] & [[flag_1_13<=p3_11 & p3_3<=flag_0_10] | [p0_10<=p0_10 | flag_0_7<=0]]]]] | [p1_6<=flag_1_0 | [[[1<=p3_7 & [1<=p1_9 | 1<=p1_14]] & [p1_3<=flag_1_12 | p1_12<=0]] | [[[p0_12<=p3_0 | 1<=flag_0_10] & [1<=p1_14 & 1<=flag_1_13]] | [~ [flag_1_2<=1] & [flag_0_2<=p0_3 & 1<=p0_5]]]]]]] | [~ [[1<=flag_0_14 & [~ [p3_0<=p0_1] | ~ [p0_10<=flag_0_12]]]] & [[~ [flag_0_3<=0] & [~ [[~ [flag_0_9<=p3_10] | ~ [1<=p1_9]]] & [[1<=p0_12 & ~ [1<=p0_13]] & [1<=p1_7 | [1<=p1_13 & p0_0<=flag_1_3]]]]] & [[1<=flag_0_6 & ~ [[[1<=flag_1_10 | p0_14<=p1_14] | [p0_1<=p0_6 | p3_12<=0]]]] | [[p0_11<=0 & ~ [[p1_12<=p3_10 & 1<=p0_0]]] & ~ [1<=p3_4]]]]]] & ~ [[[[[1<=p0_14 | [1<=p1_14 | ~ [[flag_1_11<=p3_6 & p0_0<=1]]]] | [[~ [flag_0_13<=1] & [[1<=flag_0_11 | p3_3<=flag_1_3] | ~ [p0_14<=p0_7]]] & [[[p3_12<=flag_0_3 & p3_9<=p0_0] & [p3_1<=1 | 1<=p0_6]] | [p1_9<=0 & [p3_2<=0 & flag_0_4<=1]]]]] | ~ [[flag_0_11<=0 & [p1_5<=1 & [[1<=p0_10 | p1_8<=1] | ~ [p1_3<=p3_10]]]]]] & ~ [flag_0_5<=0]]]]]
abstracting: (flag_0_5<=0)
states: 147,456 (5)
abstracting: (p1_3<=p3_10)
states: 155,648 (5)
abstracting: (p1_8<=1)
states: 278,528 (5)
abstracting: (1<=p0_10)
states: 131,072 (5)
abstracting: (p1_5<=1)
states: 278,528 (5)
abstracting: (flag_0_11<=0)
states: 147,456 (5)
abstracting: (flag_0_4<=1)
states: 278,528 (5)
abstracting: (p3_2<=0)
states: 262,144 (5)
abstracting: (p1_9<=0)
states: 147,456 (5)
abstracting: (1<=p0_6)
states: 131,072 (5)
abstracting: (p3_1<=1)
states: 278,528 (5)
abstracting: (p3_9<=p0_0)
states: 270,336 (5)
abstracting: (p3_12<=flag_0_3)
states: 270,336 (5)
abstracting: (p0_14<=p0_7)
states: 208,896 (5)
abstracting: (p3_3<=flag_1_3)
states: 278,528 (5)
abstracting: (1<=flag_0_11)
states: 131,072 (5)
abstracting: (flag_0_13<=1)
states: 278,528 (5)
abstracting: (p0_0<=1)
states: 278,528 (5)
abstracting: (flag_1_11<=p3_6)
states: 139,264 (5)
abstracting: (1<=p1_14)
states: 131,072 (5)
abstracting: (1<=p0_14)
states: 131,072 (5)
abstracting: (1<=p3_4)
states: 16,384 (4)
abstracting: (1<=p0_0)
states: 131,072 (5)
abstracting: (p1_12<=p3_10)
states: 155,648 (5)
abstracting: (p0_11<=0)
states: 147,456 (5)
abstracting: (p3_12<=0)
states: 262,144 (5)
abstracting: (p0_1<=p0_6)
states: 208,896 (5)
abstracting: (p0_14<=p1_14)
states: 147,456 (5)
abstracting: (1<=flag_1_10)
states: 147,456 (5)
abstracting: (1<=flag_0_6)
states: 131,072 (5)
abstracting: (p0_0<=flag_1_3)
states: 217,088 (5)
abstracting: (1<=p1_13)
states: 131,072 (5)
abstracting: (1<=p1_7)
states: 131,072 (5)
abstracting: (1<=p0_13)
states: 131,072 (5)
abstracting: (1<=p0_12)
states: 131,072 (5)
abstracting: (1<=p1_9)
states: 131,072 (5)
abstracting: (flag_0_9<=p3_10)
states: 155,648 (5)
abstracting: (flag_0_3<=0)
states: 147,456 (5)
abstracting: (p0_10<=flag_0_12)
states: 208,896 (5)
abstracting: (p3_0<=p0_1)
states: 270,336 (5)
abstracting: (1<=flag_0_14)
states: 131,072 (5)
abstracting: (1<=p0_5)
states: 131,072 (5)
abstracting: (flag_0_2<=p0_3)
states: 208,896 (5)
abstracting: (flag_1_2<=1)
states: 278,528 (5)
abstracting: (1<=flag_1_13)
states: 147,456 (5)
abstracting: (1<=p1_14)
states: 131,072 (5)
abstracting: (1<=flag_0_10)
states: 131,072 (5)
abstracting: (p0_12<=p3_0)
states: 155,648 (5)
abstracting: (p1_12<=0)
states: 147,456 (5)
abstracting: (p1_3<=flag_1_12)
states: 217,088 (5)
abstracting: (1<=p1_14)
states: 131,072 (5)
abstracting: (1<=p1_9)
states: 131,072 (5)
abstracting: (1<=p3_7)
states: 16,384 (4)
abstracting: (p1_6<=flag_1_0)
states: 217,088 (5)
abstracting: (flag_0_7<=0)
states: 147,456 (5)
abstracting: (p0_10<=p0_10)
states: 278,528 (5)
abstracting: (p3_3<=flag_0_10)
states: 270,336 (5)
abstracting: (flag_1_13<=p3_11)
states: 139,264 (5)
abstracting: (1<=flag_1_4)
states: 147,456 (5)
abstracting: (p0_9<=flag_1_2)
states: 217,088 (5)
abstracting: (flag_0_1<=p0_5)
states: 208,896 (5)
abstracting: (p0_4<=1)
states: 278,528 (5)
-> the formula is TRUE
FORMULA Dekker-PT-015-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.085sec
totally nodes used: 354579 (3.5e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 203132 1584523 1787655
used/not used/entry size/cache size: 1658336 65450528 16 1024MB
basic ops cache: hits/miss/sum: 115331 795517 910848
used/not used/entry size/cache size: 1367099 15410117 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: 18361 110101 128462
used/not used/entry size/cache size: 109611 8278997 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 66781886
1 302279
2 22018
3 2470
4 201
5 10
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 7.248sec
BK_STOP 1678256712378
--------------------
content from stderr:
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.001sec
iterations count:4866 (19), effective:171 (0)
initing FirstDep: 0m 0.001sec
iterations count:255 (1), effective:0 (0)
iterations count:270 (1), effective:2 (0)
iterations count:615 (2), effective:4 (0)
iterations count:409 (1), effective:2 (0)
iterations count:3532 (13), effective:127 (0)
iterations count:2356 (9), effective:53 (0)
iterations count:2275 (8), effective:52 (0)
iterations count:3310 (12), effective:126 (0)
iterations count:3384 (13), effective:131 (0)
iterations count:913 (3), effective:15 (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-015"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
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 marcie"
echo " Input is Dekker-PT-015, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r129-smll-167819403200014"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-015.tgz
mv Dekker-PT-015 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;