About the Execution of Marcie+red for TwoPhaseLocking-PT-nC00100vN
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
7631.172 | 81332.00 | 84787.00 | 334.70 | FTTFTFFFFFFTFFFT | 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-167912709200842.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-nC00100vN, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912709200842
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.6K Feb 25 17:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 17:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 17:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 17:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 18K Feb 25 17:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 25 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 25 17:50 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-nC00100vN-CTLFireability-00
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-01
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-02
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-03
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-04
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-05
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-06
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-07
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-08
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-09
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-10
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-11
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-12
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-13
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-14
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679339568054
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-nC00100vN
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 19:12:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 19:12:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 19:12:49] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-03-20 19:12:49] [INFO ] Transformed 8 places.
[2023-03-20 19:12:49] [INFO ] Transformed 6 transitions.
[2023-03-20 19:12:49] [INFO ] Parsed PT model containing 8 places and 6 transitions and 18 arcs in 97 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 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 15 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:12:49] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-20 19:12:50] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-20 19:12:50] [INFO ] Invariant cache hit.
[2023-03-20 19:12:50] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2023-03-20 19:12:50] [INFO ] Invariant cache hit.
[2023-03-20 19:12:50] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 408 ms. Remains : 8/8 places, 6/6 transitions.
Support contains 8 out of 8 places after structural reductions.
[2023-03-20 19:12:50] [INFO ] Flatten gal took : 15 ms
[2023-03-20 19:12:50] [INFO ] Flatten gal took : 3 ms
[2023-03-20 19:12:50] [INFO ] Input system was already deterministic with 6 transitions.
Incomplete random walk after 10012 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 25) seen :24
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 19:12:50] [INFO ] Invariant cache hit.
[2023-03-20 19:12:50] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-20 19:12:50] [INFO ] Flatten gal took : 2 ms
[2023-03-20 19:12:50] [INFO ] Flatten gal took : 2 ms
[2023-03-20 19:12:50] [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:12:50] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:12:50] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:12:50] [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:12:50] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:12:50] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:12:50] [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 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:12:50] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:12:50] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:12:50] [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:12:50] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:12:50] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:12:50] [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 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:12:50] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:12:50] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:12:50] [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:12:50] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:12:50] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:12:50] [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:12:50] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:12:50] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:12:50] [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:12:50] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:12:50] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:12:50] [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:12:50] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:12:50] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:12:50] [INFO ] Input system was already deterministic with 4 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:12:50] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:12:50] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:12:50] [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:12:50] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:12:50] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:12:50] [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 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:12:50] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:12:50] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:12:50] [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:12:50] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:12:50] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:12:50] [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
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:12:50] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:12:50] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:12:50] [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 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:12:50] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:12:50] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:12:50] [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 0 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 19:12:50] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:12:50] [INFO ] Flatten gal took : 0 ms
[2023-03-20 19:12:50] [INFO ] Input system was already deterministic with 6 transitions.
[2023-03-20 19:12:50] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:12:50] [INFO ] Flatten gal took : 1 ms
[2023-03-20 19:12:50] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-20 19:12:50] [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 1074 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.823sec
RS generation: 0m 2.294sec
-> reachability set: #nodes 77010 (7.7e+04) #states 10,119,981 (7)
starting MCC model checker
--------------------------
checking: EF [EG [[p3<=0 | p4<=0]]]
normalized: E [true U EG [[p3<=0 | p4<=0]]]
abstracting: (p4<=0)
states: 316,251 (5)
abstracting: (p3<=0)
states: 632,451 (5)
..........................................................................................................................................................................................................
EG iterations: 202
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m11.822sec
checking: EF [AG [[1<=p2 & EX [[1<=p0 & 1<=p1]]]]]
normalized: E [true U ~ [E [true U ~ [[1<=p2 & EX [[1<=p0 & 1<=p1]]]]]]]
abstracting: (1<=p1)
states: 9,487,480 (6)
abstracting: (1<=p0)
states: 9,803,781 (6)
.abstracting: (1<=p2)
states: 9,487,480 (6)
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.231sec
checking: EG [AF [[1<=p6 & [1<=p3 & 1<=p4]]]]
normalized: EG [~ [EG [~ [[1<=p6 & [1<=p3 & 1<=p4]]]]]]
abstracting: (1<=p4)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,487,530 (6)
abstracting: (1<=p6)
states: 9,194,705 (6)
..................................................................................................................................................................................................
EG iterations: 194
...
EG iterations: 3
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m12.213sec
checking: A [p2<=0 U EG [[1<=p2 & EF [AG [~ [[p0<=0 | p1<=0]]]]]]]
normalized: [~ [EG [~ [EG [[1<=p2 & E [true U ~ [E [true U [p0<=0 | p1<=0]]]]]]]]] & ~ [E [~ [EG [[1<=p2 & E [true U ~ [E [true U [p0<=0 | p1<=0]]]]]]] U [~ [p2<=0] & ~ [EG [[1<=p2 & E [true U ~ [E [true U [p0<=0 | p1<=0]]]]]]]]]]]
abstracting: (p1<=0)
states: 632,501 (5)
abstracting: (p0<=0)
states: 316,200 (5)
abstracting: (1<=p2)
states: 9,487,480 (6)
.
EG iterations: 1
abstracting: (p2<=0)
states: 632,501 (5)
abstracting: (p1<=0)
states: 632,501 (5)
abstracting: (p0<=0)
states: 316,200 (5)
abstracting: (1<=p2)
states: 9,487,480 (6)
.
EG iterations: 1
abstracting: (p1<=0)
states: 632,501 (5)
abstracting: (p0<=0)
states: 316,200 (5)
abstracting: (1<=p2)
states: 9,487,480 (6)
.
EG iterations: 1
EG iterations: 0
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.356sec
checking: EF [EX [[EF [[1<=p6 & [1<=p7 & 1<=p2]]] & EG [~ [A [1<=p7 U 1<=p7]]]]]]
normalized: E [true U EX [[EG [~ [[~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [1<=p7] & ~ [1<=p7]]]]]]] & E [true U [1<=p6 & [1<=p7 & 1<=p2]]]]]]
abstracting: (1<=p2)
states: 9,487,480 (6)
abstracting: (1<=p7)
states: 9,194,705 (6)
abstracting: (1<=p6)
states: 9,194,705 (6)
abstracting: (1<=p7)
states: 9,194,705 (6)
abstracting: (1<=p7)
states: 9,194,705 (6)
abstracting: (1<=p7)
states: 9,194,705 (6)
abstracting: (1<=p7)
states: 9,194,705 (6)
..............................................................................................................................................................................................................................................................
EG iterations: 254
..............................................................................................................................................................................................................................................................
EG iterations: 254
.-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 9.016sec
checking: EF [EG [E [~ [EX [1<=p2]] U ~ [[[[1<=p3 & 1<=p4] | 1<=p2] & AF [1<=p2]]]]]]
normalized: E [true U EG [E [~ [EX [1<=p2]] U ~ [[~ [EG [~ [1<=p2]]] & [1<=p2 | [1<=p3 & 1<=p4]]]]]]]
abstracting: (1<=p4)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,487,530 (6)
abstracting: (1<=p2)
states: 9,487,480 (6)
abstracting: (1<=p2)
states: 9,487,480 (6)
.............................................................................................................................................................................................................
EG iterations: 205
abstracting: (1<=p2)
states: 9,487,480 (6)
..............................................................................................................................................................................................................
EG iterations: 205
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.362sec
checking: EG [[[~ [A [1<=p6 U EX [1<=p7]]] & 1<=p3] & [1<=p5 & [AG [AF [1<=p2]] | 1<=p2]]]]
normalized: EG [[[1<=p5 & [1<=p2 | ~ [E [true U EG [~ [1<=p2]]]]]] & [1<=p3 & ~ [[~ [EG [~ [EX [1<=p7]]]] & ~ [E [~ [EX [1<=p7]] U [~ [1<=p6] & ~ [EX [1<=p7]]]]]]]]]]
abstracting: (1<=p7)
states: 9,194,705 (6)
.abstracting: (1<=p6)
states: 9,194,705 (6)
abstracting: (1<=p7)
states: 9,194,705 (6)
.abstracting: (1<=p7)
states: 9,194,705 (6)
.........................................................................................................................................................
EG iterations: 152
abstracting: (1<=p3)
states: 9,487,530 (6)
abstracting: (1<=p2)
states: 9,487,480 (6)
.............................................................................................................................................................................................................
EG iterations: 205
abstracting: (1<=p2)
states: 9,487,480 (6)
abstracting: (1<=p5)
states: 10,119,780 (7)
....................................................................................................
EG iterations: 100
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.256sec
checking: [EG [p2<=0] | EG [[A [1<=p6 U 1<=p6] & [[1<=p2 | p6<=0] & EX [AG [[p3<=0 | p5<=0]]]]]]]
normalized: [EG [[[EX [~ [E [true U ~ [[p3<=0 | p5<=0]]]]] & [1<=p2 | p6<=0]] & [~ [EG [~ [1<=p6]]] & ~ [E [~ [1<=p6] U [~ [1<=p6] & ~ [1<=p6]]]]]]] | EG [p2<=0]]
abstracting: (p2<=0)
states: 632,501 (5)
.............................................................................................................................................................................................................
EG iterations: 205
abstracting: (1<=p6)
states: 9,194,705 (6)
abstracting: (1<=p6)
states: 9,194,705 (6)
abstracting: (1<=p6)
states: 9,194,705 (6)
abstracting: (1<=p6)
states: 9,194,705 (6)
..............................................................................................................................................................................................................................................................
EG iterations: 254
abstracting: (p6<=0)
states: 925,276 (5)
abstracting: (1<=p2)
states: 9,487,480 (6)
abstracting: (p5<=0)
states: 201
abstracting: (p3<=0)
states: 632,451 (5)
..
EG iterations: 1
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 8.493sec
checking: ~ [A [~ [[~ [[1<=p3 & 1<=p4]] & [EG [~ [[p0<=0 | p1<=0]]] | p2<=0]]] U [EF [[1<=p2 & 1<=p7]] & ~ [AF [1<=p7]]]]]
normalized: ~ [[~ [EG [~ [[EG [~ [1<=p7]] & E [true U [1<=p2 & 1<=p7]]]]]] & ~ [E [~ [[EG [~ [1<=p7]] & E [true U [1<=p2 & 1<=p7]]]] U [[[p2<=0 | EG [~ [[p0<=0 | p1<=0]]]] & ~ [[1<=p3 & 1<=p4]]] & ~ [[EG [~ [1<=p7]] & E [true U [1<=p2 & 1<=p7]]]]]]]]]
abstracting: (1<=p7)
states: 9,194,705 (6)
abstracting: (1<=p2)
states: 9,487,480 (6)
abstracting: (1<=p7)
states: 9,194,705 (6)
..............................................................................................................................................................................................................................................................
EG iterations: 254
abstracting: (1<=p4)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,487,530 (6)
abstracting: (p1<=0)
states: 632,501 (5)
abstracting: (p0<=0)
states: 316,200 (5)
..
EG iterations: 2
abstracting: (p2<=0)
states: 632,501 (5)
abstracting: (1<=p7)
states: 9,194,705 (6)
abstracting: (1<=p2)
states: 9,487,480 (6)
abstracting: (1<=p7)
states: 9,194,705 (6)
..............................................................................................................................................................................................................................................................
EG iterations: 254
abstracting: (1<=p7)
states: 9,194,705 (6)
abstracting: (1<=p2)
states: 9,487,480 (6)
abstracting: (1<=p7)
states: 9,194,705 (6)
..............................................................................................................................................................................................................................................................
EG iterations: 254
EG iterations: 0
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.428sec
checking: AG [[[EG [1<=p6] | AF [[1<=p3 & 1<=p5]]] | [AG [[p3<=0 | p4<=0]] | [p2<=0 | [1<=p3 & 1<=p4]]]]]
normalized: ~ [E [true U ~ [[[[p2<=0 | [1<=p3 & 1<=p4]] | ~ [E [true U ~ [[p3<=0 | p4<=0]]]]] | [~ [EG [~ [[1<=p3 & 1<=p5]]]] | EG [1<=p6]]]]]]
abstracting: (1<=p6)
states: 9,194,705 (6)
..
EG iterations: 2
abstracting: (1<=p5)
states: 10,119,780 (7)
abstracting: (1<=p3)
states: 9,487,530 (6)
..........................................................................................................................................................................................................
EG iterations: 202
abstracting: (p4<=0)
states: 316,251 (5)
abstracting: (p3<=0)
states: 632,451 (5)
abstracting: (1<=p4)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,487,530 (6)
abstracting: (p2<=0)
states: 632,501 (5)
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.718sec
checking: AG [AF [E [[~ [[1<=p3 & 1<=p4]] | ~ [[[1<=p3 & 1<=p5] & [1<=p0 & 1<=p1]]]] U AF [[1<=p7 | 1<=p2]]]]]
normalized: ~ [E [true U EG [~ [E [[~ [[[1<=p0 & 1<=p1] & [1<=p3 & 1<=p5]]] | ~ [[1<=p3 & 1<=p4]]] U ~ [EG [~ [[1<=p7 | 1<=p2]]]]]]]]]
abstracting: (1<=p2)
states: 9,487,480 (6)
abstracting: (1<=p7)
states: 9,194,705 (6)
............................................................................................................................................................................................................
EG iterations: 204
abstracting: (1<=p4)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,487,530 (6)
abstracting: (1<=p5)
states: 10,119,780 (7)
abstracting: (1<=p3)
states: 9,487,530 (6)
abstracting: (1<=p1)
states: 9,487,480 (6)
abstracting: (1<=p0)
states: 9,803,781 (6)
.
EG iterations: 1
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.122sec
checking: E [EF [[[1<=p2 & AG [[1<=p3 & 1<=p4]]] & [AG [1<=p7] & E [~ [[p0<=0 | p1<=0]] U 1<=p6]]]] U AX [[1<=p3 & 1<=p4]]]
normalized: E [E [true U [[E [~ [[p0<=0 | p1<=0]] U 1<=p6] & ~ [E [true U ~ [1<=p7]]]] & [1<=p2 & ~ [E [true U ~ [[1<=p3 & 1<=p4]]]]]]] U ~ [EX [~ [[1<=p3 & 1<=p4]]]]]
abstracting: (1<=p4)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,487,530 (6)
.abstracting: (1<=p4)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,487,530 (6)
abstracting: (1<=p2)
states: 9,487,480 (6)
abstracting: (1<=p7)
states: 9,194,705 (6)
abstracting: (1<=p6)
states: 9,194,705 (6)
abstracting: (p1<=0)
states: 632,501 (5)
abstracting: (p0<=0)
states: 316,200 (5)
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.836sec
checking: AG [[EF [[[~ [A [~ [[p0<=0 | p1<=0]] U ~ [[p3<=0 | p5<=0]]]] | [p6<=0 & p7<=0]] | [p7<=0 | [p0<=0 | p1<=0]]]] | [p0<=0 | p1<=0]]]
normalized: ~ [E [true U ~ [[[p0<=0 | p1<=0] | E [true U [[p7<=0 | [p0<=0 | p1<=0]] | [[p6<=0 & p7<=0] | ~ [[~ [EG [[p3<=0 | p5<=0]]] & ~ [E [[p3<=0 | p5<=0] U [[p0<=0 | p1<=0] & [p3<=0 | p5<=0]]]]]]]]]]]]]
abstracting: (p5<=0)
states: 201
abstracting: (p3<=0)
states: 632,451 (5)
abstracting: (p1<=0)
states: 632,501 (5)
abstracting: (p0<=0)
states: 316,200 (5)
abstracting: (p5<=0)
states: 201
abstracting: (p3<=0)
states: 632,451 (5)
abstracting: (p5<=0)
states: 201
abstracting: (p3<=0)
states: 632,451 (5)
..........................................................................................................................................................................................................
EG iterations: 202
abstracting: (p7<=0)
states: 925,276 (5)
abstracting: (p6<=0)
states: 925,276 (5)
abstracting: (p1<=0)
states: 632,501 (5)
abstracting: (p0<=0)
states: 316,200 (5)
abstracting: (p7<=0)
states: 925,276 (5)
abstracting: (p1<=0)
states: 632,501 (5)
abstracting: (p0<=0)
states: 316,200 (5)
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.340sec
checking: AX [[AX [AF [1<=p7]] & [[~ [A [p6<=0 U [[1<=p3 & 1<=p5] | [1<=p3 & 1<=p4]]]] | p3<=0] | [p4<=0 | [EX [[p0<=0 | p1<=0]] & [1<=p7 | [p3<=0 | p4<=0]]]]]]]
normalized: ~ [EX [~ [[[[p4<=0 | [[1<=p7 | [p3<=0 | p4<=0]] & EX [[p0<=0 | p1<=0]]]] | [p3<=0 | ~ [[~ [EG [~ [[[1<=p3 & 1<=p4] | [1<=p3 & 1<=p5]]]]] & ~ [E [~ [[[1<=p3 & 1<=p4] | [1<=p3 & 1<=p5]]] U [~ [p6<=0] & ~ [[[1<=p3 & 1<=p4] | [1<=p3 & 1<=p5]]]]]]]]]] & ~ [EX [EG [~ [1<=p7]]]]]]]]
abstracting: (1<=p7)
states: 9,194,705 (6)
..............................................................................................................................................................................................................................................................
EG iterations: 254
.abstracting: (1<=p5)
states: 10,119,780 (7)
abstracting: (1<=p3)
states: 9,487,530 (6)
abstracting: (1<=p4)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,487,530 (6)
abstracting: (p6<=0)
states: 925,276 (5)
abstracting: (1<=p5)
states: 10,119,780 (7)
abstracting: (1<=p3)
states: 9,487,530 (6)
abstracting: (1<=p4)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,487,530 (6)
abstracting: (1<=p5)
states: 10,119,780 (7)
abstracting: (1<=p3)
states: 9,487,530 (6)
abstracting: (1<=p4)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,487,530 (6)
....................................................
EG iterations: 52
abstracting: (p3<=0)
states: 632,451 (5)
abstracting: (p1<=0)
states: 632,501 (5)
abstracting: (p0<=0)
states: 316,200 (5)
.abstracting: (p4<=0)
states: 316,251 (5)
abstracting: (p3<=0)
states: 632,451 (5)
abstracting: (1<=p7)
states: 9,194,705 (6)
abstracting: (p4<=0)
states: 316,251 (5)
.-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.484sec
checking: AF [[AX [EG [[p3<=0 | p4<=0]]] | [[EX [p6<=0] & [AF [p6<=0] & ~ [E [~ [[p0<=0 | p1<=0]] U EF [1<=p6]]]]] | [EG [[1<=p3 & 1<=p4]] & EX [[AG [[1<=p0 & [1<=p1 & 1<=p2]]] & 1<=p7]]]]]]
normalized: ~ [EG [~ [[[[EX [[1<=p7 & ~ [E [true U ~ [[1<=p0 & [1<=p1 & 1<=p2]]]]]]] & EG [[1<=p3 & 1<=p4]]] | [[~ [E [~ [[p0<=0 | p1<=0]] U E [true U 1<=p6]]] & ~ [EG [~ [p6<=0]]]] & EX [p6<=0]]] | ~ [EX [~ [EG [[p3<=0 | p4<=0]]]]]]]]]
abstracting: (p4<=0)
states: 316,251 (5)
abstracting: (p3<=0)
states: 632,451 (5)
..........................................................................................................................................................................................................
EG iterations: 202
.abstracting: (p6<=0)
states: 925,276 (5)
.abstracting: (p6<=0)
states: 925,276 (5)
..
EG iterations: 2
abstracting: (1<=p6)
states: 9,194,705 (6)
abstracting: (p1<=0)
states: 632,501 (5)
abstracting: (p0<=0)
states: 316,200 (5)
abstracting: (1<=p4)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,487,530 (6)
..
EG iterations: 2
abstracting: (1<=p2)
states: 9,487,480 (6)
abstracting: (1<=p1)
states: 9,487,480 (6)
abstracting: (1<=p0)
states: 9,803,781 (6)
abstracting: (1<=p7)
states: 9,194,705 (6)
.
EG iterations: 0
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.956sec
checking: [AG [[A [E [[1<=p3 & 1<=p4] U [1<=p6 | 1<=p2]] U [AF [1<=p6] & [p3<=0 | p5<=0]]] & [1<=p3 & 1<=p4]]] | [EX [E [EF [[p0<=0 | p1<=0]] U EX [[1<=p0 & [1<=p1 & 1<=p6]]]]] & A [1<=p2 U AG [E [1<=p6 U E [~ [[p0<=0 | p1<=0]] U ~ [[p3<=0 | p5<=0]]]]]]]]
normalized: [[[~ [EG [E [true U ~ [E [1<=p6 U E [~ [[p0<=0 | p1<=0]] U ~ [[p3<=0 | p5<=0]]]]]]]] & ~ [E [E [true U ~ [E [1<=p6 U E [~ [[p0<=0 | p1<=0]] U ~ [[p3<=0 | p5<=0]]]]]] U [~ [1<=p2] & E [true U ~ [E [1<=p6 U E [~ [[p0<=0 | p1<=0]] U ~ [[p3<=0 | p5<=0]]]]]]]]]] & EX [E [E [true U [p0<=0 | p1<=0]] U EX [[1<=p0 & [1<=p1 & 1<=p6]]]]]] | ~ [E [true U ~ [[[1<=p3 & 1<=p4] & [~ [EG [~ [[[p3<=0 | p5<=0] & ~ [EG [~ [1<=p6]]]]]]] & ~ [E [~ [[[p3<=0 | p5<=0] & ~ [EG [~ [1<=p6]]]]] U [~ [E [[1<=p3 & 1<=p4] U [1<=p6 | 1<=p2]]] & ~ [[[p3<=0 | p5<=0] & ~ [EG [~ [1<=p6]]]]]]]]]]]]]]
abstracting: (1<=p6)
states: 9,194,705 (6)
..............................................................................................................................................................................................................................................................
EG iterations: 254
abstracting: (p5<=0)
states: 201
abstracting: (p3<=0)
states: 632,451 (5)
abstracting: (1<=p2)
states: 9,487,480 (6)
abstracting: (1<=p6)
states: 9,194,705 (6)
abstracting: (1<=p4)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,487,530 (6)
abstracting: (1<=p6)
states: 9,194,705 (6)
..............................................................................................................................................................................................................................................................
EG iterations: 254
abstracting: (p5<=0)
states: 201
abstracting: (p3<=0)
states: 632,451 (5)
abstracting: (1<=p6)
states: 9,194,705 (6)
..............................................................................................................................................................................................................................................................
EG iterations: 254
abstracting: (p5<=0)
states: 201
abstracting: (p3<=0)
states: 632,451 (5)
.
EG iterations: 1
abstracting: (1<=p4)
states: 9,803,730 (6)
abstracting: (1<=p3)
states: 9,487,530 (6)
abstracting: (1<=p6)
states: 9,194,705 (6)
abstracting: (1<=p1)
states: 9,487,480 (6)
abstracting: (1<=p0)
states: 9,803,781 (6)
.abstracting: (p1<=0)
states: 632,501 (5)
abstracting: (p0<=0)
states: 316,200 (5)
.abstracting: (p5<=0)
states: 201
abstracting: (p3<=0)
states: 632,451 (5)
abstracting: (p1<=0)
states: 632,501 (5)
abstracting: (p0<=0)
states: 316,200 (5)
abstracting: (1<=p6)
states: 9,194,705 (6)
abstracting: (1<=p2)
states: 9,487,480 (6)
abstracting: (p5<=0)
states: 201
abstracting: (p3<=0)
states: 632,451 (5)
abstracting: (p1<=0)
states: 632,501 (5)
abstracting: (p0<=0)
states: 316,200 (5)
abstracting: (1<=p6)
states: 9,194,705 (6)
abstracting: (p5<=0)
states: 201
abstracting: (p3<=0)
states: 632,451 (5)
abstracting: (p1<=0)
states: 632,501 (5)
abstracting: (p0<=0)
states: 316,200 (5)
abstracting: (1<=p6)
states: 9,194,705 (6)
EG iterations: 0
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m14.387sec
totally nodes used: 5581379 (5.6e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 148639470 24314370 172953840
used/not used/entry size/cache size: 20452685 46656179 16 1024MB
basic ops cache: hits/miss/sum: 54289262 10229373 64518635
used/not used/entry size/cache size: 8290212 8487004 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: 992015 372887 1364902
used/not used/entry size/cache size: 364223 8024385 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 62283590
1 4342079
2 412605
3 44110
4 13944
5 2429
6 1544
7 645
8 503
9 318
>= 10 7097
Total processing time: 1m17.869sec
BK_STOP 1679339649386
--------------------
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:1256 (209), effective:400 (66)
initing FirstDep: 0m 0.000sec
iterations count:249 (41), effective:146 (24)
iterations count:56 (9), effective:50 (8)
iterations count:56 (9), effective:50 (8)
iterations count:23 (3), effective:5 (0)
iterations count:56 (9), effective:50 (8)
iterations count:66 (11), effective:20 (3)
iterations count:6 (1), effective:0 (0)
iterations count:209 (34), effective:100 (16)
iterations count:6 (1), effective:0 (0)
iterations count:6 (1), effective:0 (0)
iterations count:29 (4), effective:7 (1)
iterations count:44 (7), effective:12 (2)
iterations count:44 (7), effective:12 (2)
iterations count:209 (34), effective:100 (16)
iterations count:44 (7), effective:12 (2)
iterations count:26 (4), effective:7 (1)
iterations count:6 (1), effective:0 (0)
iterations count:111 (18), effective:51 (8)
iterations count:206 (34), effective:50 (8)
iterations count:7 (1), effective:1 (0)
iterations count:6 (1), effective:0 (0)
iterations count:56 (9), effective:50 (8)
iterations count:54 (9), effective:48 (8)
iterations count:11 (1), effective:2 (0)
iterations count:20 (3), effective:5 (0)
iterations count:6 (1), effective:0 (0)
iterations count:55 (9), effective:49 (8)
iterations count:18 (3), effective:4 (0)
iterations count:966 (161), effective:302 (50)
iterations count:13 (2), effective:2 (0)
iterations count:56 (9), effective:50 (8)
iterations count:55 (9), effective:15 (2)
iterations count:18 (3), effective:4 (0)
iterations count:17 (2), effective:3 (0)
iterations count:604 (100), effective:249 (41)
iterations count:18 (3), effective:4 (0)
iterations count:17 (2), effective:3 (0)
iterations count:604 (100), effective:249 (41)
iterations count:106 (17), effective:50 (8)
iterations count:18 (3), effective:4 (0)
iterations count:17 (2), effective:3 (0)
iterations count:604 (100), effective:249 (41)
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-nC00100vN"
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-nC00100vN, 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-167912709200842"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TwoPhaseLocking-PT-nC00100vN.tgz
mv TwoPhaseLocking-PT-nC00100vN 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 ;