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.r458-smll-167912649700002.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 SmallOperatingSystem-PT-MT0016DC0008, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912649700002
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 11K Feb 25 12:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 12:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 12:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 17:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 17:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 12:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 25 12:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 25 12:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 17:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 17:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 8.2K Mar 5 18:23 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 SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-00
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-01
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-02
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-03
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-04
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-05
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-06
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-07
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-08
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-09
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-10
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-11
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-12
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-13
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-14
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679231001012

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=SmallOperatingSystem-PT-MT0016DC0008
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 13:03:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 13:03:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 13:03:24] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2023-03-19 13:03:24] [INFO ] Transformed 9 places.
[2023-03-19 13:03:24] [INFO ] Transformed 8 transitions.
[2023-03-19 13:03:24] [INFO ] Parsed PT model containing 9 places and 8 transitions and 27 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 26 ms.
Initial state reduction rules removed 3 formulas.
FORMULA SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 20 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-19 13:03:25] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-19 13:03:25] [INFO ] Implicit Places using invariants in 237 ms returned []
[2023-03-19 13:03:25] [INFO ] Invariant cache hit.
[2023-03-19 13:03:25] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2023-03-19 13:03:25] [INFO ] Invariant cache hit.
[2023-03-19 13:03:25] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 451 ms. Remains : 9/9 places, 8/8 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-19 13:03:25] [INFO ] Flatten gal took : 31 ms
[2023-03-19 13:03:25] [INFO ] Flatten gal took : 10 ms
[2023-03-19 13:03:25] [INFO ] Input system was already deterministic with 8 transitions.
Finished random walk after 444 steps, including 0 resets, run visited all 25 properties in 49 ms. (steps per millisecond=9 )
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 5 ms
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 6 ms
[2023-03-19 13:03:26] [INFO ] Input system was already deterministic with 8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 5 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:03:26] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 5 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 8/9 places, 8/8 transitions.
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:03:26] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 4 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:03:26] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:03:26] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 2 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 8/9 places, 7/8 transitions.
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:03:26] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:03:26] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:03:26] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:03:26] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:03:26] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:03:26] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/9 places, 8/8 transitions.
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:03:26] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 5 transition count 6
Applied a total of 5 rules in 5 ms. Remains 5 /9 variables (removed 4) and now considering 6/8 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 5/9 places, 6/8 transitions.
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:03:26] [INFO ] Input system was already deterministic with 6 transitions.
Finished random walk after 35 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=17 )
FORMULA SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/9 places, 8/8 transitions.
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:03:26] [INFO ] Input system was already deterministic with 8 transitions.
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 4 ms
[2023-03-19 13:03:26] [INFO ] Flatten gal took : 4 ms
[2023-03-19 13:03:26] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-19 13:03:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 8 transitions and 27 arcs took 1 ms.
Total runtime 1722 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: 9 NrTr: 8 NrArc: 27)

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

net check time: 0m 0.000sec

init dd package: 0m 4.489sec


RS generation: 0m 0.008sec


-> reachability set: #nodes 177 (1.8e+02) #states 16,587 (4)



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

checking: AX [[p3<=0 & EG [A [1<=p4 U 1<=p7]]]]
normalized: ~ [EX [~ [[EG [[~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [1<=p7] & ~ [1<=p4]]]]]] & p3<=0]]]]

abstracting: (p3<=0)
states: 4,515 (3)
abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p7)
states: 13,152 (4)
abstracting: (1<=p7)
states: 13,152 (4)
abstracting: (1<=p7)
states: 13,152 (4)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AX [AX [~ [E [1<=p7 U [1<=p7 & 1<=p8]]]]]
normalized: ~ [EX [EX [E [1<=p7 U [1<=p7 & 1<=p8]]]]]

abstracting: (1<=p8)
states: 12,072 (4)
abstracting: (1<=p7)
states: 13,152 (4)
abstracting: (1<=p7)
states: 13,152 (4)
..-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [AG [EX [A [~ [[1<=p4 & 1<=p6]] U E [[1<=p5 & 1<=p6] U [1<=p4 & 1<=p6]]]]]]
normalized: E [true U ~ [E [true U ~ [EX [[~ [EG [~ [E [[1<=p5 & 1<=p6] U [1<=p4 & 1<=p6]]]]] & ~ [E [~ [E [[1<=p5 & 1<=p6] U [1<=p4 & 1<=p6]]] U [[1<=p4 & 1<=p6] & ~ [E [[1<=p5 & 1<=p6] U [1<=p4 & 1<=p6]]]]]]]]]]]]

abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p5)
states: 13,152 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p5)
states: 13,152 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p5)
states: 13,152 (4)
..........
EG iterations: 10
.-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AX [[AG [EF [EG [1<=p8]]] | [EF [1<=p7] | ~ [E [[1<=p4 | [1<=p7 | [1<=p0 & [1<=p1 & 1<=p2]]]] U AX [1<=p7]]]]]]
normalized: ~ [EX [~ [[[~ [E [[[[[1<=p1 & 1<=p2] & 1<=p0] | 1<=p7] | 1<=p4] U ~ [EX [~ [1<=p7]]]]] | E [true U 1<=p7]] | ~ [E [true U ~ [E [true U EG [1<=p8]]]]]]]]]

abstracting: (1<=p8)
states: 12,072 (4)
.
EG iterations: 1
abstracting: (1<=p7)
states: 13,152 (4)
abstracting: (1<=p7)
states: 13,152 (4)
.abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p7)
states: 13,152 (4)
abstracting: (1<=p0)
states: 16,587 (4)
abstracting: (1<=p2)
states: 15,102 (4)
abstracting: (1<=p1)
states: 13,152 (4)
.-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[[EF [p7<=0] | ~ [E [[[1<=p4 & 1<=p6] | AG [1<=p4]] U [1<=p6 & 1<=p5]]]] | [EF [1<=p3] | [1<=p5 & 1<=p6]]]]
normalized: ~ [E [true U ~ [[[~ [E [[~ [E [true U ~ [1<=p4]]] | [1<=p4 & 1<=p6]] U [1<=p6 & 1<=p5]]] | E [true U p7<=0]] | [[1<=p5 & 1<=p6] | E [true U 1<=p3]]]]]]

abstracting: (1<=p3)
states: 12,072 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p5)
states: 13,152 (4)
abstracting: (p7<=0)
states: 3,435 (3)
abstracting: (1<=p5)
states: 13,152 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p4)
states: 13,152 (4)
-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: [AX [AG [[AG [[1<=p5 & 1<=p6]] | [1<=p8 | [1<=p0 & [1<=p2 & 1<=p5]]]]]] | [EX [[1<=p5 & 1<=p6]] | EG [1<=p4]]]
normalized: [~ [EX [E [true U ~ [[~ [E [true U ~ [[1<=p5 & 1<=p6]]]] | [[[1<=p2 & 1<=p5] & 1<=p0] | 1<=p8]]]]]] | [EG [1<=p4] | EX [[1<=p5 & 1<=p6]]]]

abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p5)
states: 13,152 (4)
.abstracting: (1<=p4)
states: 13,152 (4)
.
EG iterations: 1
abstracting: (1<=p8)
states: 12,072 (4)
abstracting: (1<=p0)
states: 16,587 (4)
abstracting: (1<=p5)
states: 13,152 (4)
abstracting: (1<=p2)
states: 15,102 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p5)
states: 13,152 (4)
.-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: [A [~ [[~ [[1<=p0 & [1<=p1 & 1<=p2]]] | ~ [[1<=p5 & 1<=p6]]]] U [AF [[1<=p4 & [1<=p6 & [1<=p3 | EX [1<=p3]]]]] | EX [1<=p4]]] & AX [[1<=p4 & 1<=p6]]]
normalized: [~ [EX [~ [[1<=p4 & 1<=p6]]]] & [~ [EG [~ [[EX [1<=p4] | ~ [EG [~ [[[[EX [1<=p3] | 1<=p3] & 1<=p6] & 1<=p4]]]]]]]] & ~ [E [~ [[EX [1<=p4] | ~ [EG [~ [[[[EX [1<=p3] | 1<=p3] & 1<=p6] & 1<=p4]]]]]] U [[~ [[1<=p5 & 1<=p6]] | ~ [[[1<=p1 & 1<=p2] & 1<=p0]]] & ~ [[EX [1<=p4] | ~ [EG [~ [[[[EX [1<=p3] | 1<=p3] & 1<=p6] & 1<=p4]]]]]]]]]]]

abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p3)
states: 12,072 (4)
abstracting: (1<=p3)
states: 12,072 (4)
.........
EG iterations: 8
abstracting: (1<=p4)
states: 13,152 (4)
.abstracting: (1<=p0)
states: 16,587 (4)
abstracting: (1<=p2)
states: 15,102 (4)
abstracting: (1<=p1)
states: 13,152 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p5)
states: 13,152 (4)
abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p3)
states: 12,072 (4)
abstracting: (1<=p3)
states: 12,072 (4)
.........
EG iterations: 8
abstracting: (1<=p4)
states: 13,152 (4)
.abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p3)
states: 12,072 (4)
abstracting: (1<=p3)
states: 12,072 (4)
.........
EG iterations: 8
abstracting: (1<=p4)
states: 13,152 (4)
...
EG iterations: 2
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p4)
states: 13,152 (4)
.-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EG [[AG [[~ [E [[1<=p0 & [1<=p2 & 1<=p5]] U 1<=p3]] | AF [[p4<=0 | p6<=0]]]] & [EF [1<=p8] | [~ [A [1<=p8 U 1<=p8]] | [[p4<=0 | p6<=0] & [p5<=0 | p6<=0]]]]]]
normalized: EG [[~ [E [true U ~ [[~ [EG [~ [[p4<=0 | p6<=0]]]] | ~ [E [[[1<=p2 & 1<=p5] & 1<=p0] U 1<=p3]]]]]] & [[[[p5<=0 | p6<=0] & [p4<=0 | p6<=0]] | ~ [[~ [EG [~ [1<=p8]]] & ~ [E [~ [1<=p8] U [~ [1<=p8] & ~ [1<=p8]]]]]]] | E [true U 1<=p8]]]]

abstracting: (1<=p8)
states: 12,072 (4)
abstracting: (1<=p8)
states: 12,072 (4)
abstracting: (1<=p8)
states: 12,072 (4)
abstracting: (1<=p8)
states: 12,072 (4)
abstracting: (1<=p8)
states: 12,072 (4)
..
EG iterations: 2
abstracting: (p6<=0)
states: 1
abstracting: (p4<=0)
states: 3,435 (3)
abstracting: (p6<=0)
states: 1
abstracting: (p5<=0)
states: 3,435 (3)
abstracting: (1<=p3)
states: 12,072 (4)
abstracting: (1<=p0)
states: 16,587 (4)
abstracting: (1<=p5)
states: 13,152 (4)
abstracting: (1<=p2)
states: 15,102 (4)
abstracting: (p6<=0)
states: 1
abstracting: (p4<=0)
states: 3,435 (3)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AF [[AG [[[1<=p7 & [p5<=0 | p6<=0]] & [1<=p0 & [1<=p1 & 1<=p2]]]] & ~ [E [[EG [[1<=p4 & 1<=p6]] | [AG [[1<=p0 & [1<=p2 & 1<=p5]]] | EF [1<=p7]]] U ~ [[[1<=p5 & 1<=p6] | 1<=p7]]]]]]
normalized: ~ [EG [~ [[~ [E [true U ~ [[[[1<=p1 & 1<=p2] & 1<=p0] & [[p5<=0 | p6<=0] & 1<=p7]]]]] & ~ [E [[[E [true U 1<=p7] | ~ [E [true U ~ [[[1<=p2 & 1<=p5] & 1<=p0]]]]] | EG [[1<=p4 & 1<=p6]]] U ~ [[[1<=p5 & 1<=p6] | 1<=p7]]]]]]]]

abstracting: (1<=p7)
states: 13,152 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p5)
states: 13,152 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p4)
states: 13,152 (4)
.
EG iterations: 1
abstracting: (1<=p0)
states: 16,587 (4)
abstracting: (1<=p5)
states: 13,152 (4)
abstracting: (1<=p2)
states: 15,102 (4)
abstracting: (1<=p7)
states: 13,152 (4)
abstracting: (1<=p7)
states: 13,152 (4)
abstracting: (p6<=0)
states: 1
abstracting: (p5<=0)
states: 3,435 (3)
abstracting: (1<=p0)
states: 16,587 (4)
abstracting: (1<=p2)
states: 15,102 (4)
abstracting: (1<=p1)
states: 13,152 (4)

EG iterations: 0
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EX [E [[~ [[[p7<=0 | A [1<=p4 U [1<=p0 & [1<=p2 & 1<=p5]]]] & AF [1<=p4]]] & EF [[[1<=p7 & 1<=p4] & [1<=p6 & EG [1<=p7]]]]] U A [EG [A [[1<=p0 & [1<=p2 & 1<=p5]] U [1<=p5 & 1<=p6]]] U EG [1<=p3]]]]
normalized: EX [E [[E [true U [[EG [1<=p7] & 1<=p6] & [1<=p7 & 1<=p4]]] & ~ [[~ [EG [~ [1<=p4]]] & [[~ [EG [~ [[[1<=p2 & 1<=p5] & 1<=p0]]]] & ~ [E [~ [[[1<=p2 & 1<=p5] & 1<=p0]] U [~ [1<=p4] & ~ [[[1<=p2 & 1<=p5] & 1<=p0]]]]]] | p7<=0]]]] U [~ [EG [~ [EG [1<=p3]]]] & ~ [E [~ [EG [1<=p3]] U [~ [EG [[~ [EG [~ [[1<=p5 & 1<=p6]]]] & ~ [E [~ [[1<=p5 & 1<=p6]] U [~ [[[1<=p2 & 1<=p5] & 1<=p0]] & ~ [[1<=p5 & 1<=p6]]]]]]]] & ~ [EG [1<=p3]]]]]]]]

abstracting: (1<=p3)
states: 12,072 (4)
.
EG iterations: 1
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p5)
states: 13,152 (4)
abstracting: (1<=p0)
states: 16,587 (4)
abstracting: (1<=p5)
states: 13,152 (4)
abstracting: (1<=p2)
states: 15,102 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p5)
states: 13,152 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p5)
states: 13,152 (4)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (1<=p3)
states: 12,072 (4)
.
EG iterations: 1
abstracting: (1<=p3)
states: 12,072 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p7<=0)
states: 3,435 (3)
abstracting: (1<=p0)
states: 16,587 (4)
abstracting: (1<=p5)
states: 13,152 (4)
abstracting: (1<=p2)
states: 15,102 (4)
abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p0)
states: 16,587 (4)
abstracting: (1<=p5)
states: 13,152 (4)
abstracting: (1<=p2)
states: 15,102 (4)
abstracting: (1<=p0)
states: 16,587 (4)
abstracting: (1<=p5)
states: 13,152 (4)
abstracting: (1<=p2)
states: 15,102 (4)
..
EG iterations: 2
abstracting: (1<=p4)
states: 13,152 (4)
..........
EG iterations: 10
abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p7)
states: 13,152 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p7)
states: 13,152 (4)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: EF [[[AG [~ [E [1<=p8 U [1<=p0 & [1<=p1 & 1<=p2]]]]] | EG [[[1<=p0 & 1<=p2] & [1<=p5 & AG [[1<=p4 & 1<=p6]]]]]] & [AF [[1<=p3 | 1<=p8]] | AG [[[EF [[p0<=0 | [p1<=0 | p2<=0]]] | [p0<=0 | p2<=0]] | [p5<=0 | [p4<=0 | p6<=0]]]]]]]
normalized: E [true U [[~ [E [true U ~ [[[[p4<=0 | p6<=0] | p5<=0] | [[p0<=0 | p2<=0] | E [true U [[p1<=0 | p2<=0] | p0<=0]]]]]]] | ~ [EG [~ [[1<=p3 | 1<=p8]]]]] & [EG [[[1<=p5 & ~ [E [true U ~ [[1<=p4 & 1<=p6]]]]] & [1<=p0 & 1<=p2]]] | ~ [E [true U E [1<=p8 U [1<=p0 & [1<=p1 & 1<=p2]]]]]]]]

abstracting: (1<=p2)
states: 15,102 (4)
abstracting: (1<=p1)
states: 13,152 (4)
abstracting: (1<=p0)
states: 16,587 (4)
abstracting: (1<=p8)
states: 12,072 (4)
abstracting: (1<=p2)
states: 15,102 (4)
abstracting: (1<=p0)
states: 16,587 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p5)
states: 13,152 (4)
.
EG iterations: 1
abstracting: (1<=p8)
states: 12,072 (4)
abstracting: (1<=p3)
states: 12,072 (4)
..
EG iterations: 2
abstracting: (p0<=0)
states: 0
abstracting: (p2<=0)
states: 1,485 (3)
abstracting: (p1<=0)
states: 3,435 (3)
abstracting: (p2<=0)
states: 1,485 (3)
abstracting: (p0<=0)
states: 0
abstracting: (p5<=0)
states: 3,435 (3)
abstracting: (p6<=0)
states: 1
abstracting: (p4<=0)
states: 3,435 (3)
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: A [[[AX [[1<=p7 | [[EF [1<=p8] | ~ [[1<=p4 & 1<=p6]]] & [p3<=0 | [1<=p7 | [1<=p0 & [1<=p2 & 1<=p5]]]]]]] | [~ [[[1<=p0 & [1<=p2 & 1<=p5]] | [p4<=0 | [[1<=p7 & 1<=p4] & [1<=p4 & 1<=p6]]]]] | E [AX [1<=p8] U 1<=p7]]] | [AF [AG [1<=p3]] | [[[1<=p8 & 1<=p3] & [A [[1<=p5 & 1<=p6] U 1<=p8] & E [[1<=p0 & [1<=p2 & 1<=p5]] U [1<=p0 & [1<=p1 & 1<=p2]]]]] | [~ [[1<=p8 & [1<=p4 & 1<=p6]]] & AG [[1<=p4 & 1<=p6]]]]]] U [AG [[[EX [1<=p8] | E [1<=p3 U 1<=p4]] & ~ [[[[1<=p0 & [1<=p2 & 1<=p5]] | [1<=p4 & 1<=p6]] | [1<=p4 | [1<=p0 & [1<=p1 & 1<=p2]]]]]]] | [EF [[1<=p5 & 1<=p6]] & [AG [[p3<=0 & AG [1<=p4]]] & [~ [[AG [[1<=p4 & 1<=p6]] | E [1<=p3 U 1<=p3]]] | [1<=p4 & 1<=p6]]]]]]
normalized: [~ [EG [~ [[[[[[1<=p4 & 1<=p6] | ~ [[E [1<=p3 U 1<=p3] | ~ [E [true U ~ [[1<=p4 & 1<=p6]]]]]]] & ~ [E [true U ~ [[~ [E [true U ~ [1<=p4]]] & p3<=0]]]]] & E [true U [1<=p5 & 1<=p6]]] | ~ [E [true U ~ [[~ [[[[[1<=p1 & 1<=p2] & 1<=p0] | 1<=p4] | [[1<=p4 & 1<=p6] | [[1<=p2 & 1<=p5] & 1<=p0]]]] & [E [1<=p3 U 1<=p4] | EX [1<=p8]]]]]]]]]] & ~ [E [~ [[[[[[1<=p4 & 1<=p6] | ~ [[E [1<=p3 U 1<=p3] | ~ [E [true U ~ [[1<=p4 & 1<=p6]]]]]]] & ~ [E [true U ~ [[~ [E [true U ~ [1<=p4]]] & p3<=0]]]]] & E [true U [1<=p5 & 1<=p6]]] | ~ [E [true U ~ [[~ [[[[[1<=p1 & 1<=p2] & 1<=p0] | 1<=p4] | [[1<=p4 & 1<=p6] | [[1<=p2 & 1<=p5] & 1<=p0]]]] & [E [1<=p3 U 1<=p4] | EX [1<=p8]]]]]]]] U [~ [[[[[~ [E [true U ~ [[1<=p4 & 1<=p6]]]] & ~ [[[1<=p4 & 1<=p6] & 1<=p8]]] | [[E [[[1<=p2 & 1<=p5] & 1<=p0] U [[1<=p1 & 1<=p2] & 1<=p0]] & [~ [EG [~ [1<=p8]]] & ~ [E [~ [1<=p8] U [~ [[1<=p5 & 1<=p6]] & ~ [1<=p8]]]]]] & [1<=p8 & 1<=p3]]] | ~ [EG [E [true U ~ [1<=p3]]]]] | [[E [~ [EX [~ [1<=p8]]] U 1<=p7] | ~ [[[[[1<=p4 & 1<=p6] & [1<=p7 & 1<=p4]] | p4<=0] | [[1<=p2 & 1<=p5] & 1<=p0]]]] | ~ [EX [~ [[[[[[[1<=p2 & 1<=p5] & 1<=p0] | 1<=p7] | p3<=0] & [~ [[1<=p4 & 1<=p6]] | E [true U 1<=p8]]] | 1<=p7]]]]]]] & ~ [[[[[[1<=p4 & 1<=p6] | ~ [[E [1<=p3 U 1<=p3] | ~ [E [true U ~ [[1<=p4 & 1<=p6]]]]]]] & ~ [E [true U ~ [[~ [E [true U ~ [1<=p4]]] & p3<=0]]]]] & E [true U [1<=p5 & 1<=p6]]] | ~ [E [true U ~ [[~ [[[[[1<=p1 & 1<=p2] & 1<=p0] | 1<=p4] | [[1<=p4 & 1<=p6] | [[1<=p2 & 1<=p5] & 1<=p0]]]] & [E [1<=p3 U 1<=p4] | EX [1<=p8]]]]]]]]]]]]

abstracting: (1<=p8)
states: 12,072 (4)
.abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p3)
states: 12,072 (4)
abstracting: (1<=p0)
states: 16,587 (4)
abstracting: (1<=p5)
states: 13,152 (4)
abstracting: (1<=p2)
states: 15,102 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p0)
states: 16,587 (4)
abstracting: (1<=p2)
states: 15,102 (4)
abstracting: (1<=p1)
states: 13,152 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p5)
states: 13,152 (4)
abstracting: (p3<=0)
states: 4,515 (3)
abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p3)
states: 12,072 (4)
abstracting: (1<=p3)
states: 12,072 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p7)
states: 13,152 (4)
abstracting: (1<=p8)
states: 12,072 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (p3<=0)
states: 4,515 (3)
abstracting: (1<=p7)
states: 13,152 (4)
abstracting: (1<=p0)
states: 16,587 (4)
abstracting: (1<=p5)
states: 13,152 (4)
abstracting: (1<=p2)
states: 15,102 (4)
.abstracting: (1<=p0)
states: 16,587 (4)
abstracting: (1<=p5)
states: 13,152 (4)
abstracting: (1<=p2)
states: 15,102 (4)
abstracting: (p4<=0)
states: 3,435 (3)
abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p7)
states: 13,152 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p7)
states: 13,152 (4)
abstracting: (1<=p8)
states: 12,072 (4)
.abstracting: (1<=p3)
states: 12,072 (4)

EG iterations: 0
abstracting: (1<=p3)
states: 12,072 (4)
abstracting: (1<=p8)
states: 12,072 (4)
abstracting: (1<=p8)
states: 12,072 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p5)
states: 13,152 (4)
abstracting: (1<=p8)
states: 12,072 (4)
abstracting: (1<=p8)
states: 12,072 (4)
..
EG iterations: 2
abstracting: (1<=p0)
states: 16,587 (4)
abstracting: (1<=p2)
states: 15,102 (4)
abstracting: (1<=p1)
states: 13,152 (4)
abstracting: (1<=p0)
states: 16,587 (4)
abstracting: (1<=p5)
states: 13,152 (4)
abstracting: (1<=p2)
states: 15,102 (4)
abstracting: (1<=p8)
states: 12,072 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p8)
states: 12,072 (4)
.abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p3)
states: 12,072 (4)
abstracting: (1<=p0)
states: 16,587 (4)
abstracting: (1<=p5)
states: 13,152 (4)
abstracting: (1<=p2)
states: 15,102 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p0)
states: 16,587 (4)
abstracting: (1<=p2)
states: 15,102 (4)
abstracting: (1<=p1)
states: 13,152 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p5)
states: 13,152 (4)
abstracting: (p3<=0)
states: 4,515 (3)
abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p3)
states: 12,072 (4)
abstracting: (1<=p3)
states: 12,072 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p8)
states: 12,072 (4)
.abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p3)
states: 12,072 (4)
abstracting: (1<=p0)
states: 16,587 (4)
abstracting: (1<=p5)
states: 13,152 (4)
abstracting: (1<=p2)
states: 15,102 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p0)
states: 16,587 (4)
abstracting: (1<=p2)
states: 15,102 (4)
abstracting: (1<=p1)
states: 13,152 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p5)
states: 13,152 (4)
abstracting: (p3<=0)
states: 4,515 (3)
abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p4)
states: 13,152 (4)
abstracting: (1<=p3)
states: 12,072 (4)
abstracting: (1<=p3)
states: 12,072 (4)
abstracting: (1<=p6)
states: 16,586 (4)
abstracting: (1<=p4)
states: 13,152 (4)

EG iterations: 0
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0016DC0008-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

totally nodes used: 14600 (1.5e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 165667 43837 209504
used/not used/entry size/cache size: 53428 67055436 16 1024MB
basic ops cache: hits/miss/sum: 60345 17554 77899
used/not used/entry size/cache size: 33173 16744043 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: 3278 749 4027
used/not used/entry size/cache size: 749 8387859 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 67096125
1 12115
2 342
3 142
4 41
5 32
6 8
7 7
8 10
9 9
>= 10 33

Total processing time: 0m 6.946sec


BK_STOP 1679231017088

--------------------
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:288 (36), effective:72 (9)

initing FirstDep: 0m 0.000sec


iterations count:72 (9), effective:16 (2)

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

iterations count:23 (2), effective:5 (0)

iterations count:23 (2), effective:5 (0)

iterations count:23 (2), effective:5 (0)

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

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

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

iterations count:42 (5), effective:10 (1)

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

iterations count:72 (9), effective:16 (2)

iterations count:72 (9), effective:16 (2)

iterations count:24 (3), effective:5 (0)

iterations count:112 (14), effective:32 (4)

iterations count:87 (10), effective:31 (3)

iterations count:53 (6), effective:15 (1)

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

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

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

iterations count:38 (4), effective:9 (1)

iterations count:104 (13), effective:24 (3)

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

iterations count:176 (22), effective:48 (6)

iterations count:32 (4), effective:8 (1)

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

iterations count:56 (7), effective:16 (2)

iterations count:72 (9), effective:16 (2)

iterations count:40 (5), effective:10 (1)

iterations count:105 (13), effective:26 (3)

iterations count:27 (3), effective:7 (0)

iterations count:23 (2), effective:5 (0)

iterations count:72 (9), effective:16 (2)

iterations count:32 (4), effective:8 (1)

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

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

iterations count:24 (3), effective:5 (0)

iterations count:72 (9), effective:16 (2)

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

iterations count:72 (9), effective:16 (2)

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

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

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

iterations count:16 (2), effective:8 (1)

iterations count:96 (12), effective:24 (3)

iterations count:24 (3), effective:5 (0)

iterations count:72 (9), effective:16 (2)

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

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

iterations count:24 (3), effective:5 (0)

iterations count:72 (9), effective:16 (2)

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

iterations count:72 (9), effective:16 (2)

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

iterations count:233 (29), effective:75 (9)

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

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

iterations count:24 (3), effective:5 (0)

iterations count:72 (9), effective:16 (2)

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

iterations count:72 (9), effective:16 (2)

iterations count:8 (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="SmallOperatingSystem-PT-MT0016DC0008"
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 SmallOperatingSystem-PT-MT0016DC0008, 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 r458-smll-167912649700002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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