About the Execution of Marcie+red for AutoFlight-PT-06a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
6634.455 | 28282.00 | 38468.00 | 35.80 | TTTTFTTFFFFTTTFT | 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-167813599100450.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-06a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599100450
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 8.2K Feb 25 18:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 18:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 17:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 17:59 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.2K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 25 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:32 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 43K 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-06a-CTLFireability-00
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-01
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-02
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-03
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-04
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-05
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-06
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-07
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-08
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-09
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-10
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-11
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-12
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-13
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-14
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678689600459
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-06a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 06:40:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 06:40:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 06:40:03] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2023-03-13 06:40:03] [INFO ] Transformed 157 places.
[2023-03-13 06:40:03] [INFO ] Transformed 155 transitions.
[2023-03-13 06:40:03] [INFO ] Found NUPN structural information;
[2023-03-13 06:40:03] [INFO ] Parsed PT model containing 157 places and 155 transitions and 500 arcs in 243 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Ensure Unique test removed 30 transitions
Reduce redundant transitions removed 30 transitions.
Support contains 77 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 125/125 transitions.
Applied a total of 0 rules in 19 ms. Remains 157 /157 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 157 cols
[2023-03-13 06:40:03] [INFO ] Computed 40 place invariants in 7 ms
[2023-03-13 06:40:04] [INFO ] Implicit Places using invariants in 575 ms returned [35, 42, 45, 60, 118, 124, 142, 148, 154]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 615 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 148/157 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 148 /148 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 637 ms. Remains : 148/157 places, 125/125 transitions.
Support contains 77 out of 148 places after structural reductions.
[2023-03-13 06:40:04] [INFO ] Flatten gal took : 36 ms
[2023-03-13 06:40:04] [INFO ] Flatten gal took : 13 ms
[2023-03-13 06:40:04] [INFO ] Input system was already deterministic with 125 transitions.
Incomplete random walk after 10000 steps, including 285 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 60) seen :49
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 125 rows 148 cols
[2023-03-13 06:40:05] [INFO ] Computed 31 place invariants in 2 ms
[2023-03-13 06:40:05] [INFO ] [Real]Absence check using 31 positive place invariants in 6 ms returned sat
[2023-03-13 06:40:05] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 06:40:05] [INFO ] [Nat]Absence check using 31 positive place invariants in 5 ms returned sat
[2023-03-13 06:40:05] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2023-03-13 06:40:05] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-13 06:40:05] [INFO ] After 43ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :2 sat :7
[2023-03-13 06:40:06] [INFO ] After 208ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 133 ms.
[2023-03-13 06:40:06] [INFO ] After 528ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 5 properties in 14 ms.
Support contains 2 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 125/125 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 148 transition count 103
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 126 transition count 103
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 44 place count 126 transition count 91
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 68 place count 114 transition count 91
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 110 transition count 87
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 110 transition count 87
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 96 place count 100 transition count 77
Free-agglomeration rule applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 108 place count 100 transition count 65
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 120 place count 88 transition count 65
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 87 transition count 64
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 3 with 59 rules applied. Total rules applied 180 place count 63 transition count 29
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 4 with 35 rules applied. Total rules applied 215 place count 28 transition count 29
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 215 place count 28 transition count 22
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 229 place count 21 transition count 22
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 233 place count 17 transition count 18
Iterating global reduction 5 with 4 rules applied. Total rules applied 237 place count 17 transition count 18
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 239 place count 17 transition count 16
Applied a total of 239 rules in 42 ms. Remains 17 /148 variables (removed 131) and now considering 16/125 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 17/148 places, 16/125 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 8 ms
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 8 ms
[2023-03-13 06:40:06] [INFO ] Input system was already deterministic with 125 transitions.
Computed a total of 9 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 144 transition count 121
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 144 transition count 121
Applied a total of 8 rules in 8 ms. Remains 144 /148 variables (removed 4) and now considering 121/125 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 144/148 places, 121/125 transitions.
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 6 ms
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 6 ms
[2023-03-13 06:40:06] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 144 transition count 121
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 144 transition count 121
Applied a total of 8 rules in 4 ms. Remains 144 /148 variables (removed 4) and now considering 121/125 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 144/148 places, 121/125 transitions.
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:40:06] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 148 transition count 103
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 126 transition count 103
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 44 place count 126 transition count 91
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 68 place count 114 transition count 91
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 110 transition count 87
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 110 transition count 87
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 90 place count 103 transition count 80
Applied a total of 90 rules in 12 ms. Remains 103 /148 variables (removed 45) and now considering 80/125 (removed 45) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 103/148 places, 80/125 transitions.
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:40:06] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 148 transition count 103
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 126 transition count 103
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 44 place count 126 transition count 91
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 68 place count 114 transition count 91
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 110 transition count 87
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 110 transition count 87
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 96 place count 100 transition count 77
Applied a total of 96 rules in 11 ms. Remains 100 /148 variables (removed 48) and now considering 77/125 (removed 48) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 100/148 places, 77/125 transitions.
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:40:06] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 145 transition count 122
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 145 transition count 122
Applied a total of 6 rules in 4 ms. Remains 145 /148 variables (removed 3) and now considering 122/125 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 145/148 places, 122/125 transitions.
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 6 ms
[2023-03-13 06:40:06] [INFO ] Input system was already deterministic with 122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 144 transition count 121
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 144 transition count 121
Applied a total of 8 rules in 3 ms. Remains 144 /148 variables (removed 4) and now considering 121/125 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 144/148 places, 121/125 transitions.
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:40:06] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 144 transition count 121
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 144 transition count 121
Applied a total of 8 rules in 4 ms. Remains 144 /148 variables (removed 4) and now considering 121/125 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 144/148 places, 121/125 transitions.
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:40:06] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 148 transition count 103
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 126 transition count 103
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 44 place count 126 transition count 91
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 68 place count 114 transition count 91
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 110 transition count 87
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 110 transition count 87
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 96 place count 100 transition count 77
Applied a total of 96 rules in 10 ms. Remains 100 /148 variables (removed 48) and now considering 77/125 (removed 48) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 100/148 places, 77/125 transitions.
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:40:06] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 144 transition count 121
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 144 transition count 121
Applied a total of 8 rules in 4 ms. Remains 144 /148 variables (removed 4) and now considering 121/125 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 144/148 places, 121/125 transitions.
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:40:06] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 144 transition count 121
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 144 transition count 121
Applied a total of 8 rules in 4 ms. Remains 144 /148 variables (removed 4) and now considering 121/125 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 144/148 places, 121/125 transitions.
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:40:06] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 145 transition count 122
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 145 transition count 122
Applied a total of 6 rules in 7 ms. Remains 145 /148 variables (removed 3) and now considering 122/125 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 145/148 places, 122/125 transitions.
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 9 ms
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 8 ms
[2023-03-13 06:40:06] [INFO ] Input system was already deterministic with 122 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 148 transition count 103
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 126 transition count 103
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 44 place count 126 transition count 91
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 68 place count 114 transition count 91
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 110 transition count 87
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 110 transition count 87
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 98 place count 99 transition count 76
Applied a total of 98 rules in 13 ms. Remains 99 /148 variables (removed 49) and now considering 76/125 (removed 49) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 99/148 places, 76/125 transitions.
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:40:06] [INFO ] Input system was already deterministic with 76 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 148 transition count 104
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 127 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 126 transition count 103
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 44 place count 126 transition count 93
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 64 place count 116 transition count 93
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 68 place count 112 transition count 89
Iterating global reduction 3 with 4 rules applied. Total rules applied 72 place count 112 transition count 89
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 96 place count 100 transition count 77
Applied a total of 96 rules in 9 ms. Remains 100 /148 variables (removed 48) and now considering 77/125 (removed 48) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 100/148 places, 77/125 transitions.
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:40:06] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 145 transition count 122
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 145 transition count 122
Applied a total of 6 rules in 5 ms. Remains 145 /148 variables (removed 3) and now considering 122/125 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 145/148 places, 122/125 transitions.
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:40:06] [INFO ] Input system was already deterministic with 122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 144 transition count 121
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 144 transition count 121
Applied a total of 8 rules in 3 ms. Remains 144 /148 variables (removed 4) and now considering 121/125 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 144/148 places, 121/125 transitions.
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:40:06] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 148 transition count 103
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 126 transition count 103
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 44 place count 126 transition count 92
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 66 place count 115 transition count 92
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 70 place count 111 transition count 88
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 111 transition count 88
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 94 place count 101 transition count 78
Applied a total of 94 rules in 10 ms. Remains 101 /148 variables (removed 47) and now considering 78/125 (removed 47) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 101/148 places, 78/125 transitions.
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:40:06] [INFO ] Input system was already deterministic with 78 transitions.
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:40:06] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:40:06] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-13 06:40:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 148 places, 125 transitions and 401 arcs took 1 ms.
Total runtime 3589 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: 148 NrTr: 125 NrArc: 401)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.003sec
net check time: 0m 0.000sec
init dd package: 0m 3.584sec
RS generation: 0m 0.094sec
-> reachability set: #nodes 1178 (1.2e+03) #states 1,371,919,681 (9)
starting MCC model checker
--------------------------
checking: EG [EF [AX [AX [[p36<=0 & 0<=p36]]]]]
normalized: EG [E [true U ~ [EX [EX [~ [[p36<=0 & 0<=p36]]]]]]]
abstracting: (0<=p36)
states: 1,371,919,681 (9)
abstracting: (p36<=0)
states: 959,185,153 (8)
..
EG iterations: 0
-> the formula is TRUE
FORMULA AutoFlight-PT-06a-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.236sec
checking: AG [EF [[p37<=0 & 0<=p37]]]
normalized: ~ [E [true U ~ [E [true U [p37<=0 & 0<=p37]]]]]
abstracting: (0<=p37)
states: 1,371,919,681 (9)
abstracting: (p37<=0)
states: 892,327,105 (8)
-> the formula is TRUE
FORMULA AutoFlight-PT-06a-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.069sec
checking: AF [EG [[[p42<=0 & 0<=p42] | EX [[p42<=0 & 0<=p42]]]]]
normalized: ~ [EG [~ [EG [[EX [[p42<=0 & 0<=p42]] | [p42<=0 & 0<=p42]]]]]]
abstracting: (0<=p42)
states: 1,371,919,681 (9)
abstracting: (p42<=0)
states: 685,959,841 (8)
abstracting: (0<=p42)
states: 1,371,919,681 (9)
abstracting: (p42<=0)
states: 685,959,841 (8)
.
EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE
FORMULA AutoFlight-PT-06a-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.103sec
checking: AF [EG [[[p10<=0 & 0<=p10] | [[p120<=0 & 0<=p120] | [p36<=1 & 1<=p36]]]]]
normalized: ~ [EG [~ [EG [[[[p36<=1 & 1<=p36] | [p120<=0 & 0<=p120]] | [p10<=0 & 0<=p10]]]]]]
abstracting: (0<=p10)
states: 1,371,919,681 (9)
abstracting: (p10<=0)
states: 901,425,025 (8)
abstracting: (0<=p120)
states: 1,371,919,681 (9)
abstracting: (p120<=0)
states: 1,337,907,457 (9)
abstracting: (1<=p36)
states: 412,734,528 (8)
abstracting: (p36<=1)
states: 1,371,919,681 (9)
.............................
EG iterations: 29
..............................
EG iterations: 30
-> the formula is TRUE
FORMULA AutoFlight-PT-06a-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.536sec
checking: EF [[EF [[[p3<=1 & 1<=p3] & [p115<=1 & 1<=p115]]] & AF [AG [[p9<=1 & 1<=p9]]]]]
normalized: E [true U [~ [EG [E [true U ~ [[p9<=1 & 1<=p9]]]]] & E [true U [[p115<=1 & 1<=p115] & [p3<=1 & 1<=p3]]]]]
abstracting: (1<=p3)
states: 469,748,160 (8)
abstracting: (p3<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p115)
states: 34,012,224 (7)
abstracting: (p115<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p9)
states: 430,930,368 (8)
abstracting: (p9<=1)
states: 1,371,919,681 (9)
EG iterations: 0
-> the formula is FALSE
FORMULA AutoFlight-PT-06a-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.259sec
checking: AX [AX [EX [[EF [[p67<=1 & 1<=p67]] | [[p74<=0 & 0<=p74] & [[p67<=1 & 1<=p67] | [[p17<=1 & 1<=p17] & [p126<=1 & 1<=p126]]]]]]]]
normalized: ~ [EX [EX [~ [EX [[[[[[p126<=1 & 1<=p126] & [p17<=1 & 1<=p17]] | [p67<=1 & 1<=p67]] & [p74<=0 & 0<=p74]] | E [true U [p67<=1 & 1<=p67]]]]]]]]
abstracting: (1<=p67)
states: 2,985,984 (6)
abstracting: (p67<=1)
states: 1,371,919,681 (9)
abstracting: (0<=p74)
states: 1,371,919,681 (9)
abstracting: (p74<=0)
states: 1,368,933,697 (9)
abstracting: (1<=p67)
states: 2,985,984 (6)
abstracting: (p67<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p17)
states: 471,614,400 (8)
abstracting: (p17<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p126)
states: 34,012,224 (7)
abstracting: (p126<=1)
states: 1,371,919,681 (9)
...-> the formula is TRUE
FORMULA AutoFlight-PT-06a-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.224sec
checking: AX [EX [AG [[~ [A [[p47<=1 & 1<=p47] U [[p131<=1 & 1<=p131] & [p147<=1 & 1<=p147]]]] & [[p130<=0 & 0<=p130] | [p146<=0 & 0<=p146]]]]]]
normalized: ~ [EX [~ [EX [~ [E [true U ~ [[[[p146<=0 & 0<=p146] | [p130<=0 & 0<=p130]] & ~ [[~ [EG [~ [[[p147<=1 & 1<=p147] & [p131<=1 & 1<=p131]]]]] & ~ [E [~ [[[p147<=1 & 1<=p147] & [p131<=1 & 1<=p131]]] U [~ [[p47<=1 & 1<=p47]] & ~ [[[p147<=1 & 1<=p147] & [p131<=1 & 1<=p131]]]]]]]]]]]]]]]]
abstracting: (1<=p131)
states: 34,012,224 (7)
abstracting: (p131<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p147)
states: 1,337,907,456 (9)
abstracting: (p147<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p47)
states: 685,959,840 (8)
abstracting: (p47<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p131)
states: 34,012,224 (7)
abstracting: (p131<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p147)
states: 1,337,907,456 (9)
abstracting: (p147<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p131)
states: 34,012,224 (7)
abstracting: (p131<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p147)
states: 1,337,907,456 (9)
abstracting: (p147<=1)
states: 1,371,919,681 (9)
.
EG iterations: 1
abstracting: (0<=p130)
states: 1,371,919,681 (9)
abstracting: (p130<=0)
states: 170,061,121 (8)
abstracting: (0<=p146)
states: 1,371,919,681 (9)
abstracting: (p146<=0)
states: 1,337,907,457 (9)
..-> the formula is FALSE
FORMULA AutoFlight-PT-06a-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.164sec
checking: AG [AX [[EG [[[p141<=0 & 0<=p141] | [p147<=0 & 0<=p147]]] | [[p70<=1 & 1<=p70] | [[p88<=1 & 1<=p88] & [p146<=1 & 1<=p146]]]]]]
normalized: ~ [E [true U EX [~ [[[[[p146<=1 & 1<=p146] & [p88<=1 & 1<=p88]] | [p70<=1 & 1<=p70]] | EG [[[p147<=0 & 0<=p147] | [p141<=0 & 0<=p141]]]]]]]]
abstracting: (0<=p141)
states: 1,371,919,681 (9)
abstracting: (p141<=0)
states: 1,337,907,457 (9)
abstracting: (0<=p147)
states: 1,371,919,681 (9)
abstracting: (p147<=0)
states: 34,012,225 (7)
.
EG iterations: 1
abstracting: (1<=p70)
states: 2,985,984 (6)
abstracting: (p70<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p88)
states: 1,204,191,360 (9)
abstracting: (p88<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p146)
states: 34,012,224 (7)
abstracting: (p146<=1)
states: 1,371,919,681 (9)
.-> the formula is FALSE
FORMULA AutoFlight-PT-06a-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.172sec
checking: EG [AF [[[[p42<=0 & 0<=p42] & [[p1<=0 & 0<=p1] | [p82<=0 & 0<=p82]]] | [[p75<=0 & 0<=p75] & [[p21<=0 & 0<=p21] | [p92<=0 & 0<=p92]]]]]]
normalized: EG [~ [EG [~ [[[[[p92<=0 & 0<=p92] | [p21<=0 & 0<=p21]] & [p75<=0 & 0<=p75]] | [[[p82<=0 & 0<=p82] | [p1<=0 & 0<=p1]] & [p42<=0 & 0<=p42]]]]]]]
abstracting: (0<=p42)
states: 1,371,919,681 (9)
abstracting: (p42<=0)
states: 685,959,841 (8)
abstracting: (0<=p1)
states: 1,371,919,681 (9)
abstracting: (p1<=0)
states: 902,171,521 (8)
abstracting: (0<=p82)
states: 1,371,919,681 (9)
abstracting: (p82<=0)
states: 1,367,440,705 (9)
abstracting: (0<=p75)
states: 1,371,919,681 (9)
abstracting: (p75<=0)
states: 1,368,933,697 (9)
abstracting: (0<=p21)
states: 1,371,919,681 (9)
abstracting: (p21<=0)
states: 1
abstracting: (0<=p92)
states: 1,371,919,681 (9)
abstracting: (p92<=0)
states: 1,368,933,697 (9)
.........................
EG iterations: 25
EG iterations: 0
-> the formula is TRUE
FORMULA AutoFlight-PT-06a-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.085sec
checking: EF [EG [[[[p21<=1 & 1<=p21] & [p78<=1 & 1<=p78]] | [AF [[p39<=0 & 0<=p39]] & [[p37<=0 & 0<=p37] | [[p142<=0 & 0<=p142] | [p50<=0 & 0<=p50]]]]]]]
normalized: E [true U EG [[[[[[p50<=0 & 0<=p50] | [p142<=0 & 0<=p142]] | [p37<=0 & 0<=p37]] & ~ [EG [~ [[p39<=0 & 0<=p39]]]]] | [[p78<=1 & 1<=p78] & [p21<=1 & 1<=p21]]]]]
abstracting: (1<=p21)
states: 1,371,919,680 (9)
abstracting: (p21<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p78)
states: 2,985,984 (6)
abstracting: (p78<=1)
states: 1,371,919,681 (9)
abstracting: (0<=p39)
states: 1,371,919,681 (9)
abstracting: (p39<=0)
states: 953,213,185 (8)
.................................
EG iterations: 33
abstracting: (0<=p37)
states: 1,371,919,681 (9)
abstracting: (p37<=0)
states: 892,327,105 (8)
abstracting: (0<=p142)
states: 1,371,919,681 (9)
abstracting: (p142<=0)
states: 1,337,907,457 (9)
abstracting: (0<=p50)
states: 1,371,919,681 (9)
abstracting: (p50<=0)
states: 685,959,841 (8)
.
EG iterations: 1
-> the formula is TRUE
FORMULA AutoFlight-PT-06a-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.132sec
checking: [A [EF [EG [[[[p24<=1 & 1<=p24] & [p132<=1 & 1<=p132]] & [[p5<=1 & 1<=p5] & [[p3<=1 & 1<=p3] | [p17<=1 & 1<=p17]]]]]] U EG [AG [[[p10<=1 & 1<=p10] & [p120<=1 & 1<=p120]]]]] | EF [[[p7<=1 & 1<=p7] & [p90<=1 & 1<=p90]]]]
normalized: [E [true U [[p90<=1 & 1<=p90] & [p7<=1 & 1<=p7]]] | [~ [EG [~ [EG [~ [E [true U ~ [[[p120<=1 & 1<=p120] & [p10<=1 & 1<=p10]]]]]]]]] & ~ [E [~ [EG [~ [E [true U ~ [[[p120<=1 & 1<=p120] & [p10<=1 & 1<=p10]]]]]]] U [~ [E [true U EG [[[[[p17<=1 & 1<=p17] | [p3<=1 & 1<=p3]] & [p5<=1 & 1<=p5]] & [[p132<=1 & 1<=p132] & [p24<=1 & 1<=p24]]]]]] & ~ [EG [~ [E [true U ~ [[[p120<=1 & 1<=p120] & [p10<=1 & 1<=p10]]]]]]]]]]]]
abstracting: (1<=p10)
states: 470,494,656 (8)
abstracting: (p10<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p120)
states: 34,012,224 (7)
abstracting: (p120<=1)
states: 1,371,919,681 (9)
.
EG iterations: 1
abstracting: (1<=p24)
states: 473,294,016 (8)
abstracting: (p24<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p132)
states: 34,012,224 (7)
abstracting: (p132<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p5)
states: 438,395,328 (8)
abstracting: (p5<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p3)
states: 469,748,160 (8)
abstracting: (p3<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p17)
states: 471,614,400 (8)
abstracting: (p17<=1)
states: 1,371,919,681 (9)
..........................
EG iterations: 26
abstracting: (1<=p10)
states: 470,494,656 (8)
abstracting: (p10<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p120)
states: 34,012,224 (7)
abstracting: (p120<=1)
states: 1,371,919,681 (9)
.
EG iterations: 1
abstracting: (1<=p10)
states: 470,494,656 (8)
abstracting: (p10<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p120)
states: 34,012,224 (7)
abstracting: (p120<=1)
states: 1,371,919,681 (9)
.
EG iterations: 1
EG iterations: 0
abstracting: (1<=p7)
states: 1,371,919,680 (9)
abstracting: (p7<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p90)
states: 2,985,984 (6)
abstracting: (p90<=1)
states: 1,371,919,681 (9)
-> the formula is TRUE
FORMULA AutoFlight-PT-06a-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.135sec
checking: AF [EG [[AX [[A [[p12<=1 & 1<=p12] U [p98<=1 & 1<=p98]] | [[p29<=1 & 1<=p29] & [p86<=1 & 1<=p86]]]] & [AX [[[[p54<=1 & 1<=p54] & [p140<=1 & 1<=p140]] | [p5<=1 & 1<=p5]]] | [[p1<=1 & 1<=p1] & [p82<=1 & 1<=p82]]]]]]
normalized: ~ [EG [~ [EG [[[[[p82<=1 & 1<=p82] & [p1<=1 & 1<=p1]] | ~ [EX [~ [[[p5<=1 & 1<=p5] | [[p140<=1 & 1<=p140] & [p54<=1 & 1<=p54]]]]]]] & ~ [EX [~ [[[[p86<=1 & 1<=p86] & [p29<=1 & 1<=p29]] | [~ [EG [~ [[p98<=1 & 1<=p98]]]] & ~ [E [~ [[p98<=1 & 1<=p98]] U [~ [[p12<=1 & 1<=p12]] & ~ [[p98<=1 & 1<=p98]]]]]]]]]]]]]]]
abstracting: (1<=p98)
states: 2,985,984 (6)
abstracting: (p98<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p12)
states: 436,902,336 (8)
abstracting: (p12<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p98)
states: 2,985,984 (6)
abstracting: (p98<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p98)
states: 2,985,984 (6)
abstracting: (p98<=1)
states: 1,371,919,681 (9)
....................................................
EG iterations: 52
abstracting: (1<=p29)
states: 475,813,440 (8)
abstracting: (p29<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p86)
states: 22,674,816 (7)
abstracting: (p86<=1)
states: 1,371,919,681 (9)
.abstracting: (1<=p54)
states: 1,371,919,680 (9)
abstracting: (p54<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p140)
states: 34,012,224 (7)
abstracting: (p140<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p5)
states: 438,395,328 (8)
abstracting: (p5<=1)
states: 1,371,919,681 (9)
.abstracting: (1<=p1)
states: 469,748,160 (8)
abstracting: (p1<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p82)
states: 4,478,976 (6)
abstracting: (p82<=1)
states: 1,371,919,681 (9)
.
EG iterations: 1
..................................
EG iterations: 34
-> the formula is FALSE
FORMULA AutoFlight-PT-06a-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.221sec
checking: [EG [[1<=p19 & p19<=1]] | EG [[[p100<=1 & 1<=p100] | E [EX [~ [[p3<=1 & 1<=p3]]] U [[AG [[p75<=1 & 1<=p75]] | ~ [[[p51<=1 & 1<=p51] & [p135<=1 & 1<=p135]]]] | [[[p40<=1 & 1<=p40] & [[p15<=1 & 1<=p15] & [p84<=1 & 1<=p84]]] | ~ [[p27<=1 & 1<=p27]]]]]]]]
normalized: [EG [[[p100<=1 & 1<=p100] | E [EX [~ [[p3<=1 & 1<=p3]]] U [[~ [[[p135<=1 & 1<=p135] & [p51<=1 & 1<=p51]]] | ~ [E [true U ~ [[p75<=1 & 1<=p75]]]]] | [~ [[p27<=1 & 1<=p27]] | [[[p84<=1 & 1<=p84] & [p15<=1 & 1<=p15]] & [p40<=1 & 1<=p40]]]]]]] | EG [[1<=p19 & p19<=1]]]
abstracting: (p19<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p19)
states: 434,662,848 (8)
....................................
EG iterations: 36
abstracting: (1<=p40)
states: 476,606,592 (8)
abstracting: (p40<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p15)
states: 471,614,400 (8)
abstracting: (p15<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p84)
states: 10,077,696 (7)
abstracting: (p84<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p27)
states: 470,308,032 (8)
abstracting: (p27<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p75)
states: 2,985,984 (6)
abstracting: (p75<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p51)
states: 1,371,919,680 (9)
abstracting: (p51<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p135)
states: 34,012,224 (7)
abstracting: (p135<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p3)
states: 469,748,160 (8)
abstracting: (p3<=1)
states: 1,371,919,681 (9)
.abstracting: (1<=p100)
states: 2,985,984 (6)
abstracting: (p100<=1)
states: 1,371,919,681 (9)
EG iterations: 0
-> the formula is TRUE
FORMULA AutoFlight-PT-06a-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.867sec
checking: E [[[p125<=1 & 1<=p125] & [p147<=1 & 1<=p147]] U E [[AG [[p33<=1 & 1<=p33]] | [[p10<=1 & 1<=p10] & [[p120<=1 & 1<=p120] & [AG [[[p45<=1 & 1<=p45] & [p123<=1 & 1<=p123]]] | AX [[[p49<=1 & 1<=p49] & [p134<=1 & 1<=p134]]]]]]] U EG [~ [[[p114<=1 & 1<=p114] & [p147<=1 & 1<=p147]]]]]]
normalized: E [[[p147<=1 & 1<=p147] & [p125<=1 & 1<=p125]] U E [[[[[~ [EX [~ [[[p134<=1 & 1<=p134] & [p49<=1 & 1<=p49]]]]] | ~ [E [true U ~ [[[p123<=1 & 1<=p123] & [p45<=1 & 1<=p45]]]]]] & [p120<=1 & 1<=p120]] & [p10<=1 & 1<=p10]] | ~ [E [true U ~ [[p33<=1 & 1<=p33]]]]] U EG [~ [[[p147<=1 & 1<=p147] & [p114<=1 & 1<=p114]]]]]]
abstracting: (1<=p114)
states: 34,012,224 (7)
abstracting: (p114<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p147)
states: 1,337,907,456 (9)
abstracting: (p147<=1)
states: 1,371,919,681 (9)
.
EG iterations: 1
abstracting: (1<=p33)
states: 426,264,768 (8)
abstracting: (p33<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p10)
states: 470,494,656 (8)
abstracting: (p10<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p120)
states: 34,012,224 (7)
abstracting: (p120<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p45)
states: 1,371,919,680 (9)
abstracting: (p45<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p123)
states: 34,012,224 (7)
abstracting: (p123<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p49)
states: 685,959,840 (8)
abstracting: (p49<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p134)
states: 34,012,224 (7)
abstracting: (p134<=1)
states: 1,371,919,681 (9)
.abstracting: (1<=p125)
states: 34,012,224 (7)
abstracting: (p125<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p147)
states: 1,337,907,456 (9)
abstracting: (p147<=1)
states: 1,371,919,681 (9)
-> the formula is TRUE
FORMULA AutoFlight-PT-06a-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.050sec
checking: [E [EX [EF [[[p124<=1 & 1<=p124] & [p146<=1 & 1<=p146]]]] U [AF [AG [[[p28<=1 & 1<=p28] & [p105<=1 & 1<=p105]]]] & [~ [AG [A [[[p13<=1 & 1<=p13] & [p121<=1 & 1<=p121]] U [[p17<=1 & 1<=p17] & [p126<=1 & 1<=p126]]]]] & EX [E [[[p8<=1 & 1<=p8] & [p83<=1 & 1<=p83]] U [[p41<=1 & 1<=p41] & [p117<=1 & 1<=p117]]]]]]] & EG [EX [~ [E [[[p20<=1 & 1<=p20] & [p127<=1 & 1<=p127]] U AX [[p37<=1 & 1<=p37]]]]]]]
normalized: [EG [EX [~ [E [[[p127<=1 & 1<=p127] & [p20<=1 & 1<=p20]] U ~ [EX [~ [[p37<=1 & 1<=p37]]]]]]]] & E [EX [E [true U [[p146<=1 & 1<=p146] & [p124<=1 & 1<=p124]]]] U [[EX [E [[[p83<=1 & 1<=p83] & [p8<=1 & 1<=p8]] U [[p117<=1 & 1<=p117] & [p41<=1 & 1<=p41]]]] & E [true U ~ [[~ [EG [~ [[[p126<=1 & 1<=p126] & [p17<=1 & 1<=p17]]]]] & ~ [E [~ [[[p126<=1 & 1<=p126] & [p17<=1 & 1<=p17]]] U [~ [[[p121<=1 & 1<=p121] & [p13<=1 & 1<=p13]]] & ~ [[[p126<=1 & 1<=p126] & [p17<=1 & 1<=p17]]]]]]]]]] & ~ [EG [E [true U ~ [[[p105<=1 & 1<=p105] & [p28<=1 & 1<=p28]]]]]]]]]
abstracting: (1<=p28)
states: 1,371,919,680 (9)
abstracting: (p28<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p105)
states: 2,985,984 (6)
abstracting: (p105<=1)
states: 1,371,919,681 (9)
EG iterations: 0
abstracting: (1<=p17)
states: 471,614,400 (8)
abstracting: (p17<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p126)
states: 34,012,224 (7)
abstracting: (p126<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p13)
states: 467,508,672 (8)
abstracting: (p13<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p121)
states: 34,012,224 (7)
abstracting: (p121<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p17)
states: 471,614,400 (8)
abstracting: (p17<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p126)
states: 34,012,224 (7)
abstracting: (p126<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p17)
states: 471,614,400 (8)
abstracting: (p17<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p126)
states: 34,012,224 (7)
abstracting: (p126<=1)
states: 1,371,919,681 (9)
..............................
EG iterations: 30
abstracting: (1<=p41)
states: 685,959,840 (8)
abstracting: (p41<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p117)
states: 34,012,224 (7)
abstracting: (p117<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p8)
states: 470,494,656 (8)
abstracting: (p8<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p83)
states: 6,718,464 (6)
abstracting: (p83<=1)
states: 1,371,919,681 (9)
.abstracting: (1<=p124)
states: 1,201,858,560 (9)
abstracting: (p124<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p146)
states: 34,012,224 (7)
abstracting: (p146<=1)
states: 1,371,919,681 (9)
.abstracting: (1<=p37)
states: 479,592,576 (8)
abstracting: (p37<=1)
states: 1,371,919,681 (9)
.abstracting: (1<=p20)
states: 468,628,416 (8)
abstracting: (p20<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p127)
states: 34,012,224 (7)
abstracting: (p127<=1)
states: 1,371,919,681 (9)
..................................
EG iterations: 33
-> the formula is FALSE
FORMULA AutoFlight-PT-06a-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.545sec
checking: AF [[EF [[AG [[[p28<=1 & 1<=p28] & [p93<=1 & 1<=p93]]] & EX [[p56<=1 & 1<=p56]]]] & [A [E [EF [[p66<=1 & 1<=p66]] U [[p17<=1 & 1<=p17] & [[p14<=1 & 1<=p14] & [p103<=1 & 1<=p103]]]] U [EG [[p70<=1 & 1<=p70]] & [A [[p10<=1 & 1<=p10] U [[p48<=1 & 1<=p48] & [p129<=1 & 1<=p129]]] | [[p37<=1 & 1<=p37] & [[p142<=1 & 1<=p142] & [p30<=1 & 1<=p30]]]]]] & [E [~ [[p50<=1 & 1<=p50]] U E [~ [[p101<=1 & 1<=p101]] U [[p41<=1 & 1<=p41] & [p117<=1 & 1<=p117]]]] | [E [[A [[[p28<=1 & 1<=p28] & [p105<=1 & 1<=p105]] U [[p21<=1 & 1<=p21] & [p92<=1 & 1<=p92]]] | ~ [[[p24<=1 & 1<=p24] & [p132<=1 & 1<=p132]]]] U [~ [[p9<=1 & 1<=p9]] | [p33<=1 & 1<=p33]]] & [p34<=1 & 1<=p34]]]]]]
normalized: ~ [EG [~ [[E [true U [EX [[p56<=1 & 1<=p56]] & ~ [E [true U ~ [[[p93<=1 & 1<=p93] & [p28<=1 & 1<=p28]]]]]]] & [[E [~ [[p50<=1 & 1<=p50]] U E [~ [[p101<=1 & 1<=p101]] U [[p117<=1 & 1<=p117] & [p41<=1 & 1<=p41]]]] | [E [[[~ [EG [~ [[[p92<=1 & 1<=p92] & [p21<=1 & 1<=p21]]]]] & ~ [E [~ [[[p92<=1 & 1<=p92] & [p21<=1 & 1<=p21]]] U [~ [[[p92<=1 & 1<=p92] & [p21<=1 & 1<=p21]]] & ~ [[[p105<=1 & 1<=p105] & [p28<=1 & 1<=p28]]]]]]] | ~ [[[p132<=1 & 1<=p132] & [p24<=1 & 1<=p24]]]] U [[p33<=1 & 1<=p33] | ~ [[p9<=1 & 1<=p9]]]] & [p34<=1 & 1<=p34]]] & [~ [EG [~ [[[[[p37<=1 & 1<=p37] & [[p30<=1 & 1<=p30] & [p142<=1 & 1<=p142]]] | [~ [E [~ [[[p129<=1 & 1<=p129] & [p48<=1 & 1<=p48]]] U [~ [[[p129<=1 & 1<=p129] & [p48<=1 & 1<=p48]]] & ~ [[p10<=1 & 1<=p10]]]]] & ~ [EG [~ [[[p129<=1 & 1<=p129] & [p48<=1 & 1<=p48]]]]]]] & EG [[p70<=1 & 1<=p70]]]]]] & ~ [E [~ [[[[[p37<=1 & 1<=p37] & [[p30<=1 & 1<=p30] & [p142<=1 & 1<=p142]]] | [~ [E [~ [[[p129<=1 & 1<=p129] & [p48<=1 & 1<=p48]]] U [~ [[[p129<=1 & 1<=p129] & [p48<=1 & 1<=p48]]] & ~ [[p10<=1 & 1<=p10]]]]] & ~ [EG [~ [[[p129<=1 & 1<=p129] & [p48<=1 & 1<=p48]]]]]]] & EG [[p70<=1 & 1<=p70]]]] U [~ [E [E [true U [p66<=1 & 1<=p66]] U [[[p103<=1 & 1<=p103] & [p14<=1 & 1<=p14]] & [p17<=1 & 1<=p17]]]] & ~ [[[[[p37<=1 & 1<=p37] & [[p30<=1 & 1<=p30] & [p142<=1 & 1<=p142]]] | [~ [E [~ [[[p129<=1 & 1<=p129] & [p48<=1 & 1<=p48]]] U [~ [[[p129<=1 & 1<=p129] & [p48<=1 & 1<=p48]]] & ~ [[p10<=1 & 1<=p10]]]]] & ~ [EG [~ [[[p129<=1 & 1<=p129] & [p48<=1 & 1<=p48]]]]]]] & EG [[p70<=1 & 1<=p70]]]]]]]]]]]]]
abstracting: (1<=p70)
states: 2,985,984 (6)
abstracting: (p70<=1)
states: 1,371,919,681 (9)
..........................
EG iterations: 26
abstracting: (1<=p48)
states: 1,371,919,680 (9)
abstracting: (p48<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p129)
states: 34,012,224 (7)
abstracting: (p129<=1)
states: 1,371,919,681 (9)
.
EG iterations: 1
abstracting: (1<=p10)
states: 470,494,656 (8)
abstracting: (p10<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p48)
states: 1,371,919,680 (9)
abstracting: (p48<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p129)
states: 34,012,224 (7)
abstracting: (p129<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p48)
states: 1,371,919,680 (9)
abstracting: (p48<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p129)
states: 34,012,224 (7)
abstracting: (p129<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p142)
states: 34,012,224 (7)
abstracting: (p142<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p30)
states: 420,292,800 (8)
abstracting: (p30<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p37)
states: 479,592,576 (8)
abstracting: (p37<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p17)
states: 471,614,400 (8)
abstracting: (p17<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p14)
states: 1,371,919,680 (9)
abstracting: (p14<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p103)
states: 2,985,984 (6)
abstracting: (p103<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p66)
states: 2,985,984 (6)
abstracting: (p66<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p70)
states: 2,985,984 (6)
abstracting: (p70<=1)
states: 1,371,919,681 (9)
..........................
EG iterations: 26
abstracting: (1<=p48)
states: 1,371,919,680 (9)
abstracting: (p48<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p129)
states: 34,012,224 (7)
abstracting: (p129<=1)
states: 1,371,919,681 (9)
.
EG iterations: 1
abstracting: (1<=p10)
states: 470,494,656 (8)
abstracting: (p10<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p48)
states: 1,371,919,680 (9)
abstracting: (p48<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p129)
states: 34,012,224 (7)
abstracting: (p129<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p48)
states: 1,371,919,680 (9)
abstracting: (p48<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p129)
states: 34,012,224 (7)
abstracting: (p129<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p142)
states: 34,012,224 (7)
abstracting: (p142<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p30)
states: 420,292,800 (8)
abstracting: (p30<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p37)
states: 479,592,576 (8)
abstracting: (p37<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p70)
states: 2,985,984 (6)
abstracting: (p70<=1)
states: 1,371,919,681 (9)
..........................
EG iterations: 26
abstracting: (1<=p48)
states: 1,371,919,680 (9)
abstracting: (p48<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p129)
states: 34,012,224 (7)
abstracting: (p129<=1)
states: 1,371,919,681 (9)
.
EG iterations: 1
abstracting: (1<=p10)
states: 470,494,656 (8)
abstracting: (p10<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p48)
states: 1,371,919,680 (9)
abstracting: (p48<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p129)
states: 34,012,224 (7)
abstracting: (p129<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p48)
states: 1,371,919,680 (9)
abstracting: (p48<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p129)
states: 34,012,224 (7)
abstracting: (p129<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p142)
states: 34,012,224 (7)
abstracting: (p142<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p30)
states: 420,292,800 (8)
abstracting: (p30<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p37)
states: 479,592,576 (8)
abstracting: (p37<=1)
states: 1,371,919,681 (9)
EG iterations: 0
abstracting: (1<=p34)
states: 472,827,456 (8)
abstracting: (p34<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p9)
states: 430,930,368 (8)
abstracting: (p9<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p33)
states: 426,264,768 (8)
abstracting: (p33<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p24)
states: 473,294,016 (8)
abstracting: (p24<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p132)
states: 34,012,224 (7)
abstracting: (p132<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p28)
states: 1,371,919,680 (9)
abstracting: (p28<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p105)
states: 2,985,984 (6)
abstracting: (p105<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p21)
states: 1,371,919,680 (9)
abstracting: (p21<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p92)
states: 2,985,984 (6)
abstracting: (p92<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p21)
states: 1,371,919,680 (9)
abstracting: (p21<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p92)
states: 2,985,984 (6)
abstracting: (p92<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p21)
states: 1,371,919,680 (9)
abstracting: (p21<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p92)
states: 2,985,984 (6)
abstracting: (p92<=1)
states: 1,371,919,681 (9)
..........................................................
EG iterations: 58
abstracting: (1<=p41)
states: 685,959,840 (8)
abstracting: (p41<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p117)
states: 34,012,224 (7)
abstracting: (p117<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p101)
states: 2,985,984 (6)
abstracting: (p101<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p50)
states: 685,959,840 (8)
abstracting: (p50<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p28)
states: 1,371,919,680 (9)
abstracting: (p28<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p93)
states: 2,985,984 (6)
abstracting: (p93<=1)
states: 1,371,919,681 (9)
abstracting: (1<=p56)
states: 685,959,840 (8)
abstracting: (p56<=1)
states: 1,371,919,681 (9)
.
EG iterations: 0
-> the formula is FALSE
FORMULA AutoFlight-PT-06a-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.797sec
totally nodes used: 15908661 (1.6e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 15756114 30102710 45858824
used/not used/entry size/cache size: 33754046 33354818 16 1024MB
basic ops cache: hits/miss/sum: 1379883 4788899 6168782
used/not used/entry size/cache size: 6746489 10030727 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: 8975 23782 32757
used/not used/entry size/cache size: 23751 8364857 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 53253022
1 12021815
2 1635607
3 179668
4 17244
5 1401
6 102
7 5
8 0
9 0
>= 10 0
Total processing time: 0m21.512sec
BK_STOP 1678689628741
--------------------
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:3541 (28), effective:418 (3)
initing FirstDep: 0m 0.000sec
iterations count:428 (3), effective:66 (0)
iterations count:128 (1), effective:1 (0)
iterations count:2883 (23), effective:304 (2)
iterations count:127 (1), effective:1 (0)
iterations count:1421 (11), effective:129 (1)
iterations count:126 (1), effective:1 (0)
iterations count:1396 (11), effective:128 (1)
iterations count:3246 (25), effective:332 (2)
iterations count:321 (2), effective:21 (0)
iterations count:126 (1), effective:1 (0)
iterations count:126 (1), effective:1 (0)
iterations count:125 (1), effective:0 (0)
iterations count:126 (1), effective:1 (0)
iterations count:1383 (11), effective:129 (1)
iterations count:127 (1), effective:1 (0)
iterations count:150 (1), effective:1 (0)
iterations count:127 (1), effective:1 (0)
iterations count:127 (1), effective:1 (0)
iterations count:127 (1), effective:1 (0)
iterations count:125 (1), effective:0 (0)
iterations count:125 (1), effective:0 (0)
iterations count:155 (1), effective:1 (0)
iterations count:131 (1), effective:1 (0)
iterations count:126 (1), effective:1 (0)
iterations count:125 (1), effective:0 (0)
iterations count:1408 (11), effective:129 (1)
iterations count:165 (1), effective:20 (0)
iterations count:129 (1), effective:2 (0)
iterations count:1421 (11), effective:129 (1)
iterations count:2449 (19), effective:230 (1)
iterations count:129 (1), effective:2 (0)
iterations count:1202 (9), effective:103 (0)
iterations count:129 (1), effective:2 (0)
iterations count:155 (1), effective:1 (0)
iterations count:127 (1), effective:1 (0)
iterations count:1127 (9), effective:104 (0)
iterations count:437 (3), effective:25 (0)
iterations count:147 (1), effective:1 (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-06a"
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-06a, 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-167813599100450"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-06a.tgz
mv AutoFlight-PT-06a 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 ;