About the Execution of Marcie+red for SmallOperatingSystem-PT-MT0256DC0128
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9555.079 | 155302.00 | 160271.00 | 2252.10 | FFTTFTTTFFFFFTTT | 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.r458-smll-167912649800066.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-MT0256DC0128, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912649800066
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 9.1K Feb 25 12:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 12:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 12:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 12:46 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.2K Feb 25 17:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 19K Feb 25 17:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 25 12:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Feb 25 12:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K 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-MT0256DC0128-CTLFireability-00
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-01
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-02
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-03
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-04
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-05
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-06
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-07
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-08
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-09
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-10
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-11
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-12
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-13
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-14
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679232061964
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-MT0256DC0128
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 13:21:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 13:21:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 13:21:04] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2023-03-19 13:21:04] [INFO ] Transformed 9 places.
[2023-03-19 13:21:04] [INFO ] Transformed 8 transitions.
[2023-03-19 13:21:04] [INFO ] Parsed PT model containing 9 places and 8 transitions and 27 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
FORMULA SmallOperatingSystem-PT-MT0256DC0128-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 15 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:21:04] [INFO ] Computed 4 place invariants in 7 ms
[2023-03-19 13:21:05] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-19 13:21:05] [INFO ] Invariant cache hit.
[2023-03-19 13:21:05] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2023-03-19 13:21:05] [INFO ] Invariant cache hit.
[2023-03-19 13:21:05] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 315 ms. Remains : 9/9 places, 8/8 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-19 13:21:05] [INFO ] Flatten gal took : 26 ms
[2023-03-19 13:21:05] [INFO ] Flatten gal took : 8 ms
[2023-03-19 13:21:05] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 10058 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=279 ) properties (out of 23) seen :22
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 13:21:05] [INFO ] Invariant cache hit.
[2023-03-19 13:21:05] [INFO ] After 24ms 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 0 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2023-03-19 13:21:05] [INFO ] Flatten gal took : 4 ms
[2023-03-19 13:21:05] [INFO ] Flatten gal took : 4 ms
[2023-03-19 13:21:05] [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.
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 3 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:21:05] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:21:05] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:21:05] [INFO ] Input system was already deterministic with 7 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 1 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 1 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:21:05] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:21:05] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:21:05] [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:21:05] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:21:05] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:21:05] [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:21:05] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:21:05] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:21:05] [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 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
Applied a total of 2 rules in 7 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:21:05] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:21:05] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:21:05] [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 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 4 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:21:05] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:21:05] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:21:05] [INFO ] Input system was already deterministic with 6 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:21:05] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:21:05] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:21:05] [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:21:05] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:21:05] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:21:05] [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:21:05] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:21:05] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:21:05] [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 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:21:05] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:21:05] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:21:05] [INFO ] Input system was already deterministic with 7 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:21:05] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:21:05] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:21:05] [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 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:21:05] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:21:05] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:21:05] [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 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 5 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 5 ms. Remains : 4/9 places, 5/8 transitions.
[2023-03-19 13:21:05] [INFO ] Flatten gal took : 0 ms
[2023-03-19 13:21:05] [INFO ] Flatten gal took : 0 ms
[2023-03-19 13:21:05] [INFO ] Input system was already deterministic with 5 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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:21:05] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:21:05] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:21:05] [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 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 0 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 2 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 2 ms. Remains : 4/9 places, 5/8 transitions.
[2023-03-19 13:21:05] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:21:05] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:21:05] [INFO ] Input system was already deterministic with 5 transitions.
[2023-03-19 13:21:05] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:21:05] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:21:05] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-19 13:21:05] [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 1372 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.823sec
RS generation: 0m 8.257sec
-> reachability set: #nodes 18057 (1.8e+04) #states 7,890,709,281 (9)
starting MCC model checker
--------------------------
checking: EF [AG [EX [AG [p4<=0]]]]
normalized: E [true U ~ [E [true U ~ [EX [~ [E [true U ~ [p4<=0]]]]]]]]
abstracting: (p4<=0)
states: 128,175,905 (8)
.-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.244sec
checking: EF [EX [AG [1<=p7]]]
normalized: E [true U EX [~ [E [true U ~ [1<=p7]]]]]
abstracting: (1<=p7)
states: 7,762,533,376 (9)
.-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.022sec
checking: AG [EF [p3<=0]]
normalized: ~ [E [true U ~ [E [true U p3<=0]]]]
abstracting: (p3<=0)
states: 174,326,945 (8)
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.800sec
checking: EG [p7<=0]
normalized: EG [p7<=0]
abstracting: (p7<=0)
states: 128,175,905 (8)
.
EG iterations: 1
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.319sec
checking: AG [EF [AX [[1<=p0 & [1<=p1 & 1<=p2]]]]]
normalized: ~ [E [true U ~ [E [true U ~ [EX [~ [[1<=p0 & [1<=p1 & 1<=p2]]]]]]]]]
abstracting: (1<=p2)
states: 7,843,476,576 (9)
abstracting: (1<=p1)
states: 7,762,533,376 (9)
abstracting: (1<=p0)
states: 7,890,709,281 (9)
.-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.785sec
checking: AG [[EF [EX [[p0<=0 | [p1<=0 | p2<=0]]]] | EG [AG [[p4<=0 | p6<=0]]]]]
normalized: ~ [E [true U ~ [[EG [~ [E [true U ~ [[p4<=0 | p6<=0]]]]] | E [true U EX [[p0<=0 | [p1<=0 | p2<=0]]]]]]]]
abstracting: (p2<=0)
states: 47,232,705 (7)
abstracting: (p1<=0)
states: 128,175,905 (8)
abstracting: (p0<=0)
states: 0
.abstracting: (p6<=0)
states: 1
abstracting: (p4<=0)
states: 128,175,905 (8)
.
EG iterations: 1
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.405sec
checking: EF [AG [[EF [[1<=p3 & [1<=p5 & 1<=p6]]] & [1<=p5 & 1<=p6]]]]
normalized: E [true U ~ [E [true U ~ [[[1<=p5 & 1<=p6] & E [true U [1<=p3 & [1<=p5 & 1<=p6]]]]]]]]
abstracting: (1<=p6)
states: 7,890,709,280 (9)
abstracting: (1<=p5)
states: 7,762,533,376 (9)
abstracting: (1<=p3)
states: 7,716,382,336 (9)
abstracting: (1<=p6)
states: 7,890,709,280 (9)
abstracting: (1<=p5)
states: 7,762,533,376 (9)
-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.434sec
checking: EX [AG [[EX [[[p5<=0 | p6<=0] | [1<=p4 | [1<=p4 & 1<=p6]]]] | [1<=p0 & [1<=p1 & 1<=p2]]]]]
normalized: EX [~ [E [true U ~ [[[1<=p0 & [1<=p1 & 1<=p2]] | EX [[[1<=p4 | [1<=p4 & 1<=p6]] | [p5<=0 | p6<=0]]]]]]]]
abstracting: (p6<=0)
states: 1
abstracting: (p5<=0)
states: 128,175,905 (8)
abstracting: (1<=p6)
states: 7,890,709,280 (9)
abstracting: (1<=p4)
states: 7,762,533,376 (9)
abstracting: (1<=p4)
states: 7,762,533,376 (9)
.abstracting: (1<=p2)
states: 7,843,476,576 (9)
abstracting: (1<=p1)
states: 7,762,533,376 (9)
abstracting: (1<=p0)
states: 7,890,709,281 (9)
.-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.945sec
checking: [AF [[[E [~ [[p4<=0 | p6<=0]] U [1<=p0 & [1<=p2 & 1<=p5]]] & 1<=p8] | p3<=0]] & [AF [[1<=p4 & 1<=p6]] | EG [p8<=0]]]
normalized: [[~ [EG [~ [[1<=p4 & 1<=p6]]]] | EG [p8<=0]] & ~ [EG [~ [[p3<=0 | [1<=p8 & E [~ [[p4<=0 | p6<=0]] U [1<=p0 & [1<=p2 & 1<=p5]]]]]]]]]
abstracting: (1<=p5)
states: 7,762,533,376 (9)
abstracting: (1<=p2)
states: 7,843,476,576 (9)
abstracting: (1<=p0)
states: 7,890,709,281 (9)
abstracting: (p6<=0)
states: 1
abstracting: (p4<=0)
states: 128,175,905 (8)
abstracting: (1<=p8)
states: 7,716,382,336 (9)
abstracting: (p3<=0)
states: 174,326,945 (8)
...............................................................................................................................
EG iterations: 127
abstracting: (p8<=0)
states: 174,326,945 (8)
..
EG iterations: 2
abstracting: (1<=p6)
states: 7,890,709,280 (9)
abstracting: (1<=p4)
states: 7,762,533,376 (9)
..................................................................................................................................
EG iterations: 130
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 8.442sec
checking: EF [AG [[[A [[1<=p5 & 1<=p6] U [1<=p0 & [1<=p1 & 1<=p2]]] & A [[p7<=0 | EG [1<=p7]] U A [1<=p7 U 1<=p7]]] & [1<=p4 & 1<=p6]]]]
normalized: E [true U ~ [E [true U ~ [[[1<=p4 & 1<=p6] & [[~ [EG [~ [[~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [1<=p7] & ~ [1<=p7]]]]]]]] & ~ [E [~ [[~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [1<=p7] & ~ [1<=p7]]]]]] U [~ [[p7<=0 | EG [1<=p7]]] & ~ [[~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [1<=p7] & ~ [1<=p7]]]]]]]]]] & [~ [EG [~ [[1<=p0 & [1<=p1 & 1<=p2]]]]] & ~ [E [~ [[1<=p0 & [1<=p1 & 1<=p2]]] U [~ [[1<=p5 & 1<=p6]] & ~ [[1<=p0 & [1<=p1 & 1<=p2]]]]]]]]]]]]]
abstracting: (1<=p2)
states: 7,843,476,576 (9)
abstracting: (1<=p1)
states: 7,762,533,376 (9)
abstracting: (1<=p0)
states: 7,890,709,281 (9)
abstracting: (1<=p6)
states: 7,890,709,280 (9)
abstracting: (1<=p5)
states: 7,762,533,376 (9)
abstracting: (1<=p2)
states: 7,843,476,576 (9)
abstracting: (1<=p1)
states: 7,762,533,376 (9)
abstracting: (1<=p0)
states: 7,890,709,281 (9)
abstracting: (1<=p2)
states: 7,843,476,576 (9)
abstracting: (1<=p1)
states: 7,762,533,376 (9)
abstracting: (1<=p0)
states: 7,890,709,281 (9)
..
EG iterations: 2
abstracting: (1<=p7)
states: 7,762,533,376 (9)
abstracting: (1<=p7)
states: 7,762,533,376 (9)
abstracting: (1<=p7)
states: 7,762,533,376 (9)
abstracting: (1<=p7)
states: 7,762,533,376 (9)
.
EG iterations: 1
abstracting: (1<=p7)
states: 7,762,533,376 (9)
.
EG iterations: 1
abstracting: (p7<=0)
states: 128,175,905 (8)
abstracting: (1<=p7)
states: 7,762,533,376 (9)
abstracting: (1<=p7)
states: 7,762,533,376 (9)
abstracting: (1<=p7)
states: 7,762,533,376 (9)
abstracting: (1<=p7)
states: 7,762,533,376 (9)
.
EG iterations: 1
abstracting: (1<=p7)
states: 7,762,533,376 (9)
abstracting: (1<=p7)
states: 7,762,533,376 (9)
abstracting: (1<=p7)
states: 7,762,533,376 (9)
abstracting: (1<=p7)
states: 7,762,533,376 (9)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p6)
states: 7,890,709,280 (9)
abstracting: (1<=p4)
states: 7,762,533,376 (9)
-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 7.979sec
checking: [EX [AX [AX [AG [[1<=p0 & [1<=p1 & 1<=p2]]]]]] & AF [[1<=p3 | ~ [A [E [[1<=p0 & [1<=p2 & 1<=p5]] U ~ [[p4<=0 | p6<=0]]] U [A [1<=p7 U 1<=p7] | [[1<=p4 & 1<=p6] | 1<=p7]]]]]]]
normalized: [~ [EG [~ [[1<=p3 | ~ [[~ [EG [~ [[[1<=p7 | [1<=p4 & 1<=p6]] | [~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [1<=p7] & ~ [1<=p7]]]]]]]]] & ~ [E [~ [[[1<=p7 | [1<=p4 & 1<=p6]] | [~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [1<=p7] & ~ [1<=p7]]]]]]] U [~ [E [[1<=p0 & [1<=p2 & 1<=p5]] U ~ [[p4<=0 | p6<=0]]]] & ~ [[[1<=p7 | [1<=p4 & 1<=p6]] | [~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [1<=p7] & ~ [1<=p7]]]]]]]]]]]]]]]] & EX [~ [EX [EX [E [true U ~ [[1<=p0 & [1<=p1 & 1<=p2]]]]]]]]]
abstracting: (1<=p2)
states: 7,843,476,576 (9)
abstracting: (1<=p1)
states: 7,762,533,376 (9)
abstracting: (1<=p0)
states: 7,890,709,281 (9)
...abstracting: (1<=p7)
states: 7,762,533,376 (9)
abstracting: (1<=p7)
states: 7,762,533,376 (9)
abstracting: (1<=p7)
states: 7,762,533,376 (9)
abstracting: (1<=p7)
states: 7,762,533,376 (9)
.
EG iterations: 1
abstracting: (1<=p6)
states: 7,890,709,280 (9)
abstracting: (1<=p4)
states: 7,762,533,376 (9)
abstracting: (1<=p7)
states: 7,762,533,376 (9)
abstracting: (p6<=0)
states: 1
abstracting: (p4<=0)
states: 128,175,905 (8)
abstracting: (1<=p5)
states: 7,762,533,376 (9)
abstracting: (1<=p2)
states: 7,843,476,576 (9)
abstracting: (1<=p0)
states: 7,890,709,281 (9)
abstracting: (1<=p7)
states: 7,762,533,376 (9)
abstracting: (1<=p7)
states: 7,762,533,376 (9)
abstracting: (1<=p7)
states: 7,762,533,376 (9)
abstracting: (1<=p7)
states: 7,762,533,376 (9)
.
EG iterations: 1
abstracting: (1<=p6)
states: 7,890,709,280 (9)
abstracting: (1<=p4)
states: 7,762,533,376 (9)
abstracting: (1<=p7)
states: 7,762,533,376 (9)
abstracting: (1<=p7)
states: 7,762,533,376 (9)
abstracting: (1<=p7)
states: 7,762,533,376 (9)
abstracting: (1<=p7)
states: 7,762,533,376 (9)
abstracting: (1<=p7)
states: 7,762,533,376 (9)
.
EG iterations: 1
abstracting: (1<=p6)
states: 7,890,709,280 (9)
abstracting: (1<=p4)
states: 7,762,533,376 (9)
abstracting: (1<=p7)
states: 7,762,533,376 (9)
..................................................................................................................................
EG iterations: 130
abstracting: (1<=p3)
states: 7,716,382,336 (9)
.
EG iterations: 1
-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.796sec
checking: AG [[EF [EX [AG [1<=p3]]] & [[[~ [A [A [[1<=p5 & 1<=p6] U 1<=p4] U [1<=p3 & [1<=p5 & 1<=p6]]]] | AX [[p0<=0 | [p2<=0 | p5<=0]]]] | [p0<=0 | p2<=0]] | [[p5<=0 | 1<=p3] | [[p8<=0 & [p0<=0 | [p1<=0 | p2<=0]]] | [[[p5<=0 | p6<=0] & [p4<=0 | p6<=0]] | [[p4<=0 | p6<=0] & [p0<=0 | [p1<=0 | p2<=0]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[p0<=0 | [p1<=0 | p2<=0]] & [p4<=0 | p6<=0]] | [[p4<=0 | p6<=0] & [p5<=0 | p6<=0]]] | [p8<=0 & [p0<=0 | [p1<=0 | p2<=0]]]] | [p5<=0 | 1<=p3]] | [[p0<=0 | p2<=0] | [~ [EX [~ [[p0<=0 | [p2<=0 | p5<=0]]]]] | ~ [[~ [EG [~ [[1<=p3 & [1<=p5 & 1<=p6]]]]] & ~ [E [~ [[1<=p3 & [1<=p5 & 1<=p6]]] U [~ [[~ [EG [~ [1<=p4]]] & ~ [E [~ [1<=p4] U [~ [[1<=p5 & 1<=p6]] & ~ [1<=p4]]]]]] & ~ [[1<=p3 & [1<=p5 & 1<=p6]]]]]]]]]]] & E [true U EX [~ [E [true U ~ [1<=p3]]]]]]]]]
abstracting: (1<=p3)
states: 7,716,382,336 (9)
.abstracting: (1<=p6)
states: 7,890,709,280 (9)
abstracting: (1<=p5)
states: 7,762,533,376 (9)
abstracting: (1<=p3)
states: 7,716,382,336 (9)
abstracting: (1<=p4)
states: 7,762,533,376 (9)
abstracting: (1<=p6)
states: 7,890,709,280 (9)
abstracting: (1<=p5)
states: 7,762,533,376 (9)
abstracting: (1<=p4)
states: 7,762,533,376 (9)
abstracting: (1<=p4)
states: 7,762,533,376 (9)
..................................................................................................................................
EG iterations: 130
abstracting: (1<=p6)
states: 7,890,709,280 (9)
abstracting: (1<=p5)
states: 7,762,533,376 (9)
abstracting: (1<=p3)
states: 7,716,382,336 (9)
abstracting: (1<=p6)
states: 7,890,709,280 (9)
abstracting: (1<=p5)
states: 7,762,533,376 (9)
abstracting: (1<=p3)
states: 7,716,382,336 (9)
.
EG iterations: 1
abstracting: (p5<=0)
states: 128,175,905 (8)
abstracting: (p2<=0)
states: 47,232,705 (7)
abstracting: (p0<=0)
states: 0
.abstracting: (p2<=0)
states: 47,232,705 (7)
abstracting: (p0<=0)
states: 0
abstracting: (1<=p3)
states: 7,716,382,336 (9)
abstracting: (p5<=0)
states: 128,175,905 (8)
abstracting: (p2<=0)
states: 47,232,705 (7)
abstracting: (p1<=0)
states: 128,175,905 (8)
abstracting: (p0<=0)
states: 0
abstracting: (p8<=0)
states: 174,326,945 (8)
abstracting: (p6<=0)
states: 1
abstracting: (p5<=0)
states: 128,175,905 (8)
abstracting: (p6<=0)
states: 1
abstracting: (p4<=0)
states: 128,175,905 (8)
abstracting: (p6<=0)
states: 1
abstracting: (p4<=0)
states: 128,175,905 (8)
abstracting: (p2<=0)
states: 47,232,705 (7)
abstracting: (p1<=0)
states: 128,175,905 (8)
abstracting: (p0<=0)
states: 0
-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m13.464sec
checking: EX [[E [A [AX [[1<=p0 & [1<=p2 & 1<=p5]]] U AF [[1<=p0 & [1<=p1 & 1<=p2]]]] U [[1<=p5 & 1<=p6] | EF [~ [[p4<=0 | p6<=0]]]]] & [[[~ [A [1<=p7 U [1<=p0 & [1<=p1 & 1<=p2]]]] | AX [p4<=0]] | [AF [1<=p3] | p4<=0]] | [[p5<=0 | p6<=0] | [[[EF [[p0<=0 | [p1<=0 | p2<=0]]] & EX [[p4<=0 | p6<=0]]] & [1<=p5 & [1<=p6 & p8<=0]]] | [p3<=0 & [p0<=0 | [p2<=0 | p5<=0]]]]]]]]
normalized: EX [[[[[[p3<=0 & [p0<=0 | [p2<=0 | p5<=0]]] | [[1<=p5 & [1<=p6 & p8<=0]] & [EX [[p4<=0 | p6<=0]] & E [true U [p0<=0 | [p1<=0 | p2<=0]]]]]] | [p5<=0 | p6<=0]] | [[p4<=0 | ~ [EG [~ [1<=p3]]]] | [~ [EX [~ [p4<=0]]] | ~ [[~ [EG [~ [[1<=p0 & [1<=p1 & 1<=p2]]]]] & ~ [E [~ [[1<=p0 & [1<=p1 & 1<=p2]]] U [~ [1<=p7] & ~ [[1<=p0 & [1<=p1 & 1<=p2]]]]]]]]]]] & E [[~ [EG [EG [~ [[1<=p0 & [1<=p1 & 1<=p2]]]]]] & ~ [E [EG [~ [[1<=p0 & [1<=p1 & 1<=p2]]]] U [EX [~ [[1<=p0 & [1<=p2 & 1<=p5]]]] & EG [~ [[1<=p0 & [1<=p1 & 1<=p2]]]]]]]] U [E [true U ~ [[p4<=0 | p6<=0]]] | [1<=p5 & 1<=p6]]]]]
abstracting: (1<=p6)
states: 7,890,709,280 (9)
abstracting: (1<=p5)
states: 7,762,533,376 (9)
abstracting: (p6<=0)
states: 1
abstracting: (p4<=0)
states: 128,175,905 (8)
abstracting: (1<=p2)
states: 7,843,476,576 (9)
abstracting: (1<=p1)
states: 7,762,533,376 (9)
abstracting: (1<=p0)
states: 7,890,709,281 (9)
..
EG iterations: 2
abstracting: (1<=p5)
states: 7,762,533,376 (9)
abstracting: (1<=p2)
states: 7,843,476,576 (9)
abstracting: (1<=p0)
states: 7,890,709,281 (9)
.abstracting: (1<=p2)
states: 7,843,476,576 (9)
abstracting: (1<=p1)
states: 7,762,533,376 (9)
abstracting: (1<=p0)
states: 7,890,709,281 (9)
..
EG iterations: 2
abstracting: (1<=p2)
states: 7,843,476,576 (9)
abstracting: (1<=p1)
states: 7,762,533,376 (9)
abstracting: (1<=p0)
states: 7,890,709,281 (9)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (1<=p2)
states: 7,843,476,576 (9)
abstracting: (1<=p1)
states: 7,762,533,376 (9)
abstracting: (1<=p0)
states: 7,890,709,281 (9)
abstracting: (1<=p7)
states: 7,762,533,376 (9)
abstracting: (1<=p2)
states: 7,843,476,576 (9)
abstracting: (1<=p1)
states: 7,762,533,376 (9)
abstracting: (1<=p0)
states: 7,890,709,281 (9)
abstracting: (1<=p2)
states: 7,843,476,576 (9)
abstracting: (1<=p1)
states: 7,762,533,376 (9)
abstracting: (1<=p0)
states: 7,890,709,281 (9)
..
EG iterations: 2
abstracting: (p4<=0)
states: 128,175,905 (8)
.abstracting: (1<=p3)
states: 7,716,382,336 (9)
.
EG iterations: 1
abstracting: (p4<=0)
states: 128,175,905 (8)
abstracting: (p6<=0)
states: 1
abstracting: (p5<=0)
states: 128,175,905 (8)
abstracting: (p2<=0)
states: 47,232,705 (7)
abstracting: (p1<=0)
states: 128,175,905 (8)
abstracting: (p0<=0)
states: 0
abstracting: (p6<=0)
states: 1
abstracting: (p4<=0)
states: 128,175,905 (8)
.abstracting: (p8<=0)
states: 174,326,945 (8)
abstracting: (1<=p6)
states: 7,890,709,280 (9)
abstracting: (1<=p5)
states: 7,762,533,376 (9)
abstracting: (p5<=0)
states: 128,175,905 (8)
abstracting: (p2<=0)
states: 47,232,705 (7)
abstracting: (p0<=0)
states: 0
abstracting: (p3<=0)
states: 174,326,945 (8)
.-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m33.411sec
checking: A [[A [[[p8<=0 | [EF [[1<=p0 & [1<=p2 & 1<=p5]]] | AF [~ [[p4<=0 | p6<=0]]]]] & [AF [[1<=p0 & [1<=p1 & 1<=p2]]] | [[1<=p0 & [1<=p1 & 1<=p2]] | EG [1<=p8]]]] U ~ [[1<=p0 & [1<=p2 & 1<=p5]]]] | [[~ [[EG [1<=p7] & [1<=p4 | [[1<=p5 & 1<=p6] | 1<=p4]]]] & AX [p7<=0]] | [AF [[[1<=p3 & [1<=p4 & 1<=p6]] | E [[1<=p5 & 1<=p6] U [1<=p5 & 1<=p6]]]] & [EX [1<=p7] & [1<=p7 | 1<=p3]]]]] U [[1<=p0 & 1<=p1] & [1<=p2 & [EG [[1<=p4 & [1<=p3 | ~ [[1<=p0 & [1<=p2 & 1<=p5]]]]]] | [~ [[AF [~ [[p4<=0 | p6<=0]]] & p3<=0]] | [1<=p5 & 1<=p6]]]]]]
normalized: [~ [EG [~ [[[1<=p2 & [[[1<=p5 & 1<=p6] | ~ [[p3<=0 & ~ [EG [[p4<=0 | p6<=0]]]]]] | EG [[1<=p4 & [1<=p3 | ~ [[1<=p0 & [1<=p2 & 1<=p5]]]]]]]] & [1<=p0 & 1<=p1]]]]] & ~ [E [~ [[[1<=p2 & [[[1<=p5 & 1<=p6] | ~ [[p3<=0 & ~ [EG [[p4<=0 | p6<=0]]]]]] | EG [[1<=p4 & [1<=p3 | ~ [[1<=p0 & [1<=p2 & 1<=p5]]]]]]]] & [1<=p0 & 1<=p1]]] U [~ [[[[[[1<=p7 | 1<=p3] & EX [1<=p7]] & ~ [EG [~ [[E [[1<=p5 & 1<=p6] U [1<=p5 & 1<=p6]] | [1<=p3 & [1<=p4 & 1<=p6]]]]]]] | [~ [EX [~ [p7<=0]]] & ~ [[[1<=p4 | [1<=p4 | [1<=p5 & 1<=p6]]] & EG [1<=p7]]]]] | [~ [EG [[1<=p0 & [1<=p2 & 1<=p5]]]] & ~ [E [[1<=p0 & [1<=p2 & 1<=p5]] U [~ [[[[EG [1<=p8] | [1<=p0 & [1<=p1 & 1<=p2]]] | ~ [EG [~ [[1<=p0 & [1<=p1 & 1<=p2]]]]]] & [p8<=0 | [~ [EG [[p4<=0 | p6<=0]]] | E [true U [1<=p0 & [1<=p2 & 1<=p5]]]]]]] & [1<=p0 & [1<=p2 & 1<=p5]]]]]]]] & ~ [[[1<=p2 & [[[1<=p5 & 1<=p6] | ~ [[p3<=0 & ~ [EG [[p4<=0 | p6<=0]]]]]] | EG [[1<=p4 & [1<=p3 | ~ [[1<=p0 & [1<=p2 & 1<=p5]]]]]]]] & [1<=p0 & 1<=p1]]]]]]]
abstracting: (1<=p1)
states: 7,762,533,376 (9)
abstracting: (1<=p0)
states: 7,890,709,281 (9)
abstracting: (1<=p5)
states: 7,762,533,376 (9)
abstracting: (1<=p2)
states: 7,843,476,576 (9)
abstracting: (1<=p0)
states: 7,890,709,281 (9)
abstracting: (1<=p3)
states: 7,716,382,336 (9)
abstracting: (1<=p4)
states: 7,762,533,376 (9)
..
EG iterations: 2
abstracting: (p6<=0)
states: 1
abstracting: (p4<=0)
states: 128,175,905 (8)
..................................................................................................................................
EG iterations: 130
abstracting: (p3<=0)
states: 174,326,945 (8)
abstracting: (1<=p6)
states: 7,890,709,280 (9)
abstracting: (1<=p5)
states: 7,762,533,376 (9)
abstracting: (1<=p2)
states: 7,843,476,576 (9)
abstracting: (1<=p5)
states: 7,762,533,376 (9)
abstracting: (1<=p2)
states: 7,843,476,576 (9)
abstracting: (1<=p0)
states: 7,890,709,281 (9)
abstracting: (1<=p5)
states: 7,762,533,376 (9)
abstracting: (1<=p2)
states: 7,843,476,576 (9)
abstracting: (1<=p0)
states: 7,890,709,281 (9)
abstracting: (p6<=0)
states: 1
abstracting: (p4<=0)
states: 128,175,905 (8)
..................................................................................................................................
EG iterations: 130
abstracting: (p8<=0)
states: 174,326,945 (8)
abstracting: (1<=p2)
states: 7,843,476,576 (9)
abstracting: (1<=p1)
states: 7,762,533,376 (9)
abstracting: (1<=p0)
states: 7,890,709,281 (9)
..
EG iterations: 2
abstracting: (1<=p2)
states: 7,843,476,576 (9)
abstracting: (1<=p1)
states: 7,762,533,376 (9)
abstracting: (1<=p0)
states: 7,890,709,281 (9)
abstracting: (1<=p8)
states: 7,716,382,336 (9)
.
EG iterations: 1
abstracting: (1<=p5)
states: 7,762,533,376 (9)
abstracting: (1<=p2)
states: 7,843,476,576 (9)
abstracting: (1<=p0)
states: 7,890,709,281 (9)
abstracting: (1<=p5)
states: 7,762,533,376 (9)
abstracting: (1<=p2)
states: 7,843,476,576 (9)
abstracting: (1<=p0)
states: 7,890,709,281 (9)
.
EG iterations: 1
abstracting: (1<=p7)
states: 7,762,533,376 (9)
.
EG iterations: 1
abstracting: (1<=p6)
states: 7,890,709,280 (9)
abstracting: (1<=p5)
states: 7,762,533,376 (9)
abstracting: (1<=p4)
states: 7,762,533,376 (9)
abstracting: (1<=p4)
states: 7,762,533,376 (9)
abstracting: (p7<=0)
states: 128,175,905 (8)
.abstracting: (1<=p6)
states: 7,890,709,280 (9)
abstracting: (1<=p4)
states: 7,762,533,376 (9)
abstracting: (1<=p3)
states: 7,716,382,336 (9)
abstracting: (1<=p6)
states: 7,890,709,280 (9)
abstracting: (1<=p5)
states: 7,762,533,376 (9)
abstracting: (1<=p6)
states: 7,890,709,280 (9)
abstracting: (1<=p5)
states: 7,762,533,376 (9)
................................................................................................................................
EG iterations: 128
abstracting: (1<=p7)
states: 7,762,533,376 (9)
.abstracting: (1<=p3)
states: 7,716,382,336 (9)
abstracting: (1<=p7)
states: 7,762,533,376 (9)
abstracting: (1<=p1)
states: 7,762,533,376 (9)
abstracting: (1<=p0)
states: 7,890,709,281 (9)
abstracting: (1<=p5)
states: 7,762,533,376 (9)
abstracting: (1<=p2)
states: 7,843,476,576 (9)
abstracting: (1<=p0)
states: 7,890,709,281 (9)
abstracting: (1<=p3)
states: 7,716,382,336 (9)
abstracting: (1<=p4)
states: 7,762,533,376 (9)
..
EG iterations: 2
abstracting: (p6<=0)
states: 1
abstracting: (p4<=0)
states: 128,175,905 (8)
..................................................................................................................................
EG iterations: 130
abstracting: (p3<=0)
states: 174,326,945 (8)
abstracting: (1<=p6)
states: 7,890,709,280 (9)
abstracting: (1<=p5)
states: 7,762,533,376 (9)
abstracting: (1<=p2)
states: 7,843,476,576 (9)
abstracting: (1<=p1)
states: 7,762,533,376 (9)
abstracting: (1<=p0)
states: 7,890,709,281 (9)
abstracting: (1<=p5)
states: 7,762,533,376 (9)
abstracting: (1<=p2)
states: 7,843,476,576 (9)
abstracting: (1<=p0)
states: 7,890,709,281 (9)
abstracting: (1<=p3)
states: 7,716,382,336 (9)
abstracting: (1<=p4)
states: 7,762,533,376 (9)
..
EG iterations: 2
abstracting: (p6<=0)
states: 1
abstracting: (p4<=0)
states: 128,175,905 (8)
..................................................................................................................................
EG iterations: 130
abstracting: (p3<=0)
states: 174,326,945 (8)
abstracting: (1<=p6)
states: 7,890,709,280 (9)
abstracting: (1<=p5)
states: 7,762,533,376 (9)
abstracting: (1<=p2)
states: 7,843,476,576 (9)
..................................................................................................................................
EG iterations: 130
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m51.309sec
totally nodes used: 2844237 (2.8e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 738384946 18102291 756487237
used/not used/entry size/cache size: 8390437 58718427 16 1024MB
basic ops cache: hits/miss/sum: 124438167 2599601 127037768
used/not used/entry size/cache size: 3946263 12830953 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: 823241 28088 851329
used/not used/entry size/cache size: 28023 8360585 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 64687635
1 2280396
2 93966
3 38197
4 3200
5 191
6 131
7 86
8 124
9 80
>= 10 4858
Total processing time: 2m29.417sec
BK_STOP 1679232217266
--------------------
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:4488 (561), effective:1152 (144)
initing FirstDep: 0m 0.000sec
iterations count:23 (2), effective:5 (0)
iterations count:8 (1), effective:0 (0)
iterations count:1032 (129), effective:256 (32)
iterations count:136 (17), effective:128 (16)
iterations count:46 (5), effective:14 (1)
iterations count:392 (49), effective:129 (16)
iterations count:23 (2), effective:5 (0)
iterations count:46 (5), effective:11 (1)
iterations count:1672 (209), effective:512 (64)
iterations count:3085 (385), effective:1025 (128)
iterations count:27 (3), effective:7 (0)
iterations count:2053 (256), effective:639 (79)
iterations count:8 (1), effective:0 (0)
iterations count:8 (1), effective:0 (0)
iterations count:8 (1), effective:0 (0)
iterations count:392 (49), effective:128 (16)
iterations count:392 (49), effective:128 (16)
iterations count:8 (1), effective:0 (0)
iterations count:23 (2), effective:5 (0)
iterations count:8 (1), effective:0 (0)
iterations count:1032 (129), effective:256 (32)
iterations count:8 (1), effective:0 (0)
iterations count:136 (17), effective:128 (16)
iterations count:1032 (129), effective:256 (32)
iterations count:1032 (129), effective:256 (32)
iterations count:8 (1), effective:0 (0)
iterations count:23 (2), effective:5 (0)
iterations count:647 (80), effective:128 (16)
iterations count:8 (1), effective:0 (0)
iterations count:1032 (129), effective:256 (32)
iterations count:392 (49), effective:128 (16)
iterations count:27 (3), effective:7 (0)
iterations count:1411 (176), effective:638 (79)
iterations count:8 (1), effective:0 (0)
iterations count:1168 (146), effective:386 (48)
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-MT0256DC0128"
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-MT0256DC0128, 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-167912649800066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmallOperatingSystem-PT-MT0256DC0128.tgz
mv SmallOperatingSystem-PT-MT0256DC0128 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 '
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 ;