fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r457-smll-167912649600678
Last Updated
May 14, 2023

About the Execution of LTSMin+red for StigmergyElection-PT-09b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8214.596 3600000.00 11132584.00 3221.50 FFFTTFFFTTTFFFFF 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.r457-smll-167912649600678.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 ltsminxred
Input is StigmergyElection-PT-09b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r457-smll-167912649600678
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 38M
-rw-r--r-- 1 mcc users 6.9K Feb 26 16:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 16:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 16:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 16:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 16:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 16:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:15 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 37M 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-09b-ReachabilityCardinality-00
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-01
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-02
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-03
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-04
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-05
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-06
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-07
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-08
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-09
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-10
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-11
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-12
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-13
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-14
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679580194272

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-09b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 14:03:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 14:03:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 14:03:20] [INFO ] Load time of PNML (sax parser for PT used): 2227 ms
[2023-03-23 14:03:20] [INFO ] Transformed 1243 places.
[2023-03-23 14:03:20] [INFO ] Transformed 41210 transitions.
[2023-03-23 14:03:20] [INFO ] Found NUPN structural information;
[2023-03-23 14:03:20] [INFO ] Parsed PT model containing 1243 places and 41210 transitions and 720585 arcs in 2700 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 64 resets, run finished after 1009 ms. (steps per millisecond=9 ) properties (out of 15) seen :8
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 7) seen :1
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 41210 rows 1243 cols
[2023-03-23 14:03:24] [INFO ] Computed 10 place invariants in 1228 ms
[2023-03-23 14:03:25] [INFO ] After 968ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 14:03:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 24 ms returned sat
[2023-03-23 14:03:50] [INFO ] After 24058ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-23 14:03:50] [INFO ] After 24173ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-23 14:03:50] [INFO ] After 25187ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 25 out of 1243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1243/1243 places, 41210/41210 transitions.
Graph (trivial) has 1218 edges and 1243 vertex of which 174 / 1243 are part of one of the 26 SCC in 19 ms
Free SCC test removed 148 places
Drop transitions removed 188 transitions
Reduce isomorphic transitions removed 188 transitions.
Graph (complete) has 2902 edges and 1095 vertex of which 1079 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.213 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 756 transitions
Trivial Post-agglo rules discarded 756 transitions
Performed 756 trivial Post agglomeration. Transition count delta: 756
Iterating post reduction 0 with 764 rules applied. Total rules applied 766 place count 1079 transition count 40250
Reduce places removed 756 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 793 rules applied. Total rules applied 1559 place count 323 transition count 40213
Reduce places removed 18 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 2 with 35 rules applied. Total rules applied 1594 place count 305 transition count 40196
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 1612 place count 288 transition count 40195
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 1612 place count 288 transition count 40172
Deduced a syphon composed of 23 places in 46 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 1658 place count 265 transition count 40172
Discarding 68 places :
Symmetric choice reduction at 4 with 68 rule applications. Total rules 1726 place count 197 transition count 40104
Iterating global reduction 4 with 68 rules applied. Total rules applied 1794 place count 197 transition count 40104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1795 place count 197 transition count 40103
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 1795 place count 197 transition count 40099
Deduced a syphon composed of 4 places in 34 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 1803 place count 193 transition count 40099
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1822 place count 174 transition count 2249
Iterating global reduction 5 with 19 rules applied. Total rules applied 1841 place count 174 transition count 2249
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1853 place count 174 transition count 2237
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 1909 place count 146 transition count 2209
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1910 place count 146 transition count 2208
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1917 place count 139 transition count 2201
Iterating global reduction 7 with 7 rules applied. Total rules applied 1924 place count 139 transition count 2201
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 1936 place count 133 transition count 2209
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1939 place count 133 transition count 2206
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 8 with 17 rules applied. Total rules applied 1956 place count 133 transition count 2189
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 1960 place count 131 transition count 2197
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1968 place count 131 transition count 2189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1970 place count 130 transition count 2195
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1978 place count 130 transition count 2187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1980 place count 129 transition count 2193
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1988 place count 129 transition count 2185
Free-agglomeration rule applied 44 times.
Iterating global reduction 8 with 44 rules applied. Total rules applied 2032 place count 129 transition count 2141
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 45 rules applied. Total rules applied 2077 place count 85 transition count 2140
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 2084 place count 78 transition count 2133
Iterating global reduction 9 with 7 rules applied. Total rules applied 2091 place count 78 transition count 2133
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 2094 place count 78 transition count 2130
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 10 with 9 rules applied. Total rules applied 2103 place count 78 transition count 2121
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 2105 place count 78 transition count 2121
Applied a total of 2105 rules in 13840 ms. Remains 78 /1243 variables (removed 1165) and now considering 2121/41210 (removed 39089) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13845 ms. Remains : 78/1243 places, 2121/41210 transitions.
Incomplete random walk after 10000 steps, including 339 resets, run finished after 540 ms. (steps per millisecond=18 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 328883 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{2=1, 3=1}
Probabilistic random walk after 328883 steps, saw 51017 distinct states, run finished after 3010 ms. (steps per millisecond=109 ) properties seen :2
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 2121 rows 78 cols
[2023-03-23 14:04:08] [INFO ] Computed 10 place invariants in 16 ms
[2023-03-23 14:04:08] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 14:04:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-23 14:04:09] [INFO ] After 1188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 14:04:10] [INFO ] State equation strengthened by 1994 read => feed constraints.
[2023-03-23 14:04:13] [INFO ] After 2964ms SMT Verify possible using 1994 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 14:04:14] [INFO ] Deduced a trap composed of 10 places in 805 ms of which 11 ms to minimize.
[2023-03-23 14:04:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 886 ms
[2023-03-23 14:04:15] [INFO ] Deduced a trap composed of 10 places in 914 ms of which 2 ms to minimize.
[2023-03-23 14:04:16] [INFO ] Deduced a trap composed of 8 places in 835 ms of which 2 ms to minimize.
[2023-03-23 14:04:17] [INFO ] Deduced a trap composed of 12 places in 714 ms of which 2 ms to minimize.
[2023-03-23 14:04:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2870 ms
[2023-03-23 14:04:17] [INFO ] After 7257ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 227 ms.
[2023-03-23 14:04:17] [INFO ] After 9101ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 21 ms.
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 2121/2121 transitions.
Graph (trivial) has 50 edges and 78 vertex of which 10 / 78 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 459 edges and 73 vertex of which 72 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 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 16 rules applied. Total rules applied 18 place count 72 transition count 2095
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 33 place count 57 transition count 2095
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 33 place count 57 transition count 2094
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 56 transition count 2094
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 40 place count 51 transition count 2089
Iterating global reduction 2 with 5 rules applied. Total rules applied 45 place count 51 transition count 2089
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 49 place count 51 transition count 2085
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 51 place count 49 transition count 2083
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 49 transition count 2083
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 67 place count 42 transition count 2076
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 70 place count 42 transition count 2073
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 78 place count 34 transition count 2065
Iterating global reduction 4 with 8 rules applied. Total rules applied 86 place count 34 transition count 2065
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 142 place count 34 transition count 2009
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 144 place count 33 transition count 2015
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 156 place count 33 transition count 2003
Free-agglomeration rule applied 11 times with reduction of 125 identical transitions.
Iterating global reduction 5 with 11 rules applied. Total rules applied 167 place count 33 transition count 1867
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 1080 transitions
Reduce isomorphic transitions removed 1081 transitions.
Iterating post reduction 5 with 1092 rules applied. Total rules applied 1259 place count 22 transition count 786
Applied a total of 1259 rules in 1665 ms. Remains 22 /78 variables (removed 56) and now considering 786/2121 (removed 1335) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1666 ms. Remains : 22/78 places, 786/2121 transitions.
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=8 )
FORMULA StigmergyElection-PT-09b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 61181 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/553/inv_0_ --invariant=/tmp/553/inv_1_ --invariant=/tmp/553/inv_2_ --invariant=/tmp/553/inv_3_ --invariant=/tmp/553/inv_4_ --invariant=/tmp/553/inv_5_ --invariant=/tmp/553/inv_6_ --invariant=/tmp/553/inv_7_ --invariant=/tmp/553/inv_8_ --invariant=/tmp/553/inv_9_ --invariant=/tmp/553/inv_10_ --invariant=/tmp/553/inv_11_ --invariant=/tmp/553/inv_12_ --invariant=/tmp/553/inv_13_ --invariant=/tmp/553/inv_14_ --invariant=/tmp/553/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7889604 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16053900 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023

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-09b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is StigmergyElection-PT-09b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r457-smll-167912649600678"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-09b.tgz
mv StigmergyElection-PT-09b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;