About the Execution of Marcie+red for DiscoveryGPU-PT-08a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6602.407 | 51382.00 | 58661.00 | 788.40 | TFTFTFFFFFTTFTTF | 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-167819420300314.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-08a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819420300314
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 5.5K Feb 25 13:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 13:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 13:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 13:39 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.8K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 13:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K Feb 25 13:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 13:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 13:42 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 28K 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-08a-CTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678744538482
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-08a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 21:55:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 21:55:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 21:55:42] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2023-03-13 21:55:42] [INFO ] Transformed 83 places.
[2023-03-13 21:55:42] [INFO ] Transformed 113 transitions.
[2023-03-13 21:55:42] [INFO ] Found NUPN structural information;
[2023-03-13 21:55:42] [INFO ] Parsed PT model containing 83 places and 113 transitions and 363 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Support contains 64 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 113/113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 81 transition count 111
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 81 transition count 111
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 12 place count 81 transition count 103
Applied a total of 12 rules in 28 ms. Remains 81 /83 variables (removed 2) and now considering 103/113 (removed 10) transitions.
// Phase 1: matrix 103 rows 81 cols
[2023-03-13 21:55:42] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-13 21:55:42] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-13 21:55:42] [INFO ] Invariant cache hit.
[2023-03-13 21:55:42] [INFO ] State equation strengthened by 64 read => feed constraints.
[2023-03-13 21:55:42] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2023-03-13 21:55:42] [INFO ] Invariant cache hit.
[2023-03-13 21:55:42] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 81/83 places, 103/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 668 ms. Remains : 81/83 places, 103/113 transitions.
Support contains 64 out of 81 places after structural reductions.
[2023-03-13 21:55:43] [INFO ] Flatten gal took : 69 ms
[2023-03-13 21:55:43] [INFO ] Flatten gal took : 30 ms
[2023-03-13 21:55:43] [INFO ] Input system was already deterministic with 103 transitions.
Finished random walk after 2231 steps, including 25 resets, run visited all 76 properties in 292 ms. (steps per millisecond=7 )
[2023-03-13 21:55:43] [INFO ] Flatten gal took : 13 ms
[2023-03-13 21:55:43] [INFO ] Flatten gal took : 14 ms
[2023-03-13 21:55:44] [INFO ] Input system was already deterministic with 103 transitions.
Computed a total of 11 stabilizing places and 9 stable transitions
Graph (complete) has 226 edges and 81 vertex of which 75 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Graph (complete) has 226 edges and 81 vertex of which 75 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 75 transition count 90
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 68 transition count 90
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 21 place count 62 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 62 transition count 84
Applied a total of 27 rules in 37 ms. Remains 62 /81 variables (removed 19) and now considering 84/103 (removed 19) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 62/81 places, 84/103 transitions.
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 7 ms
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 8 ms
[2023-03-13 21:55:44] [INFO ] Input system was already deterministic with 84 transitions.
Finished random walk after 3677 steps, including 47 resets, run visited all 1 properties in 43 ms. (steps per millisecond=85 )
FORMULA DiscoveryGPU-PT-08a-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 74 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 74 transition count 96
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 68 transition count 90
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 68 transition count 90
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 64 transition count 86
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 64 transition count 86
Applied a total of 34 rules in 14 ms. Remains 64 /81 variables (removed 17) and now considering 86/103 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 64/81 places, 86/103 transitions.
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 18 ms
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 10 ms
[2023-03-13 21:55:44] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 75 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 75 transition count 97
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 70 transition count 92
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 70 transition count 92
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 66 transition count 88
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 66 transition count 88
Applied a total of 30 rules in 15 ms. Remains 66 /81 variables (removed 15) and now considering 88/103 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 66/81 places, 88/103 transitions.
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 8 ms
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 10 ms
[2023-03-13 21:55:44] [INFO ] Input system was already deterministic with 88 transitions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 77 transition count 99
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 77 transition count 99
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 75 transition count 97
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 75 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 74 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 74 transition count 96
Applied a total of 14 rules in 12 ms. Remains 74 /81 variables (removed 7) and now considering 96/103 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 74/81 places, 96/103 transitions.
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 8 ms
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 10 ms
[2023-03-13 21:55:44] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Graph (complete) has 226 edges and 81 vertex of which 75 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 75 transition count 90
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 68 transition count 90
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 22 place count 61 transition count 83
Iterating global reduction 0 with 7 rules applied. Total rules applied 29 place count 61 transition count 83
Applied a total of 29 rules in 12 ms. Remains 61 /81 variables (removed 20) and now considering 83/103 (removed 20) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 61/81 places, 83/103 transitions.
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:55:44] [INFO ] Input system was already deterministic with 83 transitions.
Finished random walk after 112 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=56 )
FORMULA DiscoveryGPU-PT-08a-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 74 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 74 transition count 96
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 69 transition count 91
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 69 transition count 91
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 65 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 65 transition count 87
Applied a total of 32 rules in 9 ms. Remains 65 /81 variables (removed 16) and now considering 87/103 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 65/81 places, 87/103 transitions.
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 6 ms
[2023-03-13 21:55:44] [INFO ] Input system was already deterministic with 87 transitions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 75 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 75 transition count 97
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 71 transition count 93
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 71 transition count 93
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 68 transition count 90
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 68 transition count 90
Applied a total of 26 rules in 8 ms. Remains 68 /81 variables (removed 13) and now considering 90/103 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 68/81 places, 90/103 transitions.
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:55:44] [INFO ] Input system was already deterministic with 90 transitions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 75 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 75 transition count 97
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 69 transition count 91
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 69 transition count 91
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 65 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 65 transition count 87
Applied a total of 32 rules in 6 ms. Remains 65 /81 variables (removed 16) and now considering 87/103 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 65/81 places, 87/103 transitions.
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:55:44] [INFO ] Input system was already deterministic with 87 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Graph (complete) has 226 edges and 81 vertex of which 76 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 76 transition count 92
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 70 transition count 92
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 18 place count 65 transition count 87
Iterating global reduction 0 with 5 rules applied. Total rules applied 23 place count 65 transition count 87
Applied a total of 23 rules in 11 ms. Remains 65 /81 variables (removed 16) and now considering 87/103 (removed 16) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 65/81 places, 87/103 transitions.
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 4 ms
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 6 ms
[2023-03-13 21:55:44] [INFO ] Input system was already deterministic with 87 transitions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 74 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 74 transition count 96
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 68 transition count 90
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 68 transition count 90
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 65 transition count 87
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 65 transition count 87
Applied a total of 32 rules in 5 ms. Remains 65 /81 variables (removed 16) and now considering 87/103 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 65/81 places, 87/103 transitions.
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:55:44] [INFO ] Input system was already deterministic with 87 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Graph (complete) has 226 edges and 81 vertex of which 75 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 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 75 transition count 91
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 69 transition count 91
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 19 place count 63 transition count 85
Iterating global reduction 0 with 6 rules applied. Total rules applied 25 place count 63 transition count 85
Applied a total of 25 rules in 9 ms. Remains 63 /81 variables (removed 18) and now considering 85/103 (removed 18) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 63/81 places, 85/103 transitions.
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 4 ms
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 4 ms
[2023-03-13 21:55:44] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 74 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 74 transition count 96
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 68 transition count 90
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 68 transition count 90
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 64 transition count 86
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 64 transition count 86
Applied a total of 34 rules in 6 ms. Remains 64 /81 variables (removed 17) and now considering 86/103 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 64/81 places, 86/103 transitions.
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 4 ms
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:55:44] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 75 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 75 transition count 97
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 71 transition count 93
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 71 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 70 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 70 transition count 92
Applied a total of 22 rules in 4 ms. Remains 70 /81 variables (removed 11) and now considering 92/103 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 70/81 places, 92/103 transitions.
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 6 ms
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 6 ms
[2023-03-13 21:55:44] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Graph (complete) has 226 edges and 81 vertex of which 75 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 80 edges and 72 vertex of which 56 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Graph (trivial) has 61 edges and 56 vertex of which 30 / 56 are part of one of the 15 SCC in 3 ms
Free SCC test removed 15 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 41 transition count 73
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 35 place count 34 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 33 transition count 57
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 43 place count 26 transition count 43
Iterating global reduction 3 with 7 rules applied. Total rules applied 50 place count 26 transition count 43
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 57 place count 19 transition count 29
Iterating global reduction 3 with 7 rules applied. Total rules applied 64 place count 19 transition count 29
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 70 place count 13 transition count 17
Iterating global reduction 3 with 6 rules applied. Total rules applied 76 place count 13 transition count 17
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 82 place count 7 transition count 11
Iterating global reduction 3 with 6 rules applied. Total rules applied 88 place count 7 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 7 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 6 transition count 9
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 4 transition count 7
Applied a total of 93 rules in 16 ms. Remains 4 /81 variables (removed 77) and now considering 7/103 (removed 96) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 4/81 places, 7/103 transitions.
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 2 ms
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 1 ms
[2023-03-13 21:55:44] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 75 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 75 transition count 97
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 69 transition count 91
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 69 transition count 91
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 66 transition count 88
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 66 transition count 88
Applied a total of 30 rules in 4 ms. Remains 66 /81 variables (removed 15) and now considering 88/103 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 66/81 places, 88/103 transitions.
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:55:44] [INFO ] Input system was already deterministic with 88 transitions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 75 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 75 transition count 97
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 70 transition count 92
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 70 transition count 92
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 67 transition count 89
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 67 transition count 89
Applied a total of 28 rules in 4 ms. Remains 67 /81 variables (removed 14) and now considering 89/103 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 67/81 places, 89/103 transitions.
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:55:44] [INFO ] Input system was already deterministic with 89 transitions.
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 6 ms
[2023-03-13 21:55:44] [INFO ] Flatten gal took : 6 ms
[2023-03-13 21:55:44] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2023-03-13 21:55:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 81 places, 103 transitions and 329 arcs took 2 ms.
Total runtime 2686 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: 81 NrTr: 103 NrArc: 329)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec
net check time: 0m 0.000sec
init dd package: 0m 3.315sec
RS generation: 0m 0.444sec
-> reachability set: #nodes 8826 (8.8e+03) #states 209,366,301 (8)
starting MCC model checker
--------------------------
checking: AG [EF [AG [[p67<=0 & 0<=p67]]]]
normalized: ~ [E [true U ~ [E [true U ~ [E [true U ~ [[p67<=0 & 0<=p67]]]]]]]]
abstracting: (0<=p67)
states: 209,366,301 (8)
abstracting: (p67<=0)
states: 190,333,001 (8)
-> the formula is TRUE
FORMULA DiscoveryGPU-PT-08a-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.288sec
checking: [EF [AX [EG [[EG [[p40<=1 & 1<=p40]] & AG [[[p3<=1 & 1<=p3] & [p80<=1 & 1<=p80]]]]]]] & EX [[[p14<=0 & 0<=p14] | [p80<=0 & 0<=p80]]]]
normalized: [EX [[[p80<=0 & 0<=p80] | [p14<=0 & 0<=p14]]] & E [true U ~ [EX [~ [EG [[~ [E [true U ~ [[[p80<=1 & 1<=p80] & [p3<=1 & 1<=p3]]]]] & EG [[p40<=1 & 1<=p40]]]]]]]]]
abstracting: (1<=p40)
states: 19,033,300 (7)
abstracting: (p40<=1)
states: 209,366,301 (8)
.......................
EG iterations: 23
abstracting: (1<=p3)
states: 19,033,300 (7)
abstracting: (p3<=1)
states: 209,366,301 (8)
abstracting: (1<=p80)
states: 209,366,300 (8)
abstracting: (p80<=1)
states: 209,366,301 (8)
.
EG iterations: 1
.abstracting: (0<=p14)
states: 209,366,301 (8)
abstracting: (p14<=0)
states: 190,040,181 (8)
abstracting: (0<=p80)
states: 209,366,301 (8)
abstracting: (p80<=0)
states: 1
.-> the formula is TRUE
FORMULA DiscoveryGPU-PT-08a-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.601sec
checking: E [~ [[[p2<=1 & 1<=p2] & [p79<=1 & 1<=p79]]] U E [[[AG [AX [[p32<=1 & 1<=p32]]] & [p33<=1 & 1<=p33]] & [[p80<=1 & 1<=p80] & AX [AX [[p47<=1 & 1<=p47]]]]] U AG [[[p46<=1 & 1<=p46] & [p79<=1 & 1<=p79]]]]]
normalized: E [~ [[[p79<=1 & 1<=p79] & [p2<=1 & 1<=p2]]] U E [[[~ [EX [EX [~ [[p47<=1 & 1<=p47]]]]] & [p80<=1 & 1<=p80]] & [[p33<=1 & 1<=p33] & ~ [E [true U EX [~ [[p32<=1 & 1<=p32]]]]]]] U ~ [E [true U ~ [[[p79<=1 & 1<=p79] & [p46<=1 & 1<=p46]]]]]]]
abstracting: (1<=p46)
states: 19,033,300 (7)
abstracting: (p46<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p32)
states: 19,326,120 (7)
abstracting: (p32<=1)
states: 209,366,301 (8)
.abstracting: (1<=p33)
states: 19,326,120 (7)
abstracting: (p33<=1)
states: 209,366,301 (8)
abstracting: (1<=p80)
states: 209,366,300 (8)
abstracting: (p80<=1)
states: 209,366,301 (8)
abstracting: (1<=p47)
states: 19,033,300 (7)
abstracting: (p47<=1)
states: 209,366,301 (8)
..abstracting: (1<=p2)
states: 19,033,300 (7)
abstracting: (p2<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
-> the formula is FALSE
FORMULA DiscoveryGPU-PT-08a-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.538sec
checking: EF [[AG [[A [~ [[[p38<=1 & 1<=p38] & [p79<=1 & 1<=p79]]] U AF [[[p45<=1 & 1<=p45] & [p79<=1 & 1<=p79]]]] | EX [AG [[p1<=1 & 1<=p1]]]]] & [EX [[p67<=0 & 0<=p67]] | [[p65<=1 & 1<=p65] & [p79<=1 & 1<=p79]]]]]
normalized: E [true U [[[[p79<=1 & 1<=p79] & [p65<=1 & 1<=p65]] | EX [[p67<=0 & 0<=p67]]] & ~ [E [true U ~ [[EX [~ [E [true U ~ [[p1<=1 & 1<=p1]]]]] | [~ [EG [EG [~ [[[p79<=1 & 1<=p79] & [p45<=1 & 1<=p45]]]]]] & ~ [E [EG [~ [[[p79<=1 & 1<=p79] & [p45<=1 & 1<=p45]]]] U [[[p79<=1 & 1<=p79] & [p38<=1 & 1<=p38]] & EG [~ [[[p79<=1 & 1<=p79] & [p45<=1 & 1<=p45]]]]]]]]]]]]]]
abstracting: (1<=p45)
states: 19,033,300 (7)
abstracting: (p45<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
.......................
EG iterations: 23
abstracting: (1<=p38)
states: 19,326,120 (7)
abstracting: (p38<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p45)
states: 19,033,300 (7)
abstracting: (p45<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
.......................
EG iterations: 23
abstracting: (1<=p45)
states: 19,033,300 (7)
abstracting: (p45<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
.......................
EG iterations: 23
.
EG iterations: 1
abstracting: (1<=p1)
states: 19,033,300 (7)
abstracting: (p1<=1)
states: 209,366,301 (8)
.abstracting: (0<=p67)
states: 209,366,301 (8)
abstracting: (p67<=0)
states: 190,333,001 (8)
.abstracting: (1<=p65)
states: 19,033,300 (7)
abstracting: (p65<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
-> the formula is FALSE
FORMULA DiscoveryGPU-PT-08a-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.632sec
checking: AG [AF [E [[[p36<=1 & 1<=p36] & [p79<=1 & 1<=p79]] U ~ [[E [[[p29<=1 & 1<=p29] & [p79<=1 & 1<=p79]] U [p32<=1 & 1<=p32]] | A [[[p70<=1 & 1<=p70] & [p79<=1 & 1<=p79]] U [p21<=1 & 1<=p21]]]]]]]
normalized: ~ [E [true U EG [~ [E [[[p79<=1 & 1<=p79] & [p36<=1 & 1<=p36]] U ~ [[[~ [EG [~ [[p21<=1 & 1<=p21]]]] & ~ [E [~ [[p21<=1 & 1<=p21]] U [~ [[[p79<=1 & 1<=p79] & [p70<=1 & 1<=p70]]] & ~ [[p21<=1 & 1<=p21]]]]]] | E [[[p79<=1 & 1<=p79] & [p29<=1 & 1<=p29]] U [p32<=1 & 1<=p32]]]]]]]]]
abstracting: (1<=p32)
states: 19,326,120 (7)
abstracting: (p32<=1)
states: 209,366,301 (8)
abstracting: (1<=p29)
states: 19,033,300 (7)
abstracting: (p29<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p21)
states: 19,033,300 (7)
abstracting: (p21<=1)
states: 209,366,301 (8)
abstracting: (1<=p70)
states: 19,326,120 (7)
abstracting: (p70<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p21)
states: 19,033,300 (7)
abstracting: (p21<=1)
states: 209,366,301 (8)
abstracting: (1<=p21)
states: 19,033,300 (7)
abstracting: (p21<=1)
states: 209,366,301 (8)
........................
EG iterations: 24
abstracting: (1<=p36)
states: 19,326,120 (7)
abstracting: (p36<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
.........................
EG iterations: 25
-> the formula is FALSE
FORMULA DiscoveryGPU-PT-08a-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.213sec
checking: AX [[AG [[EF [[[p3<=1 & 1<=p3] & [p80<=1 & 1<=p80]]] | [AF [[[p2<=1 & 1<=p2] & [p79<=1 & 1<=p79]]] | [p60<=1 & 1<=p60]]]] | [[p24<=1 & 1<=p24] & [[p49<=0 & 0<=p49] | [p79<=0 & 0<=p79]]]]]
normalized: ~ [EX [~ [[[[[p79<=0 & 0<=p79] | [p49<=0 & 0<=p49]] & [p24<=1 & 1<=p24]] | ~ [E [true U ~ [[E [true U [[p80<=1 & 1<=p80] & [p3<=1 & 1<=p3]]] | [[p60<=1 & 1<=p60] | ~ [EG [~ [[[p79<=1 & 1<=p79] & [p2<=1 & 1<=p2]]]]]]]]]]]]]]
abstracting: (1<=p2)
states: 19,033,300 (7)
abstracting: (p2<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
.......................
EG iterations: 23
abstracting: (1<=p60)
states: 19,033,300 (7)
abstracting: (p60<=1)
states: 209,366,301 (8)
abstracting: (1<=p3)
states: 19,033,300 (7)
abstracting: (p3<=1)
states: 209,366,301 (8)
abstracting: (1<=p80)
states: 209,366,300 (8)
abstracting: (p80<=1)
states: 209,366,301 (8)
abstracting: (1<=p24)
states: 19,033,300 (7)
abstracting: (p24<=1)
states: 209,366,301 (8)
abstracting: (0<=p49)
states: 209,366,301 (8)
abstracting: (p49<=0)
states: 190,333,001 (8)
abstracting: (0<=p79)
states: 209,366,301 (8)
abstracting: (p79<=0)
states: 1
.-> the formula is FALSE
FORMULA DiscoveryGPU-PT-08a-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.681sec
checking: EF [[EF [[AF [[[p44<=1 & 1<=p44] & [p79<=1 & 1<=p79]]] & [[[[p72<=1 & 1<=p72] & [p80<=1 & 1<=p80]] | AG [[p32<=1 & 1<=p32]]] & EG [[[p19<=0 & 0<=p19] | [p79<=0 & 0<=p79]]]]]] & [[p22<=0 & 0<=p22] | [p79<=0 & 0<=p79]]]]
normalized: E [true U [[[p79<=0 & 0<=p79] | [p22<=0 & 0<=p22]] & E [true U [[EG [[[p79<=0 & 0<=p79] | [p19<=0 & 0<=p19]]] & [~ [E [true U ~ [[p32<=1 & 1<=p32]]]] | [[p80<=1 & 1<=p80] & [p72<=1 & 1<=p72]]]] & ~ [EG [~ [[[p79<=1 & 1<=p79] & [p44<=1 & 1<=p44]]]]]]]]]
abstracting: (1<=p44)
states: 19,033,300 (7)
abstracting: (p44<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
.
EG iterations: 1
abstracting: (1<=p72)
states: 19,326,120 (7)
abstracting: (p72<=1)
states: 209,366,301 (8)
abstracting: (1<=p80)
states: 209,366,300 (8)
abstracting: (p80<=1)
states: 209,366,301 (8)
abstracting: (1<=p32)
states: 19,326,120 (7)
abstracting: (p32<=1)
states: 209,366,301 (8)
abstracting: (0<=p19)
states: 209,366,301 (8)
abstracting: (p19<=0)
states: 190,040,181 (8)
abstracting: (0<=p79)
states: 209,366,301 (8)
abstracting: (p79<=0)
states: 1
.......................
EG iterations: 23
abstracting: (0<=p22)
states: 209,366,301 (8)
abstracting: (p22<=0)
states: 190,333,001 (8)
abstracting: (0<=p79)
states: 209,366,301 (8)
abstracting: (p79<=0)
states: 1
-> the formula is TRUE
FORMULA DiscoveryGPU-PT-08a-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.174sec
checking: [EX [[[AF [[p71<=1 & 1<=p71]] & A [[[p53<=1 & 1<=p53] & [p80<=1 & 1<=p80]] U [p26<=1 & 1<=p26]]] | [[[p64<=1 & 1<=p64] & [p79<=1 & 1<=p79]] | [[p73<=1 & 1<=p73] & [p79<=1 & 1<=p79]]]]] | AX [EF [[p52<=1 & 1<=p52]]]]
normalized: [~ [EX [~ [E [true U [p52<=1 & 1<=p52]]]]] | EX [[[[[p79<=1 & 1<=p79] & [p73<=1 & 1<=p73]] | [[p79<=1 & 1<=p79] & [p64<=1 & 1<=p64]]] | [[~ [EG [~ [[p26<=1 & 1<=p26]]]] & ~ [E [~ [[p26<=1 & 1<=p26]] U [~ [[[p80<=1 & 1<=p80] & [p53<=1 & 1<=p53]]] & ~ [[p26<=1 & 1<=p26]]]]]] & ~ [EG [~ [[p71<=1 & 1<=p71]]]]]]]]
abstracting: (1<=p71)
states: 19,326,120 (7)
abstracting: (p71<=1)
states: 209,366,301 (8)
.
EG iterations: 1
abstracting: (1<=p26)
states: 19,033,300 (7)
abstracting: (p26<=1)
states: 209,366,301 (8)
abstracting: (1<=p53)
states: 19,033,300 (7)
abstracting: (p53<=1)
states: 209,366,301 (8)
abstracting: (1<=p80)
states: 209,366,300 (8)
abstracting: (p80<=1)
states: 209,366,301 (8)
abstracting: (1<=p26)
states: 19,033,300 (7)
abstracting: (p26<=1)
states: 209,366,301 (8)
abstracting: (1<=p26)
states: 19,033,300 (7)
abstracting: (p26<=1)
states: 209,366,301 (8)
.......................
EG iterations: 23
abstracting: (1<=p64)
states: 19,033,300 (7)
abstracting: (p64<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p73)
states: 19,326,120 (7)
abstracting: (p73<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
.abstracting: (1<=p52)
states: 19,033,300 (7)
abstracting: (p52<=1)
states: 209,366,301 (8)
.-> the formula is TRUE
FORMULA DiscoveryGPU-PT-08a-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.004sec
checking: AX [[[p39<=1 & 1<=p39] & [[p79<=1 & 1<=p79] & [AG [E [[[p17<=1 & 1<=p17] & [[p79<=1 & 1<=p79] & [p74<=1 & 1<=p74]]] U ~ [[p62<=1 & 1<=p62]]]] | [EX [AF [[[p26<=1 & 1<=p26] & [p79<=1 & 1<=p79]]]] & [A [[[[p51<=1 & 1<=p51] & [p79<=1 & 1<=p79]] | [[p59<=1 & 1<=p59] & [p79<=1 & 1<=p79]]] U [p62<=1 & 1<=p62]] & AF [[[p58<=1 & 1<=p58] & [p79<=1 & 1<=p79]]]]]]]]]
normalized: ~ [EX [~ [[[[[[~ [EG [~ [[[p79<=1 & 1<=p79] & [p58<=1 & 1<=p58]]]]] & [~ [EG [~ [[p62<=1 & 1<=p62]]]] & ~ [E [~ [[p62<=1 & 1<=p62]] U [~ [[[[p79<=1 & 1<=p79] & [p59<=1 & 1<=p59]] | [[p79<=1 & 1<=p79] & [p51<=1 & 1<=p51]]]] & ~ [[p62<=1 & 1<=p62]]]]]]] & EX [~ [EG [~ [[[p79<=1 & 1<=p79] & [p26<=1 & 1<=p26]]]]]]] | ~ [E [true U ~ [E [[[[p74<=1 & 1<=p74] & [p79<=1 & 1<=p79]] & [p17<=1 & 1<=p17]] U ~ [[p62<=1 & 1<=p62]]]]]]] & [p79<=1 & 1<=p79]] & [p39<=1 & 1<=p39]]]]]
abstracting: (1<=p39)
states: 19,326,120 (7)
abstracting: (p39<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p62)
states: 19,033,300 (7)
abstracting: (p62<=1)
states: 209,366,301 (8)
abstracting: (1<=p17)
states: 19,326,120 (7)
abstracting: (p17<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p74)
states: 19,326,120 (7)
abstracting: (p74<=1)
states: 209,366,301 (8)
abstracting: (1<=p26)
states: 19,033,300 (7)
abstracting: (p26<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
.......................
EG iterations: 23
.abstracting: (1<=p62)
states: 19,033,300 (7)
abstracting: (p62<=1)
states: 209,366,301 (8)
abstracting: (1<=p51)
states: 19,033,300 (7)
abstracting: (p51<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p59)
states: 19,033,300 (7)
abstracting: (p59<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p62)
states: 19,033,300 (7)
abstracting: (p62<=1)
states: 209,366,301 (8)
abstracting: (1<=p62)
states: 19,033,300 (7)
abstracting: (p62<=1)
states: 209,366,301 (8)
.
EG iterations: 1
abstracting: (1<=p58)
states: 19,033,300 (7)
abstracting: (p58<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
.......................
EG iterations: 23
.-> the formula is FALSE
FORMULA DiscoveryGPU-PT-08a-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.174sec
checking: E [E [[EX [EG [[p14<=1 & 1<=p14]]] | [[p16<=1 & 1<=p16] & [[p79<=1 & 1<=p79] & [p68<=1 & 1<=p68]]]] U [AX [[[[p43<=1 & 1<=p43] & [p80<=1 & 1<=p80]] | [[p26<=1 & 1<=p26] | ~ [[[p35<=1 & 1<=p35] & [p79<=1 & 1<=p79]]]]]] | ~ [EX [E [[[p48<=1 & 1<=p48] & [p79<=1 & 1<=p79]] U [p3<=1 & 1<=p3]]]]]] U AG [~ [[~ [EG [[[p7<=1 & 1<=p7] & [p79<=1 & 1<=p79]]]] | [EF [[[p6<=1 & 1<=p6] & [p79<=1 & 1<=p79]]] | [[p32<=1 & 1<=p32] & [p80<=1 & 1<=p80]]]]]]]
normalized: E [E [[[[[p68<=1 & 1<=p68] & [p79<=1 & 1<=p79]] & [p16<=1 & 1<=p16]] | EX [EG [[p14<=1 & 1<=p14]]]] U [~ [EX [E [[[p79<=1 & 1<=p79] & [p48<=1 & 1<=p48]] U [p3<=1 & 1<=p3]]]] | ~ [EX [~ [[[~ [[[p79<=1 & 1<=p79] & [p35<=1 & 1<=p35]]] | [p26<=1 & 1<=p26]] | [[p80<=1 & 1<=p80] & [p43<=1 & 1<=p43]]]]]]]] U ~ [E [true U [[[[p80<=1 & 1<=p80] & [p32<=1 & 1<=p32]] | E [true U [[p79<=1 & 1<=p79] & [p6<=1 & 1<=p6]]]] | ~ [EG [[[p79<=1 & 1<=p79] & [p7<=1 & 1<=p7]]]]]]]]
abstracting: (1<=p7)
states: 19,033,300 (7)
abstracting: (p7<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
.......................
EG iterations: 23
abstracting: (1<=p6)
states: 19,033,300 (7)
abstracting: (p6<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p32)
states: 19,326,120 (7)
abstracting: (p32<=1)
states: 209,366,301 (8)
abstracting: (1<=p80)
states: 209,366,300 (8)
abstracting: (p80<=1)
states: 209,366,301 (8)
abstracting: (1<=p43)
states: 19,033,300 (7)
abstracting: (p43<=1)
states: 209,366,301 (8)
abstracting: (1<=p80)
states: 209,366,300 (8)
abstracting: (p80<=1)
states: 209,366,301 (8)
abstracting: (1<=p26)
states: 19,033,300 (7)
abstracting: (p26<=1)
states: 209,366,301 (8)
abstracting: (1<=p35)
states: 19,326,120 (7)
abstracting: (p35<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
.abstracting: (1<=p3)
states: 19,033,300 (7)
abstracting: (p3<=1)
states: 209,366,301 (8)
abstracting: (1<=p48)
states: 19,033,300 (7)
abstracting: (p48<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
.abstracting: (1<=p14)
states: 19,326,120 (7)
abstracting: (p14<=1)
states: 209,366,301 (8)
.......................
EG iterations: 23
.abstracting: (1<=p16)
states: 19,326,120 (7)
abstracting: (p16<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p68)
states: 19,033,300 (7)
abstracting: (p68<=1)
states: 209,366,301 (8)
-> the formula is FALSE
FORMULA DiscoveryGPU-PT-08a-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 5.126sec
checking: E [EF [AG [[[p61<=1 & 1<=p61] & [p79<=1 & 1<=p79]]]] U E [E [[[AG [[[p55<=1 & 1<=p55] & [p79<=1 & 1<=p79]]] | [p71<=1 & 1<=p71]] | [[p16<=1 & 1<=p16] | [[p12<=1 & 1<=p12] & [[p79<=1 & 1<=p79] & [p20<=1 & 1<=p20]]]]] U [E [[p32<=1 & 1<=p32] U [[p55<=1 & 1<=p55] & [p79<=1 & 1<=p79]]] | [AX [[[p53<=1 & 1<=p53] & [p80<=1 & 1<=p80]]] | [[p57<=1 & 1<=p57] & [p80<=1 & 1<=p80]]]]] U AF [[[p26<=1 & 1<=p26] & E [[[p10<=1 & 1<=p10] & [p79<=1 & 1<=p79]] U [[p66<=1 & 1<=p66] & [p79<=1 & 1<=p79]]]]]]]
normalized: E [E [true U ~ [E [true U ~ [[[p79<=1 & 1<=p79] & [p61<=1 & 1<=p61]]]]]] U E [E [[[[[[p20<=1 & 1<=p20] & [p79<=1 & 1<=p79]] & [p12<=1 & 1<=p12]] | [p16<=1 & 1<=p16]] | [[p71<=1 & 1<=p71] | ~ [E [true U ~ [[[p79<=1 & 1<=p79] & [p55<=1 & 1<=p55]]]]]]] U [[[[p80<=1 & 1<=p80] & [p57<=1 & 1<=p57]] | ~ [EX [~ [[[p80<=1 & 1<=p80] & [p53<=1 & 1<=p53]]]]]] | E [[p32<=1 & 1<=p32] U [[p79<=1 & 1<=p79] & [p55<=1 & 1<=p55]]]]] U ~ [EG [~ [[E [[[p79<=1 & 1<=p79] & [p10<=1 & 1<=p10]] U [[p79<=1 & 1<=p79] & [p66<=1 & 1<=p66]]] & [p26<=1 & 1<=p26]]]]]]]
abstracting: (1<=p26)
states: 19,033,300 (7)
abstracting: (p26<=1)
states: 209,366,301 (8)
abstracting: (1<=p66)
states: 19,033,300 (7)
abstracting: (p66<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p10)
states: 19,033,300 (7)
abstracting: (p10<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
.
EG iterations: 1
abstracting: (1<=p55)
states: 19,033,300 (7)
abstracting: (p55<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p32)
states: 19,326,120 (7)
abstracting: (p32<=1)
states: 209,366,301 (8)
abstracting: (1<=p53)
states: 19,033,300 (7)
abstracting: (p53<=1)
states: 209,366,301 (8)
abstracting: (1<=p80)
states: 209,366,300 (8)
abstracting: (p80<=1)
states: 209,366,301 (8)
.abstracting: (1<=p57)
states: 19,033,300 (7)
abstracting: (p57<=1)
states: 209,366,301 (8)
abstracting: (1<=p80)
states: 209,366,300 (8)
abstracting: (p80<=1)
states: 209,366,301 (8)
abstracting: (1<=p55)
states: 19,033,300 (7)
abstracting: (p55<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p71)
states: 19,326,120 (7)
abstracting: (p71<=1)
states: 209,366,301 (8)
abstracting: (1<=p16)
states: 19,326,120 (7)
abstracting: (p16<=1)
states: 209,366,301 (8)
abstracting: (1<=p12)
states: 19,326,120 (7)
abstracting: (p12<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p20)
states: 19,326,120 (7)
abstracting: (p20<=1)
states: 209,366,301 (8)
abstracting: (1<=p61)
states: 19,033,300 (7)
abstracting: (p61<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
-> the formula is FALSE
FORMULA DiscoveryGPU-PT-08a-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.879sec
checking: EF [[EG [A [[[[p25<=1 & 1<=p25] & [p79<=1 & 1<=p79]] | EG [[[p32<=1 & 1<=p32] & [p80<=1 & 1<=p80]]]] U [[p3<=1 & 1<=p3] & AF [[[p4<=1 & 1<=p4] & [p80<=1 & 1<=p80]]]]]] & [E [EF [[[p34<=1 & 1<=p34] & [p79<=1 & 1<=p79]]] U [p74<=1 & 1<=p74]] | [E [AX [[[p49<=1 & 1<=p49] & [p79<=1 & 1<=p79]]] U [[EF [[[p22<=1 & 1<=p22] & [p79<=1 & 1<=p79]]] & AF [[p60<=1 & 1<=p60]]] & [[p52<=1 & 1<=p52] & [p3<=1 & 1<=p3]]]] | [AG [[[p65<=1 & 1<=p65] & [p79<=1 & 1<=p79]]] & [[p29<=0 & 0<=p29] | [p79<=0 & 0<=p79]]]]]]]
normalized: E [true U [[[[[[p79<=0 & 0<=p79] | [p29<=0 & 0<=p29]] & ~ [E [true U ~ [[[p79<=1 & 1<=p79] & [p65<=1 & 1<=p65]]]]]] | E [~ [EX [~ [[[p79<=1 & 1<=p79] & [p49<=1 & 1<=p49]]]]] U [[[p3<=1 & 1<=p3] & [p52<=1 & 1<=p52]] & [~ [EG [~ [[p60<=1 & 1<=p60]]]] & E [true U [[p79<=1 & 1<=p79] & [p22<=1 & 1<=p22]]]]]]] | E [E [true U [[p79<=1 & 1<=p79] & [p34<=1 & 1<=p34]]] U [p74<=1 & 1<=p74]]] & EG [[~ [EG [~ [[~ [EG [~ [[[p80<=1 & 1<=p80] & [p4<=1 & 1<=p4]]]]] & [p3<=1 & 1<=p3]]]]] & ~ [E [~ [[~ [EG [~ [[[p80<=1 & 1<=p80] & [p4<=1 & 1<=p4]]]]] & [p3<=1 & 1<=p3]]] U [~ [[EG [[[p80<=1 & 1<=p80] & [p32<=1 & 1<=p32]]] | [[p79<=1 & 1<=p79] & [p25<=1 & 1<=p25]]]] & ~ [[~ [EG [~ [[[p80<=1 & 1<=p80] & [p4<=1 & 1<=p4]]]]] & [p3<=1 & 1<=p3]]]]]]]]]]
abstracting: (1<=p3)
states: 19,033,300 (7)
abstracting: (p3<=1)
states: 209,366,301 (8)
abstracting: (1<=p4)
states: 19,033,300 (7)
abstracting: (p4<=1)
states: 209,366,301 (8)
abstracting: (1<=p80)
states: 209,366,300 (8)
abstracting: (p80<=1)
states: 209,366,301 (8)
.......................
EG iterations: 23
abstracting: (1<=p25)
states: 19,033,300 (7)
abstracting: (p25<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p32)
states: 19,326,120 (7)
abstracting: (p32<=1)
states: 209,366,301 (8)
abstracting: (1<=p80)
states: 209,366,300 (8)
abstracting: (p80<=1)
states: 209,366,301 (8)
.......................
EG iterations: 23
abstracting: (1<=p3)
states: 19,033,300 (7)
abstracting: (p3<=1)
states: 209,366,301 (8)
abstracting: (1<=p4)
states: 19,033,300 (7)
abstracting: (p4<=1)
states: 209,366,301 (8)
abstracting: (1<=p80)
states: 209,366,300 (8)
abstracting: (p80<=1)
states: 209,366,301 (8)
.......................
EG iterations: 23
abstracting: (1<=p3)
states: 19,033,300 (7)
abstracting: (p3<=1)
states: 209,366,301 (8)
abstracting: (1<=p4)
states: 19,033,300 (7)
abstracting: (p4<=1)
states: 209,366,301 (8)
abstracting: (1<=p80)
states: 209,366,300 (8)
abstracting: (p80<=1)
states: 209,366,301 (8)
.......................
EG iterations: 23
EG iterations: 0
.
EG iterations: 1
abstracting: (1<=p74)
states: 19,326,120 (7)
abstracting: (p74<=1)
states: 209,366,301 (8)
abstracting: (1<=p34)
states: 19,326,120 (7)
abstracting: (p34<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p22)
states: 19,033,300 (7)
abstracting: (p22<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p60)
states: 19,033,300 (7)
abstracting: (p60<=1)
states: 209,366,301 (8)
........................
EG iterations: 24
abstracting: (1<=p52)
states: 19,033,300 (7)
abstracting: (p52<=1)
states: 209,366,301 (8)
abstracting: (1<=p3)
states: 19,033,300 (7)
abstracting: (p3<=1)
states: 209,366,301 (8)
abstracting: (1<=p49)
states: 19,033,300 (7)
abstracting: (p49<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
.abstracting: (1<=p65)
states: 19,033,300 (7)
abstracting: (p65<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (0<=p29)
states: 209,366,301 (8)
abstracting: (p29<=0)
states: 190,333,001 (8)
abstracting: (0<=p79)
states: 209,366,301 (8)
abstracting: (p79<=0)
states: 1
-> the formula is FALSE
FORMULA DiscoveryGPU-PT-08a-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.152sec
checking: A [[AG [[[[[[p49<=1 & 1<=p49] & [p79<=1 & 1<=p79]] & [[p35<=1 & 1<=p35] & [p79<=1 & 1<=p79]]] | [p71<=1 & 1<=p71]] | [AX [[p23<=1 & 1<=p23]] | EG [[p23<=1 & 1<=p23]]]]] & ~ [EF [[[p25<=1 & 1<=p25] & [p79<=1 & 1<=p79]]]]] U E [[AX [~ [[[[p4<=1 & 1<=p4] & [p80<=1 & 1<=p80]] | [[p6<=1 & 1<=p6] & [p79<=1 & 1<=p79]]]]] | EG [[[[[p74<=1 & 1<=p74] & [p79<=1 & 1<=p79]] | [p6<=1 & 1<=p6]] & E [[[p31<=1 & 1<=p31] & [p79<=1 & 1<=p79]] U [[p49<=1 & 1<=p49] & [p79<=1 & 1<=p79]]]]]] U [[p32<=1 & 1<=p32] & [[[p8<=1 & 1<=p8] & [p80<=1 & 1<=p80]] | [[p35<=1 & 1<=p35] & [p79<=1 & 1<=p79]]]]]]
normalized: [~ [EG [~ [E [[EG [[E [[[p79<=1 & 1<=p79] & [p31<=1 & 1<=p31]] U [[p79<=1 & 1<=p79] & [p49<=1 & 1<=p49]]] & [[p6<=1 & 1<=p6] | [[p79<=1 & 1<=p79] & [p74<=1 & 1<=p74]]]]] | ~ [EX [[[[p79<=1 & 1<=p79] & [p6<=1 & 1<=p6]] | [[p80<=1 & 1<=p80] & [p4<=1 & 1<=p4]]]]]] U [[[[p79<=1 & 1<=p79] & [p35<=1 & 1<=p35]] | [[p80<=1 & 1<=p80] & [p8<=1 & 1<=p8]]] & [p32<=1 & 1<=p32]]]]]] & ~ [E [~ [E [[EG [[E [[[p79<=1 & 1<=p79] & [p31<=1 & 1<=p31]] U [[p79<=1 & 1<=p79] & [p49<=1 & 1<=p49]]] & [[p6<=1 & 1<=p6] | [[p79<=1 & 1<=p79] & [p74<=1 & 1<=p74]]]]] | ~ [EX [[[[p79<=1 & 1<=p79] & [p6<=1 & 1<=p6]] | [[p80<=1 & 1<=p80] & [p4<=1 & 1<=p4]]]]]] U [[[[p79<=1 & 1<=p79] & [p35<=1 & 1<=p35]] | [[p80<=1 & 1<=p80] & [p8<=1 & 1<=p8]]] & [p32<=1 & 1<=p32]]]] U [~ [[~ [E [true U [[p79<=1 & 1<=p79] & [p25<=1 & 1<=p25]]]] & ~ [E [true U ~ [[[EG [[p23<=1 & 1<=p23]] | ~ [EX [~ [[p23<=1 & 1<=p23]]]]] | [[p71<=1 & 1<=p71] | [[[p79<=1 & 1<=p79] & [p35<=1 & 1<=p35]] & [[p79<=1 & 1<=p79] & [p49<=1 & 1<=p49]]]]]]]]]] & ~ [E [[EG [[E [[[p79<=1 & 1<=p79] & [p31<=1 & 1<=p31]] U [[p79<=1 & 1<=p79] & [p49<=1 & 1<=p49]]] & [[p6<=1 & 1<=p6] | [[p79<=1 & 1<=p79] & [p74<=1 & 1<=p74]]]]] | ~ [EX [[[[p79<=1 & 1<=p79] & [p6<=1 & 1<=p6]] | [[p80<=1 & 1<=p80] & [p4<=1 & 1<=p4]]]]]] U [[[[p79<=1 & 1<=p79] & [p35<=1 & 1<=p35]] | [[p80<=1 & 1<=p80] & [p8<=1 & 1<=p8]]] & [p32<=1 & 1<=p32]]]]]]]]
abstracting: (1<=p32)
states: 19,326,120 (7)
abstracting: (p32<=1)
states: 209,366,301 (8)
abstracting: (1<=p8)
states: 19,033,300 (7)
abstracting: (p8<=1)
states: 209,366,301 (8)
abstracting: (1<=p80)
states: 209,366,300 (8)
abstracting: (p80<=1)
states: 209,366,301 (8)
abstracting: (1<=p35)
states: 19,326,120 (7)
abstracting: (p35<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p4)
states: 19,033,300 (7)
abstracting: (p4<=1)
states: 209,366,301 (8)
abstracting: (1<=p80)
states: 209,366,300 (8)
abstracting: (p80<=1)
states: 209,366,301 (8)
abstracting: (1<=p6)
states: 19,033,300 (7)
abstracting: (p6<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
.abstracting: (1<=p74)
states: 19,326,120 (7)
abstracting: (p74<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p6)
states: 19,033,300 (7)
abstracting: (p6<=1)
states: 209,366,301 (8)
abstracting: (1<=p49)
states: 19,033,300 (7)
abstracting: (p49<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p31)
states: 19,326,120 (7)
abstracting: (p31<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
....................
EG iterations: 20
abstracting: (1<=p49)
states: 19,033,300 (7)
abstracting: (p49<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p35)
states: 19,326,120 (7)
abstracting: (p35<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p71)
states: 19,326,120 (7)
abstracting: (p71<=1)
states: 209,366,301 (8)
abstracting: (1<=p23)
states: 19,033,300 (7)
abstracting: (p23<=1)
states: 209,366,301 (8)
.abstracting: (1<=p23)
states: 19,033,300 (7)
abstracting: (p23<=1)
states: 209,366,301 (8)
.......................
EG iterations: 23
abstracting: (1<=p25)
states: 19,033,300 (7)
abstracting: (p25<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p32)
states: 19,326,120 (7)
abstracting: (p32<=1)
states: 209,366,301 (8)
abstracting: (1<=p8)
states: 19,033,300 (7)
abstracting: (p8<=1)
states: 209,366,301 (8)
abstracting: (1<=p80)
states: 209,366,300 (8)
abstracting: (p80<=1)
states: 209,366,301 (8)
abstracting: (1<=p35)
states: 19,326,120 (7)
abstracting: (p35<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p4)
states: 19,033,300 (7)
abstracting: (p4<=1)
states: 209,366,301 (8)
abstracting: (1<=p80)
states: 209,366,300 (8)
abstracting: (p80<=1)
states: 209,366,301 (8)
abstracting: (1<=p6)
states: 19,033,300 (7)
abstracting: (p6<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
.abstracting: (1<=p74)
states: 19,326,120 (7)
abstracting: (p74<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p6)
states: 19,033,300 (7)
abstracting: (p6<=1)
states: 209,366,301 (8)
abstracting: (1<=p49)
states: 19,033,300 (7)
abstracting: (p49<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p31)
states: 19,326,120 (7)
abstracting: (p31<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
....................
EG iterations: 20
abstracting: (1<=p32)
states: 19,326,120 (7)
abstracting: (p32<=1)
states: 209,366,301 (8)
abstracting: (1<=p8)
states: 19,033,300 (7)
abstracting: (p8<=1)
states: 209,366,301 (8)
abstracting: (1<=p80)
states: 209,366,300 (8)
abstracting: (p80<=1)
states: 209,366,301 (8)
abstracting: (1<=p35)
states: 19,326,120 (7)
abstracting: (p35<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p4)
states: 19,033,300 (7)
abstracting: (p4<=1)
states: 209,366,301 (8)
abstracting: (1<=p80)
states: 209,366,300 (8)
abstracting: (p80<=1)
states: 209,366,301 (8)
abstracting: (1<=p6)
states: 19,033,300 (7)
abstracting: (p6<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
.abstracting: (1<=p74)
states: 19,326,120 (7)
abstracting: (p74<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p6)
states: 19,033,300 (7)
abstracting: (p6<=1)
states: 209,366,301 (8)
abstracting: (1<=p49)
states: 19,033,300 (7)
abstracting: (p49<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p31)
states: 19,326,120 (7)
abstracting: (p31<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
....................
EG iterations: 20
.
EG iterations: 1
-> the formula is TRUE
FORMULA DiscoveryGPU-PT-08a-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.478sec
checking: AX [[[[AG [EF [[[[p34<=1 & 1<=p34] & [p79<=1 & 1<=p79]] & [[p10<=1 & 1<=p10] & [p79<=1 & 1<=p79]]]]] | [p50<=1 & 1<=p50]] | [AG [AX [[[p15<=0 & 0<=p15] | [p79<=0 & 0<=p79]]]] | [EG [[[p39<=0 & 0<=p39] | [p79<=0 & 0<=p79]]] & [~ [A [[p76<=1 & 1<=p76] U [p63<=1 & 1<=p63]]] | [[p59<=1 & 1<=p59] & [p79<=1 & 1<=p79]]]]]] | [[[AX [[[p58<=1 & 1<=p58] & [p79<=1 & 1<=p79]]] & [AG [[[p71<=0 & 0<=p71] | [p80<=0 & 0<=p80]]] & [[[p42<=0 & 0<=p42] | [p80<=0 & 0<=p80]] | [[p22<=0 & 0<=p22] | [p79<=0 & 0<=p79]]]]] | [EF [[[p38<=1 & 1<=p38] & [p79<=1 & 1<=p79]]] & A [[p14<=1 & 1<=p14] U [[p16<=1 & 1<=p16] & [p79<=1 & 1<=p79]]]]] | [[[p21<=1 & 1<=p21] & [EG [[[p45<=1 & 1<=p45] & [p79<=1 & 1<=p79]]] & [[[p38<=1 & 1<=p38] & [p79<=1 & 1<=p79]] | [[p74<=1 & 1<=p74] & [p79<=1 & 1<=p79]]]]] | [A [[[p2<=1 & 1<=p2] & [p79<=1 & 1<=p79]] U [[p31<=1 & 1<=p31] & [p79<=1 & 1<=p79]]] & [p6<=1 & 1<=p6]]]]]]
normalized: ~ [EX [~ [[[[[[EG [[[p45<=1 & 1<=p45] & [p79<=1 & 1<=p79]]] & [[[p79<=1 & 1<=p79] & [p74<=1 & 1<=p74]] | [[p79<=1 & 1<=p79] & [p38<=1 & 1<=p38]]]] & [p21<=1 & 1<=p21]] | [[~ [EG [~ [[[p79<=1 & 1<=p79] & [p31<=1 & 1<=p31]]]]] & ~ [E [~ [[[p79<=1 & 1<=p79] & [p31<=1 & 1<=p31]]] U [~ [[[p79<=1 & 1<=p79] & [p2<=1 & 1<=p2]]] & ~ [[[p79<=1 & 1<=p79] & [p31<=1 & 1<=p31]]]]]]] & [p6<=1 & 1<=p6]]] | [[[~ [EG [~ [[[p79<=1 & 1<=p79] & [p16<=1 & 1<=p16]]]]] & ~ [E [~ [[[p79<=1 & 1<=p79] & [p16<=1 & 1<=p16]]] U [~ [[p14<=1 & 1<=p14]] & ~ [[[p79<=1 & 1<=p79] & [p16<=1 & 1<=p16]]]]]]] & E [true U [[p79<=1 & 1<=p79] & [p38<=1 & 1<=p38]]]] | [[[[[p79<=0 & 0<=p79] | [p22<=0 & 0<=p22]] | [[p80<=0 & 0<=p80] | [p42<=0 & 0<=p42]]] & ~ [E [true U ~ [[[p80<=0 & 0<=p80] | [p71<=0 & 0<=p71]]]]]] & ~ [EX [~ [[[p79<=1 & 1<=p79] & [p58<=1 & 1<=p58]]]]]]]] | [[[[[[p79<=1 & 1<=p79] & [p59<=1 & 1<=p59]] | ~ [[~ [EG [~ [[p63<=1 & 1<=p63]]]] & ~ [E [~ [[p63<=1 & 1<=p63]] U [~ [[p76<=1 & 1<=p76]] & ~ [[p63<=1 & 1<=p63]]]]]]]] & EG [[[p79<=0 & 0<=p79] | [p39<=0 & 0<=p39]]]] | ~ [E [true U EX [~ [[[p79<=0 & 0<=p79] | [p15<=0 & 0<=p15]]]]]]] | [[p50<=1 & 1<=p50] | ~ [E [true U ~ [E [true U [[[p79<=1 & 1<=p79] & [p10<=1 & 1<=p10]] & [[p79<=1 & 1<=p79] & [p34<=1 & 1<=p34]]]]]]]]]]]]]
abstracting: (1<=p34)
states: 19,326,120 (7)
abstracting: (p34<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p10)
states: 19,033,300 (7)
abstracting: (p10<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p50)
states: 19,033,300 (7)
abstracting: (p50<=1)
states: 209,366,301 (8)
abstracting: (0<=p15)
states: 209,366,301 (8)
abstracting: (p15<=0)
states: 190,040,181 (8)
abstracting: (0<=p79)
states: 209,366,301 (8)
abstracting: (p79<=0)
states: 1
.abstracting: (0<=p39)
states: 209,366,301 (8)
abstracting: (p39<=0)
states: 190,040,181 (8)
abstracting: (0<=p79)
states: 209,366,301 (8)
abstracting: (p79<=0)
states: 1
..
EG iterations: 2
abstracting: (1<=p63)
states: 19,033,300 (7)
abstracting: (p63<=1)
states: 209,366,301 (8)
abstracting: (1<=p76)
states: 19,326,120 (7)
abstracting: (p76<=1)
states: 209,366,301 (8)
abstracting: (1<=p63)
states: 19,033,300 (7)
abstracting: (p63<=1)
states: 209,366,301 (8)
abstracting: (1<=p63)
states: 19,033,300 (7)
abstracting: (p63<=1)
states: 209,366,301 (8)
.......................
EG iterations: 23
abstracting: (1<=p59)
states: 19,033,300 (7)
abstracting: (p59<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p58)
states: 19,033,300 (7)
abstracting: (p58<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
.abstracting: (0<=p71)
states: 209,366,301 (8)
abstracting: (p71<=0)
states: 190,040,181 (8)
abstracting: (0<=p80)
states: 209,366,301 (8)
abstracting: (p80<=0)
states: 1
abstracting: (0<=p42)
states: 209,366,301 (8)
abstracting: (p42<=0)
states: 190,333,001 (8)
abstracting: (0<=p80)
states: 209,366,301 (8)
abstracting: (p80<=0)
states: 1
abstracting: (0<=p22)
states: 209,366,301 (8)
abstracting: (p22<=0)
states: 190,333,001 (8)
abstracting: (0<=p79)
states: 209,366,301 (8)
abstracting: (p79<=0)
states: 1
abstracting: (1<=p38)
states: 19,326,120 (7)
abstracting: (p38<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p16)
states: 19,326,120 (7)
abstracting: (p16<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p14)
states: 19,326,120 (7)
abstracting: (p14<=1)
states: 209,366,301 (8)
abstracting: (1<=p16)
states: 19,326,120 (7)
abstracting: (p16<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p16)
states: 19,326,120 (7)
abstracting: (p16<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
.......................
EG iterations: 23
abstracting: (1<=p6)
states: 19,033,300 (7)
abstracting: (p6<=1)
states: 209,366,301 (8)
abstracting: (1<=p31)
states: 19,326,120 (7)
abstracting: (p31<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p2)
states: 19,033,300 (7)
abstracting: (p2<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p31)
states: 19,326,120 (7)
abstracting: (p31<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p31)
states: 19,326,120 (7)
abstracting: (p31<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
.......................
EG iterations: 23
abstracting: (1<=p21)
states: 19,033,300 (7)
abstracting: (p21<=1)
states: 209,366,301 (8)
abstracting: (1<=p38)
states: 19,326,120 (7)
abstracting: (p38<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p74)
states: 19,326,120 (7)
abstracting: (p74<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p79)
states: 209,366,300 (8)
abstracting: (p79<=1)
states: 209,366,301 (8)
abstracting: (1<=p45)
states: 19,033,300 (7)
abstracting: (p45<=1)
states: 209,366,301 (8)
.......................
EG iterations: 23
.-> the formula is FALSE
FORMULA DiscoveryGPU-PT-08a-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.591sec
totally nodes used: 13969307 (1.4e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 16288278 35438715 51726993
used/not used/entry size/cache size: 32575883 34532981 16 1024MB
basic ops cache: hits/miss/sum: 7978481 17023354 25001835
used/not used/entry size/cache size: 14227054 2550162 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: 52941 118527 171468
used/not used/entry size/cache size: 117731 8270877 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 54924255
1 10614499
2 1380562
3 167622
4 19360
5 2219
6 247
7 47
8 17
9 27
>= 10 9
Total processing time: 0m43.902sec
BK_STOP 1678744589864
--------------------
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:2902 (28), effective:81 (0)
initing FirstDep: 0m 0.000sec
iterations count:227 (2), effective:3 (0)
iterations count:273 (2), effective:4 (0)
iterations count:104 (1), effective:1 (0)
iterations count:2608 (25), effective:81 (0)
iterations count:154 (1), effective:1 (0)
iterations count:103 (1), effective:0 (0)
iterations count:191 (1), effective:3 (0)
iterations count:104 (1), effective:1 (0)
iterations count:155 (1), effective:2 (0)
iterations count:395 (3), effective:7 (0)
iterations count:113 (1), effective:1 (0)
iterations count:123 (1), effective:2 (0)
iterations count:875 (8), effective:20 (0)
iterations count:342 (3), effective:8 (0)
iterations count:345 (3), effective:11 (0)
iterations count:107 (1), effective:1 (0)
iterations count:734 (7), effective:14 (0)
iterations count:194 (1), effective:1 (0)
iterations count:106 (1), effective:1 (0)
iterations count:470 (4), effective:8 (0)
iterations count:105 (1), effective:1 (0)
iterations count:522 (5), effective:9 (0)
iterations count:224 (2), effective:2 (0)
iterations count:256 (2), effective:5 (0)
iterations count:103 (1), effective:0 (0)
iterations count:277 (2), effective:7 (0)
iterations count:202 (1), effective:7 (0)
iterations count:208 (2), effective:3 (0)
iterations count:260 (2), effective:4 (0)
iterations count:104 (1), effective:1 (0)
iterations count:2124 (20), effective:62 (0)
iterations count:338 (3), effective:7 (0)
iterations count:200 (1), effective:1 (0)
iterations count:103 (1), effective:0 (0)
iterations count:159 (1), effective:4 (0)
iterations count:357 (3), effective:7 (0)
iterations count:358 (3), effective:5 (0)
iterations count:426 (4), effective:9 (0)
iterations count:103 (1), effective:0 (0)
iterations count:104 (1), effective:1 (0)
iterations count:103 (1), effective:0 (0)
iterations count:471 (4), effective:10 (0)
iterations count:1650 (16), effective:46 (0)
iterations count:343 (3), effective:7 (0)
iterations count:103 (1), effective:0 (0)
iterations count:471 (4), effective:10 (0)
iterations count:103 (1), effective:0 (0)
iterations count:103 (1), effective:0 (0)
iterations count:471 (4), effective:10 (0)
iterations count:357 (3), effective:7 (0)
iterations count:171 (1), effective:2 (0)
iterations count:327 (3), effective:6 (0)
iterations count:106 (1), effective:1 (0)
iterations count:581 (5), effective:8 (0)
iterations count:191 (1), effective:3 (0)
iterations count:106 (1), effective:1 (0)
iterations count:110 (1), effective:1 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-08a"
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-08a, 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-167819420300314"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-08a.tgz
mv DiscoveryGPU-PT-08a 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 ;