About the Execution of Marcie+red for TwoPhaseLocking-PT-nC00050vN
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5680.436 | 12880.00 | 15553.00 | 281.10 | TTTFTTTTFTTFFFFT | 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.r490-tall-167912709200826.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 TwoPhaseLocking-PT-nC00050vN, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912709200826
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 7.3K Feb 25 17:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 17:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 17:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 17:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 17:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 17:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 17:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115K Feb 25 17:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 4.6K 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 TwoPhaseLocking-PT-nC00050vN-CTLFireability-00
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-01
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-02
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-03
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-04
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-05
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-06
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-07
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-08
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-09
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-10
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-11
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-12
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-13
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-14
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679339321852
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=TwoPhaseLocking-PT-nC00050vN
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 19:08:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 19:08:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 19:08:43] [INFO ] Load time of PNML (sax parser for PT used): 17 ms
[2023-03-20 19:08:43] [INFO ] Transformed 8 places.
[2023-03-20 19:08:43] [INFO ] Transformed 6 transitions.
[2023-03-20 19:08:43] [INFO ] Parsed PT model containing 8 places and 6 transitions and 18 arcs in 70 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 7 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-20 19:08:43] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-20 19:08:43] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-20 19:08:43] [INFO ] Invariant cache hit.
[2023-03-20 19:08:43] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-20 19:08:43] [INFO ] Invariant cache hit.
[2023-03-20 19:08:43] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 226 ms. Remains : 8/8 places, 6/6 transitions.
Support contains 8 out of 8 places after structural reductions.
[2023-03-20 19:08:43] [INFO ] Flatten gal took : 12 ms
[2023-03-20 19:08:43] [INFO ] Flatten gal took : 4 ms
[2023-03-20 19:08:43] [INFO ] Input system was already deterministic with 6 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 27) seen :26
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 19:08:43] [INFO ] Invariant cache hit.
[2023-03-20 19:08:43] [INFO ] After 17ms 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 16 simplifications.
[2023-03-20 19:08:43] [INFO ] Flatten gal took : 2 ms
[2023-03-20 19:08:43] [INFO ] Flatten gal took : 2 ms
[2023-03-20 19:08:43] [INFO ] Input system was already deterministic with 6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 19:08:43] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:08:43] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:08:43] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 19:08:43] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:08:43] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:08:43] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 19:08:43] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:08:43] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:08:43] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 8/8 places, 6/6 transitions.
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 5
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 5
Applied a total of 2 rules in 4 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 7/8 places, 5/6 transitions.
[2023-03-20 19:08:43] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:08:43] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:08:44] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 19:08:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:08:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:08:44] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
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 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 7 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 2 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 6/8 places, 4/6 transitions.
[2023-03-20 19:08:44] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:08:44] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:08:44] [INFO ] Input system was already deterministic with 4 transitions.
Finished random walk after 26 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=26 )
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 19:08:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:08:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:08:44] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
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 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 7 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 2 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 6/8 places, 4/6 transitions.
[2023-03-20 19:08:44] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:08:44] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:08:44] [INFO ] Input system was already deterministic with 4 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 19:08:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:08:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:08:44] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 19:08:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:08:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:08:44] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 19:08:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:08:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:08:44] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 19:08:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:08:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:08:44] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 8/8 places, 6/6 transitions.
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 5
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 5
Applied a total of 2 rules in 0 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 0 ms. Remains : 7/8 places, 5/6 transitions.
[2023-03-20 19:08:44] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:08:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:08:44] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 19:08:44] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:08:44] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:08:44] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 19:08:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:08:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:08:44] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 19:08:44] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:08:44] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:08:44] [INFO ] Input system was already deterministic with 6 transitions.
[2023-03-20 19:08:44] [INFO ] Flatten gal took : 2 ms
[2023-03-20 19:08:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:08:44] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-20 19:08:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 8 places, 6 transitions and 18 arcs took 0 ms.
Total runtime 851 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: 8 NrTr: 6 NrArc: 18)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.824sec
RS generation: 0m 0.160sec
-> reachability set: #nodes 11635 (1.2e+04) #states 403,741 (5)
starting MCC model checker
--------------------------
checking: EG [AF [EX [1<=p2]]]
normalized: EG [~ [EG [~ [EX [1<=p2]]]]]
abstracting: (1<=p2)
states: 356,240 (5)
.........................................................................................................
EG iterations: 104
EG iterations: 0
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.208sec
checking: EG [p2<=0]
normalized: EG [p2<=0]
abstracting: (p2<=0)
states: 47,501 (4)
.........................................................................................................
EG iterations: 105
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.150sec
checking: EF [AG [[p7<=0 | 1<=p2]]]
normalized: E [true U ~ [E [true U ~ [[p7<=0 | 1<=p2]]]]]
abstracting: (1<=p2)
states: 356,240 (5)
abstracting: (p7<=0)
states: 67,951 (4)
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.086sec
checking: [AF [1<=p7] & EX [A [[1<=p3 & 1<=p4] U EF [[1<=p3 & 1<=p5]]]]]
normalized: [EX [[~ [EG [~ [E [true U [1<=p3 & 1<=p5]]]]] & ~ [E [~ [E [true U [1<=p3 & 1<=p5]]] U [~ [[1<=p3 & 1<=p4]] & ~ [E [true U [1<=p3 & 1<=p5]]]]]]]] & ~ [EG [~ [1<=p7]]]]
abstracting: (1<=p7)
states: 335,790 (5)
.................................................................................................................................
EG iterations: 129
abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
.
EG iterations: 1
.-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.671sec
checking: EG [[p3<=0 | [p5<=0 | [AF [[1<=p3 & 1<=p4]] & [1<=p3 & 1<=p5]]]]]
normalized: EG [[p3<=0 | [p5<=0 | [[1<=p3 & 1<=p5] & ~ [EG [~ [[1<=p3 & 1<=p4]]]]]]]]
abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p3)
states: 356,265 (5)
......................................................................................................
EG iterations: 102
abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (p5<=0)
states: 101
abstracting: (p3<=0)
states: 47,476 (4)
EG iterations: 0
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.214sec
checking: E [[~ [[1<=p3 & 1<=p5]] & EG [EF [[1<=p3 & 1<=p5]]]] U EF [[EG [~ [[1<=p0 & 1<=p1]]] & 1<=p7]]]
normalized: E [[EG [E [true U [1<=p3 & 1<=p5]]] & ~ [[1<=p3 & 1<=p5]]] U E [true U [1<=p7 & EG [~ [[1<=p0 & 1<=p1]]]]]]
abstracting: (1<=p1)
states: 356,240 (5)
abstracting: (1<=p0)
states: 380,016 (5)
.........................................................................................................
EG iterations: 105
abstracting: (1<=p7)
states: 335,790 (5)
abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
EG iterations: 0
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.686sec
checking: EF [AG [[AG [[p3<=0 | p5<=0]] & [EX [1<=p2] | [EF [[1<=p3 & 1<=p5]] | [1<=p0 & 1<=p1]]]]]]
normalized: E [true U ~ [E [true U ~ [[[[[1<=p0 & 1<=p1] | E [true U [1<=p3 & 1<=p5]]] | EX [1<=p2]] & ~ [E [true U ~ [[p3<=0 | p5<=0]]]]]]]]]
abstracting: (p5<=0)
states: 101
abstracting: (p3<=0)
states: 47,476 (4)
abstracting: (1<=p2)
states: 356,240 (5)
.abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p1)
states: 356,240 (5)
abstracting: (1<=p0)
states: 380,016 (5)
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: AG [A [[[~ [EF [1<=p7]] | EX [[1<=p3 & 1<=p4]]] | [EG [p2<=0] | [1<=p2 | [1<=p0 & 1<=p1]]]] U 1<=p2]]
normalized: ~ [E [true U ~ [[~ [EG [~ [1<=p2]]] & ~ [E [~ [1<=p2] U [~ [[[[1<=p2 | [1<=p0 & 1<=p1]] | EG [p2<=0]] | [EX [[1<=p3 & 1<=p4]] | ~ [E [true U 1<=p7]]]]] & ~ [1<=p2]]]]]]]]
abstracting: (1<=p2)
states: 356,240 (5)
abstracting: (1<=p7)
states: 335,790 (5)
abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p3)
states: 356,265 (5)
.abstracting: (p2<=0)
states: 47,501 (4)
.........................................................................................................
EG iterations: 105
abstracting: (1<=p1)
states: 356,240 (5)
abstracting: (1<=p0)
states: 380,016 (5)
abstracting: (1<=p2)
states: 356,240 (5)
abstracting: (1<=p2)
states: 356,240 (5)
abstracting: (1<=p2)
states: 356,240 (5)
.........................................................................................................
EG iterations: 105
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.061sec
checking: AG [[E [[AX [[1<=p3 & 1<=p4]] | ~ [[1<=p3 & 1<=p4]]] U E [[1<=p3 & 1<=p4] U [1<=p3 & 1<=p5]]] & A [AF [1<=p6] U 1<=p2]]]
normalized: ~ [E [true U ~ [[[~ [EG [~ [1<=p2]]] & ~ [E [~ [1<=p2] U [EG [~ [1<=p6]] & ~ [1<=p2]]]]] & E [[~ [[1<=p3 & 1<=p4]] | ~ [EX [~ [[1<=p3 & 1<=p4]]]]] U E [[1<=p3 & 1<=p4] U [1<=p3 & 1<=p5]]]]]]]
abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p3)
states: 356,265 (5)
.abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p2)
states: 356,240 (5)
abstracting: (1<=p6)
states: 335,790 (5)
.................................................................................................................................
EG iterations: 129
abstracting: (1<=p2)
states: 356,240 (5)
abstracting: (1<=p2)
states: 356,240 (5)
.........................................................................................................
EG iterations: 105
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.537sec
checking: AG [[AG [p2<=0] | [A [[1<=p3 & 1<=p5] U [[1<=p3 & 1<=p4] & [1<=p0 & 1<=p1]]] | E [AF [[1<=p0 & 1<=p1]] U EG [[1<=p0 & 1<=p1]]]]]]
normalized: ~ [E [true U ~ [[[E [~ [EG [~ [[1<=p0 & 1<=p1]]]] U EG [[1<=p0 & 1<=p1]]] | [~ [EG [~ [[[1<=p0 & 1<=p1] & [1<=p3 & 1<=p4]]]]] & ~ [E [~ [[[1<=p0 & 1<=p1] & [1<=p3 & 1<=p4]]] U [~ [[1<=p3 & 1<=p5]] & ~ [[[1<=p0 & 1<=p1] & [1<=p3 & 1<=p4]]]]]]]] | ~ [E [true U ~ [p2<=0]]]]]]]
abstracting: (p2<=0)
states: 47,501 (4)
abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p1)
states: 356,240 (5)
abstracting: (1<=p0)
states: 380,016 (5)
abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p1)
states: 356,240 (5)
abstracting: (1<=p0)
states: 380,016 (5)
abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p1)
states: 356,240 (5)
abstracting: (1<=p0)
states: 380,016 (5)
.
EG iterations: 1
abstracting: (1<=p1)
states: 356,240 (5)
abstracting: (1<=p0)
states: 380,016 (5)
..
EG iterations: 2
abstracting: (1<=p1)
states: 356,240 (5)
abstracting: (1<=p0)
states: 380,016 (5)
.........................................................................................................
EG iterations: 105
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.223sec
checking: [AX [[E [[1<=p4 & 1<=p3] U ~ [EX [[1<=p3 & 1<=p5]]]] | A [[EF [[1<=p0 & 1<=p1]] | 1<=p6] U ~ [[EX [1<=p7] & 1<=p7]]]]] & AG [[EF [p6<=0] | EX [[1<=p2 | 1<=p6]]]]]
normalized: [~ [E [true U ~ [[EX [[1<=p2 | 1<=p6]] | E [true U p6<=0]]]]] & ~ [EX [~ [[[~ [EG [[1<=p7 & EX [1<=p7]]]] & ~ [E [[1<=p7 & EX [1<=p7]] U [~ [[1<=p6 | E [true U [1<=p0 & 1<=p1]]]] & [1<=p7 & EX [1<=p7]]]]]] | E [[1<=p4 & 1<=p3] U ~ [EX [[1<=p3 & 1<=p5]]]]]]]]]
abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
.abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p7)
states: 335,790 (5)
.abstracting: (1<=p7)
states: 335,790 (5)
abstracting: (1<=p1)
states: 356,240 (5)
abstracting: (1<=p0)
states: 380,016 (5)
abstracting: (1<=p6)
states: 335,790 (5)
abstracting: (1<=p7)
states: 335,790 (5)
.abstracting: (1<=p7)
states: 335,790 (5)
abstracting: (1<=p7)
states: 335,790 (5)
.abstracting: (1<=p7)
states: 335,790 (5)
.
EG iterations: 1
.abstracting: (p6<=0)
states: 67,951 (4)
abstracting: (1<=p6)
states: 335,790 (5)
abstracting: (1<=p2)
states: 356,240 (5)
.-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.535sec
checking: E [~ [[1<=p3 & 1<=p4]] U [~ [[[1<=p7 | [[A [1<=p7 U [1<=p3 & 1<=p5]] & 1<=p6] & [1<=p0 & 1<=p1]]] | [AX [[1<=p0 & 1<=p1]] | AX [p2<=0]]]] | ~ [[1<=p3 & 1<=p5]]]]
normalized: E [~ [[1<=p3 & 1<=p4]] U [~ [[1<=p3 & 1<=p5]] | ~ [[[~ [EX [~ [p2<=0]]] | ~ [EX [~ [[1<=p0 & 1<=p1]]]]] | [1<=p7 | [[1<=p0 & 1<=p1] & [1<=p6 & [~ [EG [~ [[1<=p3 & 1<=p5]]]] & ~ [E [~ [[1<=p3 & 1<=p5]] U [~ [1<=p7] & ~ [[1<=p3 & 1<=p5]]]]]]]]]]]]]
abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p7)
states: 335,790 (5)
abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
......................................................................................................
EG iterations: 102
abstracting: (1<=p6)
states: 335,790 (5)
abstracting: (1<=p1)
states: 356,240 (5)
abstracting: (1<=p0)
states: 380,016 (5)
abstracting: (1<=p7)
states: 335,790 (5)
abstracting: (1<=p1)
states: 356,240 (5)
abstracting: (1<=p0)
states: 380,016 (5)
.abstracting: (p2<=0)
states: 47,501 (4)
.abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p3)
states: 356,265 (5)
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.087sec
checking: [AX [AF [E [A [[1<=p3 & 1<=p4] U 1<=p7] U [E [1<=p2 U 1<=p7] | [1<=p2 | [1<=p3 & 1<=p4]]]]]] & [AX [p2<=0] | EX [[[A [[[1<=p0 & 1<=p1] & [1<=p3 & 1<=p4]] U 1<=p2] | [EG [p6<=0] | 1<=p6]] | [AG [[1<=p3 & 1<=p4]] | [[AX [1<=p6] & [1<=p7 & 1<=p7]] | EF [[1<=p3 & 1<=p4]]]]]]]]
normalized: [[EX [[[[E [true U [1<=p3 & 1<=p4]] | [[1<=p7 & 1<=p7] & ~ [EX [~ [1<=p6]]]]] | ~ [E [true U ~ [[1<=p3 & 1<=p4]]]]] | [[1<=p6 | EG [p6<=0]] | [~ [EG [~ [1<=p2]]] & ~ [E [~ [1<=p2] U [~ [[[1<=p3 & 1<=p4] & [1<=p0 & 1<=p1]]] & ~ [1<=p2]]]]]]]] | ~ [EX [~ [p2<=0]]]] & ~ [EX [EG [~ [E [[~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [[1<=p3 & 1<=p4]] & ~ [1<=p7]]]]] U [[1<=p2 | [1<=p3 & 1<=p4]] | E [1<=p2 U 1<=p7]]]]]]]]
abstracting: (1<=p7)
states: 335,790 (5)
abstracting: (1<=p2)
states: 356,240 (5)
abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p2)
states: 356,240 (5)
abstracting: (1<=p7)
states: 335,790 (5)
abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p7)
states: 335,790 (5)
abstracting: (1<=p7)
states: 335,790 (5)
.................................................................................................................................
EG iterations: 129
....................................................
EG iterations: 52
.abstracting: (p2<=0)
states: 47,501 (4)
.abstracting: (1<=p2)
states: 356,240 (5)
abstracting: (1<=p1)
states: 356,240 (5)
abstracting: (1<=p0)
states: 380,016 (5)
abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p2)
states: 356,240 (5)
abstracting: (1<=p2)
states: 356,240 (5)
.........................................................................................................
EG iterations: 105
abstracting: (p6<=0)
states: 67,951 (4)
.................................................................................................................................
EG iterations: 129
abstracting: (1<=p6)
states: 335,790 (5)
abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p6)
states: 335,790 (5)
.abstracting: (1<=p7)
states: 335,790 (5)
abstracting: (1<=p7)
states: 335,790 (5)
abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p3)
states: 356,265 (5)
.-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.088sec
checking: [[EF [AX [~ [E [[1<=p3 & 1<=p4] U [1<=p0 & 1<=p1]]]]] & AX [[[A [[1<=p3 & 1<=p4] U 1<=p2] | [1<=p3 & 1<=p5]] | [1<=p7 | [1<=p0 & 1<=p1]]]]] | [EF [AX [[[p2<=0 & [p3<=0 | p4<=0]] | EX [[p3<=0 | p5<=0]]]]] & [~ [A [AX [[1<=p3 & 1<=p5]] U EX [[[1<=p3 & 1<=p5] | 1<=p2]]]] & EF [[p0<=0 | p1<=0]]]]]
normalized: [[[E [true U [p0<=0 | p1<=0]] & ~ [[~ [EG [~ [EX [[1<=p2 | [1<=p3 & 1<=p5]]]]]] & ~ [E [~ [EX [[1<=p2 | [1<=p3 & 1<=p5]]]] U [EX [~ [[1<=p3 & 1<=p5]]] & ~ [EX [[1<=p2 | [1<=p3 & 1<=p5]]]]]]]]]] & E [true U ~ [EX [~ [[EX [[p3<=0 | p5<=0]] | [p2<=0 & [p3<=0 | p4<=0]]]]]]]] | [~ [EX [~ [[[1<=p7 | [1<=p0 & 1<=p1]] | [[1<=p3 & 1<=p5] | [~ [EG [~ [1<=p2]]] & ~ [E [~ [1<=p2] U [~ [[1<=p3 & 1<=p4]] & ~ [1<=p2]]]]]]]]]] & E [true U ~ [EX [E [[1<=p3 & 1<=p4] U [1<=p0 & 1<=p1]]]]]]]
abstracting: (1<=p1)
states: 356,240 (5)
abstracting: (1<=p0)
states: 380,016 (5)
abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p3)
states: 356,265 (5)
.abstracting: (1<=p2)
states: 356,240 (5)
abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p2)
states: 356,240 (5)
abstracting: (1<=p2)
states: 356,240 (5)
.........................................................................................................
EG iterations: 105
abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p1)
states: 356,240 (5)
abstracting: (1<=p0)
states: 380,016 (5)
abstracting: (1<=p7)
states: 335,790 (5)
.abstracting: (p4<=0)
states: 23,751 (4)
abstracting: (p3<=0)
states: 47,476 (4)
abstracting: (p2<=0)
states: 47,501 (4)
abstracting: (p5<=0)
states: 101
abstracting: (p3<=0)
states: 47,476 (4)
..abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p2)
states: 356,240 (5)
.abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
.abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p2)
states: 356,240 (5)
.abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p2)
states: 356,240 (5)
.....
EG iterations: 4
abstracting: (p1<=0)
states: 47,501 (4)
abstracting: (p0<=0)
states: 23,725 (4)
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.231sec
checking: A [[~ [[[EG [[1<=p7 & [1<=p0 & 1<=p1]]] | ~ [EF [1<=p7]]] | [AG [1<=p2] | EG [[1<=p3 & 1<=p4]]]]] | [[~ [EG [1<=p7]] & [[A [[1<=p3 & 1<=p5] U [1<=p3 & 1<=p4]] | [AF [1<=p7] & E [1<=p2 U [1<=p0 & 1<=p1]]]] | [[1<=p0 & 1<=p1] | [[1<=p3 & 1<=p4] | [1<=p7 & [1<=p3 & 1<=p5]]]]]] | [[AG [[[1<=p3 & 1<=p4] | 1<=p2]] & 1<=p0] & [1<=p1 & [1<=p7 | EX [1<=p7]]]]]] U [[1<=p7 | [~ [[1<=p3 & 1<=p5]] | [AX [~ [[1<=p0 & 1<=p1]]] & EG [[AF [[1<=p3 & 1<=p5]] | [1<=p3 & [1<=p4 & 1<=p7]]]]]]] & [EG [[[1<=p3 & 1<=p4] & [1<=p0 & [1<=p1 & p6<=0]]]] | [AX [[EX [1<=p7] | 1<=p2]] | [EF [EX [[1<=p3 & 1<=p5]]] & AF [[EX [1<=p2] & [1<=p2 | 1<=p6]]]]]]]]
normalized: [~ [EG [~ [[[[[~ [EG [~ [[[1<=p2 | 1<=p6] & EX [1<=p2]]]]] & E [true U EX [[1<=p3 & 1<=p5]]]] | ~ [EX [~ [[1<=p2 | EX [1<=p7]]]]]] | EG [[[1<=p0 & [1<=p1 & p6<=0]] & [1<=p3 & 1<=p4]]]] & [1<=p7 | [[EG [[[1<=p3 & [1<=p4 & 1<=p7]] | ~ [EG [~ [[1<=p3 & 1<=p5]]]]]] & ~ [EX [[1<=p0 & 1<=p1]]]] | ~ [[1<=p3 & 1<=p5]]]]]]]] & ~ [E [~ [[[[[~ [EG [~ [[[1<=p2 | 1<=p6] & EX [1<=p2]]]]] & E [true U EX [[1<=p3 & 1<=p5]]]] | ~ [EX [~ [[1<=p2 | EX [1<=p7]]]]]] | EG [[[1<=p0 & [1<=p1 & p6<=0]] & [1<=p3 & 1<=p4]]]] & [1<=p7 | [[EG [[[1<=p3 & [1<=p4 & 1<=p7]] | ~ [EG [~ [[1<=p3 & 1<=p5]]]]]] & ~ [EX [[1<=p0 & 1<=p1]]]] | ~ [[1<=p3 & 1<=p5]]]]]] U [~ [[[[[1<=p1 & [1<=p7 | EX [1<=p7]]] & [1<=p0 & ~ [E [true U ~ [[1<=p2 | [1<=p3 & 1<=p4]]]]]]] | [[[[[1<=p7 & [1<=p3 & 1<=p5]] | [1<=p3 & 1<=p4]] | [1<=p0 & 1<=p1]] | [[E [1<=p2 U [1<=p0 & 1<=p1]] & ~ [EG [~ [1<=p7]]]] | [~ [EG [~ [[1<=p3 & 1<=p4]]]] & ~ [E [~ [[1<=p3 & 1<=p4]] U [~ [[1<=p3 & 1<=p5]] & ~ [[1<=p3 & 1<=p4]]]]]]]] & ~ [EG [1<=p7]]]] | ~ [[[EG [[1<=p3 & 1<=p4]] | ~ [E [true U ~ [1<=p2]]]] | [~ [E [true U 1<=p7]] | EG [[1<=p7 & [1<=p0 & 1<=p1]]]]]]]] & ~ [[[[[~ [EG [~ [[[1<=p2 | 1<=p6] & EX [1<=p2]]]]] & E [true U EX [[1<=p3 & 1<=p5]]]] | ~ [EX [~ [[1<=p2 | EX [1<=p7]]]]]] | EG [[[1<=p0 & [1<=p1 & p6<=0]] & [1<=p3 & 1<=p4]]]] & [1<=p7 | [[EG [[[1<=p3 & [1<=p4 & 1<=p7]] | ~ [EG [~ [[1<=p3 & 1<=p5]]]]]] & ~ [EX [[1<=p0 & 1<=p1]]]] | ~ [[1<=p3 & 1<=p5]]]]]]]]]]
abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p1)
states: 356,240 (5)
abstracting: (1<=p0)
states: 380,016 (5)
.abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
......................................................................................................
EG iterations: 102
abstracting: (1<=p7)
states: 335,790 (5)
abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p3)
states: 356,265 (5)
EG iterations: 0
abstracting: (1<=p7)
states: 335,790 (5)
abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (p6<=0)
states: 67,951 (4)
abstracting: (1<=p1)
states: 356,240 (5)
abstracting: (1<=p0)
states: 380,016 (5)
........................................................................................................................
EG iterations: 120
abstracting: (1<=p7)
states: 335,790 (5)
.abstracting: (1<=p2)
states: 356,240 (5)
.abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
.abstracting: (1<=p2)
states: 356,240 (5)
.abstracting: (1<=p6)
states: 335,790 (5)
abstracting: (1<=p2)
states: 356,240 (5)
.........................................................................................................
EG iterations: 105
abstracting: (1<=p1)
states: 356,240 (5)
abstracting: (1<=p0)
states: 380,016 (5)
abstracting: (1<=p7)
states: 335,790 (5)
..
EG iterations: 2
abstracting: (1<=p7)
states: 335,790 (5)
abstracting: (1<=p2)
states: 356,240 (5)
abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p3)
states: 356,265 (5)
..
EG iterations: 2
abstracting: (1<=p7)
states: 335,790 (5)
..
EG iterations: 2
abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p3)
states: 356,265 (5)
......................................................................................................
EG iterations: 102
abstracting: (1<=p7)
states: 335,790 (5)
.................................................................................................................................
EG iterations: 129
abstracting: (1<=p1)
states: 356,240 (5)
abstracting: (1<=p0)
states: 380,016 (5)
abstracting: (1<=p2)
states: 356,240 (5)
abstracting: (1<=p1)
states: 356,240 (5)
abstracting: (1<=p0)
states: 380,016 (5)
abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p7)
states: 335,790 (5)
abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p2)
states: 356,240 (5)
abstracting: (1<=p0)
states: 380,016 (5)
abstracting: (1<=p7)
states: 335,790 (5)
.abstracting: (1<=p7)
states: 335,790 (5)
abstracting: (1<=p1)
states: 356,240 (5)
abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p1)
states: 356,240 (5)
abstracting: (1<=p0)
states: 380,016 (5)
.abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
......................................................................................................
EG iterations: 102
abstracting: (1<=p7)
states: 335,790 (5)
abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p3)
states: 356,265 (5)
EG iterations: 0
abstracting: (1<=p7)
states: 335,790 (5)
abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (p6<=0)
states: 67,951 (4)
abstracting: (1<=p1)
states: 356,240 (5)
abstracting: (1<=p0)
states: 380,016 (5)
........................................................................................................................
EG iterations: 120
abstracting: (1<=p7)
states: 335,790 (5)
.abstracting: (1<=p2)
states: 356,240 (5)
.abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
.abstracting: (1<=p2)
states: 356,240 (5)
.abstracting: (1<=p6)
states: 335,790 (5)
abstracting: (1<=p2)
states: 356,240 (5)
.........................................................................................................
EG iterations: 105
abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (1<=p1)
states: 356,240 (5)
abstracting: (1<=p0)
states: 380,016 (5)
.abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
......................................................................................................
EG iterations: 102
abstracting: (1<=p7)
states: 335,790 (5)
abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p3)
states: 356,265 (5)
EG iterations: 0
abstracting: (1<=p7)
states: 335,790 (5)
abstracting: (1<=p4)
states: 379,990 (5)
abstracting: (1<=p3)
states: 356,265 (5)
abstracting: (p6<=0)
states: 67,951 (4)
abstracting: (1<=p1)
states: 356,240 (5)
abstracting: (1<=p0)
states: 380,016 (5)
........................................................................................................................
EG iterations: 120
abstracting: (1<=p7)
states: 335,790 (5)
.abstracting: (1<=p2)
states: 356,240 (5)
.abstracting: (1<=p5)
states: 403,640 (5)
abstracting: (1<=p3)
states: 356,265 (5)
.abstracting: (1<=p2)
states: 356,240 (5)
.abstracting: (1<=p6)
states: 335,790 (5)
abstracting: (1<=p2)
states: 356,240 (5)
.........................................................................................................
EG iterations: 105
.............................................................................................................................
EG iterations: 125
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00050vN-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.814sec
totally nodes used: 832866 (8.3e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 13433211 2556107 15989318
used/not used/entry size/cache size: 2802552 64306312 16 1024MB
basic ops cache: hits/miss/sum: 5328289 1047668 6375957
used/not used/entry size/cache size: 1718085 15059131 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: 130215 54515 184730
used/not used/entry size/cache size: 54410 8334198 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 66411238
1 605400
2 71832
3 9079
4 9235
5 542
6 130
7 96
8 542
9 75
>= 10 695
Total processing time: 0m 9.668sec
BK_STOP 1679339334732
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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:631 (105), effective:200 (33)
initing FirstDep: 0m 0.000sec
iterations count:71 (11), effective:30 (5)
iterations count:29 (4), effective:7 (1)
iterations count:29 (4), effective:7 (1)
iterations count:29 (4), effective:7 (1)
iterations count:29 (4), effective:7 (1)
iterations count:29 (4), effective:7 (1)
iterations count:29 (4), effective:7 (1)
iterations count:6 (1), effective:0 (0)
iterations count:23 (3), effective:6 (1)
iterations count:260 (43), effective:101 (16)
iterations count:56 (9), effective:25 (4)
iterations count:8 (1), effective:1 (0)
iterations count:18 (3), effective:4 (0)
iterations count:460 (76), effective:176 (29)
iterations count:23 (3), effective:5 (0)
iterations count:176 (29), effective:49 (8)
iterations count:32 (5), effective:8 (1)
iterations count:224 (37), effective:73 (12)
iterations count:31 (5), effective:7 (1)
iterations count:131 (21), effective:25 (4)
iterations count:106 (17), effective:25 (4)
iterations count:79 (13), effective:48 (8)
iterations count:23 (3), effective:6 (1)
iterations count:56 (9), effective:25 (4)
iterations count:6 (1), effective:0 (0)
iterations count:30 (5), effective:24 (4)
iterations count:61 (10), effective:26 (4)
iterations count:26 (4), effective:7 (1)
iterations count:24 (4), effective:5 (0)
iterations count:450 (75), effective:173 (28)
iterations count:61 (10), effective:26 (4)
iterations count:61 (10), effective:27 (4)
iterations count:6 (1), effective:0 (0)
iterations count:31 (5), effective:25 (4)
iterations count:22 (3), effective:5 (0)
iterations count:23 (3), effective:6 (1)
iterations count:56 (9), effective:25 (4)
iterations count:56 (9), effective:25 (4)
iterations count:31 (5), effective:7 (1)
iterations count:111 (18), effective:51 (8)
iterations count:22 (3), effective:5 (0)
iterations count:22 (3), effective:5 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TwoPhaseLocking-PT-nC00050vN"
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 TwoPhaseLocking-PT-nC00050vN, 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 r490-tall-167912709200826"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TwoPhaseLocking-PT-nC00050vN.tgz
mv TwoPhaseLocking-PT-nC00050vN 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 ;