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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.1K Feb 25 12:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 12:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 12:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 12:42 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.6K Feb 25 17:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K Feb 25 17:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 25 12:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 12:42 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-MT0128DC0032-CTLFireability-00
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLFireability-01
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLFireability-02
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLFireability-03
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLFireability-04
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLFireability-05
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLFireability-06
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLFireability-07
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLFireability-08
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLFireability-09
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLFireability-10
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLFireability-11
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLFireability-12
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLFireability-13
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLFireability-14
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679231520889

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-MT0128DC0032
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 13:12:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 13:12:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 13:12:03] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2023-03-19 13:12:03] [INFO ] Transformed 9 places.
[2023-03-19 13:12:03] [INFO ] Transformed 8 transitions.
[2023-03-19 13:12:03] [INFO ] Parsed PT model containing 9 places and 8 transitions and 27 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Initial state reduction rules removed 3 formulas.
FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLFireability-14 FALSE 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 13 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:12:03] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-19 13:12:05] [INFO ] Implicit Places using invariants in 2073 ms returned []
[2023-03-19 13:12:05] [INFO ] Invariant cache hit.
[2023-03-19 13:12:06] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 2162 ms to find 0 implicit places.
[2023-03-19 13:12:06] [INFO ] Invariant cache hit.
[2023-03-19 13:12:06] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2228 ms. Remains : 9/9 places, 8/8 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-19 13:12:06] [INFO ] Flatten gal took : 22 ms
[2023-03-19 13:12:06] [INFO ] Flatten gal took : 7 ms
[2023-03-19 13:12:06] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 10024 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=139 ) properties (out of 24) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 13:12:06] [INFO ] Invariant cache hit.
[2023-03-19 13:12:07] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2023-03-19 13:12:07] [INFO ] Flatten gal took : 4 ms
[2023-03-19 13:12:07] [INFO ] Flatten gal took : 4 ms
[2023-03-19 13:12:07] [INFO ] Input system was already deterministic with 8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 2 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 2 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:12:07] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:12:07] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:12:07] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 3 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 3 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:12:07] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:12:07] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:12:07] [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
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 0 with 3 rules applied. Total rules applied 5 place count 6 transition count 6
Applied a total of 5 rules in 10 ms. Remains 6 /9 variables (removed 3) and now considering 6/8 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 6/9 places, 6/8 transitions.
[2023-03-19 13:12:07] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:12:07] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:12:07] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL 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 1 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/9 places, 7/8 transitions.
[2023-03-19 13:12:07] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:12:07] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:12:07] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL 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 1 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/9 places, 7/8 transitions.
[2023-03-19 13:12:07] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:12:07] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:12:07] [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:12:07] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:12:07] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:12:07] [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:12:07] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:12:07] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:12:07] [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:12:08] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:12:08] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:12:08] [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:12:08] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:12:08] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:12:08] [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 1 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:12:08] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:12:08] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:12:08] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL 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 LTL mode , in 1 iterations and 2 ms. Remains : 8/9 places, 7/8 transitions.
[2023-03-19 13:12:08] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:12:08] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:12:08] [INFO ] Input system was already deterministic with 7 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 3 edges and 5 vertex of which 2 / 5 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 4 transition count 6
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 4 transition count 5
Applied a total of 7 rules in 8 ms. Remains 4 /9 variables (removed 5) and now considering 5/8 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 4/9 places, 5/8 transitions.
[2023-03-19 13:12:08] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:12:08] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:12:08] [INFO ] Input system was already deterministic with 5 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:12:08] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:12:08] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:12:08] [INFO ] Input system was already deterministic with 8 transitions.
[2023-03-19 13:12:08] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:12:08] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:12:08] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-19 13:12:08] [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 4579 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.000sec

net check time: 0m 0.000sec

init dd package: 0m 3.665sec


RS generation: 0m 0.447sec


-> reachability set: #nodes 1577 (1.6e+03) #states 113,321,065 (8)



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

checking: EF [AG [1<=p7]]
normalized: E [true U ~ [E [true U ~ [1<=p7]]]]

abstracting: (1<=p7)
states: 110,021,824 (8)
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

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

abstracting: (1<=p8)
states: 105,722,760 (8)
abstracting: (1<=p6)
states: 112,756,512 (8)
abstracting: (1<=p5)
states: 110,561,880 (8)
.
EG iterations: 1
abstracting: (1<=p8)
states: 105,722,760 (8)
abstracting: (1<=p8)
states: 105,722,760 (8)

EG iterations: 0
.-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.450sec

checking: EF [AG [[EF [[p0<=0 | [p1<=0 | p2<=0]]] | p4<=0]]]
normalized: E [true U ~ [E [true U ~ [[E [true U [[p1<=0 | p2<=0] | p0<=0]] | p4<=0]]]]]

abstracting: (p4<=0)
states: 2,759,185 (6)
abstracting: (p0<=0)
states: 0
abstracting: (p2<=0)
states: 4,978,545 (6)
abstracting: (p1<=0)
states: 2,759,185 (6)
-> the formula is TRUE

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

MC time: 0m 0.170sec

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

abstracting: (1<=p4)
states: 110,561,880 (8)
abstracting: (p0<=0)
states: 0
abstracting: (p5<=0)
states: 2,759,185 (6)
abstracting: (p2<=0)
states: 4,978,545 (6)
...................................
EG iterations: 34
-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.359sec

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

abstracting: (p0<=0)
states: 0
abstracting: (p2<=0)
states: 4,978,545 (6)
abstracting: (p1<=0)
states: 2,759,185 (6)
.abstracting: (1<=p6)
states: 112,756,512 (8)
abstracting: (1<=p4)
states: 110,561,880 (8)
abstracting: (1<=p4)
states: 110,561,880 (8)
abstracting: (1<=p6)
states: 112,756,512 (8)
abstracting: (1<=p4)
states: 110,561,880 (8)
abstracting: (1<=p6)
states: 112,756,512 (8)
abstracting: (1<=p4)
states: 110,561,880 (8)
..................................
EG iterations: 34
abstracting: (1<=p7)
states: 110,021,824 (8)
.
EG iterations: 1
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.088sec

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

abstracting: (1<=p7)
states: 110,021,824 (8)
.abstracting: (1<=p6)
states: 112,756,512 (8)
abstracting: (1<=p5)
states: 110,561,880 (8)
abstracting: (1<=p0)
states: 113,321,065 (8)
abstracting: (1<=p5)
states: 110,561,880 (8)
abstracting: (1<=p2)
states: 108,342,520 (8)
.abstracting: (1<=p4)
states: 110,561,880 (8)
-> the formula is FALSE

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

MC time: 0m 0.008sec

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

abstracting: (p0<=0)
states: 0
abstracting: (p2<=0)
states: 4,978,545 (6)
abstracting: (p1<=0)
states: 2,759,185 (6)
.abstracting: (1<=p8)
states: 105,722,760 (8)
.abstracting: (1<=p6)
states: 112,756,512 (8)
abstracting: (1<=p4)
states: 110,561,880 (8)
abstracting: (1<=p8)
states: 105,722,760 (8)
abstracting: (p0<=0)
states: 0
abstracting: (p2<=0)
states: 4,978,545 (6)
abstracting: (p1<=0)
states: 2,759,185 (6)
abstracting: (1<=p8)
states: 105,722,760 (8)
abstracting: (1<=p8)
states: 105,722,760 (8)
..
EG iterations: 2
.-> the formula is FALSE

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

MC time: 0m 1.535sec

checking: EX [[EG [[EG [1<=p8] & [EG [1<=p3] | [p3<=0 & [p4<=0 | p6<=0]]]]] | EG [[[1<=p5 & [1<=p6 & 1<=p3]] & [1<=p0 & [1<=p1 & 1<=p2]]]]]]
normalized: EX [[EG [[[[[p4<=0 | p6<=0] & p3<=0] | EG [1<=p3]] & EG [1<=p8]]] | EG [[[[1<=p1 & 1<=p2] & 1<=p0] & [[1<=p6 & 1<=p3] & 1<=p5]]]]]

abstracting: (1<=p5)
states: 110,561,880 (8)
abstracting: (1<=p3)
states: 105,722,760 (8)
abstracting: (1<=p6)
states: 112,756,512 (8)
abstracting: (1<=p0)
states: 113,321,065 (8)
abstracting: (1<=p2)
states: 108,342,520 (8)
abstracting: (1<=p1)
states: 110,561,880 (8)
.
EG iterations: 1
abstracting: (1<=p8)
states: 105,722,760 (8)
.
EG iterations: 1
abstracting: (1<=p3)
states: 105,722,760 (8)
.
EG iterations: 1
abstracting: (p3<=0)
states: 7,598,305 (6)
abstracting: (p6<=0)
states: 564,553 (5)
abstracting: (p4<=0)
states: 2,759,185 (6)
.................................
EG iterations: 33
.-> the formula is FALSE

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

MC time: 0m 0.194sec

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

abstracting: (p0<=0)
states: 0
abstracting: (p5<=0)
states: 2,759,185 (6)
abstracting: (p2<=0)
states: 4,978,545 (6)
abstracting: (p8<=0)
states: 7,598,305 (6)
abstracting: (p6<=0)
states: 564,553 (5)
abstracting: (p5<=0)
states: 2,759,185 (6)
abstracting: (p7<=0)
states: 3,299,241 (6)
abstracting: (1<=p1)
states: 110,561,880 (8)
abstracting: (1<=p0)
states: 113,321,065 (8)
abstracting: (1<=p2)
states: 108,342,520 (8)
abstracting: (1<=p0)
states: 113,321,065 (8)
abstracting: (1<=p5)
states: 110,561,880 (8)
abstracting: (1<=p2)
states: 108,342,520 (8)
abstracting: (1<=p0)
states: 113,321,065 (8)
abstracting: (1<=p2)
states: 108,342,520 (8)
abstracting: (1<=p1)
states: 110,561,880 (8)
-> the formula is TRUE

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

MC time: 0m 0.010sec

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

abstracting: (1<=p6)
states: 112,756,512 (8)
abstracting: (1<=p5)
states: 110,561,880 (8)
abstracting: (1<=p6)
states: 112,756,512 (8)
abstracting: (1<=p4)
states: 110,561,880 (8)
abstracting: (1<=p4)
states: 110,561,880 (8)
abstracting: (1<=p6)
states: 112,756,512 (8)
abstracting: (1<=p4)
states: 110,561,880 (8)
abstracting: (1<=p6)
states: 112,756,512 (8)
abstracting: (1<=p4)
states: 110,561,880 (8)
..................................
EG iterations: 34
abstracting: (1<=p3)
states: 105,722,760 (8)
.abstracting: (1<=p8)
states: 105,722,760 (8)
abstracting: (1<=p6)
states: 112,756,512 (8)
abstracting: (1<=p4)
states: 110,561,880 (8)
abstracting: (1<=p4)
states: 110,561,880 (8)
abstracting: (1<=p3)
states: 105,722,760 (8)
abstracting: (1<=p6)
states: 112,756,512 (8)
..................................
EG iterations: 34
abstracting: (1<=p0)
states: 113,321,065 (8)
abstracting: (1<=p8)
states: 105,722,760 (8)
abstracting: (1<=p5)
states: 110,561,880 (8)
abstracting: (1<=p2)
states: 108,342,520 (8)
abstracting: (1<=p4)
states: 110,561,880 (8)
abstracting: (1<=p0)
states: 113,321,065 (8)
abstracting: (1<=p8)
states: 105,722,760 (8)
abstracting: (1<=p5)
states: 110,561,880 (8)
abstracting: (1<=p2)
states: 108,342,520 (8)
abstracting: (1<=p0)
states: 113,321,065 (8)
abstracting: (1<=p8)
states: 105,722,760 (8)
abstracting: (1<=p5)
states: 110,561,880 (8)
abstracting: (1<=p2)
states: 108,342,520 (8)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.129sec

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

abstracting: (1<=p8)
states: 105,722,760 (8)
..
EG iterations: 2
abstracting: (p0<=0)
states: 0
abstracting: (p2<=0)
states: 4,978,545 (6)
abstracting: (p1<=0)
states: 2,759,185 (6)
abstracting: (p0<=0)
states: 0
abstracting: (p5<=0)
states: 2,759,185 (6)
abstracting: (p2<=0)
states: 4,978,545 (6)
abstracting: (1<=p0)
states: 113,321,065 (8)
abstracting: (1<=p0)
states: 113,321,065 (8)
abstracting: (1<=p5)
states: 110,561,880 (8)
abstracting: (1<=p2)
states: 108,342,520 (8)
abstracting: (1<=p1)
states: 110,561,880 (8)
abstracting: (1<=p2)
states: 108,342,520 (8)
abstracting: (p3<=0)
states: 7,598,305 (6)
.abstracting: (1<=p3)
states: 105,722,760 (8)
abstracting: (1<=p4)
states: 110,561,880 (8)
abstracting: (p0<=0)
states: 0
abstracting: (p5<=0)
states: 2,759,185 (6)
abstracting: (p2<=0)
states: 4,978,545 (6)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.085sec

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

abstracting: (p0<=0)
states: 0
abstracting: (p2<=0)
states: 4,978,545 (6)
abstracting: (p1<=0)
states: 2,759,185 (6)
abstracting: (p2<=0)
states: 4,978,545 (6)
abstracting: (p0<=0)
states: 0
abstracting: (1<=p8)
states: 105,722,760 (8)
abstracting: (p5<=0)
states: 2,759,185 (6)
.abstracting: (p7<=0)
states: 3,299,241 (6)
abstracting: (1<=p7)
states: 110,021,824 (8)
abstracting: (1<=p4)
states: 110,561,880 (8)
abstracting: (1<=p6)
states: 112,756,512 (8)
abstracting: (1<=p5)
states: 110,561,880 (8)
abstracting: (1<=p0)
states: 113,321,065 (8)
abstracting: (1<=p2)
states: 108,342,520 (8)
abstracting: (1<=p1)
states: 110,561,880 (8)
abstracting: (1<=p6)
states: 112,756,512 (8)
abstracting: (1<=p4)
states: 110,561,880 (8)
abstracting: (1<=p0)
states: 113,321,065 (8)
abstracting: (1<=p5)
states: 110,561,880 (8)
abstracting: (1<=p2)
states: 108,342,520 (8)
abstracting: (1<=p0)
states: 113,321,065 (8)
abstracting: (1<=p2)
states: 108,342,520 (8)
abstracting: (1<=p1)
states: 110,561,880 (8)
abstracting: (p7<=0)
states: 3,299,241 (6)
abstracting: (p3<=0)
states: 7,598,305 (6)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.071sec

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

abstracting: (1<=p7)
states: 110,021,824 (8)
..abstracting: (1<=p6)
states: 112,756,512 (8)
abstracting: (1<=p4)
states: 110,561,880 (8)
abstracting: (1<=p7)
states: 110,021,824 (8)
abstracting: (1<=p6)
states: 112,756,512 (8)
abstracting: (1<=p4)
states: 110,561,880 (8)
abstracting: (1<=p6)
states: 112,756,512 (8)
abstracting: (1<=p4)
states: 110,561,880 (8)
..................................
EG iterations: 34
.abstracting: (1<=p3)
states: 105,722,760 (8)
abstracting: (1<=p6)
states: 112,756,512 (8)
abstracting: (1<=p5)
states: 110,561,880 (8)
abstracting: (1<=p7)
states: 110,021,824 (8)
abstracting: (p2<=0)
states: 4,978,545 (6)
abstracting: (p1<=0)
states: 2,759,185 (6)
abstracting: (p0<=0)
states: 0

EG iterations: 0
abstracting: (1<=p8)
states: 105,722,760 (8)
abstracting: (p2<=0)
states: 4,978,545 (6)
abstracting: (p1<=0)
states: 2,759,185 (6)
abstracting: (p0<=0)
states: 0
abstracting: (1<=p5)
states: 110,561,880 (8)
abstracting: (1<=p2)
states: 108,342,520 (8)
abstracting: (1<=p0)
states: 113,321,065 (8)
abstracting: (1<=p7)
states: 110,021,824 (8)
abstracting: (p2<=0)
states: 4,978,545 (6)
abstracting: (p1<=0)
states: 2,759,185 (6)
abstracting: (p0<=0)
states: 0
abstracting: (1<=p7)
states: 110,021,824 (8)
abstracting: (1<=p7)
states: 110,021,824 (8)
.
EG iterations: 1
abstracting: (1<=p5)
states: 110,561,880 (8)
abstracting: (1<=p2)
states: 108,342,520 (8)
abstracting: (1<=p0)
states: 113,321,065 (8)
abstracting: (1<=p8)
states: 105,722,760 (8)
.abstracting: (p5<=0)
states: 2,759,185 (6)
abstracting: (p2<=0)
states: 4,978,545 (6)
abstracting: (p0<=0)
states: 0
.
EG iterations: 1
abstracting: (1<=p7)
states: 110,021,824 (8)
abstracting: (1<=p7)
states: 110,021,824 (8)
.abstracting: (1<=p8)
states: 105,722,760 (8)
.
EG iterations: 1
abstracting: (1<=p4)
states: 110,561,880 (8)
..................................
EG iterations: 34
abstracting: (1<=p8)
states: 105,722,760 (8)
.abstracting: (1<=p8)
states: 105,722,760 (8)
abstracting: (1<=p7)
states: 110,021,824 (8)
..abstracting: (1<=p6)
states: 112,756,512 (8)
abstracting: (1<=p4)
states: 110,561,880 (8)
abstracting: (1<=p7)
states: 110,021,824 (8)
abstracting: (1<=p6)
states: 112,756,512 (8)
abstracting: (1<=p4)
states: 110,561,880 (8)
abstracting: (1<=p6)
states: 112,756,512 (8)
abstracting: (1<=p4)
states: 110,561,880 (8)
..................................
EG iterations: 34
.abstracting: (1<=p3)
states: 105,722,760 (8)
abstracting: (1<=p6)
states: 112,756,512 (8)
abstracting: (1<=p5)
states: 110,561,880 (8)
abstracting: (1<=p7)
states: 110,021,824 (8)
abstracting: (p2<=0)
states: 4,978,545 (6)
abstracting: (p1<=0)
states: 2,759,185 (6)
abstracting: (p0<=0)
states: 0

EG iterations: 0
abstracting: (1<=p8)
states: 105,722,760 (8)
abstracting: (p2<=0)
states: 4,978,545 (6)
abstracting: (p1<=0)
states: 2,759,185 (6)
abstracting: (p0<=0)
states: 0
abstracting: (1<=p5)
states: 110,561,880 (8)
abstracting: (1<=p2)
states: 108,342,520 (8)
abstracting: (1<=p0)
states: 113,321,065 (8)
abstracting: (1<=p7)
states: 110,021,824 (8)
..abstracting: (1<=p6)
states: 112,756,512 (8)
abstracting: (1<=p4)
states: 110,561,880 (8)
abstracting: (1<=p7)
states: 110,021,824 (8)
abstracting: (1<=p6)
states: 112,756,512 (8)
abstracting: (1<=p4)
states: 110,561,880 (8)
abstracting: (1<=p6)
states: 112,756,512 (8)
abstracting: (1<=p4)
states: 110,561,880 (8)
..................................
EG iterations: 34
.abstracting: (1<=p3)
states: 105,722,760 (8)
abstracting: (1<=p6)
states: 112,756,512 (8)
abstracting: (1<=p5)
states: 110,561,880 (8)
abstracting: (1<=p7)
states: 110,021,824 (8)
abstracting: (p2<=0)
states: 4,978,545 (6)
abstracting: (p1<=0)
states: 2,759,185 (6)
abstracting: (p0<=0)
states: 0

EG iterations: 0
abstracting: (1<=p8)
states: 105,722,760 (8)
abstracting: (p2<=0)
states: 4,978,545 (6)
abstracting: (p1<=0)
states: 2,759,185 (6)
abstracting: (p0<=0)
states: 0
abstracting: (1<=p5)
states: 110,561,880 (8)
abstracting: (1<=p2)
states: 108,342,520 (8)
abstracting: (1<=p0)
states: 113,321,065 (8)
................................
EG iterations: 32
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.288sec

totally nodes used: 232444 (2.3e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 27751150 998225 28749375
used/not used/entry size/cache size: 905552 66203312 16 1024MB
basic ops cache: hits/miss/sum: 7558748 239948 7798696
used/not used/entry size/cache size: 457250 16319966 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: 169643 5265 174908
used/not used/entry size/cache size: 5265 8383343 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 66927963
1 167002
2 7484
3 2674
4 2330
5 222
6 178
7 45
8 89
9 40
>= 10 837

Total processing time: 0m 9.103sec


BK_STOP 1679231543445

--------------------
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:2088 (261), effective:544 (68)

initing FirstDep: 0m 0.000sec


iterations count:264 (33), effective:64 (8)

iterations count:72 (9), effective:32 (4)

iterations count:72 (9), effective:32 (4)

iterations count:936 (117), effective:320 (40)

iterations count:72 (9), effective:32 (4)

iterations count:104 (13), effective:32 (4)

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

iterations count:392 (49), effective:96 (12)

iterations count:264 (33), effective:64 (8)

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

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

iterations count:742 (92), effective:351 (43)

iterations count:488 (61), effective:96 (12)

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

iterations count:392 (49), effective:96 (12)

iterations count:936 (117), effective:320 (40)

iterations count:264 (33), effective:64 (8)

iterations count:19 (2), effective:4 (0)

iterations count:30 (3), effective:8 (1)

iterations count:20 (2), effective:4 (0)

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

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

iterations count:19 (2), effective:4 (0)

iterations count:104 (13), effective:32 (4)

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

iterations count:264 (33), effective:64 (8)

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

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

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

iterations count:744 (93), effective:352 (44)

iterations count:104 (13), effective:32 (4)

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

iterations count:264 (33), effective:64 (8)

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

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

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

iterations count:744 (93), effective:352 (44)

iterations count:22 (2), effective:4 (0)

iterations count:264 (33), effective:64 (8)

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

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

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

iterations count:744 (93), effective:352 (44)

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-MT0128DC0032"
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-MT0128DC0032, 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-167912649700042"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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