About the Execution of Marcie+red for PGCD-PT-D04N025
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10545.216 | 104443.00 | 108209.00 | 685.40 | FTFFFFFTTFFTFFFF | 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-167987247400466.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-D04N025, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247400466
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.6K Mar 23 15:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 23 15:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 23 15:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Mar 23 15:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Mar 23 15:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 23 15:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Mar 23 15:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K 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 9.3K 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-D04N025-CTLFireability-00
FORMULA_NAME PGCD-PT-D04N025-CTLFireability-01
FORMULA_NAME PGCD-PT-D04N025-CTLFireability-02
FORMULA_NAME PGCD-PT-D04N025-CTLFireability-03
FORMULA_NAME PGCD-PT-D04N025-CTLFireability-04
FORMULA_NAME PGCD-PT-D04N025-CTLFireability-05
FORMULA_NAME PGCD-PT-D04N025-CTLFireability-06
FORMULA_NAME PGCD-PT-D04N025-CTLFireability-07
FORMULA_NAME PGCD-PT-D04N025-CTLFireability-08
FORMULA_NAME PGCD-PT-D04N025-CTLFireability-09
FORMULA_NAME PGCD-PT-D04N025-CTLFireability-10
FORMULA_NAME PGCD-PT-D04N025-CTLFireability-11
FORMULA_NAME PGCD-PT-D04N025-CTLFireability-12
FORMULA_NAME PGCD-PT-D04N025-CTLFireability-13
FORMULA_NAME PGCD-PT-D04N025-CTLFireability-14
FORMULA_NAME PGCD-PT-D04N025-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1680818714753
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-D04N025
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-06 22:05:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-06 22:05:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 22:05:16] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2023-04-06 22:05:16] [INFO ] Transformed 15 places.
[2023-04-06 22:05:16] [INFO ] Transformed 15 transitions.
[2023-04-06 22:05:16] [INFO ] Parsed PT model containing 15 places and 15 transitions and 70 arcs in 76 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 15 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 8 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 15 cols
[2023-04-06 22:05:16] [INFO ] Computed 6 invariants in 9 ms
[2023-04-06 22:05:16] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
[2023-04-06 22:05:16] [INFO ] Invariant cache hit.
[2023-04-06 22:05:16] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-06 22:05:16] [INFO ] Invariant cache hit.
[2023-04-06 22:05:16] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-06 22:05:16] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-04-06 22:05:16] [INFO ] Invariant cache hit.
[2023-04-06 22:05:16] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 277 ms. Remains : 15/15 places, 15/15 transitions.
Support contains 15 out of 15 places after structural reductions.
[2023-04-06 22:05:16] [INFO ] Flatten gal took : 40 ms
[2023-04-06 22:05:16] [INFO ] Flatten gal took : 4 ms
[2023-04-06 22:05:17] [INFO ] Input system was already deterministic with 15 transitions.
Finished random walk after 837 steps, including 0 resets, run visited all 29 properties in 31 ms. (steps per millisecond=27 )
Parikh walk visited 0 properties in 0 ms.
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 3 ms
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 3 ms
[2023-04-06 22:05:17] [INFO ] Input system was already deterministic with 15 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 13 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-04-06 22:05:17] [INFO ] Invariant cache hit.
[2023-04-06 22:05:17] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57 ms. Remains : 15/15 places, 15/15 transitions.
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:05:17] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-04-06 22:05:17] [INFO ] Invariant cache hit.
[2023-04-06 22:05:17] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 15/15 places, 15/15 transitions.
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:05:17] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-04-06 22:05:17] [INFO ] Invariant cache hit.
[2023-04-06 22:05:17] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 15/15 places, 15/15 transitions.
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:05:17] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-04-06 22:05:17] [INFO ] Invariant cache hit.
[2023-04-06 22:05:17] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 15/15 places, 15/15 transitions.
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:05:17] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-04-06 22:05:17] [INFO ] Invariant cache hit.
[2023-04-06 22:05:17] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 15/15 places, 15/15 transitions.
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:05:17] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-04-06 22:05:17] [INFO ] Invariant cache hit.
[2023-04-06 22:05:17] [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 : 15/15 places, 15/15 transitions.
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:05:17] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-04-06 22:05:17] [INFO ] Invariant cache hit.
[2023-04-06 22:05:17] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 15/15 places, 15/15 transitions.
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:05:17] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-04-06 22:05:17] [INFO ] Invariant cache hit.
[2023-04-06 22:05:17] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 15/15 places, 15/15 transitions.
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:05:17] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-04-06 22:05:17] [INFO ] Invariant cache hit.
[2023-04-06 22:05:17] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 15/15 places, 15/15 transitions.
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:05:17] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-04-06 22:05:17] [INFO ] Invariant cache hit.
[2023-04-06 22:05:17] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 15/15 places, 15/15 transitions.
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:05:17] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-04-06 22:05:17] [INFO ] Invariant cache hit.
[2023-04-06 22:05:17] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 15/15 places, 15/15 transitions.
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:05:17] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-04-06 22:05:17] [INFO ] Invariant cache hit.
[2023-04-06 22:05:17] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 15/15 places, 15/15 transitions.
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:05:17] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-04-06 22:05:17] [INFO ] Invariant cache hit.
[2023-04-06 22:05:17] [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 : 15/15 places, 15/15 transitions.
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:05:17] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-04-06 22:05:17] [INFO ] Invariant cache hit.
[2023-04-06 22:05:17] [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 : 15/15 places, 15/15 transitions.
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:05:17] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-04-06 22:05:17] [INFO ] Invariant cache hit.
[2023-04-06 22:05:17] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 15/15 places, 15/15 transitions.
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:05:17] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-04-06 22:05:17] [INFO ] Invariant cache hit.
[2023-04-06 22:05:17] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 15/15 places, 15/15 transitions.
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:05:17] [INFO ] Input system was already deterministic with 15 transitions.
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:05:17] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:05:17] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-04-06 22:05:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 15 places, 15 transitions and 70 arcs took 0 ms.
Total runtime 1666 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: 15 NrTr: 15 NrArc: 70)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.783sec
RS generation: 0m 5.711sec
-> reachability set: #nodes 20489 (2.0e+04) #states 2,573,637,642,576 (12)
starting MCC model checker
--------------------------
checking: AG [AX [[3<=p0 & 1<=p10]]]
normalized: ~ [E [true U EX [~ [[3<=p0 & 1<=p10]]]]]
abstracting: (1<=p10)
states: 2,402,366,153,616 (12)
abstracting: (3<=p0)
states: 2,098,356,118,144 (12)
.-> the formula is FALSE
FORMULA PGCD-PT-D04N025-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.237sec
checking: AX [[1<=p1 & [1<=p6 & AX [[1<=p3 & 1<=p8]]]]]
normalized: ~ [EX [~ [[1<=p1 & [1<=p6 & ~ [EX [~ [[1<=p3 & 1<=p8]]]]]]]]]
abstracting: (1<=p8)
states: 2,402,362,138,176 (12)
abstracting: (1<=p3)
states: 2,402,366,153,616 (12)
.abstracting: (1<=p6)
states: 2,402,362,138,176 (12)
abstracting: (1<=p1)
states: 2,402,366,153,616 (12)
.-> the formula is FALSE
FORMULA PGCD-PT-D04N025-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.517sec
checking: EG [AF [[EF [[1<=p3 & [1<=p8 & 1<=p13]]] & AG [[p0<=2 | p10<=0]]]]]
normalized: EG [~ [EG [~ [[~ [E [true U ~ [[p0<=2 | p10<=0]]]] & E [true U [1<=p3 & [1<=p8 & 1<=p13]]]]]]]]
abstracting: (1<=p13)
states: 2,402,366,153,616 (12)
abstracting: (1<=p8)
states: 2,402,362,138,176 (12)
abstracting: (1<=p3)
states: 2,402,366,153,616 (12)
abstracting: (p10<=0)
states: 171,271,488,960 (11)
abstracting: (p0<=2)
states: 475,281,524,432 (11)
EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE
FORMULA PGCD-PT-D04N025-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.071sec
checking: EG [EX [A [[[3<=p3 & 1<=p13] | [3<=p4 & 1<=p14]] U [1<=p1 & 1<=p6]]]]
normalized: EG [EX [[~ [EG [~ [[1<=p1 & 1<=p6]]]] & ~ [E [~ [[1<=p1 & 1<=p6]] U [~ [[[3<=p4 & 1<=p14] | [3<=p3 & 1<=p13]]] & ~ [[1<=p1 & 1<=p6]]]]]]]]
abstracting: (1<=p6)
states: 2,402,362,138,176 (12)
abstracting: (1<=p1)
states: 2,402,366,153,616 (12)
abstracting: (1<=p13)
states: 2,402,366,153,616 (12)
abstracting: (3<=p3)
states: 2,098,356,118,144 (12)
abstracting: (1<=p14)
states: 2,402,366,153,616 (12)
abstracting: (3<=p4)
states: 2,098,356,118,144 (12)
abstracting: (1<=p6)
states: 2,402,362,138,176 (12)
abstracting: (1<=p1)
states: 2,402,366,153,616 (12)
abstracting: (1<=p6)
states: 2,402,362,138,176 (12)
abstracting: (1<=p1)
states: 2,402,366,153,616 (12)
......
EG iterations: 6
...
EG iterations: 2
-> the formula is TRUE
FORMULA PGCD-PT-D04N025-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 7.623sec
checking: EX [[[3<=p1 & 1<=p11] & [EF [[1<=p4 & [1<=p9 & 1<=p14]]] & [1<=p1 & 1<=p6]]]]
normalized: EX [[[[1<=p1 & 1<=p6] & E [true U [1<=p4 & [1<=p9 & 1<=p14]]]] & [3<=p1 & 1<=p11]]]
abstracting: (1<=p11)
states: 2,402,366,153,616 (12)
abstracting: (3<=p1)
states: 2,098,356,118,144 (12)
abstracting: (1<=p14)
states: 2,402,366,153,616 (12)
abstracting: (1<=p9)
states: 2,402,362,138,176 (12)
abstracting: (1<=p4)
states: 2,402,366,153,616 (12)
abstracting: (1<=p6)
states: 2,402,362,138,176 (12)
abstracting: (1<=p1)
states: 2,402,366,153,616 (12)
.-> the formula is FALSE
FORMULA PGCD-PT-D04N025-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.357sec
checking: EX [EG [[AX [[p2<=0 | [p7<=0 | p12<=0]]] & [[p3<=2 | p13<=0] & [p0<=2 | p10<=0]]]]]
normalized: EX [EG [[[[p0<=2 | p10<=0] & [p3<=2 | p13<=0]] & ~ [EX [~ [[p2<=0 | [p7<=0 | p12<=0]]]]]]]]
abstracting: (p12<=0)
states: 171,271,488,960 (11)
abstracting: (p7<=0)
states: 171,275,504,400 (11)
abstracting: (p2<=0)
states: 171,271,488,960 (11)
.abstracting: (p13<=0)
states: 171,271,488,960 (11)
abstracting: (p3<=2)
states: 475,281,524,432 (11)
abstracting: (p10<=0)
states: 171,271,488,960 (11)
abstracting: (p0<=2)
states: 475,281,524,432 (11)
.....
EG iterations: 5
.-> the formula is FALSE
FORMULA PGCD-PT-D04N025-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.429sec
checking: AF [[[1<=p2 & 1<=p7] & [AF [[p2<=0 | [p7<=0 | p12<=0]]] & [p4<=0 | p9<=0]]]]
normalized: ~ [EG [~ [[[[p4<=0 | p9<=0] & ~ [EG [~ [[p2<=0 | [p7<=0 | p12<=0]]]]]] & [1<=p2 & 1<=p7]]]]]
abstracting: (1<=p7)
states: 2,402,362,138,176 (12)
abstracting: (1<=p2)
states: 2,402,366,153,616 (12)
abstracting: (p12<=0)
states: 171,271,488,960 (11)
abstracting: (p7<=0)
states: 171,275,504,400 (11)
abstracting: (p2<=0)
states: 171,271,488,960 (11)
..
EG iterations: 2
abstracting: (p9<=0)
states: 171,275,504,400 (11)
abstracting: (p4<=0)
states: 171,271,488,960 (11)
.
EG iterations: 1
-> the formula is FALSE
FORMULA PGCD-PT-D04N025-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.172sec
checking: [EF [EX [[3<=p1 & 1<=p11]]] & E [AF [AG [[EF [[3<=p1 & 1<=p11]] | [1<=p2 & 1<=p7]]]] U ~ [AX [[3<=p1 & 1<=p11]]]]]
normalized: [E [~ [EG [E [true U ~ [[[1<=p2 & 1<=p7] | E [true U [3<=p1 & 1<=p11]]]]]]] U EX [~ [[3<=p1 & 1<=p11]]]] & E [true U EX [[3<=p1 & 1<=p11]]]]
abstracting: (1<=p11)
states: 2,402,366,153,616 (12)
abstracting: (3<=p1)
states: 2,098,356,118,144 (12)
.abstracting: (1<=p11)
states: 2,402,366,153,616 (12)
abstracting: (3<=p1)
states: 2,098,356,118,144 (12)
.abstracting: (1<=p11)
states: 2,402,366,153,616 (12)
abstracting: (3<=p1)
states: 2,098,356,118,144 (12)
abstracting: (1<=p7)
states: 2,402,362,138,176 (12)
abstracting: (1<=p2)
states: 2,402,366,153,616 (12)
EG iterations: 0
-> the formula is TRUE
FORMULA PGCD-PT-D04N025-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m24.154sec
checking: EG [E [AX [[1<=p3 & [1<=p8 & 1<=p13]]] U E [EX [AF [[3<=p1 & 1<=p11]]] U AX [[[1<=p0 & 1<=p5] & [3<=p4 & 1<=p14]]]]]]
normalized: EG [E [~ [EX [~ [[1<=p3 & [1<=p8 & 1<=p13]]]]] U E [EX [~ [EG [~ [[3<=p1 & 1<=p11]]]]] U ~ [EX [~ [[[3<=p4 & 1<=p14] & [1<=p0 & 1<=p5]]]]]]]]
abstracting: (1<=p5)
states: 2,402,362,138,176 (12)
abstracting: (1<=p0)
states: 2,402,366,153,616 (12)
abstracting: (1<=p14)
states: 2,402,366,153,616 (12)
abstracting: (3<=p4)
states: 2,098,356,118,144 (12)
.abstracting: (1<=p11)
states: 2,402,366,153,616 (12)
abstracting: (3<=p1)
states: 2,098,356,118,144 (12)
.
EG iterations: 1
.abstracting: (1<=p13)
states: 2,402,366,153,616 (12)
abstracting: (1<=p8)
states: 2,402,362,138,176 (12)
abstracting: (1<=p3)
states: 2,402,366,153,616 (12)
...
EG iterations: 2
-> the formula is FALSE
FORMULA PGCD-PT-D04N025-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 5.224sec
checking: AF [[[[1<=p7 & 1<=p2] & [1<=p3 & 1<=p8]] & [[1<=p13 & AF [[3<=p3 & 1<=p13]]] & [3<=p3 & [p0<=0 | [p5<=0 | p10<=0]]]]]]
normalized: ~ [EG [~ [[[[3<=p3 & [p0<=0 | [p5<=0 | p10<=0]]] & [1<=p13 & ~ [EG [~ [[3<=p3 & 1<=p13]]]]]] & [[1<=p3 & 1<=p8] & [1<=p7 & 1<=p2]]]]]]
abstracting: (1<=p2)
states: 2,402,366,153,616 (12)
abstracting: (1<=p7)
states: 2,402,362,138,176 (12)
abstracting: (1<=p8)
states: 2,402,362,138,176 (12)
abstracting: (1<=p3)
states: 2,402,366,153,616 (12)
abstracting: (1<=p13)
states: 2,402,366,153,616 (12)
abstracting: (3<=p3)
states: 2,098,356,118,144 (12)
.
EG iterations: 1
abstracting: (1<=p13)
states: 2,402,366,153,616 (12)
abstracting: (p10<=0)
states: 171,271,488,960 (11)
abstracting: (p5<=0)
states: 171,275,504,400 (11)
abstracting: (p0<=0)
states: 171,271,488,960 (11)
abstracting: (3<=p3)
states: 2,098,356,118,144 (12)
.
EG iterations: 1
-> the formula is FALSE
FORMULA PGCD-PT-D04N025-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.603sec
checking: A [EG [AF [E [[[1<=p4 & 1<=p9] & [3<=p3 & 1<=p13]] U [[1<=p0 & [1<=p5 & 1<=p10]] | [1<=p4 & 1<=p9]]]]] U ~ [[1<=p0 & [1<=p5 & 1<=p10]]]]
normalized: [~ [EG [[1<=p0 & [1<=p5 & 1<=p10]]]] & ~ [E [[1<=p0 & [1<=p5 & 1<=p10]] U [~ [EG [~ [EG [~ [E [[[3<=p3 & 1<=p13] & [1<=p4 & 1<=p9]] U [[1<=p4 & 1<=p9] | [1<=p0 & [1<=p5 & 1<=p10]]]]]]]]] & [1<=p0 & [1<=p5 & 1<=p10]]]]]]
abstracting: (1<=p10)
states: 2,402,366,153,616 (12)
abstracting: (1<=p5)
states: 2,402,362,138,176 (12)
abstracting: (1<=p0)
states: 2,402,366,153,616 (12)
abstracting: (1<=p10)
states: 2,402,366,153,616 (12)
abstracting: (1<=p5)
states: 2,402,362,138,176 (12)
abstracting: (1<=p0)
states: 2,402,366,153,616 (12)
abstracting: (1<=p9)
states: 2,402,362,138,176 (12)
abstracting: (1<=p4)
states: 2,402,366,153,616 (12)
abstracting: (1<=p9)
states: 2,402,362,138,176 (12)
abstracting: (1<=p4)
states: 2,402,366,153,616 (12)
abstracting: (1<=p13)
states: 2,402,366,153,616 (12)
abstracting: (3<=p3)
states: 2,098,356,118,144 (12)
.....
EG iterations: 5
...
EG iterations: 3
abstracting: (1<=p10)
states: 2,402,366,153,616 (12)
abstracting: (1<=p5)
states: 2,402,362,138,176 (12)
abstracting: (1<=p0)
states: 2,402,366,153,616 (12)
abstracting: (1<=p10)
states: 2,402,366,153,616 (12)
abstracting: (1<=p5)
states: 2,402,362,138,176 (12)
abstracting: (1<=p0)
states: 2,402,366,153,616 (12)
..
EG iterations: 2
-> the formula is FALSE
FORMULA PGCD-PT-D04N025-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m12.814sec
checking: E [EG [[~ [EG [[1<=p2 & [1<=p7 & 1<=p12]]]] & AG [~ [[1<=p2 & [1<=p7 & 1<=p12]]]]]] U [EX [E [~ [AG [[3<=p4 & 1<=p14]]] U AF [[1<=p1 & 1<=p6]]]] | ~ [AF [EG [[1<=p0 & 1<=p5]]]]]]
normalized: E [EG [[~ [E [true U [1<=p2 & [1<=p7 & 1<=p12]]]] & ~ [EG [[1<=p2 & [1<=p7 & 1<=p12]]]]]] U [EG [~ [EG [[1<=p0 & 1<=p5]]]] | EX [E [E [true U ~ [[3<=p4 & 1<=p14]]] U ~ [EG [~ [[1<=p1 & 1<=p6]]]]]]]]
abstracting: (1<=p6)
states: 2,402,362,138,176 (12)
abstracting: (1<=p1)
states: 2,402,366,153,616 (12)
......
EG iterations: 6
abstracting: (1<=p14)
states: 2,402,366,153,616 (12)
abstracting: (3<=p4)
states: 2,098,356,118,144 (12)
.abstracting: (1<=p5)
states: 2,402,362,138,176 (12)
abstracting: (1<=p0)
states: 2,402,366,153,616 (12)
..
EG iterations: 2
......
EG iterations: 6
abstracting: (1<=p12)
states: 2,402,366,153,616 (12)
abstracting: (1<=p7)
states: 2,402,362,138,176 (12)
abstracting: (1<=p2)
states: 2,402,366,153,616 (12)
..
EG iterations: 2
abstracting: (1<=p12)
states: 2,402,366,153,616 (12)
abstracting: (1<=p7)
states: 2,402,362,138,176 (12)
abstracting: (1<=p2)
states: 2,402,366,153,616 (12)
.
EG iterations: 1
-> the formula is TRUE
FORMULA PGCD-PT-D04N025-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.966sec
checking: AX [[EF [[p1<=2 | p11<=0]] | [[1<=p0 & 1<=p5] | [E [[1<=p0 & 1<=p5] U [3<=p3 & 1<=p13]] & [AG [[3<=p4 & 1<=p14]] | [1<=p4 & [1<=p9 & 1<=p14]]]]]]]
normalized: ~ [EX [~ [[[[[[1<=p4 & [1<=p9 & 1<=p14]] | ~ [E [true U ~ [[3<=p4 & 1<=p14]]]]] & E [[1<=p0 & 1<=p5] U [3<=p3 & 1<=p13]]] | [1<=p0 & 1<=p5]] | E [true U [p1<=2 | p11<=0]]]]]]
abstracting: (p11<=0)
states: 171,271,488,960 (11)
abstracting: (p1<=2)
states: 475,281,524,432 (11)
abstracting: (1<=p5)
states: 2,402,362,138,176 (12)
abstracting: (1<=p0)
states: 2,402,366,153,616 (12)
abstracting: (1<=p13)
states: 2,402,366,153,616 (12)
abstracting: (3<=p3)
states: 2,098,356,118,144 (12)
abstracting: (1<=p5)
states: 2,402,362,138,176 (12)
abstracting: (1<=p0)
states: 2,402,366,153,616 (12)
abstracting: (1<=p14)
states: 2,402,366,153,616 (12)
abstracting: (3<=p4)
states: 2,098,356,118,144 (12)
abstracting: (1<=p14)
states: 2,402,366,153,616 (12)
abstracting: (1<=p9)
states: 2,402,362,138,176 (12)
abstracting: (1<=p4)
states: 2,402,366,153,616 (12)
.-> the formula is TRUE
FORMULA PGCD-PT-D04N025-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.065sec
checking: A [E [EX [[E [[1<=p3 & [1<=p8 & 1<=p13]] U [1<=p1 & [1<=p6 & 1<=p11]]] | [3<=p2 & 1<=p12]]] U ~ [[[1<=p4 & 1<=p9] | [1<=p2 & 1<=p7]]]] U AG [EF [[EF [[1<=p4 & [1<=p9 & 1<=p14]]] | AF [[3<=p4 & 1<=p14]]]]]]
normalized: [~ [EG [E [true U ~ [E [true U [~ [EG [~ [[3<=p4 & 1<=p14]]]] | E [true U [1<=p4 & [1<=p9 & 1<=p14]]]]]]]]] & ~ [E [E [true U ~ [E [true U [~ [EG [~ [[3<=p4 & 1<=p14]]]] | E [true U [1<=p4 & [1<=p9 & 1<=p14]]]]]]] U [~ [E [EX [[E [[1<=p3 & [1<=p8 & 1<=p13]] U [1<=p1 & [1<=p6 & 1<=p11]]] | [3<=p2 & 1<=p12]]] U ~ [[[1<=p2 & 1<=p7] | [1<=p4 & 1<=p9]]]]] & E [true U ~ [E [true U [~ [EG [~ [[3<=p4 & 1<=p14]]]] | E [true U [1<=p4 & [1<=p9 & 1<=p14]]]]]]]]]]]
abstracting: (1<=p14)
states: 2,402,366,153,616 (12)
abstracting: (1<=p9)
states: 2,402,362,138,176 (12)
abstracting: (1<=p4)
states: 2,402,366,153,616 (12)
abstracting: (1<=p14)
states: 2,402,366,153,616 (12)
abstracting: (3<=p4)
states: 2,098,356,118,144 (12)
.
EG iterations: 1
abstracting: (1<=p9)
states: 2,402,362,138,176 (12)
abstracting: (1<=p4)
states: 2,402,366,153,616 (12)
abstracting: (1<=p7)
states: 2,402,362,138,176 (12)
abstracting: (1<=p2)
states: 2,402,366,153,616 (12)
abstracting: (1<=p12)
states: 2,402,366,153,616 (12)
abstracting: (3<=p2)
states: 2,098,356,118,144 (12)
abstracting: (1<=p11)
states: 2,402,366,153,616 (12)
abstracting: (1<=p6)
states: 2,402,362,138,176 (12)
abstracting: (1<=p1)
states: 2,402,366,153,616 (12)
abstracting: (1<=p13)
states: 2,402,366,153,616 (12)
abstracting: (1<=p8)
states: 2,402,362,138,176 (12)
abstracting: (1<=p3)
states: 2,402,366,153,616 (12)
.abstracting: (1<=p14)
states: 2,402,366,153,616 (12)
abstracting: (1<=p9)
states: 2,402,362,138,176 (12)
abstracting: (1<=p4)
states: 2,402,366,153,616 (12)
abstracting: (1<=p14)
states: 2,402,366,153,616 (12)
abstracting: (3<=p4)
states: 2,098,356,118,144 (12)
.
EG iterations: 1
abstracting: (1<=p14)
states: 2,402,366,153,616 (12)
abstracting: (1<=p9)
states: 2,402,362,138,176 (12)
abstracting: (1<=p4)
states: 2,402,366,153,616 (12)
abstracting: (1<=p14)
states: 2,402,366,153,616 (12)
abstracting: (3<=p4)
states: 2,098,356,118,144 (12)
.
EG iterations: 1
EG iterations: 0
-> the formula is FALSE
FORMULA PGCD-PT-D04N025-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 9.521sec
checking: A [~ [A [[[[1<=p1 & [1<=p6 & 1<=p11]] & [1<=p2 & [1<=p7 & 1<=p12]]] | A [[1<=p0 & [1<=p5 & 1<=p10]] U [3<=p4 & 1<=p14]]] U [EG [[3<=p0 & 1<=p10]] & EX [[1<=p2 & [1<=p7 & 1<=p12]]]]]] U AX [~ [E [EX [[3<=p1 & 1<=p11]] U [1<=p4 & [1<=p9 & 1<=p14]]]]]]
normalized: [~ [EG [EX [E [EX [[3<=p1 & 1<=p11]] U [1<=p4 & [1<=p9 & 1<=p14]]]]]] & ~ [E [EX [E [EX [[3<=p1 & 1<=p11]] U [1<=p4 & [1<=p9 & 1<=p14]]]] U [[~ [EG [~ [[EX [[1<=p2 & [1<=p7 & 1<=p12]]] & EG [[3<=p0 & 1<=p10]]]]]] & ~ [E [~ [[EX [[1<=p2 & [1<=p7 & 1<=p12]]] & EG [[3<=p0 & 1<=p10]]]] U [~ [[[~ [EG [~ [[3<=p4 & 1<=p14]]]] & ~ [E [~ [[3<=p4 & 1<=p14]] U [~ [[1<=p0 & [1<=p5 & 1<=p10]]] & ~ [[3<=p4 & 1<=p14]]]]]] | [[1<=p2 & [1<=p7 & 1<=p12]] & [1<=p1 & [1<=p6 & 1<=p11]]]]] & ~ [[EX [[1<=p2 & [1<=p7 & 1<=p12]]] & EG [[3<=p0 & 1<=p10]]]]]]]] & EX [E [EX [[3<=p1 & 1<=p11]] U [1<=p4 & [1<=p9 & 1<=p14]]]]]]]]
abstracting: (1<=p14)
states: 2,402,366,153,616 (12)
abstracting: (1<=p9)
states: 2,402,362,138,176 (12)
abstracting: (1<=p4)
states: 2,402,366,153,616 (12)
abstracting: (1<=p11)
states: 2,402,366,153,616 (12)
abstracting: (3<=p1)
states: 2,098,356,118,144 (12)
..abstracting: (1<=p10)
states: 2,402,366,153,616 (12)
abstracting: (3<=p0)
states: 2,098,356,118,144 (12)
.
EG iterations: 1
abstracting: (1<=p12)
states: 2,402,366,153,616 (12)
abstracting: (1<=p7)
states: 2,402,362,138,176 (12)
abstracting: (1<=p2)
states: 2,402,366,153,616 (12)
.abstracting: (1<=p11)
states: 2,402,366,153,616 (12)
abstracting: (1<=p6)
states: 2,402,362,138,176 (12)
abstracting: (1<=p1)
states: 2,402,366,153,616 (12)
abstracting: (1<=p12)
states: 2,402,366,153,616 (12)
abstracting: (1<=p7)
states: 2,402,362,138,176 (12)
abstracting: (1<=p2)
states: 2,402,366,153,616 (12)
abstracting: (1<=p14)
states: 2,402,366,153,616 (12)
abstracting: (3<=p4)
states: 2,098,356,118,144 (12)
abstracting: (1<=p10)
states: 2,402,366,153,616 (12)
abstracting: (1<=p5)
states: 2,402,362,138,176 (12)
abstracting: (1<=p0)
states: 2,402,366,153,616 (12)
abstracting: (1<=p14)
states: 2,402,366,153,616 (12)
abstracting: (3<=p4)
states: 2,098,356,118,144 (12)
abstracting: (1<=p14)
states: 2,402,366,153,616 (12)
abstracting: (3<=p4)
states: 2,098,356,118,144 (12)
.
EG iterations: 1
abstracting: (1<=p10)
states: 2,402,366,153,616 (12)
abstracting: (3<=p0)
states: 2,098,356,118,144 (12)
.
EG iterations: 1
abstracting: (1<=p12)
states: 2,402,366,153,616 (12)
abstracting: (1<=p7)
states: 2,402,362,138,176 (12)
abstracting: (1<=p2)
states: 2,402,366,153,616 (12)
.abstracting: (1<=p10)
states: 2,402,366,153,616 (12)
abstracting: (3<=p0)
states: 2,098,356,118,144 (12)
.
EG iterations: 1
abstracting: (1<=p12)
states: 2,402,366,153,616 (12)
abstracting: (1<=p7)
states: 2,402,362,138,176 (12)
abstracting: (1<=p2)
states: 2,402,366,153,616 (12)
..
EG iterations: 1
abstracting: (1<=p14)
states: 2,402,366,153,616 (12)
abstracting: (1<=p9)
states: 2,402,362,138,176 (12)
abstracting: (1<=p4)
states: 2,402,366,153,616 (12)
abstracting: (1<=p11)
states: 2,402,366,153,616 (12)
abstracting: (3<=p1)
states: 2,098,356,118,144 (12)
..abstracting: (1<=p14)
states: 2,402,366,153,616 (12)
abstracting: (1<=p9)
states: 2,402,362,138,176 (12)
abstracting: (1<=p4)
states: 2,402,366,153,616 (12)
abstracting: (1<=p11)
states: 2,402,366,153,616 (12)
abstracting: (3<=p1)
states: 2,098,356,118,144 (12)
....
EG iterations: 2
-> the formula is FALSE
FORMULA PGCD-PT-D04N025-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 7.989sec
checking: AF [[[~ [E [EX [[3<=p3 & 1<=p13]] U [[1<=p3 & [1<=p8 & 1<=p4]] & [1<=p9 & [1<=p3 & 1<=p8]]]]] | ~ [A [[3<=p4 & 1<=p14] U [[[3<=p1 & 1<=p11] | [1<=p3 & 1<=p8]] & A [[3<=p1 & 1<=p11] U [1<=p2 & 1<=p7]]]]]] & [[EX [[1<=p0 & [1<=p5 & ~ [A [[1<=p2 & [1<=p7 & 1<=p12]] U [1<=p4 & [1<=p9 & 1<=p14]]]]]]] | p0<=0] | [p5<=0 | [p10<=0 | EG [[p2<=0 | p7<=0]]]]]]]
normalized: ~ [EG [~ [[[[p5<=0 | [p10<=0 | EG [[p2<=0 | p7<=0]]]] | [p0<=0 | EX [[1<=p0 & [1<=p5 & ~ [[~ [EG [~ [[1<=p4 & [1<=p9 & 1<=p14]]]]] & ~ [E [~ [[1<=p4 & [1<=p9 & 1<=p14]]] U [~ [[1<=p2 & [1<=p7 & 1<=p12]]] & ~ [[1<=p4 & [1<=p9 & 1<=p14]]]]]]]]]]]]] & [~ [[~ [EG [~ [[[~ [EG [~ [[1<=p2 & 1<=p7]]]] & ~ [E [~ [[1<=p2 & 1<=p7]] U [~ [[3<=p1 & 1<=p11]] & ~ [[1<=p2 & 1<=p7]]]]]] & [[1<=p3 & 1<=p8] | [3<=p1 & 1<=p11]]]]]] & ~ [E [~ [[[~ [EG [~ [[1<=p2 & 1<=p7]]]] & ~ [E [~ [[1<=p2 & 1<=p7]] U [~ [[3<=p1 & 1<=p11]] & ~ [[1<=p2 & 1<=p7]]]]]] & [[1<=p3 & 1<=p8] | [3<=p1 & 1<=p11]]]] U [~ [[3<=p4 & 1<=p14]] & ~ [[[~ [EG [~ [[1<=p2 & 1<=p7]]]] & ~ [E [~ [[1<=p2 & 1<=p7]] U [~ [[3<=p1 & 1<=p11]] & ~ [[1<=p2 & 1<=p7]]]]]] & [[1<=p3 & 1<=p8] | [3<=p1 & 1<=p11]]]]]]]]] | ~ [E [EX [[3<=p3 & 1<=p13]] U [[1<=p9 & [1<=p3 & 1<=p8]] & [1<=p3 & [1<=p8 & 1<=p4]]]]]]]]]]
abstracting: (1<=p4)
states: 2,402,366,153,616 (12)
abstracting: (1<=p8)
states: 2,402,362,138,176 (12)
abstracting: (1<=p3)
states: 2,402,366,153,616 (12)
abstracting: (1<=p8)
states: 2,402,362,138,176 (12)
abstracting: (1<=p3)
states: 2,402,366,153,616 (12)
abstracting: (1<=p9)
states: 2,402,362,138,176 (12)
abstracting: (1<=p13)
states: 2,402,366,153,616 (12)
abstracting: (3<=p3)
states: 2,098,356,118,144 (12)
.abstracting: (1<=p11)
states: 2,402,366,153,616 (12)
abstracting: (3<=p1)
states: 2,098,356,118,144 (12)
abstracting: (1<=p8)
states: 2,402,362,138,176 (12)
abstracting: (1<=p3)
states: 2,402,366,153,616 (12)
abstracting: (1<=p7)
states: 2,402,362,138,176 (12)
abstracting: (1<=p2)
states: 2,402,366,153,616 (12)
abstracting: (1<=p11)
states: 2,402,366,153,616 (12)
abstracting: (3<=p1)
states: 2,098,356,118,144 (12)
abstracting: (1<=p7)
states: 2,402,362,138,176 (12)
abstracting: (1<=p2)
states: 2,402,366,153,616 (12)
abstracting: (1<=p7)
states: 2,402,362,138,176 (12)
abstracting: (1<=p2)
states: 2,402,366,153,616 (12)
......
EG iterations: 6
abstracting: (1<=p14)
states: 2,402,366,153,616 (12)
abstracting: (3<=p4)
states: 2,098,356,118,144 (12)
abstracting: (1<=p11)
states: 2,402,366,153,616 (12)
abstracting: (3<=p1)
states: 2,098,356,118,144 (12)
abstracting: (1<=p8)
states: 2,402,362,138,176 (12)
abstracting: (1<=p3)
states: 2,402,366,153,616 (12)
abstracting: (1<=p7)
states: 2,402,362,138,176 (12)
abstracting: (1<=p2)
states: 2,402,366,153,616 (12)
abstracting: (1<=p11)
states: 2,402,366,153,616 (12)
abstracting: (3<=p1)
states: 2,098,356,118,144 (12)
abstracting: (1<=p7)
states: 2,402,362,138,176 (12)
abstracting: (1<=p2)
states: 2,402,366,153,616 (12)
abstracting: (1<=p7)
states: 2,402,362,138,176 (12)
abstracting: (1<=p2)
states: 2,402,366,153,616 (12)
......
EG iterations: 6
abstracting: (1<=p11)
states: 2,402,366,153,616 (12)
abstracting: (3<=p1)
states: 2,098,356,118,144 (12)
abstracting: (1<=p8)
states: 2,402,362,138,176 (12)
abstracting: (1<=p3)
states: 2,402,366,153,616 (12)
abstracting: (1<=p7)
states: 2,402,362,138,176 (12)
abstracting: (1<=p2)
states: 2,402,366,153,616 (12)
abstracting: (1<=p11)
states: 2,402,366,153,616 (12)
abstracting: (3<=p1)
states: 2,098,356,118,144 (12)
abstracting: (1<=p7)
states: 2,402,362,138,176 (12)
abstracting: (1<=p2)
states: 2,402,366,153,616 (12)
abstracting: (1<=p7)
states: 2,402,362,138,176 (12)
abstracting: (1<=p2)
states: 2,402,366,153,616 (12)
......
EG iterations: 6
.
EG iterations: 1
abstracting: (1<=p14)
states: 2,402,366,153,616 (12)
abstracting: (1<=p9)
states: 2,402,362,138,176 (12)
abstracting: (1<=p4)
states: 2,402,366,153,616 (12)
abstracting: (1<=p12)
states: 2,402,366,153,616 (12)
abstracting: (1<=p7)
states: 2,402,362,138,176 (12)
abstracting: (1<=p2)
states: 2,402,366,153,616 (12)
abstracting: (1<=p14)
states: 2,402,366,153,616 (12)
abstracting: (1<=p9)
states: 2,402,362,138,176 (12)
abstracting: (1<=p4)
states: 2,402,366,153,616 (12)
abstracting: (1<=p14)
states: 2,402,366,153,616 (12)
abstracting: (1<=p9)
states: 2,402,362,138,176 (12)
abstracting: (1<=p4)
states: 2,402,366,153,616 (12)
......
EG iterations: 6
abstracting: (1<=p5)
states: 2,402,362,138,176 (12)
abstracting: (1<=p0)
states: 2,402,366,153,616 (12)
.abstracting: (p0<=0)
states: 171,271,488,960 (11)
abstracting: (p7<=0)
states: 171,275,504,400 (11)
abstracting: (p2<=0)
states: 171,271,488,960 (11)
......
EG iterations: 6
abstracting: (p10<=0)
states: 171,271,488,960 (11)
abstracting: (p5<=0)
states: 171,275,504,400 (11)
..
EG iterations: 2
-> the formula is FALSE
FORMULA PGCD-PT-D04N025-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.568sec
totally nodes used: 14060471 (1.4e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 315746425 39171294 354917719
used/not used/entry size/cache size: 34493968 32614896 16 1024MB
basic ops cache: hits/miss/sum: 126322169 14671489 140993658
used/not used/entry size/cache size: 11650895 5126321 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: 937481 199607 1137088
used/not used/entry size/cache size: 197197 8191411 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 55764513
1 9430668
2 1623925
3 210716
4 38185
5 12125
6 6674
7 4972
8 4094
9 2878
>= 10 10114
Total processing time: 1m40.279sec
BK_STOP 1680818819196
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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:13045 (869), effective:4432 (295)
initing FirstDep: 0m 0.000sec
iterations count:269 (17), effective:127 (8)
iterations count:54 (3), effective:9 (0)
iterations count:100 (6), effective:24 (1)
iterations count:847 (56), effective:256 (17)
iterations count:55 (3), effective:9 (0)
iterations count:145 (9), effective:34 (2)
iterations count:220 (14), effective:55 (3)
iterations count:4707 (313), effective:1532 (102)
iterations count:15 (1), effective:0 (0)
iterations count:219 (14), effective:61 (4)
iterations count:257 (17), effective:72 (4)
iterations count:15 (1), effective:0 (0)
iterations count:4432 (295), effective:1276 (85)
iterations count:399 (26), effective:128 (8)
iterations count:1059 (70), effective:324 (21)
iterations count:54 (3), effective:9 (0)
iterations count:15 (1), effective:0 (0)
iterations count:591 (39), effective:128 (8)
iterations count:160 (10), effective:36 (2)
iterations count:399 (26), effective:128 (8)
iterations count:55 (3), effective:9 (0)
iterations count:15 (1), effective:0 (0)
iterations count:4707 (313), effective:1532 (102)
iterations count:55 (3), effective:10 (0)
iterations count:467 (31), effective:129 (8)
iterations count:55 (3), effective:9 (0)
iterations count:15 (1), effective:0 (0)
iterations count:4707 (313), effective:1532 (102)
iterations count:1651 (110), effective:520 (34)
iterations count:55 (3), effective:9 (0)
iterations count:15 (1), effective:0 (0)
iterations count:4707 (313), effective:1532 (102)
iterations count:59 (3), effective:11 (0)
iterations count:143 (9), effective:128 (8)
iterations count:835 (55), effective:252 (16)
iterations count:59 (3), effective:11 (0)
iterations count:219 (14), effective:61 (4)
iterations count:59 (3), effective:11 (0)
iterations count:32 (2), effective:5 (0)
iterations count:527 (35), effective:128 (8)
iterations count:527 (35), effective:128 (8)
iterations count:399 (26), effective:128 (8)
iterations count:527 (35), effective:128 (8)
iterations count:275 (18), effective:65 (4)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PGCD-PT-D04N025"
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-D04N025, 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-167987247400466"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PGCD-PT-D04N025.tgz
mv PGCD-PT-D04N025 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 ;