About the Execution of Marcie+red for ResAllocation-PT-R003C020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6436.060 | 18272.00 | 22578.00 | 335.60 | FTFTFTFTTTFTFFFT | 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.r330-tall-167889203600706.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 ResAllocation-PT-R003C020, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203600706
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 6.0K Feb 25 15:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 15:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 15:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 15:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 25 15:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 203K Feb 25 15:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 15:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 15:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 143K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-00
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-01
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-02
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-03
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-04
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-05
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-06
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-07
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-08
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-09
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-10
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-11
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-12
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-13
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-14
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679180936804
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=ResAllocation-PT-R003C020
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:08:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 23:08:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:08:58] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2023-03-18 23:08:58] [INFO ] Transformed 120 places.
[2023-03-18 23:08:58] [INFO ] Transformed 80 transitions.
[2023-03-18 23:08:58] [INFO ] Parsed PT model containing 120 places and 80 transitions and 354 arcs in 113 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 101 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 80/80 transitions.
Applied a total of 0 rules in 10 ms. Remains 120 /120 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 120 cols
[2023-03-18 23:08:58] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-18 23:08:58] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-18 23:08:58] [INFO ] Invariant cache hit.
[2023-03-18 23:08:58] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2023-03-18 23:08:58] [INFO ] Invariant cache hit.
[2023-03-18 23:08:58] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 345 ms. Remains : 120/120 places, 80/80 transitions.
Support contains 101 out of 120 places after structural reductions.
[2023-03-18 23:08:58] [INFO ] Flatten gal took : 27 ms
[2023-03-18 23:08:58] [INFO ] Flatten gal took : 11 ms
[2023-03-18 23:08:58] [INFO ] Input system was already deterministic with 80 transitions.
Incomplete random walk after 10000 steps, including 232 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 72) seen :70
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-18 23:08:59] [INFO ] Invariant cache hit.
[2023-03-18 23:08:59] [INFO ] [Real]Absence check using 60 positive place invariants in 9 ms returned sat
[2023-03-18 23:08:59] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ResAllocation-PT-R003C020-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:08:59] [INFO ] Input system was already deterministic with 80 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 120 /120 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 120/120 places, 80/80 transitions.
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:08:59] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 120/120 places, 80/80 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 112 transition count 72
Applied a total of 16 rules in 16 ms. Remains 112 /120 variables (removed 8) and now considering 72/80 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 112/120 places, 72/80 transitions.
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:08:59] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 80/80 transitions.
Applied a total of 0 rules in 4 ms. Remains 120 /120 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 120/120 places, 80/80 transitions.
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:08:59] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 120 /120 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 120/120 places, 80/80 transitions.
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:08:59] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 120 /120 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 120/120 places, 80/80 transitions.
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:08:59] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 120 /120 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 120/120 places, 80/80 transitions.
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:08:59] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 120 /120 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 120/120 places, 80/80 transitions.
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:08:59] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 120 /120 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 120/120 places, 80/80 transitions.
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:08:59] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 120 /120 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 120/120 places, 80/80 transitions.
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:08:59] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 120 /120 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 120/120 places, 80/80 transitions.
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:08:59] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 120 /120 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 120/120 places, 80/80 transitions.
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:08:59] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 120 /120 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 120/120 places, 80/80 transitions.
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:08:59] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 120 /120 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 120/120 places, 80/80 transitions.
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:08:59] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 120/120 places, 80/80 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 100 transition count 61
Applied a total of 39 rules in 6 ms. Remains 100 /120 variables (removed 20) and now considering 61/80 (removed 19) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 100/120 places, 61/80 transitions.
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:08:59] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 120 /120 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 120/120 places, 80/80 transitions.
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:08:59] [INFO ] Input system was already deterministic with 80 transitions.
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:08:59] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:08:59] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-18 23:08:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 120 places, 80 transitions and 354 arcs took 0 ms.
Total runtime 1834 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: 120 NrTr: 80 NrArc: 354)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 2.671sec
RS generation: 0m 0.009sec
-> reachability set: #nodes 796 (8.0e+02) #states 406,454,747,136 (11)
starting MCC model checker
--------------------------
checking: EF [EX [AX [[1<=p69 & [1<=p72 & 1<=p75]]]]]
normalized: E [true U EX [~ [EX [~ [[[1<=p72 & 1<=p75] & 1<=p69]]]]]]
abstracting: (1<=p69)
states: 197,997,436,928 (11)
abstracting: (1<=p75)
states: 196,834,525,184 (11)
abstracting: (1<=p72)
states: 157,144,530,944 (11)
..-> the formula is TRUE
FORMULA ResAllocation-PT-R003C020-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.138sec
checking: EG [A [EF [1<=p6] U AX [~ [EF [[1<=p11 & [1<=p14 & 1<=p17]]]]]]]
normalized: EG [[~ [EG [EX [E [true U [[1<=p14 & 1<=p17] & 1<=p11]]]]] & ~ [E [EX [E [true U [[1<=p14 & 1<=p17] & 1<=p11]]] U [~ [E [true U 1<=p6]] & EX [E [true U [[1<=p14 & 1<=p17] & 1<=p11]]]]]]]]
abstracting: (1<=p11)
states: 210,780,602,368 (11)
abstracting: (1<=p17)
states: 187,599,323,136 (11)
abstracting: (1<=p14)
states: 122,432,421,888 (11)
.abstracting: (1<=p6)
states: 31,857,491,968 (10)
abstracting: (1<=p11)
states: 210,780,602,368 (11)
abstracting: (1<=p17)
states: 187,599,323,136 (11)
abstracting: (1<=p14)
states: 122,432,421,888 (11)
.abstracting: (1<=p11)
states: 210,780,602,368 (11)
abstracting: (1<=p17)
states: 187,599,323,136 (11)
abstracting: (1<=p14)
states: 122,432,421,888 (11)
..
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C020-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.097sec
checking: AF [[AG [[1<=p87 & [1<=p93 & 1<=p94]]] | 1<=p88]]
normalized: ~ [EG [~ [[~ [E [true U ~ [[[1<=p93 & 1<=p94] & 1<=p87]]]] | 1<=p88]]]]
abstracting: (1<=p88)
states: 51,167,100,928 (10)
abstracting: (1<=p87)
states: 195,127,943,168 (11)
abstracting: (1<=p94)
states: 161,221,197,824 (11)
abstracting: (1<=p93)
states: 202,262,413,312 (11)
.
EG iterations: 1
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C020-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.016sec
checking: AF [[AX [1<=p114] & AG [[AX [1<=p30] | [[1<=p63 & [1<=p69 & 1<=p70]] | 1<=p114]]]]]
normalized: ~ [EG [~ [[~ [E [true U ~ [[[[[1<=p69 & 1<=p70] & 1<=p63] | 1<=p114] | ~ [EX [~ [1<=p30]]]]]]] & ~ [EX [~ [1<=p114]]]]]]]
abstracting: (1<=p114)
states: 118,165,815,296 (11)
.abstracting: (1<=p30)
states: 51,167,100,928 (10)
.abstracting: (1<=p114)
states: 118,165,815,296 (11)
abstracting: (1<=p63)
states: 197,300,822,016 (11)
abstracting: (1<=p70)
states: 157,967,597,568 (11)
abstracting: (1<=p69)
states: 197,997,436,928 (11)
...............................
EG iterations: 31
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C020-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.407sec
checking: EG [EX [[~ [A [[1<=p114 | 1<=p18] U [1<=p102 | [1<=p63 & [1<=p69 & 1<=p70]]]]] & [EF [[p31<=0 | p37<=0]] | [1<=p100 & 1<=p76]]]]]
normalized: EG [EX [[[E [true U [p31<=0 | p37<=0]] | [1<=p100 & 1<=p76]] & ~ [[~ [EG [~ [[[[1<=p69 & 1<=p70] & 1<=p63] | 1<=p102]]]] & ~ [E [~ [[[[1<=p69 & 1<=p70] & 1<=p63] | 1<=p102]] U [~ [[[[1<=p69 & 1<=p70] & 1<=p63] | 1<=p102]] & ~ [[1<=p114 | 1<=p18]]]]]]]]]]
abstracting: (1<=p18)
states: 46,310,277,120 (10)
abstracting: (1<=p114)
states: 118,165,815,296 (11)
abstracting: (1<=p102)
states: 68,706,238,464 (10)
abstracting: (1<=p63)
states: 197,300,822,016 (11)
abstracting: (1<=p70)
states: 157,967,597,568 (11)
abstracting: (1<=p69)
states: 197,997,436,928 (11)
abstracting: (1<=p102)
states: 68,706,238,464 (10)
abstracting: (1<=p63)
states: 197,300,822,016 (11)
abstracting: (1<=p70)
states: 157,967,597,568 (11)
abstracting: (1<=p69)
states: 197,997,436,928 (11)
abstracting: (1<=p102)
states: 68,706,238,464 (10)
abstracting: (1<=p63)
states: 197,300,822,016 (11)
abstracting: (1<=p70)
states: 157,967,597,568 (11)
abstracting: (1<=p69)
states: 197,997,436,928 (11)
............................
EG iterations: 28
abstracting: (1<=p76)
states: 52,671,594,496 (10)
abstracting: (1<=p100)
states: 46,310,277,120 (10)
abstracting: (p37<=0)
states: 211,420,217,344 (11)
abstracting: (p31<=0)
states: 209,915,723,776 (11)
................................
EG iterations: 31
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C020-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.204sec
checking: A [AX [[~ [EG [1<=p28]] & [AX [AF [[1<=p21 & [1<=p24 & 1<=p27]]]] | [~ [[1<=p13 & [1<=p19 & 1<=p20]]] | [EF [[1<=p79 & 1<=p85]] & p54<=0]]]]] U ~ [AF [[1<=p85 & [1<=p91 & 1<=p92]]]]]
normalized: [~ [EG [~ [EG [~ [[1<=p85 & [1<=p91 & 1<=p92]]]]]]] & ~ [E [~ [EG [~ [[1<=p85 & [1<=p91 & 1<=p92]]]]] U [EX [~ [[[[[p54<=0 & E [true U [1<=p79 & 1<=p85]]] | ~ [[1<=p13 & [1<=p19 & 1<=p20]]]] | ~ [EX [EG [~ [[1<=p21 & [1<=p24 & 1<=p27]]]]]]] & ~ [EG [1<=p28]]]]] & ~ [EG [~ [[1<=p85 & [1<=p91 & 1<=p92]]]]]]]]]
abstracting: (1<=p92)
states: 109,797,220,352 (11)
abstracting: (1<=p91)
states: 198,882,017,280 (11)
abstracting: (1<=p85)
states: 193,383,710,720 (11)
............................
EG iterations: 28
abstracting: (1<=p28)
states: 57,423,544,320 (10)
..............................
EG iterations: 30
abstracting: (1<=p27)
states: 195,127,943,168 (11)
abstracting: (1<=p24)
states: 161,221,197,824 (11)
abstracting: (1<=p21)
states: 202,262,413,312 (11)
............................
EG iterations: 28
.abstracting: (1<=p20)
states: 94,395,113,472 (10)
abstracting: (1<=p19)
states: 198,923,272,192 (11)
abstracting: (1<=p13)
states: 191,369,953,280 (11)
abstracting: (1<=p85)
states: 193,383,710,720 (11)
abstracting: (1<=p79)
states: 196,380,016,640 (11)
abstracting: (p54<=0)
states: 353,273,806,848 (11)
.abstracting: (1<=p92)
states: 109,797,220,352 (11)
abstracting: (1<=p91)
states: 198,882,017,280 (11)
abstracting: (1<=p85)
states: 193,383,710,720 (11)
............................
EG iterations: 28
abstracting: (1<=p92)
states: 109,797,220,352 (11)
abstracting: (1<=p91)
states: 198,882,017,280 (11)
abstracting: (1<=p85)
states: 193,383,710,720 (11)
............................
EG iterations: 28
.............................
EG iterations: 29
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C020-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.027sec
checking: AF [AX [~ [A [[AG [[1<=p65 & 1<=p71]] | [[1<=p67 & 1<=p73] | 1<=p102]] U [[[1<=p47 & 1<=p50] & [1<=p53 & [1<=p67 & 1<=p73]]] | [[1<=p67 & 1<=p73] & [1<=p87 & [1<=p93 & 1<=p94]]]]]]]]
normalized: ~ [EG [EX [[~ [EG [~ [[[[1<=p47 & 1<=p50] & [[1<=p67 & 1<=p73] & 1<=p53]] | [[[1<=p93 & 1<=p94] & 1<=p87] & [1<=p67 & 1<=p73]]]]]] & ~ [E [~ [[[[1<=p47 & 1<=p50] & [[1<=p67 & 1<=p73] & 1<=p53]] | [[[1<=p93 & 1<=p94] & 1<=p87] & [1<=p67 & 1<=p73]]]] U [~ [[[[1<=p47 & 1<=p50] & [[1<=p67 & 1<=p73] & 1<=p53]] | [[[1<=p93 & 1<=p94] & 1<=p87] & [1<=p67 & 1<=p73]]]] & ~ [[~ [E [true U ~ [[1<=p65 & 1<=p71]]]] | [1<=p102 | [1<=p67 & 1<=p73]]]]]]]]]]]
abstracting: (1<=p73)
states: 194,882,977,792 (11)
abstracting: (1<=p67)
states: 195,759,570,944 (11)
abstracting: (1<=p102)
states: 68,706,238,464 (10)
abstracting: (1<=p71)
states: 195,815,555,072 (11)
abstracting: (1<=p65)
states: 195,306,209,280 (11)
abstracting: (1<=p73)
states: 194,882,977,792 (11)
abstracting: (1<=p67)
states: 195,759,570,944 (11)
abstracting: (1<=p87)
states: 195,127,943,168 (11)
abstracting: (1<=p94)
states: 161,221,197,824 (11)
abstracting: (1<=p93)
states: 202,262,413,312 (11)
abstracting: (1<=p53)
states: 195,277,094,912 (11)
abstracting: (1<=p73)
states: 194,882,977,792 (11)
abstracting: (1<=p67)
states: 195,759,570,944 (11)
abstracting: (1<=p50)
states: 104,826,503,168 (11)
abstracting: (1<=p47)
states: 195,759,570,944 (11)
abstracting: (1<=p73)
states: 194,882,977,792 (11)
abstracting: (1<=p67)
states: 195,759,570,944 (11)
abstracting: (1<=p87)
states: 195,127,943,168 (11)
abstracting: (1<=p94)
states: 161,221,197,824 (11)
abstracting: (1<=p93)
states: 202,262,413,312 (11)
abstracting: (1<=p53)
states: 195,277,094,912 (11)
abstracting: (1<=p73)
states: 194,882,977,792 (11)
abstracting: (1<=p67)
states: 195,759,570,944 (11)
abstracting: (1<=p50)
states: 104,826,503,168 (11)
abstracting: (1<=p47)
states: 195,759,570,944 (11)
abstracting: (1<=p73)
states: 194,882,977,792 (11)
abstracting: (1<=p67)
states: 195,759,570,944 (11)
abstracting: (1<=p87)
states: 195,127,943,168 (11)
abstracting: (1<=p94)
states: 161,221,197,824 (11)
abstracting: (1<=p93)
states: 202,262,413,312 (11)
abstracting: (1<=p53)
states: 195,277,094,912 (11)
abstracting: (1<=p73)
states: 194,882,977,792 (11)
abstracting: (1<=p67)
states: 195,759,570,944 (11)
abstracting: (1<=p50)
states: 104,826,503,168 (11)
abstracting: (1<=p47)
states: 195,759,570,944 (11)
.
EG iterations: 1
.............................
EG iterations: 28
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C020-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.397sec
checking: [AF [[[[EF [[1<=p91 & 1<=p97]] & EG [1<=p18]] | EX [[p71<=0 | [p74<=0 | p77<=0]]]] | [AF [p18<=0] | EF [[p111<=0 | [p117<=0 | p118<=0]]]]]] & AG [AF [[EX [[p49<=0 | [p55<=0 | p56<=0]]] | [AX [p64<=0] | AF [[1<=p112 | [1<=p91 & 1<=p97]]]]]]]]
normalized: [~ [E [true U EG [~ [[EX [[p49<=0 | [p55<=0 | p56<=0]]] | [~ [EG [~ [[1<=p112 | [1<=p91 & 1<=p97]]]]] | ~ [EX [~ [p64<=0]]]]]]]]] & ~ [EG [~ [[[[E [true U [1<=p91 & 1<=p97]] & EG [1<=p18]] | EX [[[p74<=0 | p77<=0] | p71<=0]]] | [E [true U [[p117<=0 | p118<=0] | p111<=0]] | ~ [EG [~ [p18<=0]]]]]]]]]
abstracting: (p18<=0)
states: 360,144,470,016 (11)
..............................
EG iterations: 30
abstracting: (p111<=0)
states: 230,453,837,824 (11)
abstracting: (p118<=0)
states: 219,156,119,552 (11)
abstracting: (p117<=0)
states: 160,072,163,328 (11)
abstracting: (p71<=0)
states: 210,639,192,064 (11)
abstracting: (p77<=0)
states: 211,420,217,344 (11)
abstracting: (p74<=0)
states: 302,823,940,096 (11)
.abstracting: (1<=p18)
states: 46,310,277,120 (10)
..............................
EG iterations: 30
abstracting: (1<=p97)
states: 187,599,323,136 (11)
abstracting: (1<=p91)
states: 198,882,017,280 (11)
.
EG iterations: 1
abstracting: (p64<=0)
states: 353,273,806,848 (11)
.abstracting: (1<=p97)
states: 187,599,323,136 (11)
abstracting: (1<=p91)
states: 198,882,017,280 (11)
abstracting: (1<=p112)
states: 31,857,491,968 (10)
...............................
EG iterations: 31
abstracting: (p56<=0)
states: 302,127,325,184 (11)
abstracting: (p55<=0)
states: 210,807,947,264 (11)
abstracting: (p49<=0)
states: 211,148,537,856 (11)
..
EG iterations: 1
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C020-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.446sec
checking: EF [[AX [A [[[AX [[1<=p109 & [1<=p115 & 1<=p116]]] & 1<=p15] & [1<=p21 & 1<=p22]] U AF [[1<=p105 & [1<=p108 & 1<=p111]]]]] & ~ [E [EX [EG [1<=p102]] U [A [[1<=p2 & 1<=p5] U [1<=p25 & [1<=p31 & 1<=p32]]] | ~ [[[1<=p2 & 1<=p5] | [1<=p93 & [1<=p96 & 1<=p99]]]]]]]]]
normalized: E [true U [~ [E [EX [EG [1<=p102]] U [~ [[[1<=p93 & [1<=p96 & 1<=p99]] | [1<=p2 & 1<=p5]]] | [~ [EG [~ [[1<=p25 & [1<=p31 & 1<=p32]]]]] & ~ [E [~ [[1<=p25 & [1<=p31 & 1<=p32]]] U [~ [[1<=p2 & 1<=p5]] & ~ [[1<=p25 & [1<=p31 & 1<=p32]]]]]]]]]] & ~ [EX [~ [[~ [EG [EG [~ [[1<=p105 & [1<=p108 & 1<=p111]]]]]] & ~ [E [EG [~ [[1<=p105 & [1<=p108 & 1<=p111]]]] U [~ [[[1<=p21 & 1<=p22] & [1<=p15 & ~ [EX [~ [[1<=p109 & [1<=p115 & 1<=p116]]]]]]]] & EG [~ [[1<=p105 & [1<=p108 & 1<=p111]]]]]]]]]]]]]
abstracting: (1<=p111)
states: 176,000,909,312 (11)
abstracting: (1<=p108)
states: 126,967,906,304 (11)
abstracting: (1<=p105)
states: 213,640,650,752 (11)
.
EG iterations: 1
abstracting: (1<=p116)
states: 160,072,163,328 (11)
abstracting: (1<=p115)
states: 288,288,931,840 (11)
abstracting: (1<=p109)
states: 161,321,025,536 (11)
.abstracting: (1<=p15)
states: 189,627,211,776 (11)
abstracting: (1<=p22)
states: 150,149,185,536 (11)
abstracting: (1<=p21)
states: 202,262,413,312 (11)
abstracting: (1<=p111)
states: 176,000,909,312 (11)
abstracting: (1<=p108)
states: 126,967,906,304 (11)
abstracting: (1<=p105)
states: 213,640,650,752 (11)
.
EG iterations: 1
abstracting: (1<=p111)
states: 176,000,909,312 (11)
abstracting: (1<=p108)
states: 126,967,906,304 (11)
abstracting: (1<=p105)
states: 213,640,650,752 (11)
.
EG iterations: 1
.
EG iterations: 1
.abstracting: (1<=p32)
states: 101,529,583,616 (11)
abstracting: (1<=p31)
states: 196,539,023,360 (11)
abstracting: (1<=p25)
states: 194,066,448,384 (11)
abstracting: (1<=p5)
states: 161,321,025,536 (11)
abstracting: (1<=p2)
states: 160,072,163,328 (11)
abstracting: (1<=p32)
states: 101,529,583,616 (11)
abstracting: (1<=p31)
states: 196,539,023,360 (11)
abstracting: (1<=p25)
states: 194,066,448,384 (11)
abstracting: (1<=p32)
states: 101,529,583,616 (11)
abstracting: (1<=p31)
states: 196,539,023,360 (11)
abstracting: (1<=p25)
states: 194,066,448,384 (11)
.............................
EG iterations: 29
abstracting: (1<=p5)
states: 161,321,025,536 (11)
abstracting: (1<=p2)
states: 160,072,163,328 (11)
abstracting: (1<=p99)
states: 189,627,211,776 (11)
abstracting: (1<=p96)
states: 150,149,185,536 (11)
abstracting: (1<=p93)
states: 202,262,413,312 (11)
abstracting: (1<=p102)
states: 68,706,238,464 (10)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA ResAllocation-PT-R003C020-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.353sec
checking: A [[~ [EG [1<=p1]] | [[EF [AX [EF [1<=p114]]] & 1<=p13] & [1<=p19 & 1<=p20]]] U ~ [[~ [[A [[1<=p109 & [1<=p115 & 1<=p116]] U [1<=p5 & 1<=p11]] | ~ [[1<=p75 & [1<=p81 & 1<=p82]]]]] | EF [[A [[1<=p105 & [1<=p108 & 1<=p111]] U ~ [[p15<=0 | [p21<=0 | p22<=0]]]] & EG [[1<=p49 & [1<=p55 & 1<=p56]]]]]]]]
normalized: [~ [EG [[E [true U [EG [[1<=p49 & [1<=p55 & 1<=p56]]] & [~ [EG [[p15<=0 | [p21<=0 | p22<=0]]]] & ~ [E [[p15<=0 | [p21<=0 | p22<=0]] U [~ [[1<=p105 & [1<=p108 & 1<=p111]]] & [p15<=0 | [p21<=0 | p22<=0]]]]]]]] | ~ [[~ [[1<=p75 & [1<=p81 & 1<=p82]]] | [~ [EG [~ [[1<=p5 & 1<=p11]]]] & ~ [E [~ [[1<=p5 & 1<=p11]] U [~ [[1<=p109 & [1<=p115 & 1<=p116]]] & ~ [[1<=p5 & 1<=p11]]]]]]]]]]] & ~ [E [[E [true U [EG [[1<=p49 & [1<=p55 & 1<=p56]]] & [~ [EG [[p15<=0 | [p21<=0 | p22<=0]]]] & ~ [E [[p15<=0 | [p21<=0 | p22<=0]] U [~ [[1<=p105 & [1<=p108 & 1<=p111]]] & [p15<=0 | [p21<=0 | p22<=0]]]]]]]] | ~ [[~ [[1<=p75 & [1<=p81 & 1<=p82]]] | [~ [EG [~ [[1<=p5 & 1<=p11]]]] & ~ [E [~ [[1<=p5 & 1<=p11]] U [~ [[1<=p109 & [1<=p115 & 1<=p116]]] & ~ [[1<=p5 & 1<=p11]]]]]]]]] U [~ [[[[1<=p19 & 1<=p20] & [1<=p13 & E [true U ~ [EX [~ [E [true U 1<=p114]]]]]]] | ~ [EG [1<=p1]]]] & [E [true U [EG [[1<=p49 & [1<=p55 & 1<=p56]]] & [~ [EG [[p15<=0 | [p21<=0 | p22<=0]]]] & ~ [E [[p15<=0 | [p21<=0 | p22<=0]] U [~ [[1<=p105 & [1<=p108 & 1<=p111]]] & [p15<=0 | [p21<=0 | p22<=0]]]]]]]] | ~ [[~ [[1<=p75 & [1<=p81 & 1<=p82]]] | [~ [EG [~ [[1<=p5 & 1<=p11]]]] & ~ [E [~ [[1<=p5 & 1<=p11]] U [~ [[1<=p109 & [1<=p115 & 1<=p116]]] & ~ [[1<=p5 & 1<=p11]]]]]]]]]]]]]
abstracting: (1<=p11)
states: 210,780,602,368 (11)
abstracting: (1<=p5)
states: 161,321,025,536 (11)
abstracting: (1<=p116)
states: 160,072,163,328 (11)
abstracting: (1<=p115)
states: 288,288,931,840 (11)
abstracting: (1<=p109)
states: 161,321,025,536 (11)
abstracting: (1<=p11)
states: 210,780,602,368 (11)
abstracting: (1<=p5)
states: 161,321,025,536 (11)
abstracting: (1<=p11)
states: 210,780,602,368 (11)
abstracting: (1<=p5)
states: 161,321,025,536 (11)
...............................
EG iterations: 31
abstracting: (1<=p82)
states: 158,748,622,848 (11)
abstracting: (1<=p81)
states: 198,935,748,608 (11)
abstracting: (1<=p75)
states: 196,834,525,184 (11)
abstracting: (p22<=0)
states: 256,305,561,600 (11)
abstracting: (p21<=0)
states: 204,192,333,824 (11)
abstracting: (p15<=0)
states: 216,827,535,360 (11)
abstracting: (1<=p111)
states: 176,000,909,312 (11)
abstracting: (1<=p108)
states: 126,967,906,304 (11)
abstracting: (1<=p105)
states: 213,640,650,752 (11)
abstracting: (p22<=0)
states: 256,305,561,600 (11)
abstracting: (p21<=0)
states: 204,192,333,824 (11)
abstracting: (p15<=0)
states: 216,827,535,360 (11)
abstracting: (p22<=0)
states: 256,305,561,600 (11)
abstracting: (p21<=0)
states: 204,192,333,824 (11)
abstracting: (p15<=0)
states: 216,827,535,360 (11)
............................
EG iterations: 28
abstracting: (1<=p56)
states: 104,327,421,952 (11)
abstracting: (1<=p55)
states: 195,646,799,872 (11)
abstracting: (1<=p49)
states: 195,306,209,280 (11)
.............................
EG iterations: 29
abstracting: (1<=p1)
states: 187,298,627,584 (11)
..................................
EG iterations: 34
abstracting: (1<=p114)
states: 118,165,815,296 (11)
.abstracting: (1<=p13)
states: 191,369,953,280 (11)
abstracting: (1<=p20)
states: 94,395,113,472 (10)
abstracting: (1<=p19)
states: 198,923,272,192 (11)
abstracting: (1<=p11)
states: 210,780,602,368 (11)
abstracting: (1<=p5)
states: 161,321,025,536 (11)
abstracting: (1<=p116)
states: 160,072,163,328 (11)
abstracting: (1<=p115)
states: 288,288,931,840 (11)
abstracting: (1<=p109)
states: 161,321,025,536 (11)
abstracting: (1<=p11)
states: 210,780,602,368 (11)
abstracting: (1<=p5)
states: 161,321,025,536 (11)
abstracting: (1<=p11)
states: 210,780,602,368 (11)
abstracting: (1<=p5)
states: 161,321,025,536 (11)
...............................
EG iterations: 31
abstracting: (1<=p82)
states: 158,748,622,848 (11)
abstracting: (1<=p81)
states: 198,935,748,608 (11)
abstracting: (1<=p75)
states: 196,834,525,184 (11)
abstracting: (p22<=0)
states: 256,305,561,600 (11)
abstracting: (p21<=0)
states: 204,192,333,824 (11)
abstracting: (p15<=0)
states: 216,827,535,360 (11)
abstracting: (1<=p111)
states: 176,000,909,312 (11)
abstracting: (1<=p108)
states: 126,967,906,304 (11)
abstracting: (1<=p105)
states: 213,640,650,752 (11)
abstracting: (p22<=0)
states: 256,305,561,600 (11)
abstracting: (p21<=0)
states: 204,192,333,824 (11)
abstracting: (p15<=0)
states: 216,827,535,360 (11)
abstracting: (p22<=0)
states: 256,305,561,600 (11)
abstracting: (p21<=0)
states: 204,192,333,824 (11)
abstracting: (p15<=0)
states: 216,827,535,360 (11)
............................
EG iterations: 28
abstracting: (1<=p56)
states: 104,327,421,952 (11)
abstracting: (1<=p55)
states: 195,646,799,872 (11)
abstracting: (1<=p49)
states: 195,306,209,280 (11)
.............................
EG iterations: 29
abstracting: (1<=p11)
states: 210,780,602,368 (11)
abstracting: (1<=p5)
states: 161,321,025,536 (11)
abstracting: (1<=p116)
states: 160,072,163,328 (11)
abstracting: (1<=p115)
states: 288,288,931,840 (11)
abstracting: (1<=p109)
states: 161,321,025,536 (11)
abstracting: (1<=p11)
states: 210,780,602,368 (11)
abstracting: (1<=p5)
states: 161,321,025,536 (11)
abstracting: (1<=p11)
states: 210,780,602,368 (11)
abstracting: (1<=p5)
states: 161,321,025,536 (11)
...............................
EG iterations: 31
abstracting: (1<=p82)
states: 158,748,622,848 (11)
abstracting: (1<=p81)
states: 198,935,748,608 (11)
abstracting: (1<=p75)
states: 196,834,525,184 (11)
abstracting: (p22<=0)
states: 256,305,561,600 (11)
abstracting: (p21<=0)
states: 204,192,333,824 (11)
abstracting: (p15<=0)
states: 216,827,535,360 (11)
abstracting: (1<=p111)
states: 176,000,909,312 (11)
abstracting: (1<=p108)
states: 126,967,906,304 (11)
abstracting: (1<=p105)
states: 213,640,650,752 (11)
abstracting: (p22<=0)
states: 256,305,561,600 (11)
abstracting: (p21<=0)
states: 204,192,333,824 (11)
abstracting: (p15<=0)
states: 216,827,535,360 (11)
abstracting: (p22<=0)
states: 256,305,561,600 (11)
abstracting: (p21<=0)
states: 204,192,333,824 (11)
abstracting: (p15<=0)
states: 216,827,535,360 (11)
............................
EG iterations: 28
abstracting: (1<=p56)
states: 104,327,421,952 (11)
abstracting: (1<=p55)
states: 195,646,799,872 (11)
abstracting: (1<=p49)
states: 195,306,209,280 (11)
.............................
EG iterations: 29
..................................
EG iterations: 34
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C020-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.977sec
checking: EG [[[EG [AG [[p75<=0 | [p81<=0 | p82<=0]]]] | [EX [[p93<=0 | [p96<=0 | p99<=0]]] & [~ [E [1<=p30 U [1<=p2 & 1<=p5]]] & E [A [1<=p52 U [1<=p41 & 1<=p47]] U [1<=p73 & [1<=p79 & 1<=p80]]]]]] & [AF [[1<=p29 & 1<=p35]] | [[1<=p83 & [1<=p86 & 1<=p89]] | [1<=p95 & [1<=p98 & 1<=p101]]]]]]
normalized: EG [[[EG [~ [E [true U ~ [[p75<=0 | [p81<=0 | p82<=0]]]]]] | [[E [[~ [EG [~ [[1<=p41 & 1<=p47]]]] & ~ [E [~ [[1<=p41 & 1<=p47]] U [~ [[1<=p41 & 1<=p47]] & ~ [1<=p52]]]]] U [1<=p73 & [1<=p79 & 1<=p80]]] & ~ [E [1<=p30 U [1<=p2 & 1<=p5]]]] & EX [[p93<=0 | [p96<=0 | p99<=0]]]]] & [[[1<=p95 & [1<=p98 & 1<=p101]] | [1<=p83 & [1<=p86 & 1<=p89]]] | ~ [EG [~ [[1<=p29 & 1<=p35]]]]]]]
abstracting: (1<=p35)
states: 196,380,016,640 (11)
abstracting: (1<=p29)
states: 193,383,710,720 (11)
...............................
EG iterations: 31
abstracting: (1<=p89)
states: 194,066,448,384 (11)
abstracting: (1<=p86)
states: 101,529,583,616 (11)
abstracting: (1<=p83)
states: 196,539,023,360 (11)
abstracting: (1<=p101)
states: 191,369,953,280 (11)
abstracting: (1<=p98)
states: 94,395,113,472 (10)
abstracting: (1<=p95)
states: 198,923,272,192 (11)
abstracting: (p99<=0)
states: 216,827,535,360 (11)
abstracting: (p96<=0)
states: 256,305,561,600 (11)
abstracting: (p93<=0)
states: 204,192,333,824 (11)
.abstracting: (1<=p5)
states: 161,321,025,536 (11)
abstracting: (1<=p2)
states: 160,072,163,328 (11)
abstracting: (1<=p30)
states: 51,167,100,928 (10)
abstracting: (1<=p80)
states: 105,989,414,912 (11)
abstracting: (1<=p79)
states: 196,380,016,640 (11)
abstracting: (1<=p73)
states: 194,882,977,792 (11)
abstracting: (1<=p52)
states: 53,550,645,248 (10)
abstracting: (1<=p47)
states: 195,759,570,944 (11)
abstracting: (1<=p41)
states: 194,882,977,792 (11)
abstracting: (1<=p47)
states: 195,759,570,944 (11)
abstracting: (1<=p41)
states: 194,882,977,792 (11)
abstracting: (1<=p47)
states: 195,759,570,944 (11)
abstracting: (1<=p41)
states: 194,882,977,792 (11)
...............................
EG iterations: 31
abstracting: (p82<=0)
states: 247,706,124,288 (11)
abstracting: (p81<=0)
states: 207,518,998,528 (11)
abstracting: (p75<=0)
states: 209,620,221,952 (11)
.
EG iterations: 1
...............................
EG iterations: 31
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C020-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.748sec
checking: AX [[EF [[1<=p42 | [EG [p64<=0] | AX [[p95<=0 | [p98<=0 | p101<=0]]]]]] & [E [[~ [[1<=p102 & [1<=p65 & 1<=p71]]] | EG [[1<=p35 & [1<=p38 & 1<=p41]]]] U [AX [[1<=p9 & [1<=p12 & 1<=p15]]] & [1<=p41 & 1<=p47]]] | [1<=p43 & [1<=p49 & [~ [A [[1<=p25 & [1<=p31 & 1<=p32]] U [1<=p5 & 1<=p11]]] | EG [[1<=p51 & [1<=p57 & 1<=p58]]]]]]]]]
normalized: ~ [EX [~ [[E [true U [1<=p42 | [EG [p64<=0] | ~ [EX [~ [[p95<=0 | [p98<=0 | p101<=0]]]]]]]] & [[1<=p43 & [1<=p49 & [~ [[~ [E [~ [[1<=p5 & 1<=p11]] U [~ [[1<=p5 & 1<=p11]] & ~ [[1<=p25 & [1<=p31 & 1<=p32]]]]]] & ~ [EG [~ [[1<=p5 & 1<=p11]]]]]] | EG [[1<=p51 & [1<=p57 & 1<=p58]]]]]] | E [[EG [[1<=p35 & [1<=p38 & 1<=p41]]] | ~ [[1<=p102 & [1<=p65 & 1<=p71]]]] U [[1<=p41 & 1<=p47] & ~ [EX [~ [[1<=p9 & [1<=p12 & 1<=p15]]]]]]]]]]]]
abstracting: (1<=p15)
states: 189,627,211,776 (11)
abstracting: (1<=p12)
states: 168,774,516,736 (11)
abstracting: (1<=p9)
states: 213,640,650,752 (11)
.abstracting: (1<=p47)
states: 195,759,570,944 (11)
abstracting: (1<=p41)
states: 194,882,977,792 (11)
abstracting: (1<=p71)
states: 195,815,555,072 (11)
abstracting: (1<=p65)
states: 195,306,209,280 (11)
abstracting: (1<=p102)
states: 68,706,238,464 (10)
abstracting: (1<=p41)
states: 194,882,977,792 (11)
abstracting: (1<=p38)
states: 105,989,414,912 (11)
abstracting: (1<=p35)
states: 196,380,016,640 (11)
.............................
EG iterations: 29
abstracting: (1<=p58)
states: 157,627,006,976 (11)
abstracting: (1<=p57)
states: 197,799,903,232 (11)
abstracting: (1<=p51)
states: 197,300,822,016 (11)
...............................
EG iterations: 31
abstracting: (1<=p11)
states: 210,780,602,368 (11)
abstracting: (1<=p5)
states: 161,321,025,536 (11)
...............................
EG iterations: 31
abstracting: (1<=p32)
states: 101,529,583,616 (11)
abstracting: (1<=p31)
states: 196,539,023,360 (11)
abstracting: (1<=p25)
states: 194,066,448,384 (11)
abstracting: (1<=p11)
states: 210,780,602,368 (11)
abstracting: (1<=p5)
states: 161,321,025,536 (11)
abstracting: (1<=p11)
states: 210,780,602,368 (11)
abstracting: (1<=p5)
states: 161,321,025,536 (11)
abstracting: (1<=p49)
states: 195,306,209,280 (11)
abstracting: (1<=p43)
states: 195,815,555,072 (11)
abstracting: (p101<=0)
states: 215,084,793,856 (11)
abstracting: (p98<=0)
states: 312,059,633,664 (11)
abstracting: (p95<=0)
states: 207,531,474,944 (11)
.abstracting: (p64<=0)
states: 353,273,806,848 (11)
.
EG iterations: 1
abstracting: (1<=p42)
states: 52,671,594,496 (10)
.-> the formula is FALSE
FORMULA ResAllocation-PT-R003C020-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.663sec
checking: AX [EG [[[~ [A [[1<=p91 & 1<=p97] U [1<=p35 & [1<=p38 & 1<=p41]]]] | [~ [E [[1<=p21 & [1<=p24 & 1<=p27]] U [1<=p105 & [1<=p108 & 1<=p111]]]] | [1<=p31 & 1<=p37]]] & [[~ [E [[1<=p85 & [1<=p91 & 1<=p92]] U [1<=p73 & [1<=p79 & 1<=p80]]]] | [1<=p100 | p4<=0]] | [[p49<=0 | p55<=0] | [p56<=0 | [1<=p37 & [1<=p43 & 1<=p44]]]]]]]]
normalized: ~ [EX [~ [EG [[[[[p56<=0 | [1<=p37 & [1<=p43 & 1<=p44]]] | [p49<=0 | p55<=0]] | [[1<=p100 | p4<=0] | ~ [E [[1<=p85 & [1<=p91 & 1<=p92]] U [1<=p73 & [1<=p79 & 1<=p80]]]]]] & [[[1<=p31 & 1<=p37] | ~ [E [[1<=p21 & [1<=p24 & 1<=p27]] U [1<=p105 & [1<=p108 & 1<=p111]]]]] | ~ [[~ [EG [~ [[1<=p35 & [1<=p38 & 1<=p41]]]]] & ~ [E [~ [[1<=p35 & [1<=p38 & 1<=p41]]] U [~ [[1<=p91 & 1<=p97]] & ~ [[1<=p35 & [1<=p38 & 1<=p41]]]]]]]]]]]]]]
abstracting: (1<=p41)
states: 194,882,977,792 (11)
abstracting: (1<=p38)
states: 105,989,414,912 (11)
abstracting: (1<=p35)
states: 196,380,016,640 (11)
abstracting: (1<=p97)
states: 187,599,323,136 (11)
abstracting: (1<=p91)
states: 198,882,017,280 (11)
abstracting: (1<=p41)
states: 194,882,977,792 (11)
abstracting: (1<=p38)
states: 105,989,414,912 (11)
abstracting: (1<=p35)
states: 196,380,016,640 (11)
abstracting: (1<=p41)
states: 194,882,977,792 (11)
abstracting: (1<=p38)
states: 105,989,414,912 (11)
abstracting: (1<=p35)
states: 196,380,016,640 (11)
.............................
EG iterations: 29
abstracting: (1<=p111)
states: 176,000,909,312 (11)
abstracting: (1<=p108)
states: 126,967,906,304 (11)
abstracting: (1<=p105)
states: 213,640,650,752 (11)
abstracting: (1<=p27)
states: 195,127,943,168 (11)
abstracting: (1<=p24)
states: 161,221,197,824 (11)
abstracting: (1<=p21)
states: 202,262,413,312 (11)
abstracting: (1<=p37)
states: 195,034,529,792 (11)
abstracting: (1<=p31)
states: 196,539,023,360 (11)
abstracting: (1<=p80)
states: 105,989,414,912 (11)
abstracting: (1<=p79)
states: 196,380,016,640 (11)
abstracting: (1<=p73)
states: 194,882,977,792 (11)
abstracting: (1<=p92)
states: 109,797,220,352 (11)
abstracting: (1<=p91)
states: 198,882,017,280 (11)
abstracting: (1<=p85)
states: 193,383,710,720 (11)
abstracting: (p4<=0)
states: 288,288,931,840 (11)
abstracting: (1<=p100)
states: 46,310,277,120 (10)
abstracting: (p55<=0)
states: 210,807,947,264 (11)
abstracting: (p49<=0)
states: 211,148,537,856 (11)
abstracting: (1<=p44)
states: 103,630,807,040 (11)
abstracting: (1<=p43)
states: 195,815,555,072 (11)
abstracting: (1<=p37)
states: 195,034,529,792 (11)
abstracting: (p56<=0)
states: 302,127,325,184 (11)
.
EG iterations: 1
.-> the formula is TRUE
FORMULA ResAllocation-PT-R003C020-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.426sec
checking: A [E [[~ [[EF [1<=p102] | AG [[1<=p85 & 1<=p79]]]] | [EG [[[p76<=0 & 1<=p16] & [1<=p79 & 1<=p85]]] | [1<=p69 & [1<=p72 & 1<=p75]]]] U ~ [[1<=p51 & [1<=p57 & 1<=p58]]]] U [[A [[EX [[1<=p17 & 1<=p23]] | [1<=p53 & 1<=p59]] U [~ [[[1<=p5 & 1<=p11] & [1<=p41 & 1<=p47]]] & AF [[1<=p61 & [1<=p67 & 1<=p68]]]]] & 1<=p19] & [1<=p25 & [EF [1<=p114] | A [AG [[[1<=p9 & [1<=p12 & 1<=p15]] & [1<=p97 & [1<=p103 & 1<=p104]]]] U [1<=p93 & [1<=p96 & 1<=p99]]]]]]]
normalized: [~ [EG [~ [[[1<=p25 & [[~ [EG [~ [[1<=p93 & [1<=p96 & 1<=p99]]]]] & ~ [E [~ [[1<=p93 & [1<=p96 & 1<=p99]]] U [E [true U ~ [[[1<=p97 & [1<=p103 & 1<=p104]] & [1<=p9 & [1<=p12 & 1<=p15]]]]] & ~ [[1<=p93 & [1<=p96 & 1<=p99]]]]]]] | E [true U 1<=p114]]] & [1<=p19 & [~ [EG [~ [[~ [EG [~ [[1<=p61 & [1<=p67 & 1<=p68]]]]] & ~ [[[1<=p41 & 1<=p47] & [1<=p5 & 1<=p11]]]]]]] & ~ [E [~ [[~ [EG [~ [[1<=p61 & [1<=p67 & 1<=p68]]]]] & ~ [[[1<=p41 & 1<=p47] & [1<=p5 & 1<=p11]]]]] U [~ [[[1<=p53 & 1<=p59] | EX [[1<=p17 & 1<=p23]]]] & ~ [[~ [EG [~ [[1<=p61 & [1<=p67 & 1<=p68]]]]] & ~ [[[1<=p41 & 1<=p47] & [1<=p5 & 1<=p11]]]]]]]]]]]]]] & ~ [E [~ [[[1<=p25 & [[~ [EG [~ [[1<=p93 & [1<=p96 & 1<=p99]]]]] & ~ [E [~ [[1<=p93 & [1<=p96 & 1<=p99]]] U [E [true U ~ [[[1<=p97 & [1<=p103 & 1<=p104]] & [1<=p9 & [1<=p12 & 1<=p15]]]]] & ~ [[1<=p93 & [1<=p96 & 1<=p99]]]]]]] | E [true U 1<=p114]]] & [1<=p19 & [~ [EG [~ [[~ [EG [~ [[1<=p61 & [1<=p67 & 1<=p68]]]]] & ~ [[[1<=p41 & 1<=p47] & [1<=p5 & 1<=p11]]]]]]] & ~ [E [~ [[~ [EG [~ [[1<=p61 & [1<=p67 & 1<=p68]]]]] & ~ [[[1<=p41 & 1<=p47] & [1<=p5 & 1<=p11]]]]] U [~ [[[1<=p53 & 1<=p59] | EX [[1<=p17 & 1<=p23]]]] & ~ [[~ [EG [~ [[1<=p61 & [1<=p67 & 1<=p68]]]]] & ~ [[[1<=p41 & 1<=p47] & [1<=p5 & 1<=p11]]]]]]]]]]]] U [~ [E [[[[1<=p69 & [1<=p72 & 1<=p75]] | EG [[[1<=p79 & 1<=p85] & [p76<=0 & 1<=p16]]]] | ~ [[~ [E [true U ~ [[1<=p85 & 1<=p79]]]] | E [true U 1<=p102]]]] U ~ [[1<=p51 & [1<=p57 & 1<=p58]]]]] & ~ [[[1<=p25 & [[~ [EG [~ [[1<=p93 & [1<=p96 & 1<=p99]]]]] & ~ [E [~ [[1<=p93 & [1<=p96 & 1<=p99]]] U [E [true U ~ [[[1<=p97 & [1<=p103 & 1<=p104]] & [1<=p9 & [1<=p12 & 1<=p15]]]]] & ~ [[1<=p93 & [1<=p96 & 1<=p99]]]]]]] | E [true U 1<=p114]]] & [1<=p19 & [~ [EG [~ [[~ [EG [~ [[1<=p61 & [1<=p67 & 1<=p68]]]]] & ~ [[[1<=p41 & 1<=p47] & [1<=p5 & 1<=p11]]]]]]] & ~ [E [~ [[~ [EG [~ [[1<=p61 & [1<=p67 & 1<=p68]]]]] & ~ [[[1<=p41 & 1<=p47] & [1<=p5 & 1<=p11]]]]] U [~ [[[1<=p53 & 1<=p59] | EX [[1<=p17 & 1<=p23]]]] & ~ [[~ [EG [~ [[1<=p61 & [1<=p67 & 1<=p68]]]]] & ~ [[[1<=p41 & 1<=p47] & [1<=p5 & 1<=p11]]]]]]]]]]]]]]]]
abstracting: (1<=p11)
states: 210,780,602,368 (11)
abstracting: (1<=p5)
states: 161,321,025,536 (11)
abstracting: (1<=p47)
states: 195,759,570,944 (11)
abstracting: (1<=p41)
states: 194,882,977,792 (11)
abstracting: (1<=p68)
states: 104,826,503,168 (11)
abstracting: (1<=p67)
states: 195,759,570,944 (11)
abstracting: (1<=p61)
states: 195,277,094,912 (11)
............................
EG iterations: 28
abstracting: (1<=p23)
states: 198,882,017,280 (11)
abstracting: (1<=p17)
states: 187,599,323,136 (11)
.abstracting: (1<=p59)
states: 195,646,799,872 (11)
abstracting: (1<=p53)
states: 195,277,094,912 (11)
abstracting: (1<=p11)
states: 210,780,602,368 (11)
abstracting: (1<=p5)
states: 161,321,025,536 (11)
abstracting: (1<=p47)
states: 195,759,570,944 (11)
abstracting: (1<=p41)
states: 194,882,977,792 (11)
abstracting: (1<=p68)
states: 104,826,503,168 (11)
abstracting: (1<=p67)
states: 195,759,570,944 (11)
abstracting: (1<=p61)
states: 195,277,094,912 (11)
............................
EG iterations: 28
abstracting: (1<=p11)
states: 210,780,602,368 (11)
abstracting: (1<=p5)
states: 161,321,025,536 (11)
abstracting: (1<=p47)
states: 195,759,570,944 (11)
abstracting: (1<=p41)
states: 194,882,977,792 (11)
abstracting: (1<=p68)
states: 104,826,503,168 (11)
abstracting: (1<=p67)
states: 195,759,570,944 (11)
abstracting: (1<=p61)
states: 195,277,094,912 (11)
............................
EG iterations: 28
.
EG iterations: 1
abstracting: (1<=p19)
states: 198,923,272,192 (11)
abstracting: (1<=p114)
states: 118,165,815,296 (11)
abstracting: (1<=p99)
states: 189,627,211,776 (11)
abstracting: (1<=p96)
states: 150,149,185,536 (11)
abstracting: (1<=p93)
states: 202,262,413,312 (11)
abstracting: (1<=p15)
states: 189,627,211,776 (11)
abstracting: (1<=p12)
states: 168,774,516,736 (11)
abstracting: (1<=p9)
states: 213,640,650,752 (11)
abstracting: (1<=p104)
states: 122,432,421,888 (11)
abstracting: (1<=p103)
states: 210,780,602,368 (11)
abstracting: (1<=p97)
states: 187,599,323,136 (11)
abstracting: (1<=p99)
states: 189,627,211,776 (11)
abstracting: (1<=p96)
states: 150,149,185,536 (11)
abstracting: (1<=p93)
states: 202,262,413,312 (11)
abstracting: (1<=p99)
states: 189,627,211,776 (11)
abstracting: (1<=p96)
states: 150,149,185,536 (11)
abstracting: (1<=p93)
states: 202,262,413,312 (11)
............................
EG iterations: 28
abstracting: (1<=p25)
states: 194,066,448,384 (11)
abstracting: (1<=p58)
states: 157,627,006,976 (11)
abstracting: (1<=p57)
states: 197,799,903,232 (11)
abstracting: (1<=p51)
states: 197,300,822,016 (11)
abstracting: (1<=p102)
states: 68,706,238,464 (10)
abstracting: (1<=p79)
states: 196,380,016,640 (11)
abstracting: (1<=p85)
states: 193,383,710,720 (11)
abstracting: (1<=p16)
states: 68,706,238,464 (10)
abstracting: (p76<=0)
states: 353,783,152,640 (11)
abstracting: (1<=p85)
states: 193,383,710,720 (11)
abstracting: (1<=p79)
states: 196,380,016,640 (11)
.
EG iterations: 1
abstracting: (1<=p75)
states: 196,834,525,184 (11)
abstracting: (1<=p72)
states: 157,144,530,944 (11)
abstracting: (1<=p69)
states: 197,997,436,928 (11)
abstracting: (1<=p11)
states: 210,780,602,368 (11)
abstracting: (1<=p5)
states: 161,321,025,536 (11)
abstracting: (1<=p47)
states: 195,759,570,944 (11)
abstracting: (1<=p41)
states: 194,882,977,792 (11)
abstracting: (1<=p68)
states: 104,826,503,168 (11)
abstracting: (1<=p67)
states: 195,759,570,944 (11)
abstracting: (1<=p61)
states: 195,277,094,912 (11)
............................
EG iterations: 28
abstracting: (1<=p23)
states: 198,882,017,280 (11)
abstracting: (1<=p17)
states: 187,599,323,136 (11)
.abstracting: (1<=p59)
states: 195,646,799,872 (11)
abstracting: (1<=p53)
states: 195,277,094,912 (11)
abstracting: (1<=p11)
states: 210,780,602,368 (11)
abstracting: (1<=p5)
states: 161,321,025,536 (11)
abstracting: (1<=p47)
states: 195,759,570,944 (11)
abstracting: (1<=p41)
states: 194,882,977,792 (11)
abstracting: (1<=p68)
states: 104,826,503,168 (11)
abstracting: (1<=p67)
states: 195,759,570,944 (11)
abstracting: (1<=p61)
states: 195,277,094,912 (11)
............................
EG iterations: 28
abstracting: (1<=p11)
states: 210,780,602,368 (11)
abstracting: (1<=p5)
states: 161,321,025,536 (11)
abstracting: (1<=p47)
states: 195,759,570,944 (11)
abstracting: (1<=p41)
states: 194,882,977,792 (11)
abstracting: (1<=p68)
states: 104,826,503,168 (11)
abstracting: (1<=p67)
states: 195,759,570,944 (11)
abstracting: (1<=p61)
states: 195,277,094,912 (11)
............................
EG iterations: 28
.
EG iterations: 1
abstracting: (1<=p19)
states: 198,923,272,192 (11)
abstracting: (1<=p114)
states: 118,165,815,296 (11)
abstracting: (1<=p99)
states: 189,627,211,776 (11)
abstracting: (1<=p96)
states: 150,149,185,536 (11)
abstracting: (1<=p93)
states: 202,262,413,312 (11)
abstracting: (1<=p15)
states: 189,627,211,776 (11)
abstracting: (1<=p12)
states: 168,774,516,736 (11)
abstracting: (1<=p9)
states: 213,640,650,752 (11)
abstracting: (1<=p104)
states: 122,432,421,888 (11)
abstracting: (1<=p103)
states: 210,780,602,368 (11)
abstracting: (1<=p97)
states: 187,599,323,136 (11)
abstracting: (1<=p99)
states: 189,627,211,776 (11)
abstracting: (1<=p96)
states: 150,149,185,536 (11)
abstracting: (1<=p93)
states: 202,262,413,312 (11)
abstracting: (1<=p99)
states: 189,627,211,776 (11)
abstracting: (1<=p96)
states: 150,149,185,536 (11)
abstracting: (1<=p93)
states: 202,262,413,312 (11)
............................
EG iterations: 28
abstracting: (1<=p25)
states: 194,066,448,384 (11)
abstracting: (1<=p11)
states: 210,780,602,368 (11)
abstracting: (1<=p5)
states: 161,321,025,536 (11)
abstracting: (1<=p47)
states: 195,759,570,944 (11)
abstracting: (1<=p41)
states: 194,882,977,792 (11)
abstracting: (1<=p68)
states: 104,826,503,168 (11)
abstracting: (1<=p67)
states: 195,759,570,944 (11)
abstracting: (1<=p61)
states: 195,277,094,912 (11)
............................
EG iterations: 28
abstracting: (1<=p23)
states: 198,882,017,280 (11)
abstracting: (1<=p17)
states: 187,599,323,136 (11)
.abstracting: (1<=p59)
states: 195,646,799,872 (11)
abstracting: (1<=p53)
states: 195,277,094,912 (11)
abstracting: (1<=p11)
states: 210,780,602,368 (11)
abstracting: (1<=p5)
states: 161,321,025,536 (11)
abstracting: (1<=p47)
states: 195,759,570,944 (11)
abstracting: (1<=p41)
states: 194,882,977,792 (11)
abstracting: (1<=p68)
states: 104,826,503,168 (11)
abstracting: (1<=p67)
states: 195,759,570,944 (11)
abstracting: (1<=p61)
states: 195,277,094,912 (11)
............................
EG iterations: 28
abstracting: (1<=p11)
states: 210,780,602,368 (11)
abstracting: (1<=p5)
states: 161,321,025,536 (11)
abstracting: (1<=p47)
states: 195,759,570,944 (11)
abstracting: (1<=p41)
states: 194,882,977,792 (11)
abstracting: (1<=p68)
states: 104,826,503,168 (11)
abstracting: (1<=p67)
states: 195,759,570,944 (11)
abstracting: (1<=p61)
states: 195,277,094,912 (11)
............................
EG iterations: 28
.
EG iterations: 1
abstracting: (1<=p19)
states: 198,923,272,192 (11)
abstracting: (1<=p114)
states: 118,165,815,296 (11)
abstracting: (1<=p99)
states: 189,627,211,776 (11)
abstracting: (1<=p96)
states: 150,149,185,536 (11)
abstracting: (1<=p93)
states: 202,262,413,312 (11)
abstracting: (1<=p15)
states: 189,627,211,776 (11)
abstracting: (1<=p12)
states: 168,774,516,736 (11)
abstracting: (1<=p9)
states: 213,640,650,752 (11)
abstracting: (1<=p104)
states: 122,432,421,888 (11)
abstracting: (1<=p103)
states: 210,780,602,368 (11)
abstracting: (1<=p97)
states: 187,599,323,136 (11)
abstracting: (1<=p99)
states: 189,627,211,776 (11)
abstracting: (1<=p96)
states: 150,149,185,536 (11)
abstracting: (1<=p93)
states: 202,262,413,312 (11)
abstracting: (1<=p99)
states: 189,627,211,776 (11)
abstracting: (1<=p96)
states: 150,149,185,536 (11)
abstracting: (1<=p93)
states: 202,262,413,312 (11)
............................
EG iterations: 28
abstracting: (1<=p25)
states: 194,066,448,384 (11)
.
EG iterations: 1
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C020-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.509sec
checking: EF [[[AF [EG [p114<=0]] | [EG [[1<=p49 & [1<=p55 & 1<=p56]]] | [AG [[1<=p5 & 1<=p11]] & [p15<=0 | [p21<=0 | p22<=0]]]]] & [[E [[1<=p95 & [1<=p98 & 1<=p101]] U [1<=p37 & [1<=p43 & 1<=p44]]] | [[p111<=0 | [p117<=0 | p118<=0]] & [p53<=0 | p59<=0]]] & [[1<=p52 | [1<=p1 & [1<=p7 & 1<=p8]]] | [[[1<=p83 & [1<=p86 & 1<=p89]] & [[1<=p57 & 1<=p60] & [1<=p63 & [p25<=0 | [p31<=0 | p32<=0]]]]] | [[1<=p111 & 1<=p117] & [1<=p118 & 1<=p112]]]]]]]
normalized: E [true U [[[[[[1<=p118 & 1<=p112] & [1<=p111 & 1<=p117]] | [[[1<=p63 & [p25<=0 | [p31<=0 | p32<=0]]] & [1<=p57 & 1<=p60]] & [1<=p83 & [1<=p86 & 1<=p89]]]] | [1<=p52 | [1<=p1 & [1<=p7 & 1<=p8]]]] & [[[p53<=0 | p59<=0] & [p111<=0 | [p117<=0 | p118<=0]]] | E [[1<=p95 & [1<=p98 & 1<=p101]] U [1<=p37 & [1<=p43 & 1<=p44]]]]] & [[[[p15<=0 | [p21<=0 | p22<=0]] & ~ [E [true U ~ [[1<=p5 & 1<=p11]]]]] | EG [[1<=p49 & [1<=p55 & 1<=p56]]]] | ~ [EG [~ [EG [p114<=0]]]]]]]
abstracting: (p114<=0)
states: 288,288,931,840 (11)
.
EG iterations: 1
...............................
EG iterations: 31
abstracting: (1<=p56)
states: 104,327,421,952 (11)
abstracting: (1<=p55)
states: 195,646,799,872 (11)
abstracting: (1<=p49)
states: 195,306,209,280 (11)
.............................
EG iterations: 29
abstracting: (1<=p11)
states: 210,780,602,368 (11)
abstracting: (1<=p5)
states: 161,321,025,536 (11)
abstracting: (p22<=0)
states: 256,305,561,600 (11)
abstracting: (p21<=0)
states: 204,192,333,824 (11)
abstracting: (p15<=0)
states: 216,827,535,360 (11)
abstracting: (1<=p44)
states: 103,630,807,040 (11)
abstracting: (1<=p43)
states: 195,815,555,072 (11)
abstracting: (1<=p37)
states: 195,034,529,792 (11)
abstracting: (1<=p101)
states: 191,369,953,280 (11)
abstracting: (1<=p98)
states: 94,395,113,472 (10)
abstracting: (1<=p95)
states: 198,923,272,192 (11)
abstracting: (p118<=0)
states: 219,156,119,552 (11)
abstracting: (p117<=0)
states: 160,072,163,328 (11)
abstracting: (p111<=0)
states: 230,453,837,824 (11)
abstracting: (p59<=0)
states: 210,807,947,264 (11)
abstracting: (p53<=0)
states: 211,177,652,224 (11)
abstracting: (1<=p8)
states: 70,381,674,496 (10)
abstracting: (1<=p7)
states: 205,822,738,432 (11)
abstracting: (1<=p1)
states: 187,298,627,584 (11)
abstracting: (1<=p52)
states: 53,550,645,248 (10)
abstracting: (1<=p89)
states: 194,066,448,384 (11)
abstracting: (1<=p86)
states: 101,529,583,616 (11)
abstracting: (1<=p83)
states: 196,539,023,360 (11)
abstracting: (1<=p60)
states: 157,627,006,976 (11)
abstracting: (1<=p57)
states: 197,799,903,232 (11)
abstracting: (p32<=0)
states: 304,925,163,520 (11)
abstracting: (p31<=0)
states: 209,915,723,776 (11)
abstracting: (p25<=0)
states: 212,388,298,752 (11)
abstracting: (1<=p63)
states: 197,300,822,016 (11)
abstracting: (1<=p117)
states: 246,382,583,808 (11)
abstracting: (1<=p111)
states: 176,000,909,312 (11)
abstracting: (1<=p112)
states: 31,857,491,968 (10)
abstracting: (1<=p118)
states: 187,298,627,584 (11)
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C020-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.352sec
totally nodes used: 14137096 (1.4e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 4662458 18218138 22880596
used/not used/entry size/cache size: 25091103 42017761 16 1024MB
basic ops cache: hits/miss/sum: 894859 3267759 4162618
used/not used/entry size/cache size: 5294989 11482227 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: 8207 44215 52422
used/not used/entry size/cache size: 44099 8344509 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 55326051
1 9811400
2 1642357
3 281544
4 41799
5 5163
6 511
7 39
8 0
9 0
>= 10 0
Total processing time: 0m14.113sec
BK_STOP 1679180955076
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
iterations count:611 (7), effective:120 (1)
initing FirstDep: 0m 0.000sec
iterations count:946 (11), effective:151 (1)
iterations count:170 (2), effective:15 (0)
iterations count:159 (1), effective:15 (0)
iterations count:170 (2), effective:15 (0)
iterations count:170 (2), effective:15 (0)
iterations count:115 (1), effective:6 (0)
iterations count:120 (1), effective:7 (0)
iterations count:92 (1), effective:2 (0)
iterations count:142 (1), effective:10 (0)
iterations count:114 (1), effective:5 (0)
iterations count:401 (5), effective:45 (0)
iterations count:140 (1), effective:10 (0)
iterations count:149 (1), effective:11 (0)
iterations count:121 (1), effective:7 (0)
iterations count:114 (1), effective:5 (0)
iterations count:80 (1), effective:0 (0)
iterations count:82 (1), effective:1 (0)
iterations count:82 (1), effective:1 (0)
iterations count:90 (1), effective:2 (0)
iterations count:116 (1), effective:6 (0)
iterations count:271 (3), effective:27 (0)
iterations count:141 (1), effective:9 (0)
iterations count:847 (10), effective:138 (1)
iterations count:90 (1), effective:2 (0)
iterations count:116 (1), effective:6 (0)
iterations count:271 (3), effective:27 (0)
iterations count:165 (2), effective:18 (0)
iterations count:90 (1), effective:2 (0)
iterations count:116 (1), effective:6 (0)
iterations count:271 (3), effective:27 (0)
iterations count:115 (1), effective:9 (0)
iterations count:88 (1), effective:1 (0)
iterations count:181 (2), effective:15 (0)
iterations count:144 (1), effective:9 (0)
iterations count:90 (1), effective:2 (0)
iterations count:190 (2), effective:16 (0)
iterations count:142 (1), effective:10 (0)
iterations count:136 (1), effective:9 (0)
iterations count:138 (1), effective:9 (0)
iterations count:346 (4), effective:54 (0)
iterations count:141 (1), effective:9 (0)
iterations count:98 (1), effective:6 (0)
iterations count:80 (1), effective:0 (0)
iterations count:182 (2), effective:15 (0)
iterations count:142 (1), effective:10 (0)
iterations count:115 (1), effective:6 (0)
iterations count:346 (4), effective:54 (0)
iterations count:141 (1), effective:9 (0)
iterations count:98 (1), effective:6 (0)
iterations count:80 (1), effective:0 (0)
iterations count:193 (2), effective:17 (0)
iterations count:346 (4), effective:54 (0)
iterations count:141 (1), effective:9 (0)
iterations count:98 (1), effective:6 (0)
iterations count:80 (1), effective:0 (0)
iterations count:85 (1), effective:2 (0)
iterations count:181 (2), effective:15 (0)
iterations count:759 (9), effective:107 (1)
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="ResAllocation-PT-R003C020"
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 ResAllocation-PT-R003C020, 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 r330-tall-167889203600706"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R003C020.tgz
mv ResAllocation-PT-R003C020 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 ;