About the Execution of Marcie+red for FMS-PT-00020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7835.136 | 44927.00 | 48228.00 | 342.30 | FFFFFTTFTFTTFTFF | 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.r170-tall-167838856900210.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 FMS-PT-00020, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838856900210
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 7.8K Feb 25 20:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 25 20:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 20:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 20:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 20:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 20:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 20:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 20:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FMS-PT-00020-CTLFireability-00
FORMULA_NAME FMS-PT-00020-CTLFireability-01
FORMULA_NAME FMS-PT-00020-CTLFireability-02
FORMULA_NAME FMS-PT-00020-CTLFireability-03
FORMULA_NAME FMS-PT-00020-CTLFireability-04
FORMULA_NAME FMS-PT-00020-CTLFireability-05
FORMULA_NAME FMS-PT-00020-CTLFireability-06
FORMULA_NAME FMS-PT-00020-CTLFireability-07
FORMULA_NAME FMS-PT-00020-CTLFireability-08
FORMULA_NAME FMS-PT-00020-CTLFireability-09
FORMULA_NAME FMS-PT-00020-CTLFireability-10
FORMULA_NAME FMS-PT-00020-CTLFireability-11
FORMULA_NAME FMS-PT-00020-CTLFireability-12
FORMULA_NAME FMS-PT-00020-CTLFireability-13
FORMULA_NAME FMS-PT-00020-CTLFireability-14
FORMULA_NAME FMS-PT-00020-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678494007122
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=FMS-PT-00020
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 00:20:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 00:20:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:20:08] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2023-03-11 00:20:08] [INFO ] Transformed 22 places.
[2023-03-11 00:20:08] [INFO ] Transformed 20 transitions.
[2023-03-11 00:20:08] [INFO ] Parsed PT model containing 22 places and 20 transitions and 50 arcs in 78 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Initial state reduction rules removed 1 formulas.
FORMULA FMS-PT-00020-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 8 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-11 00:20:08] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-11 00:20:09] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-11 00:20:09] [INFO ] Invariant cache hit.
[2023-03-11 00:20:09] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2023-03-11 00:20:09] [INFO ] Invariant cache hit.
[2023-03-11 00:20:09] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 465 ms. Remains : 22/22 places, 20/20 transitions.
Support contains 22 out of 22 places after structural reductions.
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 14 ms
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 4 ms
[2023-03-11 00:20:09] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 41) seen :40
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 00:20:09] [INFO ] Invariant cache hit.
[2023-03-11 00:20:09] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 00:20:09] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 3 ms
[2023-03-11 00:20:09] [INFO ] Input system was already deterministic with 20 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:20:09] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:09] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:09] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:09] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:09] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:09] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:20:09] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:09] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 21 transition count 19
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 21 transition count 17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 19 transition count 17
Applied a total of 6 rules in 7 ms. Remains 19 /22 variables (removed 3) and now considering 17/20 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 19/22 places, 17/20 transitions.
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:09] [INFO ] Input system was already deterministic with 17 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:09] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 11 edges and 16 vertex of which 9 / 16 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 11 place count 10 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 18 place count 9 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 18 place count 9 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 8 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 7 transition count 8
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 7 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 24 place count 7 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 29 place count 4 transition count 4
Applied a total of 29 rules in 5 ms. Remains 4 /22 variables (removed 18) and now considering 4/20 (removed 16) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 4/22 places, 4/20 transitions.
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:09] [INFO ] Input system was already deterministic with 4 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
FORMULA FMS-PT-00020-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:09] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:09] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:20:09] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:09] [INFO ] Input system was already deterministic with 20 transitions.
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:20:09] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-11 00:20:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 22 places, 20 transitions and 50 arcs took 1 ms.
Total runtime 1151 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: 22 NrTr: 20 NrArc: 50)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.761sec
RS generation: 0m 1.167sec
-> reachability set: #nodes 25410 (2.5e+04) #states 6,029,168,852,784 (12)
starting MCC model checker
--------------------------
checking: AF [AX [1<=p12]]
normalized: ~ [EG [EX [~ [1<=p12]]]]
abstracting: (1<=p12)
states: 2,982,906,854,004 (12)
..
EG iterations: 1
-> the formula is FALSE
FORMULA FMS-PT-00020-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.326sec
checking: EF [AX [[1<=p8 & [1<=p10 & [AX [p21<=0] | 1<=p4]]]]]
normalized: E [true U ~ [EX [~ [[1<=p8 & [1<=p10 & [1<=p4 | ~ [EX [~ [p21<=0]]]]]]]]]]
abstracting: (p21<=0)
states: 1,322,844,915,084 (12)
.abstracting: (1<=p4)
states: 4,645,008,931,794 (12)
abstracting: (1<=p10)
states: 3,377,140,895,205 (12)
abstracting: (1<=p8)
states: 4,706,323,937,700 (12)
.-> the formula is FALSE
FORMULA FMS-PT-00020-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.833sec
checking: AX [EX [[~ [A [[1<=p20 & 1<=p21] U EF [[1<=p13 & 1<=p15]]]] | AF [1<=p21]]]]
normalized: ~ [EX [~ [EX [[~ [EG [~ [1<=p21]]] | ~ [[~ [EG [~ [E [true U [1<=p13 & 1<=p15]]]]] & ~ [E [~ [E [true U [1<=p13 & 1<=p15]]] U [~ [[1<=p20 & 1<=p21]] & ~ [E [true U [1<=p13 & 1<=p15]]]]]]]]]]]]]
abstracting: (1<=p15)
states: 4,912,161,830,730 (12)
abstracting: (1<=p13)
states: 3,634,972,284,405 (12)
abstracting: (1<=p21)
states: 4,706,323,937,700 (12)
abstracting: (1<=p20)
states: 5,481,062,593,440 (12)
abstracting: (1<=p15)
states: 4,912,161,830,730 (12)
abstracting: (1<=p13)
states: 3,634,972,284,405 (12)
abstracting: (1<=p15)
states: 4,912,161,830,730 (12)
abstracting: (1<=p13)
states: 3,634,972,284,405 (12)
.
EG iterations: 1
abstracting: (1<=p21)
states: 4,706,323,937,700 (12)
.
EG iterations: 1
..-> the formula is FALSE
FORMULA FMS-PT-00020-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.797sec
checking: EF [[[AF [AX [p16<=0]] & AG [[[p11<=0 & p19<=0] | [1<=p5 & 1<=p7]]]] & EX [EX [p16<=0]]]]
normalized: E [true U [EX [EX [p16<=0]] & [~ [E [true U ~ [[[1<=p5 & 1<=p7] | [p11<=0 & p19<=0]]]]] & ~ [EG [EX [~ [p16<=0]]]]]]]
abstracting: (p16<=0)
states: 548,106,259,344 (11)
..
EG iterations: 1
abstracting: (p19<=0)
states: 1,322,844,915,084 (12)
abstracting: (p11<=0)
states: 3,377,140,895,205 (12)
abstracting: (1<=p7)
states: 5,053,490,356,299 (12)
abstracting: (1<=p5)
states: 4,645,008,931,794 (12)
abstracting: (p16<=0)
states: 548,106,259,344 (11)
..-> the formula is FALSE
FORMULA FMS-PT-00020-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.345sec
checking: A [EX [[EF [~ [AX [1<=p19]]] & ~ [EF [1<=p16]]]] U [~ [EX [1<=p20]] | AG [~ [[[AF [1<=p12] & 1<=p14] & [1<=p1 & [1<=p9 & [1<=p3 | 1<=p14]]]]]]]]
normalized: [~ [EG [~ [[~ [E [true U [[1<=p1 & [1<=p9 & [1<=p3 | 1<=p14]]] & [1<=p14 & ~ [EG [~ [1<=p12]]]]]]] | ~ [EX [1<=p20]]]]]] & ~ [E [~ [[~ [E [true U [[1<=p1 & [1<=p9 & [1<=p3 | 1<=p14]]] & [1<=p14 & ~ [EG [~ [1<=p12]]]]]]] | ~ [EX [1<=p20]]]] U [~ [EX [[~ [E [true U 1<=p16]] & E [true U EX [~ [1<=p19]]]]]] & ~ [[~ [E [true U [[1<=p1 & [1<=p9 & [1<=p3 | 1<=p14]]] & [1<=p14 & ~ [EG [~ [1<=p12]]]]]]] | ~ [EX [1<=p20]]]]]]]]
abstracting: (1<=p20)
states: 5,481,062,593,440 (12)
.abstracting: (1<=p12)
states: 2,982,906,854,004 (12)
.
EG iterations: 1
abstracting: (1<=p14)
states: 3,634,972,284,405 (12)
abstracting: (1<=p14)
states: 3,634,972,284,405 (12)
abstracting: (1<=p3)
states: 3,634,972,284,405 (12)
abstracting: (1<=p9)
states: 4,706,323,937,700 (12)
abstracting: (1<=p1)
states: 4,645,008,931,794 (12)
abstracting: (1<=p19)
states: 4,706,323,937,700 (12)
.abstracting: (1<=p16)
states: 5,481,062,593,440 (12)
.abstracting: (1<=p20)
states: 5,481,062,593,440 (12)
.abstracting: (1<=p12)
states: 2,982,906,854,004 (12)
.
EG iterations: 1
abstracting: (1<=p14)
states: 3,634,972,284,405 (12)
abstracting: (1<=p14)
states: 3,634,972,284,405 (12)
abstracting: (1<=p3)
states: 3,634,972,284,405 (12)
abstracting: (1<=p9)
states: 4,706,323,937,700 (12)
abstracting: (1<=p1)
states: 4,645,008,931,794 (12)
abstracting: (1<=p20)
states: 5,481,062,593,440 (12)
.abstracting: (1<=p12)
states: 2,982,906,854,004 (12)
.
EG iterations: 1
abstracting: (1<=p14)
states: 3,634,972,284,405 (12)
abstracting: (1<=p14)
states: 3,634,972,284,405 (12)
abstracting: (1<=p3)
states: 3,634,972,284,405 (12)
abstracting: (1<=p9)
states: 4,706,323,937,700 (12)
abstracting: (1<=p1)
states: 4,645,008,931,794 (12)
.
EG iterations: 1
-> the formula is FALSE
FORMULA FMS-PT-00020-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.040sec
checking: EF [[p9<=0 & E [E [~ [A [[1<=p13 & 1<=p15] U 1<=p4]] U AX [1<=p6]] U [AX [AG [[1<=p10 & 1<=p17]]] & [EX [1<=p6] & ~ [[1<=p8 & 1<=p10]]]]]]]
normalized: E [true U [p9<=0 & E [E [~ [[~ [EG [~ [1<=p4]]] & ~ [E [~ [1<=p4] U [~ [[1<=p13 & 1<=p15]] & ~ [1<=p4]]]]]] U ~ [EX [~ [1<=p6]]]] U [[~ [[1<=p8 & 1<=p10]] & EX [1<=p6]] & ~ [EX [E [true U ~ [[1<=p10 & 1<=p17]]]]]]]]]
abstracting: (1<=p17)
states: 5,481,062,593,440 (12)
abstracting: (1<=p10)
states: 3,377,140,895,205 (12)
.abstracting: (1<=p6)
states: 3,914,577,133,929 (12)
.abstracting: (1<=p10)
states: 3,377,140,895,205 (12)
abstracting: (1<=p8)
states: 4,706,323,937,700 (12)
abstracting: (1<=p6)
states: 3,914,577,133,929 (12)
.abstracting: (1<=p4)
states: 4,645,008,931,794 (12)
abstracting: (1<=p15)
states: 4,912,161,830,730 (12)
abstracting: (1<=p13)
states: 3,634,972,284,405 (12)
abstracting: (1<=p4)
states: 4,645,008,931,794 (12)
abstracting: (1<=p4)
states: 4,645,008,931,794 (12)
.
EG iterations: 1
abstracting: (p9<=0)
states: 1,322,844,915,084 (12)
-> the formula is FALSE
FORMULA FMS-PT-00020-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.041sec
checking: E [~ [AG [~ [AF [[1<=p19 & 1<=p16]]]]] U ~ [[[~ [EF [1<=p19]] & [EF [1<=p11] | E [1<=p19 U 1<=p14]]] | [[EF [EG [1<=p16]] & [AF [1<=p11] | [1<=p10 & 1<=p17]]] | EF [~ [AX [1<=p0]]]]]]]
normalized: E [E [true U ~ [EG [~ [[1<=p19 & 1<=p16]]]]] U ~ [[[E [true U EX [~ [1<=p0]]] | [[[1<=p10 & 1<=p17] | ~ [EG [~ [1<=p11]]]] & E [true U EG [1<=p16]]]] | [[E [1<=p19 U 1<=p14] | E [true U 1<=p11]] & ~ [E [true U 1<=p19]]]]]]
abstracting: (1<=p19)
states: 4,706,323,937,700 (12)
abstracting: (1<=p11)
states: 2,652,027,957,579 (12)
abstracting: (1<=p14)
states: 3,634,972,284,405 (12)
abstracting: (1<=p19)
states: 4,706,323,937,700 (12)
abstracting: (1<=p16)
states: 5,481,062,593,440 (12)
.
EG iterations: 1
abstracting: (1<=p11)
states: 2,652,027,957,579 (12)
.
EG iterations: 1
abstracting: (1<=p17)
states: 5,481,062,593,440 (12)
abstracting: (1<=p10)
states: 3,377,140,895,205 (12)
abstracting: (1<=p0)
states: 4,645,008,931,794 (12)
.abstracting: (1<=p16)
states: 5,481,062,593,440 (12)
abstracting: (1<=p19)
states: 4,706,323,937,700 (12)
.
EG iterations: 1
-> the formula is FALSE
FORMULA FMS-PT-00020-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.476sec
checking: [EX [[AG [AX [[1<=p1 | [1<=p10 & 1<=p17]]]] | [1<=p2 & 1<=p18]]] | AG [[EF [AX [p20<=0]] | [EG [[p5<=0 | p7<=0]] & [AF [1<=p12] | [[[1<=p0 | [1<=p10 & 1<=p17]] & p14<=0] | 1<=p0]]]]]]
normalized: [~ [E [true U ~ [[[[[1<=p0 | [p14<=0 & [1<=p0 | [1<=p10 & 1<=p17]]]] | ~ [EG [~ [1<=p12]]]] & EG [[p5<=0 | p7<=0]]] | E [true U ~ [EX [~ [p20<=0]]]]]]]] | EX [[[1<=p2 & 1<=p18] | ~ [E [true U EX [~ [[1<=p1 | [1<=p10 & 1<=p17]]]]]]]]]
abstracting: (1<=p17)
states: 5,481,062,593,440 (12)
abstracting: (1<=p10)
states: 3,377,140,895,205 (12)
abstracting: (1<=p1)
states: 4,645,008,931,794 (12)
.abstracting: (1<=p18)
states: 4,706,323,937,700 (12)
abstracting: (1<=p2)
states: 4,645,008,931,794 (12)
.abstracting: (p20<=0)
states: 548,106,259,344 (11)
.abstracting: (p7<=0)
states: 975,678,496,485 (11)
abstracting: (p5<=0)
states: 1,384,159,920,990 (12)
.
EG iterations: 1
abstracting: (1<=p12)
states: 2,982,906,854,004 (12)
.
EG iterations: 1
abstracting: (1<=p17)
states: 5,481,062,593,440 (12)
abstracting: (1<=p10)
states: 3,377,140,895,205 (12)
abstracting: (1<=p0)
states: 4,645,008,931,794 (12)
abstracting: (p14<=0)
states: 2,394,196,568,379 (12)
abstracting: (1<=p0)
states: 4,645,008,931,794 (12)
-> the formula is TRUE
FORMULA FMS-PT-00020-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.112sec
checking: [E [p14<=0 U EF [[AG [E [1<=p0 U 1<=p4]] | EF [p20<=0]]]] & ~ [A [[~ [[[~ [[1<=p13 & 1<=p15]] | 1<=p0] & 1<=p6]] & [EG [A [~ [[p5<=0 | p7<=0]] U 1<=p11]] | [EG [1<=p0] | AF [1<=p12]]]] U AF [1<=p11]]]]
normalized: [~ [[~ [EG [EG [~ [1<=p11]]]] & ~ [E [EG [~ [1<=p11]] U [~ [[[[~ [EG [~ [1<=p12]]] | EG [1<=p0]] | EG [[~ [EG [~ [1<=p11]]] & ~ [E [~ [1<=p11] U [[p5<=0 | p7<=0] & ~ [1<=p11]]]]]]] & ~ [[1<=p6 & [1<=p0 | ~ [[1<=p13 & 1<=p15]]]]]]] & EG [~ [1<=p11]]]]]]] & E [p14<=0 U E [true U [E [true U p20<=0] | ~ [E [true U ~ [E [1<=p0 U 1<=p4]]]]]]]]
abstracting: (1<=p4)
states: 4,645,008,931,794 (12)
abstracting: (1<=p0)
states: 4,645,008,931,794 (12)
abstracting: (p20<=0)
states: 548,106,259,344 (11)
abstracting: (p14<=0)
states: 2,394,196,568,379 (12)
abstracting: (1<=p11)
states: 2,652,027,957,579 (12)
.
EG iterations: 1
abstracting: (1<=p15)
states: 4,912,161,830,730 (12)
abstracting: (1<=p13)
states: 3,634,972,284,405 (12)
abstracting: (1<=p0)
states: 4,645,008,931,794 (12)
abstracting: (1<=p6)
states: 3,914,577,133,929 (12)
abstracting: (1<=p11)
states: 2,652,027,957,579 (12)
abstracting: (p7<=0)
states: 975,678,496,485 (11)
abstracting: (p5<=0)
states: 1,384,159,920,990 (12)
abstracting: (1<=p11)
states: 2,652,027,957,579 (12)
abstracting: (1<=p11)
states: 2,652,027,957,579 (12)
.
EG iterations: 1
................................................................................
EG iterations: 80
abstracting: (1<=p0)
states: 4,645,008,931,794 (12)
.
EG iterations: 1
abstracting: (1<=p12)
states: 2,982,906,854,004 (12)
.
EG iterations: 1
abstracting: (1<=p11)
states: 2,652,027,957,579 (12)
.
EG iterations: 1
abstracting: (1<=p11)
states: 2,652,027,957,579 (12)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA FMS-PT-00020-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.595sec
checking: [AX [[[~ [E [[1<=p2 & 1<=p18] U [1<=p8 & 1<=p10]]] & [1<=p5 & 1<=p7]] | AF [EX [[1<=p10 & 1<=p17]]]]] & [A [1<=p0 U [[1<=p13 & 1<=p15] | EF [~ [E [1<=p19 U 1<=p4]]]]] & EF [1<=p6]]]
normalized: [[E [true U 1<=p6] & [~ [EG [~ [[E [true U ~ [E [1<=p19 U 1<=p4]]] | [1<=p13 & 1<=p15]]]]] & ~ [E [~ [[E [true U ~ [E [1<=p19 U 1<=p4]]] | [1<=p13 & 1<=p15]]] U [~ [1<=p0] & ~ [[E [true U ~ [E [1<=p19 U 1<=p4]]] | [1<=p13 & 1<=p15]]]]]]]] & ~ [EX [~ [[~ [EG [~ [EX [[1<=p10 & 1<=p17]]]]] | [[1<=p5 & 1<=p7] & ~ [E [[1<=p2 & 1<=p18] U [1<=p8 & 1<=p10]]]]]]]]]
abstracting: (1<=p10)
states: 3,377,140,895,205 (12)
abstracting: (1<=p8)
states: 4,706,323,937,700 (12)
abstracting: (1<=p18)
states: 4,706,323,937,700 (12)
abstracting: (1<=p2)
states: 4,645,008,931,794 (12)
abstracting: (1<=p7)
states: 5,053,490,356,299 (12)
abstracting: (1<=p5)
states: 4,645,008,931,794 (12)
abstracting: (1<=p17)
states: 5,481,062,593,440 (12)
abstracting: (1<=p10)
states: 3,377,140,895,205 (12)
............................................................
EG iterations: 59
.abstracting: (1<=p15)
states: 4,912,161,830,730 (12)
abstracting: (1<=p13)
states: 3,634,972,284,405 (12)
abstracting: (1<=p4)
states: 4,645,008,931,794 (12)
abstracting: (1<=p19)
states: 4,706,323,937,700 (12)
abstracting: (1<=p0)
states: 4,645,008,931,794 (12)
abstracting: (1<=p15)
states: 4,912,161,830,730 (12)
abstracting: (1<=p13)
states: 3,634,972,284,405 (12)
abstracting: (1<=p4)
states: 4,645,008,931,794 (12)
abstracting: (1<=p19)
states: 4,706,323,937,700 (12)
abstracting: (1<=p15)
states: 4,912,161,830,730 (12)
abstracting: (1<=p13)
states: 3,634,972,284,405 (12)
abstracting: (1<=p4)
states: 4,645,008,931,794 (12)
abstracting: (1<=p19)
states: 4,706,323,937,700 (12)
.
EG iterations: 1
abstracting: (1<=p6)
states: 3,914,577,133,929 (12)
-> the formula is TRUE
FORMULA FMS-PT-00020-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.564sec
checking: EG [[[EF [AX [p11<=0]] | [1<=p3 & [EX [[p10<=0 | p17<=0]] & E [[[EF [1<=p9] & 1<=p2] & [1<=p18 & [1<=p2 & 1<=p18]]] U [1<=p6 & p11<=0]]]]] & [EF [p6<=0] | [p4<=0 | AF [1<=p1]]]]]
normalized: EG [[[[p4<=0 | ~ [EG [~ [1<=p1]]]] | E [true U p6<=0]] & [[1<=p3 & [E [[[1<=p18 & [1<=p2 & 1<=p18]] & [1<=p2 & E [true U 1<=p9]]] U [1<=p6 & p11<=0]] & EX [[p10<=0 | p17<=0]]]] | E [true U ~ [EX [~ [p11<=0]]]]]]]
abstracting: (p11<=0)
states: 3,377,140,895,205 (12)
.abstracting: (p17<=0)
states: 548,106,259,344 (11)
abstracting: (p10<=0)
states: 2,652,027,957,579 (12)
.abstracting: (p11<=0)
states: 3,377,140,895,205 (12)
abstracting: (1<=p6)
states: 3,914,577,133,929 (12)
abstracting: (1<=p9)
states: 4,706,323,937,700 (12)
abstracting: (1<=p2)
states: 4,645,008,931,794 (12)
abstracting: (1<=p18)
states: 4,706,323,937,700 (12)
abstracting: (1<=p2)
states: 4,645,008,931,794 (12)
abstracting: (1<=p18)
states: 4,706,323,937,700 (12)
abstracting: (1<=p3)
states: 3,634,972,284,405 (12)
abstracting: (p6<=0)
states: 2,114,591,718,855 (12)
abstracting: (1<=p1)
states: 4,645,008,931,794 (12)
.
EG iterations: 1
abstracting: (p4<=0)
states: 1,384,159,920,990 (12)
EG iterations: 0
-> the formula is TRUE
FORMULA FMS-PT-00020-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.720sec
checking: A [A [1<=p9 U [AG [1<=p12] | [AG [[1<=p19 | 1<=p9]] | p1<=0]]] U E [[A [AX [1<=p6] U 1<=p3] & [1<=p2 & 1<=p18]] U [[AG [1<=p16] | AF [1<=p3]] | [[p19<=0 & 1<=p0] | [p0<=0 & [1<=p21 | 1<=p14]]]]]]
normalized: [~ [EG [~ [E [[[1<=p2 & 1<=p18] & [~ [EG [~ [1<=p3]]] & ~ [E [~ [1<=p3] U [EX [~ [1<=p6]] & ~ [1<=p3]]]]]] U [[[p0<=0 & [1<=p21 | 1<=p14]] | [p19<=0 & 1<=p0]] | [~ [EG [~ [1<=p3]]] | ~ [E [true U ~ [1<=p16]]]]]]]]] & ~ [E [~ [E [[[1<=p2 & 1<=p18] & [~ [EG [~ [1<=p3]]] & ~ [E [~ [1<=p3] U [EX [~ [1<=p6]] & ~ [1<=p3]]]]]] U [[[p0<=0 & [1<=p21 | 1<=p14]] | [p19<=0 & 1<=p0]] | [~ [EG [~ [1<=p3]]] | ~ [E [true U ~ [1<=p16]]]]]]] U [~ [[~ [EG [~ [[[p1<=0 | ~ [E [true U ~ [[1<=p19 | 1<=p9]]]]] | ~ [E [true U ~ [1<=p12]]]]]]] & ~ [E [~ [[[p1<=0 | ~ [E [true U ~ [[1<=p19 | 1<=p9]]]]] | ~ [E [true U ~ [1<=p12]]]]] U [~ [1<=p9] & ~ [[[p1<=0 | ~ [E [true U ~ [[1<=p19 | 1<=p9]]]]] | ~ [E [true U ~ [1<=p12]]]]]]]]]] & ~ [E [[[1<=p2 & 1<=p18] & [~ [EG [~ [1<=p3]]] & ~ [E [~ [1<=p3] U [EX [~ [1<=p6]] & ~ [1<=p3]]]]]] U [[[p0<=0 & [1<=p21 | 1<=p14]] | [p19<=0 & 1<=p0]] | [~ [EG [~ [1<=p3]]] | ~ [E [true U ~ [1<=p16]]]]]]]]]]]
abstracting: (1<=p16)
states: 5,481,062,593,440 (12)
abstracting: (1<=p3)
states: 3,634,972,284,405 (12)
.
EG iterations: 1
abstracting: (1<=p0)
states: 4,645,008,931,794 (12)
abstracting: (p19<=0)
states: 1,322,844,915,084 (12)
abstracting: (1<=p14)
states: 3,634,972,284,405 (12)
abstracting: (1<=p21)
states: 4,706,323,937,700 (12)
abstracting: (p0<=0)
states: 1,384,159,920,990 (12)
abstracting: (1<=p3)
states: 3,634,972,284,405 (12)
abstracting: (1<=p6)
states: 3,914,577,133,929 (12)
.abstracting: (1<=p3)
states: 3,634,972,284,405 (12)
abstracting: (1<=p3)
states: 3,634,972,284,405 (12)
.
EG iterations: 1
abstracting: (1<=p18)
states: 4,706,323,937,700 (12)
abstracting: (1<=p2)
states: 4,645,008,931,794 (12)
abstracting: (1<=p12)
states: 2,982,906,854,004 (12)
abstracting: (1<=p9)
states: 4,706,323,937,700 (12)
abstracting: (1<=p19)
states: 4,706,323,937,700 (12)
abstracting: (p1<=0)
states: 1,384,159,920,990 (12)
abstracting: (1<=p9)
states: 4,706,323,937,700 (12)
abstracting: (1<=p12)
states: 2,982,906,854,004 (12)
abstracting: (1<=p9)
states: 4,706,323,937,700 (12)
abstracting: (1<=p19)
states: 4,706,323,937,700 (12)
abstracting: (p1<=0)
states: 1,384,159,920,990 (12)
abstracting: (1<=p12)
states: 2,982,906,854,004 (12)
abstracting: (1<=p9)
states: 4,706,323,937,700 (12)
abstracting: (1<=p19)
states: 4,706,323,937,700 (12)
abstracting: (p1<=0)
states: 1,384,159,920,990 (12)
.
EG iterations: 1
abstracting: (1<=p16)
states: 5,481,062,593,440 (12)
abstracting: (1<=p3)
states: 3,634,972,284,405 (12)
.
EG iterations: 1
abstracting: (1<=p0)
states: 4,645,008,931,794 (12)
abstracting: (p19<=0)
states: 1,322,844,915,084 (12)
abstracting: (1<=p14)
states: 3,634,972,284,405 (12)
abstracting: (1<=p21)
states: 4,706,323,937,700 (12)
abstracting: (p0<=0)
states: 1,384,159,920,990 (12)
abstracting: (1<=p3)
states: 3,634,972,284,405 (12)
abstracting: (1<=p6)
states: 3,914,577,133,929 (12)
.abstracting: (1<=p3)
states: 3,634,972,284,405 (12)
abstracting: (1<=p3)
states: 3,634,972,284,405 (12)
.
EG iterations: 1
abstracting: (1<=p18)
states: 4,706,323,937,700 (12)
abstracting: (1<=p2)
states: 4,645,008,931,794 (12)
abstracting: (1<=p16)
states: 5,481,062,593,440 (12)
abstracting: (1<=p3)
states: 3,634,972,284,405 (12)
.
EG iterations: 1
abstracting: (1<=p0)
states: 4,645,008,931,794 (12)
abstracting: (p19<=0)
states: 1,322,844,915,084 (12)
abstracting: (1<=p14)
states: 3,634,972,284,405 (12)
abstracting: (1<=p21)
states: 4,706,323,937,700 (12)
abstracting: (p0<=0)
states: 1,384,159,920,990 (12)
abstracting: (1<=p3)
states: 3,634,972,284,405 (12)
abstracting: (1<=p6)
states: 3,914,577,133,929 (12)
.abstracting: (1<=p3)
states: 3,634,972,284,405 (12)
abstracting: (1<=p3)
states: 3,634,972,284,405 (12)
.
EG iterations: 1
abstracting: (1<=p18)
states: 4,706,323,937,700 (12)
abstracting: (1<=p2)
states: 4,645,008,931,794 (12)
.
EG iterations: 1
-> the formula is FALSE
FORMULA FMS-PT-00020-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.745sec
checking: [EX [EF [[[p4<=0 | [p10<=0 | p17<=0]] & AG [[p5<=0 | p7<=0]]]]] & EF [[EX [EX [[p2<=0 | p18<=0]]] | [[EG [p6<=0] | [EG [[p10<=0 | p17<=0]] & [p0<=0 | [p8<=0 | p10<=0]]]] & ~ [E [[1<=p19 & 1<=p4] U [[1<=p2 & 1<=p18] | [1<=p5 & 1<=p7]]]]]]]]
normalized: [E [true U [[~ [E [[1<=p19 & 1<=p4] U [[1<=p5 & 1<=p7] | [1<=p2 & 1<=p18]]]] & [[[p0<=0 | [p8<=0 | p10<=0]] & EG [[p10<=0 | p17<=0]]] | EG [p6<=0]]] | EX [EX [[p2<=0 | p18<=0]]]]] & EX [E [true U [~ [E [true U ~ [[p5<=0 | p7<=0]]]] & [p4<=0 | [p10<=0 | p17<=0]]]]]]
abstracting: (p17<=0)
states: 548,106,259,344 (11)
abstracting: (p10<=0)
states: 2,652,027,957,579 (12)
abstracting: (p4<=0)
states: 1,384,159,920,990 (12)
abstracting: (p7<=0)
states: 975,678,496,485 (11)
abstracting: (p5<=0)
states: 1,384,159,920,990 (12)
.abstracting: (p18<=0)
states: 1,322,844,915,084 (12)
abstracting: (p2<=0)
states: 1,384,159,920,990 (12)
..abstracting: (p6<=0)
states: 2,114,591,718,855 (12)
.
EG iterations: 1
abstracting: (p17<=0)
states: 548,106,259,344 (11)
abstracting: (p10<=0)
states: 2,652,027,957,579 (12)
..............................................................................
EG iterations: 78
abstracting: (p10<=0)
states: 2,652,027,957,579 (12)
abstracting: (p8<=0)
states: 1,322,844,915,084 (12)
abstracting: (p0<=0)
states: 1,384,159,920,990 (12)
abstracting: (1<=p18)
states: 4,706,323,937,700 (12)
abstracting: (1<=p2)
states: 4,645,008,931,794 (12)
abstracting: (1<=p7)
states: 5,053,490,356,299 (12)
abstracting: (1<=p5)
states: 4,645,008,931,794 (12)
abstracting: (1<=p4)
states: 4,645,008,931,794 (12)
abstracting: (1<=p19)
states: 4,706,323,937,700 (12)
-> the formula is FALSE
FORMULA FMS-PT-00020-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.204sec
checking: E [EG [[~ [[AG [[1<=p8 & 1<=p10]] | 1<=p0]] | [1<=p0 & [AF [1<=p19] | [p6<=0 & 1<=p1]]]]] U [1<=p6 & [EG [[1<=p1 | EG [p4<=0]]] & [[A [[[1<=p20 & 1<=p14] & [1<=p13 & 1<=p15]] U [[AX [1<=p0] & 1<=p13] & [1<=p15 & [1<=p8 & 1<=p10]]]] | AG [1<=p20]] | [AG [[1<=p10 & 1<=p17]] | [~ [[~ [[1<=p2 & 1<=p18]] & 1<=p4]] | [1<=p10 & 1<=p17]]]]]]]
normalized: E [EG [[[1<=p0 & [[p6<=0 & 1<=p1] | ~ [EG [~ [1<=p19]]]]] | ~ [[1<=p0 | ~ [E [true U ~ [[1<=p8 & 1<=p10]]]]]]]] U [1<=p6 & [[[[[1<=p10 & 1<=p17] | ~ [[1<=p4 & ~ [[1<=p2 & 1<=p18]]]]] | ~ [E [true U ~ [[1<=p10 & 1<=p17]]]]] | [~ [E [true U ~ [1<=p20]]] | [~ [EG [~ [[[1<=p15 & [1<=p8 & 1<=p10]] & [1<=p13 & ~ [EX [~ [1<=p0]]]]]]]] & ~ [E [~ [[[1<=p15 & [1<=p8 & 1<=p10]] & [1<=p13 & ~ [EX [~ [1<=p0]]]]]] U [~ [[[1<=p13 & 1<=p15] & [1<=p20 & 1<=p14]]] & ~ [[[1<=p15 & [1<=p8 & 1<=p10]] & [1<=p13 & ~ [EX [~ [1<=p0]]]]]]]]]]]] & EG [[1<=p1 | EG [p4<=0]]]]]]
abstracting: (p4<=0)
states: 1,384,159,920,990 (12)
.
EG iterations: 1
abstracting: (1<=p1)
states: 4,645,008,931,794 (12)
.
EG iterations: 1
abstracting: (1<=p0)
states: 4,645,008,931,794 (12)
.abstracting: (1<=p13)
states: 3,634,972,284,405 (12)
abstracting: (1<=p10)
states: 3,377,140,895,205 (12)
abstracting: (1<=p8)
states: 4,706,323,937,700 (12)
abstracting: (1<=p15)
states: 4,912,161,830,730 (12)
abstracting: (1<=p14)
states: 3,634,972,284,405 (12)
abstracting: (1<=p20)
states: 5,481,062,593,440 (12)
abstracting: (1<=p15)
states: 4,912,161,830,730 (12)
abstracting: (1<=p13)
states: 3,634,972,284,405 (12)
abstracting: (1<=p0)
states: 4,645,008,931,794 (12)
.abstracting: (1<=p13)
states: 3,634,972,284,405 (12)
abstracting: (1<=p10)
states: 3,377,140,895,205 (12)
abstracting: (1<=p8)
states: 4,706,323,937,700 (12)
abstracting: (1<=p15)
states: 4,912,161,830,730 (12)
abstracting: (1<=p0)
states: 4,645,008,931,794 (12)
.abstracting: (1<=p13)
states: 3,634,972,284,405 (12)
abstracting: (1<=p10)
states: 3,377,140,895,205 (12)
abstracting: (1<=p8)
states: 4,706,323,937,700 (12)
abstracting: (1<=p15)
states: 4,912,161,830,730 (12)
.
EG iterations: 1
abstracting: (1<=p20)
states: 5,481,062,593,440 (12)
abstracting: (1<=p17)
states: 5,481,062,593,440 (12)
abstracting: (1<=p10)
states: 3,377,140,895,205 (12)
abstracting: (1<=p18)
states: 4,706,323,937,700 (12)
abstracting: (1<=p2)
states: 4,645,008,931,794 (12)
abstracting: (1<=p4)
states: 4,645,008,931,794 (12)
abstracting: (1<=p17)
states: 5,481,062,593,440 (12)
abstracting: (1<=p10)
states: 3,377,140,895,205 (12)
abstracting: (1<=p6)
states: 3,914,577,133,929 (12)
abstracting: (1<=p10)
states: 3,377,140,895,205 (12)
abstracting: (1<=p8)
states: 4,706,323,937,700 (12)
abstracting: (1<=p0)
states: 4,645,008,931,794 (12)
abstracting: (1<=p19)
states: 4,706,323,937,700 (12)
................................................................................
EG iterations: 80
abstracting: (1<=p1)
states: 4,645,008,931,794 (12)
abstracting: (p6<=0)
states: 2,114,591,718,855 (12)
abstracting: (1<=p0)
states: 4,645,008,931,794 (12)
.
EG iterations: 1
-> the formula is TRUE
FORMULA FMS-PT-00020-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.759sec
totally nodes used: 15655774 (1.6e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 183229799 38838989 222068788
used/not used/entry size/cache size: 35703876 31404988 16 1024MB
basic ops cache: hits/miss/sum: 70656330 14685736 85342066
used/not used/entry size/cache size: 12695008 4082208 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: 3215954 636931 3852885
used/not used/entry size/cache size: 614099 7774509 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 53372161
1 12121401
2 1453323
3 130585
4 12324
5 3173
6 7846
7 2716
8 992
9 491
>= 10 3852
Total processing time: 0m41.441sec
BK_STOP 1678494052049
--------------------
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:1560 (78), effective:340 (17)
initing FirstDep: 0m 0.000sec
iterations count:92 (4), effective:14 (0)
iterations count:92 (4), effective:14 (0)
iterations count:92 (4), effective:14 (0)
iterations count:85 (4), effective:16 (0)
iterations count:250 (12), effective:52 (2)
iterations count:61 (3), effective:20 (1)
iterations count:29 (1), effective:3 (0)
iterations count:250 (12), effective:52 (2)
iterations count:20 (1), effective:0 (0)
iterations count:250 (12), effective:52 (2)
iterations count:94 (4), effective:25 (1)
iterations count:24 (1), effective:2 (0)
iterations count:24 (1), effective:2 (0)
iterations count:82 (4), effective:14 (0)
iterations count:81 (4), effective:14 (0)
iterations count:91 (4), effective:14 (0)
iterations count:29 (1), effective:3 (0)
iterations count:39 (1), effective:19 (0)
iterations count:91 (4), effective:17 (0)
iterations count:171 (8), effective:44 (2)
iterations count:120 (6), effective:40 (2)
iterations count:74 (3), effective:14 (0)
iterations count:100 (5), effective:40 (2)
iterations count:80 (4), effective:20 (1)
iterations count:20 (1), effective:0 (0)
iterations count:20 (1), effective:0 (0)
iterations count:26 (1), effective:3 (0)
iterations count:87 (4), effective:32 (1)
iterations count:81 (4), effective:14 (0)
iterations count:74 (3), effective:14 (0)
iterations count:120 (6), effective:40 (2)
iterations count:74 (3), effective:14 (0)
iterations count:120 (6), effective:40 (2)
iterations count:74 (3), effective:14 (0)
iterations count:120 (6), effective:40 (2)
iterations count:75 (3), effective:14 (0)
iterations count:292 (14), effective:97 (4)
iterations count:80 (4), effective:14 (0)
iterations count:78 (3), effective:15 (0)
iterations count:26 (1), effective:3 (0)
iterations count:60 (3), effective:20 (1)
iterations count:24 (1), effective:2 (0)
iterations count:20 (1), effective:0 (0)
iterations count:40 (2), effective:2 (0)
iterations count:140 (7), effective:40 (2)
iterations count:40 (2), effective:2 (0)
iterations count:140 (7), effective:40 (2)
iterations count:100 (5), effective:20 (1)
iterations count:40 (2), effective:2 (0)
iterations count:140 (7), effective:40 (2)
iterations count:60 (3), effective:20 (1)
iterations count:24 (1), effective:2 (0)
iterations count:20 (1), effective:0 (0)
iterations count:79 (3), effective:27 (1)
iterations count:60 (3), effective:20 (1)
iterations count:24 (1), effective:2 (0)
iterations count:20 (1), effective:0 (0)
iterations count:77 (3), effective:15 (0)
iterations count:32 (1), effective:5 (0)
iterations count:92 (4), effective:18 (0)
iterations count:77 (3), effective:19 (0)
iterations count:80 (4), effective:20 (1)
iterations count:94 (4), effective:25 (1)
iterations count:23 (1), effective:1 (0)
iterations count:145 (7), effective:40 (2)
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="FMS-PT-00020"
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 FMS-PT-00020, 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 r170-tall-167838856900210"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FMS-PT-00020.tgz
mv FMS-PT-00020 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 ;