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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.6K Feb 25 13:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 13:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 13:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 13:35 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.3K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 25 13:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 13:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Feb 25 13:40 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 36K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678759920983

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-10a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-14 02:12:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 02:12:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 02:12:03] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-03-14 02:12:03] [INFO ] Transformed 103 places.
[2023-03-14 02:12:03] [INFO ] Transformed 141 transitions.
[2023-03-14 02:12:03] [INFO ] Found NUPN structural information;
[2023-03-14 02:12:03] [INFO ] Parsed PT model containing 103 places and 141 transitions and 453 arcs in 163 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Support contains 66 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 141/141 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 101 transition count 139
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 100 transition count 138
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 100 transition count 138
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 16 place count 100 transition count 128
Applied a total of 16 rules in 30 ms. Remains 100 /103 variables (removed 3) and now considering 128/141 (removed 13) transitions.
// Phase 1: matrix 128 rows 100 cols
[2023-03-14 02:12:03] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-14 02:12:04] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-14 02:12:04] [INFO ] Invariant cache hit.
[2023-03-14 02:12:04] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-14 02:12:04] [INFO ] Implicit Places using invariants and state equation in 247 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 577 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/103 places, 128/141 transitions.
Applied a total of 0 rules in 5 ms. Remains 99 /99 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 612 ms. Remains : 99/103 places, 128/141 transitions.
Support contains 66 out of 99 places after structural reductions.
[2023-03-14 02:12:04] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-14 02:12:04] [INFO ] Flatten gal took : 73 ms
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 02:12:05] [INFO ] Flatten gal took : 25 ms
[2023-03-14 02:12:05] [INFO ] Input system was already deterministic with 128 transitions.
Support contains 54 out of 99 places (down from 66) after GAL structural reductions.
Finished random walk after 1490 steps, including 13 resets, run visited all 44 properties in 160 ms. (steps per millisecond=9 )
[2023-03-14 02:12:05] [INFO ] Flatten gal took : 15 ms
[2023-03-14 02:12:05] [INFO ] Flatten gal took : 18 ms
[2023-03-14 02:12:05] [INFO ] Input system was already deterministic with 128 transitions.
Computed a total of 12 stabilizing places and 11 stable transitions
Graph (complete) has 238 edges and 99 vertex of which 91 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 128/128 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 91 transition count 120
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 91 transition count 120
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 84 transition count 113
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 84 transition count 113
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 79 transition count 108
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 79 transition count 108
Applied a total of 40 rules in 21 ms. Remains 79 /99 variables (removed 20) and now considering 108/128 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 79/99 places, 108/128 transitions.
[2023-03-14 02:12:05] [INFO ] Flatten gal took : 10 ms
[2023-03-14 02:12:05] [INFO ] Flatten gal took : 11 ms
[2023-03-14 02:12:05] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 128/128 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 92 transition count 121
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 92 transition count 121
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 87 transition count 116
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 87 transition count 116
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 83 transition count 112
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 83 transition count 112
Applied a total of 32 rules in 23 ms. Remains 83 /99 variables (removed 16) and now considering 112/128 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 83/99 places, 112/128 transitions.
[2023-03-14 02:12:05] [INFO ] Flatten gal took : 10 ms
[2023-03-14 02:12:05] [INFO ] Flatten gal took : 11 ms
[2023-03-14 02:12:05] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 128/128 transitions.
Graph (complete) has 238 edges and 99 vertex of which 91 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
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 100 edges and 89 vertex of which 70 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Graph (trivial) has 76 edges and 70 vertex of which 40 / 70 are part of one of the 20 SCC in 4 ms
Free SCC test removed 20 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 50 transition count 92
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 40 place count 42 transition count 72
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 49 place count 33 transition count 54
Iterating global reduction 2 with 9 rules applied. Total rules applied 58 place count 33 transition count 54
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 65 place count 26 transition count 40
Iterating global reduction 2 with 7 rules applied. Total rules applied 72 place count 26 transition count 40
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 79 place count 19 transition count 26
Iterating global reduction 2 with 7 rules applied. Total rules applied 86 place count 19 transition count 26
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 93 place count 12 transition count 19
Iterating global reduction 2 with 7 rules applied. Total rules applied 100 place count 12 transition count 19
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 103 place count 12 transition count 16
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 12 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 105 place count 11 transition count 15
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 108 place count 8 transition count 12
Applied a total of 108 rules in 39 ms. Remains 8 /99 variables (removed 91) and now considering 12/128 (removed 116) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 8/99 places, 12/128 transitions.
[2023-03-14 02:12:05] [INFO ] Flatten gal took : 1 ms
[2023-03-14 02:12:05] [INFO ] Flatten gal took : 1 ms
[2023-03-14 02:12:05] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 128/128 transitions.
Graph (complete) has 238 edges and 99 vertex of which 91 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
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 100 edges and 89 vertex of which 70 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Graph (trivial) has 78 edges and 70 vertex of which 40 / 70 are part of one of the 20 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 50 transition count 91
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 42 place count 41 transition count 71
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 51 place count 32 transition count 53
Iterating global reduction 2 with 9 rules applied. Total rules applied 60 place count 32 transition count 53
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 68 place count 24 transition count 37
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 24 transition count 37
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 84 place count 16 transition count 21
Iterating global reduction 2 with 8 rules applied. Total rules applied 92 place count 16 transition count 21
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 100 place count 8 transition count 13
Iterating global reduction 2 with 8 rules applied. Total rules applied 108 place count 8 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 8 transition count 11
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 111 place count 8 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 7 transition count 10
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 5 transition count 8
Applied a total of 114 rules in 26 ms. Remains 5 /99 variables (removed 94) and now considering 8/128 (removed 120) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 5/99 places, 8/128 transitions.
[2023-03-14 02:12:05] [INFO ] Flatten gal took : 1 ms
[2023-03-14 02:12:05] [INFO ] Flatten gal took : 1 ms
[2023-03-14 02:12:05] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 128/128 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 91 transition count 120
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 91 transition count 120
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 84 transition count 113
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 84 transition count 113
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 79 transition count 108
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 79 transition count 108
Applied a total of 40 rules in 20 ms. Remains 79 /99 variables (removed 20) and now considering 108/128 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 79/99 places, 108/128 transitions.
[2023-03-14 02:12:05] [INFO ] Flatten gal took : 9 ms
[2023-03-14 02:12:05] [INFO ] Flatten gal took : 17 ms
[2023-03-14 02:12:05] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 128/128 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 91 transition count 120
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 91 transition count 120
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 84 transition count 113
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 84 transition count 113
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 78 transition count 107
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 78 transition count 107
Applied a total of 42 rules in 15 ms. Remains 78 /99 variables (removed 21) and now considering 107/128 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 78/99 places, 107/128 transitions.
[2023-03-14 02:12:05] [INFO ] Flatten gal took : 9 ms
[2023-03-14 02:12:05] [INFO ] Flatten gal took : 9 ms
[2023-03-14 02:12:05] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 128/128 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 90 transition count 119
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 90 transition count 119
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 82 transition count 111
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 82 transition count 111
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 75 transition count 104
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 75 transition count 104
Applied a total of 48 rules in 12 ms. Remains 75 /99 variables (removed 24) and now considering 104/128 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 75/99 places, 104/128 transitions.
[2023-03-14 02:12:05] [INFO ] Flatten gal took : 9 ms
[2023-03-14 02:12:05] [INFO ] Flatten gal took : 9 ms
[2023-03-14 02:12:05] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 128/128 transitions.
Graph (complete) has 238 edges and 99 vertex of which 93 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 1 places and 0 transitions.
Graph (complete) has 102 edges and 91 vertex of which 77 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Graph (trivial) has 76 edges and 77 vertex of which 36 / 77 are part of one of the 18 SCC in 0 ms
Free SCC test removed 18 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 59 transition count 97
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 43 place count 49 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 48 transition count 78
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 50 place count 42 transition count 66
Iterating global reduction 3 with 6 rules applied. Total rules applied 56 place count 42 transition count 66
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 61 place count 37 transition count 56
Iterating global reduction 3 with 5 rules applied. Total rules applied 66 place count 37 transition count 56
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 69 place count 34 transition count 50
Iterating global reduction 3 with 3 rules applied. Total rules applied 72 place count 34 transition count 50
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 75 place count 31 transition count 47
Iterating global reduction 3 with 3 rules applied. Total rules applied 78 place count 31 transition count 47
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 31 transition count 46
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 81 place count 30 transition count 45
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 88 place count 23 transition count 38
Applied a total of 88 rules in 35 ms. Remains 23 /99 variables (removed 76) and now considering 38/128 (removed 90) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 23/99 places, 38/128 transitions.
[2023-03-14 02:12:05] [INFO ] Flatten gal took : 2 ms
[2023-03-14 02:12:05] [INFO ] Flatten gal took : 9 ms
[2023-03-14 02:12:05] [INFO ] Input system was already deterministic with 38 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 128/128 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 91 transition count 120
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 91 transition count 120
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 84 transition count 113
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 84 transition count 113
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 78 transition count 107
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 78 transition count 107
Applied a total of 42 rules in 8 ms. Remains 78 /99 variables (removed 21) and now considering 107/128 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 78/99 places, 107/128 transitions.
[2023-03-14 02:12:05] [INFO ] Flatten gal took : 6 ms
[2023-03-14 02:12:05] [INFO ] Flatten gal took : 6 ms
[2023-03-14 02:12:05] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 128/128 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 91 transition count 120
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 91 transition count 120
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 84 transition count 113
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 84 transition count 113
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 78 transition count 107
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 78 transition count 107
Applied a total of 42 rules in 6 ms. Remains 78 /99 variables (removed 21) and now considering 107/128 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 78/99 places, 107/128 transitions.
[2023-03-14 02:12:05] [INFO ] Flatten gal took : 6 ms
[2023-03-14 02:12:05] [INFO ] Flatten gal took : 5 ms
[2023-03-14 02:12:05] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 128/128 transitions.
Graph (complete) has 238 edges and 99 vertex of which 91 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
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 91 transition count 110
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 81 transition count 110
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 29 place count 73 transition count 102
Iterating global reduction 2 with 8 rules applied. Total rules applied 37 place count 73 transition count 102
Applied a total of 37 rules in 12 ms. Remains 73 /99 variables (removed 26) and now considering 102/128 (removed 26) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 73/99 places, 102/128 transitions.
[2023-03-14 02:12:06] [INFO ] Flatten gal took : 5 ms
[2023-03-14 02:12:06] [INFO ] Flatten gal took : 4 ms
[2023-03-14 02:12:06] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 128/128 transitions.
Graph (complete) has 238 edges and 99 vertex of which 91 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 100 edges and 89 vertex of which 71 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Graph (trivial) has 74 edges and 71 vertex of which 36 / 71 are part of one of the 18 SCC in 0 ms
Free SCC test removed 18 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 53 transition count 92
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 41 place count 44 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 43 transition count 73
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 50 place count 35 transition count 57
Iterating global reduction 3 with 8 rules applied. Total rules applied 58 place count 35 transition count 57
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 65 place count 28 transition count 43
Iterating global reduction 3 with 7 rules applied. Total rules applied 72 place count 28 transition count 43
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 78 place count 22 transition count 31
Iterating global reduction 3 with 6 rules applied. Total rules applied 84 place count 22 transition count 31
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 90 place count 16 transition count 25
Iterating global reduction 3 with 6 rules applied. Total rules applied 96 place count 16 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 16 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 15 transition count 23
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 11 transition count 19
Applied a total of 103 rules in 16 ms. Remains 11 /99 variables (removed 88) and now considering 19/128 (removed 109) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 11/99 places, 19/128 transitions.
[2023-03-14 02:12:06] [INFO ] Flatten gal took : 0 ms
[2023-03-14 02:12:06] [INFO ] Flatten gal took : 1 ms
[2023-03-14 02:12:06] [INFO ] Input system was already deterministic with 19 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 128/128 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 91 transition count 120
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 91 transition count 120
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 84 transition count 113
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 84 transition count 113
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 78 transition count 107
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 78 transition count 107
Applied a total of 42 rules in 6 ms. Remains 78 /99 variables (removed 21) and now considering 107/128 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 78/99 places, 107/128 transitions.
[2023-03-14 02:12:06] [INFO ] Flatten gal took : 5 ms
[2023-03-14 02:12:06] [INFO ] Flatten gal took : 5 ms
[2023-03-14 02:12:06] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 128/128 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 90 transition count 119
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 90 transition count 119
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 83 transition count 112
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 83 transition count 112
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 77 transition count 106
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 77 transition count 106
Applied a total of 44 rules in 5 ms. Remains 77 /99 variables (removed 22) and now considering 106/128 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 77/99 places, 106/128 transitions.
[2023-03-14 02:12:06] [INFO ] Flatten gal took : 5 ms
[2023-03-14 02:12:06] [INFO ] Flatten gal took : 5 ms
[2023-03-14 02:12:06] [INFO ] Input system was already deterministic with 106 transitions.
[2023-03-14 02:12:06] [INFO ] Flatten gal took : 6 ms
[2023-03-14 02:12:06] [INFO ] Flatten gal took : 6 ms
[2023-03-14 02:12:06] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-14 02:12:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 99 places, 128 transitions and 366 arcs took 2 ms.
Total runtime 2521 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 99 NrTr: 128 NrArc: 366)

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

net check time: 0m 0.000sec

init dd package: 0m 3.547sec


RS generation: 0m 0.708sec


-> reachability set: #nodes 33547 (3.4e+04) #states 24,924,091,710 (10)



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

checking: AG [AF [[p53<=0 & 0<=p53]]]
normalized: ~ [E [true U EG [~ [[p53<=0 & 0<=p53]]]]]

abstracting: (0<=p53)
states: 24,924,091,710 (10)
abstracting: (p53<=0)
states: 22,658,265,191 (10)
.............................
EG iterations: 29
-> the formula is FALSE

FORMULA DiscoveryGPU-PT-10a-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.463sec

checking: AF [AG [AX [[p0<=0 & 0<=p0]]]]
normalized: ~ [EG [E [true U EX [~ [[p0<=0 & 0<=p0]]]]]]

abstracting: (0<=p0)
states: 24,924,091,710 (10)
abstracting: (p0<=0)
states: 24,924,091,709 (10)
..
EG iterations: 1
-> the formula is TRUE

FORMULA DiscoveryGPU-PT-10a-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

checking: EF [AG [[~ [[p63<=0 & 0<=p63]] & ~ [[p43<=1 & 1<=p43]]]]]
normalized: E [true U ~ [E [true U ~ [[~ [[p43<=1 & 1<=p43]] & ~ [[p63<=0 & 0<=p63]]]]]]]

abstracting: (0<=p63)
states: 24,924,091,710 (10)
abstracting: (p63<=0)
states: 22,658,265,191 (10)
abstracting: (1<=p43)
states: 2,265,826,519 (9)
abstracting: (p43<=1)
states: 24,924,091,710 (10)
-> the formula is FALSE

FORMULA DiscoveryGPU-PT-10a-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.593sec

checking: EG [[[p37<=0 & 0<=p37] | [p18<=1 & 1<=p18]]]
normalized: EG [[[p18<=1 & 1<=p18] | [p37<=0 & 0<=p37]]]

abstracting: (0<=p37)
states: 24,924,091,710 (10)
abstracting: (p37<=0)
states: 22,624,605,532 (10)
abstracting: (1<=p18)
states: 2,338,460,520 (9)
abstracting: (p18<=1)
states: 24,924,091,710 (10)
.
EG iterations: 1
-> the formula is TRUE

FORMULA DiscoveryGPU-PT-10a-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.482sec

checking: [AG [[[p59<=0 & 0<=p59] | [p22<=1 & 1<=p22]]] & AX [1<=0]]
normalized: [~ [EX [~ [1<=0]]] & ~ [E [true U ~ [[[p22<=1 & 1<=p22] | [p59<=0 & 0<=p59]]]]]]

abstracting: (0<=p59)
states: 24,924,091,710 (10)
abstracting: (p59<=0)
states: 22,658,265,191 (10)
abstracting: (1<=p22)
states: 2,265,826,519 (9)
abstracting: (p22<=1)
states: 24,924,091,710 (10)
abstracting: (1<=0)
states: 0
.-> the formula is FALSE

FORMULA DiscoveryGPU-PT-10a-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.559sec

checking: EF [EX [[[p48<=1 & 1<=p48] & EG [[[p95<=0 & 0<=p95] | [p54<=1 & 1<=p54]]]]]]
normalized: E [true U EX [[EG [[[p54<=1 & 1<=p54] | [p95<=0 & 0<=p95]]] & [p48<=1 & 1<=p48]]]]

abstracting: (1<=p48)
states: 2,265,826,519 (9)
abstracting: (p48<=1)
states: 24,924,091,710 (10)
abstracting: (0<=p95)
states: 24,924,091,710 (10)
abstracting: (p95<=0)
states: 22,658,265,191 (10)
abstracting: (1<=p54)
states: 2,265,826,519 (9)
abstracting: (p54<=1)
states: 24,924,091,710 (10)
..............................
EG iterations: 30
.-> the formula is TRUE

FORMULA DiscoveryGPU-PT-10a-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m21.848sec

checking: AF [EG [[[p13<=1 & 1<=p13] & [[p30<=0 & 0<=p30] | [p75<=1 & 1<=p75]]]]]
normalized: ~ [EG [~ [EG [[[[p30<=0 & 0<=p30] | [p75<=1 & 1<=p75]] & [p13<=1 & 1<=p13]]]]]]

abstracting: (1<=p13)
states: 2,338,460,520 (9)
abstracting: (p13<=1)
states: 24,924,091,710 (10)
abstracting: (1<=p75)
states: 2,265,826,519 (9)
abstracting: (p75<=1)
states: 24,924,091,710 (10)
abstracting: (0<=p30)
states: 24,924,091,710 (10)
abstracting: (p30<=0)
states: 22,624,605,532 (10)
............................
EG iterations: 28
.
EG iterations: 1
-> the formula is FALSE

FORMULA DiscoveryGPU-PT-10a-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.705sec

checking: AG [EF [EX [[AX [[[p42<=0 & 0<=p42] | [p90<=1 & 1<=p90]]] | [[p63<=1 & 1<=p63] & [[p29<=0 & 0<=p29] | [p84<=1 & 1<=p84]]]]]]]
normalized: ~ [E [true U ~ [E [true U EX [[[[[p84<=1 & 1<=p84] | [p29<=0 & 0<=p29]] & [p63<=1 & 1<=p63]] | ~ [EX [~ [[[p90<=1 & 1<=p90] | [p42<=0 & 0<=p42]]]]]]]]]]]

abstracting: (0<=p42)
states: 24,924,091,710 (10)
abstracting: (p42<=0)
states: 22,658,265,191 (10)
abstracting: (1<=p90)
states: 2,265,826,519 (9)
abstracting: (p90<=1)
states: 24,924,091,710 (10)
.abstracting: (1<=p63)
states: 2,265,826,519 (9)
abstracting: (p63<=1)
states: 24,924,091,710 (10)
abstracting: (0<=p29)
states: 24,924,091,710 (10)
abstracting: (p29<=0)
states: 22,624,605,532 (10)
abstracting: (1<=p84)
states: 2,265,826,519 (9)
abstracting: (p84<=1)
states: 24,924,091,710 (10)
.-> the formula is FALSE

FORMULA DiscoveryGPU-PT-10a-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.033sec

checking: AG [[[p6<=1 & 1<=p6] | [AX [[p83<=1 & 1<=p83]] & A [[[p38<=0 & 0<=p38] | [p12<=1 & 1<=p12]] U [p6<=0 & 0<=p6]]]]]
normalized: ~ [E [true U ~ [[[~ [EX [~ [[p83<=1 & 1<=p83]]]] & [~ [EG [~ [[p6<=0 & 0<=p6]]]] & ~ [E [~ [[p6<=0 & 0<=p6]] U [~ [[[p12<=1 & 1<=p12] | [p38<=0 & 0<=p38]]] & ~ [[p6<=0 & 0<=p6]]]]]]] | [p6<=1 & 1<=p6]]]]]

abstracting: (1<=p6)
states: 2,338,460,520 (9)
abstracting: (p6<=1)
states: 24,924,091,710 (10)
abstracting: (0<=p6)
states: 24,924,091,710 (10)
abstracting: (p6<=0)
states: 22,585,631,190 (10)
abstracting: (0<=p38)
states: 24,924,091,710 (10)
abstracting: (p38<=0)
states: 22,658,265,191 (10)
abstracting: (1<=p12)
states: 2,338,460,520 (9)
abstracting: (p12<=1)
states: 24,924,091,710 (10)
abstracting: (0<=p6)
states: 24,924,091,710 (10)
abstracting: (p6<=0)
states: 22,585,631,190 (10)
abstracting: (0<=p6)
states: 24,924,091,710 (10)
abstracting: (p6<=0)
states: 22,585,631,190 (10)
.............................
EG iterations: 29
abstracting: (1<=p83)
states: 2,265,826,519 (9)
abstracting: (p83<=1)
states: 24,924,091,710 (10)
.-> the formula is FALSE

FORMULA DiscoveryGPU-PT-10a-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.845sec

checking: A [~ [[[p48<=1 & 1<=p48] & [p19<=0 & 0<=p19]]] U [EF [AG [[[p64<=0 & 0<=p64] | [p72<=1 & 1<=p72]]]] & [[p3<=0 & 0<=p3] | [p85<=1 & 1<=p85]]]]
normalized: [~ [EG [~ [[[[p85<=1 & 1<=p85] | [p3<=0 & 0<=p3]] & E [true U ~ [E [true U ~ [[[p72<=1 & 1<=p72] | [p64<=0 & 0<=p64]]]]]]]]]] & ~ [E [~ [[[[p85<=1 & 1<=p85] | [p3<=0 & 0<=p3]] & E [true U ~ [E [true U ~ [[[p72<=1 & 1<=p72] | [p64<=0 & 0<=p64]]]]]]]] U [[[p19<=0 & 0<=p19] & [p48<=1 & 1<=p48]] & ~ [[[[p85<=1 & 1<=p85] | [p3<=0 & 0<=p3]] & E [true U ~ [E [true U ~ [[[p72<=1 & 1<=p72] | [p64<=0 & 0<=p64]]]]]]]]]]]]

abstracting: (0<=p64)
states: 24,924,091,710 (10)
abstracting: (p64<=0)
states: 22,658,265,191 (10)
abstracting: (1<=p72)
states: 2,265,826,519 (9)
abstracting: (p72<=1)
states: 24,924,091,710 (10)
abstracting: (0<=p3)
states: 24,924,091,710 (10)
abstracting: (p3<=0)
states: 22,585,631,190 (10)
abstracting: (1<=p85)
states: 2,265,826,519 (9)
abstracting: (p85<=1)
states: 24,924,091,710 (10)
abstracting: (1<=p48)
states: 2,265,826,519 (9)
abstracting: (p48<=1)
states: 24,924,091,710 (10)
abstracting: (0<=p19)
states: 24,924,091,710 (10)
abstracting: (p19<=0)
states: 22,658,265,191 (10)
abstracting: (0<=p64)
states: 24,924,091,710 (10)
abstracting: (p64<=0)
states: 22,658,265,191 (10)
abstracting: (1<=p72)
states: 2,265,826,519 (9)
abstracting: (p72<=1)
states: 24,924,091,710 (10)
abstracting: (0<=p3)
states: 24,924,091,710 (10)
abstracting: (p3<=0)
states: 22,585,631,190 (10)
abstracting: (1<=p85)
states: 2,265,826,519 (9)
abstracting: (p85<=1)
states: 24,924,091,710 (10)
abstracting: (0<=p64)
states: 24,924,091,710 (10)
abstracting: (p64<=0)
states: 22,658,265,191 (10)
abstracting: (1<=p72)
states: 2,265,826,519 (9)
abstracting: (p72<=1)
states: 24,924,091,710 (10)
abstracting: (0<=p3)
states: 24,924,091,710 (10)
abstracting: (p3<=0)
states: 22,585,631,190 (10)
abstracting: (1<=p85)
states: 2,265,826,519 (9)
abstracting: (p85<=1)
states: 24,924,091,710 (10)
.............................
EG iterations: 29
-> the formula is TRUE

FORMULA DiscoveryGPU-PT-10a-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.758sec

checking: [[AF [[EF [[p98<=0 & 0<=p98]] | [[p39<=0 & 0<=p39] & [p79<=1 & 1<=p79]]]] & EX [0<=0]] & [AG [[p58<=0 & 0<=p58]] & EG [[~ [E [[p35<=1 & 1<=p35] U [p53<=1 & 1<=p53]]] | AG [[p11<=1 & 1<=p11]]]]]]
normalized: [[~ [EG [~ [[E [true U [p98<=0 & 0<=p98]] | [[p79<=1 & 1<=p79] & [p39<=0 & 0<=p39]]]]]] & EX [0<=0]] & [~ [E [true U ~ [[p58<=0 & 0<=p58]]]] & EG [[~ [E [true U ~ [[p11<=1 & 1<=p11]]]] | ~ [E [[p35<=1 & 1<=p35] U [p53<=1 & 1<=p53]]]]]]]

abstracting: (1<=p53)
states: 2,265,826,519 (9)
abstracting: (p53<=1)
states: 24,924,091,710 (10)
abstracting: (1<=p35)
states: 2,299,486,178 (9)
abstracting: (p35<=1)
states: 24,924,091,710 (10)
abstracting: (1<=p11)
states: 2,338,460,520 (9)
abstracting: (p11<=1)
states: 24,924,091,710 (10)
.............................
EG iterations: 29
abstracting: (0<=p58)
states: 24,924,091,710 (10)
abstracting: (p58<=0)
states: 22,658,265,191 (10)
abstracting: (0<=0)
states: 24,924,091,710 (10)
.abstracting: (0<=p39)
states: 24,924,091,710 (10)
abstracting: (p39<=0)
states: 22,658,265,191 (10)
abstracting: (1<=p79)
states: 2,265,826,519 (9)
abstracting: (p79<=1)
states: 24,924,091,710 (10)
abstracting: (0<=p98)
states: 24,924,091,710 (10)
abstracting: (p98<=0)
states: 1
...........................
EG iterations: 27
-> the formula is FALSE

FORMULA DiscoveryGPU-PT-10a-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m19.394sec

checking: [A [[p33<=0 & 0<=p33] U AX [1<=0]] | [AF [~ [E [[p9<=1 & 1<=p9] U A [[[p88<=0 & 0<=p88] | [p33<=1 & 1<=p33]] U [p8<=1 & 1<=p8]]]]] | AG [EX [[~ [[p65<=0 & 0<=p65]] & ~ [[p17<=1 & 1<=p17]]]]]]]
normalized: [[~ [EG [EX [~ [1<=0]]]] & ~ [E [EX [~ [1<=0]] U [~ [[p33<=0 & 0<=p33]] & EX [~ [1<=0]]]]]] | [~ [EG [E [[p9<=1 & 1<=p9] U [~ [EG [~ [[p8<=1 & 1<=p8]]]] & ~ [E [~ [[p8<=1 & 1<=p8]] U [~ [[p8<=1 & 1<=p8]] & ~ [[[p33<=1 & 1<=p33] | [p88<=0 & 0<=p88]]]]]]]]]] | ~ [E [true U ~ [EX [[~ [[p17<=1 & 1<=p17]] & ~ [[p65<=0 & 0<=p65]]]]]]]]]

abstracting: (0<=p65)
states: 24,924,091,710 (10)
abstracting: (p65<=0)
states: 22,658,265,191 (10)
abstracting: (1<=p17)
states: 2,338,460,520 (9)
abstracting: (p17<=1)
states: 24,924,091,710 (10)
.abstracting: (0<=p88)
states: 24,924,091,710 (10)
abstracting: (p88<=0)
states: 22,658,265,191 (10)
abstracting: (1<=p33)
states: 2,299,486,178 (9)
abstracting: (p33<=1)
states: 24,924,091,710 (10)
abstracting: (1<=p8)
states: 2,338,460,520 (9)
abstracting: (p8<=1)
states: 24,924,091,710 (10)
abstracting: (1<=p8)
states: 2,338,460,520 (9)
abstracting: (p8<=1)
states: 24,924,091,710 (10)
abstracting: (1<=p8)
states: 2,338,460,520 (9)
abstracting: (p8<=1)
states: 24,924,091,710 (10)
..............................
EG iterations: 30
abstracting: (1<=p9)
states: 2,338,460,520 (9)
abstracting: (p9<=1)
states: 24,924,091,710 (10)
.
EG iterations: 1
abstracting: (1<=0)
states: 0
.abstracting: (0<=p33)
states: 24,924,091,710 (10)
abstracting: (p33<=0)
states: 22,624,605,532 (10)
abstracting: (1<=0)
states: 0
.abstracting: (1<=0)
states: 0
................................
EG iterations: 31
-> the formula is TRUE

FORMULA DiscoveryGPU-PT-10a-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m49.590sec

checking: A [A [[~ [AX [[[p86<=0 & 0<=p86] | [p47<=1 & 1<=p47]]]] | [AX [[p87<=0 & 0<=p87]] & [EX [[[p32<=0 & 0<=p32] | [p94<=1 & 1<=p94]]] & EX [[[p19<=0 & 0<=p19] | [p70<=1 & 1<=p70]]]]]] U A [~ [[p70<=1 & 1<=p70]] U ~ [[p83<=0 & 0<=p83]]]] U AG [~ [[[p31<=1 & 1<=p31] & AX [~ [[p37<=0 & 0<=p37]]]]]]]
normalized: [~ [EG [E [true U [~ [EX [[p37<=0 & 0<=p37]]] & [p31<=1 & 1<=p31]]]]] & ~ [E [E [true U [~ [EX [[p37<=0 & 0<=p37]]] & [p31<=1 & 1<=p31]]] U [~ [[~ [EG [~ [[~ [EG [[p83<=0 & 0<=p83]]] & ~ [E [[p83<=0 & 0<=p83] U [[p70<=1 & 1<=p70] & [p83<=0 & 0<=p83]]]]]]]] & ~ [E [~ [[~ [EG [[p83<=0 & 0<=p83]]] & ~ [E [[p83<=0 & 0<=p83] U [[p70<=1 & 1<=p70] & [p83<=0 & 0<=p83]]]]]] U [~ [[[[EX [[[p70<=1 & 1<=p70] | [p19<=0 & 0<=p19]]] & EX [[[p94<=1 & 1<=p94] | [p32<=0 & 0<=p32]]]] & ~ [EX [~ [[p87<=0 & 0<=p87]]]]] | EX [~ [[[p47<=1 & 1<=p47] | [p86<=0 & 0<=p86]]]]]] & ~ [[~ [EG [[p83<=0 & 0<=p83]]] & ~ [E [[p83<=0 & 0<=p83] U [[p70<=1 & 1<=p70] & [p83<=0 & 0<=p83]]]]]]]]]]] & E [true U [~ [EX [[p37<=0 & 0<=p37]]] & [p31<=1 & 1<=p31]]]]]]]

abstracting: (1<=p31)
states: 2,299,486,178 (9)
abstracting: (p31<=1)
states: 24,924,091,710 (10)
abstracting: (0<=p37)
states: 24,924,091,710 (10)
abstracting: (p37<=0)
states: 22,624,605,532 (10)
.abstracting: (0<=p83)
states: 24,924,091,710 (10)
abstracting: (p83<=0)
states: 22,658,265,191 (10)
abstracting: (1<=p70)
states: 2,265,826,519 (9)
abstracting: (p70<=1)
states: 24,924,091,710 (10)
abstracting: (0<=p83)
states: 24,924,091,710 (10)
abstracting: (p83<=0)
states: 22,658,265,191 (10)
abstracting: (0<=p83)
states: 24,924,091,710 (10)
abstracting: (p83<=0)
states: 22,658,265,191 (10)
.............................
EG iterations: 29
abstracting: (0<=p86)
states: 24,924,091,710 (10)
abstracting: (p86<=0)
states: 22,658,265,191 (10)
abstracting: (1<=p47)
states: 2,265,826,519 (9)
abstracting: (p47<=1)
states: 24,924,091,710 (10)
.abstracting: (0<=p87)
states: 24,924,091,710 (10)
abstracting: (p87<=0)
states: 22,658,265,191 (10)
.abstracting: (0<=p32)
states: 24,924,091,710 (10)
abstracting: (p32<=0)
states: 22,624,605,532 (10)
abstracting: (1<=p94)
states: 2,265,826,519 (9)
abstracting: (p94<=1)
states: 24,924,091,710 (10)
.abstracting: (0<=p19)
states: 24,924,091,710 (10)
abstracting: (p19<=0)
states: 22,658,265,191 (10)
abstracting: (1<=p70)
states: 2,265,826,519 (9)
abstracting: (p70<=1)
states: 24,924,091,710 (10)
.abstracting: (0<=p83)
states: 24,924,091,710 (10)
abstracting: (p83<=0)
states: 22,658,265,191 (10)
abstracting: (1<=p70)
states: 2,265,826,519 (9)
abstracting: (p70<=1)
states: 24,924,091,710 (10)
abstracting: (0<=p83)
states: 24,924,091,710 (10)
abstracting: (p83<=0)
states: 22,658,265,191 (10)
abstracting: (0<=p83)
states: 24,924,091,710 (10)
abstracting: (p83<=0)
states: 22,658,265,191 (10)
.............................
EG iterations: 29
abstracting: (0<=p83)
states: 24,924,091,710 (10)
abstracting: (p83<=0)
states: 22,658,265,191 (10)
abstracting: (1<=p70)
states: 2,265,826,519 (9)
abstracting: (p70<=1)
states: 24,924,091,710 (10)
abstracting: (0<=p83)
states: 24,924,091,710 (10)
abstracting: (p83<=0)
states: 22,658,265,191 (10)
abstracting: (0<=p83)
states: 24,924,091,710 (10)
abstracting: (p83<=0)
states: 22,658,265,191 (10)
.............................
EG iterations: 29
..........................
EG iterations: 26
abstracting: (1<=p31)
states: 2,299,486,178 (9)
abstracting: (p31<=1)
states: 24,924,091,710 (10)
abstracting: (0<=p37)
states: 24,924,091,710 (10)
abstracting: (p37<=0)
states: 22,624,605,532 (10)
.abstracting: (1<=p31)
states: 2,299,486,178 (9)
abstracting: (p31<=1)
states: 24,924,091,710 (10)
abstracting: (0<=p37)
states: 24,924,091,710 (10)
abstracting: (p37<=0)
states: 22,624,605,532 (10)
..
EG iterations: 1
-> the formula is TRUE

FORMULA DiscoveryGPU-PT-10a-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.058sec

checking: [AX [[[p35<=0 & 0<=p35] | [p28<=1 & 1<=p28]]] & [A [EF [[[p46<=1 & 1<=p46] & [p78<=1 & 1<=p78]]] U ~ [AG [AX [[p42<=0 & 0<=p42]]]]] & AG [[[[p44<=0 & 0<=p44] & [p13<=1 & 1<=p13]] | [[p51<=0 & 0<=p51] | [AG [[[p73<=0 & 0<=p73] & [p53<=1 & 1<=p53]]] & [[p22<=1 & 1<=p22] & A [[[p12<=1 & 1<=p12] & [[p84<=0 & 0<=p84] | [p81<=1 & 1<=p81]]] U ~ [[[p50<=0 & 0<=p50] | [p63<=1 & 1<=p63]]]]]]]]]]]
normalized: [[~ [E [true U ~ [[[[[[~ [E [[[p63<=1 & 1<=p63] | [p50<=0 & 0<=p50]] U [~ [[[[p81<=1 & 1<=p81] | [p84<=0 & 0<=p84]] & [p12<=1 & 1<=p12]]] & [[p63<=1 & 1<=p63] | [p50<=0 & 0<=p50]]]]] & ~ [EG [[[p63<=1 & 1<=p63] | [p50<=0 & 0<=p50]]]]] & [p22<=1 & 1<=p22]] & ~ [E [true U ~ [[[p53<=1 & 1<=p53] & [p73<=0 & 0<=p73]]]]]] | [p51<=0 & 0<=p51]] | [[p13<=1 & 1<=p13] & [p44<=0 & 0<=p44]]]]]] & [~ [EG [~ [E [true U EX [~ [[p42<=0 & 0<=p42]]]]]]] & ~ [E [~ [E [true U EX [~ [[p42<=0 & 0<=p42]]]]] U [~ [E [true U [[p78<=1 & 1<=p78] & [p46<=1 & 1<=p46]]]] & ~ [E [true U EX [~ [[p42<=0 & 0<=p42]]]]]]]]]] & ~ [EX [~ [[[p28<=1 & 1<=p28] | [p35<=0 & 0<=p35]]]]]]

abstracting: (0<=p35)
states: 24,924,091,710 (10)
abstracting: (p35<=0)
states: 22,624,605,532 (10)
abstracting: (1<=p28)
states: 2,265,826,519 (9)
abstracting: (p28<=1)
states: 24,924,091,710 (10)
.abstracting: (0<=p42)
states: 24,924,091,710 (10)
abstracting: (p42<=0)
states: 22,658,265,191 (10)
.abstracting: (1<=p46)
states: 2,265,826,519 (9)
abstracting: (p46<=1)
states: 24,924,091,710 (10)
abstracting: (1<=p78)
states: 2,265,826,519 (9)
abstracting: (p78<=1)
states: 24,924,091,710 (10)
abstracting: (0<=p42)
states: 24,924,091,710 (10)
abstracting: (p42<=0)
states: 22,658,265,191 (10)
.abstracting: (0<=p42)
states: 24,924,091,710 (10)
abstracting: (p42<=0)
states: 22,658,265,191 (10)
..
EG iterations: 1
abstracting: (0<=p44)
states: 24,924,091,710 (10)
abstracting: (p44<=0)
states: 22,658,265,191 (10)
abstracting: (1<=p13)
states: 2,338,460,520 (9)
abstracting: (p13<=1)
states: 24,924,091,710 (10)
abstracting: (0<=p51)
states: 24,924,091,710 (10)
abstracting: (p51<=0)
states: 22,658,265,191 (10)
abstracting: (0<=p73)
states: 24,924,091,710 (10)
abstracting: (p73<=0)
states: 22,658,265,191 (10)
abstracting: (1<=p53)
states: 2,265,826,519 (9)
abstracting: (p53<=1)
states: 24,924,091,710 (10)
abstracting: (1<=p22)
states: 2,265,826,519 (9)
abstracting: (p22<=1)
states: 24,924,091,710 (10)
abstracting: (0<=p50)
states: 24,924,091,710 (10)
abstracting: (p50<=0)
states: 22,658,265,191 (10)
abstracting: (1<=p63)
states: 2,265,826,519 (9)
abstracting: (p63<=1)
states: 24,924,091,710 (10)
.
EG iterations: 1
abstracting: (0<=p50)
states: 24,924,091,710 (10)
abstracting: (p50<=0)
states: 22,658,265,191 (10)
abstracting: (1<=p63)
states: 2,265,826,519 (9)
abstracting: (p63<=1)
states: 24,924,091,710 (10)
abstracting: (1<=p12)
states: 2,338,460,520 (9)
abstracting: (p12<=1)
states: 24,924,091,710 (10)
abstracting: (0<=p84)
states: 24,924,091,710 (10)
abstracting: (p84<=0)
states: 22,658,265,191 (10)
abstracting: (1<=p81)
states: 2,265,826,519 (9)
abstracting: (p81<=1)
states: 24,924,091,710 (10)
abstracting: (0<=p50)
states: 24,924,091,710 (10)
abstracting: (p50<=0)
states: 22,658,265,191 (10)
abstracting: (1<=p63)
states: 2,265,826,519 (9)
abstracting: (p63<=1)
states: 24,924,091,710 (10)
-> the formula is FALSE

FORMULA DiscoveryGPU-PT-10a-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.904sec

totally nodes used: 52574622 (5.3e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 41320726 91147566 132468292
used/not used/entry size/cache size: 55263924 11844940 16 1024MB
basic ops cache: hits/miss/sum: 63040547 124108415 187148962
used/not used/entry size/cache size: 16776567 649 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: 169002 323840 492842
used/not used/entry size/cache size: 317791 8070817 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 31068508
1 23520437
2 9302045
3 2557152
4 546199
5 97080
6 14790
7 2158
8 278
9 81
>= 10 136

Total processing time: 3m11.331sec


BK_STOP 1678760118839

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:3497 (27), effective:101 (0)

initing FirstDep: 0m 0.000sec


iterations count:269 (2), effective:5 (0)

iterations count:243 (1), effective:5 (0)

iterations count:465 (3), effective:10 (0)

iterations count:750 (5), effective:15 (0)

iterations count:753 (5), effective:53 (0)

iterations count:3093 (24), effective:106 (0)

iterations count:477 (3), effective:10 (0)

iterations count:220 (1), effective:3 (0)

iterations count:308 (2), effective:5 (0)

iterations count:296 (2), effective:5 (0)

iterations count:308 (2), effective:5 (0)

iterations count:296 (2), effective:5 (0)

iterations count:520 (4), effective:10 (0)

iterations count:308 (2), effective:5 (0)

iterations count:296 (2), effective:5 (0)

iterations count:268 (2), effective:4 (0)

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

iterations count:564 (4), effective:10 (0)

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

iterations count:900 (7), effective:55 (0)

iterations count:715 (5), effective:11 (0)

iterations count:147 (1), effective:3 (0)

iterations count:199 (1), effective:5 (0)

iterations count:499 (3), effective:8 (0)

iterations count:499 (3), effective:8 (0)

iterations count:2779 (21), effective:99 (0)

iterations count:499 (3), effective:8 (0)

iterations count:284 (2), effective:6 (0)

iterations count:690 (5), effective:12 (0)

iterations count:284 (2), effective:6 (0)

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

iterations count:284 (2), effective:6 (0)

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

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

iterations count:383 (2), effective:8 (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-10a"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is DiscoveryGPU-PT-10a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r138-smll-167819420400345"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-10a.tgz
mv DiscoveryGPU-PT-10a execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;