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-167912649400494.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 StigmergyCommit-PT-08a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r457-smll-167912649400494
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 6.7K Feb 26 11:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 11:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 11:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 11:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 11:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 26 11:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 11:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 11:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 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 17M 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 StigmergyCommit-PT-08a-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679470957203

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=StigmergyCommit-PT-08a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 07:42:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 07:42:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 07:42:41] [INFO ] Load time of PNML (sax parser for PT used): 1148 ms
[2023-03-22 07:42:41] [INFO ] Transformed 328 places.
[2023-03-22 07:42:41] [INFO ] Transformed 18744 transitions.
[2023-03-22 07:42:41] [INFO ] Found NUPN structural information;
[2023-03-22 07:42:41] [INFO ] Parsed PT model containing 328 places and 18744 transitions and 330279 arcs in 1410 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 17295 transitions
Reduce redundant transitions removed 17295 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1030 ms. (steps per millisecond=9 ) properties (out of 16) seen :4
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :1
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-22 07:42:43] [INFO ] Flow matrix only has 1422 transitions (discarded 27 similar events)
// Phase 1: matrix 1422 rows 328 cols
[2023-03-22 07:42:43] [INFO ] Computed 10 place invariants in 42 ms
[2023-03-22 07:42:44] [INFO ] After 464ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:10
[2023-03-22 07:42:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-22 07:42:46] [INFO ] After 1843ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2023-03-22 07:42:46] [INFO ] State equation strengthened by 1147 read => feed constraints.
[2023-03-22 07:42:48] [INFO ] After 1946ms SMT Verify possible using 1147 Read/Feed constraints in natural domain returned unsat :1 sat :10
[2023-03-22 07:42:49] [INFO ] Deduced a trap composed of 17 places in 533 ms of which 9 ms to minimize.
[2023-03-22 07:42:49] [INFO ] Deduced a trap composed of 17 places in 438 ms of which 1 ms to minimize.
[2023-03-22 07:42:50] [INFO ] Deduced a trap composed of 17 places in 429 ms of which 2 ms to minimize.
[2023-03-22 07:42:50] [INFO ] Deduced a trap composed of 18 places in 336 ms of which 2 ms to minimize.
[2023-03-22 07:42:51] [INFO ] Deduced a trap composed of 17 places in 381 ms of which 2 ms to minimize.
[2023-03-22 07:42:51] [INFO ] Deduced a trap composed of 16 places in 282 ms of which 1 ms to minimize.
[2023-03-22 07:42:51] [INFO ] Deduced a trap composed of 16 places in 212 ms of which 1 ms to minimize.
[2023-03-22 07:42:52] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 1 ms to minimize.
[2023-03-22 07:42:52] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 1 ms to minimize.
[2023-03-22 07:42:52] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 1 ms to minimize.
[2023-03-22 07:42:52] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 0 ms to minimize.
[2023-03-22 07:42:53] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 0 ms to minimize.
[2023-03-22 07:42:53] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 1 ms to minimize.
[2023-03-22 07:42:53] [INFO ] Deduced a trap composed of 16 places in 203 ms of which 1 ms to minimize.
[2023-03-22 07:42:53] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 1 ms to minimize.
[2023-03-22 07:42:54] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 1 ms to minimize.
[2023-03-22 07:42:54] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 1 ms to minimize.
[2023-03-22 07:42:54] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 1 ms to minimize.
[2023-03-22 07:42:54] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 1 ms to minimize.
[2023-03-22 07:42:54] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 6411 ms
[2023-03-22 07:42:55] [INFO ] Deduced a trap composed of 16 places in 310 ms of which 1 ms to minimize.
[2023-03-22 07:42:55] [INFO ] Deduced a trap composed of 16 places in 269 ms of which 1 ms to minimize.
[2023-03-22 07:42:56] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 1 ms to minimize.
[2023-03-22 07:42:56] [INFO ] Deduced a trap composed of 18 places in 208 ms of which 1 ms to minimize.
[2023-03-22 07:42:56] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 0 ms to minimize.
[2023-03-22 07:42:56] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 2 ms to minimize.
[2023-03-22 07:42:57] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 2 ms to minimize.
[2023-03-22 07:42:57] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1914 ms
[2023-03-22 07:42:57] [INFO ] Deduced a trap composed of 17 places in 372 ms of which 0 ms to minimize.
[2023-03-22 07:42:58] [INFO ] Deduced a trap composed of 16 places in 386 ms of which 1 ms to minimize.
[2023-03-22 07:42:58] [INFO ] Deduced a trap composed of 16 places in 379 ms of which 1 ms to minimize.
[2023-03-22 07:42:59] [INFO ] Deduced a trap composed of 16 places in 334 ms of which 1 ms to minimize.
[2023-03-22 07:42:59] [INFO ] Deduced a trap composed of 16 places in 279 ms of which 0 ms to minimize.
[2023-03-22 07:42:59] [INFO ] Deduced a trap composed of 16 places in 277 ms of which 0 ms to minimize.
[2023-03-22 07:43:00] [INFO ] Deduced a trap composed of 16 places in 270 ms of which 1 ms to minimize.
[2023-03-22 07:43:00] [INFO ] Deduced a trap composed of 17 places in 281 ms of which 1 ms to minimize.
[2023-03-22 07:43:00] [INFO ] Deduced a trap composed of 17 places in 274 ms of which 3 ms to minimize.
[2023-03-22 07:43:00] [INFO ] Deduced a trap composed of 17 places in 219 ms of which 2 ms to minimize.
[2023-03-22 07:43:01] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 0 ms to minimize.
[2023-03-22 07:43:01] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 1 ms to minimize.
[2023-03-22 07:43:01] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 0 ms to minimize.
[2023-03-22 07:43:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 4535 ms
[2023-03-22 07:43:02] [INFO ] Deduced a trap composed of 18 places in 331 ms of which 2 ms to minimize.
[2023-03-22 07:43:02] [INFO ] Deduced a trap composed of 16 places in 306 ms of which 0 ms to minimize.
[2023-03-22 07:43:03] [INFO ] Deduced a trap composed of 16 places in 253 ms of which 1 ms to minimize.
[2023-03-22 07:43:03] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 1 ms to minimize.
[2023-03-22 07:43:03] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 0 ms to minimize.
[2023-03-22 07:43:03] [INFO ] Deduced a trap composed of 18 places in 204 ms of which 0 ms to minimize.
[2023-03-22 07:43:04] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 1 ms to minimize.
[2023-03-22 07:43:04] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 1 ms to minimize.
[2023-03-22 07:43:04] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 1 ms to minimize.
[2023-03-22 07:43:05] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 0 ms to minimize.
[2023-03-22 07:43:05] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 0 ms to minimize.
[2023-03-22 07:43:05] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 2 ms to minimize.
[2023-03-22 07:43:05] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 0 ms to minimize.
[2023-03-22 07:43:06] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 1 ms to minimize.
[2023-03-22 07:43:06] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 0 ms to minimize.
[2023-03-22 07:43:06] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4499 ms
[2023-03-22 07:43:06] [INFO ] After 20475ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :4
Attempting to minimize the solution found.
Minimization took 1060 ms.
[2023-03-22 07:43:08] [INFO ] After 23831ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :4
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 54 ms.
Support contains 12 out of 328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 328/328 places, 1449/1449 transitions.
Graph (complete) has 759 edges and 328 vertex of which 319 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.23 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 319 transition count 1368
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 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 1 with 82 rules applied. Total rules applied 155 place count 274 transition count 1331
Reduce places removed 8 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 14 rules applied. Total rules applied 169 place count 266 transition count 1325
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 178 place count 260 transition count 1322
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 60 Pre rules applied. Total rules applied 178 place count 260 transition count 1262
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 298 place count 200 transition count 1262
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 340 place count 158 transition count 1220
Iterating global reduction 4 with 42 rules applied. Total rules applied 382 place count 158 transition count 1220
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 422 place count 118 transition count 1180
Iterating global reduction 4 with 40 rules applied. Total rules applied 462 place count 118 transition count 1180
Ensure Unique test removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Iterating post reduction 4 with 136 rules applied. Total rules applied 598 place count 118 transition count 1044
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 603 place count 113 transition count 1039
Iterating global reduction 5 with 5 rules applied. Total rules applied 608 place count 113 transition count 1039
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 613 place count 108 transition count 1034
Iterating global reduction 5 with 5 rules applied. Total rules applied 618 place count 108 transition count 1034
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 622 place count 108 transition count 1030
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 648 place count 95 transition count 1017
Drop transitions removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 656 place count 95 transition count 1009
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 664 place count 87 transition count 1001
Iterating global reduction 7 with 8 rules applied. Total rules applied 672 place count 87 transition count 1001
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 680 place count 79 transition count 993
Iterating global reduction 7 with 8 rules applied. Total rules applied 688 place count 79 transition count 993
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 696 place count 71 transition count 985
Iterating global reduction 7 with 8 rules applied. Total rules applied 704 place count 71 transition count 985
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 713 place count 71 transition count 976
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 715 place count 71 transition count 974
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 717 place count 69 transition count 974
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 725 place count 69 transition count 974
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 729 place count 69 transition count 970
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 730 place count 68 transition count 969
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 8 with 9 rules applied. Total rules applied 739 place count 67 transition count 961
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 9 rules applied. Total rules applied 748 place count 59 transition count 960
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 749 place count 58 transition count 960
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 4 Pre rules applied. Total rules applied 749 place count 58 transition count 956
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 757 place count 54 transition count 956
Performed 13 Post agglomeration using F-continuation condition with reduction of 864 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 26 rules applied. Total rules applied 783 place count 41 transition count 79
Drop transitions removed 8 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 11 with 26 rules applied. Total rules applied 809 place count 41 transition count 53
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 12 with 12 rules applied. Total rules applied 821 place count 34 transition count 48
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 826 place count 34 transition count 43
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 829 place count 34 transition count 40
Free-agglomeration rule applied 2 times.
Iterating global reduction 13 with 2 rules applied. Total rules applied 831 place count 34 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 833 place count 32 transition count 38
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 834 place count 32 transition count 38
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 835 place count 32 transition count 37
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 839 place count 28 transition count 33
Applied a total of 839 rules in 1427 ms. Remains 28 /328 variables (removed 300) and now considering 33/1449 (removed 1416) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1428 ms. Remains : 28/328 places, 33/1449 transitions.
Finished random walk after 142 steps, including 1 resets, run visited all 4 properties in 2 ms. (steps per millisecond=71 )
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 29570 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/627/inv_0_ --invariant=/tmp/627/inv_1_ --invariant=/tmp/627/inv_2_ --invariant=/tmp/627/inv_3_ --invariant=/tmp/627/inv_4_ --invariant=/tmp/627/inv_5_ --invariant=/tmp/627/inv_6_ --invariant=/tmp/627/inv_7_ --invariant=/tmp/627/inv_8_ --invariant=/tmp/627/inv_9_ --invariant=/tmp/627/inv_10_ --invariant=/tmp/627/inv_11_ --invariant=/tmp/627/inv_12_ --invariant=/tmp/627/inv_13_ --invariant=/tmp/627/inv_14_ --invariant=/tmp/627/inv_15_ --inv-par
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679471199791

--------------------
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
rfs formula name StigmergyCommit-PT-08a-ReachabilityCardinality-00
rfs formula type AG
rfs formula formula --invariant=/tmp/627/inv_0_
rfs formula name StigmergyCommit-PT-08a-ReachabilityCardinality-01
rfs formula type EF
rfs formula formula --invariant=/tmp/627/inv_1_
rfs formula name StigmergyCommit-PT-08a-ReachabilityCardinality-02
rfs formula type EF
rfs formula formula --invariant=/tmp/627/inv_2_
rfs formula name StigmergyCommit-PT-08a-ReachabilityCardinality-03
rfs formula type AG
rfs formula formula --invariant=/tmp/627/inv_3_
rfs formula name StigmergyCommit-PT-08a-ReachabilityCardinality-04
rfs formula type AG
rfs formula formula --invariant=/tmp/627/inv_4_
rfs formula name StigmergyCommit-PT-08a-ReachabilityCardinality-05
rfs formula type EF
rfs formula formula --invariant=/tmp/627/inv_5_
rfs formula name StigmergyCommit-PT-08a-ReachabilityCardinality-06
rfs formula type AG
rfs formula formula --invariant=/tmp/627/inv_6_
rfs formula name StigmergyCommit-PT-08a-ReachabilityCardinality-07
rfs formula type EF
rfs formula formula --invariant=/tmp/627/inv_7_
rfs formula name StigmergyCommit-PT-08a-ReachabilityCardinality-08
rfs formula type AG
rfs formula formula --invariant=/tmp/627/inv_8_
rfs formula name StigmergyCommit-PT-08a-ReachabilityCardinality-09
rfs formula type AG
rfs formula formula --invariant=/tmp/627/inv_9_
rfs formula name StigmergyCommit-PT-08a-ReachabilityCardinality-10
rfs formula type EF
rfs formula formula --invariant=/tmp/627/inv_10_
rfs formula name StigmergyCommit-PT-08a-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/627/inv_11_
rfs formula name StigmergyCommit-PT-08a-ReachabilityCardinality-12
rfs formula type AG
rfs formula formula --invariant=/tmp/627/inv_12_
rfs formula name StigmergyCommit-PT-08a-ReachabilityCardinality-13
rfs formula type EF
rfs formula formula --invariant=/tmp/627/inv_13_
rfs formula name StigmergyCommit-PT-08a-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/627/inv_14_
rfs formula name StigmergyCommit-PT-08a-ReachabilityCardinality-15
rfs formula type AG
rfs formula formula --invariant=/tmp/627/inv_15_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 328 places, 18744 transitions and 330279 arcs
pnml2lts-sym: Petri net StigmergyCommit-PT-08a analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.850 real 0.790 user 0.060 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 18744->410 groups
pnml2lts-sym: Regrouping took 198.230 real 198.200 user 0.000 sys
pnml2lts-sym: state vector length is 328; there are 410 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/627/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/627/inv_15_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/627/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/627/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/627/inv_5_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/627/inv_8_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/627/inv_10_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/627/inv_9_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/627/inv_6_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 180805 group checks and 0 next state calls
pnml2lts-sym: reachability took 8.030 real 31.860 user 0.190 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.030 user 0.000 sys
pnml2lts-sym: state space has 54098675 states, 93591 nodes
pnml2lts-sym: group_next: 40329 nodes total
pnml2lts-sym: group_explored: 1232 nodes, 6547 short vectors total
pnml2lts-sym: max token count: 1

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="StigmergyCommit-PT-08a"
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 StigmergyCommit-PT-08a, 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-167912649400494"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-08a.tgz
mv StigmergyCommit-PT-08a 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 ;