About the Execution of Marcie+red for PGCD-PT-D03N050
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10155.651 | 143353.00 | 147163.00 | 1131.40 | TTFTFTFTTTTTTFFT | 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.r522-tall-167987247400458.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 PGCD-PT-D03N050, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247400458
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 23 15:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 23 15:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 23 15:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 14K Mar 23 15:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Mar 23 15:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 23 15:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Mar 23 15:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 7.4K Mar 31 16:48 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 PGCD-PT-D03N050-CTLFireability-00
FORMULA_NAME PGCD-PT-D03N050-CTLFireability-01
FORMULA_NAME PGCD-PT-D03N050-CTLFireability-02
FORMULA_NAME PGCD-PT-D03N050-CTLFireability-03
FORMULA_NAME PGCD-PT-D03N050-CTLFireability-04
FORMULA_NAME PGCD-PT-D03N050-CTLFireability-05
FORMULA_NAME PGCD-PT-D03N050-CTLFireability-06
FORMULA_NAME PGCD-PT-D03N050-CTLFireability-07
FORMULA_NAME PGCD-PT-D03N050-CTLFireability-08
FORMULA_NAME PGCD-PT-D03N050-CTLFireability-09
FORMULA_NAME PGCD-PT-D03N050-CTLFireability-10
FORMULA_NAME PGCD-PT-D03N050-CTLFireability-11
FORMULA_NAME PGCD-PT-D03N050-CTLFireability-12
FORMULA_NAME PGCD-PT-D03N050-CTLFireability-13
FORMULA_NAME PGCD-PT-D03N050-CTLFireability-14
FORMULA_NAME PGCD-PT-D03N050-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1680818548963
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=PGCD-PT-D03N050
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-06 22:02:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-06 22:02:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 22:02:30] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-04-06 22:02:30] [INFO ] Transformed 12 places.
[2023-04-06 22:02:30] [INFO ] Transformed 12 transitions.
[2023-04-06 22:02:30] [INFO ] Parsed PT model containing 12 places and 12 transitions and 56 arcs in 76 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Initial state reduction rules removed 1 formulas.
FORMULA PGCD-PT-D03N050-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 7 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-04-06 22:02:30] [INFO ] Computed 5 invariants in 8 ms
[2023-04-06 22:02:30] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
[2023-04-06 22:02:30] [INFO ] Invariant cache hit.
[2023-04-06 22:02:30] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-06 22:02:30] [INFO ] Invariant cache hit.
[2023-04-06 22:02:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-06 22:02:30] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-04-06 22:02:30] [INFO ] Invariant cache hit.
[2023-04-06 22:02:30] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 254 ms. Remains : 12/12 places, 12/12 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-04-06 22:02:30] [INFO ] Flatten gal took : 12 ms
[2023-04-06 22:02:30] [INFO ] Flatten gal took : 4 ms
[2023-04-06 22:02:30] [INFO ] Input system was already deterministic with 12 transitions.
Incomplete random walk after 10033 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 32) seen :30
Finished Best-First random walk after 48 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=24 )
Parikh walk visited 0 properties in 1 ms.
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 3 ms
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 3 ms
[2023-04-06 22:02:31] [INFO ] Input system was already deterministic with 12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 22:02:31] [INFO ] Invariant cache hit.
[2023-04-06 22:02:31] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:02:31] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 22:02:31] [INFO ] Invariant cache hit.
[2023-04-06 22:02:31] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:02:31] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 22:02:31] [INFO ] Invariant cache hit.
[2023-04-06 22:02:31] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:02:31] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 4 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 22:02:31] [INFO ] Invariant cache hit.
[2023-04-06 22:02:31] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:02:31] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 22:02:31] [INFO ] Invariant cache hit.
[2023-04-06 22:02:31] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:02:31] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 22:02:31] [INFO ] Invariant cache hit.
[2023-04-06 22:02:31] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:02:31] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 22:02:31] [INFO ] Invariant cache hit.
[2023-04-06 22:02:31] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:02:31] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 22:02:31] [INFO ] Invariant cache hit.
[2023-04-06 22:02:31] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 0 ms
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:02:31] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 22:02:31] [INFO ] Invariant cache hit.
[2023-04-06 22:02:31] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:02:31] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 22:02:31] [INFO ] Invariant cache hit.
[2023-04-06 22:02:31] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:02:31] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 22:02:31] [INFO ] Invariant cache hit.
[2023-04-06 22:02:31] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:02:31] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 22:02:31] [INFO ] Invariant cache hit.
[2023-04-06 22:02:31] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:02:31] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 22:02:31] [INFO ] Invariant cache hit.
[2023-04-06 22:02:31] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:02:31] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 22:02:31] [INFO ] Invariant cache hit.
[2023-04-06 22:02:31] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:02:31] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 22:02:31] [INFO ] Invariant cache hit.
[2023-04-06 22:02:31] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:02:31] [INFO ] Input system was already deterministic with 12 transitions.
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:02:31] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:02:31] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-04-06 22:02:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 12 places, 12 transitions and 56 arcs took 0 ms.
Total runtime 1262 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: 12 NrTr: 12 NrArc: 56)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.733sec
RS generation: 0m 9.800sec
-> reachability set: #nodes 34961 (3.5e+04) #states 417,214,571,243 (11)
starting MCC model checker
--------------------------
checking: AF [E [AF [[3<=p2 & 1<=p10]] U [3<=p3 & 1<=p11]]]
normalized: ~ [EG [~ [E [~ [EG [~ [[3<=p2 & 1<=p10]]]] U [3<=p3 & 1<=p11]]]]]
abstracting: (1<=p11)
states: 403,568,103,089 (11)
abstracting: (3<=p3)
states: 377,046,326,647 (11)
abstracting: (1<=p10)
states: 403,568,103,089 (11)
abstracting: (3<=p2)
states: 377,046,326,647 (11)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA PGCD-PT-D03N050-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 5.136sec
checking: EG [[AG [EF [[[p8<=0 | p0<=2] | [p2<=0 | p6<=0]]]] | AX [[3<=p1 & 1<=p9]]]]
normalized: EG [[~ [EX [~ [[3<=p1 & 1<=p9]]]] | ~ [E [true U ~ [E [true U [[p2<=0 | p6<=0] | [p8<=0 | p0<=2]]]]]]]]
abstracting: (p0<=2)
states: 40,168,244,596 (10)
abstracting: (p8<=0)
states: 13,646,468,154 (10)
abstracting: (p6<=0)
states: 13,647,210,793 (10)
abstracting: (p2<=0)
states: 13,646,468,154 (10)
abstracting: (1<=p9)
states: 403,568,103,089 (11)
abstracting: (3<=p1)
states: 377,046,326,647 (11)
.
EG iterations: 0
-> the formula is TRUE
FORMULA PGCD-PT-D03N050-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 5.607sec
checking: AX [EF [AG [[EG [[p1<=0 | [p5<=0 | p9<=0]]] & [[p3<=0 | p7<=0] | [p1<=2 | p9<=0]]]]]]
normalized: ~ [EX [~ [E [true U ~ [E [true U ~ [[[[p1<=2 | p9<=0] | [p3<=0 | p7<=0]] & EG [[p1<=0 | [p5<=0 | p9<=0]]]]]]]]]]]
abstracting: (p9<=0)
states: 13,646,468,154 (10)
abstracting: (p5<=0)
states: 13,647,210,793 (10)
abstracting: (p1<=0)
states: 13,646,468,154 (10)
..
EG iterations: 2
abstracting: (p7<=0)
states: 13,647,210,793 (10)
abstracting: (p3<=0)
states: 13,646,468,154 (10)
abstracting: (p9<=0)
states: 13,646,468,154 (10)
abstracting: (p1<=2)
states: 40,168,244,596 (10)
.-> the formula is FALSE
FORMULA PGCD-PT-D03N050-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.514sec
checking: ~ [A [[3<=p2 & 1<=p10] U AX [[AX [[1<=p1 & [1<=p5 & 1<=p9]]] & AG [[3<=p0 & 1<=p8]]]]]]
normalized: ~ [[~ [EG [EX [~ [[~ [E [true U ~ [[3<=p0 & 1<=p8]]]] & ~ [EX [~ [[1<=p1 & [1<=p5 & 1<=p9]]]]]]]]]] & ~ [E [EX [~ [[~ [E [true U ~ [[3<=p0 & 1<=p8]]]] & ~ [EX [~ [[1<=p1 & [1<=p5 & 1<=p9]]]]]]]] U [~ [[3<=p2 & 1<=p10]] & EX [~ [[~ [E [true U ~ [[3<=p0 & 1<=p8]]]] & ~ [EX [~ [[1<=p1 & [1<=p5 & 1<=p9]]]]]]]]]]]]]
abstracting: (1<=p9)
states: 403,568,103,089 (11)
abstracting: (1<=p5)
states: 403,567,360,450 (11)
abstracting: (1<=p1)
states: 403,568,103,089 (11)
.abstracting: (1<=p8)
states: 403,568,103,089 (11)
abstracting: (3<=p0)
states: 377,046,326,647 (11)
.abstracting: (1<=p10)
states: 403,568,103,089 (11)
abstracting: (3<=p2)
states: 377,046,326,647 (11)
abstracting: (1<=p9)
states: 403,568,103,089 (11)
abstracting: (1<=p5)
states: 403,567,360,450 (11)
abstracting: (1<=p1)
states: 403,568,103,089 (11)
.abstracting: (1<=p8)
states: 403,568,103,089 (11)
abstracting: (3<=p0)
states: 377,046,326,647 (11)
.abstracting: (1<=p9)
states: 403,568,103,089 (11)
abstracting: (1<=p5)
states: 403,567,360,450 (11)
abstracting: (1<=p1)
states: 403,568,103,089 (11)
.abstracting: (1<=p8)
states: 403,568,103,089 (11)
abstracting: (3<=p0)
states: 377,046,326,647 (11)
.
EG iterations: 0
-> the formula is TRUE
FORMULA PGCD-PT-D03N050-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m25.707sec
checking: AG [[A [[3<=p0 & 1<=p8] U [1<=p3 & [1<=p7 & 1<=p11]]] | [EF [[3<=p3 & 1<=p11]] | [[3<=p1 & 1<=p9] & [1<=p0 & 1<=p4]]]]]
normalized: ~ [E [true U ~ [[[[[1<=p0 & 1<=p4] & [3<=p1 & 1<=p9]] | E [true U [3<=p3 & 1<=p11]]] | [~ [EG [~ [[1<=p3 & [1<=p7 & 1<=p11]]]]] & ~ [E [~ [[1<=p3 & [1<=p7 & 1<=p11]]] U [~ [[3<=p0 & 1<=p8]] & ~ [[1<=p3 & [1<=p7 & 1<=p11]]]]]]]]]]]
abstracting: (1<=p11)
states: 403,568,103,089 (11)
abstracting: (1<=p7)
states: 403,567,360,450 (11)
abstracting: (1<=p3)
states: 403,568,103,089 (11)
abstracting: (1<=p8)
states: 403,568,103,089 (11)
abstracting: (3<=p0)
states: 377,046,326,647 (11)
abstracting: (1<=p11)
states: 403,568,103,089 (11)
abstracting: (1<=p7)
states: 403,567,360,450 (11)
abstracting: (1<=p3)
states: 403,568,103,089 (11)
abstracting: (1<=p11)
states: 403,568,103,089 (11)
abstracting: (1<=p7)
states: 403,567,360,450 (11)
abstracting: (1<=p3)
states: 403,568,103,089 (11)
..
EG iterations: 2
abstracting: (1<=p11)
states: 403,568,103,089 (11)
abstracting: (3<=p3)
states: 377,046,326,647 (11)
abstracting: (1<=p9)
states: 403,568,103,089 (11)
abstracting: (3<=p1)
states: 377,046,326,647 (11)
abstracting: (1<=p4)
states: 403,567,360,450 (11)
abstracting: (1<=p0)
states: 403,568,103,089 (11)
-> the formula is TRUE
FORMULA PGCD-PT-D03N050-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 5.639sec
checking: AX [EG [[AG [[[p2<=0 | p6<=0] & [p1<=0 | [p5<=0 | p9<=0]]]] | [EF [[p0<=0 | [p4<=0 | p8<=0]]] & [[1<=p1 & [1<=p5 & 1<=p9]] | [1<=p3 & 1<=p7]]]]]]
normalized: ~ [EX [~ [EG [[[[[1<=p3 & 1<=p7] | [1<=p1 & [1<=p5 & 1<=p9]]] & E [true U [p0<=0 | [p4<=0 | p8<=0]]]] | ~ [E [true U ~ [[[p1<=0 | [p5<=0 | p9<=0]] & [p2<=0 | p6<=0]]]]]]]]]]
abstracting: (p6<=0)
states: 13,647,210,793 (10)
abstracting: (p2<=0)
states: 13,646,468,154 (10)
abstracting: (p9<=0)
states: 13,646,468,154 (10)
abstracting: (p5<=0)
states: 13,647,210,793 (10)
abstracting: (p1<=0)
states: 13,646,468,154 (10)
abstracting: (p8<=0)
states: 13,646,468,154 (10)
abstracting: (p4<=0)
states: 13,647,210,793 (10)
abstracting: (p0<=0)
states: 13,646,468,154 (10)
abstracting: (1<=p9)
states: 403,568,103,089 (11)
abstracting: (1<=p5)
states: 403,567,360,450 (11)
abstracting: (1<=p1)
states: 403,568,103,089 (11)
abstracting: (1<=p7)
states: 403,567,360,450 (11)
abstracting: (1<=p3)
states: 403,568,103,089 (11)
.
EG iterations: 1
.-> the formula is TRUE
FORMULA PGCD-PT-D03N050-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 5.901sec
checking: EX [[[3<=p0 & 1<=p8] | [AG [[1<=p3 & [1<=p7 & 1<=p11]]] & ~ [A [E [[1<=p3 & [1<=p7 & 1<=p11]] U [1<=p2 & [1<=p6 & 1<=p10]]] U EF [[3<=p3 & 1<=p11]]]]]]]
normalized: EX [[[~ [[~ [EG [~ [E [true U [3<=p3 & 1<=p11]]]]] & ~ [E [~ [E [true U [3<=p3 & 1<=p11]]] U [~ [E [[1<=p3 & [1<=p7 & 1<=p11]] U [1<=p2 & [1<=p6 & 1<=p10]]]] & ~ [E [true U [3<=p3 & 1<=p11]]]]]]]] & ~ [E [true U ~ [[1<=p3 & [1<=p7 & 1<=p11]]]]]] | [3<=p0 & 1<=p8]]]
abstracting: (1<=p8)
states: 403,568,103,089 (11)
abstracting: (3<=p0)
states: 377,046,326,647 (11)
abstracting: (1<=p11)
states: 403,568,103,089 (11)
abstracting: (1<=p7)
states: 403,567,360,450 (11)
abstracting: (1<=p3)
states: 403,568,103,089 (11)
abstracting: (1<=p11)
states: 403,568,103,089 (11)
abstracting: (3<=p3)
states: 377,046,326,647 (11)
abstracting: (1<=p10)
states: 403,568,103,089 (11)
abstracting: (1<=p6)
states: 403,567,360,450 (11)
abstracting: (1<=p2)
states: 403,568,103,089 (11)
abstracting: (1<=p11)
states: 403,568,103,089 (11)
abstracting: (1<=p7)
states: 403,567,360,450 (11)
abstracting: (1<=p3)
states: 403,568,103,089 (11)
abstracting: (1<=p11)
states: 403,568,103,089 (11)
abstracting: (3<=p3)
states: 377,046,326,647 (11)
abstracting: (1<=p11)
states: 403,568,103,089 (11)
abstracting: (3<=p3)
states: 377,046,326,647 (11)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA PGCD-PT-D03N050-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 5.013sec
checking: ~ [A [AX [A [[[[[1<=p1 & [1<=p5 & 1<=p9]] | [1<=p3 & 1<=p7]] & [1<=p0 & 1<=p4]] & [1<=p0 & [1<=p4 & 1<=p8]]] U ~ [EG [[1<=p2 & 1<=p6]]]]] U EF [AG [[3<=p0 & 1<=p8]]]]]
normalized: ~ [[~ [EG [~ [E [true U ~ [E [true U ~ [[3<=p0 & 1<=p8]]]]]]]] & ~ [E [~ [E [true U ~ [E [true U ~ [[3<=p0 & 1<=p8]]]]]] U [EX [~ [[~ [EG [EG [[1<=p2 & 1<=p6]]]] & ~ [E [EG [[1<=p2 & 1<=p6]] U [~ [[[1<=p0 & [1<=p4 & 1<=p8]] & [[1<=p0 & 1<=p4] & [[1<=p3 & 1<=p7] | [1<=p1 & [1<=p5 & 1<=p9]]]]]] & EG [[1<=p2 & 1<=p6]]]]]]]] & ~ [E [true U ~ [E [true U ~ [[3<=p0 & 1<=p8]]]]]]]]]]]
abstracting: (1<=p8)
states: 403,568,103,089 (11)
abstracting: (3<=p0)
states: 377,046,326,647 (11)
abstracting: (1<=p6)
states: 403,567,360,450 (11)
abstracting: (1<=p2)
states: 403,568,103,089 (11)
.
EG iterations: 1
abstracting: (1<=p9)
states: 403,568,103,089 (11)
abstracting: (1<=p5)
states: 403,567,360,450 (11)
abstracting: (1<=p1)
states: 403,568,103,089 (11)
abstracting: (1<=p7)
states: 403,567,360,450 (11)
abstracting: (1<=p3)
states: 403,568,103,089 (11)
abstracting: (1<=p4)
states: 403,567,360,450 (11)
abstracting: (1<=p0)
states: 403,568,103,089 (11)
abstracting: (1<=p8)
states: 403,568,103,089 (11)
abstracting: (1<=p4)
states: 403,567,360,450 (11)
abstracting: (1<=p0)
states: 403,568,103,089 (11)
abstracting: (1<=p6)
states: 403,567,360,450 (11)
abstracting: (1<=p2)
states: 403,568,103,089 (11)
.
EG iterations: 1
abstracting: (1<=p6)
states: 403,567,360,450 (11)
abstracting: (1<=p2)
states: 403,568,103,089 (11)
.
EG iterations: 1
.
EG iterations: 1
.abstracting: (1<=p8)
states: 403,568,103,089 (11)
abstracting: (3<=p0)
states: 377,046,326,647 (11)
abstracting: (1<=p8)
states: 403,568,103,089 (11)
abstracting: (3<=p0)
states: 377,046,326,647 (11)
EG iterations: 0
-> the formula is TRUE
FORMULA PGCD-PT-D03N050-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.779sec
checking: [AX [AX [AX [[p0<=0 | [p4<=0 | p8<=0]]]]] | EF [[EG [[1<=p0 & 1<=p4]] & E [[~ [[1<=p1 & [1<=p5 & 1<=p9]]] | [~ [[1<=p3 & 1<=p7]] | AF [[1<=p3 & 1<=p7]]]] U ~ [[1<=p3 & 1<=p7]]]]]]
normalized: [E [true U [E [[[~ [EG [~ [[1<=p3 & 1<=p7]]]] | ~ [[1<=p3 & 1<=p7]]] | ~ [[1<=p1 & [1<=p5 & 1<=p9]]]] U ~ [[1<=p3 & 1<=p7]]] & EG [[1<=p0 & 1<=p4]]]] | ~ [EX [EX [EX [~ [[p0<=0 | [p4<=0 | p8<=0]]]]]]]]
abstracting: (p8<=0)
states: 13,646,468,154 (10)
abstracting: (p4<=0)
states: 13,647,210,793 (10)
abstracting: (p0<=0)
states: 13,646,468,154 (10)
...abstracting: (1<=p4)
states: 403,567,360,450 (11)
abstracting: (1<=p0)
states: 403,568,103,089 (11)
.
EG iterations: 1
abstracting: (1<=p7)
states: 403,567,360,450 (11)
abstracting: (1<=p3)
states: 403,568,103,089 (11)
abstracting: (1<=p9)
states: 403,568,103,089 (11)
abstracting: (1<=p5)
states: 403,567,360,450 (11)
abstracting: (1<=p1)
states: 403,568,103,089 (11)
abstracting: (1<=p7)
states: 403,567,360,450 (11)
abstracting: (1<=p3)
states: 403,568,103,089 (11)
abstracting: (1<=p7)
states: 403,567,360,450 (11)
abstracting: (1<=p3)
states: 403,568,103,089 (11)
..
EG iterations: 2
-> the formula is TRUE
FORMULA PGCD-PT-D03N050-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.128sec
checking: AG [[AF [E [[1<=p0 & [1<=p4 & 1<=p8]] U [1<=p3 & [1<=p7 & 1<=p11]]]] | AF [[[EX [[p1<=0 | [p5<=0 | p9<=0]]] | [AX [[3<=p0 & 1<=p8]] | p1<=0]] | [p5<=0 | [p9<=0 | EF [[1<=p0 & [1<=p4 & 1<=p8]]]]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[[p5<=0 | [p9<=0 | E [true U [1<=p0 & [1<=p4 & 1<=p8]]]]] | [[p1<=0 | ~ [EX [~ [[3<=p0 & 1<=p8]]]]] | EX [[p1<=0 | [p5<=0 | p9<=0]]]]]]]] | ~ [EG [~ [E [[1<=p0 & [1<=p4 & 1<=p8]] U [1<=p3 & [1<=p7 & 1<=p11]]]]]]]]]]
abstracting: (1<=p11)
states: 403,568,103,089 (11)
abstracting: (1<=p7)
states: 403,567,360,450 (11)
abstracting: (1<=p3)
states: 403,568,103,089 (11)
abstracting: (1<=p8)
states: 403,568,103,089 (11)
abstracting: (1<=p4)
states: 403,567,360,450 (11)
abstracting: (1<=p0)
states: 403,568,103,089 (11)
..
EG iterations: 2
abstracting: (p9<=0)
states: 13,646,468,154 (10)
abstracting: (p5<=0)
states: 13,647,210,793 (10)
abstracting: (p1<=0)
states: 13,646,468,154 (10)
.abstracting: (1<=p8)
states: 403,568,103,089 (11)
abstracting: (3<=p0)
states: 377,046,326,647 (11)
.abstracting: (p1<=0)
states: 13,646,468,154 (10)
abstracting: (1<=p8)
states: 403,568,103,089 (11)
abstracting: (1<=p4)
states: 403,567,360,450 (11)
abstracting: (1<=p0)
states: 403,568,103,089 (11)
abstracting: (p9<=0)
states: 13,646,468,154 (10)
abstracting: (p5<=0)
states: 13,647,210,793 (10)
.
EG iterations: 1
-> the formula is TRUE
FORMULA PGCD-PT-D03N050-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.751sec
checking: EX [E [~ [E [[[[1<=p3 & [1<=p7 & 1<=p11]] | [1<=p0 & 1<=p4]] & AX [[1<=p1 & [1<=p5 & 1<=p9]]]] U AX [[1<=p3 & [1<=p7 & 1<=p11]]]]] U [[3<=p0 & 1<=p8] & [AG [[1<=p3 & 1<=p7]] & [3<=p2 & 1<=p10]]]]]
normalized: EX [E [~ [E [[~ [EX [~ [[1<=p1 & [1<=p5 & 1<=p9]]]]] & [[1<=p0 & 1<=p4] | [1<=p3 & [1<=p7 & 1<=p11]]]] U ~ [EX [~ [[1<=p3 & [1<=p7 & 1<=p11]]]]]]] U [[[3<=p2 & 1<=p10] & ~ [E [true U ~ [[1<=p3 & 1<=p7]]]]] & [3<=p0 & 1<=p8]]]]
abstracting: (1<=p8)
states: 403,568,103,089 (11)
abstracting: (3<=p0)
states: 377,046,326,647 (11)
abstracting: (1<=p7)
states: 403,567,360,450 (11)
abstracting: (1<=p3)
states: 403,568,103,089 (11)
abstracting: (1<=p10)
states: 403,568,103,089 (11)
abstracting: (3<=p2)
states: 377,046,326,647 (11)
abstracting: (1<=p11)
states: 403,568,103,089 (11)
abstracting: (1<=p7)
states: 403,567,360,450 (11)
abstracting: (1<=p3)
states: 403,568,103,089 (11)
.abstracting: (1<=p11)
states: 403,568,103,089 (11)
abstracting: (1<=p7)
states: 403,567,360,450 (11)
abstracting: (1<=p3)
states: 403,568,103,089 (11)
abstracting: (1<=p4)
states: 403,567,360,450 (11)
abstracting: (1<=p0)
states: 403,568,103,089 (11)
abstracting: (1<=p9)
states: 403,568,103,089 (11)
abstracting: (1<=p5)
states: 403,567,360,450 (11)
abstracting: (1<=p1)
states: 403,568,103,089 (11)
..-> the formula is FALSE
FORMULA PGCD-PT-D03N050-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.417sec
checking: ~ [A [AF [[A [E [[3<=p2 & 1<=p10] U [3<=p0 & 1<=p8]] U [1<=p0 & [1<=p4 & 1<=p8]]] | AF [[[1<=p1 & 1<=p5] | [1<=p1 & [1<=p5 & 1<=p9]]]]]] U [~ [[[~ [AF [[3<=p2 & 1<=p10]]] | [3<=p3 & 1<=p11]] & [1<=p1 & 1<=p5]]] & AG [[3<=p2 & 1<=p10]]]]]
normalized: ~ [[~ [EG [~ [[~ [E [true U ~ [[3<=p2 & 1<=p10]]]] & ~ [[[1<=p1 & 1<=p5] & [[3<=p3 & 1<=p11] | EG [~ [[3<=p2 & 1<=p10]]]]]]]]]] & ~ [E [~ [[~ [E [true U ~ [[3<=p2 & 1<=p10]]]] & ~ [[[1<=p1 & 1<=p5] & [[3<=p3 & 1<=p11] | EG [~ [[3<=p2 & 1<=p10]]]]]]]] U [EG [~ [[~ [EG [~ [[[1<=p1 & [1<=p5 & 1<=p9]] | [1<=p1 & 1<=p5]]]]] | [~ [EG [~ [[1<=p0 & [1<=p4 & 1<=p8]]]]] & ~ [E [~ [[1<=p0 & [1<=p4 & 1<=p8]]] U [~ [E [[3<=p2 & 1<=p10] U [3<=p0 & 1<=p8]]] & ~ [[1<=p0 & [1<=p4 & 1<=p8]]]]]]]]]] & ~ [[~ [E [true U ~ [[3<=p2 & 1<=p10]]]] & ~ [[[1<=p1 & 1<=p5] & [[3<=p3 & 1<=p11] | EG [~ [[3<=p2 & 1<=p10]]]]]]]]]]]]]
abstracting: (1<=p10)
states: 403,568,103,089 (11)
abstracting: (3<=p2)
states: 377,046,326,647 (11)
.
EG iterations: 1
abstracting: (1<=p11)
states: 403,568,103,089 (11)
abstracting: (3<=p3)
states: 377,046,326,647 (11)
abstracting: (1<=p5)
states: 403,567,360,450 (11)
abstracting: (1<=p1)
states: 403,568,103,089 (11)
abstracting: (1<=p10)
states: 403,568,103,089 (11)
abstracting: (3<=p2)
states: 377,046,326,647 (11)
abstracting: (1<=p8)
states: 403,568,103,089 (11)
abstracting: (1<=p4)
states: 403,567,360,450 (11)
abstracting: (1<=p0)
states: 403,568,103,089 (11)
abstracting: (1<=p8)
states: 403,568,103,089 (11)
abstracting: (3<=p0)
states: 377,046,326,647 (11)
abstracting: (1<=p10)
states: 403,568,103,089 (11)
abstracting: (3<=p2)
states: 377,046,326,647 (11)
abstracting: (1<=p8)
states: 403,568,103,089 (11)
abstracting: (1<=p4)
states: 403,567,360,450 (11)
abstracting: (1<=p0)
states: 403,568,103,089 (11)
abstracting: (1<=p8)
states: 403,568,103,089 (11)
abstracting: (1<=p4)
states: 403,567,360,450 (11)
abstracting: (1<=p0)
states: 403,568,103,089 (11)
..
EG iterations: 2
abstracting: (1<=p5)
states: 403,567,360,450 (11)
abstracting: (1<=p1)
states: 403,568,103,089 (11)
abstracting: (1<=p9)
states: 403,568,103,089 (11)
abstracting: (1<=p5)
states: 403,567,360,450 (11)
abstracting: (1<=p1)
states: 403,568,103,089 (11)
..
EG iterations: 2
..
EG iterations: 2
abstracting: (1<=p10)
states: 403,568,103,089 (11)
abstracting: (3<=p2)
states: 377,046,326,647 (11)
.
EG iterations: 1
abstracting: (1<=p11)
states: 403,568,103,089 (11)
abstracting: (3<=p3)
states: 377,046,326,647 (11)
abstracting: (1<=p5)
states: 403,567,360,450 (11)
abstracting: (1<=p1)
states: 403,568,103,089 (11)
abstracting: (1<=p10)
states: 403,568,103,089 (11)
abstracting: (3<=p2)
states: 377,046,326,647 (11)
abstracting: (1<=p10)
states: 403,568,103,089 (11)
abstracting: (3<=p2)
states: 377,046,326,647 (11)
.
EG iterations: 1
abstracting: (1<=p11)
states: 403,568,103,089 (11)
abstracting: (3<=p3)
states: 377,046,326,647 (11)
abstracting: (1<=p5)
states: 403,567,360,450 (11)
abstracting: (1<=p1)
states: 403,568,103,089 (11)
abstracting: (1<=p10)
states: 403,568,103,089 (11)
abstracting: (3<=p2)
states: 377,046,326,647 (11)
EG iterations: 0
-> the formula is TRUE
FORMULA PGCD-PT-D03N050-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m27.689sec
checking: EF [[[AG [[p1<=0 | p5<=0]] & [p3<=2 | p11<=0]] & [[EX [[p3<=2 | p11<=0]] | AF [[p3<=0 | [p7<=0 | p11<=0]]]] & [EX [[p3<=0 | p7<=0]] | [[p2<=0 | [p6<=0 | p10<=0]] & [[p1<=0 | [p5<=0 | p9<=0]] & [[p1<=2 | p9<=0] | [p1<=0 | p5<=0]]]]]]]]
normalized: E [true U [[[[[[[p1<=0 | p5<=0] | [p1<=2 | p9<=0]] & [p1<=0 | [p5<=0 | p9<=0]]] & [p2<=0 | [p6<=0 | p10<=0]]] | EX [[p3<=0 | p7<=0]]] & [~ [EG [~ [[p3<=0 | [p7<=0 | p11<=0]]]]] | EX [[p3<=2 | p11<=0]]]] & [[p3<=2 | p11<=0] & ~ [E [true U ~ [[p1<=0 | p5<=0]]]]]]]
abstracting: (p5<=0)
states: 13,647,210,793 (10)
abstracting: (p1<=0)
states: 13,646,468,154 (10)
abstracting: (p11<=0)
states: 13,646,468,154 (10)
abstracting: (p3<=2)
states: 40,168,244,596 (10)
abstracting: (p11<=0)
states: 13,646,468,154 (10)
abstracting: (p3<=2)
states: 40,168,244,596 (10)
.abstracting: (p11<=0)
states: 13,646,468,154 (10)
abstracting: (p7<=0)
states: 13,647,210,793 (10)
abstracting: (p3<=0)
states: 13,646,468,154 (10)
.
EG iterations: 1
abstracting: (p7<=0)
states: 13,647,210,793 (10)
abstracting: (p3<=0)
states: 13,646,468,154 (10)
.abstracting: (p10<=0)
states: 13,646,468,154 (10)
abstracting: (p6<=0)
states: 13,647,210,793 (10)
abstracting: (p2<=0)
states: 13,646,468,154 (10)
abstracting: (p9<=0)
states: 13,646,468,154 (10)
abstracting: (p5<=0)
states: 13,647,210,793 (10)
abstracting: (p1<=0)
states: 13,646,468,154 (10)
abstracting: (p9<=0)
states: 13,646,468,154 (10)
abstracting: (p1<=2)
states: 40,168,244,596 (10)
abstracting: (p5<=0)
states: 13,647,210,793 (10)
abstracting: (p1<=0)
states: 13,646,468,154 (10)
-> the formula is FALSE
FORMULA PGCD-PT-D03N050-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.642sec
checking: AX [[EX [[[~ [E [[3<=p2 & 1<=p10] U [1<=p2 & [1<=p6 & 1<=p10]]]] | p1<=2] | [p9<=0 | [[p1<=2 | p9<=0] & [p1<=0 | [p5<=0 | p9<=0]]]]]] & [EF [AG [[3<=p0 & 1<=p8]]] | [~ [E [[[3<=p1 & 1<=p9] & [1<=p0 & [1<=p4 & 1<=p8]]] U [3<=p1 & 1<=p9]]] & [p3<=2 | p11<=0]]]]]
normalized: ~ [EX [~ [[[[[p3<=2 | p11<=0] & ~ [E [[[1<=p0 & [1<=p4 & 1<=p8]] & [3<=p1 & 1<=p9]] U [3<=p1 & 1<=p9]]]] | E [true U ~ [E [true U ~ [[3<=p0 & 1<=p8]]]]]] & EX [[[p9<=0 | [[p1<=0 | [p5<=0 | p9<=0]] & [p1<=2 | p9<=0]]] | [p1<=2 | ~ [E [[3<=p2 & 1<=p10] U [1<=p2 & [1<=p6 & 1<=p10]]]]]]]]]]]
abstracting: (1<=p10)
states: 403,568,103,089 (11)
abstracting: (1<=p6)
states: 403,567,360,450 (11)
abstracting: (1<=p2)
states: 403,568,103,089 (11)
abstracting: (1<=p10)
states: 403,568,103,089 (11)
abstracting: (3<=p2)
states: 377,046,326,647 (11)
abstracting: (p1<=2)
states: 40,168,244,596 (10)
abstracting: (p9<=0)
states: 13,646,468,154 (10)
abstracting: (p1<=2)
states: 40,168,244,596 (10)
abstracting: (p9<=0)
states: 13,646,468,154 (10)
abstracting: (p5<=0)
states: 13,647,210,793 (10)
abstracting: (p1<=0)
states: 13,646,468,154 (10)
abstracting: (p9<=0)
states: 13,646,468,154 (10)
.abstracting: (1<=p8)
states: 403,568,103,089 (11)
abstracting: (3<=p0)
states: 377,046,326,647 (11)
abstracting: (1<=p9)
states: 403,568,103,089 (11)
abstracting: (3<=p1)
states: 377,046,326,647 (11)
abstracting: (1<=p9)
states: 403,568,103,089 (11)
abstracting: (3<=p1)
states: 377,046,326,647 (11)
abstracting: (1<=p8)
states: 403,568,103,089 (11)
abstracting: (1<=p4)
states: 403,567,360,450 (11)
abstracting: (1<=p0)
states: 403,568,103,089 (11)
abstracting: (p11<=0)
states: 13,646,468,154 (10)
abstracting: (p3<=2)
states: 40,168,244,596 (10)
.-> the formula is TRUE
FORMULA PGCD-PT-D03N050-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.845sec
checking: EF [[A [[[[3<=p1 & 1<=p9] & [3<=p0 & [1<=p8 & 3<=p0]]] & [[1<=p8 & [1<=p0 & 1<=p4]] & [1<=p8 & [AF [[3<=p0 & 1<=p8]] & [[1<=p0 & 1<=p4] | [1<=p1 & [1<=p5 & 1<=p9]]]]]]] U [~ [[[1<=p2 & 1<=p6] & [1<=p10 & [3<=p2 & 1<=p10]]]] | EX [[3<=p0 & 1<=p8]]]] & [AX [[[[p0<=0 | [p4<=0 | p8<=0]] & [p2<=0 | [p6<=0 | p10<=0]]] | AG [[p0<=2 | p8<=0]]]] & [AF [[[p2<=2 | p10<=0] & [p0<=2 | p8<=0]]] | [~ [E [~ [[1<=p0 & [1<=p4 & 1<=p8]]] U AG [[1<=p2 & 1<=p6]]]] | ~ [A [[[1<=p3 & [1<=p7 & 1<=p11]] | [1<=p2 & [1<=p6 & 1<=p10]]] U [3<=p1 & 1<=p9]]]]]]]]
normalized: E [true U [[[[~ [[~ [EG [~ [[3<=p1 & 1<=p9]]]] & ~ [E [~ [[3<=p1 & 1<=p9]] U [~ [[[1<=p2 & [1<=p6 & 1<=p10]] | [1<=p3 & [1<=p7 & 1<=p11]]]] & ~ [[3<=p1 & 1<=p9]]]]]]] | ~ [E [~ [[1<=p0 & [1<=p4 & 1<=p8]]] U ~ [E [true U ~ [[1<=p2 & 1<=p6]]]]]]] | ~ [EG [~ [[[p0<=2 | p8<=0] & [p2<=2 | p10<=0]]]]]] & ~ [EX [~ [[~ [E [true U ~ [[p0<=2 | p8<=0]]]] | [[p2<=0 | [p6<=0 | p10<=0]] & [p0<=0 | [p4<=0 | p8<=0]]]]]]]] & [~ [EG [~ [[EX [[3<=p0 & 1<=p8]] | ~ [[[1<=p10 & [3<=p2 & 1<=p10]] & [1<=p2 & 1<=p6]]]]]]] & ~ [E [~ [[EX [[3<=p0 & 1<=p8]] | ~ [[[1<=p10 & [3<=p2 & 1<=p10]] & [1<=p2 & 1<=p6]]]]] U [~ [[[[1<=p8 & [[[1<=p1 & [1<=p5 & 1<=p9]] | [1<=p0 & 1<=p4]] & ~ [EG [~ [[3<=p0 & 1<=p8]]]]]] & [1<=p8 & [1<=p0 & 1<=p4]]] & [[3<=p0 & [1<=p8 & 3<=p0]] & [3<=p1 & 1<=p9]]]] & ~ [[EX [[3<=p0 & 1<=p8]] | ~ [[[1<=p10 & [3<=p2 & 1<=p10]] & [1<=p2 & 1<=p6]]]]]]]]]]]
abstracting: (1<=p6)
states: 403,567,360,450 (11)
abstracting: (1<=p2)
states: 403,568,103,089 (11)
abstracting: (1<=p10)
states: 403,568,103,089 (11)
abstracting: (3<=p2)
states: 377,046,326,647 (11)
abstracting: (1<=p10)
states: 403,568,103,089 (11)
abstracting: (1<=p8)
states: 403,568,103,089 (11)
abstracting: (3<=p0)
states: 377,046,326,647 (11)
.abstracting: (1<=p9)
states: 403,568,103,089 (11)
abstracting: (3<=p1)
states: 377,046,326,647 (11)
abstracting: (3<=p0)
states: 377,046,326,647 (11)
abstracting: (1<=p8)
states: 403,568,103,089 (11)
abstracting: (3<=p0)
states: 377,046,326,647 (11)
abstracting: (1<=p4)
states: 403,567,360,450 (11)
abstracting: (1<=p0)
states: 403,568,103,089 (11)
abstracting: (1<=p8)
states: 403,568,103,089 (11)
abstracting: (1<=p8)
states: 403,568,103,089 (11)
abstracting: (3<=p0)
states: 377,046,326,647 (11)
.
EG iterations: 1
abstracting: (1<=p4)
states: 403,567,360,450 (11)
abstracting: (1<=p0)
states: 403,568,103,089 (11)
abstracting: (1<=p9)
states: 403,568,103,089 (11)
abstracting: (1<=p5)
states: 403,567,360,450 (11)
abstracting: (1<=p1)
states: 403,568,103,089 (11)
abstracting: (1<=p8)
states: 403,568,103,089 (11)
abstracting: (1<=p6)
states: 403,567,360,450 (11)
abstracting: (1<=p2)
states: 403,568,103,089 (11)
abstracting: (1<=p10)
states: 403,568,103,089 (11)
abstracting: (3<=p2)
states: 377,046,326,647 (11)
abstracting: (1<=p10)
states: 403,568,103,089 (11)
abstracting: (1<=p8)
states: 403,568,103,089 (11)
abstracting: (3<=p0)
states: 377,046,326,647 (11)
.abstracting: (1<=p6)
states: 403,567,360,450 (11)
abstracting: (1<=p2)
states: 403,568,103,089 (11)
abstracting: (1<=p10)
states: 403,568,103,089 (11)
abstracting: (3<=p2)
states: 377,046,326,647 (11)
abstracting: (1<=p10)
states: 403,568,103,089 (11)
abstracting: (1<=p8)
states: 403,568,103,089 (11)
abstracting: (3<=p0)
states: 377,046,326,647 (11)
..
EG iterations: 1
abstracting: (p8<=0)
states: 13,646,468,154 (10)
abstracting: (p4<=0)
states: 13,647,210,793 (10)
abstracting: (p0<=0)
states: 13,646,468,154 (10)
abstracting: (p10<=0)
states: 13,646,468,154 (10)
abstracting: (p6<=0)
states: 13,647,210,793 (10)
abstracting: (p2<=0)
states: 13,646,468,154 (10)
abstracting: (p8<=0)
states: 13,646,468,154 (10)
abstracting: (p0<=2)
states: 40,168,244,596 (10)
.abstracting: (p10<=0)
states: 13,646,468,154 (10)
abstracting: (p2<=2)
states: 40,168,244,596 (10)
abstracting: (p8<=0)
states: 13,646,468,154 (10)
abstracting: (p0<=2)
states: 40,168,244,596 (10)
.
EG iterations: 1
abstracting: (1<=p6)
states: 403,567,360,450 (11)
abstracting: (1<=p2)
states: 403,568,103,089 (11)
abstracting: (1<=p8)
states: 403,568,103,089 (11)
abstracting: (1<=p4)
states: 403,567,360,450 (11)
abstracting: (1<=p0)
states: 403,568,103,089 (11)
abstracting: (1<=p9)
states: 403,568,103,089 (11)
abstracting: (3<=p1)
states: 377,046,326,647 (11)
abstracting: (1<=p11)
states: 403,568,103,089 (11)
abstracting: (1<=p7)
states: 403,567,360,450 (11)
abstracting: (1<=p3)
states: 403,568,103,089 (11)
abstracting: (1<=p10)
states: 403,568,103,089 (11)
abstracting: (1<=p6)
states: 403,567,360,450 (11)
abstracting: (1<=p2)
states: 403,568,103,089 (11)
abstracting: (1<=p9)
states: 403,568,103,089 (11)
abstracting: (3<=p1)
states: 377,046,326,647 (11)
abstracting: (1<=p9)
states: 403,568,103,089 (11)
abstracting: (3<=p1)
states: 377,046,326,647 (11)
.
EG iterations: 1
-> the formula is TRUE
FORMULA PGCD-PT-D03N050-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m30.687sec
totally nodes used: 11786494 (1.2e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 258896732 29351032 288247764
used/not used/entry size/cache size: 28675579 38433285 16 1024MB
basic ops cache: hits/miss/sum: 94842383 14471608 109313991
used/not used/entry size/cache size: 10188636 6588580 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: 1637345 276576 1913921
used/not used/entry size/cache size: 271282 8117326 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 57469629
1 7829440
2 1610715
3 172503
4 17383
5 3763
6 2302
7 882
8 251
9 504
>= 10 1492
Total processing time: 2m19.719sec
BK_STOP 1680818692316
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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:11549 (962), effective:3858 (321)
initing FirstDep: 0m 0.000sec
iterations count:45 (3), effective:9 (0)
iterations count:406 (33), effective:197 (16)
iterations count:46 (3), effective:9 (0)
iterations count:410 (34), effective:199 (16)
iterations count:410 (34), effective:199 (16)
iterations count:708 (59), effective:199 (16)
iterations count:410 (34), effective:199 (16)
iterations count:410 (34), effective:199 (16)
iterations count:43 (3), effective:8 (0)
iterations count:36 (3), effective:6 (0)
iterations count:211 (17), effective:199 (16)
iterations count:312 (26), effective:100 (8)
iterations count:43 (3), effective:8 (0)
iterations count:43 (3), effective:8 (0)
iterations count:43 (3), effective:8 (0)
iterations count:43 (3), effective:8 (0)
iterations count:410 (34), effective:199 (16)
iterations count:208 (17), effective:196 (16)
iterations count:410 (34), effective:199 (16)
iterations count:33 (2), effective:5 (0)
iterations count:410 (34), effective:199 (16)
iterations count:312 (26), effective:100 (8)
iterations count:36 (3), effective:7 (0)
iterations count:43 (3), effective:8 (0)
iterations count:36 (3), effective:7 (0)
iterations count:312 (26), effective:100 (8)
iterations count:93 (7), effective:23 (1)
iterations count:708 (59), effective:199 (16)
iterations count:38 (3), effective:9 (0)
iterations count:708 (59), effective:199 (16)
iterations count:708 (59), effective:199 (16)
iterations count:725 (60), effective:301 (25)
iterations count:708 (59), effective:199 (16)
iterations count:40 (3), effective:7 (0)
iterations count:15 (1), effective:1 (0)
iterations count:410 (34), effective:199 (16)
iterations count:12 (1), effective:0 (0)
iterations count:12 (1), effective:0 (0)
iterations count:36 (3), effective:8 (0)
iterations count:412 (34), effective:100 (8)
iterations count:712 (59), effective:200 (16)
iterations count:2028 (169), effective:701 (58)
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="PGCD-PT-D03N050"
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 PGCD-PT-D03N050, 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 r522-tall-167987247400458"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PGCD-PT-D03N050.tgz
mv PGCD-PT-D03N050 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 ;