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.r458-smll-167912650500601.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 StigmergyElection-PT-05a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650500601
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 7.0K Feb 26 16:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 16:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 16:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 16:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 16:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Feb 26 16:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 16:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 16:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 193K Mar 5 18:23 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 StigmergyElection-PT-05a-CTLCardinality-00
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-01
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-02
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-03
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-04
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-05
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-06
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-07
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-08
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-09
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-10
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-11
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-12
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-13
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-14
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679556433856

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=StigmergyElection-PT-05a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 07:27:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 07:27:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 07:27:18] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2023-03-23 07:27:18] [INFO ] Transformed 72 places.
[2023-03-23 07:27:18] [INFO ] Transformed 450 transitions.
[2023-03-23 07:27:18] [INFO ] Found NUPN structural information;
[2023-03-23 07:27:18] [INFO ] Parsed PT model containing 72 places and 450 transitions and 3637 arcs in 362 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 25 ms.
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 291 transitions
Reduce redundant transitions removed 291 transitions.
FORMULA StigmergyElection-PT-05a-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05a-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05a-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05a-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 159/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 71 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 71 transition count 157
Applied a total of 2 rules in 37 ms. Remains 71 /72 variables (removed 1) and now considering 157/159 (removed 2) transitions.
[2023-03-23 07:27:18] [INFO ] Flow matrix only has 143 transitions (discarded 14 similar events)
// Phase 1: matrix 143 rows 71 cols
[2023-03-23 07:27:18] [INFO ] Computed 6 place invariants in 16 ms
[2023-03-23 07:27:19] [INFO ] Implicit Places using invariants in 386 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 450 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/72 places, 157/159 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 68 transition count 155
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 68 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 67 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 67 transition count 154
Applied a total of 6 rules in 19 ms. Remains 67 /70 variables (removed 3) and now considering 154/157 (removed 3) transitions.
[2023-03-23 07:27:19] [INFO ] Flow matrix only has 140 transitions (discarded 14 similar events)
// Phase 1: matrix 140 rows 67 cols
[2023-03-23 07:27:19] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-23 07:27:19] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-23 07:27:19] [INFO ] Flow matrix only has 140 transitions (discarded 14 similar events)
[2023-03-23 07:27:19] [INFO ] Invariant cache hit.
[2023-03-23 07:27:19] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-23 07:27:19] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 67/72 places, 154/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 816 ms. Remains : 67/72 places, 154/159 transitions.
Support contains 41 out of 67 places after structural reductions.
[2023-03-23 07:27:19] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-23 07:27:19] [INFO ] Flatten gal took : 86 ms
[2023-03-23 07:27:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA StigmergyElection-PT-05a-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05a-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05a-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 07:27:19] [INFO ] Flatten gal took : 34 ms
[2023-03-23 07:27:20] [INFO ] Input system was already deterministic with 154 transitions.
Support contains 34 out of 67 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 653 ms. (steps per millisecond=15 ) properties (out of 29) seen :27
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-23 07:27:20] [INFO ] Flow matrix only has 140 transitions (discarded 14 similar events)
[2023-03-23 07:27:20] [INFO ] Invariant cache hit.
[2023-03-23 07:27:20] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 07:27:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2023-03-23 07:27:21] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-23 07:27:21] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-23 07:27:21] [INFO ] After 25ms SMT Verify possible using 66 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-23 07:27:21] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 7 ms to minimize.
[2023-03-23 07:27:21] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2023-03-23 07:27:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 157 ms
[2023-03-23 07:27:21] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2023-03-23 07:27:21] [INFO ] After 339ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
[2023-03-23 07:27:21] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-23 07:27:21] [INFO ] Flatten gal took : 14 ms
FORMULA StigmergyElection-PT-05a-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 07:27:21] [INFO ] Flatten gal took : 21 ms
[2023-03-23 07:27:21] [INFO ] Input system was already deterministic with 154 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 67/67 places, 154/154 transitions.
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 9 rules applied. Total rules applied 9 place count 67 transition count 145
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 58 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 57 transition count 144
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 20 place count 57 transition count 135
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 38 place count 48 transition count 135
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 44 place count 42 transition count 126
Iterating global reduction 3 with 6 rules applied. Total rules applied 50 place count 42 transition count 126
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 52 place count 40 transition count 122
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 40 transition count 122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 57 place count 40 transition count 119
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 63 place count 37 transition count 116
Drop transitions removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 4 with 49 rules applied. Total rules applied 112 place count 37 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 113 place count 37 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 114 place count 36 transition count 66
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 120 place count 33 transition count 63
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 122 place count 33 transition count 63
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 123 place count 33 transition count 62
Applied a total of 123 rules in 59 ms. Remains 33 /67 variables (removed 34) and now considering 62/154 (removed 92) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 33/67 places, 62/154 transitions.
[2023-03-23 07:27:21] [INFO ] Flatten gal took : 5 ms
[2023-03-23 07:27:21] [INFO ] Flatten gal took : 5 ms
[2023-03-23 07:27:21] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 154/154 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 55 transition count 137
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 55 transition count 137
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 48 transition count 126
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 48 transition count 126
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 45 transition count 123
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 45 transition count 123
Applied a total of 44 rules in 16 ms. Remains 45 /67 variables (removed 22) and now considering 123/154 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 45/67 places, 123/154 transitions.
[2023-03-23 07:27:21] [INFO ] Flatten gal took : 8 ms
[2023-03-23 07:27:21] [INFO ] Flatten gal took : 10 ms
[2023-03-23 07:27:21] [INFO ] Input system was already deterministic with 123 transitions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 154/154 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 56 transition count 139
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 56 transition count 139
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 52 transition count 133
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 52 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 51 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 51 transition count 132
Applied a total of 32 rules in 8 ms. Remains 51 /67 variables (removed 16) and now considering 132/154 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 51/67 places, 132/154 transitions.
[2023-03-23 07:27:21] [INFO ] Flatten gal took : 8 ms
[2023-03-23 07:27:21] [INFO ] Flatten gal took : 9 ms
[2023-03-23 07:27:21] [INFO ] Input system was already deterministic with 132 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 67/67 places, 154/154 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 67 transition count 142
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 55 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 54 transition count 141
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 26 place count 54 transition count 133
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 42 place count 46 transition count 133
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 51 place count 37 transition count 119
Iterating global reduction 3 with 9 rules applied. Total rules applied 60 place count 37 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 37 transition count 118
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 64 place count 34 transition count 112
Iterating global reduction 4 with 3 rules applied. Total rules applied 67 place count 34 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 69 place count 34 transition count 110
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 81 place count 28 transition count 104
Drop transitions removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 5 with 57 rules applied. Total rules applied 138 place count 28 transition count 47
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 148 place count 23 transition count 42
Applied a total of 148 rules in 33 ms. Remains 23 /67 variables (removed 44) and now considering 42/154 (removed 112) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 23/67 places, 42/154 transitions.
[2023-03-23 07:27:21] [INFO ] Flatten gal took : 3 ms
[2023-03-23 07:27:21] [INFO ] Flatten gal took : 3 ms
[2023-03-23 07:27:21] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 154/154 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 56 transition count 140
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 56 transition count 140
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 51 transition count 132
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 51 transition count 132
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 49 transition count 130
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 49 transition count 130
Applied a total of 36 rules in 7 ms. Remains 49 /67 variables (removed 18) and now considering 130/154 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 49/67 places, 130/154 transitions.
[2023-03-23 07:27:21] [INFO ] Flatten gal took : 8 ms
[2023-03-23 07:27:21] [INFO ] Flatten gal took : 9 ms
[2023-03-23 07:27:21] [INFO ] Input system was already deterministic with 130 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 67/67 places, 154/154 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 66 transition count 138
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 51 transition count 138
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 30 place count 51 transition count 128
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 50 place count 41 transition count 128
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 59 place count 32 transition count 114
Iterating global reduction 2 with 9 rules applied. Total rules applied 68 place count 32 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 32 transition count 113
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 73 place count 28 transition count 105
Iterating global reduction 3 with 4 rules applied. Total rules applied 77 place count 28 transition count 105
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 107 place count 28 transition count 75
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 4 with 2 rules applied. Total rules applied 109 place count 27 transition count 74
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 4 with 2 rules applied. Total rules applied 111 place count 26 transition count 73
Drop transitions removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 4 with 35 rules applied. Total rules applied 146 place count 26 transition count 38
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 156 place count 21 transition count 33
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 157 place count 21 transition count 33
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 161 place count 17 transition count 29
Applied a total of 161 rules in 33 ms. Remains 17 /67 variables (removed 50) and now considering 29/154 (removed 125) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 17/67 places, 29/154 transitions.
[2023-03-23 07:27:21] [INFO ] Flatten gal took : 2 ms
[2023-03-23 07:27:21] [INFO ] Flatten gal took : 2 ms
[2023-03-23 07:27:21] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 67/67 places, 154/154 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 66 transition count 139
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 52 transition count 139
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 28 place count 52 transition count 129
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 48 place count 42 transition count 129
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 57 place count 33 transition count 115
Iterating global reduction 2 with 9 rules applied. Total rules applied 66 place count 33 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 33 transition count 114
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 71 place count 29 transition count 106
Iterating global reduction 3 with 4 rules applied. Total rules applied 75 place count 29 transition count 106
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 105 place count 29 transition count 76
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 4 with 2 rules applied. Total rules applied 107 place count 28 transition count 75
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 4 with 2 rules applied. Total rules applied 109 place count 27 transition count 74
Drop transitions removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 4 with 35 rules applied. Total rules applied 144 place count 27 transition count 39
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 154 place count 22 transition count 34
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 157 place count 19 transition count 31
Applied a total of 157 rules in 26 ms. Remains 19 /67 variables (removed 48) and now considering 31/154 (removed 123) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 19/67 places, 31/154 transitions.
[2023-03-23 07:27:21] [INFO ] Flatten gal took : 2 ms
[2023-03-23 07:27:21] [INFO ] Flatten gal took : 2 ms
[2023-03-23 07:27:21] [INFO ] Input system was already deterministic with 31 transitions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 154/154 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 56 transition count 138
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 56 transition count 138
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 49 transition count 127
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 49 transition count 127
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 45 transition count 123
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 45 transition count 123
Applied a total of 44 rules in 7 ms. Remains 45 /67 variables (removed 22) and now considering 123/154 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 45/67 places, 123/154 transitions.
[2023-03-23 07:27:21] [INFO ] Flatten gal took : 7 ms
[2023-03-23 07:27:21] [INFO ] Flatten gal took : 9 ms
[2023-03-23 07:27:21] [INFO ] Input system was already deterministic with 123 transitions.
[2023-03-23 07:27:21] [INFO ] Flatten gal took : 10 ms
[2023-03-23 07:27:21] [INFO ] Flatten gal took : 16 ms
[2023-03-23 07:27:21] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-23 07:27:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 67 places, 154 transitions and 856 arcs took 3 ms.
Total runtime 3710 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: 67 NrTr: 154 NrArc: 856)

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

net check time: 0m 0.000sec

init dd package: 0m 3.596sec


RS generation: 0m 0.123sec


-> reachability set: #nodes 3381 (3.4e+03) #states 4,407 (3)



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

checking: EF [AG [[p10<=1 & 1<=p10]]]
normalized: E [true U ~ [E [true U ~ [[p10<=1 & 1<=p10]]]]]

abstracting: (1<=p10)
states: 1
abstracting: (p10<=1)
states: 4,407 (3)
-> the formula is FALSE

FORMULA StigmergyElection-PT-05a-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.085sec

checking: AG [[[p64<=1 & 1<=p64] | EF [EG [~ [[p65<=1 & 1<=p65]]]]]]
normalized: ~ [E [true U ~ [[E [true U EG [~ [[p65<=1 & 1<=p65]]]] | [p64<=1 & 1<=p64]]]]]

abstracting: (1<=p64)
states: 973
abstracting: (p64<=1)
states: 4,407 (3)
abstracting: (1<=p65)
states: 81
abstracting: (p65<=1)
states: 4,407 (3)
...........
EG iterations: 11
-> the formula is TRUE

FORMULA StigmergyElection-PT-05a-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.144sec

checking: A [[EX [0<=0] & [p61<=1 & 1<=p61]] U EF [~ [EF [[p49<=1 & 1<=p49]]]]]
normalized: [~ [EG [~ [E [true U ~ [E [true U [p49<=1 & 1<=p49]]]]]]] & ~ [E [~ [E [true U ~ [E [true U [p49<=1 & 1<=p49]]]]] U [~ [[[p61<=1 & 1<=p61] & EX [0<=0]]] & ~ [E [true U ~ [E [true U [p49<=1 & 1<=p49]]]]]]]]]

abstracting: (1<=p49)
states: 1
abstracting: (p49<=1)
states: 4,407 (3)
abstracting: (0<=0)
states: 4,407 (3)
.abstracting: (1<=p61)
states: 1
abstracting: (p61<=1)
states: 4,407 (3)
abstracting: (1<=p49)
states: 1
abstracting: (p49<=1)
states: 4,407 (3)
abstracting: (1<=p49)
states: 1
abstracting: (p49<=1)
states: 4,407 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA StigmergyElection-PT-05a-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.120sec

checking: AG [AX [E [AX [EG [[p27<=1 & 1<=p27]]] U EF [[[p44<=0 & 0<=p44] | [p8<=1 & 1<=p8]]]]]]
normalized: ~ [E [true U EX [~ [E [~ [EX [~ [EG [[p27<=1 & 1<=p27]]]]] U E [true U [[p8<=1 & 1<=p8] | [p44<=0 & 0<=p44]]]]]]]]

abstracting: (0<=p44)
states: 4,407 (3)
abstracting: (p44<=0)
states: 3,782 (3)
abstracting: (1<=p8)
states: 1
abstracting: (p8<=1)
states: 4,407 (3)
abstracting: (1<=p27)
states: 81
abstracting: (p27<=1)
states: 4,407 (3)
..........
EG iterations: 10
..-> the formula is TRUE

FORMULA StigmergyElection-PT-05a-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.056sec

checking: EF [[AF [~ [E [[[p43<=0 & 0<=p43] | [p30<=1 & 1<=p30]] U [p0<=0 & 0<=p0]]]] & [[p63<=0 & 0<=p63] & [p3<=1 & 1<=p3]]]]
normalized: E [true U [[[p3<=1 & 1<=p3] & [p63<=0 & 0<=p63]] & ~ [EG [E [[[p30<=1 & 1<=p30] | [p43<=0 & 0<=p43]] U [p0<=0 & 0<=p0]]]]]]

abstracting: (0<=p0)
states: 4,407 (3)
abstracting: (p0<=0)
states: 4,406 (3)
abstracting: (0<=p43)
states: 4,407 (3)
abstracting: (p43<=0)
states: 3,782 (3)
abstracting: (1<=p30)
states: 625
abstracting: (p30<=1)
states: 4,407 (3)

EG iterations: 0
abstracting: (0<=p63)
states: 4,407 (3)
abstracting: (p63<=0)
states: 4,406 (3)
abstracting: (1<=p3)
states: 625
abstracting: (p3<=1)
states: 4,407 (3)
-> the formula is FALSE

FORMULA StigmergyElection-PT-05a-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: AX [~ [E [E [AF [[p6<=0 & 0<=p6]] U [p5<=1 & 1<=p5]] U [A [[[p44<=0 & 0<=p44] | [p11<=1 & 1<=p11]] U EG [[p27<=0 & 0<=p27]]] & AG [[p55<=1 & 1<=p55]]]]]]
normalized: ~ [EX [E [E [~ [EG [~ [[p6<=0 & 0<=p6]]]] U [p5<=1 & 1<=p5]] U [~ [E [true U ~ [[p55<=1 & 1<=p55]]]] & [~ [EG [~ [EG [[p27<=0 & 0<=p27]]]]] & ~ [E [~ [EG [[p27<=0 & 0<=p27]]] U [~ [[[p11<=1 & 1<=p11] | [p44<=0 & 0<=p44]]] & ~ [EG [[p27<=0 & 0<=p27]]]]]]]]]]]

abstracting: (0<=p27)
states: 4,407 (3)
abstracting: (p27<=0)
states: 4,326 (3)
..
EG iterations: 2
abstracting: (0<=p44)
states: 4,407 (3)
abstracting: (p44<=0)
states: 3,782 (3)
abstracting: (1<=p11)
states: 1
abstracting: (p11<=1)
states: 4,407 (3)
abstracting: (0<=p27)
states: 4,407 (3)
abstracting: (p27<=0)
states: 4,326 (3)
..
EG iterations: 2
abstracting: (0<=p27)
states: 4,407 (3)
abstracting: (p27<=0)
states: 4,326 (3)
..
EG iterations: 2
...........
EG iterations: 11
abstracting: (1<=p55)
states: 625
abstracting: (p55<=1)
states: 4,407 (3)
abstracting: (1<=p5)
states: 256
abstracting: (p5<=1)
states: 4,407 (3)
abstracting: (0<=p6)
states: 4,407 (3)
abstracting: (p6<=0)
states: 4,151 (3)
..
EG iterations: 2
.-> the formula is TRUE

FORMULA StigmergyElection-PT-05a-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.126sec

checking: [~ [A [[EG [~ [EX [[p15<=1 & 1<=p15]]]] & [p5<=0 & 0<=p5]] U [~ [EF [[p61<=0 & 0<=p61]]] | EG [[p41<=1 & 1<=p41]]]]] & E [[[p25<=0 & 0<=p25] | [p30<=1 & 1<=p30]] U EF [~ [EF [[p0<=0 & 0<=p0]]]]]]
normalized: [E [[[p30<=1 & 1<=p30] | [p25<=0 & 0<=p25]] U E [true U ~ [E [true U [p0<=0 & 0<=p0]]]]] & ~ [[~ [EG [~ [[EG [[p41<=1 & 1<=p41]] | ~ [E [true U [p61<=0 & 0<=p61]]]]]]] & ~ [E [~ [[EG [[p41<=1 & 1<=p41]] | ~ [E [true U [p61<=0 & 0<=p61]]]]] U [~ [[[p5<=0 & 0<=p5] & EG [~ [EX [[p15<=1 & 1<=p15]]]]]] & ~ [[EG [[p41<=1 & 1<=p41]] | ~ [E [true U [p61<=0 & 0<=p61]]]]]]]]]]]

abstracting: (0<=p61)
states: 4,407 (3)
abstracting: (p61<=0)
states: 4,406 (3)
abstracting: (1<=p41)
states: 81
abstracting: (p41<=1)
states: 4,407 (3)
..........
EG iterations: 10
abstracting: (1<=p15)
states: 625
abstracting: (p15<=1)
states: 4,407 (3)
...
EG iterations: 2
abstracting: (0<=p5)
states: 4,407 (3)
abstracting: (p5<=0)
states: 4,151 (3)
abstracting: (0<=p61)
states: 4,407 (3)
abstracting: (p61<=0)
states: 4,406 (3)
abstracting: (1<=p41)
states: 81
abstracting: (p41<=1)
states: 4,407 (3)
..........
EG iterations: 10
abstracting: (0<=p61)
states: 4,407 (3)
abstracting: (p61<=0)
states: 4,406 (3)
abstracting: (1<=p41)
states: 81
abstracting: (p41<=1)
states: 4,407 (3)
..........
EG iterations: 10

EG iterations: 0
abstracting: (0<=p0)
states: 4,407 (3)
abstracting: (p0<=0)
states: 4,406 (3)
abstracting: (0<=p25)
states: 4,407 (3)
abstracting: (p25<=0)
states: 3,435 (3)
abstracting: (1<=p30)
states: 625
abstracting: (p30<=1)
states: 4,407 (3)
-> the formula is FALSE

FORMULA StigmergyElection-PT-05a-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.153sec

checking: [AG [[[AG [[[p39<=0 & 0<=p39] & [p58<=1 & 1<=p58]]] & [p2<=0 & 0<=p2]] | EG [~ [E [[p35<=1 & 1<=p35] U [p43<=1 & 1<=p43]]]]]] & EF [~ [A [~ [[p60<=1 & 1<=p60]] U [[[p46<=0 & 0<=p46] | [p56<=1 & 1<=p56]] & [[p66<=0 & 0<=p66] | [p26<=1 & 1<=p26]]]]]]]
normalized: [E [true U ~ [[~ [EG [~ [[[[p26<=1 & 1<=p26] | [p66<=0 & 0<=p66]] & [[p56<=1 & 1<=p56] | [p46<=0 & 0<=p46]]]]]] & ~ [E [~ [[[[p26<=1 & 1<=p26] | [p66<=0 & 0<=p66]] & [[p56<=1 & 1<=p56] | [p46<=0 & 0<=p46]]]] U [[p60<=1 & 1<=p60] & ~ [[[[p26<=1 & 1<=p26] | [p66<=0 & 0<=p66]] & [[p56<=1 & 1<=p56] | [p46<=0 & 0<=p46]]]]]]]]]] & ~ [E [true U ~ [[EG [~ [E [[p35<=1 & 1<=p35] U [p43<=1 & 1<=p43]]]] | [[p2<=0 & 0<=p2] & ~ [E [true U ~ [[[p58<=1 & 1<=p58] & [p39<=0 & 0<=p39]]]]]]]]]]]

abstracting: (0<=p39)
states: 4,407 (3)
abstracting: (p39<=0)
states: 3,435 (3)
abstracting: (1<=p58)
states: 256
abstracting: (p58<=1)
states: 4,407 (3)
abstracting: (0<=p2)
states: 4,407 (3)
abstracting: (p2<=0)
states: 3,782 (3)
abstracting: (1<=p43)
states: 625
abstracting: (p43<=1)
states: 4,407 (3)
abstracting: (1<=p35)
states: 1
abstracting: (p35<=1)
states: 4,407 (3)
...
EG iterations: 3
abstracting: (0<=p46)
states: 4,407 (3)
abstracting: (p46<=0)
states: 4,151 (3)
abstracting: (1<=p56)
states: 625
abstracting: (p56<=1)
states: 4,407 (3)
abstracting: (0<=p66)
states: 4,407 (3)
abstracting: (p66<=0)
states: 4,326 (3)
abstracting: (1<=p26)
states: 81
abstracting: (p26<=1)
states: 4,407 (3)
abstracting: (1<=p60)
states: 1
abstracting: (p60<=1)
states: 4,407 (3)
abstracting: (0<=p46)
states: 4,407 (3)
abstracting: (p46<=0)
states: 4,151 (3)
abstracting: (1<=p56)
states: 625
abstracting: (p56<=1)
states: 4,407 (3)
abstracting: (0<=p66)
states: 4,407 (3)
abstracting: (p66<=0)
states: 4,326 (3)
abstracting: (1<=p26)
states: 81
abstracting: (p26<=1)
states: 4,407 (3)
abstracting: (0<=p46)
states: 4,407 (3)
abstracting: (p46<=0)
states: 4,151 (3)
abstracting: (1<=p56)
states: 625
abstracting: (p56<=1)
states: 4,407 (3)
abstracting: (0<=p66)
states: 4,407 (3)
abstracting: (p66<=0)
states: 4,326 (3)
abstracting: (1<=p26)
states: 81
abstracting: (p26<=1)
states: 4,407 (3)
........
EG iterations: 8
-> the formula is FALSE

FORMULA StigmergyElection-PT-05a-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.154sec

totally nodes used: 391551 (3.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 405478 2024440 2429918
used/not used/entry size/cache size: 2312288 64796576 16 1024MB
basic ops cache: hits/miss/sum: 87196 361194 448390
used/not used/entry size/cache size: 559739 16217477 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: 2911 15782 18693
used/not used/entry size/cache size: 15768 8372840 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 66765956
1 300863
2 36202
3 5163
4 608
5 69
6 3
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 6.920sec


BK_STOP 1679556451870

--------------------
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:8044 (52), effective:235 (1)

initing FirstDep: 0m 0.000sec


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

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

iterations count:2131 (13), effective:58 (0)

iterations count:2123 (13), effective:58 (0)

iterations count:2131 (13), effective:58 (0)

iterations count:2123 (13), effective:58 (0)

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

iterations count:2131 (13), effective:58 (0)

iterations count:2123 (13), effective:58 (0)

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

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

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

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

iterations count:2385 (15), effective:66 (0)

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

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

iterations count:1977 (12), effective:56 (0)

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

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

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

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

iterations count:2114 (13), effective:60 (0)

iterations count:2048 (13), effective:57 (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="StigmergyElection-PT-05a"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;