About the Execution of Marcie+red for StigmergyElection-PT-02a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5451.504 | 17752.00 | 21973.00 | 1896.00 | FFFFTFFFFFTFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r458-smll-167912650400554.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-02a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650400554
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 10K Feb 26 16:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 16:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 16:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 16:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 26 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 16:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 26 16:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 15K 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-02a-CTLFireability-00
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-01
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-02
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-03
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-04
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-05
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-06
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-07
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-08
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-09
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-10
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-11
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-12
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-13
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-14
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679548155902
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-02a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 05:09:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 05:09:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 05:09:20] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2023-03-23 05:09:20] [INFO ] Transformed 30 places.
[2023-03-23 05:09:20] [INFO ] Transformed 66 transitions.
[2023-03-23 05:09:20] [INFO ] Found NUPN structural information;
[2023-03-23 05:09:20] [INFO ] Parsed PT model containing 30 places and 66 transitions and 196 arcs in 285 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 20 transitions
Reduce redundant transitions removed 20 transitions.
FORMULA StigmergyElection-PT-02a-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02a-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02a-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Applied a total of 0 rules in 22 ms. Remains 30 /30 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2023-03-23 05:09:21] [INFO ] Flow matrix only has 40 transitions (discarded 6 similar events)
// Phase 1: matrix 40 rows 30 cols
[2023-03-23 05:09:21] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-23 05:09:21] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-03-23 05:09:21] [INFO ] Flow matrix only has 40 transitions (discarded 6 similar events)
[2023-03-23 05:09:21] [INFO ] Invariant cache hit.
[2023-03-23 05:09:21] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-23 05:09:21] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2023-03-23 05:09:21] [INFO ] Flow matrix only has 40 transitions (discarded 6 similar events)
[2023-03-23 05:09:21] [INFO ] Invariant cache hit.
[2023-03-23 05:09:21] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 581 ms. Remains : 30/30 places, 46/46 transitions.
Support contains 28 out of 30 places after structural reductions.
[2023-03-23 05:09:21] [INFO ] Flatten gal took : 42 ms
[2023-03-23 05:09:22] [INFO ] Flatten gal took : 23 ms
[2023-03-23 05:09:22] [INFO ] Input system was already deterministic with 46 transitions.
Incomplete random walk after 10000 steps, including 246 resets, run finished after 974 ms. (steps per millisecond=10 ) properties (out of 37) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 62 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-23 05:09:23] [INFO ] Flow matrix only has 40 transitions (discarded 6 similar events)
[2023-03-23 05:09:23] [INFO ] Invariant cache hit.
[2023-03-23 05:09:24] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 05:09:24] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2023-03-23 05:09:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 05:09:24] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 6 atomic propositions for a total of 13 simplifications.
[2023-03-23 05:09:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-23 05:09:24] [INFO ] Flatten gal took : 8 ms
FORMULA StigmergyElection-PT-02a-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 05:09:24] [INFO ] Flatten gal took : 7 ms
[2023-03-23 05:09:24] [INFO ] Input system was already deterministic with 46 transitions.
Support contains 24 out of 30 places (down from 25) after GAL structural reductions.
Computed a total of 6 stabilizing places and 5 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 27 transition count 41
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 27 transition count 41
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 37
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 37
Applied a total of 10 rules in 6 ms. Remains 25 /30 variables (removed 5) and now considering 37/46 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 25/30 places, 37/46 transitions.
[2023-03-23 05:09:24] [INFO ] Flatten gal took : 8 ms
[2023-03-23 05:09:24] [INFO ] Flatten gal took : 4 ms
[2023-03-23 05:09:24] [INFO ] Input system was already deterministic with 37 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 27 transition count 41
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 27 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 39
Applied a total of 8 rules in 3 ms. Remains 26 /30 variables (removed 4) and now considering 39/46 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 26/30 places, 39/46 transitions.
[2023-03-23 05:09:24] [INFO ] Flatten gal took : 3 ms
[2023-03-23 05:09:24] [INFO ] Flatten gal took : 4 ms
[2023-03-23 05:09:24] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 27 transition count 41
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 27 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 39
Applied a total of 8 rules in 3 ms. Remains 26 /30 variables (removed 4) and now considering 39/46 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 26/30 places, 39/46 transitions.
[2023-03-23 05:09:24] [INFO ] Flatten gal took : 3 ms
[2023-03-23 05:09:24] [INFO ] Flatten gal took : 3 ms
[2023-03-23 05:09:24] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 29 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 45
Applied a total of 2 rules in 2 ms. Remains 29 /30 variables (removed 1) and now considering 45/46 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 29/30 places, 45/46 transitions.
[2023-03-23 05:09:24] [INFO ] Flatten gal took : 3 ms
[2023-03-23 05:09:24] [INFO ] Flatten gal took : 3 ms
[2023-03-23 05:09:24] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 27 transition count 41
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 27 transition count 41
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 37
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 37
Applied a total of 10 rules in 3 ms. Remains 25 /30 variables (removed 5) and now considering 37/46 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 25/30 places, 37/46 transitions.
[2023-03-23 05:09:24] [INFO ] Flatten gal took : 2 ms
[2023-03-23 05:09:24] [INFO ] Flatten gal took : 3 ms
[2023-03-23 05:09:24] [INFO ] Input system was already deterministic with 37 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 27 transition count 41
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 27 transition count 41
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 37
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 37
Applied a total of 10 rules in 2 ms. Remains 25 /30 variables (removed 5) and now considering 37/46 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 25/30 places, 37/46 transitions.
[2023-03-23 05:09:24] [INFO ] Flatten gal took : 2 ms
[2023-03-23 05:09:24] [INFO ] Flatten gal took : 3 ms
[2023-03-23 05:09:24] [INFO ] Input system was already deterministic with 37 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 28 transition count 43
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 28 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 41
Applied a total of 6 rules in 2 ms. Remains 27 /30 variables (removed 3) and now considering 41/46 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 27/30 places, 41/46 transitions.
[2023-03-23 05:09:24] [INFO ] Flatten gal took : 2 ms
[2023-03-23 05:09:24] [INFO ] Flatten gal took : 2 ms
[2023-03-23 05:09:24] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 28 transition count 41
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 24 transition count 41
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 9 place count 24 transition count 35
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 21 place count 18 transition count 35
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 26 place count 13 transition count 28
Iterating global reduction 2 with 5 rules applied. Total rules applied 31 place count 13 transition count 28
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 11 transition count 24
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 11 transition count 24
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 38 place count 11 transition count 21
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 11 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 44 place count 9 transition count 17
Applied a total of 44 rules in 18 ms. Remains 9 /30 variables (removed 21) and now considering 17/46 (removed 29) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 9/30 places, 17/46 transitions.
[2023-03-23 05:09:24] [INFO ] Flatten gal took : 1 ms
[2023-03-23 05:09:24] [INFO ] Flatten gal took : 1 ms
[2023-03-23 05:09:24] [INFO ] Input system was already deterministic with 17 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
FORMULA StigmergyElection-PT-02a-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 27 transition count 41
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 27 transition count 41
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 37
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 37
Applied a total of 10 rules in 2 ms. Remains 25 /30 variables (removed 5) and now considering 37/46 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 25/30 places, 37/46 transitions.
[2023-03-23 05:09:24] [INFO ] Flatten gal took : 2 ms
[2023-03-23 05:09:24] [INFO ] Flatten gal took : 2 ms
[2023-03-23 05:09:24] [INFO ] Input system was already deterministic with 37 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
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 9 rules applied. Total rules applied 9 place count 28 transition count 37
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 20 transition count 37
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 17 place count 20 transition count 33
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 25 place count 16 transition count 33
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 14 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 14 transition count 29
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 31 place count 12 transition count 25
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 12 transition count 25
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 36 place count 12 transition count 22
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 41 place count 12 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 45 place count 10 transition count 15
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 10 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 10 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 49 place count 8 transition count 12
Applied a total of 49 rules in 10 ms. Remains 8 /30 variables (removed 22) and now considering 12/46 (removed 34) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 8/30 places, 12/46 transitions.
[2023-03-23 05:09:24] [INFO ] Flatten gal took : 1 ms
[2023-03-23 05:09:24] [INFO ] Flatten gal took : 1 ms
[2023-03-23 05:09:24] [INFO ] Input system was already deterministic with 12 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
FORMULA StigmergyElection-PT-02a-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 30 transition count 43
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 42
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 26 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 26 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 25 transition count 40
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 25 transition count 40
Applied a total of 12 rules in 9 ms. Remains 25 /30 variables (removed 5) and now considering 40/46 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 25/30 places, 40/46 transitions.
[2023-03-23 05:09:24] [INFO ] Flatten gal took : 2 ms
[2023-03-23 05:09:24] [INFO ] Flatten gal took : 3 ms
[2023-03-23 05:09:24] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 28 transition count 43
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 28 transition count 43
Applied a total of 4 rules in 1 ms. Remains 28 /30 variables (removed 2) and now considering 43/46 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 28/30 places, 43/46 transitions.
[2023-03-23 05:09:24] [INFO ] Flatten gal took : 3 ms
[2023-03-23 05:09:24] [INFO ] Flatten gal took : 3 ms
[2023-03-23 05:09:24] [INFO ] Input system was already deterministic with 43 transitions.
[2023-03-23 05:09:24] [INFO ] Flatten gal took : 4 ms
[2023-03-23 05:09:24] [INFO ] Flatten gal took : 3 ms
[2023-03-23 05:09:24] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-23 05:09:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 46 transitions and 128 arcs took 1 ms.
Total runtime 3989 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 30 NrTr: 46 NrArc: 128)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.677sec
RS generation: 0m 0.005sec
-> reachability set: #nodes 161 (1.6e+02) #states 57
starting MCC model checker
--------------------------
checking: AX [EX [EG [AX [[p3<=0 & 0<=p3]]]]]
normalized: ~ [EX [~ [EX [EG [~ [EX [~ [[p3<=0 & 0<=p3]]]]]]]]]
abstracting: (0<=p3)
states: 57
abstracting: (p3<=0)
states: 52
..
EG iterations: 1
..-> the formula is TRUE
FORMULA StigmergyElection-PT-02a-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AF [AX [AF [EG [[[p3<=1 & 1<=p3] | [[p13<=1 & 1<=p13] & [p29<=1 & 1<=p29]]]]]]]
normalized: ~ [EG [EX [EG [~ [EG [[[[p13<=1 & 1<=p13] & [p29<=1 & 1<=p29]] | [p3<=1 & 1<=p3]]]]]]]]
abstracting: (1<=p3)
states: 5
abstracting: (p3<=1)
states: 57
abstracting: (1<=p29)
states: 56
abstracting: (p29<=1)
states: 57
abstracting: (1<=p13)
states: 3
abstracting: (p13<=1)
states: 57
....
EG iterations: 4
.
EG iterations: 1
.
EG iterations: 0
-> the formula is FALSE
FORMULA StigmergyElection-PT-02a-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AX [EX [[[p12<=1 & 1<=p12] & [[p26<=1 & 1<=p26] & [[p24<=0 & 0<=p24] | [p29<=0 & 0<=p29]]]]]]
normalized: ~ [EX [~ [EX [[[[[p29<=0 & 0<=p29] | [p24<=0 & 0<=p24]] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]]]]]]
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
abstracting: (0<=p24)
states: 57
abstracting: (p24<=0)
states: 56
abstracting: (0<=p29)
states: 57
abstracting: (p29<=0)
states: 1
..-> the formula is FALSE
FORMULA StigmergyElection-PT-02a-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EX [AX [A [[~ [AX [[p1<=1 & 1<=p1]]] & [AF [[[p12<=1 & 1<=p12] & [p26<=1 & 1<=p26]]] | EX [[p19<=1 & 1<=p19]]]] U ~ [EF [[p5<=1 & 1<=p5]]]]]]
normalized: EX [~ [EX [~ [[~ [EG [E [true U [p5<=1 & 1<=p5]]]] & ~ [E [E [true U [p5<=1 & 1<=p5]] U [~ [[[EX [[p19<=1 & 1<=p19]] | ~ [EG [~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]]] & EX [~ [[p1<=1 & 1<=p1]]]]] & E [true U [p5<=1 & 1<=p5]]]]]]]]]]
abstracting: (1<=p5)
states: 4
abstracting: (p5<=1)
states: 57
abstracting: (1<=p1)
states: 5
abstracting: (p1<=1)
states: 57
.abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
......
EG iterations: 6
abstracting: (1<=p19)
states: 4
abstracting: (p19<=1)
states: 57
.abstracting: (1<=p5)
states: 4
abstracting: (p5<=1)
states: 57
abstracting: (1<=p5)
states: 4
abstracting: (p5<=1)
states: 57
.
EG iterations: 1
..-> the formula is FALSE
FORMULA StigmergyElection-PT-02a-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: AG [AX [[E [[[p12<=1 & 1<=p12] & [p26<=1 & 1<=p26]] U E [[[p12<=1 & 1<=p12] & [p26<=1 & 1<=p26]] U [p25<=1 & 1<=p25]]] | AF [[p11<=1 & 1<=p11]]]]]
normalized: ~ [E [true U EX [~ [[E [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]] U E [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]] U [p25<=1 & 1<=p25]]] | ~ [EG [~ [[p11<=1 & 1<=p11]]]]]]]]]
abstracting: (1<=p11)
states: 1
abstracting: (p11<=1)
states: 57
.
EG iterations: 1
abstracting: (1<=p25)
states: 1
abstracting: (p25<=1)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
.-> the formula is FALSE
FORMULA StigmergyElection-PT-02a-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: A [EF [~ [[[p12<=1 & 1<=p12] & [p26<=1 & 1<=p26]]]] U [[p2<=1 & 1<=p2] | A [AG [[[p4<=1 & 1<=p4] & [p29<=1 & 1<=p29]]] U AG [EX [[[p12<=1 & 1<=p12] & [p26<=1 & 1<=p26]]]]]]]
normalized: [~ [EG [~ [[[~ [EG [E [true U ~ [EX [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]]]] & ~ [E [E [true U ~ [EX [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]] U [E [true U ~ [EX [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]] & E [true U ~ [[[p29<=1 & 1<=p29] & [p4<=1 & 1<=p4]]]]]]]] | [p2<=1 & 1<=p2]]]]] & ~ [E [~ [[[~ [EG [E [true U ~ [EX [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]]]] & ~ [E [E [true U ~ [EX [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]] U [E [true U ~ [EX [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]] & E [true U ~ [[[p29<=1 & 1<=p29] & [p4<=1 & 1<=p4]]]]]]]] | [p2<=1 & 1<=p2]]] U [~ [E [true U ~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]] & ~ [[[~ [EG [E [true U ~ [EX [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]]]] & ~ [E [E [true U ~ [EX [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]] U [E [true U ~ [EX [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]] & E [true U ~ [[[p29<=1 & 1<=p29] & [p4<=1 & 1<=p4]]]]]]]] | [p2<=1 & 1<=p2]]]]]]]
abstracting: (1<=p2)
states: 5
abstracting: (p2<=1)
states: 57
abstracting: (1<=p4)
states: 5
abstracting: (p4<=1)
states: 57
abstracting: (1<=p29)
states: 56
abstracting: (p29<=1)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
.abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
.abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
.
EG iterations: 0
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
abstracting: (1<=p2)
states: 5
abstracting: (p2<=1)
states: 57
abstracting: (1<=p4)
states: 5
abstracting: (p4<=1)
states: 57
abstracting: (1<=p29)
states: 56
abstracting: (p29<=1)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
.abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
.abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
.
EG iterations: 0
abstracting: (1<=p2)
states: 5
abstracting: (p2<=1)
states: 57
abstracting: (1<=p4)
states: 5
abstracting: (p4<=1)
states: 57
abstracting: (1<=p29)
states: 56
abstracting: (p29<=1)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
.abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
.abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
.
EG iterations: 0
...
EG iterations: 3
-> the formula is FALSE
FORMULA StigmergyElection-PT-02a-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: EF [[AX [1<=0] & [EX [[AG [[[p12<=0 & 0<=p12] | [p26<=0 & 0<=p26]]] | AF [[[p12<=0 & 0<=p12] | [p26<=0 & 0<=p26]]]]] & [[p2<=0 & 0<=p2] | [EG [[[p12<=0 & 0<=p12] | [p26<=0 & 0<=p26]]] | [~ [A [[[p27<=1 & 1<=p27] & [p29<=1 & 1<=p29]] U [[p12<=1 & 1<=p12] & [p26<=1 & 1<=p26]]]] & [[[p12<=0 & 0<=p12] | [p26<=0 & 0<=p26]] & [[p10<=0 & 0<=p10] | [p29<=0 & 0<=p29]]]]]]]]]
normalized: E [true U [[EX [[~ [E [true U ~ [[[p26<=0 & 0<=p26] | [p12<=0 & 0<=p12]]]]] | ~ [EG [~ [[[p26<=0 & 0<=p26] | [p12<=0 & 0<=p12]]]]]]] & [[p2<=0 & 0<=p2] | [[[[[p29<=0 & 0<=p29] | [p10<=0 & 0<=p10]] & [[p26<=0 & 0<=p26] | [p12<=0 & 0<=p12]]] & ~ [[~ [E [~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]] U [~ [[[p29<=1 & 1<=p29] & [p27<=1 & 1<=p27]]] & ~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]]] & ~ [EG [~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]]]]] | EG [[[p26<=0 & 0<=p26] | [p12<=0 & 0<=p12]]]]]] & ~ [EX [~ [1<=0]]]]]
abstracting: (1<=0)
states: 0
.abstracting: (0<=p12)
states: 57
abstracting: (p12<=0)
states: 43
abstracting: (0<=p26)
states: 57
abstracting: (p26<=0)
states: 43
......
EG iterations: 6
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
......
EG iterations: 6
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
abstracting: (1<=p27)
states: 3
abstracting: (p27<=1)
states: 57
abstracting: (1<=p29)
states: 56
abstracting: (p29<=1)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
abstracting: (0<=p12)
states: 57
abstracting: (p12<=0)
states: 43
abstracting: (0<=p26)
states: 57
abstracting: (p26<=0)
states: 43
abstracting: (0<=p10)
states: 57
abstracting: (p10<=0)
states: 56
abstracting: (0<=p29)
states: 57
abstracting: (p29<=0)
states: 1
abstracting: (0<=p2)
states: 57
abstracting: (p2<=0)
states: 52
abstracting: (0<=p12)
states: 57
abstracting: (p12<=0)
states: 43
abstracting: (0<=p26)
states: 57
abstracting: (p26<=0)
states: 43
.
EG iterations: 1
abstracting: (0<=p12)
states: 57
abstracting: (p12<=0)
states: 43
abstracting: (0<=p26)
states: 57
abstracting: (p26<=0)
states: 43
.-> the formula is FALSE
FORMULA StigmergyElection-PT-02a-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.040sec
checking: A [A [~ [[A [[[[p12<=1 & 1<=p12] & [p26<=1 & 1<=p26]] | [p19<=1 & 1<=p19]] U [p15<=1 & 1<=p15]] | [p3<=1 & 1<=p3]]] U A [EF [[p15<=1 & 1<=p15]] U [[p12<=1 & 1<=p12] & [p26<=1 & 1<=p26]]]] U [EF [[A [[[[p12<=1 & 1<=p12] & [p26<=1 & 1<=p26]] | [p5<=1 & 1<=p5]] U ~ [[p5<=1 & 1<=p5]]] | EG [[[p10<=1 & 1<=p10] & [p29<=1 & 1<=p29]]]]] & [p6<=1 & 1<=p6]]]
normalized: [~ [EG [~ [[E [true U [EG [[[p29<=1 & 1<=p29] & [p10<=1 & 1<=p10]]] | [~ [EG [[p5<=1 & 1<=p5]]] & ~ [E [[p5<=1 & 1<=p5] U [~ [[[p5<=1 & 1<=p5] | [[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]] & [p5<=1 & 1<=p5]]]]]]] & [p6<=1 & 1<=p6]]]]] & ~ [E [~ [[E [true U [EG [[[p29<=1 & 1<=p29] & [p10<=1 & 1<=p10]]] | [~ [EG [[p5<=1 & 1<=p5]]] & ~ [E [[p5<=1 & 1<=p5] U [~ [[[p5<=1 & 1<=p5] | [[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]] & [p5<=1 & 1<=p5]]]]]]] & [p6<=1 & 1<=p6]]] U [~ [[E [true U [EG [[[p29<=1 & 1<=p29] & [p10<=1 & 1<=p10]]] | [~ [EG [[p5<=1 & 1<=p5]]] & ~ [E [[p5<=1 & 1<=p5] U [~ [[[p5<=1 & 1<=p5] | [[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]] & [p5<=1 & 1<=p5]]]]]]] & [p6<=1 & 1<=p6]]] & ~ [[~ [EG [~ [[~ [EG [~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]] & ~ [E [~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]] U [~ [E [true U [p15<=1 & 1<=p15]]] & ~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]] & ~ [E [~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]] U [~ [E [true U [p15<=1 & 1<=p15]]] & ~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]]]]] U [[[~ [EG [~ [[p15<=1 & 1<=p15]]]] & ~ [E [~ [[p15<=1 & 1<=p15]] U [~ [[[p19<=1 & 1<=p19] | [[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]] & ~ [[p15<=1 & 1<=p15]]]]]] | [p3<=1 & 1<=p3]] & ~ [[~ [EG [~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]] & ~ [E [~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]] U [~ [E [true U [p15<=1 & 1<=p15]]] & ~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]]]]]]]]]]]]]]
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
abstracting: (1<=p15)
states: 5
abstracting: (p15<=1)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
......
EG iterations: 6
abstracting: (1<=p3)
states: 5
abstracting: (p3<=1)
states: 57
abstracting: (1<=p15)
states: 5
abstracting: (p15<=1)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
abstracting: (1<=p19)
states: 4
abstracting: (p19<=1)
states: 57
abstracting: (1<=p15)
states: 5
abstracting: (p15<=1)
states: 57
abstracting: (1<=p15)
states: 5
abstracting: (p15<=1)
states: 57
.
EG iterations: 1
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
abstracting: (1<=p15)
states: 5
abstracting: (p15<=1)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
......
EG iterations: 6
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
abstracting: (1<=p15)
states: 5
abstracting: (p15<=1)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
......
EG iterations: 6
.
EG iterations: 1
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 57
abstracting: (1<=p5)
states: 4
abstracting: (p5<=1)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
abstracting: (1<=p5)
states: 4
abstracting: (p5<=1)
states: 57
abstracting: (1<=p5)
states: 4
abstracting: (p5<=1)
states: 57
abstracting: (1<=p5)
states: 4
abstracting: (p5<=1)
states: 57
.
EG iterations: 1
abstracting: (1<=p10)
states: 1
abstracting: (p10<=1)
states: 57
abstracting: (1<=p29)
states: 56
abstracting: (p29<=1)
states: 57
..
EG iterations: 2
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 57
abstracting: (1<=p5)
states: 4
abstracting: (p5<=1)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
abstracting: (1<=p5)
states: 4
abstracting: (p5<=1)
states: 57
abstracting: (1<=p5)
states: 4
abstracting: (p5<=1)
states: 57
abstracting: (1<=p5)
states: 4
abstracting: (p5<=1)
states: 57
.
EG iterations: 1
abstracting: (1<=p10)
states: 1
abstracting: (p10<=1)
states: 57
abstracting: (1<=p29)
states: 56
abstracting: (p29<=1)
states: 57
..
EG iterations: 2
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 57
abstracting: (1<=p5)
states: 4
abstracting: (p5<=1)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
abstracting: (1<=p5)
states: 4
abstracting: (p5<=1)
states: 57
abstracting: (1<=p5)
states: 4
abstracting: (p5<=1)
states: 57
abstracting: (1<=p5)
states: 4
abstracting: (p5<=1)
states: 57
.
EG iterations: 1
abstracting: (1<=p10)
states: 1
abstracting: (p10<=1)
states: 57
abstracting: (1<=p29)
states: 56
abstracting: (p29<=1)
states: 57
..
EG iterations: 2
..
EG iterations: 2
-> the formula is FALSE
FORMULA StigmergyElection-PT-02a-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.013sec
checking: A [[EF [EX [~ [[[[p12<=1 & 1<=p12] & [p26<=1 & 1<=p26]] | [p20<=1 & 1<=p20]]]]] | [[p12<=1 & 1<=p12] & [p26<=1 & 1<=p26]]] U [AG [[p5<=1 & 1<=p5]] & [[EX [[p3<=1 & 1<=p3]] | [EX [[p16<=1 & 1<=p16]] | AG [[[p12<=1 & 1<=p12] & [p26<=1 & 1<=p26]]]]] | [[[p3<=1 & 1<=p3] | [p14<=1 & 1<=p14]] | [[[p18<=1 & 1<=p18] & [p29<=1 & 1<=p29]] | [[p17<=1 & 1<=p17] & [[p4<=1 & 1<=p4] & [p29<=1 & 1<=p29]]]]]]]]
normalized: [~ [EG [~ [[[[[[[[p29<=1 & 1<=p29] & [p4<=1 & 1<=p4]] & [p17<=1 & 1<=p17]] | [[p29<=1 & 1<=p29] & [p18<=1 & 1<=p18]]] | [[p14<=1 & 1<=p14] | [p3<=1 & 1<=p3]]] | [[~ [E [true U ~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]] | EX [[p16<=1 & 1<=p16]]] | EX [[p3<=1 & 1<=p3]]]] & ~ [E [true U ~ [[p5<=1 & 1<=p5]]]]]]]] & ~ [E [~ [[[[[[[[p29<=1 & 1<=p29] & [p4<=1 & 1<=p4]] & [p17<=1 & 1<=p17]] | [[p29<=1 & 1<=p29] & [p18<=1 & 1<=p18]]] | [[p14<=1 & 1<=p14] | [p3<=1 & 1<=p3]]] | [[~ [E [true U ~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]] | EX [[p16<=1 & 1<=p16]]] | EX [[p3<=1 & 1<=p3]]]] & ~ [E [true U ~ [[p5<=1 & 1<=p5]]]]]] U [~ [[[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]] | E [true U EX [~ [[[p20<=1 & 1<=p20] | [[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]]]]] & ~ [[[[[[[[p29<=1 & 1<=p29] & [p4<=1 & 1<=p4]] & [p17<=1 & 1<=p17]] | [[p29<=1 & 1<=p29] & [p18<=1 & 1<=p18]]] | [[p14<=1 & 1<=p14] | [p3<=1 & 1<=p3]]] | [[~ [E [true U ~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]] | EX [[p16<=1 & 1<=p16]]] | EX [[p3<=1 & 1<=p3]]]] & ~ [E [true U ~ [[p5<=1 & 1<=p5]]]]]]]]]]
abstracting: (1<=p5)
states: 4
abstracting: (p5<=1)
states: 57
abstracting: (1<=p3)
states: 5
abstracting: (p3<=1)
states: 57
.abstracting: (1<=p16)
states: 5
abstracting: (p16<=1)
states: 57
.abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
abstracting: (1<=p3)
states: 5
abstracting: (p3<=1)
states: 57
abstracting: (1<=p14)
states: 3
abstracting: (p14<=1)
states: 57
abstracting: (1<=p18)
states: 5
abstracting: (p18<=1)
states: 57
abstracting: (1<=p29)
states: 56
abstracting: (p29<=1)
states: 57
abstracting: (1<=p17)
states: 5
abstracting: (p17<=1)
states: 57
abstracting: (1<=p4)
states: 5
abstracting: (p4<=1)
states: 57
abstracting: (1<=p29)
states: 56
abstracting: (p29<=1)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
abstracting: (1<=p20)
states: 4
abstracting: (p20<=1)
states: 57
.abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
abstracting: (1<=p5)
states: 4
abstracting: (p5<=1)
states: 57
abstracting: (1<=p3)
states: 5
abstracting: (p3<=1)
states: 57
.abstracting: (1<=p16)
states: 5
abstracting: (p16<=1)
states: 57
.abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
abstracting: (1<=p3)
states: 5
abstracting: (p3<=1)
states: 57
abstracting: (1<=p14)
states: 3
abstracting: (p14<=1)
states: 57
abstracting: (1<=p18)
states: 5
abstracting: (p18<=1)
states: 57
abstracting: (1<=p29)
states: 56
abstracting: (p29<=1)
states: 57
abstracting: (1<=p17)
states: 5
abstracting: (p17<=1)
states: 57
abstracting: (1<=p4)
states: 5
abstracting: (p4<=1)
states: 57
abstracting: (1<=p29)
states: 56
abstracting: (p29<=1)
states: 57
abstracting: (1<=p5)
states: 4
abstracting: (p5<=1)
states: 57
abstracting: (1<=p3)
states: 5
abstracting: (p3<=1)
states: 57
.abstracting: (1<=p16)
states: 5
abstracting: (p16<=1)
states: 57
.abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
abstracting: (1<=p3)
states: 5
abstracting: (p3<=1)
states: 57
abstracting: (1<=p14)
states: 3
abstracting: (p14<=1)
states: 57
abstracting: (1<=p18)
states: 5
abstracting: (p18<=1)
states: 57
abstracting: (1<=p29)
states: 56
abstracting: (p29<=1)
states: 57
abstracting: (1<=p17)
states: 5
abstracting: (p17<=1)
states: 57
abstracting: (1<=p4)
states: 5
abstracting: (p4<=1)
states: 57
abstracting: (1<=p29)
states: 56
abstracting: (p29<=1)
states: 57
EG iterations: 0
-> the formula is FALSE
FORMULA StigmergyElection-PT-02a-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: [EX [[[p12<=1 & 1<=p12] & [p26<=1 & 1<=p26]]] & A [[~ [[AF [AX [[[p12<=1 & 1<=p12] & [p26<=1 & 1<=p26]]]] & ~ [EF [[[p7<=1 & 1<=p7] & [p29<=1 & 1<=p29]]]]]] & EX [AG [~ [[[p12<=1 & 1<=p12] & [p26<=1 & 1<=p26]]]]]] U E [~ [[EG [[[p12<=1 & 1<=p12] & [p26<=1 & 1<=p26]]] | [A [[[p12<=1 & 1<=p12] & [p26<=1 & 1<=p26]] U [[p12<=1 & 1<=p12] & [p26<=1 & 1<=p26]]] & [[p17<=1 & 1<=p17] | [p15<=1 & 1<=p15]]]]] U ~ [EG [AG [[[p12<=1 & 1<=p12] & [p26<=1 & 1<=p26]]]]]]]]
normalized: [[~ [EG [~ [E [~ [[[[[p15<=1 & 1<=p15] | [p17<=1 & 1<=p17]] & [~ [EG [~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]] & ~ [E [~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]] U [~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]] & ~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]]]]] | EG [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]] U ~ [EG [~ [E [true U ~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]]]]]]]] & ~ [E [~ [E [~ [[[[[p15<=1 & 1<=p15] | [p17<=1 & 1<=p17]] & [~ [EG [~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]] & ~ [E [~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]] U [~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]] & ~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]]]]] | EG [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]] U ~ [EG [~ [E [true U ~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]]]]]] U [~ [[EX [~ [E [true U [[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]] & ~ [[~ [E [true U [[p29<=1 & 1<=p29] & [p7<=1 & 1<=p7]]]] & ~ [EG [EX [~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]]]]]]] & ~ [E [~ [[[[[p15<=1 & 1<=p15] | [p17<=1 & 1<=p17]] & [~ [EG [~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]] & ~ [E [~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]] U [~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]] & ~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]]]]] | EG [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]] U ~ [EG [~ [E [true U ~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]]]]]]]]]] & EX [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]]]
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
.abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
.
EG iterations: 1
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
.
EG iterations: 1
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
......
EG iterations: 6
abstracting: (1<=p17)
states: 5
abstracting: (p17<=1)
states: 57
abstracting: (1<=p15)
states: 5
abstracting: (p15<=1)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
......
EG iterations: 5
abstracting: (1<=p7)
states: 4
abstracting: (p7<=1)
states: 57
abstracting: (1<=p29)
states: 56
abstracting: (p29<=1)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
.abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
.
EG iterations: 1
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
.
EG iterations: 1
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
......
EG iterations: 6
abstracting: (1<=p17)
states: 5
abstracting: (p17<=1)
states: 57
abstracting: (1<=p15)
states: 5
abstracting: (p15<=1)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
.
EG iterations: 1
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
.
EG iterations: 1
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p12<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p26<=1)
states: 57
......
EG iterations: 6
abstracting: (1<=p17)
states: 5
abstracting: (p17<=1)
states: 57
abstracting: (1<=p15)
states: 5
abstracting: (p15<=1)
states: 57
.
EG iterations: 1
-> the formula is FALSE
FORMULA StigmergyElection-PT-02a-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
totally nodes used: 13769 (1.4e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 31389 55499 86888
used/not used/entry size/cache size: 68658 67040206 16 1024MB
basic ops cache: hits/miss/sum: 9945 14516 24461
used/not used/entry size/cache size: 24462 16752754 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: 620 822 1442
used/not used/entry size/cache size: 822 8387786 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 67095196
1 13567
2 101
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 5.638sec
BK_STOP 1679548173654
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
iterations count:394 (8), effective:32 (0)
initing FirstDep: 0m 0.000sec
iterations count:304 (6), effective:25 (0)
iterations count:304 (6), effective:25 (0)
iterations count:159 (3), effective:12 (0)
iterations count:304 (6), effective:25 (0)
iterations count:60 (1), effective:1 (0)
iterations count:46 (1), effective:0 (0)
iterations count:102 (2), effective:4 (0)
iterations count:55 (1), effective:1 (0)
iterations count:229 (4), effective:13 (0)
iterations count:229 (4), effective:13 (0)
iterations count:46 (1), effective:0 (0)
iterations count:229 (4), effective:13 (0)
iterations count:60 (1), effective:1 (0)
iterations count:55 (1), effective:1 (0)
iterations count:229 (4), effective:13 (0)
iterations count:229 (4), effective:13 (0)
iterations count:46 (1), effective:0 (0)
iterations count:229 (4), effective:13 (0)
iterations count:55 (1), effective:1 (0)
iterations count:229 (4), effective:13 (0)
iterations count:229 (4), effective:13 (0)
iterations count:46 (1), effective:0 (0)
iterations count:229 (4), effective:13 (0)
iterations count:65 (1), effective:1 (0)
iterations count:298 (6), effective:25 (0)
iterations count:288 (6), effective:25 (0)
iterations count:118 (2), effective:2 (0)
iterations count:82 (1), effective:2 (0)
iterations count:288 (6), effective:25 (0)
iterations count:118 (2), effective:2 (0)
iterations count:90 (1), effective:4 (0)
iterations count:288 (6), effective:25 (0)
iterations count:118 (2), effective:2 (0)
iterations count:69 (1), effective:1 (0)
iterations count:69 (1), effective:1 (0)
iterations count:130 (2), effective:10 (0)
iterations count:69 (1), effective:1 (0)
iterations count:69 (1), effective:1 (0)
iterations count:60 (1), effective:1 (0)
iterations count:115 (2), effective:5 (0)
iterations count:69 (1), effective:1 (0)
iterations count:60 (1), effective:1 (0)
iterations count:69 (1), effective:1 (0)
iterations count:60 (1), effective:1 (0)
iterations count:60 (1), effective:1 (0)
iterations count:46 (1), effective:0 (0)
iterations count:46 (1), effective:0 (0)
iterations count:300 (6), effective:25 (0)
iterations count:298 (6), effective:25 (0)
iterations count:60 (1), effective:1 (0)
iterations count:46 (1), effective:0 (0)
iterations count:46 (1), effective:0 (0)
iterations count:60 (1), effective:1 (0)
iterations count:46 (1), effective:0 (0)
iterations count:46 (1), effective:0 (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-02a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is StigmergyElection-PT-02a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r458-smll-167912650400554"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-02a.tgz
mv StigmergyElection-PT-02a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;