fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r490-tall-167912709200834
Last Updated
May 14, 2023

About the Execution of Marcie+red for TwoPhaseLocking-PT-nC00100vD

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8053.964 70558.00 73359.00 617.20 FTTFFFTTTFFTTTTF 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-167912709200834.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-nC00100vD, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912709200834
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.2K Feb 25 17:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 17:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 17:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Feb 25 17:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 17:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 25 17:31 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-nC00100vD-CTLFireability-00
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLFireability-01
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLFireability-02
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLFireability-03
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLFireability-04
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLFireability-05
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLFireability-06
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLFireability-07
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLFireability-08
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLFireability-09
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLFireability-10
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLFireability-11
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLFireability-12
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLFireability-13
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLFireability-14
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679339395806

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-nC00100vD
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 19:09:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 19:09:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 19:09:57] [INFO ] Load time of PNML (sax parser for PT used): 18 ms
[2023-03-20 19:09:57] [INFO ] Transformed 8 places.
[2023-03-20 19:09:57] [INFO ] Transformed 6 transitions.
[2023-03-20 19:09:57] [INFO ] Parsed PT model containing 8 places and 6 transitions and 18 arcs in 73 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Initial state reduction rules removed 1 formulas.
FORMULA TwoPhaseLocking-PT-nC00100vD-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 9 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:09:57] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-20 19:09:57] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-20 19:09:57] [INFO ] Invariant cache hit.
[2023-03-20 19:09:57] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2023-03-20 19:09:57] [INFO ] Invariant cache hit.
[2023-03-20 19:09:57] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 218 ms. Remains : 8/8 places, 6/6 transitions.
Support contains 8 out of 8 places after structural reductions.
[2023-03-20 19:09:57] [INFO ] Flatten gal took : 12 ms
[2023-03-20 19:09:57] [INFO ] Flatten gal took : 3 ms
[2023-03-20 19:09:57] [INFO ] Input system was already deterministic with 6 transitions.
Incomplete random walk after 10015 steps, including 19 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 25) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 19:09:58] [INFO ] Invariant cache hit.
[2023-03-20 19:09:58] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 19:09:58] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2023-03-20 19:09:58] [INFO ] Flatten gal took : 3 ms
[2023-03-20 19:09:58] [INFO ] Flatten gal took : 2 ms
[2023-03-20 19:09:58] [INFO ] Input system was already deterministic with 6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 2 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 2 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 19:09:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:09:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:09:58] [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:09:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:09:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:09:58] [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 3 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 3 ms. Remains : 7/8 places, 5/6 transitions.
[2023-03-20 19:09:58] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:09:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:09:58] [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 0 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 19:09:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:09:58] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:09:58] [INFO ] Input system was already deterministic with 6 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 0 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 19:09:58] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:09:58] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:09:58] [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:09:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:09:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:09:58] [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:09:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:09:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:09:58] [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:09:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:09:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:09:58] [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:09:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:09:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:09:58] [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:09:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:09:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:09:58] [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:09:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:09:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:09:58] [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 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:09:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:09:58] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:09:58] [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 0 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 19:09:58] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:09:58] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:09:58] [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:09:58] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:09:58] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:09:58] [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:09:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:09:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:09:58] [INFO ] Input system was already deterministic with 6 transitions.
[2023-03-20 19:09:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:09:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:09:58] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-20 19:09:58] [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 1069 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.705sec


RS generation: 0m 2.215sec


-> reachability set: #nodes 75582 (7.6e+04) #states 9,803,780 (6)



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

checking: EF [AX [1<=0]]
normalized: E [true U ~ [EX [~ [1<=0]]]]

abstracting: (1<=0)
states: 0
.-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00100vD-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.107sec

checking: EG [p2<=0]
normalized: EG [p2<=0]

abstracting: (p2<=0)
states: 609,076 (5)
......................................................................................................................................................................................................
EG iterations: 198
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00100vD-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.113sec

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

abstracting: (1<=p7)
states: 8,901,880 (6)
.abstracting: (p6<=0)
states: 901,900 (5)
abstracting: (p2<=0)
states: 609,076 (5)
abstracting: (1<=p7)
states: 8,901,880 (6)
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00100vD-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.508sec

checking: AF [EG [[[AG [p2<=0] | p2<=0] | [p3<=0 | p5<=0]]]]
normalized: ~ [EG [~ [EG [[[p3<=0 | p5<=0] | [p2<=0 | ~ [E [true U ~ [p2<=0]]]]]]]]]

abstracting: (p2<=0)
states: 609,076 (5)
abstracting: (p2<=0)
states: 609,076 (5)
abstracting: (p5<=0)
states: 50
abstracting: (p3<=0)
states: 609,075 (5)
..................................................
EG iterations: 50
...
EG iterations: 3
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00100vD-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.448sec

checking: EF [AX [AG [E [p7<=0 U [[1<=p0 & 1<=p1] & [1<=p3 & 1<=p4]]]]]]
normalized: E [true U ~ [EX [E [true U ~ [E [p7<=0 U [[1<=p3 & 1<=p4] & [1<=p0 & 1<=p1]]]]]]]]

abstracting: (1<=p1)
states: 9,194,705 (6)
abstracting: (1<=p0)
states: 9,487,530 (6)
abstracting: (1<=p4)
states: 9,487,529 (6)
abstracting: (1<=p3)
states: 9,194,705 (6)
abstracting: (p7<=0)
states: 901,900 (5)
.-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00100vD-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.349sec

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

abstracting: (p3<=0)
states: 609,075 (5)
abstracting: (p4<=0)
states: 316,251 (5)
abstracting: (1<=p1)
states: 9,194,705 (6)
abstracting: (1<=p0)
states: 9,487,530 (6)
abstracting: (1<=p2)
states: 9,194,704 (6)
abstracting: (p4<=0)
states: 316,251 (5)
abstracting: (p3<=0)
states: 609,075 (5)
abstracting: (1<=p7)
states: 8,901,880 (6)
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00100vD-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.415sec

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

abstracting: (1<=p5)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,194,705 (6)
abstracting: (1<=p1)
states: 9,194,705 (6)
abstracting: (1<=p0)
states: 9,487,530 (6)
abstracting: (1<=p5)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,194,705 (6)
abstracting: (1<=p6)
states: 8,901,880 (6)

EG iterations: 0
abstracting: (1<=p7)
states: 8,901,880 (6)
...
EG iterations: 2
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00100vD-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.456sec

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

abstracting: (1<=p7)
states: 8,901,880 (6)
.abstracting: (p4<=0)
states: 316,251 (5)
abstracting: (p3<=0)
states: 609,075 (5)
abstracting: (p4<=0)
states: 316,251 (5)
abstracting: (p3<=0)
states: 609,075 (5)
abstracting: (p4<=0)
states: 316,251 (5)
abstracting: (p3<=0)
states: 609,075 (5)
abstracting: (p4<=0)
states: 316,251 (5)
abstracting: (p3<=0)
states: 609,075 (5)
..........................................................................................................................................................................................................
EG iterations: 202
abstracting: (1<=p2)
states: 9,194,704 (6)
abstracting: (1<=p4)
states: 9,487,529 (6)
abstracting: (1<=p3)
states: 9,194,705 (6)
.-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00100vD-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.765sec

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

abstracting: (p6<=0)
states: 901,900 (5)
..
EG iterations: 2
abstracting: (1<=p2)
states: 9,194,704 (6)
abstracting: (1<=p6)
states: 8,901,880 (6)
abstracting: (1<=p1)
states: 9,194,705 (6)
abstracting: (1<=p0)
states: 9,487,530 (6)
.abstracting: (1<=p2)
states: 9,194,704 (6)
abstracting: (1<=p6)
states: 8,901,880 (6)
abstracting: (1<=p2)
states: 9,194,704 (6)
abstracting: (1<=p6)
states: 8,901,880 (6)
.
EG iterations: 1
abstracting: (1<=p4)
states: 9,487,529 (6)
abstracting: (1<=p3)
states: 9,194,705 (6)
abstracting: (1<=p6)
states: 8,901,880 (6)
abstracting: (p6<=0)
states: 901,900 (5)
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00100vD-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.020sec

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

abstracting: (p4<=0)
states: 316,251 (5)
abstracting: (p3<=0)
states: 609,075 (5)
abstracting: (1<=p5)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,194,705 (6)
abstracting: (1<=p7)
states: 8,901,880 (6)
abstracting: (1<=p4)
states: 9,487,529 (6)
abstracting: (1<=p3)
states: 9,194,705 (6)
abstracting: (1<=p6)
states: 8,901,880 (6)
..........................................................................................................................................................................................................................................................
EG iterations: 250
abstracting: (1<=p5)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,194,705 (6)
abstracting: (1<=p5)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,194,705 (6)
abstracting: (1<=p5)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,194,705 (6)

EG iterations: 0
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00100vD-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.250sec

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

abstracting: (p4<=0)
states: 316,251 (5)
abstracting: (p3<=0)
states: 609,075 (5)
.abstracting: (1<=p5)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,194,705 (6)
.abstracting: (p4<=0)
states: 316,251 (5)
abstracting: (p3<=0)
states: 609,075 (5)
..........................................................................................................................................................................................................
EG iterations: 202
abstracting: (p4<=0)
states: 316,251 (5)
abstracting: (p3<=0)
states: 609,075 (5)
.abstracting: (1<=p5)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,194,705 (6)
.abstracting: (p4<=0)
states: 316,251 (5)
abstracting: (p3<=0)
states: 609,075 (5)
.abstracting: (1<=p5)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,194,705 (6)
....
EG iterations: 3
.
EG iterations: 1
abstracting: (1<=p7)
states: 8,901,880 (6)
abstracting: (1<=p2)
states: 9,194,704 (6)
abstracting: (1<=p5)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,194,705 (6)
.-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00100vD-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.211sec

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

abstracting: (1<=p2)
states: 9,194,704 (6)
abstracting: (1<=p5)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,194,705 (6)
abstracting: (1<=p2)
states: 9,194,704 (6)
abstracting: (1<=p2)
states: 9,194,704 (6)
......................................................................................................................................................................................................
EG iterations: 198
abstracting: (1<=p2)
states: 9,194,704 (6)
.abstracting: (1<=p5)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,194,705 (6)
abstracting: (p7<=0)
states: 901,900 (5)
abstracting: (1<=p2)
states: 9,194,704 (6)
abstracting: (1<=p7)
states: 8,901,880 (6)
abstracting: (p4<=0)
states: 316,251 (5)
abstracting: (p3<=0)
states: 609,075 (5)
abstracting: (1<=p1)
states: 9,194,705 (6)
abstracting: (1<=p0)
states: 9,487,530 (6)
abstracting: (1<=p7)
states: 8,901,880 (6)
abstracting: (1<=p1)
states: 9,194,705 (6)
abstracting: (1<=p0)
states: 9,487,530 (6)
abstracting: (1<=p1)
states: 9,194,705 (6)
abstracting: (1<=p0)
states: 9,487,530 (6)
........................................................................................................................................................................................................
EG iterations: 200
..-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00100vD-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.692sec

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

abstracting: (1<=p5)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,194,705 (6)
abstracting: (p2<=0)
states: 609,076 (5)
abstracting: (p5<=0)
states: 50
abstracting: (p3<=0)
states: 609,075 (5)
abstracting: (p6<=0)
states: 901,900 (5)
.abstracting: (p5<=0)
states: 50
abstracting: (p3<=0)
states: 609,075 (5)
abstracting: (1<=p2)
states: 9,194,704 (6)
abstracting: (1<=p7)
states: 8,901,880 (6)
.abstracting: (p2<=0)
states: 609,076 (5)
..
EG iterations: 2
abstracting: (1<=p1)
states: 9,194,705 (6)
abstracting: (1<=p0)
states: 9,487,530 (6)
..
EG iterations: 2
abstracting: (1<=p6)
states: 8,901,880 (6)
abstracting: (p2<=0)
states: 609,076 (5)
..
EG iterations: 2
abstracting: (p2<=0)
states: 609,076 (5)
..
EG iterations: 2
.
EG iterations: 1
......................................................................................................................................................................................................
EG iterations: 198
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00100vD-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.635sec

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

abstracting: (1<=p5)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,194,705 (6)
abstracting: (1<=p6)
states: 8,901,880 (6)
abstracting: (1<=p7)
states: 8,901,880 (6)
abstracting: (1<=p7)
states: 8,901,880 (6)
abstracting: (1<=p7)
states: 8,901,880 (6)
abstracting: (1<=p7)
states: 8,901,880 (6)
.
EG iterations: 1
.abstracting: (1<=p6)
states: 8,901,880 (6)
abstracting: (1<=p4)
states: 9,487,529 (6)
abstracting: (1<=p3)
states: 9,194,705 (6)
abstracting: (p4<=0)
states: 316,251 (5)
abstracting: (p3<=0)
states: 609,075 (5)
.
EG iterations: 1
abstracting: (1<=p5)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,194,705 (6)
abstracting: (1<=p2)
states: 9,194,704 (6)
abstracting: (1<=p4)
states: 9,487,529 (6)
abstracting: (1<=p3)
states: 9,194,705 (6)
abstracting: (1<=p7)
states: 8,901,880 (6)
abstracting: (1<=p2)
states: 9,194,704 (6)
....................................................
EG iterations: 52
abstracting: (p1<=0)
states: 609,075 (5)
abstracting: (p0<=0)
states: 316,250 (5)
..
EG iterations: 2
abstracting: (p1<=0)
states: 609,075 (5)
abstracting: (p0<=0)
states: 316,250 (5)
........................................................................................................................................................................................................
EG iterations: 200
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00100vD-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.177sec

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

abstracting: (1<=p5)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,194,705 (6)
....................................................
EG iterations: 52
.abstracting: (1<=p1)
states: 9,194,705 (6)
abstracting: (1<=p0)
states: 9,487,530 (6)
abstracting: (p4<=0)
states: 316,251 (5)
abstracting: (p3<=0)
states: 609,075 (5)
abstracting: (1<=p5)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,194,705 (6)
abstracting: (p4<=0)
states: 316,251 (5)
abstracting: (p3<=0)
states: 609,075 (5)
abstracting: (p4<=0)
states: 316,251 (5)
abstracting: (p3<=0)
states: 609,075 (5)
..........................................................................................................................................................................................................
EG iterations: 202
abstracting: (1<=p2)
states: 9,194,704 (6)
..
EG iterations: 2
abstracting: (1<=p4)
states: 9,487,529 (6)
abstracting: (1<=p3)
states: 9,194,705 (6)
abstracting: (1<=p2)
states: 9,194,704 (6)
abstracting: (1<=p2)
states: 9,194,704 (6)
..
EG iterations: 2
abstracting: (1<=p2)
states: 9,194,704 (6)
..
EG iterations: 2
......................................................................................................................................................................................................
EG iterations: 198
abstracting: (1<=p1)
states: 9,194,705 (6)
abstracting: (1<=p0)
states: 9,487,530 (6)
abstracting: (p4<=0)
states: 316,251 (5)
abstracting: (p3<=0)
states: 609,075 (5)
abstracting: (1<=p5)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,194,705 (6)
abstracting: (p4<=0)
states: 316,251 (5)
abstracting: (p3<=0)
states: 609,075 (5)
abstracting: (p4<=0)
states: 316,251 (5)
abstracting: (p3<=0)
states: 609,075 (5)
..........................................................................................................................................................................................................
EG iterations: 202
abstracting: (1<=p1)
states: 9,194,705 (6)
abstracting: (1<=p0)
states: 9,487,530 (6)
abstracting: (p4<=0)
states: 316,251 (5)
abstracting: (p3<=0)
states: 609,075 (5)
abstracting: (1<=p5)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,194,705 (6)
abstracting: (p4<=0)
states: 316,251 (5)
abstracting: (p3<=0)
states: 609,075 (5)
abstracting: (p4<=0)
states: 316,251 (5)
abstracting: (p3<=0)
states: 609,075 (5)
..........................................................................................................................................................................................................
EG iterations: 202
......................................................................................................................................................................................................
EG iterations: 198
abstracting: (p1<=0)
states: 609,075 (5)
abstracting: (p0<=0)
states: 316,250 (5)
abstracting: (p1<=0)
states: 609,075 (5)
abstracting: (p0<=0)
states: 316,250 (5)
abstracting: (p6<=0)
states: 901,900 (5)
abstracting: (p6<=0)
states: 901,900 (5)
abstracting: (1<=p5)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,194,705 (6)
abstracting: (1<=p1)
states: 9,194,705 (6)
abstracting: (1<=p0)
states: 9,487,530 (6)
abstracting: (1<=p5)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,194,705 (6)
abstracting: (1<=p5)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,194,705 (6)
....................................................
EG iterations: 52
...
EG iterations: 2
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00100vD-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.314sec

totally nodes used: 5819204 (5.8e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 163220979 21732999 184953978
used/not used/entry size/cache size: 18908884 48199980 16 1024MB
basic ops cache: hits/miss/sum: 67306323 9324007 76630330
used/not used/entry size/cache size: 8414853 8362363 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: 968694 365822 1334516
used/not used/entry size/cache size: 357600 8031008 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 62217902
1 4272818
2 478628
3 81055
4 40585
5 6326
6 1561
7 446
8 5294
9 456
>= 10 3793

Total processing time: 1m 7.010sec


BK_STOP 1679339466364

--------------------
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:1348 (224), effective:447 (74)

initing FirstDep: 0m 0.000sec


iterations count:904 (150), effective:349 (58)

iterations count:404 (67), effective:149 (24)

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

iterations count:22 (3), effective:7 (1)

iterations count:256 (42), effective:150 (25)

iterations count:904 (150), effective:349 (58)

iterations count:26 (4), effective:7 (1)

iterations count:31 (5), effective:7 (1)

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

iterations count:106 (17), effective:50 (8)

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

iterations count:456 (76), effective:200 (33)

iterations count:594 (99), effective:222 (37)

iterations count:106 (17), effective:50 (8)

iterations count:256 (42), effective:50 (8)

iterations count:106 (17), effective:50 (8)

iterations count:104 (17), effective:49 (8)

iterations count:106 (17), effective:50 (8)

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

iterations count:106 (17), effective:50 (8)

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

iterations count:23 (3), effective:6 (1)

iterations count:106 (17), effective:50 (8)

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

iterations count:206 (34), effective:50 (8)

iterations count:106 (17), effective:50 (8)

iterations count:104 (17), effective:49 (8)

iterations count:300 (50), effective:98 (16)

iterations count:17 (2), effective:3 (0)

iterations count:356 (59), effective:100 (16)

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

iterations count:22 (3), effective:6 (1)

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

iterations count:106 (17), effective:50 (8)

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

iterations count:106 (17), effective:50 (8)

iterations count:104 (17), effective:49 (8)

iterations count:106 (17), effective:50 (8)

iterations count:56 (9), effective:50 (8)

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

tar xzf /home/mcc/BenchKit/INPUTS/TwoPhaseLocking-PT-nC00100vD.tgz
mv TwoPhaseLocking-PT-nC00100vD execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;