About the Execution of Marcie+red for ClientsAndServers-PT-N0002P1
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6998.283 | 59503.00 | 64854.00 | 713.20 | TFTFFFTFFFFTTTTF | 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.r074-smll-167814400000218.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 ClientsAndServers-PT-N0002P1, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-167814400000218
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.6K Feb 26 13:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 13:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 13:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 13:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 13:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 26 13:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 13:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.2K Mar 5 18:22 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 ClientsAndServers-PT-N0002P1-CTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0002P1-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678333928898
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=ClientsAndServers-PT-N0002P1
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 03:52:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 03:52:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 03:52:11] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2023-03-09 03:52:11] [INFO ] Transformed 25 places.
[2023-03-09 03:52:11] [INFO ] Transformed 18 transitions.
[2023-03-09 03:52:11] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 134 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Support contains 25 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 15 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-09 03:52:12] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-09 03:52:12] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-09 03:52:12] [INFO ] Invariant cache hit.
[2023-03-09 03:52:12] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
[2023-03-09 03:52:12] [INFO ] Invariant cache hit.
[2023-03-09 03:52:12] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 576 ms. Remains : 25/25 places, 18/18 transitions.
Support contains 25 out of 25 places after structural reductions.
[2023-03-09 03:52:12] [INFO ] Flatten gal took : 34 ms
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 13 ms
[2023-03-09 03:52:13] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 559 steps, including 0 resets, run visited all 38 properties in 104 ms. (steps per millisecond=5 )
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 7 ms
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 9 ms
[2023-03-09 03:52:13] [INFO ] Input system was already deterministic with 18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 3 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 22/25 places, 18/18 transitions.
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 4 ms
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 13 ms
[2023-03-09 03:52:13] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 2 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 24/25 places, 18/18 transitions.
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 4 ms
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 4 ms
[2023-03-09 03:52:13] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 2 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 22/25 places, 18/18 transitions.
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 4 ms
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 4 ms
[2023-03-09 03:52:13] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 2 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 23/25 places, 18/18 transitions.
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 4 ms
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:52:13] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 2 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 23/25 places, 18/18 transitions.
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:52:13] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 24/25 places, 18/18 transitions.
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 4 ms
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 4 ms
[2023-03-09 03:52:13] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/25 places, 18/18 transitions.
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:52:13] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 2 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 22/25 places, 18/18 transitions.
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:52:13] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 21/25 places, 18/18 transitions.
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:52:13] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 21/25 places, 18/18 transitions.
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:52:13] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 2 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 23/25 places, 18/18 transitions.
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:52:13] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 1 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 23/25 places, 18/18 transitions.
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:52:13] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 1 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 23/25 places, 18/18 transitions.
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:52:13] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/25 places, 18/18 transitions.
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:52:13] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/25 places, 18/18 transitions.
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:52:13] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 22/25 places, 18/18 transitions.
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:52:13] [INFO ] Input system was already deterministic with 18 transitions.
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 4 ms
[2023-03-09 03:52:13] [INFO ] Flatten gal took : 4 ms
[2023-03-09 03:52:13] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-09 03:52:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 25 places, 18 transitions and 54 arcs took 1 ms.
Total runtime 1869 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: 25 NrTr: 18 NrArc: 54)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.332sec
RS generation: 0m 0.835sec
-> reachability set: #nodes 26665 (2.7e+04) #states 12,462,173 (7)
starting MCC model checker
--------------------------
checking: AX [EF [AG [[1<=p0 & 1<=p13]]]]
normalized: ~ [EX [~ [E [true U ~ [E [true U ~ [[1<=p0 & 1<=p13]]]]]]]]
abstracting: (1<=p13)
states: 2,952,016 (6)
abstracting: (1<=p0)
states: 12,441,793 (7)
.-> the formula is FALSE
FORMULA ClientsAndServers-PT-N0002P1-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.375sec
checking: A [~ [AX [1<=p20]] U [1<=p7 & 1<=p23]]
normalized: [~ [EG [~ [[1<=p7 & 1<=p23]]]] & ~ [E [~ [[1<=p7 & 1<=p23]] U [~ [EX [~ [1<=p20]]] & ~ [[1<=p7 & 1<=p23]]]]]]
abstracting: (1<=p23)
states: 12,355,613 (7)
abstracting: (1<=p7)
states: 8,885,216 (6)
abstracting: (1<=p20)
states: 3,075,776 (6)
.abstracting: (1<=p23)
states: 12,355,613 (7)
abstracting: (1<=p7)
states: 8,885,216 (6)
abstracting: (1<=p23)
states: 12,355,613 (7)
abstracting: (1<=p7)
states: 8,885,216 (6)
..........................................................................................................................................................................................
EG iterations: 186
-> the formula is TRUE
FORMULA ClientsAndServers-PT-N0002P1-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.434sec
checking: AX [~ [A [~ [[AF [1<=p12] & EG [1<=p6]]] U [1<=p5 & 1<=p15]]]]
normalized: ~ [EX [[~ [EG [~ [[1<=p5 & 1<=p15]]]] & ~ [E [~ [[1<=p5 & 1<=p15]] U [[EG [1<=p6] & ~ [EG [~ [1<=p12]]]] & ~ [[1<=p5 & 1<=p15]]]]]]]]
abstracting: (1<=p15)
states: 4,232,133 (6)
abstracting: (1<=p5)
states: 8,885,216 (6)
abstracting: (1<=p12)
states: 2,952,016 (6)
.....................................................................................................................................................................................................
EG iterations: 197
abstracting: (1<=p6)
states: 3,075,776 (6)
.
EG iterations: 1
abstracting: (1<=p15)
states: 4,232,133 (6)
abstracting: (1<=p5)
states: 8,885,216 (6)
abstracting: (1<=p15)
states: 4,232,133 (6)
abstracting: (1<=p5)
states: 8,885,216 (6)
..............................................................................................................................................................................................
EG iterations: 190
.-> the formula is FALSE
FORMULA ClientsAndServers-PT-N0002P1-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m10.481sec
checking: AX [AG [AF [[[p7<=0 | p23<=0] & [[p11<=0 | p17<=0] & [p1<=0 | p19<=0]]]]]]
normalized: ~ [EX [E [true U EG [~ [[[[p1<=0 | p19<=0] & [p11<=0 | p17<=0]] & [p7<=0 | p23<=0]]]]]]]
abstracting: (p23<=0)
states: 106,560 (5)
abstracting: (p7<=0)
states: 3,576,957 (6)
abstracting: (p17<=0)
states: 3,602,249 (6)
abstracting: (p11<=0)
states: 9,386,397 (6)
abstracting: (p19<=0)
states: 3,602,249 (6)
abstracting: (p1<=0)
states: 9,386,397 (6)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA ClientsAndServers-PT-N0002P1-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.579sec
checking: A [[1<=p5 & 1<=p15] U AG [A [[EX [1<=p24] | [1<=p1 & 1<=p19]] U ~ [AF [1<=p9]]]]]
normalized: [~ [EG [E [true U ~ [[~ [EG [~ [EG [~ [1<=p9]]]]] & ~ [E [~ [EG [~ [1<=p9]]] U [~ [[[1<=p1 & 1<=p19] | EX [1<=p24]]] & ~ [EG [~ [1<=p9]]]]]]]]]]] & ~ [E [E [true U ~ [[~ [EG [~ [EG [~ [1<=p9]]]]] & ~ [E [~ [EG [~ [1<=p9]]] U [~ [[[1<=p1 & 1<=p19] | EX [1<=p24]]] & ~ [EG [~ [1<=p9]]]]]]]]] U [~ [[1<=p5 & 1<=p15]] & E [true U ~ [[~ [EG [~ [EG [~ [1<=p9]]]]] & ~ [E [~ [EG [~ [1<=p9]]] U [~ [[[1<=p1 & 1<=p19] | EX [1<=p24]]] & ~ [EG [~ [1<=p9]]]]]]]]]]]]]
abstracting: (1<=p9)
states: 2,952,016 (6)
.....................................................................................................................................................................................................
EG iterations: 197
abstracting: (1<=p24)
states: 8,885,216 (6)
.abstracting: (1<=p19)
states: 8,859,924 (6)
abstracting: (1<=p1)
states: 3,075,776 (6)
abstracting: (1<=p9)
states: 2,952,016 (6)
.....................................................................................................................................................................................................
EG iterations: 197
abstracting: (1<=p9)
states: 2,952,016 (6)
.....................................................................................................................................................................................................
EG iterations: 197
EG iterations: 0
abstracting: (1<=p15)
states: 4,232,133 (6)
abstracting: (1<=p5)
states: 8,885,216 (6)
abstracting: (1<=p9)
states: 2,952,016 (6)
.....................................................................................................................................................................................................
EG iterations: 197
abstracting: (1<=p24)
states: 8,885,216 (6)
.abstracting: (1<=p19)
states: 8,859,924 (6)
abstracting: (1<=p1)
states: 3,075,776 (6)
abstracting: (1<=p9)
states: 2,952,016 (6)
.....................................................................................................................................................................................................
EG iterations: 197
abstracting: (1<=p9)
states: 2,952,016 (6)
.....................................................................................................................................................................................................
EG iterations: 197
EG iterations: 0
abstracting: (1<=p9)
states: 2,952,016 (6)
.....................................................................................................................................................................................................
EG iterations: 197
abstracting: (1<=p24)
states: 8,885,216 (6)
.abstracting: (1<=p19)
states: 8,859,924 (6)
abstracting: (1<=p1)
states: 3,075,776 (6)
abstracting: (1<=p9)
states: 2,952,016 (6)
.....................................................................................................................................................................................................
EG iterations: 197
abstracting: (1<=p9)
states: 2,952,016 (6)
.....................................................................................................................................................................................................
EG iterations: 197
EG iterations: 0
EG iterations: 0
-> the formula is FALSE
FORMULA ClientsAndServers-PT-N0002P1-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.652sec
checking: EG [AF [[A [AX [[1<=p11 & 1<=p17]] U AF [[1<=p7 & 1<=p23]]] | EG [~ [A [1<=p22 U 1<=p18]]]]]]
normalized: EG [~ [EG [~ [[EG [~ [[~ [EG [~ [1<=p18]]] & ~ [E [~ [1<=p18] U [~ [1<=p22] & ~ [1<=p18]]]]]]] | [~ [EG [EG [~ [[1<=p7 & 1<=p23]]]]] & ~ [E [EG [~ [[1<=p7 & 1<=p23]]] U [EX [~ [[1<=p11 & 1<=p17]]] & EG [~ [[1<=p7 & 1<=p23]]]]]]]]]]]]
abstracting: (1<=p23)
states: 12,355,613 (7)
abstracting: (1<=p7)
states: 8,885,216 (6)
..........................................................................................................................................................................................
EG iterations: 186
abstracting: (1<=p17)
states: 8,859,924 (6)
abstracting: (1<=p11)
states: 3,075,776 (6)
.abstracting: (1<=p23)
states: 12,355,613 (7)
abstracting: (1<=p7)
states: 8,885,216 (6)
..........................................................................................................................................................................................
EG iterations: 186
abstracting: (1<=p23)
states: 12,355,613 (7)
abstracting: (1<=p7)
states: 8,885,216 (6)
..........................................................................................................................................................................................
EG iterations: 186
.
EG iterations: 1
abstracting: (1<=p18)
states: 3,075,776 (6)
abstracting: (1<=p22)
states: 8,885,216 (6)
abstracting: (1<=p18)
states: 3,075,776 (6)
abstracting: (1<=p18)
states: 3,075,776 (6)
......................................................................................................................................................................................................
EG iterations: 198
......................................................................................................................................................................................................
EG iterations: 198
.
EG iterations: 1
EG iterations: 0
-> the formula is TRUE
FORMULA ClientsAndServers-PT-N0002P1-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.836sec
checking: AG [[1<=p24 | [p20<=0 & [EX [AF [[p11<=0 | p17<=0]]] | AG [[p12<=0 | [p7<=0 | p23<=0]]]]]]]
normalized: ~ [E [true U ~ [[1<=p24 | [p20<=0 & [~ [E [true U ~ [[p12<=0 | [p7<=0 | p23<=0]]]]] | EX [~ [EG [~ [[p11<=0 | p17<=0]]]]]]]]]]]
abstracting: (p17<=0)
states: 3,602,249 (6)
abstracting: (p11<=0)
states: 9,386,397 (6)
.
EG iterations: 1
.abstracting: (p23<=0)
states: 106,560 (5)
abstracting: (p7<=0)
states: 3,576,957 (6)
abstracting: (p12<=0)
states: 9,510,157 (6)
abstracting: (p20<=0)
states: 9,386,397 (6)
abstracting: (1<=p24)
states: 8,885,216 (6)
-> the formula is FALSE
FORMULA ClientsAndServers-PT-N0002P1-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.739sec
checking: [AX [[1<=p7 & 1<=p23]] | EF [EG [[AX [1<=p9] & [AX [[1<=p0 & 1<=p13]] & [p22<=0 | AX [1<=p18]]]]]]]
normalized: [E [true U EG [[[[p22<=0 | ~ [EX [~ [1<=p18]]]] & ~ [EX [~ [[1<=p0 & 1<=p13]]]]] & ~ [EX [~ [1<=p9]]]]]] | ~ [EX [~ [[1<=p7 & 1<=p23]]]]]
abstracting: (1<=p23)
states: 12,355,613 (7)
abstracting: (1<=p7)
states: 8,885,216 (6)
.abstracting: (1<=p9)
states: 2,952,016 (6)
.abstracting: (1<=p13)
states: 2,952,016 (6)
abstracting: (1<=p0)
states: 12,441,793 (7)
.abstracting: (1<=p18)
states: 3,075,776 (6)
.abstracting: (p22<=0)
states: 3,576,957 (6)
.
EG iterations: 1
-> the formula is FALSE
FORMULA ClientsAndServers-PT-N0002P1-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.073sec
checking: A [A [EG [AX [[1<=p0 & 1<=p13]]] U AX [[EG [[1<=p0 & 1<=p13]] | [1<=p4 & 1<=p21]]]] U AF [[1<=p3 & 1<=p14]]]
normalized: [~ [EG [EG [~ [[1<=p3 & 1<=p14]]]]] & ~ [E [EG [~ [[1<=p3 & 1<=p14]]] U [~ [[~ [EG [EX [~ [[[1<=p4 & 1<=p21] | EG [[1<=p0 & 1<=p13]]]]]]] & ~ [E [EX [~ [[[1<=p4 & 1<=p21] | EG [[1<=p0 & 1<=p13]]]]] U [~ [EG [~ [EX [~ [[1<=p0 & 1<=p13]]]]]] & EX [~ [[[1<=p4 & 1<=p21] | EG [[1<=p0 & 1<=p13]]]]]]]]]] & EG [~ [[1<=p3 & 1<=p14]]]]]]]
abstracting: (1<=p14)
states: 11,300,733 (7)
abstracting: (1<=p3)
states: 3,075,776 (6)
....................................................................................................................................................................................................
EG iterations: 196
abstracting: (1<=p13)
states: 2,952,016 (6)
abstracting: (1<=p0)
states: 12,441,793 (7)
.
EG iterations: 1
abstracting: (1<=p21)
states: 12,355,613 (7)
abstracting: (1<=p4)
states: 8,885,216 (6)
.abstracting: (1<=p13)
states: 2,952,016 (6)
abstracting: (1<=p0)
states: 12,441,793 (7)
...
EG iterations: 2
abstracting: (1<=p13)
states: 2,952,016 (6)
abstracting: (1<=p0)
states: 12,441,793 (7)
.
EG iterations: 1
abstracting: (1<=p21)
states: 12,355,613 (7)
abstracting: (1<=p4)
states: 8,885,216 (6)
.abstracting: (1<=p13)
states: 2,952,016 (6)
abstracting: (1<=p0)
states: 12,441,793 (7)
.
EG iterations: 1
abstracting: (1<=p21)
states: 12,355,613 (7)
abstracting: (1<=p4)
states: 8,885,216 (6)
..
EG iterations: 1
abstracting: (1<=p14)
states: 11,300,733 (7)
abstracting: (1<=p3)
states: 3,075,776 (6)
....................................................................................................................................................................................................
EG iterations: 196
abstracting: (1<=p14)
states: 11,300,733 (7)
abstracting: (1<=p3)
states: 3,075,776 (6)
....................................................................................................................................................................................................
EG iterations: 196
.
EG iterations: 1
-> the formula is TRUE
FORMULA ClientsAndServers-PT-N0002P1-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.101sec
checking: AX [[EG [[AX [[p2<=0 | p14<=0]] & A [1<=p22 U p20<=0]]] | [[EF [[1<=p1 & 1<=p19]] & ~ [E [[[1<=p7 & 1<=p23] | 1<=p9] U ~ [[1<=p5 & 1<=p15]]]]] & [1<=p0 & 1<=p13]]]]
normalized: ~ [EX [~ [[[[1<=p0 & 1<=p13] & [~ [E [[1<=p9 | [1<=p7 & 1<=p23]] U ~ [[1<=p5 & 1<=p15]]]] & E [true U [1<=p1 & 1<=p19]]]] | EG [[[~ [EG [~ [p20<=0]]] & ~ [E [~ [p20<=0] U [~ [1<=p22] & ~ [p20<=0]]]]] & ~ [EX [~ [[p2<=0 | p14<=0]]]]]]]]]]
abstracting: (p14<=0)
states: 1,161,440 (6)
abstracting: (p2<=0)
states: 9,386,397 (6)
.abstracting: (p20<=0)
states: 9,386,397 (6)
abstracting: (1<=p22)
states: 8,885,216 (6)
abstracting: (p20<=0)
states: 9,386,397 (6)
abstracting: (p20<=0)
states: 9,386,397 (6)
.
EG iterations: 1
..................................................................................................................................................................................
EG iterations: 178
abstracting: (1<=p19)
states: 8,859,924 (6)
abstracting: (1<=p1)
states: 3,075,776 (6)
abstracting: (1<=p15)
states: 4,232,133 (6)
abstracting: (1<=p5)
states: 8,885,216 (6)
abstracting: (1<=p23)
states: 12,355,613 (7)
abstracting: (1<=p7)
states: 8,885,216 (6)
abstracting: (1<=p9)
states: 2,952,016 (6)
abstracting: (1<=p13)
states: 2,952,016 (6)
abstracting: (1<=p0)
states: 12,441,793 (7)
.-> the formula is FALSE
FORMULA ClientsAndServers-PT-N0002P1-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.183sec
checking: A [A [[EF [EX [[1<=p0 & 1<=p13]]] | A [[EG [[1<=p5 & 1<=p15]] | [1<=p20 & [1<=p0 & 1<=p13]]] U EX [[1<=p1 & 1<=p19]]]] U ~ [[[1<=p6 | EG [1<=p12]] & EG [1<=p12]]]] U AG [AF [1<=p22]]]
normalized: [~ [EG [E [true U EG [~ [1<=p22]]]]] & ~ [E [E [true U EG [~ [1<=p22]]] U [~ [[~ [EG [[EG [1<=p12] & [1<=p6 | EG [1<=p12]]]]] & ~ [E [[EG [1<=p12] & [1<=p6 | EG [1<=p12]]] U [~ [[[~ [E [~ [EX [[1<=p1 & 1<=p19]]] U [~ [[[1<=p20 & [1<=p0 & 1<=p13]] | EG [[1<=p5 & 1<=p15]]]] & ~ [EX [[1<=p1 & 1<=p19]]]]]] & ~ [EG [~ [EX [[1<=p1 & 1<=p19]]]]]] | E [true U EX [[1<=p0 & 1<=p13]]]]] & [EG [1<=p12] & [1<=p6 | EG [1<=p12]]]]]]]] & E [true U EG [~ [1<=p22]]]]]]]
abstracting: (1<=p22)
states: 8,885,216 (6)
..................................................................................................................................................................................................................................................................
EG iterations: 258
abstracting: (1<=p12)
states: 2,952,016 (6)
.
EG iterations: 1
abstracting: (1<=p6)
states: 3,075,776 (6)
abstracting: (1<=p12)
states: 2,952,016 (6)
.
EG iterations: 1
abstracting: (1<=p13)
states: 2,952,016 (6)
abstracting: (1<=p0)
states: 12,441,793 (7)
.abstracting: (1<=p19)
states: 8,859,924 (6)
abstracting: (1<=p1)
states: 3,075,776 (6)
..................................................................................................................................................................................................
EG iterations: 193
abstracting: (1<=p19)
states: 8,859,924 (6)
abstracting: (1<=p1)
states: 3,075,776 (6)
.abstracting: (1<=p15)
states: 4,232,133 (6)
abstracting: (1<=p5)
states: 8,885,216 (6)
.
EG iterations: 1
abstracting: (1<=p13)
states: 2,952,016 (6)
abstracting: (1<=p0)
states: 12,441,793 (7)
abstracting: (1<=p20)
states: 3,075,776 (6)
abstracting: (1<=p19)
states: 8,859,924 (6)
abstracting: (1<=p1)
states: 3,075,776 (6)
.abstracting: (1<=p12)
states: 2,952,016 (6)
.
EG iterations: 1
abstracting: (1<=p6)
states: 3,075,776 (6)
abstracting: (1<=p12)
states: 2,952,016 (6)
.
EG iterations: 1
abstracting: (1<=p12)
states: 2,952,016 (6)
.
EG iterations: 1
abstracting: (1<=p6)
states: 3,075,776 (6)
abstracting: (1<=p12)
states: 2,952,016 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p22)
states: 8,885,216 (6)
..................................................................................................................................................................................................................................................................
EG iterations: 258
abstracting: (1<=p22)
states: 8,885,216 (6)
..................................................................................................................................................................................................................................................................
EG iterations: 258
.
EG iterations: 1
-> the formula is TRUE
FORMULA ClientsAndServers-PT-N0002P1-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m10.916sec
checking: AG [[[E [EX [1<=p24] U EX [AG [[1<=p8 & 1<=p15]]]] | p1<=0] | [p19<=0 | EX [A [[[1<=p2 & 1<=p14] | [1<=p6 | ~ [[1<=p8 & 1<=p15]]]] U E [[1<=p7 & 1<=p23] U [1<=p7 & 1<=p23]]]]]]]
normalized: ~ [E [true U ~ [[[p19<=0 | EX [[~ [EG [~ [E [[1<=p7 & 1<=p23] U [1<=p7 & 1<=p23]]]]] & ~ [E [~ [E [[1<=p7 & 1<=p23] U [1<=p7 & 1<=p23]]] U [~ [[[1<=p6 | ~ [[1<=p8 & 1<=p15]]] | [1<=p2 & 1<=p14]]] & ~ [E [[1<=p7 & 1<=p23] U [1<=p7 & 1<=p23]]]]]]]]] | [p1<=0 | E [EX [1<=p24] U EX [~ [E [true U ~ [[1<=p8 & 1<=p15]]]]]]]]]]]
abstracting: (1<=p15)
states: 4,232,133 (6)
abstracting: (1<=p8)
states: 8,885,216 (6)
.abstracting: (1<=p24)
states: 8,885,216 (6)
.abstracting: (p1<=0)
states: 9,386,397 (6)
abstracting: (1<=p23)
states: 12,355,613 (7)
abstracting: (1<=p7)
states: 8,885,216 (6)
abstracting: (1<=p23)
states: 12,355,613 (7)
abstracting: (1<=p7)
states: 8,885,216 (6)
abstracting: (1<=p14)
states: 11,300,733 (7)
abstracting: (1<=p2)
states: 3,075,776 (6)
abstracting: (1<=p15)
states: 4,232,133 (6)
abstracting: (1<=p8)
states: 8,885,216 (6)
abstracting: (1<=p6)
states: 3,075,776 (6)
abstracting: (1<=p23)
states: 12,355,613 (7)
abstracting: (1<=p7)
states: 8,885,216 (6)
abstracting: (1<=p23)
states: 12,355,613 (7)
abstracting: (1<=p7)
states: 8,885,216 (6)
abstracting: (1<=p23)
states: 12,355,613 (7)
abstracting: (1<=p7)
states: 8,885,216 (6)
abstracting: (1<=p23)
states: 12,355,613 (7)
abstracting: (1<=p7)
states: 8,885,216 (6)
..........................................................................................................................................................................................
EG iterations: 186
.abstracting: (p19<=0)
states: 3,602,249 (6)
-> the formula is FALSE
FORMULA ClientsAndServers-PT-N0002P1-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.794sec
checking: EF [[E [[EX [A [1<=p18 U 1<=p6]] | [1<=p2 & 1<=p14]] U ~ [[1<=p0 & 1<=p13]]] & EF [[EG [A [[1<=p4 & 1<=p21] U [1<=p0 & 1<=p13]]] & [[AX [[1<=p4 & 1<=p21]] | [1<=p8 & [1<=p15 & 1<=p24]]] | [EF [[1<=p3 & 1<=p14]] | [1<=p9 & [1<=p4 & 1<=p21]]]]]]]]
normalized: E [true U [E [true U [[[[1<=p9 & [1<=p4 & 1<=p21]] | E [true U [1<=p3 & 1<=p14]]] | [[1<=p8 & [1<=p15 & 1<=p24]] | ~ [EX [~ [[1<=p4 & 1<=p21]]]]]] & EG [[~ [EG [~ [[1<=p0 & 1<=p13]]]] & ~ [E [~ [[1<=p0 & 1<=p13]] U [~ [[1<=p4 & 1<=p21]] & ~ [[1<=p0 & 1<=p13]]]]]]]]] & E [[[1<=p2 & 1<=p14] | EX [[~ [EG [~ [1<=p6]]] & ~ [E [~ [1<=p6] U [~ [1<=p18] & ~ [1<=p6]]]]]]] U ~ [[1<=p0 & 1<=p13]]]]]
abstracting: (1<=p13)
states: 2,952,016 (6)
abstracting: (1<=p0)
states: 12,441,793 (7)
abstracting: (1<=p6)
states: 3,075,776 (6)
abstracting: (1<=p18)
states: 3,075,776 (6)
abstracting: (1<=p6)
states: 3,075,776 (6)
abstracting: (1<=p6)
states: 3,075,776 (6)
......................................................................................................................................................................................................
EG iterations: 198
.abstracting: (1<=p14)
states: 11,300,733 (7)
abstracting: (1<=p2)
states: 3,075,776 (6)
abstracting: (1<=p13)
states: 2,952,016 (6)
abstracting: (1<=p0)
states: 12,441,793 (7)
abstracting: (1<=p21)
states: 12,355,613 (7)
abstracting: (1<=p4)
states: 8,885,216 (6)
abstracting: (1<=p13)
states: 2,952,016 (6)
abstracting: (1<=p0)
states: 12,441,793 (7)
abstracting: (1<=p13)
states: 2,952,016 (6)
abstracting: (1<=p0)
states: 12,441,793 (7)
.....................................................................................................................................................................................................
EG iterations: 197
.
EG iterations: 1
abstracting: (1<=p21)
states: 12,355,613 (7)
abstracting: (1<=p4)
states: 8,885,216 (6)
.abstracting: (1<=p24)
states: 8,885,216 (6)
abstracting: (1<=p15)
states: 4,232,133 (6)
abstracting: (1<=p8)
states: 8,885,216 (6)
abstracting: (1<=p14)
states: 11,300,733 (7)
abstracting: (1<=p3)
states: 3,075,776 (6)
abstracting: (1<=p21)
states: 12,355,613 (7)
abstracting: (1<=p4)
states: 8,885,216 (6)
abstracting: (1<=p9)
states: 2,952,016 (6)
-> the formula is TRUE
FORMULA ClientsAndServers-PT-N0002P1-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.915sec
checking: [EX [AG [[[EG [p16<=0] | 1<=p6] | [p20<=0 | [p11<=0 | p17<=0]]]]] & AX [[~ [A [[1<=p18 | [1<=p2 & 1<=p14]] U [1<=p12 & [1<=p4 & 1<=p21]]]] | [[EF [1<=p22] & [1<=p1 & 1<=p19]] | ~ [A [~ [[[1<=p2 & 1<=p14] & [1<=p8 & 1<=p15]]] U [1<=p11 & 1<=p17]]]]]]]
normalized: [~ [EX [~ [[[~ [[~ [EG [~ [[1<=p11 & 1<=p17]]]] & ~ [E [~ [[1<=p11 & 1<=p17]] U [[[1<=p8 & 1<=p15] & [1<=p2 & 1<=p14]] & ~ [[1<=p11 & 1<=p17]]]]]]] | [[1<=p1 & 1<=p19] & E [true U 1<=p22]]] | ~ [[~ [EG [~ [[1<=p12 & [1<=p4 & 1<=p21]]]]] & ~ [E [~ [[1<=p12 & [1<=p4 & 1<=p21]]] U [~ [[1<=p18 | [1<=p2 & 1<=p14]]] & ~ [[1<=p12 & [1<=p4 & 1<=p21]]]]]]]]]]]] & EX [~ [E [true U ~ [[[p20<=0 | [p11<=0 | p17<=0]] | [1<=p6 | EG [p16<=0]]]]]]]]
abstracting: (p16<=0)
states: 9,386,397 (6)
......................................................................................................................................................................................................
EG iterations: 198
abstracting: (1<=p6)
states: 3,075,776 (6)
abstracting: (p17<=0)
states: 3,602,249 (6)
abstracting: (p11<=0)
states: 9,386,397 (6)
abstracting: (p20<=0)
states: 9,386,397 (6)
.abstracting: (1<=p21)
states: 12,355,613 (7)
abstracting: (1<=p4)
states: 8,885,216 (6)
abstracting: (1<=p12)
states: 2,952,016 (6)
abstracting: (1<=p14)
states: 11,300,733 (7)
abstracting: (1<=p2)
states: 3,075,776 (6)
abstracting: (1<=p18)
states: 3,075,776 (6)
abstracting: (1<=p21)
states: 12,355,613 (7)
abstracting: (1<=p4)
states: 8,885,216 (6)
abstracting: (1<=p12)
states: 2,952,016 (6)
abstracting: (1<=p21)
states: 12,355,613 (7)
abstracting: (1<=p4)
states: 8,885,216 (6)
abstracting: (1<=p12)
states: 2,952,016 (6)
.
EG iterations: 1
abstracting: (1<=p22)
states: 8,885,216 (6)
abstracting: (1<=p19)
states: 8,859,924 (6)
abstracting: (1<=p1)
states: 3,075,776 (6)
abstracting: (1<=p17)
states: 8,859,924 (6)
abstracting: (1<=p11)
states: 3,075,776 (6)
abstracting: (1<=p14)
states: 11,300,733 (7)
abstracting: (1<=p2)
states: 3,075,776 (6)
abstracting: (1<=p15)
states: 4,232,133 (6)
abstracting: (1<=p8)
states: 8,885,216 (6)
abstracting: (1<=p17)
states: 8,859,924 (6)
abstracting: (1<=p11)
states: 3,075,776 (6)
abstracting: (1<=p17)
states: 8,859,924 (6)
abstracting: (1<=p11)
states: 3,075,776 (6)
....................................................................................................................................................................................................
EG iterations: 196
.-> the formula is FALSE
FORMULA ClientsAndServers-PT-N0002P1-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.394sec
checking: AF [[[E [~ [[1<=p11 & 1<=p17]] U 1<=p18] | [1<=p9 & E [AX [1<=p9] U [1<=p6 | 1<=p10]]]] | [[[1<=p5 & 1<=p15] & [1<=p4 & [1<=p21 & [AX [[1<=p3 & 1<=p14]] | 1<=p8]]]] | [AF [EG [[1<=p5 & 1<=p15]]] & [[AX [[1<=p0 & [1<=p13 & 1<=p9]]] | p6<=0] | [p8<=0 | p15<=0]]]]]]
normalized: ~ [EG [~ [[[[~ [EG [~ [EG [[1<=p5 & 1<=p15]]]]] & [[p8<=0 | p15<=0] | [p6<=0 | ~ [EX [~ [[1<=p0 & [1<=p13 & 1<=p9]]]]]]]] | [[1<=p4 & [1<=p21 & [1<=p8 | ~ [EX [~ [[1<=p3 & 1<=p14]]]]]]] & [1<=p5 & 1<=p15]]] | [[1<=p9 & E [~ [EX [~ [1<=p9]]] U [1<=p6 | 1<=p10]]] | E [~ [[1<=p11 & 1<=p17]] U 1<=p18]]]]]]
abstracting: (1<=p18)
states: 3,075,776 (6)
abstracting: (1<=p17)
states: 8,859,924 (6)
abstracting: (1<=p11)
states: 3,075,776 (6)
abstracting: (1<=p10)
states: 2,952,016 (6)
abstracting: (1<=p6)
states: 3,075,776 (6)
abstracting: (1<=p9)
states: 2,952,016 (6)
.abstracting: (1<=p9)
states: 2,952,016 (6)
abstracting: (1<=p15)
states: 4,232,133 (6)
abstracting: (1<=p5)
states: 8,885,216 (6)
abstracting: (1<=p14)
states: 11,300,733 (7)
abstracting: (1<=p3)
states: 3,075,776 (6)
.abstracting: (1<=p8)
states: 8,885,216 (6)
abstracting: (1<=p21)
states: 12,355,613 (7)
abstracting: (1<=p4)
states: 8,885,216 (6)
abstracting: (1<=p9)
states: 2,952,016 (6)
abstracting: (1<=p13)
states: 2,952,016 (6)
abstracting: (1<=p0)
states: 12,441,793 (7)
.abstracting: (p6<=0)
states: 9,386,397 (6)
abstracting: (p15<=0)
states: 8,230,040 (6)
abstracting: (p8<=0)
states: 3,576,957 (6)
abstracting: (1<=p15)
states: 4,232,133 (6)
abstracting: (1<=p5)
states: 8,885,216 (6)
.
EG iterations: 1
..............................................................................................................................................................................................
EG iterations: 190
............................................
EG iterations: 44
-> the formula is TRUE
FORMULA ClientsAndServers-PT-N0002P1-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.766sec
checking: AG [[[EF [1<=p9] | [AX [AG [[1<=p5 & 1<=p15]]] | [1<=p4 & 1<=p21]]] | [[1<=p2 & 1<=p14] | [[E [1<=p24 U [~ [[1<=p20 & [1<=p3 & 1<=p14]]] | EF [[1<=p5 & 1<=p15]]]] & [EF [[p12<=0 & p9<=0]] | [1<=p0 & 1<=p13]]] | [AG [E [1<=p6 U [1<=p3 & 1<=p14]]] & E [[1<=p8 & 1<=p15] U AF [1<=p9]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[1<=p0 & 1<=p13] | E [true U [p12<=0 & p9<=0]]] & E [1<=p24 U [E [true U [1<=p5 & 1<=p15]] | ~ [[1<=p20 & [1<=p3 & 1<=p14]]]]]] | [E [[1<=p8 & 1<=p15] U ~ [EG [~ [1<=p9]]]] & ~ [E [true U ~ [E [1<=p6 U [1<=p3 & 1<=p14]]]]]]] | [1<=p2 & 1<=p14]] | [[[1<=p4 & 1<=p21] | ~ [EX [E [true U ~ [[1<=p5 & 1<=p15]]]]]] | E [true U 1<=p9]]]]]]
abstracting: (1<=p9)
states: 2,952,016 (6)
abstracting: (1<=p15)
states: 4,232,133 (6)
abstracting: (1<=p5)
states: 8,885,216 (6)
.abstracting: (1<=p21)
states: 12,355,613 (7)
abstracting: (1<=p4)
states: 8,885,216 (6)
abstracting: (1<=p14)
states: 11,300,733 (7)
abstracting: (1<=p2)
states: 3,075,776 (6)
abstracting: (1<=p14)
states: 11,300,733 (7)
abstracting: (1<=p3)
states: 3,075,776 (6)
abstracting: (1<=p6)
states: 3,075,776 (6)
abstracting: (1<=p9)
states: 2,952,016 (6)
.....................................................................................................................................................................................................
EG iterations: 197
abstracting: (1<=p15)
states: 4,232,133 (6)
abstracting: (1<=p8)
states: 8,885,216 (6)
abstracting: (1<=p14)
states: 11,300,733 (7)
abstracting: (1<=p3)
states: 3,075,776 (6)
abstracting: (1<=p20)
states: 3,075,776 (6)
abstracting: (1<=p15)
states: 4,232,133 (6)
abstracting: (1<=p5)
states: 8,885,216 (6)
abstracting: (1<=p24)
states: 8,885,216 (6)
abstracting: (p9<=0)
states: 9,510,157 (6)
abstracting: (p12<=0)
states: 9,510,157 (6)
abstracting: (1<=p13)
states: 2,952,016 (6)
abstracting: (1<=p0)
states: 12,441,793 (7)
-> the formula is TRUE
FORMULA ClientsAndServers-PT-N0002P1-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.291sec
totally nodes used: 15983245 (1.6e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 41403935 38830880 80234815
used/not used/entry size/cache size: 34881999 32226865 16 1024MB
basic ops cache: hits/miss/sum: 12443192 9918513 22361705
used/not used/entry size/cache size: 10561608 6215608 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: 297973 203797 501770
used/not used/entry size/cache size: 201315 8187293 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 54024169
1 11162109
2 1568122
3 229372
4 49656
5 15968
6 10855
7 6879
8 5986
9 6807
>= 10 28941
Total processing time: 0m53.499sec
BK_STOP 1678333988401
--------------------
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:1752 (97), effective:370 (20)
initing FirstDep: 0m 0.000sec
iterations count:27 (1), effective:3 (0)
iterations count:121 (6), effective:28 (1)
iterations count:18 (1), effective:0 (0)
iterations count:96 (5), effective:16 (0)
iterations count:186 (10), effective:36 (2)
iterations count:18 (1), effective:0 (0)
iterations count:186 (10), effective:36 (2)
iterations count:18 (1), effective:0 (0)
iterations count:30 (1), effective:4 (0)
iterations count:186 (10), effective:36 (2)
iterations count:18 (1), effective:0 (0)
iterations count:50 (2), effective:16 (0)
iterations count:206 (11), effective:41 (2)
iterations count:360 (20), effective:87 (4)
iterations count:18 (1), effective:0 (0)
iterations count:48 (2), effective:15 (0)
iterations count:103 (5), effective:18 (1)
iterations count:30 (1), effective:4 (0)
iterations count:116 (6), effective:21 (1)
iterations count:42 (2), effective:7 (0)
iterations count:74 (4), effective:16 (0)
iterations count:18 (1), effective:0 (0)
iterations count:18 (1), effective:0 (0)
iterations count:143 (7), effective:23 (1)
iterations count:18 (1), effective:0 (0)
iterations count:133 (7), effective:36 (2)
iterations count:38 (2), effective:4 (0)
iterations count:27 (1), effective:3 (0)
iterations count:50 (2), effective:16 (0)
iterations count:122 (6), effective:23 (1)
iterations count:119 (6), effective:22 (1)
iterations count:45 (2), effective:8 (0)
iterations count:197 (10), effective:39 (2)
iterations count:214 (11), effective:42 (2)
iterations count:105 (5), effective:19 (1)
iterations count:122 (6), effective:24 (1)
iterations count:18 (1), effective:0 (0)
iterations count:97 (5), effective:18 (1)
iterations count:97 (5), effective:19 (1)
iterations count:30 (1), effective:4 (0)
iterations count:122 (6), effective:23 (1)
iterations count:51 (2), effective:7 (0)
iterations count:18 (1), effective:0 (0)
iterations count:104 (5), effective:19 (1)
iterations count:18 (1), effective:0 (0)
iterations count:60 (3), effective:6 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ClientsAndServers-PT-N0002P1"
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 ClientsAndServers-PT-N0002P1, 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 r074-smll-167814400000218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0002P1.tgz
mv ClientsAndServers-PT-N0002P1 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 ;