About the Execution of Marcie+red for DiscoveryGPU-PT-06a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5877.556 | 21489.00 | 28120.00 | 697.40 | FTFFTTFFFTFFTFFF | 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.r138-smll-167819420100282.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is DiscoveryGPU-PT-06a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819420100282
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 7.5K Feb 25 13:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 13:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 13:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 13:32 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:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 13:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 13:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 13:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 13:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:59 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 22K 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 DiscoveryGPU-PT-06a-CTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678735952788
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=DiscoveryGPU-PT-06a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 19:32:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 19:32:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:32:36] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2023-03-13 19:32:36] [INFO ] Transformed 63 places.
[2023-03-13 19:32:36] [INFO ] Transformed 85 transitions.
[2023-03-13 19:32:36] [INFO ] Found NUPN structural information;
[2023-03-13 19:32:36] [INFO ] Parsed PT model containing 63 places and 85 transitions and 273 arcs in 401 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-06a-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 85/85 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 62 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 84
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 62 transition count 78
Applied a total of 8 rules in 34 ms. Remains 62 /63 variables (removed 1) and now considering 78/85 (removed 7) transitions.
// Phase 1: matrix 78 rows 62 cols
[2023-03-13 19:32:36] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-13 19:32:36] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-13 19:32:36] [INFO ] Invariant cache hit.
[2023-03-13 19:32:37] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-13 19:32:37] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2023-03-13 19:32:37] [INFO ] Invariant cache hit.
[2023-03-13 19:32:37] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 78/85 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 671 ms. Remains : 62/63 places, 78/85 transitions.
Support contains 54 out of 62 places after structural reductions.
[2023-03-13 19:32:37] [INFO ] Flatten gal took : 39 ms
[2023-03-13 19:32:37] [INFO ] Flatten gal took : 25 ms
[2023-03-13 19:32:37] [INFO ] Input system was already deterministic with 78 transitions.
Incomplete random walk after 10000 steps, including 156 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 67) seen :66
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-13 19:32:38] [INFO ] Invariant cache hit.
[2023-03-13 19:32:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 19:32:38] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2023-03-13 19:32:38] [INFO ] Flatten gal took : 15 ms
[2023-03-13 19:32:38] [INFO ] Flatten gal took : 14 ms
[2023-03-13 19:32:38] [INFO ] Input system was already deterministic with 78 transitions.
Computed a total of 9 stabilizing places and 7 stable transitions
Graph (complete) has 171 edges and 62 vertex of which 57 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 52 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 52 transition count 68
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 48 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 48 transition count 64
Applied a total of 28 rules in 18 ms. Remains 48 /62 variables (removed 14) and now considering 64/78 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 48/62 places, 64/78 transitions.
[2023-03-13 19:32:38] [INFO ] Flatten gal took : 7 ms
[2023-03-13 19:32:38] [INFO ] Flatten gal took : 10 ms
[2023-03-13 19:32:38] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 52 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 52 transition count 68
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 49 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 49 transition count 65
Applied a total of 26 rules in 12 ms. Remains 49 /62 variables (removed 13) and now considering 65/78 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 49/62 places, 65/78 transitions.
[2023-03-13 19:32:38] [INFO ] Flatten gal took : 7 ms
[2023-03-13 19:32:38] [INFO ] Flatten gal took : 8 ms
[2023-03-13 19:32:38] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 74
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 54 transition count 70
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 54 transition count 70
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 51 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 51 transition count 67
Applied a total of 22 rules in 12 ms. Remains 51 /62 variables (removed 11) and now considering 67/78 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 51/62 places, 67/78 transitions.
[2023-03-13 19:32:38] [INFO ] Flatten gal took : 7 ms
[2023-03-13 19:32:38] [INFO ] Flatten gal took : 8 ms
[2023-03-13 19:32:38] [INFO ] Input system was already deterministic with 67 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Graph (complete) has 171 edges and 62 vertex of which 59 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 62 edges and 56 vertex of which 48 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Graph (trivial) has 48 edges and 48 vertex of which 24 / 48 are part of one of the 12 SCC in 4 ms
Free SCC test removed 12 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 36 transition count 60
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 29 place count 30 transition count 48
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 32 place count 27 transition count 42
Iterating global reduction 2 with 3 rules applied. Total rules applied 35 place count 27 transition count 42
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 25 transition count 38
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 25 transition count 38
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 23 transition count 34
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 23 transition count 34
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 21 transition count 32
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 21 transition count 32
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 21 transition count 30
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 21 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 20 transition count 29
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 55 place count 16 transition count 25
Applied a total of 55 rules in 41 ms. Remains 16 /62 variables (removed 46) and now considering 25/78 (removed 53) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 16/62 places, 25/78 transitions.
[2023-03-13 19:32:38] [INFO ] Flatten gal took : 2 ms
[2023-03-13 19:32:38] [INFO ] Flatten gal took : 2 ms
[2023-03-13 19:32:38] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 74
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 54 transition count 70
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 54 transition count 70
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 52 transition count 68
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 52 transition count 68
Applied a total of 20 rules in 12 ms. Remains 52 /62 variables (removed 10) and now considering 68/78 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 52/62 places, 68/78 transitions.
[2023-03-13 19:32:38] [INFO ] Flatten gal took : 7 ms
[2023-03-13 19:32:38] [INFO ] Flatten gal took : 7 ms
[2023-03-13 19:32:38] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 74
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 55 transition count 71
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 55 transition count 71
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 52 transition count 68
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 52 transition count 68
Applied a total of 20 rules in 11 ms. Remains 52 /62 variables (removed 10) and now considering 68/78 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 52/62 places, 68/78 transitions.
[2023-03-13 19:32:38] [INFO ] Flatten gal took : 6 ms
[2023-03-13 19:32:38] [INFO ] Flatten gal took : 8 ms
[2023-03-13 19:32:38] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 54 transition count 70
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 54 transition count 70
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 51 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 51 transition count 67
Applied a total of 22 rules in 12 ms. Remains 51 /62 variables (removed 11) and now considering 67/78 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 51/62 places, 67/78 transitions.
[2023-03-13 19:32:38] [INFO ] Flatten gal took : 6 ms
[2023-03-13 19:32:38] [INFO ] Flatten gal took : 7 ms
[2023-03-13 19:32:38] [INFO ] Input system was already deterministic with 67 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Graph (complete) has 171 edges and 62 vertex of which 57 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 57 transition count 69
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 53 transition count 69
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 49 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 49 transition count 65
Applied a total of 17 rules in 18 ms. Remains 49 /62 variables (removed 13) and now considering 65/78 (removed 13) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 49/62 places, 65/78 transitions.
[2023-03-13 19:32:38] [INFO ] Flatten gal took : 6 ms
[2023-03-13 19:32:38] [INFO ] Flatten gal took : 7 ms
[2023-03-13 19:32:38] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 52 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 52 transition count 68
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 49 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 49 transition count 65
Applied a total of 26 rules in 9 ms. Remains 49 /62 variables (removed 13) and now considering 65/78 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 49/62 places, 65/78 transitions.
[2023-03-13 19:32:38] [INFO ] Flatten gal took : 6 ms
[2023-03-13 19:32:38] [INFO ] Flatten gal took : 6 ms
[2023-03-13 19:32:38] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 52 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 52 transition count 68
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 48 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 48 transition count 64
Applied a total of 28 rules in 11 ms. Remains 48 /62 variables (removed 14) and now considering 64/78 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 48/62 places, 64/78 transitions.
[2023-03-13 19:32:38] [INFO ] Flatten gal took : 5 ms
[2023-03-13 19:32:38] [INFO ] Flatten gal took : 7 ms
[2023-03-13 19:32:38] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 59 transition count 75
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 59 transition count 75
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 57 transition count 73
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 55 transition count 71
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 55 transition count 71
Applied a total of 14 rules in 11 ms. Remains 55 /62 variables (removed 7) and now considering 71/78 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 55/62 places, 71/78 transitions.
[2023-03-13 19:32:38] [INFO ] Flatten gal took : 6 ms
[2023-03-13 19:32:38] [INFO ] Flatten gal took : 6 ms
[2023-03-13 19:32:38] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 55 transition count 71
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 55 transition count 71
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 53 transition count 69
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 53 transition count 69
Applied a total of 18 rules in 8 ms. Remains 53 /62 variables (removed 9) and now considering 69/78 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 53/62 places, 69/78 transitions.
[2023-03-13 19:32:38] [INFO ] Flatten gal took : 6 ms
[2023-03-13 19:32:38] [INFO ] Flatten gal took : 6 ms
[2023-03-13 19:32:38] [INFO ] Input system was already deterministic with 69 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 52 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 52 transition count 68
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 48 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 48 transition count 64
Applied a total of 28 rules in 7 ms. Remains 48 /62 variables (removed 14) and now considering 64/78 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 48/62 places, 64/78 transitions.
[2023-03-13 19:32:39] [INFO ] Flatten gal took : 6 ms
[2023-03-13 19:32:39] [INFO ] Flatten gal took : 6 ms
[2023-03-13 19:32:39] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 74
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 55 transition count 71
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 55 transition count 71
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 53 transition count 69
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 53 transition count 69
Applied a total of 18 rules in 6 ms. Remains 53 /62 variables (removed 9) and now considering 69/78 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 53/62 places, 69/78 transitions.
[2023-03-13 19:32:39] [INFO ] Flatten gal took : 5 ms
[2023-03-13 19:32:39] [INFO ] Flatten gal took : 6 ms
[2023-03-13 19:32:39] [INFO ] Input system was already deterministic with 69 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Graph (complete) has 171 edges and 62 vertex of which 57 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 57 transition count 67
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 51 transition count 67
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 18 place count 46 transition count 62
Iterating global reduction 0 with 5 rules applied. Total rules applied 23 place count 46 transition count 62
Applied a total of 23 rules in 12 ms. Remains 46 /62 variables (removed 16) and now considering 62/78 (removed 16) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 46/62 places, 62/78 transitions.
[2023-03-13 19:32:39] [INFO ] Flatten gal took : 5 ms
[2023-03-13 19:32:39] [INFO ] Flatten gal took : 5 ms
[2023-03-13 19:32:39] [INFO ] Input system was already deterministic with 62 transitions.
[2023-03-13 19:32:39] [INFO ] Flatten gal took : 7 ms
[2023-03-13 19:32:39] [INFO ] Flatten gal took : 7 ms
[2023-03-13 19:32:39] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2023-03-13 19:32:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 62 places, 78 transitions and 248 arcs took 1 ms.
Total runtime 3094 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: 62 NrTr: 78 NrArc: 248)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 3.440sec
RS generation: 0m 0.078sec
-> reachability set: #nodes 2525 (2.5e+03) #states 1,756,921 (6)
starting MCC model checker
--------------------------
checking: AX [EG [[[p37<=0 & 0<=p37] | [p60<=0 & 0<=p60]]]]
normalized: ~ [EX [~ [EG [[[p37<=0 & 0<=p37] | [p60<=0 & 0<=p60]]]]]]
abstracting: (0<=p60)
states: 1,756,921 (6)
abstracting: (p60<=0)
states: 1
abstracting: (0<=p37)
states: 1,756,921 (6)
abstracting: (p37<=0)
states: 1,597,201 (6)
.
EG iterations: 1
.-> the formula is TRUE
FORMULA DiscoveryGPU-PT-06a-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.151sec
checking: ~ [E [[p53<=1 & 1<=p53] U ~ [EG [AG [AF [[[p17<=1 & 1<=p17] & [p60<=1 & 1<=p60]]]]]]]]
normalized: ~ [E [[p53<=1 & 1<=p53] U ~ [EG [~ [E [true U EG [~ [[[p60<=1 & 1<=p60] & [p17<=1 & 1<=p17]]]]]]]]]]
abstracting: (1<=p17)
states: 159,720 (5)
abstracting: (p17<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p53)
states: 161,051 (5)
abstracting: (p53<=1)
states: 1,756,921 (6)
-> the formula is FALSE
FORMULA DiscoveryGPU-PT-06a-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.086sec
checking: AG [AF [[[p31<=0 & 0<=p31] & [AF [[p11<=0 & 0<=p11]] | [AG [[p16<=1 & 1<=p16]] | [p55<=1 & 1<=p55]]]]]]
normalized: ~ [E [true U EG [~ [[[[[p55<=1 & 1<=p55] | ~ [E [true U ~ [[p16<=1 & 1<=p16]]]]] | ~ [EG [~ [[p11<=0 & 0<=p11]]]]] & [p31<=0 & 0<=p31]]]]]]
abstracting: (0<=p31)
states: 1,756,921 (6)
abstracting: (p31<=0)
states: 1,597,201 (6)
abstracting: (0<=p11)
states: 1,756,921 (6)
abstracting: (p11<=0)
states: 1,597,201 (6)
.................
EG iterations: 17
abstracting: (1<=p16)
states: 159,720 (5)
abstracting: (p16<=1)
states: 1,756,921 (6)
abstracting: (1<=p55)
states: 161,051 (5)
abstracting: (p55<=1)
states: 1,756,921 (6)
.................
EG iterations: 17
-> the formula is FALSE
FORMULA DiscoveryGPU-PT-06a-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.691sec
checking: A [~ [AX [~ [[[[1<=p54 & p54<=1] & [p60<=1 & 1<=p60]] | [[p28<=1 & 1<=p28] & [p61<=1 & 1<=p61]]]]]] U EF [[[p4<=1 & 1<=p4] & EG [AG [[p8<=1 & 1<=p8]]]]]]
normalized: [~ [EG [~ [E [true U [EG [~ [E [true U ~ [[p8<=1 & 1<=p8]]]]] & [p4<=1 & 1<=p4]]]]]] & ~ [E [~ [E [true U [EG [~ [E [true U ~ [[p8<=1 & 1<=p8]]]]] & [p4<=1 & 1<=p4]]]] U [~ [E [true U [EG [~ [E [true U ~ [[p8<=1 & 1<=p8]]]]] & [p4<=1 & 1<=p4]]]] & ~ [EX [[[[p60<=1 & 1<=p60] & [1<=p54 & p54<=1]] | [[p28<=1 & 1<=p28] & [p61<=1 & 1<=p61]]]]]]]]]
abstracting: (1<=p61)
states: 1,756,920 (6)
abstracting: (p61<=1)
states: 1,756,921 (6)
abstracting: (1<=p28)
states: 159,720 (5)
abstracting: (p28<=1)
states: 1,756,921 (6)
abstracting: (p54<=1)
states: 1,756,921 (6)
abstracting: (1<=p54)
states: 161,051 (5)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
.abstracting: (1<=p4)
states: 159,720 (5)
abstracting: (p4<=1)
states: 1,756,921 (6)
abstracting: (1<=p8)
states: 159,720 (5)
abstracting: (p8<=1)
states: 1,756,921 (6)
.
EG iterations: 1
abstracting: (1<=p4)
states: 159,720 (5)
abstracting: (p4<=1)
states: 1,756,921 (6)
abstracting: (1<=p8)
states: 159,720 (5)
abstracting: (p8<=1)
states: 1,756,921 (6)
.
EG iterations: 1
abstracting: (1<=p4)
states: 159,720 (5)
abstracting: (p4<=1)
states: 1,756,921 (6)
abstracting: (1<=p8)
states: 159,720 (5)
abstracting: (p8<=1)
states: 1,756,921 (6)
.
EG iterations: 1
EG iterations: 0
-> the formula is FALSE
FORMULA DiscoveryGPU-PT-06a-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.071sec
checking: EF [AX [AG [[EX [[[p50<=1 & 1<=p50] & [p60<=1 & 1<=p60]]] & [[p18<=0 & 0<=p18] & [EX [[[p40<=1 & 1<=p40] & [p60<=1 & 1<=p60]]] | EG [[p57<=1 & 1<=p57]]]]]]]]
normalized: E [true U ~ [EX [E [true U ~ [[[[EG [[p57<=1 & 1<=p57]] | EX [[[p60<=1 & 1<=p60] & [p40<=1 & 1<=p40]]]] & [p18<=0 & 0<=p18]] & EX [[[p60<=1 & 1<=p60] & [p50<=1 & 1<=p50]]]]]]]]]
abstracting: (1<=p50)
states: 161,051 (5)
abstracting: (p50<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
.abstracting: (0<=p18)
states: 1,756,921 (6)
abstracting: (p18<=0)
states: 1,597,201 (6)
abstracting: (1<=p40)
states: 159,720 (5)
abstracting: (p40<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
.abstracting: (1<=p57)
states: 161,051 (5)
abstracting: (p57<=1)
states: 1,756,921 (6)
.................
EG iterations: 17
.-> the formula is TRUE
FORMULA DiscoveryGPU-PT-06a-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.330sec
checking: AG [EF [[AG [[[p10<=0 & 0<=p10] | [p60<=0 & 0<=p60]]] & [[EX [[p11<=0 & 0<=p11]] | [EG [[[p5<=1 & 1<=p5] & [p60<=1 & 1<=p60]]] | [p58<=0 & 0<=p58]]] | [[p60<=0 & 0<=p60] | [[p33<=0 & 0<=p33] | [p61<=0 & 0<=p61]]]]]]]
normalized: ~ [E [true U ~ [E [true U [~ [E [true U ~ [[[p60<=0 & 0<=p60] | [p10<=0 & 0<=p10]]]]] & [[[[p33<=0 & 0<=p33] | [p61<=0 & 0<=p61]] | [p60<=0 & 0<=p60]] | [[EG [[[p60<=1 & 1<=p60] & [p5<=1 & 1<=p5]]] | [p58<=0 & 0<=p58]] | EX [[p11<=0 & 0<=p11]]]]]]]]]
abstracting: (0<=p11)
states: 1,756,921 (6)
abstracting: (p11<=0)
states: 1,597,201 (6)
.abstracting: (0<=p58)
states: 1,756,921 (6)
abstracting: (p58<=0)
states: 1,595,870 (6)
abstracting: (1<=p5)
states: 159,720 (5)
abstracting: (p5<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
.................
EG iterations: 17
abstracting: (0<=p60)
states: 1,756,921 (6)
abstracting: (p60<=0)
states: 1
abstracting: (0<=p61)
states: 1,756,921 (6)
abstracting: (p61<=0)
states: 1
abstracting: (0<=p33)
states: 1,756,921 (6)
abstracting: (p33<=0)
states: 1,597,201 (6)
abstracting: (0<=p10)
states: 1,756,921 (6)
abstracting: (p10<=0)
states: 1,597,201 (6)
abstracting: (0<=p60)
states: 1,756,921 (6)
abstracting: (p60<=0)
states: 1
-> the formula is TRUE
FORMULA DiscoveryGPU-PT-06a-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.450sec
checking: [AX [EX [[EX [EG [[[p9<=1 & 1<=p9] & [p60<=1 & 1<=p60]]]] & [[p58<=1 & 1<=p58] & [p60<=1 & 1<=p60]]]]] & [EF [[AG [[p52<=1 & 1<=p52]] | EX [[[p22<=1 & 1<=p22] & [p60<=1 & 1<=p60]]]]] & AG [EX [AG [[[p22<=0 & 0<=p22] | [p60<=0 & 0<=p60]]]]]]]
normalized: [[~ [E [true U ~ [EX [~ [E [true U ~ [[[p60<=0 & 0<=p60] | [p22<=0 & 0<=p22]]]]]]]]] & E [true U [EX [[[p60<=1 & 1<=p60] & [p22<=1 & 1<=p22]]] | ~ [E [true U ~ [[p52<=1 & 1<=p52]]]]]]] & ~ [EX [~ [EX [[[[p60<=1 & 1<=p60] & [p58<=1 & 1<=p58]] & EX [EG [[[p60<=1 & 1<=p60] & [p9<=1 & 1<=p9]]]]]]]]]]
abstracting: (1<=p9)
states: 159,720 (5)
abstracting: (p9<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
.................
EG iterations: 17
.abstracting: (1<=p58)
states: 161,051 (5)
abstracting: (p58<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
..abstracting: (1<=p52)
states: 161,051 (5)
abstracting: (p52<=1)
states: 1,756,921 (6)
abstracting: (1<=p22)
states: 159,720 (5)
abstracting: (p22<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
.abstracting: (0<=p22)
states: 1,756,921 (6)
abstracting: (p22<=0)
states: 1,597,201 (6)
abstracting: (0<=p60)
states: 1,756,921 (6)
abstracting: (p60<=0)
states: 1
.-> the formula is FALSE
FORMULA DiscoveryGPU-PT-06a-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.668sec
checking: A [EF [[[[p59<=1 & 1<=p59] & [p60<=1 & 1<=p60]] | [E [[[p58<=1 & 1<=p58] & [p60<=1 & 1<=p60]] U [p24<=1 & 1<=p24]] & [[p13<=1 & 1<=p13] & [p61<=1 & 1<=p61]]]]] U AG [~ [[[p22<=1 & 1<=p22] & [p60<=1 & 1<=p60]]]]]
normalized: [~ [EG [E [true U [[p60<=1 & 1<=p60] & [p22<=1 & 1<=p22]]]]] & ~ [E [E [true U [[p60<=1 & 1<=p60] & [p22<=1 & 1<=p22]]] U [~ [E [true U [[[[p61<=1 & 1<=p61] & [p13<=1 & 1<=p13]] & E [[[p60<=1 & 1<=p60] & [p58<=1 & 1<=p58]] U [p24<=1 & 1<=p24]]] | [[p60<=1 & 1<=p60] & [p59<=1 & 1<=p59]]]]] & E [true U [[p60<=1 & 1<=p60] & [p22<=1 & 1<=p22]]]]]]]
abstracting: (1<=p22)
states: 159,720 (5)
abstracting: (p22<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p59)
states: 161,051 (5)
abstracting: (p59<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p24)
states: 159,720 (5)
abstracting: (p24<=1)
states: 1,756,921 (6)
abstracting: (1<=p58)
states: 161,051 (5)
abstracting: (p58<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p13)
states: 159,720 (5)
abstracting: (p13<=1)
states: 1,756,921 (6)
abstracting: (1<=p61)
states: 1,756,920 (6)
abstracting: (p61<=1)
states: 1,756,921 (6)
abstracting: (1<=p22)
states: 159,720 (5)
abstracting: (p22<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p22)
states: 159,720 (5)
abstracting: (p22<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
..................
EG iterations: 18
-> the formula is FALSE
FORMULA DiscoveryGPU-PT-06a-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.631sec
checking: [AF [AG [[~ [E [[p21<=1 & 1<=p21] U [[p6<=1 & 1<=p6] & [p60<=1 & 1<=p60]]]] | EG [[[p55<=0 & 0<=p55] | [p60<=0 & 0<=p60]]]]]] | AG [A [EX [[[p25<=1 & 1<=p25] & [p60<=1 & 1<=p60]]] U [[[p40<=1 & 1<=p40] & [p60<=1 & 1<=p60]] & [[p49<=1 & 1<=p49] & [p60<=1 & 1<=p60]]]]]]
normalized: [~ [E [true U ~ [[~ [EG [~ [[[[p60<=1 & 1<=p60] & [p49<=1 & 1<=p49]] & [[p60<=1 & 1<=p60] & [p40<=1 & 1<=p40]]]]]] & ~ [E [~ [[[[p60<=1 & 1<=p60] & [p49<=1 & 1<=p49]] & [[p60<=1 & 1<=p60] & [p40<=1 & 1<=p40]]]] U [~ [EX [[[p60<=1 & 1<=p60] & [p25<=1 & 1<=p25]]]] & ~ [[[[p60<=1 & 1<=p60] & [p49<=1 & 1<=p49]] & [[p60<=1 & 1<=p60] & [p40<=1 & 1<=p40]]]]]]]]]]] | ~ [EG [E [true U ~ [[EG [[[p60<=0 & 0<=p60] | [p55<=0 & 0<=p55]]] | ~ [E [[p21<=1 & 1<=p21] U [[p60<=1 & 1<=p60] & [p6<=1 & 1<=p6]]]]]]]]]]
abstracting: (1<=p6)
states: 159,720 (5)
abstracting: (p6<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p21)
states: 159,720 (5)
abstracting: (p21<=1)
states: 1,756,921 (6)
abstracting: (0<=p55)
states: 1,756,921 (6)
abstracting: (p55<=0)
states: 1,595,870 (6)
abstracting: (0<=p60)
states: 1,756,921 (6)
abstracting: (p60<=0)
states: 1
.................
EG iterations: 17
................
EG iterations: 16
abstracting: (1<=p40)
states: 159,720 (5)
abstracting: (p40<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p49)
states: 161,051 (5)
abstracting: (p49<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p25)
states: 159,720 (5)
abstracting: (p25<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
.abstracting: (1<=p40)
states: 159,720 (5)
abstracting: (p40<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p49)
states: 161,051 (5)
abstracting: (p49<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p40)
states: 159,720 (5)
abstracting: (p40<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p49)
states: 161,051 (5)
abstracting: (p49<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
.
EG iterations: 1
-> the formula is FALSE
FORMULA DiscoveryGPU-PT-06a-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.588sec
checking: [EX [[[[p3<=1 & 1<=p3] & [p61<=1 & 1<=p61]] | EF [[[EF [[[p47<=1 & 1<=p47] & [p60<=1 & 1<=p60]]] & [EX [[[p34<=1 & 1<=p34] & [p61<=1 & 1<=p61]]] & EG [[[p39<=1 & 1<=p39] & [p60<=1 & 1<=p60]]]]] & [[p24<=1 & 1<=p24] & [[p53<=1 & 1<=p53] & [p61<=1 & 1<=p61]]]]]]] | AF [EX [E [A [[p3<=1 & 1<=p3] U [p0<=1 & 1<=p0]] U [[p5<=1 & 1<=p5] & [p60<=1 & 1<=p60]]]]]]
normalized: [~ [EG [~ [EX [E [[~ [EG [~ [[p0<=1 & 1<=p0]]]] & ~ [E [~ [[p0<=1 & 1<=p0]] U [~ [[p3<=1 & 1<=p3]] & ~ [[p0<=1 & 1<=p0]]]]]] U [[p60<=1 & 1<=p60] & [p5<=1 & 1<=p5]]]]]]] | EX [[E [true U [[[[p61<=1 & 1<=p61] & [p53<=1 & 1<=p53]] & [p24<=1 & 1<=p24]] & [[EG [[[p60<=1 & 1<=p60] & [p39<=1 & 1<=p39]]] & EX [[[p61<=1 & 1<=p61] & [p34<=1 & 1<=p34]]]] & E [true U [[p60<=1 & 1<=p60] & [p47<=1 & 1<=p47]]]]]] | [[p61<=1 & 1<=p61] & [p3<=1 & 1<=p3]]]]]
abstracting: (1<=p3)
states: 159,720 (5)
abstracting: (p3<=1)
states: 1,756,921 (6)
abstracting: (1<=p61)
states: 1,756,920 (6)
abstracting: (p61<=1)
states: 1,756,921 (6)
abstracting: (1<=p47)
states: 161,051 (5)
abstracting: (p47<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p34)
states: 159,720 (5)
abstracting: (p34<=1)
states: 1,756,921 (6)
abstracting: (1<=p61)
states: 1,756,920 (6)
abstracting: (p61<=1)
states: 1,756,921 (6)
.abstracting: (1<=p39)
states: 159,720 (5)
abstracting: (p39<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
.................
EG iterations: 17
abstracting: (1<=p24)
states: 159,720 (5)
abstracting: (p24<=1)
states: 1,756,921 (6)
abstracting: (1<=p53)
states: 161,051 (5)
abstracting: (p53<=1)
states: 1,756,921 (6)
abstracting: (1<=p61)
states: 1,756,920 (6)
abstracting: (p61<=1)
states: 1,756,921 (6)
.abstracting: (1<=p5)
states: 159,720 (5)
abstracting: (p5<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 1,756,921 (6)
abstracting: (1<=p3)
states: 159,720 (5)
abstracting: (p3<=1)
states: 1,756,921 (6)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 1,756,921 (6)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 1,756,921 (6)
.
EG iterations: 1
..................
EG iterations: 17
-> the formula is FALSE
FORMULA DiscoveryGPU-PT-06a-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.824sec
checking: EG [[A [[[[E [[p16<=1 & 1<=p16] U [[p22<=1 & 1<=p22] & [p60<=1 & 1<=p60]]] | [p6<=1 & 1<=p6]] | [[p34<=1 & 1<=p34] | [[[p39<=1 & 1<=p39] & [p60<=1 & 1<=p60]] | [p26<=1 & 1<=p26]]]] & [[p7<=1 & 1<=p7] & [p60<=1 & 1<=p60]]] U [[p42<=1 & 1<=p42] & [p60<=1 & 1<=p60]]] | EF [[[[1<=p61 & p61<=1] & [p23<=1 & 1<=p23]] & EX [[[p38<=1 & 1<=p38] & [p61<=1 & 1<=p61]]]]]]]
normalized: EG [[[~ [EG [~ [[[p60<=1 & 1<=p60] & [p42<=1 & 1<=p42]]]]] & ~ [E [~ [[[p60<=1 & 1<=p60] & [p42<=1 & 1<=p42]]] U [~ [[[[E [[p16<=1 & 1<=p16] U [[p60<=1 & 1<=p60] & [p22<=1 & 1<=p22]]] | [p6<=1 & 1<=p6]] | [[[p26<=1 & 1<=p26] | [[p60<=1 & 1<=p60] & [p39<=1 & 1<=p39]]] | [p34<=1 & 1<=p34]]] & [[p60<=1 & 1<=p60] & [p7<=1 & 1<=p7]]]] & ~ [[[p60<=1 & 1<=p60] & [p42<=1 & 1<=p42]]]]]]] | E [true U [[[p23<=1 & 1<=p23] & [1<=p61 & p61<=1]] & EX [[[p61<=1 & 1<=p61] & [p38<=1 & 1<=p38]]]]]]]
abstracting: (1<=p38)
states: 159,720 (5)
abstracting: (p38<=1)
states: 1,756,921 (6)
abstracting: (1<=p61)
states: 1,756,920 (6)
abstracting: (p61<=1)
states: 1,756,921 (6)
.abstracting: (p61<=1)
states: 1,756,921 (6)
abstracting: (1<=p61)
states: 1,756,920 (6)
abstracting: (1<=p23)
states: 159,720 (5)
abstracting: (p23<=1)
states: 1,756,921 (6)
abstracting: (1<=p42)
states: 161,051 (5)
abstracting: (p42<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p7)
states: 159,720 (5)
abstracting: (p7<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p34)
states: 159,720 (5)
abstracting: (p34<=1)
states: 1,756,921 (6)
abstracting: (1<=p39)
states: 159,720 (5)
abstracting: (p39<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p26)
states: 159,720 (5)
abstracting: (p26<=1)
states: 1,756,921 (6)
abstracting: (1<=p6)
states: 159,720 (5)
abstracting: (p6<=1)
states: 1,756,921 (6)
abstracting: (1<=p22)
states: 159,720 (5)
abstracting: (p22<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p16)
states: 159,720 (5)
abstracting: (p16<=1)
states: 1,756,921 (6)
abstracting: (1<=p42)
states: 161,051 (5)
abstracting: (p42<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p42)
states: 161,051 (5)
abstracting: (p42<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
.................
EG iterations: 17
.................
EG iterations: 17
-> the formula is TRUE
FORMULA DiscoveryGPU-PT-06a-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.602sec
checking: A [AX [[AF [AG [[p6<=1 & 1<=p6]]] | [[p8<=1 & 1<=p8] & [p61<=1 & 1<=p61]]]] U [E [[[p35<=1 & 1<=p35] & [p60<=1 & 1<=p60]] U [AX [[p57<=1 & 1<=p57]] | [E [[[p38<=1 & 1<=p38] & [p61<=1 & 1<=p61]] U [p0<=1 & 1<=p0]] | ~ [AF [[[p47<=1 & 1<=p47] & [p60<=1 & 1<=p60]]]]]]] & E [~ [E [AF [[[p45<=1 & 1<=p45] & [p60<=1 & 1<=p60]]] U A [[[p55<=1 & 1<=p55] & [p60<=1 & 1<=p60]] U [[p3<=1 & 1<=p3] & [p61<=1 & 1<=p61]]]]] U ~ [EF [[[p10<=1 & 1<=p10] & [p60<=1 & 1<=p60]]]]]]]
normalized: [~ [EG [~ [[E [~ [E [~ [EG [~ [[[p60<=1 & 1<=p60] & [p45<=1 & 1<=p45]]]]] U [~ [EG [~ [[[p61<=1 & 1<=p61] & [p3<=1 & 1<=p3]]]]] & ~ [E [~ [[[p61<=1 & 1<=p61] & [p3<=1 & 1<=p3]]] U [~ [[[p61<=1 & 1<=p61] & [p3<=1 & 1<=p3]]] & ~ [[[p60<=1 & 1<=p60] & [p55<=1 & 1<=p55]]]]]]]]] U ~ [E [true U [[p60<=1 & 1<=p60] & [p10<=1 & 1<=p10]]]]] & E [[[p60<=1 & 1<=p60] & [p35<=1 & 1<=p35]] U [[EG [~ [[[p60<=1 & 1<=p60] & [p47<=1 & 1<=p47]]]] | E [[[p61<=1 & 1<=p61] & [p38<=1 & 1<=p38]] U [p0<=1 & 1<=p0]]] | ~ [EX [~ [[p57<=1 & 1<=p57]]]]]]]]]] & ~ [E [~ [[E [~ [E [~ [EG [~ [[[p60<=1 & 1<=p60] & [p45<=1 & 1<=p45]]]]] U [~ [EG [~ [[[p61<=1 & 1<=p61] & [p3<=1 & 1<=p3]]]]] & ~ [E [~ [[[p61<=1 & 1<=p61] & [p3<=1 & 1<=p3]]] U [~ [[[p61<=1 & 1<=p61] & [p3<=1 & 1<=p3]]] & ~ [[[p60<=1 & 1<=p60] & [p55<=1 & 1<=p55]]]]]]]]] U ~ [E [true U [[p60<=1 & 1<=p60] & [p10<=1 & 1<=p10]]]]] & E [[[p60<=1 & 1<=p60] & [p35<=1 & 1<=p35]] U [[EG [~ [[[p60<=1 & 1<=p60] & [p47<=1 & 1<=p47]]]] | E [[[p61<=1 & 1<=p61] & [p38<=1 & 1<=p38]] U [p0<=1 & 1<=p0]]] | ~ [EX [~ [[p57<=1 & 1<=p57]]]]]]]] U [~ [[E [~ [E [~ [EG [~ [[[p60<=1 & 1<=p60] & [p45<=1 & 1<=p45]]]]] U [~ [EG [~ [[[p61<=1 & 1<=p61] & [p3<=1 & 1<=p3]]]]] & ~ [E [~ [[[p61<=1 & 1<=p61] & [p3<=1 & 1<=p3]]] U [~ [[[p61<=1 & 1<=p61] & [p3<=1 & 1<=p3]]] & ~ [[[p60<=1 & 1<=p60] & [p55<=1 & 1<=p55]]]]]]]]] U ~ [E [true U [[p60<=1 & 1<=p60] & [p10<=1 & 1<=p10]]]]] & E [[[p60<=1 & 1<=p60] & [p35<=1 & 1<=p35]] U [[EG [~ [[[p60<=1 & 1<=p60] & [p47<=1 & 1<=p47]]]] | E [[[p61<=1 & 1<=p61] & [p38<=1 & 1<=p38]] U [p0<=1 & 1<=p0]]] | ~ [EX [~ [[p57<=1 & 1<=p57]]]]]]]] & EX [~ [[~ [EG [E [true U ~ [[p6<=1 & 1<=p6]]]]] | [[p8<=1 & 1<=p8] & [p61<=1 & 1<=p61]]]]]]]]]
abstracting: (1<=p61)
states: 1,756,920 (6)
abstracting: (p61<=1)
states: 1,756,921 (6)
abstracting: (1<=p8)
states: 159,720 (5)
abstracting: (p8<=1)
states: 1,756,921 (6)
abstracting: (1<=p6)
states: 159,720 (5)
abstracting: (p6<=1)
states: 1,756,921 (6)
EG iterations: 0
.abstracting: (1<=p57)
states: 161,051 (5)
abstracting: (p57<=1)
states: 1,756,921 (6)
.abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 1,756,921 (6)
abstracting: (1<=p38)
states: 159,720 (5)
abstracting: (p38<=1)
states: 1,756,921 (6)
abstracting: (1<=p61)
states: 1,756,920 (6)
abstracting: (p61<=1)
states: 1,756,921 (6)
abstracting: (1<=p47)
states: 161,051 (5)
abstracting: (p47<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
.
EG iterations: 1
abstracting: (1<=p35)
states: 159,720 (5)
abstracting: (p35<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p10)
states: 159,720 (5)
abstracting: (p10<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p55)
states: 161,051 (5)
abstracting: (p55<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p3)
states: 159,720 (5)
abstracting: (p3<=1)
states: 1,756,921 (6)
abstracting: (1<=p61)
states: 1,756,920 (6)
abstracting: (p61<=1)
states: 1,756,921 (6)
abstracting: (1<=p3)
states: 159,720 (5)
abstracting: (p3<=1)
states: 1,756,921 (6)
abstracting: (1<=p61)
states: 1,756,920 (6)
abstracting: (p61<=1)
states: 1,756,921 (6)
abstracting: (1<=p3)
states: 159,720 (5)
abstracting: (p3<=1)
states: 1,756,921 (6)
abstracting: (1<=p61)
states: 1,756,920 (6)
abstracting: (p61<=1)
states: 1,756,921 (6)
.
EG iterations: 1
abstracting: (1<=p45)
states: 161,051 (5)
abstracting: (p45<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
.
EG iterations: 1
abstracting: (1<=p57)
states: 161,051 (5)
abstracting: (p57<=1)
states: 1,756,921 (6)
.abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 1,756,921 (6)
abstracting: (1<=p38)
states: 159,720 (5)
abstracting: (p38<=1)
states: 1,756,921 (6)
abstracting: (1<=p61)
states: 1,756,920 (6)
abstracting: (p61<=1)
states: 1,756,921 (6)
abstracting: (1<=p47)
states: 161,051 (5)
abstracting: (p47<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
.
EG iterations: 1
abstracting: (1<=p35)
states: 159,720 (5)
abstracting: (p35<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p10)
states: 159,720 (5)
abstracting: (p10<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p55)
states: 161,051 (5)
abstracting: (p55<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p3)
states: 159,720 (5)
abstracting: (p3<=1)
states: 1,756,921 (6)
abstracting: (1<=p61)
states: 1,756,920 (6)
abstracting: (p61<=1)
states: 1,756,921 (6)
abstracting: (1<=p3)
states: 159,720 (5)
abstracting: (p3<=1)
states: 1,756,921 (6)
abstracting: (1<=p61)
states: 1,756,920 (6)
abstracting: (p61<=1)
states: 1,756,921 (6)
abstracting: (1<=p3)
states: 159,720 (5)
abstracting: (p3<=1)
states: 1,756,921 (6)
abstracting: (1<=p61)
states: 1,756,920 (6)
abstracting: (p61<=1)
states: 1,756,921 (6)
.
EG iterations: 1
abstracting: (1<=p45)
states: 161,051 (5)
abstracting: (p45<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
.
EG iterations: 1
abstracting: (1<=p57)
states: 161,051 (5)
abstracting: (p57<=1)
states: 1,756,921 (6)
.abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 1,756,921 (6)
abstracting: (1<=p38)
states: 159,720 (5)
abstracting: (p38<=1)
states: 1,756,921 (6)
abstracting: (1<=p61)
states: 1,756,920 (6)
abstracting: (p61<=1)
states: 1,756,921 (6)
abstracting: (1<=p47)
states: 161,051 (5)
abstracting: (p47<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
.
EG iterations: 1
abstracting: (1<=p35)
states: 159,720 (5)
abstracting: (p35<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p10)
states: 159,720 (5)
abstracting: (p10<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p55)
states: 161,051 (5)
abstracting: (p55<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p3)
states: 159,720 (5)
abstracting: (p3<=1)
states: 1,756,921 (6)
abstracting: (1<=p61)
states: 1,756,920 (6)
abstracting: (p61<=1)
states: 1,756,921 (6)
abstracting: (1<=p3)
states: 159,720 (5)
abstracting: (p3<=1)
states: 1,756,921 (6)
abstracting: (1<=p61)
states: 1,756,920 (6)
abstracting: (p61<=1)
states: 1,756,921 (6)
abstracting: (1<=p3)
states: 159,720 (5)
abstracting: (p3<=1)
states: 1,756,921 (6)
abstracting: (1<=p61)
states: 1,756,920 (6)
abstracting: (p61<=1)
states: 1,756,921 (6)
.
EG iterations: 1
abstracting: (1<=p45)
states: 161,051 (5)
abstracting: (p45<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
.
EG iterations: 1
..................
EG iterations: 18
-> the formula is TRUE
FORMULA DiscoveryGPU-PT-06a-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.771sec
checking: AX [[AF [[[[[[[p46<=1 & 1<=p46] | [[p39<=1 & 1<=p39] & [p60<=1 & 1<=p60]]] & [p40<=1 & 1<=p40]] & [[p60<=1 & 1<=p60] & [[p16<=1 & 1<=p16] & [p60<=1 & 1<=p60]]]] | [[p51<=1 & 1<=p51] & [p60<=1 & 1<=p60]]] & EX [[[p18<=0 & 0<=p18] | [p61<=0 & 0<=p61]]]]] & [AX [AG [[[[p33<=1 & 1<=p33] & [p61<=1 & 1<=p61]] | [[p2<=1 & 1<=p2] & [p60<=1 & 1<=p60]]]]] | AX [[AF [[[p18<=1 & 1<=p18] & [p61<=1 & 1<=p61]]] & [[p31<=0 & 0<=p31] | [[p44<=1 & 1<=p44] | [p14<=1 & 1<=p14]]]]]]]]
normalized: ~ [EX [~ [[[~ [EX [~ [[[[[p14<=1 & 1<=p14] | [p44<=1 & 1<=p44]] | [p31<=0 & 0<=p31]] & ~ [EG [~ [[[p61<=1 & 1<=p61] & [p18<=1 & 1<=p18]]]]]]]]] | ~ [EX [E [true U ~ [[[[p60<=1 & 1<=p60] & [p2<=1 & 1<=p2]] | [[p61<=1 & 1<=p61] & [p33<=1 & 1<=p33]]]]]]]] & ~ [EG [~ [[EX [[[p61<=0 & 0<=p61] | [p18<=0 & 0<=p18]]] & [[[p60<=1 & 1<=p60] & [p51<=1 & 1<=p51]] | [[[[p60<=1 & 1<=p60] & [p16<=1 & 1<=p16]] & [p60<=1 & 1<=p60]] & [[p40<=1 & 1<=p40] & [[[p60<=1 & 1<=p60] & [p39<=1 & 1<=p39]] | [p46<=1 & 1<=p46]]]]]]]]]]]]]
abstracting: (1<=p46)
states: 161,051 (5)
abstracting: (p46<=1)
states: 1,756,921 (6)
abstracting: (1<=p39)
states: 159,720 (5)
abstracting: (p39<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p40)
states: 159,720 (5)
abstracting: (p40<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p16)
states: 159,720 (5)
abstracting: (p16<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p51)
states: 161,051 (5)
abstracting: (p51<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (0<=p18)
states: 1,756,921 (6)
abstracting: (p18<=0)
states: 1,597,201 (6)
abstracting: (0<=p61)
states: 1,756,921 (6)
abstracting: (p61<=0)
states: 1
..................
EG iterations: 17
abstracting: (1<=p33)
states: 159,720 (5)
abstracting: (p33<=1)
states: 1,756,921 (6)
abstracting: (1<=p61)
states: 1,756,920 (6)
abstracting: (p61<=1)
states: 1,756,921 (6)
abstracting: (1<=p2)
states: 159,720 (5)
abstracting: (p2<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
.abstracting: (1<=p18)
states: 159,720 (5)
abstracting: (p18<=1)
states: 1,756,921 (6)
abstracting: (1<=p61)
states: 1,756,920 (6)
abstracting: (p61<=1)
states: 1,756,921 (6)
..................
EG iterations: 18
abstracting: (0<=p31)
states: 1,756,921 (6)
abstracting: (p31<=0)
states: 1,597,201 (6)
abstracting: (1<=p44)
states: 161,051 (5)
abstracting: (p44<=1)
states: 1,756,921 (6)
abstracting: (1<=p14)
states: 159,720 (5)
abstracting: (p14<=1)
states: 1,756,921 (6)
..-> the formula is FALSE
FORMULA DiscoveryGPU-PT-06a-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.908sec
checking: AX [~ [E [[[~ [EF [[[p52<=1 & 1<=p52] & [p61<=1 & 1<=p61]]]] | [~ [[p18<=1 & 1<=p18]] | E [[[p17<=1 & 1<=p17] & [p60<=1 & 1<=p60]] U [[p50<=1 & 1<=p50] & [p60<=1 & 1<=p60]]]]] & [[[[[p12<=1 & 1<=p12] & [p60<=1 & 1<=p60]] | [[p36<=1 & 1<=p36] & [p60<=1 & 1<=p60]]] & ~ [[[p54<=1 & 1<=p54] & [p60<=1 & 1<=p60]]]] | [[p6<=1 & 1<=p6] & [[[p49<=1 & 1<=p49] & [p60<=1 & 1<=p60]] | [[p37<=1 & 1<=p37] & [p60<=1 & 1<=p60]]]]]] U [~ [AF [[[p45<=1 & 1<=p45] & [p60<=1 & 1<=p60]]]] | ~ [[[p32<=1 & 1<=p32] & [p60<=1 & 1<=p60]]]]]]]
normalized: ~ [EX [E [[[[[[[p60<=1 & 1<=p60] & [p37<=1 & 1<=p37]] | [[p60<=1 & 1<=p60] & [p49<=1 & 1<=p49]]] & [p6<=1 & 1<=p6]] | [~ [[[p60<=1 & 1<=p60] & [p54<=1 & 1<=p54]]] & [[[p60<=1 & 1<=p60] & [p36<=1 & 1<=p36]] | [[p60<=1 & 1<=p60] & [p12<=1 & 1<=p12]]]]] & [[E [[[p60<=1 & 1<=p60] & [p17<=1 & 1<=p17]] U [[p60<=1 & 1<=p60] & [p50<=1 & 1<=p50]]] | ~ [[p18<=1 & 1<=p18]]] | ~ [E [true U [[p61<=1 & 1<=p61] & [p52<=1 & 1<=p52]]]]]] U [~ [[[p60<=1 & 1<=p60] & [p32<=1 & 1<=p32]]] | EG [~ [[[p60<=1 & 1<=p60] & [p45<=1 & 1<=p45]]]]]]]]
abstracting: (1<=p45)
states: 161,051 (5)
abstracting: (p45<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
.
EG iterations: 1
abstracting: (1<=p32)
states: 159,720 (5)
abstracting: (p32<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p52)
states: 161,051 (5)
abstracting: (p52<=1)
states: 1,756,921 (6)
abstracting: (1<=p61)
states: 1,756,920 (6)
abstracting: (p61<=1)
states: 1,756,921 (6)
abstracting: (1<=p18)
states: 159,720 (5)
abstracting: (p18<=1)
states: 1,756,921 (6)
abstracting: (1<=p50)
states: 161,051 (5)
abstracting: (p50<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p17)
states: 159,720 (5)
abstracting: (p17<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p12)
states: 159,720 (5)
abstracting: (p12<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p36)
states: 159,720 (5)
abstracting: (p36<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p54)
states: 161,051 (5)
abstracting: (p54<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p6)
states: 159,720 (5)
abstracting: (p6<=1)
states: 1,756,921 (6)
abstracting: (1<=p49)
states: 161,051 (5)
abstracting: (p49<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p37)
states: 159,720 (5)
abstracting: (p37<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
.-> the formula is FALSE
FORMULA DiscoveryGPU-PT-06a-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.074sec
checking: AX [[EX [EG [[[p3<=1 & 1<=p3] & [p61<=1 & 1<=p61]]]] & [[[[p9<=1 & 1<=p9] & [p60<=1 & 1<=p60]] | [[[p48<=1 & 1<=p48] | [p14<=1 & 1<=p14]] & [[[p57<=1 & 1<=p57] & [p61<=1 & 1<=p61]] | [[p22<=1 & 1<=p22] & [p60<=1 & 1<=p60]]]]] & [[AG [[p6<=0 & 0<=p6]] | AF [E [[p6<=1 & 1<=p6] U [[p46<=1 & 1<=p46] & [p60<=1 & 1<=p60]]]]] | [[[p53<=1 & 1<=p53] & [p61<=1 & 1<=p61]] | [E [[[p26<=1 & 1<=p26] & [p60<=1 & 1<=p60]] U [p1<=1 & 1<=p1]] & [EX [[[p20<=1 & 1<=p20] & [p60<=1 & 1<=p60]]] | EG [[[p54<=1 & 1<=p54] & [p60<=1 & 1<=p60]]]]]]]]]]
normalized: ~ [EX [~ [[[[[[[EG [[[p60<=1 & 1<=p60] & [p54<=1 & 1<=p54]]] | EX [[[p60<=1 & 1<=p60] & [p20<=1 & 1<=p20]]]] & E [[[p60<=1 & 1<=p60] & [p26<=1 & 1<=p26]] U [p1<=1 & 1<=p1]]] | [[p61<=1 & 1<=p61] & [p53<=1 & 1<=p53]]] | [~ [EG [~ [E [[p6<=1 & 1<=p6] U [[p60<=1 & 1<=p60] & [p46<=1 & 1<=p46]]]]]] | ~ [E [true U ~ [[p6<=0 & 0<=p6]]]]]] & [[[[[p60<=1 & 1<=p60] & [p22<=1 & 1<=p22]] | [[p61<=1 & 1<=p61] & [p57<=1 & 1<=p57]]] & [[p14<=1 & 1<=p14] | [p48<=1 & 1<=p48]]] | [[p60<=1 & 1<=p60] & [p9<=1 & 1<=p9]]]] & EX [EG [[[p61<=1 & 1<=p61] & [p3<=1 & 1<=p3]]]]]]]]
abstracting: (1<=p3)
states: 159,720 (5)
abstracting: (p3<=1)
states: 1,756,921 (6)
abstracting: (1<=p61)
states: 1,756,920 (6)
abstracting: (p61<=1)
states: 1,756,921 (6)
.................
EG iterations: 17
.abstracting: (1<=p9)
states: 159,720 (5)
abstracting: (p9<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p48)
states: 161,051 (5)
abstracting: (p48<=1)
states: 1,756,921 (6)
abstracting: (1<=p14)
states: 159,720 (5)
abstracting: (p14<=1)
states: 1,756,921 (6)
abstracting: (1<=p57)
states: 161,051 (5)
abstracting: (p57<=1)
states: 1,756,921 (6)
abstracting: (1<=p61)
states: 1,756,920 (6)
abstracting: (p61<=1)
states: 1,756,921 (6)
abstracting: (1<=p22)
states: 159,720 (5)
abstracting: (p22<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (0<=p6)
states: 1,756,921 (6)
abstracting: (p6<=0)
states: 1,597,201 (6)
abstracting: (1<=p46)
states: 161,051 (5)
abstracting: (p46<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p6)
states: 159,720 (5)
abstracting: (p6<=1)
states: 1,756,921 (6)
.................
EG iterations: 17
abstracting: (1<=p53)
states: 161,051 (5)
abstracting: (p53<=1)
states: 1,756,921 (6)
abstracting: (1<=p61)
states: 1,756,920 (6)
abstracting: (p61<=1)
states: 1,756,921 (6)
abstracting: (1<=p1)
states: 159,720 (5)
abstracting: (p1<=1)
states: 1,756,921 (6)
abstracting: (1<=p26)
states: 159,720 (5)
abstracting: (p26<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
abstracting: (1<=p20)
states: 159,720 (5)
abstracting: (p20<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
.abstracting: (1<=p54)
states: 161,051 (5)
abstracting: (p54<=1)
states: 1,756,921 (6)
abstracting: (1<=p60)
states: 1,756,920 (6)
abstracting: (p60<=1)
states: 1,756,921 (6)
.................
EG iterations: 17
.-> the formula is FALSE
FORMULA DiscoveryGPU-PT-06a-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.130sec
totally nodes used: 5477330 (5.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 5728864 11559936 17288800
used/not used/entry size/cache size: 13923534 53185330 16 1024MB
basic ops cache: hits/miss/sum: 1851018 4312682 6163700
used/not used/entry size/cache size: 7001963 9775253 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: 21875 45106 66981
used/not used/entry size/cache size: 44989 8343619 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 62018526
1 4735674
2 324931
3 27341
4 2207
5 170
6 12
7 3
8 0
9 0
>= 10 0
Total processing time: 0m13.814sec
BK_STOP 1678735974277
--------------------
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:1659 (21), effective:61 (0)
initing FirstDep: 0m 0.000sec
iterations count:112 (1), effective:1 (0)
iterations count:78 (1), effective:0 (0)
iterations count:105 (1), effective:1 (0)
iterations count:674 (8), effective:21 (0)
iterations count:79 (1), effective:1 (0)
iterations count:79 (1), effective:1 (0)
iterations count:328 (4), effective:15 (0)
iterations count:79 (1), effective:1 (0)
iterations count:109 (1), effective:3 (0)
iterations count:1478 (18), effective:61 (0)
iterations count:94 (1), effective:1 (0)
iterations count:113 (1), effective:2 (0)
iterations count:138 (1), effective:1 (0)
iterations count:232 (2), effective:8 (0)
iterations count:290 (3), effective:9 (0)
iterations count:1323 (16), effective:53 (0)
iterations count:290 (3), effective:9 (0)
iterations count:212 (2), effective:6 (0)
iterations count:360 (4), effective:14 (0)
iterations count:290 (3), effective:9 (0)
iterations count:349 (4), effective:14 (0)
iterations count:290 (3), effective:9 (0)
iterations count:157 (2), effective:4 (0)
iterations count:354 (4), effective:9 (0)
iterations count:285 (3), effective:13 (0)
iterations count:86 (1), effective:1 (0)
iterations count:132 (1), effective:4 (0)
iterations count:79 (1), effective:1 (0)
iterations count:78 (1), effective:0 (0)
iterations count:240 (3), effective:9 (0)
iterations count:274 (3), effective:8 (0)
iterations count:111 (1), effective:2 (0)
iterations count:79 (1), effective:1 (0)
iterations count:78 (1), effective:0 (0)
iterations count:115 (1), effective:1 (0)
iterations count:94 (1), effective:1 (0)
iterations count:116 (1), effective:1 (0)
iterations count:218 (2), effective:7 (0)
iterations count:113 (1), effective:2 (0)
iterations count:78 (1), effective:0 (0)
iterations count:115 (1), effective:1 (0)
iterations count:94 (1), effective:1 (0)
iterations count:116 (1), effective:1 (0)
iterations count:218 (2), effective:7 (0)
iterations count:113 (1), effective:2 (0)
iterations count:78 (1), effective:0 (0)
iterations count:78 (1), effective:0 (0)
iterations count:115 (1), effective:1 (0)
iterations count:94 (1), effective:1 (0)
iterations count:116 (1), effective:1 (0)
iterations count:218 (2), effective:7 (0)
iterations count:113 (1), effective:2 (0)
iterations count:163 (2), effective:2 (0)
iterations count:354 (4), effective:8 (0)
iterations count:78 (1), effective:0 (0)
iterations count:111 (1), effective:1 (0)
iterations count:173 (2), effective:5 (0)
iterations count:153 (1), effective:4 (0)
iterations count:246 (3), effective:9 (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="DiscoveryGPU-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 DiscoveryGPU-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 r138-smll-167819420100282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-06a.tgz
mv DiscoveryGPU-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 ;