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-167819420500394.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-13a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819420500394
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.2K Feb 25 13:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 13:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 13:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 13:42 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 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 25 13:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 13:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 13:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:00 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 46K 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-13a-CTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678795181543

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-13a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-14 11:59:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 11:59:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 11:59:44] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2023-03-14 11:59:44] [INFO ] Transformed 133 places.
[2023-03-14 11:59:44] [INFO ] Transformed 183 transitions.
[2023-03-14 11:59:44] [INFO ] Found NUPN structural information;
[2023-03-14 11:59:44] [INFO ] Parsed PT model containing 133 places and 183 transitions and 588 arcs in 246 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-13a-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 80 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 183/183 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 128 transition count 178
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 128 transition count 178
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 23 place count 128 transition count 165
Applied a total of 23 rules in 46 ms. Remains 128 /133 variables (removed 5) and now considering 165/183 (removed 18) transitions.
// Phase 1: matrix 165 rows 128 cols
[2023-03-14 11:59:44] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-14 11:59:44] [INFO ] Implicit Places using invariants in 370 ms returned []
[2023-03-14 11:59:44] [INFO ] Invariant cache hit.
[2023-03-14 11:59:45] [INFO ] State equation strengthened by 104 read => feed constraints.
[2023-03-14 11:59:45] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
[2023-03-14 11:59:45] [INFO ] Invariant cache hit.
[2023-03-14 11:59:45] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 128/133 places, 165/183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 957 ms. Remains : 128/133 places, 165/183 transitions.
Support contains 80 out of 128 places after structural reductions.
[2023-03-14 11:59:45] [INFO ] Flatten gal took : 72 ms
[2023-03-14 11:59:45] [INFO ] Flatten gal took : 38 ms
[2023-03-14 11:59:46] [INFO ] Input system was already deterministic with 165 transitions.
Support contains 79 out of 128 places (down from 80) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 462 ms. (steps per millisecond=21 ) properties (out of 80) seen :78
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-14 11:59:46] [INFO ] Invariant cache hit.
[2023-03-14 11:59:46] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-14 11:59:46] [INFO ] After 195ms 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-14 11:59:46] [INFO ] Flatten gal took : 17 ms
[2023-03-14 11:59:46] [INFO ] Flatten gal took : 20 ms
[2023-03-14 11:59:46] [INFO ] Input system was already deterministic with 165 transitions.
Computed a total of 16 stabilizing places and 14 stable transitions
Graph (complete) has 363 edges and 128 vertex of which 120 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 165/165 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 117 transition count 154
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 117 transition count 154
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 106 transition count 143
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 106 transition count 143
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 99 transition count 136
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 99 transition count 136
Applied a total of 58 rules in 43 ms. Remains 99 /128 variables (removed 29) and now considering 136/165 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 99/128 places, 136/165 transitions.
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 12 ms
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 15 ms
[2023-03-14 11:59:47] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 165/165 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 116 transition count 153
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 116 transition count 153
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 35 place count 105 transition count 142
Iterating global reduction 0 with 11 rules applied. Total rules applied 46 place count 105 transition count 142
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 98 transition count 135
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 98 transition count 135
Applied a total of 60 rules in 31 ms. Remains 98 /128 variables (removed 30) and now considering 135/165 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 98/128 places, 135/165 transitions.
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 12 ms
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 14 ms
[2023-03-14 11:59:47] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 165/165 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 116 transition count 153
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 116 transition count 153
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 104 transition count 141
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 104 transition count 141
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 97 transition count 134
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 97 transition count 134
Applied a total of 62 rules in 22 ms. Remains 97 /128 variables (removed 31) and now considering 134/165 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 97/128 places, 134/165 transitions.
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 12 ms
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 14 ms
[2023-03-14 11:59:47] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 165/165 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 118 transition count 155
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 118 transition count 155
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 108 transition count 145
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 108 transition count 145
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 102 transition count 139
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 102 transition count 139
Applied a total of 52 rules in 16 ms. Remains 102 /128 variables (removed 26) and now considering 139/165 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 102/128 places, 139/165 transitions.
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 13 ms
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 13 ms
[2023-03-14 11:59:47] [INFO ] Input system was already deterministic with 139 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 165/165 transitions.
Graph (complete) has 363 edges and 128 vertex of which 121 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 1 place count 121 transition count 146
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 25 place count 109 transition count 146
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 35 place count 99 transition count 136
Iterating global reduction 0 with 10 rules applied. Total rules applied 45 place count 99 transition count 136
Applied a total of 45 rules in 40 ms. Remains 99 /128 variables (removed 29) and now considering 136/165 (removed 29) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 99/128 places, 136/165 transitions.
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 11 ms
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 12 ms
[2023-03-14 11:59:47] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 165/165 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 117 transition count 154
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 117 transition count 154
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 108 transition count 145
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 108 transition count 145
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 103 transition count 140
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 103 transition count 140
Applied a total of 50 rules in 11 ms. Remains 103 /128 variables (removed 25) and now considering 140/165 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 103/128 places, 140/165 transitions.
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 10 ms
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 11 ms
[2023-03-14 11:59:47] [INFO ] Input system was already deterministic with 140 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 165/165 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 117 transition count 154
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 117 transition count 154
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 106 transition count 143
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 106 transition count 143
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 99 transition count 136
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 99 transition count 136
Applied a total of 58 rules in 9 ms. Remains 99 /128 variables (removed 29) and now considering 136/165 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 99/128 places, 136/165 transitions.
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 10 ms
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 12 ms
[2023-03-14 11:59:47] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 165/165 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 120 transition count 157
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 120 transition count 157
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 113 transition count 150
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 113 transition count 150
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 108 transition count 145
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 108 transition count 145
Applied a total of 40 rules in 8 ms. Remains 108 /128 variables (removed 20) and now considering 145/165 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 108/128 places, 145/165 transitions.
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 10 ms
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 11 ms
[2023-03-14 11:59:47] [INFO ] Input system was already deterministic with 145 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 165/165 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 116 transition count 153
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 116 transition count 153
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 104 transition count 141
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 104 transition count 141
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 97 transition count 134
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 97 transition count 134
Applied a total of 62 rules in 8 ms. Remains 97 /128 variables (removed 31) and now considering 134/165 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 97/128 places, 134/165 transitions.
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 10 ms
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 9 ms
[2023-03-14 11:59:47] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 165/165 transitions.
Graph (complete) has 363 edges and 128 vertex of which 120 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 1 place count 120 transition count 144
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 27 place count 107 transition count 144
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 39 place count 95 transition count 132
Iterating global reduction 0 with 12 rules applied. Total rules applied 51 place count 95 transition count 132
Applied a total of 51 rules in 22 ms. Remains 95 /128 variables (removed 33) and now considering 132/165 (removed 33) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 95/128 places, 132/165 transitions.
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 9 ms
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 9 ms
[2023-03-14 11:59:47] [INFO ] Input system was already deterministic with 132 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 165/165 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 118 transition count 155
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 118 transition count 155
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 111 transition count 148
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 111 transition count 148
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 108 transition count 145
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 108 transition count 145
Applied a total of 40 rules in 7 ms. Remains 108 /128 variables (removed 20) and now considering 145/165 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 108/128 places, 145/165 transitions.
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 10 ms
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 10 ms
[2023-03-14 11:59:47] [INFO ] Input system was already deterministic with 145 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 165/165 transitions.
Graph (complete) has 363 edges and 128 vertex of which 121 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 1 place count 121 transition count 146
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 25 place count 109 transition count 146
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 35 place count 99 transition count 136
Iterating global reduction 0 with 10 rules applied. Total rules applied 45 place count 99 transition count 136
Applied a total of 45 rules in 21 ms. Remains 99 /128 variables (removed 29) and now considering 136/165 (removed 29) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 99/128 places, 136/165 transitions.
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 11 ms
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 10 ms
[2023-03-14 11:59:47] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 165/165 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 116 transition count 153
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 116 transition count 153
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 104 transition count 141
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 104 transition count 141
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 97 transition count 134
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 97 transition count 134
Applied a total of 62 rules in 7 ms. Remains 97 /128 variables (removed 31) and now considering 134/165 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 97/128 places, 134/165 transitions.
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 8 ms
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 8 ms
[2023-03-14 11:59:47] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 165/165 transitions.
Graph (complete) has 363 edges and 128 vertex of which 120 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 1 place count 120 transition count 145
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 25 place count 108 transition count 145
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 36 place count 97 transition count 134
Iterating global reduction 0 with 11 rules applied. Total rules applied 47 place count 97 transition count 134
Applied a total of 47 rules in 20 ms. Remains 97 /128 variables (removed 31) and now considering 134/165 (removed 31) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 97/128 places, 134/165 transitions.
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 6 ms
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 7 ms
[2023-03-14 11:59:47] [INFO ] Input system was already deterministic with 134 transitions.
Finished random walk after 98 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=98 )
FORMULA DiscoveryGPU-PT-13a-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 165/165 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 117 transition count 154
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 117 transition count 154
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 106 transition count 143
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 106 transition count 143
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 100 transition count 137
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 100 transition count 137
Applied a total of 56 rules in 8 ms. Remains 100 /128 variables (removed 28) and now considering 137/165 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 100/128 places, 137/165 transitions.
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 7 ms
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 8 ms
[2023-03-14 11:59:47] [INFO ] Input system was already deterministic with 137 transitions.
[2023-03-14 11:59:47] [INFO ] Flatten gal took : 10 ms
[2023-03-14 11:59:48] [INFO ] Flatten gal took : 9 ms
[2023-03-14 11:59:48] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2023-03-14 11:59:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 128 places, 165 transitions and 531 arcs took 2 ms.
Total runtime 3872 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: 128 NrTr: 165 NrArc: 531)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.004sec

net check time: 0m 0.000sec

init dd package: 0m 3.787sec


RS generation: 1m10.247sec


-> reachability set: #nodes 472420 (4.7e+05) #states 31,179,473,600,001 (13)



starting MCC model checker
--------------------------

checking: EX [[p50<=1 & 1<=p50]]
normalized: EX [[p50<=1 & 1<=p50]]

abstracting: (1<=p50)
states: 2,834,497,600,000 (12)
abstracting: (p50<=1)
states: 31,179,473,600,001 (13)
MC time: 4m15.231sec

checking: AG [~ [E [[[1<=p10 & p10<=1] & [p126<=1 & 1<=p126]] U AX [EG [[[p2<=1 & 1<=p2] & [p126<=1 & 1<=p126]]]]]]]
normalized: ~ [E [true U E [[[p126<=1 & 1<=p126] & [1<=p10 & p10<=1]] U ~ [EX [~ [EG [[[p2<=1 & 1<=p2] & [p126<=1 & 1<=p126]]]]]]]]]

abstracting: (1<=p126)
states: 31,179,473,600,000 (13)
abstracting: (p126<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p2)
states: 2,923,075,650,000 (12)
abstracting: (p2<=1)
states: 31,179,473,600,001 (13)

before gc: list nodes free: 964525

after gc: idd nodes used:7791958, unused:56208042; list nodes free:340153789
MC time: 4m 3.517sec

checking: EF [[AX [AF [[[p125<=1 & 1<=p125] & [p126<=1 & 1<=p126]]]] & AG [[[p31<=0 & 0<=p31] | [p126<=0 & 0<=p126]]]]]
normalized: E [true U [~ [E [true U ~ [[[p126<=0 & 0<=p126] | [p31<=0 & 0<=p31]]]]] & ~ [EX [EG [~ [[[p126<=1 & 1<=p126] & [p125<=1 & 1<=p125]]]]]]]]

abstracting: (1<=p125)
states: 2,923,075,650,000 (12)
abstracting: (p125<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p126)
states: 31,179,473,600,000 (13)
abstracting: (p126<=1)
states: 31,179,473,600,001 (13)

before gc: list nodes free: 4848367

after gc: idd nodes used:2125796, unused:61874204; list nodes free:372721010
MC time: 3m47.268sec

checking: AG [E [~ [[[p111<=1 & 1<=p111] & [p126<=1 & 1<=p126]]] U EG [[[p68<=1 & 1<=p68] & [p126<=1 & 1<=p126]]]]]
normalized: ~ [E [true U ~ [E [~ [[[p126<=1 & 1<=p126] & [p111<=1 & 1<=p111]]] U EG [[[p126<=1 & 1<=p126] & [p68<=1 & 1<=p68]]]]]]]

abstracting: (1<=p68)
states: 2,923,075,650,000 (12)
abstracting: (p68<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p126)
states: 31,179,473,600,000 (13)
abstracting: (p126<=1)
states: 31,179,473,600,001 (13)

before gc: list nodes free: 1579172

after gc: idd nodes used:11081440, unused:52918560; list nodes free:323595737
MC time: 3m23.011sec

checking: EF [[[AX [[[p21<=1 & 1<=p21] & [[p117<=1 & 1<=p117] & [p126<=1 & 1<=p126]]]] & [p119<=1 & 1<=p119]] & [[p54<=1 & 1<=p54] & [p126<=1 & 1<=p126]]]]
normalized: E [true U [[[p126<=1 & 1<=p126] & [p54<=1 & 1<=p54]] & [[p119<=1 & 1<=p119] & ~ [EX [~ [[[[p126<=1 & 1<=p126] & [p117<=1 & 1<=p117]] & [p21<=1 & 1<=p21]]]]]]]]

abstracting: (1<=p21)
states: 2,834,497,600,000 (12)
abstracting: (p21<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p117)
states: 2,923,075,650,000 (12)
abstracting: (p117<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p126)
states: 31,179,473,600,000 (13)
abstracting: (p126<=1)
states: 31,179,473,600,001 (13)

before gc: list nodes free: 3834935

after gc: idd nodes used:23044382, unused:40955618; list nodes free:249767866
MC time: 3m14.360sec

checking: EX [[AX [A [[p100<=1 & 1<=p100] U [[p43<=1 & 1<=p43] & [p127<=1 & 1<=p127]]]] | [AG [[[p48<=1 & 1<=p48] & [[p126<=1 & 1<=p126] & [p102<=1 & 1<=p102]]]] | [p75<=0 & 0<=p75]]]]
normalized: EX [[[~ [E [true U ~ [[[[p102<=1 & 1<=p102] & [p126<=1 & 1<=p126]] & [p48<=1 & 1<=p48]]]]] | [p75<=0 & 0<=p75]] | ~ [EX [~ [[~ [EG [~ [[[p127<=1 & 1<=p127] & [p43<=1 & 1<=p43]]]]] & ~ [E [~ [[[p127<=1 & 1<=p127] & [p43<=1 & 1<=p43]]] U [~ [[p100<=1 & 1<=p100]] & ~ [[[p127<=1 & 1<=p127] & [p43<=1 & 1<=p43]]]]]]]]]]]]

abstracting: (1<=p43)
states: 2,834,497,600,000 (12)
abstracting: (p43<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p127)
states: 31,179,473,600,000 (13)
abstracting: (p127<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p100)
states: 2,834,497,600,000 (12)
abstracting: (p100<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p43)
states: 2,834,497,600,000 (12)
abstracting: (p43<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p127)
states: 31,179,473,600,000 (13)
abstracting: (p127<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p43)
states: 2,834,497,600,000 (12)
abstracting: (p43<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p127)
states: 31,179,473,600,000 (13)
abstracting: (p127<=1)
states: 31,179,473,600,001 (13)
MC time: 2m54.036sec

checking: EF [EX [E [AX [[[p81<=1 & 1<=p81] | [[p89<=1 & 1<=p89] & [p127<=1 & 1<=p127]]]] U [~ [[p75<=1 & 1<=p75]] & [[p71<=1 & 1<=p71] & [EG [[[p38<=1 & 1<=p38] & [p126<=1 & 1<=p126]]] | EF [[[p29<=1 & 1<=p29] & [p126<=1 & 1<=p126]]]]]]]]]
normalized: E [true U EX [E [~ [EX [~ [[[[p127<=1 & 1<=p127] & [p89<=1 & 1<=p89]] | [p81<=1 & 1<=p81]]]]] U [[[E [true U [[p29<=1 & 1<=p29] & [p126<=1 & 1<=p126]]] | EG [[[p126<=1 & 1<=p126] & [p38<=1 & 1<=p38]]]] & [p71<=1 & 1<=p71]] & ~ [[p75<=1 & 1<=p75]]]]]]

abstracting: (1<=p75)
states: 2,923,075,650,000 (12)
abstracting: (p75<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p71)
states: 2,923,075,650,000 (12)
abstracting: (p71<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p38)
states: 2,923,075,650,000 (12)
abstracting: (p38<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p126)
states: 31,179,473,600,000 (13)
abstracting: (p126<=1)
states: 31,179,473,600,001 (13)

before gc: list nodes free: 16023898

after gc: idd nodes used:11745185, unused:52254815; list nodes free:320105492
MC time: 2m47.101sec

checking: AG [E [[[AG [[p78<=1 & 1<=p78]] | EG [[[p116<=1 & 1<=p116] & [p126<=1 & 1<=p126]]]] | [AF [~ [[[[p45<=1 & 1<=p45] & [p126<=1 & 1<=p126]] & [[p9<=1 & 1<=p9] & [p126<=1 & 1<=p126]]]]] | [[p102<=1 & 1<=p102] | [[p12<=1 & 1<=p12] & [p126<=1 & 1<=p126]]]]] U [[p77<=1 & 1<=p77] & [p126<=1 & 1<=p126]]]]
normalized: ~ [E [true U ~ [E [[[[[[p126<=1 & 1<=p126] & [p12<=1 & 1<=p12]] | [p102<=1 & 1<=p102]] | ~ [EG [[[[p126<=1 & 1<=p126] & [p9<=1 & 1<=p9]] & [[p126<=1 & 1<=p126] & [p45<=1 & 1<=p45]]]]]] | [EG [[[p126<=1 & 1<=p126] & [p116<=1 & 1<=p116]]] | ~ [E [true U ~ [[p78<=1 & 1<=p78]]]]]] U [[p126<=1 & 1<=p126] & [p77<=1 & 1<=p77]]]]]]

abstracting: (1<=p77)
states: 2,923,075,650,000 (12)
abstracting: (p77<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p126)
states: 31,179,473,600,000 (13)
abstracting: (p126<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p78)
states: 2,834,497,600,000 (12)
abstracting: (p78<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p116)
states: 2,834,497,600,000 (12)
abstracting: (p116<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p126)
states: 31,179,473,600,000 (13)
abstracting: (p126<=1)
states: 31,179,473,600,001 (13)

before gc: list nodes free: 1790841

after gc: idd nodes used:23381136, unused:40618864; list nodes free:253236338
MC time: 2m53.537sec

checking: [E [EX [EX [AG [[p92<=1 & 1<=p92]]]] U AF [[E [[[p90<=1 & 1<=p90] & [p127<=1 & 1<=p127]] U [[p96<=1 & 1<=p96] & [p126<=1 & 1<=p126]]] & EF [[[p71<=1 & 1<=p71] & [p127<=1 & 1<=p127]]]]]] & AF [[EX [[[p33<=0 & 0<=p33] | [p127<=0 & 0<=p127]]] | EX [[~ [A [[[p17<=1 & 1<=p17] & [p126<=1 & 1<=p126]] U [p0<=1 & 1<=p0]]] & [[p28<=0 & 0<=p28] | [p127<=0 & 0<=p127]]]]]]]
normalized: [~ [EG [~ [[EX [[[[p127<=0 & 0<=p127] | [p28<=0 & 0<=p28]] & ~ [[~ [EG [~ [[p0<=1 & 1<=p0]]]] & ~ [E [~ [[p0<=1 & 1<=p0]] U [~ [[[p126<=1 & 1<=p126] & [p17<=1 & 1<=p17]]] & ~ [[p0<=1 & 1<=p0]]]]]]]]] | EX [[[p127<=0 & 0<=p127] | [p33<=0 & 0<=p33]]]]]]] & E [EX [EX [~ [E [true U ~ [[p92<=1 & 1<=p92]]]]]] U ~ [EG [~ [[E [true U [[p127<=1 & 1<=p127] & [p71<=1 & 1<=p71]]] & E [[[p127<=1 & 1<=p127] & [p90<=1 & 1<=p90]] U [[p126<=1 & 1<=p126] & [p96<=1 & 1<=p96]]]]]]]]]

abstracting: (1<=p96)
states: 2,923,075,650,000 (12)
abstracting: (p96<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p126)
states: 31,179,473,600,000 (13)
abstracting: (p126<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p90)
states: 2,923,075,650,000 (12)
abstracting: (p90<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p127)
states: 31,179,473,600,000 (13)
abstracting: (p127<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p71)
states: 2,923,075,650,000 (12)
abstracting: (p71<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p127)
states: 31,179,473,600,000 (13)
abstracting: (p127<=1)
states: 31,179,473,600,001 (13)

before gc: list nodes free: 14078834

after gc: idd nodes used:15463504, unused:48536496; list nodes free:304040579
MC time: 2m43.185sec

checking: E [[EX [AG [[p104<=1 & 1<=p104]]] | AF [E [[~ [[[p67<=1 & 1<=p67] & [p126<=1 & 1<=p126]]] & ~ [[[p90<=1 & 1<=p90] & [p127<=1 & 1<=p127]]]] U [EG [[[p122<=1 & 1<=p122] & [p126<=1 & 1<=p126]]] | ~ [[[p48<=1 & 1<=p48] & [p126<=1 & 1<=p126]]]]]]] U ~ [[[[p96<=1 & 1<=p96] & [p126<=1 & 1<=p126]] | [~ [EX [[[[p7<=1 & 1<=p7] & [p126<=1 & 1<=p126]] & [[p43<=1 & 1<=p43] & [p127<=1 & 1<=p127]]]]] | AF [[p100<=1 & 1<=p100]]]]]]
normalized: E [[~ [EG [~ [E [[~ [[[p127<=1 & 1<=p127] & [p90<=1 & 1<=p90]]] & ~ [[[p126<=1 & 1<=p126] & [p67<=1 & 1<=p67]]]] U [~ [[[p126<=1 & 1<=p126] & [p48<=1 & 1<=p48]]] | EG [[[p126<=1 & 1<=p126] & [p122<=1 & 1<=p122]]]]]]]] | EX [~ [E [true U ~ [[p104<=1 & 1<=p104]]]]]] U ~ [[[~ [EX [[[[p127<=1 & 1<=p127] & [p43<=1 & 1<=p43]] & [[p126<=1 & 1<=p126] & [p7<=1 & 1<=p7]]]]] | ~ [EG [~ [[p100<=1 & 1<=p100]]]]] | [[p126<=1 & 1<=p126] & [p96<=1 & 1<=p96]]]]]

abstracting: (1<=p96)
states: 2,923,075,650,000 (12)
abstracting: (p96<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p126)
states: 31,179,473,600,000 (13)
abstracting: (p126<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p100)
states: 2,834,497,600,000 (12)
abstracting: (p100<=1)
states: 31,179,473,600,001 (13)
MC time: 2m17.817sec

checking: [AG [[[[[[p105<=0 & 0<=p105] | [p126<=0 & 0<=p126]] | [[p64<=0 & 0<=p64] | [p126<=0 & 0<=p126]]] & [[[p16<=0 & 0<=p16] | [p126<=0 & 0<=p126]] | [[p69<=0 & 0<=p69] | [p126<=0 & 0<=p126]]]] | [[p87<=1 & 1<=p87] & [p126<=1 & 1<=p126]]]] | AG [[EF [~ [E [[p90<=1 & 1<=p90] U [p107<=1 & 1<=p107]]]] | [AG [~ [A [[p119<=1 & 1<=p119] U [p75<=1 & 1<=p75]]]] & EF [[[p104<=0 & 0<=p104] & [p64<=0 & 0<=p64]]]]]]]
normalized: [~ [E [true U ~ [[[E [true U [[p64<=0 & 0<=p64] & [p104<=0 & 0<=p104]]] & ~ [E [true U [~ [EG [~ [[p75<=1 & 1<=p75]]]] & ~ [E [~ [[p75<=1 & 1<=p75]] U [~ [[p119<=1 & 1<=p119]] & ~ [[p75<=1 & 1<=p75]]]]]]]]] | E [true U ~ [E [[p90<=1 & 1<=p90] U [p107<=1 & 1<=p107]]]]]]]] | ~ [E [true U ~ [[[[p126<=1 & 1<=p126] & [p87<=1 & 1<=p87]] | [[[[p126<=0 & 0<=p126] | [p69<=0 & 0<=p69]] | [[p126<=0 & 0<=p126] | [p16<=0 & 0<=p16]]] & [[[p126<=0 & 0<=p126] | [p64<=0 & 0<=p64]] | [[p126<=0 & 0<=p126] | [p105<=0 & 0<=p105]]]]]]]]]

abstracting: (0<=p105)
states: 31,179,473,600,001 (13)
abstracting: (p105<=0)
states: 28,344,976,000,001 (13)
abstracting: (0<=p126)
states: 31,179,473,600,001 (13)
abstracting: (p126<=0)
states: 1
abstracting: (0<=p64)
states: 31,179,473,600,001 (13)
abstracting: (p64<=0)
states: 28,256,397,950,001 (13)
abstracting: (0<=p126)
states: 31,179,473,600,001 (13)
abstracting: (p126<=0)
states: 1
abstracting: (0<=p16)
states: 31,179,473,600,001 (13)
abstracting: (p16<=0)
states: 28,344,976,000,001 (13)
abstracting: (0<=p126)
states: 31,179,473,600,001 (13)
abstracting: (p126<=0)
states: 1
abstracting: (0<=p69)
states: 31,179,473,600,001 (13)
abstracting: (p69<=0)
states: 28,256,397,950,001 (13)
abstracting: (0<=p126)
states: 31,179,473,600,001 (13)
abstracting: (p126<=0)
states: 1
abstracting: (1<=p87)
states: 2,834,497,600,000 (12)
abstracting: (p87<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p126)
states: 31,179,473,600,000 (13)
abstracting: (p126<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p107)
states: 2,834,497,600,000 (12)
abstracting: (p107<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p90)
states: 2,923,075,650,000 (12)
abstracting: (p90<=1)
states: 31,179,473,600,001 (13)
MC time: 1m54.027sec

checking: [AF [AG [[[A [[p61<=1 & 1<=p61] U [[p103<=1 & 1<=p103] & [p126<=1 & 1<=p126]]] | EG [[[p62<=1 & 1<=p62] & [p127<=1 & 1<=p127]]]] | [[[p105<=1 & 1<=p105] & [p126<=1 & 1<=p126]] | [[[p24<=1 & 1<=p24] & [p127<=1 & 1<=p127]] | [[p64<=1 & 1<=p64] & [p126<=1 & 1<=p126]]]]]]] & [AX [[[[p75<=0 & 0<=p75] | [p127<=0 & 0<=p127]] & [[p17<=0 & 0<=p17] | [p126<=0 & 0<=p126]]]] | [~ [A [[p97<=1 & 1<=p97] U EX [~ [AG [[[p10<=1 & 1<=p10] & [p126<=1 & 1<=p126]]]]]]] | [AG [[[p82<=1 & 1<=p82] & [p126<=1 & 1<=p126]]] & [EX [EX [[[p41<=0 & 0<=p41] | [p126<=0 & 0<=p126]]]] & A [[[p44<=1 & 1<=p44] & [p126<=1 & 1<=p126]] U [[p48<=1 & 1<=p48] & [p126<=1 & 1<=p126]]]]]]]]
normalized: [[~ [EX [~ [[[[p126<=0 & 0<=p126] | [p17<=0 & 0<=p17]] & [[p127<=0 & 0<=p127] | [p75<=0 & 0<=p75]]]]]] | [[[[~ [EG [~ [[[p126<=1 & 1<=p126] & [p48<=1 & 1<=p48]]]]] & ~ [E [~ [[[p126<=1 & 1<=p126] & [p48<=1 & 1<=p48]]] U [~ [[[p44<=1 & 1<=p44] & [p126<=1 & 1<=p126]]] & ~ [[[p126<=1 & 1<=p126] & [p48<=1 & 1<=p48]]]]]]] & EX [EX [[[p126<=0 & 0<=p126] | [p41<=0 & 0<=p41]]]]] & ~ [E [true U ~ [[[p126<=1 & 1<=p126] & [p82<=1 & 1<=p82]]]]]] | ~ [[~ [EG [~ [EX [E [true U ~ [[[p126<=1 & 1<=p126] & [p10<=1 & 1<=p10]]]]]]]] & ~ [E [~ [EX [E [true U ~ [[[p126<=1 & 1<=p126] & [p10<=1 & 1<=p10]]]]]] U [~ [[p97<=1 & 1<=p97]] & ~ [EX [E [true U ~ [[[p126<=1 & 1<=p126] & [p10<=1 & 1<=p10]]]]]]]]]]]]] & ~ [EG [E [true U ~ [[[[[[p126<=1 & 1<=p126] & [p64<=1 & 1<=p64]] | [[p127<=1 & 1<=p127] & [p24<=1 & 1<=p24]]] | [[p126<=1 & 1<=p126] & [p105<=1 & 1<=p105]]] | [EG [[[p127<=1 & 1<=p127] & [p62<=1 & 1<=p62]]] | [~ [EG [~ [[[p126<=1 & 1<=p126] & [p103<=1 & 1<=p103]]]]] & ~ [E [~ [[[p126<=1 & 1<=p126] & [p103<=1 & 1<=p103]]] U [~ [[p61<=1 & 1<=p61]] & ~ [[[p126<=1 & 1<=p126] & [p103<=1 & 1<=p103]]]]]]]]]]]]]]

abstracting: (1<=p103)
states: 2,834,497,600,000 (12)
abstracting: (p103<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p126)
states: 31,179,473,600,000 (13)
abstracting: (p126<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p61)
states: 2,923,075,650,000 (12)
abstracting: (p61<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p103)
states: 2,834,497,600,000 (12)
abstracting: (p103<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p126)
states: 31,179,473,600,000 (13)
abstracting: (p126<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p103)
states: 2,834,497,600,000 (12)
abstracting: (p103<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p126)
states: 31,179,473,600,000 (13)
abstracting: (p126<=1)
states: 31,179,473,600,001 (13)

before gc: list nodes free: 33947954

after gc: idd nodes used:35118369, unused:28881631; list nodes free:181203555
MC time: 2m15.910sec

checking: [~ [E [EX [~ [AF [[p40<=1 & 1<=p40]]]] U [[~ [EF [[[p73<=1 & 1<=p73] & [p126<=1 & 1<=p126]]]] & ~ [[[p94<=1 & 1<=p94] & [p127<=1 & 1<=p127]]]] | [[p52<=1 & 1<=p52] & [p127<=1 & 1<=p127]]]]] | [AF [[A [[p0<=1 & 1<=p0] U [[p57<=1 & 1<=p57] & [p127<=1 & 1<=p127]]] | E [[[p63<=1 & 1<=p63] & [p126<=1 & 1<=p126]] U [p53<=1 & 1<=p53]]]] | [EF [[E [[[[p58<=1 & 1<=p58] & [p126<=1 & 1<=p126]] | AG [[[p14<=1 & 1<=p14] & [p127<=1 & 1<=p127]]]] U AF [[p102<=1 & 1<=p102]]] & [[p90<=1 & 1<=p90] & [p127<=1 & 1<=p127]]]] & E [EG [[EF [[[p110<=1 & 1<=p110] & [p127<=1 & 1<=p127]]] | AX [[p11<=1 & 1<=p11]]]] U E [[~ [[[p76<=1 & 1<=p76] & [[p126<=1 & 1<=p126] & [p8<=1 & 1<=p8]]]] & ~ [[[p3<=1 & 1<=p3] | [[p22<=1 & 1<=p22] & [p126<=1 & 1<=p126]]]]] U ~ [[[[p114<=1 & 1<=p114] & [p127<=1 & 1<=p127]] | E [[p118<=1 & 1<=p118] U [[p67<=1 & 1<=p67] & [p126<=1 & 1<=p126]]]]]]]]]]
normalized: [[[E [EG [[~ [EX [~ [[p11<=1 & 1<=p11]]]] | E [true U [[p127<=1 & 1<=p127] & [p110<=1 & 1<=p110]]]]] U E [[~ [[[[p126<=1 & 1<=p126] & [p22<=1 & 1<=p22]] | [p3<=1 & 1<=p3]]] & ~ [[[[p8<=1 & 1<=p8] & [p126<=1 & 1<=p126]] & [p76<=1 & 1<=p76]]]] U ~ [[E [[p118<=1 & 1<=p118] U [[p126<=1 & 1<=p126] & [p67<=1 & 1<=p67]]] | [[p127<=1 & 1<=p127] & [p114<=1 & 1<=p114]]]]]] & E [true U [[[p127<=1 & 1<=p127] & [p90<=1 & 1<=p90]] & E [[~ [E [true U ~ [[[p127<=1 & 1<=p127] & [p14<=1 & 1<=p14]]]]] | [[p126<=1 & 1<=p126] & [p58<=1 & 1<=p58]]] U ~ [EG [~ [[p102<=1 & 1<=p102]]]]]]]] | ~ [EG [~ [[E [[[p126<=1 & 1<=p126] & [p63<=1 & 1<=p63]] U [p53<=1 & 1<=p53]] | [~ [EG [~ [[[p127<=1 & 1<=p127] & [p57<=1 & 1<=p57]]]]] & ~ [E [~ [[[p127<=1 & 1<=p127] & [p57<=1 & 1<=p57]]] U [~ [[p0<=1 & 1<=p0]] & ~ [[[p127<=1 & 1<=p127] & [p57<=1 & 1<=p57]]]]]]]]]]]] | ~ [E [EX [EG [~ [[p40<=1 & 1<=p40]]]] U [[[p127<=1 & 1<=p127] & [p52<=1 & 1<=p52]] | [~ [[[p127<=1 & 1<=p127] & [p94<=1 & 1<=p94]]] & ~ [E [true U [[p126<=1 & 1<=p126] & [p73<=1 & 1<=p73]]]]]]]]]

abstracting: (1<=p73)
states: 2,923,075,650,000 (12)
abstracting: (p73<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p126)
states: 31,179,473,600,000 (13)
abstracting: (p126<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p94)
states: 2,923,075,650,000 (12)
abstracting: (p94<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p127)
states: 31,179,473,600,000 (13)
abstracting: (p127<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p52)
states: 2,834,497,600,000 (12)
abstracting: (p52<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p127)
states: 31,179,473,600,000 (13)
abstracting: (p127<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p40)
states: 2,834,497,600,000 (12)
abstracting: (p40<=1)
states: 31,179,473,600,001 (13)
MC time: 1m36.325sec

checking: E [[~ [[[[~ [[~ [[[p4<=1 & 1<=p4] & [p127<=1 & 1<=p127]]] | EG [[[p95<=1 & 1<=p95] & [p126<=1 & 1<=p126]]]]] | [[AG [[[p43<=1 & 1<=p43] & [p127<=1 & 1<=p127]]] | AG [[p85<=1 & 1<=p85]]] & EG [[[p108<=1 & 1<=p108] & [p126<=1 & 1<=p126]]]]] & [EF [[p85<=1 & 1<=p85]] & AX [[[p60<=1 & 1<=p60] & [p126<=1 & 1<=p126]]]]] & [[[p75<=1 & 1<=p75] & [p127<=1 & 1<=p127]] & [[~ [[[p24<=1 & 1<=p24] & [p127<=1 & 1<=p127]]] | [[p9<=1 & 1<=p9] & [p126<=1 & 1<=p126]]] & [p109<=1 & 1<=p109]]]]] | [E [~ [AF [[[p96<=1 & 1<=p96] & [p126<=1 & 1<=p126]]]] U [p8<=1 & 1<=p8]] & [EX [[[~ [[[p45<=1 & 1<=p45] & [p126<=1 & 1<=p126]]] & ~ [[p78<=1 & 1<=p78]]] | ~ [[[[p15<=1 & 1<=p15] & [p126<=1 & 1<=p126]] & [[p69<=1 & 1<=p69] & [p126<=1 & 1<=p126]]]]]] & [EX [EG [[[p26<=1 & 1<=p26] & [p126<=1 & 1<=p126]]]] | EF [[[p9<=1 & 1<=p9] & [p126<=1 & 1<=p126]]]]]]] U AX [[AG [[[p100<=1 & 1<=p100] & [p127<=1 & 1<=p127]]] | [[p2<=1 & 1<=p2] & [p126<=1 & 1<=p126]]]]]
normalized: E [[~ [[[[[~ [[[p127<=1 & 1<=p127] & [p24<=1 & 1<=p24]]] | [[p126<=1 & 1<=p126] & [p9<=1 & 1<=p9]]] & [p109<=1 & 1<=p109]] & [[p127<=1 & 1<=p127] & [p75<=1 & 1<=p75]]] & [[~ [EX [~ [[[p126<=1 & 1<=p126] & [p60<=1 & 1<=p60]]]]] & E [true U [p85<=1 & 1<=p85]]] & [[EG [[[p126<=1 & 1<=p126] & [p108<=1 & 1<=p108]]] & [~ [E [true U ~ [[p85<=1 & 1<=p85]]]] | ~ [E [true U ~ [[[p127<=1 & 1<=p127] & [p43<=1 & 1<=p43]]]]]]] | ~ [[EG [[[p126<=1 & 1<=p126] & [p95<=1 & 1<=p95]]] | ~ [[[p127<=1 & 1<=p127] & [p4<=1 & 1<=p4]]]]]]]]] | [[[E [true U [[p126<=1 & 1<=p126] & [p9<=1 & 1<=p9]]] | EX [EG [[[p126<=1 & 1<=p126] & [p26<=1 & 1<=p26]]]]] & EX [[~ [[[[p126<=1 & 1<=p126] & [p69<=1 & 1<=p69]] & [[p126<=1 & 1<=p126] & [p15<=1 & 1<=p15]]]] | [~ [[p78<=1 & 1<=p78]] & ~ [[[p126<=1 & 1<=p126] & [p45<=1 & 1<=p45]]]]]]] & E [EG [~ [[[p126<=1 & 1<=p126] & [p96<=1 & 1<=p96]]]] U [p8<=1 & 1<=p8]]]] U ~ [EX [~ [[[[p2<=1 & 1<=p2] & [p126<=1 & 1<=p126]] | ~ [E [true U ~ [[[p127<=1 & 1<=p127] & [p100<=1 & 1<=p100]]]]]]]]]]

abstracting: (1<=p100)
states: 2,834,497,600,000 (12)
abstracting: (p100<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p127)
states: 31,179,473,600,000 (13)
abstracting: (p127<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p126)
states: 31,179,473,600,000 (13)
abstracting: (p126<=1)
states: 31,179,473,600,001 (13)
abstracting: (1<=p2)
states: 2,923,075,650,000 (12)
abstracting: (p2<=1)
states: 31,179,473,600,001 (13)

before gc: list nodes free: 26865913

after gc: idd nodes used:4856015, unused:59143985; list nodes free:371058409
MC time: 1m29.880sec

checking: EX [[p50<=1 & 1<=p50]]
normalized: EX [[p50<=1 & 1<=p50]]

abstracting: (1<=p50)
states: 2,834,497,600,000 (12)
abstracting: (p50<=1)
states: 31,179,473,600,001 (13)
.-> the formula is FALSE

FORMULA DiscoveryGPU-PT-13a-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 4448544 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16101228 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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:7576 (45), effective:131 (0)

initing FirstDep: 0m 0.000sec


net_ddint.h:600: Timeout: after 251 sec


net_ddint.h:600: Timeout: after 233 sec


net_ddint.h:600: Timeout: after 216 sec


net_ddint.h:600: Timeout: after 200 sec


net_ddint.h:600: Timeout: after 185 sec


iterations count:168 (1), effective:1 (0)

net_ddint.h:600: Timeout: after 171 sec


net_ddint.h:600: Timeout: after 159 sec


iterations count:167 (1), effective:1 (0)

net_ddint.h:600: Timeout: after 147 sec


iterations count:165 (1), effective:0 (0)

iterations count:681 (4), effective:7 (0)

net_ddint.h:600: Timeout: after 134 sec


net_ddint.h:600: Timeout: after 123 sec


iterations count:1284 (7), effective:20 (0)

sat_reach.icc:155: Timeout: after 113 sec


iterations count:171 (1), effective:1 (0)

net_ddint.h:600: Timeout: after 105 sec


iterations count:508 (3), effective:5 (0)

net_ddint.h:600: Timeout: after 95 sec


iterations count:168 (1), effective:1 (0)

net_ddint.h:600: Timeout: after 88 sec

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-13a"
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-13a, 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-167819420500394"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-13a.tgz
mv DiscoveryGPU-PT-13a 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;