About the Execution of Marcie+red for AutoFlight-PT-05a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5779.428 | 14936.00 | 24474.00 | 36.90 | FTTTFTTTFTFTFTFF | 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-167813599000433.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-05a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599000433
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 7.1K Feb 25 18:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 18:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 18:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 18:11 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.5K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 18:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 18:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 18:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 18:14 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 36K 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-05a-CTLCardinality-00
FORMULA_NAME AutoFlight-PT-05a-CTLCardinality-01
FORMULA_NAME AutoFlight-PT-05a-CTLCardinality-02
FORMULA_NAME AutoFlight-PT-05a-CTLCardinality-03
FORMULA_NAME AutoFlight-PT-05a-CTLCardinality-04
FORMULA_NAME AutoFlight-PT-05a-CTLCardinality-05
FORMULA_NAME AutoFlight-PT-05a-CTLCardinality-06
FORMULA_NAME AutoFlight-PT-05a-CTLCardinality-07
FORMULA_NAME AutoFlight-PT-05a-CTLCardinality-08
FORMULA_NAME AutoFlight-PT-05a-CTLCardinality-09
FORMULA_NAME AutoFlight-PT-05a-CTLCardinality-10
FORMULA_NAME AutoFlight-PT-05a-CTLCardinality-11
FORMULA_NAME AutoFlight-PT-05a-CTLCardinality-12
FORMULA_NAME AutoFlight-PT-05a-CTLCardinality-13
FORMULA_NAME AutoFlight-PT-05a-CTLCardinality-14
FORMULA_NAME AutoFlight-PT-05a-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678689064964
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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-05a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 06:31:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 06:31:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 06:31:07] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2023-03-13 06:31:07] [INFO ] Transformed 132 places.
[2023-03-13 06:31:07] [INFO ] Transformed 130 transitions.
[2023-03-13 06:31:07] [INFO ] Found NUPN structural information;
[2023-03-13 06:31:07] [INFO ] Parsed PT model containing 132 places and 130 transitions and 420 arcs in 136 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
Support contains 93 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 105/105 transitions.
Applied a total of 0 rules in 12 ms. Remains 132 /132 variables (removed 0) and now considering 105/105 (removed 0) transitions.
// Phase 1: matrix 105 rows 132 cols
[2023-03-13 06:31:08] [INFO ] Computed 34 place invariants in 11 ms
[2023-03-13 06:31:08] [INFO ] Implicit Places using invariants in 370 ms returned [41, 111, 117, 123, 131]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 399 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 127/132 places, 105/105 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 417 ms. Remains : 127/132 places, 105/105 transitions.
Support contains 93 out of 127 places after structural reductions.
[2023-03-13 06:31:08] [INFO ] Flatten gal took : 46 ms
[2023-03-13 06:31:08] [INFO ] Flatten gal took : 14 ms
[2023-03-13 06:31:08] [INFO ] Input system was already deterministic with 105 transitions.
Support contains 88 out of 127 places (down from 93) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 309 resets, run finished after 458 ms. (steps per millisecond=21 ) properties (out of 71) seen :58
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 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 46 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 105 rows 127 cols
[2023-03-13 06:31:10] [INFO ] Computed 29 place invariants in 2 ms
[2023-03-13 06:31:10] [INFO ] [Real]Absence check using 29 positive place invariants in 6 ms returned sat
[2023-03-13 06:31:10] [INFO ] After 48ms SMT Verify possible using state equation in real domain returned unsat :8 sat :2
[2023-03-13 06:31:10] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-13 06:31:10] [INFO ] After 12ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :8 sat :2
[2023-03-13 06:31:10] [INFO ] After 33ms SMT Verify possible using trap constraints in real domain returned unsat :8 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-13 06:31:10] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :8 sat :2
Fused 10 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 105/105 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 127 transition count 92
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 114 transition count 92
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 26 place count 114 transition count 85
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 40 place count 107 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 106 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 106 transition count 84
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 70 place count 92 transition count 70
Free-agglomeration rule applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 81 place count 92 transition count 59
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 92 place count 81 transition count 59
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 96 place count 81 transition count 55
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 100 place count 77 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 101 place count 76 transition count 54
Reduce places removed 23 places and 0 transitions.
Graph (trivial) has 36 edges and 53 vertex of which 4 / 53 are part of one of the 1 SCC in 2 ms
Free SCC test removed 3 places
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 4 with 56 rules applied. Total rules applied 157 place count 50 transition count 22
Reduce places removed 34 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 5 with 43 rules applied. Total rules applied 200 place count 16 transition count 13
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 203 place count 13 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 205 place count 12 transition count 12
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 206 place count 12 transition count 11
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 209 place count 10 transition count 10
Applied a total of 209 rules in 34 ms. Remains 10 /127 variables (removed 117) and now considering 10/105 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 10/127 places, 10/105 transitions.
Finished random walk after 10 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=10 )
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
FORMULA AutoFlight-PT-05a-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 12 ms
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 7 ms
[2023-03-13 06:31:10] [INFO ] Input system was already deterministic with 105 transitions.
Support contains 71 out of 127 places (down from 76) after GAL structural reductions.
Computed a total of 10 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 105/105 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 127 transition count 94
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 116 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 115 transition count 93
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 24 place count 115 transition count 86
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 38 place count 108 transition count 86
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 107 transition count 85
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 107 transition count 85
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 70 place count 92 transition count 70
Applied a total of 70 rules in 15 ms. Remains 92 /127 variables (removed 35) and now considering 70/105 (removed 35) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 92/127 places, 70/105 transitions.
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:31:10] [INFO ] Input system was already deterministic with 70 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 105/105 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 117 transition count 64
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 89 place count 77 transition count 64
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 89 place count 77 transition count 59
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 104 place count 67 transition count 59
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 5 rules applied. Total rules applied 109 place count 67 transition count 54
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 114 place count 62 transition count 54
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 116 place count 60 transition count 52
Iterating global reduction 4 with 2 rules applied. Total rules applied 118 place count 60 transition count 52
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 148 place count 45 transition count 37
Applied a total of 148 rules in 7 ms. Remains 45 /127 variables (removed 82) and now considering 37/105 (removed 68) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 45/127 places, 37/105 transitions.
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:31:10] [INFO ] Input system was already deterministic with 37 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
FORMULA AutoFlight-PT-05a-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 105/105 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 127 transition count 91
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 113 transition count 91
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 28 place count 113 transition count 84
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 42 place count 106 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 104 transition count 82
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 104 transition count 82
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 74 place count 90 transition count 68
Applied a total of 74 rules in 9 ms. Remains 90 /127 variables (removed 37) and now considering 68/105 (removed 37) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 90/127 places, 68/105 transitions.
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:31:10] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 105/105 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 103
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 103
Applied a total of 4 rules in 4 ms. Remains 125 /127 variables (removed 2) and now considering 103/105 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 125/127 places, 103/105 transitions.
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:31:10] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 105/105 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 103
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 103
Applied a total of 4 rules in 3 ms. Remains 125 /127 variables (removed 2) and now considering 103/105 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 125/127 places, 103/105 transitions.
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 13 ms
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:31:10] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 105/105 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 103
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 103
Applied a total of 4 rules in 3 ms. Remains 125 /127 variables (removed 2) and now considering 103/105 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 125/127 places, 103/105 transitions.
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:31:10] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 105/105 transitions.
Applied a total of 0 rules in 1 ms. Remains 127 /127 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 127/127 places, 105/105 transitions.
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:31:10] [INFO ] Input system was already deterministic with 105 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 105/105 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 117 transition count 64
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 89 place count 77 transition count 64
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 89 place count 77 transition count 59
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 104 place count 67 transition count 59
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 5 rules applied. Total rules applied 109 place count 67 transition count 54
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 114 place count 62 transition count 54
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 116 place count 60 transition count 52
Iterating global reduction 4 with 2 rules applied. Total rules applied 118 place count 60 transition count 52
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 146 place count 46 transition count 38
Applied a total of 146 rules in 8 ms. Remains 46 /127 variables (removed 81) and now considering 38/105 (removed 67) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 46/127 places, 38/105 transitions.
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:31:10] [INFO ] Input system was already deterministic with 38 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 105/105 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 126 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 126 transition count 104
Applied a total of 2 rules in 3 ms. Remains 126 /127 variables (removed 1) and now considering 104/105 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 126/127 places, 104/105 transitions.
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 6 ms
[2023-03-13 06:31:10] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 105/105 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 127 transition count 91
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 113 transition count 91
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 28 place count 113 transition count 84
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 42 place count 106 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 104 transition count 82
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 104 transition count 82
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 72 place count 91 transition count 69
Applied a total of 72 rules in 9 ms. Remains 91 /127 variables (removed 36) and now considering 69/105 (removed 36) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 91/127 places, 69/105 transitions.
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:31:10] [INFO ] Input system was already deterministic with 69 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 105/105 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 103
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 103
Applied a total of 4 rules in 3 ms. Remains 125 /127 variables (removed 2) and now considering 103/105 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 125/127 places, 103/105 transitions.
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:31:10] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 105/105 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 103
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 103
Applied a total of 4 rules in 3 ms. Remains 125 /127 variables (removed 2) and now considering 103/105 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 125/127 places, 103/105 transitions.
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:31:10] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 105/105 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 103
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 103
Applied a total of 4 rules in 3 ms. Remains 125 /127 variables (removed 2) and now considering 103/105 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 125/127 places, 103/105 transitions.
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:31:10] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 105/105 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 117 transition count 72
Reduce places removed 32 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 75 place count 85 transition count 70
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 83 transition count 70
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 77 place count 83 transition count 64
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 94 place count 72 transition count 64
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 99 place count 72 transition count 59
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 104 place count 67 transition count 59
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 106 place count 65 transition count 57
Iterating global reduction 5 with 2 rules applied. Total rules applied 108 place count 65 transition count 57
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 134 place count 52 transition count 44
Applied a total of 134 rules in 7 ms. Remains 52 /127 variables (removed 75) and now considering 44/105 (removed 61) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 52/127 places, 44/105 transitions.
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:31:10] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 105/105 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 103
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 103
Applied a total of 4 rules in 2 ms. Remains 125 /127 variables (removed 2) and now considering 103/105 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 125/127 places, 103/105 transitions.
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:31:10] [INFO ] Input system was already deterministic with 103 transitions.
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:31:10] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:31:10] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-13 06:31:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 127 places, 105 transitions and 344 arcs took 1 ms.
Total runtime 2996 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=CTLCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 127 NrTr: 105 NrArc: 344)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec
net check time: 0m 0.000sec
init dd package: 0m 2.842sec
RS generation: 0m 0.043sec
-> reachability set: #nodes 943 (9.4e+02) #states 68,179,969 (7)
starting MCC model checker
--------------------------
checking: EF [AG [[p26<=0 & 0<=p26]]]
normalized: E [true U ~ [E [true U ~ [[p26<=0 & 0<=p26]]]]]
abstracting: (0<=p26)
states: 68,179,969 (7)
abstracting: (p26<=0)
states: 47,371,393 (7)
-> the formula is TRUE
FORMULA AutoFlight-PT-05a-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.085sec
checking: EF [EX [EF [EG [[[p97<=0 & 0<=p97] & [p120<=1 & 1<=p120]]]]]]
normalized: E [true U EX [E [true U EG [[[p120<=1 & 1<=p120] & [p97<=0 & 0<=p97]]]]]]
abstracting: (0<=p97)
states: 68,179,969 (7)
abstracting: (p97<=0)
states: 66,290,401 (7)
abstracting: (1<=p120)
states: 1,889,568 (6)
abstracting: (p120<=1)
states: 68,179,969 (7)
...........................
EG iterations: 27
.-> the formula is FALSE
FORMULA AutoFlight-PT-05a-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.056sec
checking: EG [EF [[[p24<=1 & 1<=p24] | [[p80<=0 & 0<=p80] & AG [[[p79<=0 & 0<=p79] | [p123<=1 & 1<=p123]]]]]]]
normalized: EG [E [true U [[~ [E [true U ~ [[[p123<=1 & 1<=p123] | [p79<=0 & 0<=p79]]]]] & [p80<=0 & 0<=p80]] | [p24<=1 & 1<=p24]]]]
abstracting: (1<=p24)
states: 23,893,056 (7)
abstracting: (p24<=1)
states: 68,179,969 (7)
abstracting: (0<=p80)
states: 68,179,969 (7)
abstracting: (p80<=0)
states: 67,931,137 (7)
abstracting: (0<=p79)
states: 68,179,969 (7)
abstracting: (p79<=0)
states: 67,931,137 (7)
abstracting: (1<=p123)
states: 1,889,568 (6)
abstracting: (p123<=1)
states: 68,179,969 (7)
EG iterations: 0
-> the formula is TRUE
FORMULA AutoFlight-PT-05a-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.050sec
checking: EX [A [AX [EF [[[p95<=0 & 0<=p95] | [p50<=1 & 1<=p50]]]] U [[p61<=0 & 0<=p61] | [p80<=1 & 1<=p80]]]]
normalized: EX [[~ [EG [~ [[[p80<=1 & 1<=p80] | [p61<=0 & 0<=p61]]]]] & ~ [E [~ [[[p80<=1 & 1<=p80] | [p61<=0 & 0<=p61]]] U [EX [~ [E [true U [[p50<=1 & 1<=p50] | [p95<=0 & 0<=p95]]]]] & ~ [[[p80<=1 & 1<=p80] | [p61<=0 & 0<=p61]]]]]]]]
abstracting: (0<=p61)
states: 68,179,969 (7)
abstracting: (p61<=0)
states: 67,931,137 (7)
abstracting: (1<=p80)
states: 248,832 (5)
abstracting: (p80<=1)
states: 68,179,969 (7)
abstracting: (0<=p95)
states: 68,179,969 (7)
abstracting: (p95<=0)
states: 67,340,161 (7)
abstracting: (1<=p50)
states: 248,832 (5)
abstracting: (p50<=1)
states: 68,179,969 (7)
.abstracting: (0<=p61)
states: 68,179,969 (7)
abstracting: (p61<=0)
states: 67,931,137 (7)
abstracting: (1<=p80)
states: 248,832 (5)
abstracting: (p80<=1)
states: 68,179,969 (7)
abstracting: (0<=p61)
states: 68,179,969 (7)
abstracting: (p61<=0)
states: 67,931,137 (7)
abstracting: (1<=p80)
states: 248,832 (5)
abstracting: (p80<=1)
states: 68,179,969 (7)
......................
EG iterations: 22
.-> the formula is TRUE
FORMULA AutoFlight-PT-05a-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.035sec
checking: [A [~ [[p27<=1 & 1<=p27]] U EG [[[p50<=0 & 0<=p50] | [p75<=1 & 1<=p75]]]] | EG [EF [[p103<=1 & 1<=p103]]]]
normalized: [EG [E [true U [p103<=1 & 1<=p103]]] | [~ [EG [~ [EG [[[p75<=1 & 1<=p75] | [p50<=0 & 0<=p50]]]]]] & ~ [E [~ [EG [[[p75<=1 & 1<=p75] | [p50<=0 & 0<=p50]]]] U [[p27<=1 & 1<=p27] & ~ [EG [[[p75<=1 & 1<=p75] | [p50<=0 & 0<=p50]]]]]]]]]
abstracting: (0<=p50)
states: 68,179,969 (7)
abstracting: (p50<=0)
states: 67,931,137 (7)
abstracting: (1<=p75)
states: 1,889,568 (6)
abstracting: (p75<=1)
states: 68,179,969 (7)
........................................................
EG iterations: 56
abstracting: (1<=p27)
states: 23,685,696 (7)
abstracting: (p27<=1)
states: 68,179,969 (7)
abstracting: (0<=p50)
states: 68,179,969 (7)
abstracting: (p50<=0)
states: 67,931,137 (7)
abstracting: (1<=p75)
states: 1,889,568 (6)
abstracting: (p75<=1)
states: 68,179,969 (7)
........................................................
EG iterations: 56
abstracting: (0<=p50)
states: 68,179,969 (7)
abstracting: (p50<=0)
states: 67,931,137 (7)
abstracting: (1<=p75)
states: 1,889,568 (6)
abstracting: (p75<=1)
states: 68,179,969 (7)
........................................................
EG iterations: 56
.........................................................
EG iterations: 57
abstracting: (1<=p103)
states: 1,889,568 (6)
abstracting: (p103<=1)
states: 68,179,969 (7)
.........................
EG iterations: 25
-> the formula is TRUE
FORMULA AutoFlight-PT-05a-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.467sec
checking: ~ [E [AG [E [[0<=p53 & p53<=0] U [[p14<=1 & 1<=p14] | [p84<=1 & 1<=p84]]]] U ~ [EF [~ [[[p110<=0 & 0<=p110] | [p114<=1 & 1<=p114]]]]]]]
normalized: ~ [E [~ [E [true U ~ [E [[0<=p53 & p53<=0] U [[p84<=1 & 1<=p84] | [p14<=1 & 1<=p14]]]]]] U ~ [E [true U ~ [[[p114<=1 & 1<=p114] | [p110<=0 & 0<=p110]]]]]]]
abstracting: (0<=p110)
states: 68,179,969 (7)
abstracting: (p110<=0)
states: 66,290,401 (7)
abstracting: (1<=p114)
states: 1,889,568 (6)
abstracting: (p114<=1)
states: 68,179,969 (7)
abstracting: (1<=p14)
states: 68,179,968 (7)
abstracting: (p14<=1)
states: 68,179,969 (7)
abstracting: (1<=p84)
states: 248,832 (5)
abstracting: (p84<=1)
states: 68,179,969 (7)
abstracting: (p53<=0)
states: 67,931,137 (7)
abstracting: (0<=p53)
states: 68,179,969 (7)
-> the formula is FALSE
FORMULA AutoFlight-PT-05a-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.080sec
checking: AF [[AX [AX [[[[p56<=1 & 1<=p56] | [p76<=1 & 1<=p76]] & [p112<=1 & 1<=p112]]]] | EG [[[p83<=0 & 0<=p83] & [p39<=0 & 0<=p39]]]]]
normalized: ~ [EG [~ [[EG [[[p39<=0 & 0<=p39] & [p83<=0 & 0<=p83]]] | ~ [EX [EX [~ [[[p112<=1 & 1<=p112] & [[p76<=1 & 1<=p76] | [p56<=1 & 1<=p56]]]]]]]]]]]
abstracting: (1<=p56)
states: 248,832 (5)
abstracting: (p56<=1)
states: 68,179,969 (7)
abstracting: (1<=p76)
states: 58,032,288 (7)
abstracting: (p76<=1)
states: 68,179,969 (7)
abstracting: (1<=p112)
states: 1,889,568 (6)
abstracting: (p112<=1)
states: 68,179,969 (7)
..abstracting: (0<=p83)
states: 68,179,969 (7)
abstracting: (p83<=0)
states: 67,931,137 (7)
abstracting: (0<=p39)
states: 68,179,969 (7)
abstracting: (p39<=0)
states: 34,089,985 (7)
............................................
EG iterations: 44
..............................
EG iterations: 30
-> the formula is TRUE
FORMULA AutoFlight-PT-05a-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.564sec
checking: ~ [E [EX [[[p81<=0 & 0<=p81] | [p106<=1 & 1<=p106]]] U ~ [E [AG [[p73<=0 & 0<=p73]] U ~ [[[p113<=0 & 0<=p113] | [p112<=1 & 1<=p112]]]]]]]
normalized: ~ [E [EX [[[p106<=1 & 1<=p106] | [p81<=0 & 0<=p81]]] U ~ [E [~ [E [true U ~ [[p73<=0 & 0<=p73]]]] U ~ [[[p112<=1 & 1<=p112] | [p113<=0 & 0<=p113]]]]]]]
abstracting: (0<=p113)
states: 68,179,969 (7)
abstracting: (p113<=0)
states: 66,290,401 (7)
abstracting: (1<=p112)
states: 1,889,568 (6)
abstracting: (p112<=1)
states: 68,179,969 (7)
abstracting: (0<=p73)
states: 68,179,969 (7)
abstracting: (p73<=0)
states: 67,340,161 (7)
abstracting: (0<=p81)
states: 68,179,969 (7)
abstracting: (p81<=0)
states: 67,931,137 (7)
abstracting: (1<=p106)
states: 1,889,568 (6)
abstracting: (p106<=1)
states: 68,179,969 (7)
.-> the formula is FALSE
FORMULA AutoFlight-PT-05a-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.059sec
checking: AG [AF [[EG [[[[p61<=0 & 0<=p61] | [p64<=1 & 1<=p64]] & [[p11<=0 & 0<=p11] | [p66<=1 & 1<=p66]]]] | EG [[p30<=1 & 1<=p30]]]]]
normalized: ~ [E [true U EG [~ [[EG [[p30<=1 & 1<=p30]] | EG [[[[p66<=1 & 1<=p66] | [p11<=0 & 0<=p11]] & [[p64<=1 & 1<=p64] | [p61<=0 & 0<=p61]]]]]]]]]
abstracting: (0<=p61)
states: 68,179,969 (7)
abstracting: (p61<=0)
states: 67,931,137 (7)
abstracting: (1<=p64)
states: 248,832 (5)
abstracting: (p64<=1)
states: 68,179,969 (7)
abstracting: (0<=p11)
states: 68,179,969 (7)
abstracting: (p11<=0)
states: 44,727,553 (7)
abstracting: (1<=p66)
states: 248,832 (5)
abstracting: (p66<=1)
states: 68,179,969 (7)
....................................................
EG iterations: 52
abstracting: (1<=p30)
states: 19,973,952 (7)
abstracting: (p30<=1)
states: 68,179,969 (7)
..............................
EG iterations: 30
.
EG iterations: 1
-> the formula is FALSE
FORMULA AutoFlight-PT-05a-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.688sec
checking: EG [[EX [[p27<=1 & 1<=p27]] & [EF [[[p126<=0 & 0<=p126] & [p125<=1 & 1<=p125]]] | EX [E [[p102<=1 & 1<=p102] U [[p10<=0 & 0<=p10] | [p52<=1 & 1<=p52]]]]]]]
normalized: EG [[[E [true U [[p126<=0 & 0<=p126] & [p125<=1 & 1<=p125]]] | EX [E [[p102<=1 & 1<=p102] U [[p52<=1 & 1<=p52] | [p10<=0 & 0<=p10]]]]] & EX [[p27<=1 & 1<=p27]]]]
abstracting: (1<=p27)
states: 23,685,696 (7)
abstracting: (p27<=1)
states: 68,179,969 (7)
.abstracting: (0<=p10)
states: 68,179,969 (7)
abstracting: (p10<=0)
states: 44,520,193 (7)
abstracting: (1<=p52)
states: 248,832 (5)
abstracting: (p52<=1)
states: 68,179,969 (7)
abstracting: (1<=p102)
states: 1,889,568 (6)
abstracting: (p102<=1)
states: 68,179,969 (7)
.abstracting: (1<=p125)
states: 58,732,128 (7)
abstracting: (p125<=1)
states: 68,179,969 (7)
abstracting: (0<=p126)
states: 68,179,969 (7)
abstracting: (p126<=0)
states: 66,290,401 (7)
............................
EG iterations: 28
-> the formula is TRUE
FORMULA AutoFlight-PT-05a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.210sec
checking: A [[p116<=0 & 0<=p116] U [AX [AG [[[p51<=0 & 0<=p51] | [[p89<=1 & 1<=p89] | [p6<=1 & 1<=p6]]]]] & [EF [AG [[p100<=1 & 1<=p100]]] | AF [[[p42<=1 & 1<=p42] & [p93<=0 & 0<=p93]]]]]]
normalized: [~ [EG [~ [[[~ [EG [~ [[[p93<=0 & 0<=p93] & [p42<=1 & 1<=p42]]]]] | E [true U ~ [E [true U ~ [[p100<=1 & 1<=p100]]]]]] & ~ [EX [E [true U ~ [[[[p6<=1 & 1<=p6] | [p89<=1 & 1<=p89]] | [p51<=0 & 0<=p51]]]]]]]]]] & ~ [E [~ [[[~ [EG [~ [[[p93<=0 & 0<=p93] & [p42<=1 & 1<=p42]]]]] | E [true U ~ [E [true U ~ [[p100<=1 & 1<=p100]]]]]] & ~ [EX [E [true U ~ [[[[p6<=1 & 1<=p6] | [p89<=1 & 1<=p89]] | [p51<=0 & 0<=p51]]]]]]]] U [~ [[[~ [EG [~ [[[p93<=0 & 0<=p93] & [p42<=1 & 1<=p42]]]]] | E [true U ~ [E [true U ~ [[p100<=1 & 1<=p100]]]]]] & ~ [EX [E [true U ~ [[[[p6<=1 & 1<=p6] | [p89<=1 & 1<=p89]] | [p51<=0 & 0<=p51]]]]]]]] & ~ [[p116<=0 & 0<=p116]]]]]]
abstracting: (0<=p116)
states: 68,179,969 (7)
abstracting: (p116<=0)
states: 66,290,401 (7)
abstracting: (0<=p51)
states: 68,179,969 (7)
abstracting: (p51<=0)
states: 67,931,137 (7)
abstracting: (1<=p89)
states: 248,832 (5)
abstracting: (p89<=1)
states: 68,179,969 (7)
abstracting: (1<=p6)
states: 23,390,208 (7)
abstracting: (p6<=1)
states: 68,179,969 (7)
.abstracting: (1<=p100)
states: 1,889,568 (6)
abstracting: (p100<=1)
states: 68,179,969 (7)
abstracting: (1<=p42)
states: 34,089,984 (7)
abstracting: (p42<=1)
states: 68,179,969 (7)
abstracting: (0<=p93)
states: 68,179,969 (7)
abstracting: (p93<=0)
states: 67,806,721 (7)
...........................
EG iterations: 27
abstracting: (0<=p51)
states: 68,179,969 (7)
abstracting: (p51<=0)
states: 67,931,137 (7)
abstracting: (1<=p89)
states: 248,832 (5)
abstracting: (p89<=1)
states: 68,179,969 (7)
abstracting: (1<=p6)
states: 23,390,208 (7)
abstracting: (p6<=1)
states: 68,179,969 (7)
.abstracting: (1<=p100)
states: 1,889,568 (6)
abstracting: (p100<=1)
states: 68,179,969 (7)
abstracting: (1<=p42)
states: 34,089,984 (7)
abstracting: (p42<=1)
states: 68,179,969 (7)
abstracting: (0<=p93)
states: 68,179,969 (7)
abstracting: (p93<=0)
states: 67,806,721 (7)
...........................
EG iterations: 27
abstracting: (0<=p51)
states: 68,179,969 (7)
abstracting: (p51<=0)
states: 67,931,137 (7)
abstracting: (1<=p89)
states: 248,832 (5)
abstracting: (p89<=1)
states: 68,179,969 (7)
abstracting: (1<=p6)
states: 23,390,208 (7)
abstracting: (p6<=1)
states: 68,179,969 (7)
.abstracting: (1<=p100)
states: 1,889,568 (6)
abstracting: (p100<=1)
states: 68,179,969 (7)
abstracting: (1<=p42)
states: 34,089,984 (7)
abstracting: (p42<=1)
states: 68,179,969 (7)
abstracting: (0<=p93)
states: 68,179,969 (7)
abstracting: (p93<=0)
states: 67,806,721 (7)
...........................
EG iterations: 27
.
EG iterations: 1
-> the formula is FALSE
FORMULA AutoFlight-PT-05a-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.262sec
checking: AF [[~ [E [AX [~ [[p121<=0 & 0<=p121]]] U [p46<=1 & 1<=p46]]] & [~ [A [[[[p107<=0 & 0<=p107] | [p78<=1 & 1<=p78]] & [p45<=1 & 1<=p45]] U EG [[p89<=0 & 0<=p89]]]] | [~ [E [~ [[[p105<=0 & 0<=p105] | [p75<=1 & 1<=p75]]] U ~ [[p99<=1 & 1<=p99]]]] | [EG [[p5<=1 & 1<=p5]] & [[p73<=0 & 0<=p73] & [p104<=1 & 1<=p104]]]]]]]
normalized: ~ [EG [~ [[[[[[[p104<=1 & 1<=p104] & [p73<=0 & 0<=p73]] & EG [[p5<=1 & 1<=p5]]] | ~ [E [~ [[[p75<=1 & 1<=p75] | [p105<=0 & 0<=p105]]] U ~ [[p99<=1 & 1<=p99]]]]] | ~ [[~ [EG [~ [EG [[p89<=0 & 0<=p89]]]]] & ~ [E [~ [EG [[p89<=0 & 0<=p89]]] U [~ [[[p45<=1 & 1<=p45] & [[p78<=1 & 1<=p78] | [p107<=0 & 0<=p107]]]] & ~ [EG [[p89<=0 & 0<=p89]]]]]]]]] & ~ [E [~ [EX [[p121<=0 & 0<=p121]]] U [p46<=1 & 1<=p46]]]]]]]
abstracting: (1<=p46)
states: 68,179,968 (7)
abstracting: (p46<=1)
states: 68,179,969 (7)
abstracting: (0<=p121)
states: 68,179,969 (7)
abstracting: (p121<=0)
states: 66,290,401 (7)
.abstracting: (0<=p89)
states: 68,179,969 (7)
abstracting: (p89<=0)
states: 67,931,137 (7)
.......................................
EG iterations: 39
abstracting: (0<=p107)
states: 68,179,969 (7)
abstracting: (p107<=0)
states: 66,290,401 (7)
abstracting: (1<=p78)
states: 248,832 (5)
abstracting: (p78<=1)
states: 68,179,969 (7)
abstracting: (1<=p45)
states: 34,089,984 (7)
abstracting: (p45<=1)
states: 68,179,969 (7)
abstracting: (0<=p89)
states: 68,179,969 (7)
abstracting: (p89<=0)
states: 67,931,137 (7)
.......................................
EG iterations: 39
abstracting: (0<=p89)
states: 68,179,969 (7)
abstracting: (p89<=0)
states: 67,931,137 (7)
.......................................
EG iterations: 39
........................................
EG iterations: 40
abstracting: (1<=p99)
states: 1,889,568 (6)
abstracting: (p99<=1)
states: 68,179,969 (7)
abstracting: (0<=p105)
states: 68,179,969 (7)
abstracting: (p105<=0)
states: 66,290,401 (7)
abstracting: (1<=p75)
states: 1,889,568 (6)
abstracting: (p75<=1)
states: 68,179,969 (7)
abstracting: (1<=p5)
states: 21,399,552 (7)
abstracting: (p5<=1)
states: 68,179,969 (7)
.................................
EG iterations: 33
abstracting: (0<=p73)
states: 68,179,969 (7)
abstracting: (p73<=0)
states: 67,340,161 (7)
abstracting: (1<=p104)
states: 58,732,128 (7)
abstracting: (p104<=1)
states: 68,179,969 (7)
EG iterations: 0
-> the formula is FALSE
FORMULA AutoFlight-PT-05a-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.464sec
checking: EF [[EX [[[[EG [[p61<=1 & 1<=p61]] & AF [[p0<=0 & 0<=p0]]] | EG [[p7<=1 & 1<=p7]]] & A [[[p68<=0 & 0<=p68] | [p10<=1 & 1<=p10]] U ~ [[p8<=1 & 1<=p8]]]]] & [EX [0<=0] | AX [[[A [[[p104<=0 & 0<=p104] | [p110<=1 & 1<=p110]] U [[p24<=0 & 0<=p24] | [p55<=1 & 1<=p55]]] | AX [[[p105<=0 & 0<=p105] | [p55<=1 & 1<=p55]]]] | [[p106<=0 & 0<=p106] | [p72<=1 & 1<=p72]]]]]]]
normalized: E [true U [[~ [EX [~ [[[[p72<=1 & 1<=p72] | [p106<=0 & 0<=p106]] | [~ [EX [~ [[[p55<=1 & 1<=p55] | [p105<=0 & 0<=p105]]]]] | [~ [EG [~ [[[p55<=1 & 1<=p55] | [p24<=0 & 0<=p24]]]]] & ~ [E [~ [[[p55<=1 & 1<=p55] | [p24<=0 & 0<=p24]]] U [~ [[[p110<=1 & 1<=p110] | [p104<=0 & 0<=p104]]] & ~ [[[p55<=1 & 1<=p55] | [p24<=0 & 0<=p24]]]]]]]]]]]] | EX [0<=0]] & EX [[[~ [EG [[p8<=1 & 1<=p8]]] & ~ [E [[p8<=1 & 1<=p8] U [~ [[[p10<=1 & 1<=p10] | [p68<=0 & 0<=p68]]] & [p8<=1 & 1<=p8]]]]] & [EG [[p7<=1 & 1<=p7]] | [~ [EG [~ [[p0<=0 & 0<=p0]]]] & EG [[p61<=1 & 1<=p61]]]]]]]]
abstracting: (1<=p61)
states: 248,832 (5)
abstracting: (p61<=1)
states: 68,179,969 (7)
......................
EG iterations: 22
abstracting: (0<=p0)
states: 68,179,969 (7)
abstracting: (p0<=0)
states: 68,179,968 (7)
..
EG iterations: 2
abstracting: (1<=p7)
states: 68,179,968 (7)
abstracting: (p7<=1)
states: 68,179,969 (7)
.
EG iterations: 1
abstracting: (1<=p8)
states: 23,659,776 (7)
abstracting: (p8<=1)
states: 68,179,969 (7)
abstracting: (0<=p68)
states: 68,179,969 (7)
abstracting: (p68<=0)
states: 67,931,137 (7)
abstracting: (1<=p10)
states: 23,659,776 (7)
abstracting: (p10<=1)
states: 68,179,969 (7)
abstracting: (1<=p8)
states: 23,659,776 (7)
abstracting: (p8<=1)
states: 68,179,969 (7)
abstracting: (1<=p8)
states: 23,659,776 (7)
abstracting: (p8<=1)
states: 68,179,969 (7)
...............................
EG iterations: 31
.abstracting: (0<=0)
states: 68,179,969 (7)
.abstracting: (0<=p24)
states: 68,179,969 (7)
abstracting: (p24<=0)
states: 44,286,913 (7)
abstracting: (1<=p55)
states: 248,832 (5)
abstracting: (p55<=1)
states: 68,179,969 (7)
abstracting: (0<=p104)
states: 68,179,969 (7)
abstracting: (p104<=0)
states: 9,447,841 (6)
abstracting: (1<=p110)
states: 1,889,568 (6)
abstracting: (p110<=1)
states: 68,179,969 (7)
abstracting: (0<=p24)
states: 68,179,969 (7)
abstracting: (p24<=0)
states: 44,286,913 (7)
abstracting: (1<=p55)
states: 248,832 (5)
abstracting: (p55<=1)
states: 68,179,969 (7)
abstracting: (0<=p24)
states: 68,179,969 (7)
abstracting: (p24<=0)
states: 44,286,913 (7)
abstracting: (1<=p55)
states: 248,832 (5)
abstracting: (p55<=1)
states: 68,179,969 (7)
............................................
EG iterations: 44
abstracting: (0<=p105)
states: 68,179,969 (7)
abstracting: (p105<=0)
states: 66,290,401 (7)
abstracting: (1<=p55)
states: 248,832 (5)
abstracting: (p55<=1)
states: 68,179,969 (7)
.abstracting: (0<=p106)
states: 68,179,969 (7)
abstracting: (p106<=0)
states: 66,290,401 (7)
abstracting: (1<=p72)
states: 559,872 (5)
abstracting: (p72<=1)
states: 68,179,969 (7)
.-> the formula is TRUE
FORMULA AutoFlight-PT-05a-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.482sec
checking: EF [[A [[[EX [0<=0] & EF [[[p32<=0 & 0<=p32] | [p111<=1 & 1<=p111]]]] | [p69<=0 & 0<=p69]] U [~ [[[p92<=0 & 0<=p92] | A [[[p53<=0 & 0<=p53] | [p100<=1 & 1<=p100]] U [p91<=1 & 1<=p91]]]] & AF [[[p39<=0 & 0<=p39] | [p125<=1 & 1<=p125]]]]] & E [EG [[[p109<=1 & 1<=p109] & [[p102<=1 & 1<=p102] | [p9<=1 & 1<=p9]]]] U [[AG [[p93<=1 & 1<=p93]] | [~ [[[p41<=0 & 0<=p41] | [p118<=1 & 1<=p118]]] & [[[p53<=0 & 0<=p53] | [p61<=1 & 1<=p61]] | [[p28<=0 & 0<=p28] | [p55<=1 & 1<=p55]]]]] & A [[[p125<=0 & 0<=p125] | [p2<=1 & 1<=p2]] U [[p35<=1 & 1<=p35] & [p24<=1 & 1<=p24]]]]]]]
normalized: E [true U [E [EG [[[[p9<=1 & 1<=p9] | [p102<=1 & 1<=p102]] & [p109<=1 & 1<=p109]]] U [[~ [EG [~ [[[p24<=1 & 1<=p24] & [p35<=1 & 1<=p35]]]]] & ~ [E [~ [[[p24<=1 & 1<=p24] & [p35<=1 & 1<=p35]]] U [~ [[[p2<=1 & 1<=p2] | [p125<=0 & 0<=p125]]] & ~ [[[p24<=1 & 1<=p24] & [p35<=1 & 1<=p35]]]]]]] & [[[[[p55<=1 & 1<=p55] | [p28<=0 & 0<=p28]] | [[p61<=1 & 1<=p61] | [p53<=0 & 0<=p53]]] & ~ [[[p118<=1 & 1<=p118] | [p41<=0 & 0<=p41]]]] | ~ [E [true U ~ [[p93<=1 & 1<=p93]]]]]]] & [~ [EG [~ [[~ [EG [~ [[[p125<=1 & 1<=p125] | [p39<=0 & 0<=p39]]]]] & ~ [[[~ [EG [~ [[p91<=1 & 1<=p91]]]] & ~ [E [~ [[p91<=1 & 1<=p91]] U [~ [[[p100<=1 & 1<=p100] | [p53<=0 & 0<=p53]]] & ~ [[p91<=1 & 1<=p91]]]]]] | [p92<=0 & 0<=p92]]]]]]] & ~ [E [~ [[~ [EG [~ [[[p125<=1 & 1<=p125] | [p39<=0 & 0<=p39]]]]] & ~ [[[~ [EG [~ [[p91<=1 & 1<=p91]]]] & ~ [E [~ [[p91<=1 & 1<=p91]] U [~ [[[p100<=1 & 1<=p100] | [p53<=0 & 0<=p53]]] & ~ [[p91<=1 & 1<=p91]]]]]] | [p92<=0 & 0<=p92]]]]] U [~ [[[p69<=0 & 0<=p69] | [E [true U [[p111<=1 & 1<=p111] | [p32<=0 & 0<=p32]]] & EX [0<=0]]]] & ~ [[~ [EG [~ [[[p125<=1 & 1<=p125] | [p39<=0 & 0<=p39]]]]] & ~ [[[~ [EG [~ [[p91<=1 & 1<=p91]]]] & ~ [E [~ [[p91<=1 & 1<=p91]] U [~ [[[p100<=1 & 1<=p100] | [p53<=0 & 0<=p53]]] & ~ [[p91<=1 & 1<=p91]]]]]] | [p92<=0 & 0<=p92]]]]]]]]]]]
abstracting: (0<=p92)
states: 68,179,969 (7)
abstracting: (p92<=0)
states: 67,931,137 (7)
abstracting: (1<=p91)
states: 248,832 (5)
abstracting: (p91<=1)
states: 68,179,969 (7)
abstracting: (0<=p53)
states: 68,179,969 (7)
abstracting: (p53<=0)
states: 67,931,137 (7)
abstracting: (1<=p100)
states: 1,889,568 (6)
abstracting: (p100<=1)
states: 68,179,969 (7)
abstracting: (1<=p91)
states: 248,832 (5)
abstracting: (p91<=1)
states: 68,179,969 (7)
abstracting: (1<=p91)
states: 248,832 (5)
abstracting: (p91<=1)
states: 68,179,969 (7)
.....................................
EG iterations: 37
abstracting: (0<=p39)
states: 68,179,969 (7)
abstracting: (p39<=0)
states: 34,089,985 (7)
abstracting: (1<=p125)
states: 58,732,128 (7)
abstracting: (p125<=1)
states: 68,179,969 (7)
..........................
EG iterations: 26
abstracting: (0<=0)
states: 68,179,969 (7)
.abstracting: (0<=p32)
states: 68,179,969 (7)
abstracting: (p32<=0)
states: 44,284,321 (7)
abstracting: (1<=p111)
states: 1,889,568 (6)
abstracting: (p111<=1)
states: 68,179,969 (7)
abstracting: (0<=p69)
states: 68,179,969 (7)
abstracting: (p69<=0)
states: 67,931,137 (7)
abstracting: (0<=p92)
states: 68,179,969 (7)
abstracting: (p92<=0)
states: 67,931,137 (7)
abstracting: (1<=p91)
states: 248,832 (5)
abstracting: (p91<=1)
states: 68,179,969 (7)
abstracting: (0<=p53)
states: 68,179,969 (7)
abstracting: (p53<=0)
states: 67,931,137 (7)
abstracting: (1<=p100)
states: 1,889,568 (6)
abstracting: (p100<=1)
states: 68,179,969 (7)
abstracting: (1<=p91)
states: 248,832 (5)
abstracting: (p91<=1)
states: 68,179,969 (7)
abstracting: (1<=p91)
states: 248,832 (5)
abstracting: (p91<=1)
states: 68,179,969 (7)
.....................................
EG iterations: 37
abstracting: (0<=p39)
states: 68,179,969 (7)
abstracting: (p39<=0)
states: 34,089,985 (7)
abstracting: (1<=p125)
states: 58,732,128 (7)
abstracting: (p125<=1)
states: 68,179,969 (7)
..........................
EG iterations: 26
abstracting: (0<=p92)
states: 68,179,969 (7)
abstracting: (p92<=0)
states: 67,931,137 (7)
abstracting: (1<=p91)
states: 248,832 (5)
abstracting: (p91<=1)
states: 68,179,969 (7)
abstracting: (0<=p53)
states: 68,179,969 (7)
abstracting: (p53<=0)
states: 67,931,137 (7)
abstracting: (1<=p100)
states: 1,889,568 (6)
abstracting: (p100<=1)
states: 68,179,969 (7)
abstracting: (1<=p91)
states: 248,832 (5)
abstracting: (p91<=1)
states: 68,179,969 (7)
abstracting: (1<=p91)
states: 248,832 (5)
abstracting: (p91<=1)
states: 68,179,969 (7)
.....................................
EG iterations: 37
abstracting: (0<=p39)
states: 68,179,969 (7)
abstracting: (p39<=0)
states: 34,089,985 (7)
abstracting: (1<=p125)
states: 58,732,128 (7)
abstracting: (p125<=1)
states: 68,179,969 (7)
..........................
EG iterations: 26
EG iterations: 0
abstracting: (1<=p93)
states: 373,248 (5)
abstracting: (p93<=1)
states: 68,179,969 (7)
abstracting: (0<=p41)
states: 68,179,969 (7)
abstracting: (p41<=0)
states: 34,089,985 (7)
abstracting: (1<=p118)
states: 1,889,568 (6)
abstracting: (p118<=1)
states: 68,179,969 (7)
abstracting: (0<=p53)
states: 68,179,969 (7)
abstracting: (p53<=0)
states: 67,931,137 (7)
abstracting: (1<=p61)
states: 248,832 (5)
abstracting: (p61<=1)
states: 68,179,969 (7)
abstracting: (0<=p28)
states: 68,179,969 (7)
abstracting: (p28<=0)
states: 1
abstracting: (1<=p55)
states: 248,832 (5)
abstracting: (p55<=1)
states: 68,179,969 (7)
abstracting: (1<=p35)
states: 68,179,968 (7)
abstracting: (p35<=1)
states: 68,179,969 (7)
abstracting: (1<=p24)
states: 23,893,056 (7)
abstracting: (p24<=1)
states: 68,179,969 (7)
abstracting: (0<=p125)
states: 68,179,969 (7)
abstracting: (p125<=0)
states: 9,447,841 (6)
abstracting: (1<=p2)
states: 20,984,832 (7)
abstracting: (p2<=1)
states: 68,179,969 (7)
abstracting: (1<=p35)
states: 68,179,968 (7)
abstracting: (p35<=1)
states: 68,179,969 (7)
abstracting: (1<=p24)
states: 23,893,056 (7)
abstracting: (p24<=1)
states: 68,179,969 (7)
abstracting: (1<=p35)
states: 68,179,968 (7)
abstracting: (p35<=1)
states: 68,179,969 (7)
abstracting: (1<=p24)
states: 23,893,056 (7)
abstracting: (p24<=1)
states: 68,179,969 (7)
..............................
EG iterations: 30
abstracting: (1<=p109)
states: 1,889,568 (6)
abstracting: (p109<=1)
states: 68,179,969 (7)
abstracting: (1<=p102)
states: 1,889,568 (6)
abstracting: (p102<=1)
states: 68,179,969 (7)
abstracting: (1<=p9)
states: 20,860,416 (7)
abstracting: (p9<=1)
states: 68,179,969 (7)
.........................
EG iterations: 25
-> the formula is FALSE
FORMULA AutoFlight-PT-05a-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.322sec
totally nodes used: 4424022 (4.4e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 3907380 9595153 13502533
used/not used/entry size/cache size: 12505962 54602902 16 1024MB
basic ops cache: hits/miss/sum: 370209 1001241 1371450
used/not used/entry size/cache size: 1925230 14851986 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: 5214 14393 19607
used/not used/entry size/cache size: 14380 8374228 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 62977699
1 3864046
2 243538
3 21578
4 1859
5 134
6 10
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 8.956sec
BK_STOP 1678689079900
--------------------
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 CTLCardinality -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:2111 (20), effective:296 (2)
initing FirstDep: 0m 0.000sec
iterations count:1757 (16), effective:204 (1)
iterations count:865 (8), effective:87 (0)
iterations count:996 (9), effective:108 (1)
iterations count:852 (8), effective:79 (0)
iterations count:129 (1), effective:3 (0)
iterations count:106 (1), effective:1 (0)
iterations count:982 (9), effective:108 (1)
iterations count:2193 (20), effective:264 (2)
iterations count:191 (1), effective:1 (0)
iterations count:861 (8), effective:84 (0)
iterations count:965 (9), effective:106 (1)
iterations count:108 (1), effective:1 (0)
iterations count:112 (1), effective:3 (0)
iterations count:290 (2), effective:19 (0)
iterations count:106 (1), effective:1 (0)
iterations count:266 (2), effective:10 (0)
iterations count:950 (9), effective:109 (1)
iterations count:108 (1), effective:2 (0)
iterations count:1702 (16), effective:195 (1)
iterations count:950 (9), effective:109 (1)
iterations count:108 (1), effective:2 (0)
iterations count:1702 (16), effective:195 (1)
iterations count:1718 (16), effective:203 (1)
iterations count:950 (9), effective:109 (1)
iterations count:108 (1), effective:2 (0)
iterations count:1702 (16), effective:195 (1)
iterations count:105 (1), effective:0 (0)
iterations count:106 (1), effective:1 (0)
iterations count:105 (1), effective:0 (0)
iterations count:199 (1), effective:5 (0)
iterations count:147 (1), effective:9 (0)
iterations count:802 (7), effective:88 (0)
iterations count:824 (7), effective:91 (0)
iterations count:1063 (10), effective:130 (1)
iterations count:824 (7), effective:91 (0)
iterations count:824 (7), effective:91 (0)
iterations count:115 (1), effective:3 (0)
iterations count:161 (1), effective:9 (0)
iterations count:105 (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-05a"
export BK_EXAMINATION="CTLCardinality"
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-05a, examination is CTLCardinality"
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-167813599000433"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-05a.tgz
mv AutoFlight-PT-05a execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;