About the Execution of Marcie+red for TwoPhaseLocking-PT-nC00050vD
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5615.720 | 12147.00 | 14503.00 | 335.70 | TTFFFFTFTFTFFFFT | 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-167912709200818.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-nC00050vD, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912709200818
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 5.5K Feb 25 17:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Feb 25 17:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 17:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 17:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 17:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 17:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K Feb 25 17:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 17:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 17:48 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-nC00050vD-CTLFireability-00
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-01
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-02
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-03
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-04
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-05
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-06
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-07
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-08
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-09
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-10
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-11
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-12
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-13
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-14
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679339250175
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-nC00050vD
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 19:07:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 19:07:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 19:07:31] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2023-03-20 19:07:31] [INFO ] Transformed 8 places.
[2023-03-20 19:07:31] [INFO ] Transformed 6 transitions.
[2023-03-20 19:07:31] [INFO ] Parsed PT model containing 8 places and 6 transitions and 18 arcs in 76 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 8 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:07:31] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-20 19:07:32] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-20 19:07:32] [INFO ] Invariant cache hit.
[2023-03-20 19:07:32] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2023-03-20 19:07:32] [INFO ] Invariant cache hit.
[2023-03-20 19:07:32] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 394 ms. Remains : 8/8 places, 6/6 transitions.
Support contains 8 out of 8 places after structural reductions.
[2023-03-20 19:07:32] [INFO ] Flatten gal took : 12 ms
[2023-03-20 19:07:32] [INFO ] Flatten gal took : 4 ms
[2023-03-20 19:07:32] [INFO ] Input system was already deterministic with 6 transitions.
Finished random walk after 2845 steps, including 11 resets, run visited all 23 properties in 22 ms. (steps per millisecond=129 )
[2023-03-20 19:07:32] [INFO ] Flatten gal took : 2 ms
[2023-03-20 19:07:32] [INFO ] Flatten gal took : 2 ms
[2023-03-20 19:07:32] [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 1 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 19:07:32] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:07:32] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:07:32] [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:07:32] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:07:32] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:07:32] [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 1 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 19:07:32] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:07:32] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:07:32] [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 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 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:07:32] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:07:32] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:07:32] [INFO ] Input system was already deterministic with 5 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
Applied a total of 2 rules in 2 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 2 ms. Remains : 7/8 places, 5/6 transitions.
[2023-03-20 19:07:32] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:07:32] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:07:32] [INFO ] Input system was already deterministic with 5 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
Applied a total of 2 rules in 2 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 2 ms. Remains : 7/8 places, 5/6 transitions.
[2023-03-20 19:07:32] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:07:32] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:07:32] [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 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 1 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 19:07:32] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:07:32] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:07:32] [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:07:32] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:07:32] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:07:32] [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 1 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 19:07:32] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:07:32] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:07:32] [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 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 1 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 1 ms. Remains : 7/8 places, 5/6 transitions.
[2023-03-20 19:07:32] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:07:32] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:07:32] [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 0 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:07:32] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:07:32] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:07:32] [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:07:32] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:07:32] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:07:32] [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:07:32] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:07:32] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:07:32] [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:07:32] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:07:32] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:07:32] [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:07:32] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:07:32] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:07:32] [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:07:32] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:07:32] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:07:32] [INFO ] Input system was already deterministic with 6 transitions.
[2023-03-20 19:07:32] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:07:32] [INFO ] Flatten gal took : 2 ms
[2023-03-20 19:07:32] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-20 19:07:32] [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 990 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.826sec
RS generation: 0m 0.146sec
-> reachability set: #nodes 11232 (1.1e+04) #states 380,015 (5)
starting MCC model checker
--------------------------
checking: EF [AG [AF [[1<=p3 & [1<=p5 & 1<=p6]]]]]
normalized: E [true U ~ [E [true U EG [~ [[[1<=p5 & 1<=p6] & 1<=p3]]]]]]
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (1<=p6)
states: 315,315 (5)
abstracting: (1<=p5)
states: 379,990 (5)
.........................
EG iterations: 25
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.002sec
checking: AF [EX [AG [E [EF [[1<=p3 & 1<=p4]] U AX [1<=p6]]]]]
normalized: ~ [EG [~ [EX [~ [E [true U ~ [E [E [true U [1<=p3 & 1<=p4]] U ~ [EX [~ [1<=p6]]]]]]]]]]]
abstracting: (1<=p6)
states: 315,315 (5)
.abstracting: (1<=p4)
states: 356,264 (5)
abstracting: (1<=p3)
states: 335,790 (5)
..
EG iterations: 1
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.088sec
checking: AG [[AF [1<=p2] | [1<=p3 & 1<=p4]]]
normalized: ~ [E [true U ~ [[[1<=p3 & 1<=p4] | ~ [EG [~ [1<=p2]]]]]]]
abstracting: (1<=p2)
states: 335,789 (5)
..................................................................................................
EG iterations: 98
abstracting: (1<=p4)
states: 356,264 (5)
abstracting: (1<=p3)
states: 335,790 (5)
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.245sec
checking: EG [[AF [[EX [1<=p7] | [p3<=0 | p5<=0]]] & p6<=0]]
normalized: EG [[p6<=0 & ~ [EG [~ [[[p3<=0 | p5<=0] | EX [1<=p7]]]]]]]
abstracting: (1<=p7)
states: 315,315 (5)
.abstracting: (p5<=0)
states: 25
abstracting: (p3<=0)
states: 44,225 (4)
..........................................................................
EG iterations: 74
abstracting: (p6<=0)
states: 64,700 (4)
.............................................................................................................................
EG iterations: 125
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.463sec
checking: AF [[A [~ [EG [1<=p6]] U 1<=p2] | [1<=p3 & [1<=p4 & AF [AX [p7<=0]]]]]]
normalized: ~ [EG [~ [[[1<=p3 & [1<=p4 & ~ [EG [EX [~ [p7<=0]]]]]] | [~ [EG [~ [1<=p2]]] & ~ [E [~ [1<=p2] U [EG [1<=p6] & ~ [1<=p2]]]]]]]]]
abstracting: (1<=p2)
states: 335,789 (5)
abstracting: (1<=p6)
states: 315,315 (5)
..
EG iterations: 2
abstracting: (1<=p2)
states: 335,789 (5)
abstracting: (1<=p2)
states: 335,789 (5)
..................................................................................................
EG iterations: 98
abstracting: (p7<=0)
states: 64,700 (4)
...
EG iterations: 2
abstracting: (1<=p4)
states: 356,264 (5)
abstracting: (1<=p3)
states: 335,790 (5)
....................................................................................................
EG iterations: 100
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.142sec
checking: EF [[E [[1<=p3 & 1<=p5] U [1<=p3 & 1<=p4]] & AG [p6<=0]]]
normalized: E [true U [~ [E [true U ~ [p6<=0]]] & E [[1<=p3 & 1<=p5] U [1<=p3 & 1<=p4]]]]
abstracting: (1<=p4)
states: 356,264 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (1<=p5)
states: 379,990 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (p6<=0)
states: 64,700 (4)
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.023sec
checking: E [1<=p7 U ~ [[~ [[[E [[1<=p3 & 1<=p5] U 1<=p7] & AF [1<=p7]] | 1<=p7]] | AG [~ [AF [1<=p2]]]]]]
normalized: E [1<=p7 U ~ [[~ [E [true U ~ [EG [~ [1<=p2]]]]] | ~ [[1<=p7 | [~ [EG [~ [1<=p7]]] & E [[1<=p3 & 1<=p5] U 1<=p7]]]]]]]
abstracting: (1<=p7)
states: 315,315 (5)
abstracting: (1<=p5)
states: 379,990 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (1<=p7)
states: 315,315 (5)
.
EG iterations: 1
abstracting: (1<=p7)
states: 315,315 (5)
abstracting: (1<=p2)
states: 335,789 (5)
..................................................................................................
EG iterations: 98
abstracting: (1<=p7)
states: 315,315 (5)
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: A [EG [EX [[~ [A [[1<=p3 & 1<=p5] U [1<=p3 & 1<=p4]]] & [E [1<=p7 U 1<=p2] | 1<=p6]]]] U AG [p6<=0]]
normalized: [~ [EG [E [true U ~ [p6<=0]]]] & ~ [E [E [true U ~ [p6<=0]] U [~ [EG [EX [[[1<=p6 | E [1<=p7 U 1<=p2]] & ~ [[~ [EG [~ [[1<=p3 & 1<=p4]]]] & ~ [E [~ [[1<=p3 & 1<=p4]] U [~ [[1<=p3 & 1<=p5]] & ~ [[1<=p3 & 1<=p4]]]]]]]]]]] & E [true U ~ [p6<=0]]]]]]
abstracting: (p6<=0)
states: 64,700 (4)
abstracting: (1<=p4)
states: 356,264 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (1<=p5)
states: 379,990 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (1<=p4)
states: 356,264 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (1<=p4)
states: 356,264 (5)
abstracting: (1<=p3)
states: 335,790 (5)
......................................................................................................
EG iterations: 102
abstracting: (1<=p2)
states: 335,789 (5)
abstracting: (1<=p7)
states: 315,315 (5)
abstracting: (1<=p6)
states: 315,315 (5)
...
EG iterations: 2
abstracting: (p6<=0)
states: 64,700 (4)
abstracting: (p6<=0)
states: 64,700 (4)
.
EG iterations: 1
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.315sec
checking: AG [[[EX [[1<=p4 & 1<=p3]] | [EF [1<=p2] | p3<=0]] | [p5<=0 | [[1<=p2 & [1<=p0 & 1<=p1]] | [p7<=0 & EX [1<=p7]]]]]]
normalized: ~ [E [true U ~ [[[p5<=0 | [[p7<=0 & EX [1<=p7]] | [1<=p2 & [1<=p0 & 1<=p1]]]] | [[p3<=0 | E [true U 1<=p2]] | EX [[1<=p4 & 1<=p3]]]]]]]
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (1<=p4)
states: 356,264 (5)
.abstracting: (1<=p2)
states: 335,789 (5)
abstracting: (p3<=0)
states: 44,225 (4)
abstracting: (1<=p1)
states: 335,790 (5)
abstracting: (1<=p0)
states: 356,265 (5)
abstracting: (1<=p2)
states: 335,789 (5)
abstracting: (1<=p7)
states: 315,315 (5)
.abstracting: (p7<=0)
states: 64,700 (4)
abstracting: (p5<=0)
states: 25
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.060sec
checking: EF [[[1<=p7 & AF [[p0<=0 | p1<=0]]] & [EG [[EX [1<=p7] | EG [1<=p2]]] & [~ [A [~ [AF [1<=p2]] U [[1<=p6 | 1<=p7] | [1<=p2 | [1<=p3 & 1<=p5]]]]] & EF [~ [E [1<=p6 U 1<=p2]]]]]]]
normalized: E [true U [[[E [true U ~ [E [1<=p6 U 1<=p2]]] & ~ [[~ [EG [~ [[[1<=p2 | [1<=p3 & 1<=p5]] | [1<=p6 | 1<=p7]]]]] & ~ [E [~ [[[1<=p2 | [1<=p3 & 1<=p5]] | [1<=p6 | 1<=p7]]] U [~ [EG [~ [1<=p2]]] & ~ [[[1<=p2 | [1<=p3 & 1<=p5]] | [1<=p6 | 1<=p7]]]]]]]]] & EG [[EG [1<=p2] | EX [1<=p7]]]] & [1<=p7 & ~ [EG [~ [[p0<=0 | p1<=0]]]]]]]
abstracting: (p1<=0)
states: 44,225 (4)
abstracting: (p0<=0)
states: 23,750 (4)
..
EG iterations: 2
abstracting: (1<=p7)
states: 315,315 (5)
abstracting: (1<=p7)
states: 315,315 (5)
.abstracting: (1<=p2)
states: 335,789 (5)
..
EG iterations: 2
..
EG iterations: 2
abstracting: (1<=p7)
states: 315,315 (5)
abstracting: (1<=p6)
states: 315,315 (5)
abstracting: (1<=p5)
states: 379,990 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (1<=p2)
states: 335,789 (5)
abstracting: (1<=p2)
states: 335,789 (5)
..................................................................................................
EG iterations: 98
abstracting: (1<=p7)
states: 315,315 (5)
abstracting: (1<=p6)
states: 315,315 (5)
abstracting: (1<=p5)
states: 379,990 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (1<=p2)
states: 335,789 (5)
abstracting: (1<=p7)
states: 315,315 (5)
abstracting: (1<=p6)
states: 315,315 (5)
abstracting: (1<=p5)
states: 379,990 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (1<=p2)
states: 335,789 (5)
..
EG iterations: 2
abstracting: (1<=p2)
states: 335,789 (5)
abstracting: (1<=p6)
states: 315,315 (5)
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.231sec
checking: EF [[[AX [EF [1<=p6]] & AX [~ [E [[1<=p0 & 1<=p1] U [1<=p0 & 1<=p1]]]]] & [EX [[[[1<=p3 & [1<=p5 & 1<=p2]] | [1<=p3 & 1<=p4]] & [1<=p3 & 1<=p5]]] & [1<=p3 & 1<=p4]]]]
normalized: E [true U [[[1<=p3 & 1<=p4] & EX [[[1<=p3 & 1<=p5] & [[1<=p3 & 1<=p4] | [1<=p3 & [1<=p5 & 1<=p2]]]]]] & [~ [EX [E [[1<=p0 & 1<=p1] U [1<=p0 & 1<=p1]]]] & ~ [EX [~ [E [true U 1<=p6]]]]]]]
abstracting: (1<=p6)
states: 315,315 (5)
.abstracting: (1<=p1)
states: 335,790 (5)
abstracting: (1<=p0)
states: 356,265 (5)
abstracting: (1<=p1)
states: 335,790 (5)
abstracting: (1<=p0)
states: 356,265 (5)
.abstracting: (1<=p2)
states: 335,789 (5)
abstracting: (1<=p5)
states: 379,990 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (1<=p4)
states: 356,264 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (1<=p5)
states: 379,990 (5)
abstracting: (1<=p3)
states: 335,790 (5)
.abstracting: (1<=p4)
states: 356,264 (5)
abstracting: (1<=p3)
states: 335,790 (5)
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.134sec
checking: AF [[[E [E [AF [1<=p6] U 1<=p2] U EX [[1<=p3 & 1<=p5]]] | ~ [E [EG [[1<=p3 & 1<=p4]] U [1<=p3 & 1<=p4]]]] & [[1<=p7 & [1<=p3 & 1<=p4]] | [p6<=0 & EX [[p3<=0 | [p4<=0 | p7<=0]]]]]]]
normalized: ~ [EG [~ [[[[p6<=0 & EX [[p3<=0 | [p4<=0 | p7<=0]]]] | [1<=p7 & [1<=p3 & 1<=p4]]] & [~ [E [EG [[1<=p3 & 1<=p4]] U [1<=p3 & 1<=p4]]] | E [E [~ [EG [~ [1<=p6]]] U 1<=p2] U EX [[1<=p3 & 1<=p5]]]]]]]]
abstracting: (1<=p5)
states: 379,990 (5)
abstracting: (1<=p3)
states: 335,790 (5)
.abstracting: (1<=p2)
states: 335,789 (5)
abstracting: (1<=p6)
states: 315,315 (5)
.............................................................................................................................
EG iterations: 125
abstracting: (1<=p4)
states: 356,264 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (1<=p4)
states: 356,264 (5)
abstracting: (1<=p3)
states: 335,790 (5)
..
EG iterations: 2
abstracting: (1<=p4)
states: 356,264 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (1<=p7)
states: 315,315 (5)
abstracting: (p7<=0)
states: 64,700 (4)
abstracting: (p4<=0)
states: 23,751 (4)
abstracting: (p3<=0)
states: 44,225 (4)
.abstracting: (p6<=0)
states: 64,700 (4)
.
EG iterations: 1
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.031sec
checking: EG [[~ [E [[[~ [[1<=p3 & 1<=p5]] & 1<=p2] & [[[1<=p0 & 1<=p1] | 1<=p7] & [[1<=p3 & 1<=p4] | 1<=p2]]] U [EF [[1<=p0 & 1<=p1]] & 1<=p2]]] | A [1<=p2 U EG [[~ [[1<=p3 & 1<=p4]] & AG [[1<=p3 & 1<=p5]]]]]]]
normalized: EG [[[~ [EG [~ [EG [[~ [E [true U ~ [[1<=p3 & 1<=p5]]]] & ~ [[1<=p3 & 1<=p4]]]]]]] & ~ [E [~ [EG [[~ [E [true U ~ [[1<=p3 & 1<=p5]]]] & ~ [[1<=p3 & 1<=p4]]]]] U [~ [1<=p2] & ~ [EG [[~ [E [true U ~ [[1<=p3 & 1<=p5]]]] & ~ [[1<=p3 & 1<=p4]]]]]]]]] | ~ [E [[[[1<=p2 | [1<=p3 & 1<=p4]] & [1<=p7 | [1<=p0 & 1<=p1]]] & [1<=p2 & ~ [[1<=p3 & 1<=p5]]]] U [1<=p2 & E [true U [1<=p0 & 1<=p1]]]]]]]
abstracting: (1<=p1)
states: 335,790 (5)
abstracting: (1<=p0)
states: 356,265 (5)
abstracting: (1<=p2)
states: 335,789 (5)
abstracting: (1<=p5)
states: 379,990 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (1<=p2)
states: 335,789 (5)
abstracting: (1<=p1)
states: 335,790 (5)
abstracting: (1<=p0)
states: 356,265 (5)
abstracting: (1<=p7)
states: 315,315 (5)
abstracting: (1<=p4)
states: 356,264 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (1<=p2)
states: 335,789 (5)
abstracting: (1<=p4)
states: 356,264 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (1<=p5)
states: 379,990 (5)
abstracting: (1<=p3)
states: 335,790 (5)
.
EG iterations: 1
abstracting: (1<=p2)
states: 335,789 (5)
abstracting: (1<=p4)
states: 356,264 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (1<=p5)
states: 379,990 (5)
abstracting: (1<=p3)
states: 335,790 (5)
.
EG iterations: 1
abstracting: (1<=p4)
states: 356,264 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (1<=p5)
states: 379,990 (5)
abstracting: (1<=p3)
states: 335,790 (5)
.
EG iterations: 1
EG iterations: 0
..................................................................................................
EG iterations: 98
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.073sec
checking: AG [[[E [~ [[~ [[1<=p3 & [1<=p5 & 1<=p6]]] & p6<=0]] U ~ [EF [[1<=p3 & 1<=p5]]]] | EF [[p7<=0 & A [[1<=p3 & 1<=p4] U 1<=p7]]]] | [AF [[E [1<=p7 U [1<=p3 & 1<=p5]] & [1<=p6 & 1<=p6]]] | EX [[AX [p6<=0] & [p3<=0 | p5<=0]]]]]]
normalized: ~ [E [true U ~ [[[EX [[[p3<=0 | p5<=0] & ~ [EX [~ [p6<=0]]]]] | ~ [EG [~ [[[1<=p6 & 1<=p6] & E [1<=p7 U [1<=p3 & 1<=p5]]]]]]] | [E [true U [p7<=0 & [~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [[1<=p3 & 1<=p4]] & ~ [1<=p7]]]]]]] | E [~ [[p6<=0 & ~ [[1<=p3 & [1<=p5 & 1<=p6]]]]] U ~ [E [true U [1<=p3 & 1<=p5]]]]]]]]]
abstracting: (1<=p5)
states: 379,990 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (1<=p6)
states: 315,315 (5)
abstracting: (1<=p5)
states: 379,990 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (p6<=0)
states: 64,700 (4)
abstracting: (1<=p7)
states: 315,315 (5)
abstracting: (1<=p4)
states: 356,264 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (1<=p7)
states: 315,315 (5)
abstracting: (1<=p7)
states: 315,315 (5)
.
EG iterations: 1
abstracting: (p7<=0)
states: 64,700 (4)
abstracting: (1<=p5)
states: 379,990 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (1<=p7)
states: 315,315 (5)
abstracting: (1<=p6)
states: 315,315 (5)
abstracting: (1<=p6)
states: 315,315 (5)
.........................
EG iterations: 25
abstracting: (p6<=0)
states: 64,700 (4)
.abstracting: (p5<=0)
states: 25
abstracting: (p3<=0)
states: 44,225 (4)
.-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.076sec
checking: [EG [[[[p0<=0 | p1<=0] & 1<=p6] & [~ [E [[1<=p3 & 1<=p5] U 1<=p6]] & [AG [[p3<=0 | p5<=0]] & ~ [E [[1<=p7 & [1<=p3 & 1<=p5]] U [1<=p3 & 1<=p5]]]]]]] | EX [[[~ [E [p7<=0 U ~ [[1<=p0 & 1<=p1]]]] & EX [[p0<=0 | p1<=0]]] & [~ [E [1<=p2 U 1<=p2]] & AG [AX [1<=p6]]]]]]
normalized: [EX [[[~ [E [true U EX [~ [1<=p6]]]] & ~ [E [1<=p2 U 1<=p2]]] & [EX [[p0<=0 | p1<=0]] & ~ [E [p7<=0 U ~ [[1<=p0 & 1<=p1]]]]]]] | EG [[[[~ [E [[1<=p7 & [1<=p3 & 1<=p5]] U [1<=p3 & 1<=p5]]] & ~ [E [true U ~ [[p3<=0 | p5<=0]]]]] & ~ [E [[1<=p3 & 1<=p5] U 1<=p6]]] & [1<=p6 & [p0<=0 | p1<=0]]]]]
abstracting: (p1<=0)
states: 44,225 (4)
abstracting: (p0<=0)
states: 23,750 (4)
abstracting: (1<=p6)
states: 315,315 (5)
abstracting: (1<=p6)
states: 315,315 (5)
abstracting: (1<=p5)
states: 379,990 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (p5<=0)
states: 25
abstracting: (p3<=0)
states: 44,225 (4)
abstracting: (1<=p5)
states: 379,990 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (1<=p5)
states: 379,990 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (1<=p7)
states: 315,315 (5)
.
EG iterations: 1
abstracting: (1<=p1)
states: 335,790 (5)
abstracting: (1<=p0)
states: 356,265 (5)
abstracting: (p7<=0)
states: 64,700 (4)
abstracting: (p1<=0)
states: 44,225 (4)
abstracting: (p0<=0)
states: 23,750 (4)
.abstracting: (1<=p2)
states: 335,789 (5)
abstracting: (1<=p2)
states: 335,789 (5)
abstracting: (1<=p6)
states: 315,315 (5)
..-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.168sec
checking: [[EX [[[[[[[[p0<=0 | p1<=0] & 1<=p6] & [1<=p3 & 1<=p5]] | p3<=0] | [p5<=0 | [1<=p7 | 1<=p7]]] & [p3<=0 | [p5<=0 | [1<=p0 & 1<=p1]]]] & [AF [[1<=p3 & 1<=p4]] & [p7<=0 | [1<=p3 & [1<=p4 & [p7<=0 | p6<=0]]]]]]] & EF [1<=p2]] & [EF [[[1<=p3 & 1<=p4] | EG [[p0<=0 | p1<=0]]]] & [EF [[p3<=0 | p4<=0]] | [AG [[[1<=p3 & 1<=p5] & [1<=p0 & [1<=p1 & 1<=p2]]]] | A [[p6<=0 & ~ [[1<=p3 & 1<=p5]]] U ~ [AG [1<=p2]]]]]]]
normalized: [[[[[~ [EG [~ [E [true U ~ [1<=p2]]]]] & ~ [E [~ [E [true U ~ [1<=p2]]] U [~ [[p6<=0 & ~ [[1<=p3 & 1<=p5]]]] & ~ [E [true U ~ [1<=p2]]]]]]] | ~ [E [true U ~ [[[1<=p0 & [1<=p1 & 1<=p2]] & [1<=p3 & 1<=p5]]]]]] | E [true U [p3<=0 | p4<=0]]] & E [true U [EG [[p0<=0 | p1<=0]] | [1<=p3 & 1<=p4]]]] & [E [true U 1<=p2] & EX [[[[p7<=0 | [1<=p3 & [1<=p4 & [p7<=0 | p6<=0]]]] & ~ [EG [~ [[1<=p3 & 1<=p4]]]]] & [[p3<=0 | [p5<=0 | [1<=p0 & 1<=p1]]] & [[p5<=0 | [1<=p7 | 1<=p7]] | [p3<=0 | [[1<=p3 & 1<=p5] & [1<=p6 & [p0<=0 | p1<=0]]]]]]]]]]
abstracting: (p1<=0)
states: 44,225 (4)
abstracting: (p0<=0)
states: 23,750 (4)
abstracting: (1<=p6)
states: 315,315 (5)
abstracting: (1<=p5)
states: 379,990 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (p3<=0)
states: 44,225 (4)
abstracting: (1<=p7)
states: 315,315 (5)
abstracting: (1<=p7)
states: 315,315 (5)
abstracting: (p5<=0)
states: 25
abstracting: (1<=p1)
states: 335,790 (5)
abstracting: (1<=p0)
states: 356,265 (5)
abstracting: (p5<=0)
states: 25
abstracting: (p3<=0)
states: 44,225 (4)
abstracting: (1<=p4)
states: 356,264 (5)
abstracting: (1<=p3)
states: 335,790 (5)
......................................................................................................
EG iterations: 102
abstracting: (p6<=0)
states: 64,700 (4)
abstracting: (p7<=0)
states: 64,700 (4)
abstracting: (1<=p4)
states: 356,264 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (p7<=0)
states: 64,700 (4)
.abstracting: (1<=p2)
states: 335,789 (5)
abstracting: (1<=p4)
states: 356,264 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (p1<=0)
states: 44,225 (4)
abstracting: (p0<=0)
states: 23,750 (4)
....................................................................................................
EG iterations: 100
abstracting: (p4<=0)
states: 23,751 (4)
abstracting: (p3<=0)
states: 44,225 (4)
abstracting: (1<=p5)
states: 379,990 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (1<=p2)
states: 335,789 (5)
abstracting: (1<=p1)
states: 335,790 (5)
abstracting: (1<=p0)
states: 356,265 (5)
abstracting: (1<=p2)
states: 335,789 (5)
abstracting: (1<=p5)
states: 379,990 (5)
abstracting: (1<=p3)
states: 335,790 (5)
abstracting: (p6<=0)
states: 64,700 (4)
abstracting: (1<=p2)
states: 335,789 (5)
abstracting: (1<=p2)
states: 335,789 (5)
.
EG iterations: 1
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00050vD-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.709sec
totally nodes used: 618160 (6.2e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 10488565 2088840 12577405
used/not used/entry size/cache size: 2371540 64737324 16 1024MB
basic ops cache: hits/miss/sum: 4541648 877029 5418677
used/not used/entry size/cache size: 1434159 15343057 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: 118479 51390 169869
used/not used/entry size/cache size: 51320 8337288 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 66577872
1 474552
2 45716
3 4361
4 4130
5 317
6 184
7 168
8 571
9 121
>= 10 872
Total processing time: 0m 8.662sec
BK_STOP 1679339262322
--------------------
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:673 (112), effective:222 (37)
initing FirstDep: 0m 0.000sec
iterations count:174 (29), effective:48 (8)
iterations count:26 (4), effective:7 (1)
iterations count:121 (20), effective:55 (9)
iterations count:206 (34), effective:75 (12)
iterations count:9 (1), effective:2 (0)
iterations count:20 (3), effective:5 (0)
iterations count:22 (3), effective:6 (1)
iterations count:21 (3), effective:5 (0)
iterations count:19 (3), effective:4 (0)
iterations count:6 (1), effective:0 (0)
iterations count:22 (3), effective:6 (1)
iterations count:56 (9), effective:25 (4)
iterations count:10 (1), effective:1 (0)
iterations count:22 (3), effective:6 (1)
iterations count:236 (39), effective:101 (16)
iterations count:22 (3), effective:6 (1)
iterations count:23 (3), effective:5 (0)
iterations count:23 (3), effective:5 (0)
iterations count:224 (37), effective:73 (12)
iterations count:22 (3), effective:6 (1)
iterations count:6 (1), effective:0 (0)
iterations count:203 (33), effective:94 (15)
iterations count:23 (3), effective:5 (0)
iterations count:11 (1), effective:2 (0)
iterations count:6 (1), effective:0 (0)
iterations count:26 (4), effective:6 (1)
iterations count:6 (1), effective:0 (0)
iterations count:56 (9), effective:25 (4)
iterations count:56 (9), effective:25 (4)
iterations count:56 (9), effective:25 (4)
iterations count:56 (9), effective:25 (4)
iterations count:18 (3), effective:4 (0)
iterations count:6 (1), effective:0 (0)
iterations count:56 (9), effective:25 (4)
iterations count:18 (3), effective:4 (0)
iterations count:278 (46), effective:75 (12)
iterations count:22 (3), effective:6 (1)
iterations count:18 (3), effective:4 (0)
iterations count:6 (1), effective:0 (0)
iterations count:31 (5), effective:25 (4)
iterations count:6 (1), effective:0 (0)
iterations count:127 (21), effective:25 (4)
iterations count:23 (3), effective:5 (0)
iterations count:231 (38), effective:100 (16)
iterations count:56 (9), effective:25 (4)
iterations count:29 (4), effective:23 (3)
iterations count:56 (9), effective:25 (4)
iterations count:56 (9), effective:25 (4)
iterations count:56 (9), effective:25 (4)
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-nC00050vD"
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-nC00050vD, 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-167912709200818"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TwoPhaseLocking-PT-nC00050vD.tgz
mv TwoPhaseLocking-PT-nC00050vD 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 ;