About the Execution of Marcie+red for AutoFlight-PT-02a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5452.451 | 11426.00 | 19809.00 | 61.90 | FTTTFTTFTFFFTTFT | 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.r010-oct2-167813599000386.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 AutoFlight-PT-02a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599000386
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.5K Feb 25 18:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 18:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 18:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 18:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 18:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 18:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 18:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 25 18:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 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 AutoFlight-PT-02a-CTLFireability-00
FORMULA_NAME AutoFlight-PT-02a-CTLFireability-01
FORMULA_NAME AutoFlight-PT-02a-CTLFireability-02
FORMULA_NAME AutoFlight-PT-02a-CTLFireability-03
FORMULA_NAME AutoFlight-PT-02a-CTLFireability-04
FORMULA_NAME AutoFlight-PT-02a-CTLFireability-05
FORMULA_NAME AutoFlight-PT-02a-CTLFireability-06
FORMULA_NAME AutoFlight-PT-02a-CTLFireability-07
FORMULA_NAME AutoFlight-PT-02a-CTLFireability-08
FORMULA_NAME AutoFlight-PT-02a-CTLFireability-09
FORMULA_NAME AutoFlight-PT-02a-CTLFireability-10
FORMULA_NAME AutoFlight-PT-02a-CTLFireability-11
FORMULA_NAME AutoFlight-PT-02a-CTLFireability-12
FORMULA_NAME AutoFlight-PT-02a-CTLFireability-13
FORMULA_NAME AutoFlight-PT-02a-CTLFireability-14
FORMULA_NAME AutoFlight-PT-02a-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678687445702
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=AutoFlight-PT-02a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 06:04:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 06:04:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 06:04:08] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2023-03-13 06:04:08] [INFO ] Transformed 57 places.
[2023-03-13 06:04:08] [INFO ] Transformed 55 transitions.
[2023-03-13 06:04:08] [INFO ] Found NUPN structural information;
[2023-03-13 06:04:08] [INFO ] Parsed PT model containing 57 places and 55 transitions and 180 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
FORMULA AutoFlight-PT-02a-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 45/45 transitions.
Applied a total of 0 rules in 10 ms. Remains 57 /57 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 57 cols
[2023-03-13 06:04:08] [INFO ] Computed 16 place invariants in 9 ms
[2023-03-13 06:04:09] [INFO ] Implicit Places using invariants in 356 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 389 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/57 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 400 ms. Remains : 56/57 places, 45/45 transitions.
Support contains 51 out of 56 places after structural reductions.
[2023-03-13 06:04:09] [INFO ] Flatten gal took : 26 ms
[2023-03-13 06:04:09] [INFO ] Flatten gal took : 11 ms
[2023-03-13 06:04:09] [INFO ] Input system was already deterministic with 45 transitions.
Support contains 50 out of 56 places (down from 51) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 392 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 58) seen :49
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 125 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 125 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 45 rows 56 cols
[2023-03-13 06:04:10] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-13 06:04:10] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-13 06:04:10] [INFO ] [Real]Absence check using 14 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-13 06:04:11] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2023-03-13 06:04:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-13 06:04:11] [INFO ] [Nat]Absence check using 14 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-13 06:04:11] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :2
[2023-03-13 06:04:11] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-13 06:04:11] [INFO ] After 14ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :4 sat :2
[2023-03-13 06:04:11] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-13 06:04:11] [INFO ] After 138ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :2
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 7 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 45/45 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 56 transition count 41
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 52 transition count 41
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 52 transition count 36
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 47 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 22 place count 45 transition count 34
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 25 place count 45 transition count 31
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 28 place count 42 transition count 31
Applied a total of 28 rules in 27 ms. Remains 42 /56 variables (removed 14) and now considering 31/45 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 42/56 places, 31/45 transitions.
Incomplete random walk after 10000 steps, including 331 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Finished Best-First random walk after 2535 steps, including 44 resets, run visited all 2 properties in 21 ms. (steps per millisecond=120 )
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 14 ms
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:04:11] [INFO ] Input system was already deterministic with 45 transitions.
Computed a total of 4 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 56/56 places, 45/45 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 56 transition count 41
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 52 transition count 41
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 52 transition count 37
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 48 transition count 37
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 44 transition count 33
Applied a total of 24 rules in 7 ms. Remains 44 /56 variables (removed 12) and now considering 33/45 (removed 12) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 44/56 places, 33/45 transitions.
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:11] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 56/56 places, 45/45 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 56 transition count 41
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 52 transition count 41
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 52 transition count 37
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 48 transition count 37
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 45 transition count 34
Applied a total of 22 rules in 4 ms. Remains 45 /56 variables (removed 11) and now considering 34/45 (removed 11) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 45/56 places, 34/45 transitions.
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:11] [INFO ] Input system was already deterministic with 34 transitions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 56/56 places, 45/45 transitions.
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:04:11] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 56/56 places, 45/45 transitions.
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 8 ms
[2023-03-13 06:04:11] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 56/56 places, 45/45 transitions.
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:11] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 56/56 places, 45/45 transitions.
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:04:11] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 56/56 places, 45/45 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 56 transition count 41
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 52 transition count 41
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 52 transition count 37
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 48 transition count 37
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 45 transition count 34
Applied a total of 22 rules in 5 ms. Remains 45 /56 variables (removed 11) and now considering 34/45 (removed 11) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 45/56 places, 34/45 transitions.
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:11] [INFO ] Input system was already deterministic with 34 transitions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 56 /56 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 56/56 places, 45/45 transitions.
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:04:11] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 56 /56 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 56/56 places, 45/45 transitions.
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:11] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 56/56 places, 45/45 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 56 transition count 41
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 52 transition count 41
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 52 transition count 36
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 47 transition count 36
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 44 transition count 33
Applied a total of 24 rules in 4 ms. Remains 44 /56 variables (removed 12) and now considering 33/45 (removed 12) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 44/56 places, 33/45 transitions.
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:11] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 56/56 places, 45/45 transitions.
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:11] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 56/56 places, 45/45 transitions.
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:11] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 56/56 places, 45/45 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 56 transition count 43
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 54 transition count 43
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 54 transition count 40
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 51 transition count 40
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 48 transition count 37
Applied a total of 16 rules in 4 ms. Remains 48 /56 variables (removed 8) and now considering 37/45 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 48/56 places, 37/45 transitions.
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:11] [INFO ] Input system was already deterministic with 37 transitions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 56/56 places, 45/45 transitions.
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:11] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 45/45 transitions.
Applied a total of 0 rules in 28 ms. Remains 56 /56 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 56/56 places, 45/45 transitions.
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:11] [INFO ] Input system was already deterministic with 45 transitions.
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:04:11] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:04:11] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-13 06:04:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 56 places, 45 transitions and 157 arcs took 4 ms.
Total runtime 3180 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: 56 NrTr: 45 NrArc: 157)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 2.907sec
RS generation: 0m 0.004sec
-> reachability set: #nodes 319 (3.2e+02) #states 6,949 (3)
starting MCC model checker
--------------------------
checking: EF [AG [[p10<=1 & 1<=p10]]]
normalized: E [true U ~ [E [true U ~ [[p10<=1 & 1<=p10]]]]]
abstracting: (1<=p10)
states: 2,568 (3)
abstracting: (p10<=1)
states: 6,949 (3)
-> the formula is FALSE
FORMULA AutoFlight-PT-02a-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [[EG [[p5<=1 & 1<=p5]] & [p16<=1 & 1<=p16]]]
normalized: E [true U [[p16<=1 & 1<=p16] & EG [[p5<=1 & 1<=p5]]]]
abstracting: (1<=p5)
states: 1,980 (3)
abstracting: (p5<=1)
states: 6,949 (3)
.............
EG iterations: 13
abstracting: (1<=p16)
states: 3,474 (3)
abstracting: (p16<=1)
states: 6,949 (3)
-> the formula is TRUE
FORMULA AutoFlight-PT-02a-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.030sec
checking: EG [AG [EX [[[p5<=0 & 0<=p5] & [[p9<=0 & 0<=p9] & [p6<=1 & 1<=p6]]]]]]
normalized: EG [~ [E [true U ~ [EX [[[[p6<=1 & 1<=p6] & [p9<=0 & 0<=p9]] & [p5<=0 & 0<=p5]]]]]]]
abstracting: (0<=p5)
states: 6,949 (3)
abstracting: (p5<=0)
states: 4,969 (3)
abstracting: (0<=p9)
states: 6,949 (3)
abstracting: (p9<=0)
states: 5,137 (3)
abstracting: (1<=p6)
states: 2,484 (3)
abstracting: (p6<=1)
states: 6,949 (3)
..
EG iterations: 1
-> the formula is FALSE
FORMULA AutoFlight-PT-02a-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: AG [E [~ [[[1<=p18 & p18<=1] & [[p32<=1 & 1<=p32] & [p55<=1 & 1<=p55]]]] U [[p47<=1 & 1<=p47] & [p54<=1 & 1<=p54]]]]
normalized: ~ [E [true U ~ [E [~ [[[[p55<=1 & 1<=p55] & [p32<=1 & 1<=p32]] & [1<=p18 & p18<=1]]] U [[p54<=1 & 1<=p54] & [p47<=1 & 1<=p47]]]]]]
abstracting: (1<=p47)
states: 5,328 (3)
abstracting: (p47<=1)
states: 6,949 (3)
abstracting: (1<=p54)
states: 324
abstracting: (p54<=1)
states: 6,949 (3)
abstracting: (p18<=1)
states: 6,949 (3)
abstracting: (1<=p18)
states: 3,474 (3)
abstracting: (1<=p32)
states: 144
abstracting: (p32<=1)
states: 6,949 (3)
abstracting: (1<=p55)
states: 6,624 (3)
abstracting: (p55<=1)
states: 6,949 (3)
-> the formula is FALSE
FORMULA AutoFlight-PT-02a-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: EG [AG [[AG [[p3<=1 & 1<=p3]] | [~ [A [[[p47<=1 & 1<=p47] & [p54<=1 & 1<=p54]] U [p16<=1 & 1<=p16]]] | [[p0<=0 & 0<=p0] & AG [[p0<=0 & 0<=p0]]]]]]]
normalized: EG [~ [E [true U ~ [[[[~ [E [true U ~ [[p0<=0 & 0<=p0]]]] & [p0<=0 & 0<=p0]] | ~ [[~ [EG [~ [[p16<=1 & 1<=p16]]]] & ~ [E [~ [[p16<=1 & 1<=p16]] U [~ [[[p54<=1 & 1<=p54] & [p47<=1 & 1<=p47]]] & ~ [[p16<=1 & 1<=p16]]]]]]]] | ~ [E [true U ~ [[p3<=1 & 1<=p3]]]]]]]]]
abstracting: (1<=p3)
states: 2,532 (3)
abstracting: (p3<=1)
states: 6,949 (3)
abstracting: (1<=p16)
states: 3,474 (3)
abstracting: (p16<=1)
states: 6,949 (3)
abstracting: (1<=p47)
states: 5,328 (3)
abstracting: (p47<=1)
states: 6,949 (3)
abstracting: (1<=p54)
states: 324
abstracting: (p54<=1)
states: 6,949 (3)
abstracting: (1<=p16)
states: 3,474 (3)
abstracting: (p16<=1)
states: 6,949 (3)
abstracting: (1<=p16)
states: 3,474 (3)
abstracting: (p16<=1)
states: 6,949 (3)
............
EG iterations: 12
abstracting: (0<=p0)
states: 6,949 (3)
abstracting: (p0<=0)
states: 6,948 (3)
abstracting: (0<=p0)
states: 6,949 (3)
abstracting: (p0<=0)
states: 6,948 (3)
EG iterations: 0
-> the formula is TRUE
FORMULA AutoFlight-PT-02a-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.014sec
checking: EF [[AF [[p23<=1 & 1<=p23]] | [~ [A [[p3<=1 & 1<=p3] U EG [[p18<=1 & 1<=p18]]]] & EG [[[p16<=0 & 0<=p16] & [[p31<=0 & 0<=p31] | [p54<=0 & 0<=p54]]]]]]]
normalized: E [true U [[EG [[[[p54<=0 & 0<=p54] | [p31<=0 & 0<=p31]] & [p16<=0 & 0<=p16]]] & ~ [[~ [EG [~ [EG [[p18<=1 & 1<=p18]]]]] & ~ [E [~ [EG [[p18<=1 & 1<=p18]]] U [~ [[p3<=1 & 1<=p3]] & ~ [EG [[p18<=1 & 1<=p18]]]]]]]]] | ~ [EG [~ [[p23<=1 & 1<=p23]]]]]]
abstracting: (1<=p23)
states: 144
abstracting: (p23<=1)
states: 6,949 (3)
....................
EG iterations: 20
abstracting: (1<=p18)
states: 3,474 (3)
abstracting: (p18<=1)
states: 6,949 (3)
..............
EG iterations: 14
abstracting: (1<=p3)
states: 2,532 (3)
abstracting: (p3<=1)
states: 6,949 (3)
abstracting: (1<=p18)
states: 3,474 (3)
abstracting: (p18<=1)
states: 6,949 (3)
..............
EG iterations: 14
abstracting: (1<=p18)
states: 3,474 (3)
abstracting: (p18<=1)
states: 6,949 (3)
..............
EG iterations: 14
..
EG iterations: 2
abstracting: (0<=p16)
states: 6,949 (3)
abstracting: (p16<=0)
states: 3,475 (3)
abstracting: (0<=p31)
states: 6,949 (3)
abstracting: (p31<=0)
states: 1,837 (3)
abstracting: (0<=p54)
states: 6,949 (3)
abstracting: (p54<=0)
states: 6,625 (3)
.......................
EG iterations: 23
-> the formula is TRUE
FORMULA AutoFlight-PT-02a-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.060sec
checking: EX [[AF [[EF [[[p14<=1 & 1<=p14] & [p22<=1 & 1<=p22]]] & [p16<=1 & 1<=p16]]] & E [EG [[p35<=1 & 1<=p35]] U AF [E [[[p14<=1 & 1<=p14] & [p28<=1 & 1<=p28]] U [p13<=1 & 1<=p13]]]]]]
normalized: EX [[E [EG [[p35<=1 & 1<=p35]] U ~ [EG [~ [E [[[p28<=1 & 1<=p28] & [p14<=1 & 1<=p14]] U [p13<=1 & 1<=p13]]]]]] & ~ [EG [~ [[[p16<=1 & 1<=p16] & E [true U [[p22<=1 & 1<=p22] & [p14<=1 & 1<=p14]]]]]]]]]
abstracting: (1<=p14)
states: 6,948 (3)
abstracting: (p14<=1)
states: 6,949 (3)
abstracting: (1<=p22)
states: 144
abstracting: (p22<=1)
states: 6,949 (3)
abstracting: (1<=p16)
states: 3,474 (3)
abstracting: (p16<=1)
states: 6,949 (3)
..
EG iterations: 2
abstracting: (1<=p13)
states: 2,520 (3)
abstracting: (p13<=1)
states: 6,949 (3)
abstracting: (1<=p14)
states: 6,948 (3)
abstracting: (p14<=1)
states: 6,949 (3)
abstracting: (1<=p28)
states: 144
abstracting: (p28<=1)
states: 6,949 (3)
.....................
EG iterations: 21
abstracting: (1<=p35)
states: 144
abstracting: (p35<=1)
states: 6,949 (3)
..........
EG iterations: 10
.-> the formula is TRUE
FORMULA AutoFlight-PT-02a-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.030sec
checking: AX [[[EG [[AG [[p6<=1 & 1<=p6]] | EX [[[p11<=1 & 1<=p11] & [p40<=1 & 1<=p40]]]]] | EG [AG [[p12<=1 & 1<=p12]]]] | [AF [[p18<=1 & 1<=p18]] | [[p14<=0 & 0<=p14] | [p38<=0 & 0<=p38]]]]]
normalized: ~ [EX [~ [[[[[p38<=0 & 0<=p38] | [p14<=0 & 0<=p14]] | ~ [EG [~ [[p18<=1 & 1<=p18]]]]] | [EG [~ [E [true U ~ [[p12<=1 & 1<=p12]]]]] | EG [[EX [[[p40<=1 & 1<=p40] & [p11<=1 & 1<=p11]]] | ~ [E [true U ~ [[p6<=1 & 1<=p6]]]]]]]]]]]
abstracting: (1<=p6)
states: 2,484 (3)
abstracting: (p6<=1)
states: 6,949 (3)
abstracting: (1<=p11)
states: 2,520 (3)
abstracting: (p11<=1)
states: 6,949 (3)
abstracting: (1<=p40)
states: 324
abstracting: (p40<=1)
states: 6,949 (3)
...........
EG iterations: 10
abstracting: (1<=p12)
states: 1,908 (3)
abstracting: (p12<=1)
states: 6,949 (3)
.
EG iterations: 1
abstracting: (1<=p18)
states: 3,474 (3)
abstracting: (p18<=1)
states: 6,949 (3)
............
EG iterations: 12
abstracting: (0<=p14)
states: 6,949 (3)
abstracting: (p14<=0)
states: 1
abstracting: (0<=p38)
states: 6,949 (3)
abstracting: (p38<=0)
states: 6,805 (3)
.-> the formula is TRUE
FORMULA AutoFlight-PT-02a-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.015sec
checking: E [~ [E [AX [AX [[p2<=1 & 1<=p2]]] U [AX [EX [[p5<=1 & 1<=p5]]] & [AF [[[p14<=1 & 1<=p14] & [p34<=1 & 1<=p34]]] & ~ [AG [[p23<=1 & 1<=p23]]]]]]] U AG [[AX [EG [[p10<=1 & 1<=p10]]] & [[p14<=1 & 1<=p14] & [p28<=1 & 1<=p28]]]]]
normalized: E [~ [E [~ [EX [EX [~ [[p2<=1 & 1<=p2]]]]] U [[E [true U ~ [[p23<=1 & 1<=p23]]] & ~ [EG [~ [[[p34<=1 & 1<=p34] & [p14<=1 & 1<=p14]]]]]] & ~ [EX [~ [EX [[p5<=1 & 1<=p5]]]]]]]] U ~ [E [true U ~ [[[[p28<=1 & 1<=p28] & [p14<=1 & 1<=p14]] & ~ [EX [~ [EG [[p10<=1 & 1<=p10]]]]]]]]]]
abstracting: (1<=p10)
states: 2,568 (3)
abstracting: (p10<=1)
states: 6,949 (3)
...............
EG iterations: 15
.abstracting: (1<=p14)
states: 6,948 (3)
abstracting: (p14<=1)
states: 6,949 (3)
abstracting: (1<=p28)
states: 144
abstracting: (p28<=1)
states: 6,949 (3)
abstracting: (1<=p5)
states: 1,980 (3)
abstracting: (p5<=1)
states: 6,949 (3)
..abstracting: (1<=p14)
states: 6,948 (3)
abstracting: (p14<=1)
states: 6,949 (3)
abstracting: (1<=p34)
states: 144
abstracting: (p34<=1)
states: 6,949 (3)
...................
EG iterations: 19
abstracting: (1<=p23)
states: 144
abstracting: (p23<=1)
states: 6,949 (3)
abstracting: (1<=p2)
states: 1,884 (3)
abstracting: (p2<=1)
states: 6,949 (3)
..-> the formula is FALSE
FORMULA AutoFlight-PT-02a-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.027sec
checking: AX [[AG [EF [[E [[p0<=1 & 1<=p0] U [p16<=1 & 1<=p16]] | [[p53<=0 & 0<=p53] | [p54<=0 & 0<=p54]]]]] | [AX [[[p7<=1 & 1<=p7] & [p33<=1 & 1<=p33]]] | [[AG [[[p8<=1 & 1<=p8] & [p30<=1 & 1<=p30]]] & [p6<=1 & 1<=p6]] & [[p44<=1 & 1<=p44] & [[p3<=1 & 1<=p3] & [p16<=1 & 1<=p16]]]]]]]
normalized: ~ [EX [~ [[[[[[[p16<=1 & 1<=p16] & [p3<=1 & 1<=p3]] & [p44<=1 & 1<=p44]] & [[p6<=1 & 1<=p6] & ~ [E [true U ~ [[[p30<=1 & 1<=p30] & [p8<=1 & 1<=p8]]]]]]] | ~ [EX [~ [[[p33<=1 & 1<=p33] & [p7<=1 & 1<=p7]]]]]] | ~ [E [true U ~ [E [true U [[[p54<=0 & 0<=p54] | [p53<=0 & 0<=p53]] | E [[p0<=1 & 1<=p0] U [p16<=1 & 1<=p16]]]]]]]]]]]
abstracting: (1<=p16)
states: 3,474 (3)
abstracting: (p16<=1)
states: 6,949 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 6,949 (3)
abstracting: (0<=p53)
states: 6,949 (3)
abstracting: (p53<=0)
states: 1,621 (3)
abstracting: (0<=p54)
states: 6,949 (3)
abstracting: (p54<=0)
states: 6,625 (3)
abstracting: (1<=p7)
states: 6,948 (3)
abstracting: (p7<=1)
states: 6,949 (3)
abstracting: (1<=p33)
states: 144
abstracting: (p33<=1)
states: 6,949 (3)
.abstracting: (1<=p8)
states: 2,568 (3)
abstracting: (p8<=1)
states: 6,949 (3)
abstracting: (1<=p30)
states: 324
abstracting: (p30<=1)
states: 6,949 (3)
abstracting: (1<=p6)
states: 2,484 (3)
abstracting: (p6<=1)
states: 6,949 (3)
abstracting: (1<=p44)
states: 324
abstracting: (p44<=1)
states: 6,949 (3)
abstracting: (1<=p3)
states: 2,532 (3)
abstracting: (p3<=1)
states: 6,949 (3)
abstracting: (1<=p16)
states: 3,474 (3)
abstracting: (p16<=1)
states: 6,949 (3)
.-> the formula is TRUE
FORMULA AutoFlight-PT-02a-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: AF [[EX [[[p16<=1 & 1<=p16] & AG [[[p4<=0 & 0<=p4] | [p39<=0 & 0<=p39]]]]] & [[p1<=0 & 0<=p1] | [[p29<=0 & 0<=p29] | [~ [E [EF [[p13<=1 & 1<=p13]] U EX [[p26<=1 & 1<=p26]]]] & [[p4<=0 & 0<=p4] | [[p39<=0 & 0<=p39] | [[[p12<=0 & 0<=p12] & [p3<=0 & 0<=p3]] & [[p18<=0 & 0<=p18] & [[p6<=0 & 0<=p6] | [p44<=0 & 0<=p44]]]]]]]]]]]
normalized: ~ [EG [~ [[[[[[[[[[[p44<=0 & 0<=p44] | [p6<=0 & 0<=p6]] & [p18<=0 & 0<=p18]] & [[p3<=0 & 0<=p3] & [p12<=0 & 0<=p12]]] | [p39<=0 & 0<=p39]] | [p4<=0 & 0<=p4]] & ~ [E [E [true U [p13<=1 & 1<=p13]] U EX [[p26<=1 & 1<=p26]]]]] | [p29<=0 & 0<=p29]] | [p1<=0 & 0<=p1]] & EX [[~ [E [true U ~ [[[p39<=0 & 0<=p39] | [p4<=0 & 0<=p4]]]]] & [p16<=1 & 1<=p16]]]]]]]
abstracting: (1<=p16)
states: 3,474 (3)
abstracting: (p16<=1)
states: 6,949 (3)
abstracting: (0<=p4)
states: 6,949 (3)
abstracting: (p4<=0)
states: 4,465 (3)
abstracting: (0<=p39)
states: 6,949 (3)
abstracting: (p39<=0)
states: 6,733 (3)
.abstracting: (0<=p1)
states: 6,949 (3)
abstracting: (p1<=0)
states: 4,417 (3)
abstracting: (0<=p29)
states: 6,949 (3)
abstracting: (p29<=0)
states: 6,733 (3)
abstracting: (1<=p26)
states: 144
abstracting: (p26<=1)
states: 6,949 (3)
.abstracting: (1<=p13)
states: 2,520 (3)
abstracting: (p13<=1)
states: 6,949 (3)
abstracting: (0<=p4)
states: 6,949 (3)
abstracting: (p4<=0)
states: 4,465 (3)
abstracting: (0<=p39)
states: 6,949 (3)
abstracting: (p39<=0)
states: 6,733 (3)
abstracting: (0<=p12)
states: 6,949 (3)
abstracting: (p12<=0)
states: 5,041 (3)
abstracting: (0<=p3)
states: 6,949 (3)
abstracting: (p3<=0)
states: 4,417 (3)
abstracting: (0<=p18)
states: 6,949 (3)
abstracting: (p18<=0)
states: 3,475 (3)
abstracting: (0<=p6)
states: 6,949 (3)
abstracting: (p6<=0)
states: 4,465 (3)
abstracting: (0<=p44)
states: 6,949 (3)
abstracting: (p44<=0)
states: 6,625 (3)
..........
EG iterations: 10
-> the formula is FALSE
FORMULA AutoFlight-PT-02a-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.023sec
checking: EF [[A [[[[[p10<=1 & 1<=p10] & [p49<=1 & 1<=p49]] | [p12<=1 & 1<=p12]] & [[p8<=1 & 1<=p8] & [p30<=1 & 1<=p30]]] U E [~ [[[[p13<=1 & 1<=p13] & [p50<=1 & 1<=p50]] | [[p14<=1 & 1<=p14] & [p22<=1 & 1<=p22]]]] U [[p20<=1 & 1<=p20] & [p55<=1 & 1<=p55]]]] & [AX [~ [E [[p10<=1 & 1<=p10] U [[p19<=1 & 1<=p19] & [p52<=1 & 1<=p52]]]]] | EF [[~ [[p7<=1 & 1<=p7]] | ~ [[p37<=1 & 1<=p37]]]]]]]
normalized: E [true U [[E [true U [~ [[p37<=1 & 1<=p37]] | ~ [[p7<=1 & 1<=p7]]]] | ~ [EX [E [[p10<=1 & 1<=p10] U [[p52<=1 & 1<=p52] & [p19<=1 & 1<=p19]]]]]] & [~ [EG [~ [E [~ [[[[p22<=1 & 1<=p22] & [p14<=1 & 1<=p14]] | [[p50<=1 & 1<=p50] & [p13<=1 & 1<=p13]]]] U [[p55<=1 & 1<=p55] & [p20<=1 & 1<=p20]]]]]] & ~ [E [~ [E [~ [[[[p22<=1 & 1<=p22] & [p14<=1 & 1<=p14]] | [[p50<=1 & 1<=p50] & [p13<=1 & 1<=p13]]]] U [[p55<=1 & 1<=p55] & [p20<=1 & 1<=p20]]]] U [~ [[[[p30<=1 & 1<=p30] & [p8<=1 & 1<=p8]] & [[p12<=1 & 1<=p12] | [[p49<=1 & 1<=p49] & [p10<=1 & 1<=p10]]]]] & ~ [E [~ [[[[p22<=1 & 1<=p22] & [p14<=1 & 1<=p14]] | [[p50<=1 & 1<=p50] & [p13<=1 & 1<=p13]]]] U [[p55<=1 & 1<=p55] & [p20<=1 & 1<=p20]]]]]]]]]]
abstracting: (1<=p20)
states: 144
abstracting: (p20<=1)
states: 6,949 (3)
abstracting: (1<=p55)
states: 6,624 (3)
abstracting: (p55<=1)
states: 6,949 (3)
abstracting: (1<=p13)
states: 2,520 (3)
abstracting: (p13<=1)
states: 6,949 (3)
abstracting: (1<=p50)
states: 324
abstracting: (p50<=1)
states: 6,949 (3)
abstracting: (1<=p14)
states: 6,948 (3)
abstracting: (p14<=1)
states: 6,949 (3)
abstracting: (1<=p22)
states: 144
abstracting: (p22<=1)
states: 6,949 (3)
abstracting: (1<=p10)
states: 2,568 (3)
abstracting: (p10<=1)
states: 6,949 (3)
abstracting: (1<=p49)
states: 324
abstracting: (p49<=1)
states: 6,949 (3)
abstracting: (1<=p12)
states: 1,908 (3)
abstracting: (p12<=1)
states: 6,949 (3)
abstracting: (1<=p8)
states: 2,568 (3)
abstracting: (p8<=1)
states: 6,949 (3)
abstracting: (1<=p30)
states: 324
abstracting: (p30<=1)
states: 6,949 (3)
abstracting: (1<=p20)
states: 144
abstracting: (p20<=1)
states: 6,949 (3)
abstracting: (1<=p55)
states: 6,624 (3)
abstracting: (p55<=1)
states: 6,949 (3)
abstracting: (1<=p13)
states: 2,520 (3)
abstracting: (p13<=1)
states: 6,949 (3)
abstracting: (1<=p50)
states: 324
abstracting: (p50<=1)
states: 6,949 (3)
abstracting: (1<=p14)
states: 6,948 (3)
abstracting: (p14<=1)
states: 6,949 (3)
abstracting: (1<=p22)
states: 144
abstracting: (p22<=1)
states: 6,949 (3)
abstracting: (1<=p20)
states: 144
abstracting: (p20<=1)
states: 6,949 (3)
abstracting: (1<=p55)
states: 6,624 (3)
abstracting: (p55<=1)
states: 6,949 (3)
abstracting: (1<=p13)
states: 2,520 (3)
abstracting: (p13<=1)
states: 6,949 (3)
abstracting: (1<=p50)
states: 324
abstracting: (p50<=1)
states: 6,949 (3)
abstracting: (1<=p14)
states: 6,948 (3)
abstracting: (p14<=1)
states: 6,949 (3)
abstracting: (1<=p22)
states: 144
abstracting: (p22<=1)
states: 6,949 (3)
......................
EG iterations: 22
abstracting: (1<=p19)
states: 6,948 (3)
abstracting: (p19<=1)
states: 6,949 (3)
abstracting: (1<=p52)
states: 324
abstracting: (p52<=1)
states: 6,949 (3)
abstracting: (1<=p10)
states: 2,568 (3)
abstracting: (p10<=1)
states: 6,949 (3)
.abstracting: (1<=p7)
states: 6,948 (3)
abstracting: (p7<=1)
states: 6,949 (3)
abstracting: (1<=p37)
states: 144
abstracting: (p37<=1)
states: 6,949 (3)
-> the formula is TRUE
FORMULA AutoFlight-PT-02a-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.018sec
checking: E [EF [[~ [[~ [A [[p23<=1 & 1<=p23] U [[p47<=1 & 1<=p47] & [p54<=1 & 1<=p54]]]] | [A [[[p14<=1 & 1<=p14] & [p28<=1 & 1<=p28]] U [p12<=1 & 1<=p12]] | [p12<=1 & 1<=p12]]]] & [AX [[p16<=1 & 1<=p16]] | [[p18<=1 & 1<=p18] & EF [[[p17<=1 & 1<=p17] & [p51<=1 & 1<=p51]]]]]]] U A [[AF [EG [[[p7<=1 & 1<=p7] & [p27<=1 & 1<=p27]]]] & A [~ [[p9<=1 & 1<=p9]] U E [[[p42<=1 & 1<=p42] & [p55<=1 & 1<=p55]] U [[p11<=1 & 1<=p11] & [p40<=1 & 1<=p40]]]]] U [p24<=1 & 1<=p24]]]
normalized: E [E [true U [[[E [true U [[p51<=1 & 1<=p51] & [p17<=1 & 1<=p17]]] & [p18<=1 & 1<=p18]] | ~ [EX [~ [[p16<=1 & 1<=p16]]]]] & ~ [[[[p12<=1 & 1<=p12] | [~ [EG [~ [[p12<=1 & 1<=p12]]]] & ~ [E [~ [[p12<=1 & 1<=p12]] U [~ [[[p28<=1 & 1<=p28] & [p14<=1 & 1<=p14]]] & ~ [[p12<=1 & 1<=p12]]]]]]] | ~ [[~ [EG [~ [[[p54<=1 & 1<=p54] & [p47<=1 & 1<=p47]]]]] & ~ [E [~ [[[p54<=1 & 1<=p54] & [p47<=1 & 1<=p47]]] U [~ [[p23<=1 & 1<=p23]] & ~ [[[p54<=1 & 1<=p54] & [p47<=1 & 1<=p47]]]]]]]]]]]] U [~ [EG [~ [[p24<=1 & 1<=p24]]]] & ~ [E [~ [[p24<=1 & 1<=p24]] U [~ [[[~ [EG [~ [E [[[p55<=1 & 1<=p55] & [p42<=1 & 1<=p42]] U [[p40<=1 & 1<=p40] & [p11<=1 & 1<=p11]]]]]] & ~ [E [~ [E [[[p55<=1 & 1<=p55] & [p42<=1 & 1<=p42]] U [[p40<=1 & 1<=p40] & [p11<=1 & 1<=p11]]]] U [[p9<=1 & 1<=p9] & ~ [E [[[p55<=1 & 1<=p55] & [p42<=1 & 1<=p42]] U [[p40<=1 & 1<=p40] & [p11<=1 & 1<=p11]]]]]]]] & ~ [EG [~ [EG [[[p27<=1 & 1<=p27] & [p7<=1 & 1<=p7]]]]]]]] & ~ [[p24<=1 & 1<=p24]]]]]]]
abstracting: (1<=p24)
states: 144
abstracting: (p24<=1)
states: 6,949 (3)
abstracting: (1<=p7)
states: 6,948 (3)
abstracting: (p7<=1)
states: 6,949 (3)
abstracting: (1<=p27)
states: 144
abstracting: (p27<=1)
states: 6,949 (3)
..........
EG iterations: 10
EG iterations: 0
abstracting: (1<=p11)
states: 2,520 (3)
abstracting: (p11<=1)
states: 6,949 (3)
abstracting: (1<=p40)
states: 324
abstracting: (p40<=1)
states: 6,949 (3)
abstracting: (1<=p42)
states: 324
abstracting: (p42<=1)
states: 6,949 (3)
abstracting: (1<=p55)
states: 6,624 (3)
abstracting: (p55<=1)
states: 6,949 (3)
abstracting: (1<=p9)
states: 1,812 (3)
abstracting: (p9<=1)
states: 6,949 (3)
abstracting: (1<=p11)
states: 2,520 (3)
abstracting: (p11<=1)
states: 6,949 (3)
abstracting: (1<=p40)
states: 324
abstracting: (p40<=1)
states: 6,949 (3)
abstracting: (1<=p42)
states: 324
abstracting: (p42<=1)
states: 6,949 (3)
abstracting: (1<=p55)
states: 6,624 (3)
abstracting: (p55<=1)
states: 6,949 (3)
abstracting: (1<=p11)
states: 2,520 (3)
abstracting: (p11<=1)
states: 6,949 (3)
abstracting: (1<=p40)
states: 324
abstracting: (p40<=1)
states: 6,949 (3)
abstracting: (1<=p42)
states: 324
abstracting: (p42<=1)
states: 6,949 (3)
abstracting: (1<=p55)
states: 6,624 (3)
abstracting: (p55<=1)
states: 6,949 (3)
...........
EG iterations: 11
abstracting: (1<=p24)
states: 144
abstracting: (p24<=1)
states: 6,949 (3)
abstracting: (1<=p24)
states: 144
abstracting: (p24<=1)
states: 6,949 (3)
...................
EG iterations: 19
abstracting: (1<=p47)
states: 5,328 (3)
abstracting: (p47<=1)
states: 6,949 (3)
abstracting: (1<=p54)
states: 324
abstracting: (p54<=1)
states: 6,949 (3)
abstracting: (1<=p23)
states: 144
abstracting: (p23<=1)
states: 6,949 (3)
abstracting: (1<=p47)
states: 5,328 (3)
abstracting: (p47<=1)
states: 6,949 (3)
abstracting: (1<=p54)
states: 324
abstracting: (p54<=1)
states: 6,949 (3)
abstracting: (1<=p47)
states: 5,328 (3)
abstracting: (p47<=1)
states: 6,949 (3)
abstracting: (1<=p54)
states: 324
abstracting: (p54<=1)
states: 6,949 (3)
........................
EG iterations: 24
abstracting: (1<=p12)
states: 1,908 (3)
abstracting: (p12<=1)
states: 6,949 (3)
abstracting: (1<=p14)
states: 6,948 (3)
abstracting: (p14<=1)
states: 6,949 (3)
abstracting: (1<=p28)
states: 144
abstracting: (p28<=1)
states: 6,949 (3)
abstracting: (1<=p12)
states: 1,908 (3)
abstracting: (p12<=1)
states: 6,949 (3)
abstracting: (1<=p12)
states: 1,908 (3)
abstracting: (p12<=1)
states: 6,949 (3)
.
EG iterations: 1
abstracting: (1<=p12)
states: 1,908 (3)
abstracting: (p12<=1)
states: 6,949 (3)
abstracting: (1<=p16)
states: 3,474 (3)
abstracting: (p16<=1)
states: 6,949 (3)
.abstracting: (1<=p18)
states: 3,474 (3)
abstracting: (p18<=1)
states: 6,949 (3)
abstracting: (1<=p17)
states: 3,474 (3)
abstracting: (p17<=1)
states: 6,949 (3)
abstracting: (1<=p51)
states: 324
abstracting: (p51<=1)
states: 6,949 (3)
-> the formula is TRUE
FORMULA AutoFlight-PT-02a-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.049sec
checking: [E [[EX [[[~ [[p10<=1 & 1<=p10]] | [[p36<=1 & 1<=p36] | [p16<=1 & 1<=p16]]] & ~ [EX [[p9<=1 & 1<=p9]]]]] | [[p14<=1 & 1<=p14] & [p34<=1 & 1<=p34]]] U [[AX [~ [AF [[[p10<=1 & 1<=p10] & [p49<=1 & 1<=p49]]]]] & [E [[p35<=1 & 1<=p35] U [[[p10<=1 & 1<=p10] & [p49<=1 & 1<=p49]] | [p35<=1 & 1<=p35]]] | [[p3<=1 & 1<=p3] & EG [[[p7<=1 & 1<=p7] & [p27<=1 & 1<=p27]]]]]] & [[p48<=1 & 1<=p48] & [p55<=1 & 1<=p55]]]] & ~ [A [EG [[EF [[[p14<=1 & 1<=p14] & [p28<=1 & 1<=p28]]] | [[p13<=1 & 1<=p13] & [[p3<=1 & 1<=p3] & [p10<=1 & 1<=p10]]]]] U [p2<=1 & 1<=p2]]]]
normalized: [~ [[~ [EG [~ [[p2<=1 & 1<=p2]]]] & ~ [E [~ [[p2<=1 & 1<=p2]] U [~ [EG [[[[[p3<=1 & 1<=p3] & [p10<=1 & 1<=p10]] & [p13<=1 & 1<=p13]] | E [true U [[p28<=1 & 1<=p28] & [p14<=1 & 1<=p14]]]]]] & ~ [[p2<=1 & 1<=p2]]]]]]] & E [[[[p34<=1 & 1<=p34] & [p14<=1 & 1<=p14]] | EX [[~ [EX [[p9<=1 & 1<=p9]]] & [[[p16<=1 & 1<=p16] | [p36<=1 & 1<=p36]] | ~ [[p10<=1 & 1<=p10]]]]]] U [[[p55<=1 & 1<=p55] & [p48<=1 & 1<=p48]] & [[[EG [[[p27<=1 & 1<=p27] & [p7<=1 & 1<=p7]]] & [p3<=1 & 1<=p3]] | E [[p35<=1 & 1<=p35] U [[p35<=1 & 1<=p35] | [[p49<=1 & 1<=p49] & [p10<=1 & 1<=p10]]]]] & ~ [EX [~ [EG [~ [[[p49<=1 & 1<=p49] & [p10<=1 & 1<=p10]]]]]]]]]]]
abstracting: (1<=p10)
states: 2,568 (3)
abstracting: (p10<=1)
states: 6,949 (3)
abstracting: (1<=p49)
states: 324
abstracting: (p49<=1)
states: 6,949 (3)
..........
EG iterations: 10
.abstracting: (1<=p10)
states: 2,568 (3)
abstracting: (p10<=1)
states: 6,949 (3)
abstracting: (1<=p49)
states: 324
abstracting: (p49<=1)
states: 6,949 (3)
abstracting: (1<=p35)
states: 144
abstracting: (p35<=1)
states: 6,949 (3)
abstracting: (1<=p35)
states: 144
abstracting: (p35<=1)
states: 6,949 (3)
abstracting: (1<=p3)
states: 2,532 (3)
abstracting: (p3<=1)
states: 6,949 (3)
abstracting: (1<=p7)
states: 6,948 (3)
abstracting: (p7<=1)
states: 6,949 (3)
abstracting: (1<=p27)
states: 144
abstracting: (p27<=1)
states: 6,949 (3)
..........
EG iterations: 10
abstracting: (1<=p48)
states: 324
abstracting: (p48<=1)
states: 6,949 (3)
abstracting: (1<=p55)
states: 6,624 (3)
abstracting: (p55<=1)
states: 6,949 (3)
abstracting: (1<=p10)
states: 2,568 (3)
abstracting: (p10<=1)
states: 6,949 (3)
abstracting: (1<=p36)
states: 144
abstracting: (p36<=1)
states: 6,949 (3)
abstracting: (1<=p16)
states: 3,474 (3)
abstracting: (p16<=1)
states: 6,949 (3)
abstracting: (1<=p9)
states: 1,812 (3)
abstracting: (p9<=1)
states: 6,949 (3)
..abstracting: (1<=p14)
states: 6,948 (3)
abstracting: (p14<=1)
states: 6,949 (3)
abstracting: (1<=p34)
states: 144
abstracting: (p34<=1)
states: 6,949 (3)
abstracting: (1<=p2)
states: 1,884 (3)
abstracting: (p2<=1)
states: 6,949 (3)
abstracting: (1<=p14)
states: 6,948 (3)
abstracting: (p14<=1)
states: 6,949 (3)
abstracting: (1<=p28)
states: 144
abstracting: (p28<=1)
states: 6,949 (3)
abstracting: (1<=p13)
states: 2,520 (3)
abstracting: (p13<=1)
states: 6,949 (3)
abstracting: (1<=p10)
states: 2,568 (3)
abstracting: (p10<=1)
states: 6,949 (3)
abstracting: (1<=p3)
states: 2,532 (3)
abstracting: (p3<=1)
states: 6,949 (3)
.......
EG iterations: 7
abstracting: (1<=p2)
states: 1,884 (3)
abstracting: (p2<=1)
states: 6,949 (3)
abstracting: (1<=p2)
states: 1,884 (3)
abstracting: (p2<=1)
states: 6,949 (3)
.
EG iterations: 1
-> the formula is FALSE
FORMULA AutoFlight-PT-02a-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.019sec
checking: AX [[EF [EG [[[p53<=0 & 0<=p53] | [p54<=0 & 0<=p54]]]] | [A [[EF [[[[p6<=1 & 1<=p6] & [p44<=1 & 1<=p44]] | [[p14<=1 & 1<=p14] & [p38<=1 & 1<=p38]]]] | [EX [[[p14<=1 & 1<=p14] & [p34<=1 & 1<=p34]]] | ~ [[p3<=1 & 1<=p3]]]] U E [EF [[[p47<=1 & 1<=p47] & [p54<=1 & 1<=p54]]] U AX [[[p6<=1 & 1<=p6] & [p44<=1 & 1<=p44]]]]] | [[[p7<=0 & 0<=p7] | [[p27<=0 & 0<=p27] | [p12<=0 & 0<=p12]]] & [[AX [[p10<=1 & 1<=p10]] & [[p7<=1 & 1<=p7] & [p33<=1 & 1<=p33]]] | [E [[[p10<=1 & 1<=p10] & [p49<=1 & 1<=p49]] U [[p14<=1 & 1<=p14] & [p22<=1 & 1<=p22]]] & [[[p10<=0 & 0<=p10] | [p49<=0 & 0<=p49]] & [[p8<=0 & 0<=p8] | [p30<=0 & 0<=p30]]]]]]]]]
normalized: ~ [EX [~ [[[[[[[[[p30<=0 & 0<=p30] | [p8<=0 & 0<=p8]] & [[p49<=0 & 0<=p49] | [p10<=0 & 0<=p10]]] & E [[[p49<=1 & 1<=p49] & [p10<=1 & 1<=p10]] U [[p22<=1 & 1<=p22] & [p14<=1 & 1<=p14]]]] | [[[p33<=1 & 1<=p33] & [p7<=1 & 1<=p7]] & ~ [EX [~ [[p10<=1 & 1<=p10]]]]]] & [[[p12<=0 & 0<=p12] | [p27<=0 & 0<=p27]] | [p7<=0 & 0<=p7]]] | [~ [EG [~ [E [E [true U [[p54<=1 & 1<=p54] & [p47<=1 & 1<=p47]]] U ~ [EX [~ [[[p44<=1 & 1<=p44] & [p6<=1 & 1<=p6]]]]]]]]] & ~ [E [~ [E [E [true U [[p54<=1 & 1<=p54] & [p47<=1 & 1<=p47]]] U ~ [EX [~ [[[p44<=1 & 1<=p44] & [p6<=1 & 1<=p6]]]]]]] U [~ [[[~ [[p3<=1 & 1<=p3]] | EX [[[p34<=1 & 1<=p34] & [p14<=1 & 1<=p14]]]] | E [true U [[[p38<=1 & 1<=p38] & [p14<=1 & 1<=p14]] | [[p44<=1 & 1<=p44] & [p6<=1 & 1<=p6]]]]]] & ~ [E [E [true U [[p54<=1 & 1<=p54] & [p47<=1 & 1<=p47]]] U ~ [EX [~ [[[p44<=1 & 1<=p44] & [p6<=1 & 1<=p6]]]]]]]]]]]] | E [true U EG [[[p54<=0 & 0<=p54] | [p53<=0 & 0<=p53]]]]]]]]
abstracting: (0<=p53)
states: 6,949 (3)
abstracting: (p53<=0)
states: 1,621 (3)
abstracting: (0<=p54)
states: 6,949 (3)
abstracting: (p54<=0)
states: 6,625 (3)
........................
EG iterations: 24
abstracting: (1<=p6)
states: 2,484 (3)
abstracting: (p6<=1)
states: 6,949 (3)
abstracting: (1<=p44)
states: 324
abstracting: (p44<=1)
states: 6,949 (3)
.abstracting: (1<=p47)
states: 5,328 (3)
abstracting: (p47<=1)
states: 6,949 (3)
abstracting: (1<=p54)
states: 324
abstracting: (p54<=1)
states: 6,949 (3)
abstracting: (1<=p6)
states: 2,484 (3)
abstracting: (p6<=1)
states: 6,949 (3)
abstracting: (1<=p44)
states: 324
abstracting: (p44<=1)
states: 6,949 (3)
abstracting: (1<=p14)
states: 6,948 (3)
abstracting: (p14<=1)
states: 6,949 (3)
abstracting: (1<=p38)
states: 144
abstracting: (p38<=1)
states: 6,949 (3)
abstracting: (1<=p14)
states: 6,948 (3)
abstracting: (p14<=1)
states: 6,949 (3)
abstracting: (1<=p34)
states: 144
abstracting: (p34<=1)
states: 6,949 (3)
.abstracting: (1<=p3)
states: 2,532 (3)
abstracting: (p3<=1)
states: 6,949 (3)
abstracting: (1<=p6)
states: 2,484 (3)
abstracting: (p6<=1)
states: 6,949 (3)
abstracting: (1<=p44)
states: 324
abstracting: (p44<=1)
states: 6,949 (3)
.abstracting: (1<=p47)
states: 5,328 (3)
abstracting: (p47<=1)
states: 6,949 (3)
abstracting: (1<=p54)
states: 324
abstracting: (p54<=1)
states: 6,949 (3)
abstracting: (1<=p6)
states: 2,484 (3)
abstracting: (p6<=1)
states: 6,949 (3)
abstracting: (1<=p44)
states: 324
abstracting: (p44<=1)
states: 6,949 (3)
.abstracting: (1<=p47)
states: 5,328 (3)
abstracting: (p47<=1)
states: 6,949 (3)
abstracting: (1<=p54)
states: 324
abstracting: (p54<=1)
states: 6,949 (3)
..............
EG iterations: 14
abstracting: (0<=p7)
states: 6,949 (3)
abstracting: (p7<=0)
states: 1
abstracting: (0<=p27)
states: 6,949 (3)
abstracting: (p27<=0)
states: 6,805 (3)
abstracting: (0<=p12)
states: 6,949 (3)
abstracting: (p12<=0)
states: 5,041 (3)
abstracting: (1<=p10)
states: 2,568 (3)
abstracting: (p10<=1)
states: 6,949 (3)
.abstracting: (1<=p7)
states: 6,948 (3)
abstracting: (p7<=1)
states: 6,949 (3)
abstracting: (1<=p33)
states: 144
abstracting: (p33<=1)
states: 6,949 (3)
abstracting: (1<=p14)
states: 6,948 (3)
abstracting: (p14<=1)
states: 6,949 (3)
abstracting: (1<=p22)
states: 144
abstracting: (p22<=1)
states: 6,949 (3)
abstracting: (1<=p10)
states: 2,568 (3)
abstracting: (p10<=1)
states: 6,949 (3)
abstracting: (1<=p49)
states: 324
abstracting: (p49<=1)
states: 6,949 (3)
abstracting: (0<=p10)
states: 6,949 (3)
abstracting: (p10<=0)
states: 4,381 (3)
abstracting: (0<=p49)
states: 6,949 (3)
abstracting: (p49<=0)
states: 6,625 (3)
abstracting: (0<=p8)
states: 6,949 (3)
abstracting: (p8<=0)
states: 4,381 (3)
abstracting: (0<=p30)
states: 6,949 (3)
abstracting: (p30<=0)
states: 6,625 (3)
.-> the formula is TRUE
FORMULA AutoFlight-PT-02a-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.035sec
totally nodes used: 368220 (3.7e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 347067 804314 1151381
used/not used/entry size/cache size: 1132273 65976591 16 1024MB
basic ops cache: hits/miss/sum: 59804 166624 226428
used/not used/entry size/cache size: 329731 16447485 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: 1797 4664 6461
used/not used/entry size/cache size: 4664 8383944 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 66750522
1 349057
2 8722
3 533
4 30
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 5.132sec
BK_STOP 1678687457128
--------------------
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:508 (11), effective:81 (1)
initing FirstDep: 0m 0.000sec
iterations count:48 (1), effective:1 (0)
iterations count:742 (16), effective:103 (2)
iterations count:117 (2), effective:17 (0)
iterations count:352 (7), effective:46 (1)
iterations count:329 (7), effective:36 (0)
iterations count:49 (1), effective:2 (0)
iterations count:58 (1), effective:1 (0)
iterations count:45 (1), effective:0 (0)
iterations count:49 (1), effective:2 (0)
iterations count:257 (5), effective:27 (0)
iterations count:349 (7), effective:45 (1)
iterations count:47 (1), effective:1 (0)
iterations count:45 (1), effective:0 (0)
iterations count:59 (1), effective:5 (0)
iterations count:47 (1), effective:1 (0)
iterations count:45 (1), effective:0 (0)
iterations count:47 (1), effective:1 (0)
iterations count:78 (1), effective:1 (0)
iterations count:58 (1), effective:1 (0)
iterations count:60 (1), effective:1 (0)
iterations count:351 (7), effective:45 (1)
iterations count:330 (7), effective:40 (0)
iterations count:345 (7), effective:45 (1)
iterations count:57 (1), effective:1 (0)
iterations count:57 (1), effective:1 (0)
iterations count:60 (1), effective:1 (0)
iterations count:57 (1), effective:1 (0)
iterations count:275 (6), effective:35 (0)
iterations count:59 (1), effective:1 (0)
iterations count:337 (7), effective:44 (0)
iterations count:45 (1), effective:0 (0)
iterations count:45 (1), effective:0 (0)
iterations count:468 (10), effective:65 (1)
iterations count:45 (1), effective:0 (0)
iterations count:45 (1), effective:0 (0)
iterations count:47 (1), effective:1 (0)
iterations count:70 (1), effective:1 (0)
iterations count:353 (7), effective:45 (1)
iterations count:801 (17), effective:123 (2)
iterations count:353 (7), effective:45 (1)
iterations count:45 (1), effective:0 (0)
iterations count:330 (7), effective:45 (1)
iterations count:325 (7), effective:34 (0)
iterations count:320 (7), effective:32 (0)
iterations count:351 (7), effective:45 (1)
iterations count:89 (1), effective:12 (0)
iterations count:403 (8), effective:58 (1)
iterations count:351 (7), effective:45 (1)
iterations count:89 (1), effective:12 (0)
iterations count:474 (10), effective:60 (1)
iterations count:351 (7), effective:45 (1)
iterations count:89 (1), effective:12 (0)
iterations count:45 (1), effective:0 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-02a"
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 AutoFlight-PT-02a, 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 r010-oct2-167813599000386"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-02a.tgz
mv AutoFlight-PT-02a 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 ;