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

About the Execution of LTSMin+red for StigmergyCommit-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1027.107 247992.00 921057.00 502.60 TFTTTFTFFTFFFTTF 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-167912649300438.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-04b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r457-smll-167912649300438
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K Feb 26 10:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 10:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 10:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 10:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Feb 26 10:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 10:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 10:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 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 627K 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-04b-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679439779390

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-04b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 23:03:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 23:03:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 23:03:02] [INFO ] Load time of PNML (sax parser for PT used): 252 ms
[2023-03-21 23:03:02] [INFO ] Transformed 1534 places.
[2023-03-21 23:03:02] [INFO ] Transformed 2136 transitions.
[2023-03-21 23:03:02] [INFO ] Found NUPN structural information;
[2023-03-21 23:03:02] [INFO ] Parsed PT model containing 1534 places and 2136 transitions and 8601 arcs in 389 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 106 resets, run finished after 781 ms. (steps per millisecond=12 ) properties (out of 12) seen :2
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2136 rows 1534 cols
[2023-03-21 23:03:04] [INFO ] Computed 6 place invariants in 68 ms
[2023-03-21 23:03:05] [INFO ] [Real]Absence check using 6 positive place invariants in 19 ms returned sat
[2023-03-21 23:03:05] [INFO ] After 1151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-21 23:03:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 15 ms returned sat
[2023-03-21 23:03:08] [INFO ] After 2279ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2023-03-21 23:03:09] [INFO ] Deduced a trap composed of 399 places in 820 ms of which 9 ms to minimize.
[2023-03-21 23:03:10] [INFO ] Deduced a trap composed of 396 places in 612 ms of which 2 ms to minimize.
[2023-03-21 23:03:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1686 ms
[2023-03-21 23:03:11] [INFO ] Deduced a trap composed of 399 places in 715 ms of which 3 ms to minimize.
[2023-03-21 23:03:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 891 ms
[2023-03-21 23:03:12] [INFO ] Deduced a trap composed of 399 places in 709 ms of which 1 ms to minimize.
[2023-03-21 23:03:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 882 ms
[2023-03-21 23:03:14] [INFO ] Deduced a trap composed of 397 places in 1232 ms of which 2 ms to minimize.
[2023-03-21 23:03:14] [INFO ] Deduced a trap composed of 400 places in 854 ms of which 1 ms to minimize.
[2023-03-21 23:03:15] [INFO ] Deduced a trap composed of 397 places in 884 ms of which 2 ms to minimize.
[2023-03-21 23:03:16] [INFO ] Deduced a trap composed of 401 places in 634 ms of which 2 ms to minimize.
[2023-03-21 23:03:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 4125 ms
[2023-03-21 23:03:18] [INFO ] Deduced a trap composed of 489 places in 864 ms of which 1 ms to minimize.
[2023-03-21 23:03:19] [INFO ] Deduced a trap composed of 397 places in 968 ms of which 1 ms to minimize.
[2023-03-21 23:03:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2117 ms
[2023-03-21 23:03:20] [INFO ] Deduced a trap composed of 399 places in 966 ms of which 2 ms to minimize.
[2023-03-21 23:03:21] [INFO ] Deduced a trap composed of 396 places in 710 ms of which 1 ms to minimize.
[2023-03-21 23:03:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 1891 ms
[2023-03-21 23:03:21] [INFO ] After 14866ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 830 ms.
[2023-03-21 23:03:22] [INFO ] After 16720ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 8 different solutions.
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 93 ms.
Support contains 33 out of 1534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1534/1534 places, 2136/2136 transitions.
Graph (trivial) has 1468 edges and 1534 vertex of which 102 / 1534 are part of one of the 15 SCC in 11 ms
Free SCC test removed 87 places
Drop transitions removed 111 transitions
Reduce isomorphic transitions removed 111 transitions.
Graph (complete) has 2165 edges and 1447 vertex of which 1437 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.12 ms
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1091 transitions
Trivial Post-agglo rules discarded 1091 transitions
Performed 1091 trivial Post agglomeration. Transition count delta: 1091
Iterating post reduction 0 with 1096 rules applied. Total rules applied 1098 place count 1437 transition count 924
Reduce places removed 1091 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 1121 rules applied. Total rules applied 2219 place count 346 transition count 894
Reduce places removed 11 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 2 with 35 rules applied. Total rules applied 2254 place count 335 transition count 870
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 2278 place count 311 transition count 870
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 2278 place count 311 transition count 820
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 2378 place count 261 transition count 820
Discarding 57 places :
Symmetric choice reduction at 4 with 57 rule applications. Total rules 2435 place count 204 transition count 763
Iterating global reduction 4 with 57 rules applied. Total rules applied 2492 place count 204 transition count 763
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 2519 place count 177 transition count 338
Iterating global reduction 4 with 27 rules applied. Total rules applied 2546 place count 177 transition count 338
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 2554 place count 177 transition count 330
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 2560 place count 171 transition count 324
Iterating global reduction 5 with 6 rules applied. Total rules applied 2566 place count 171 transition count 324
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 2572 place count 165 transition count 318
Iterating global reduction 5 with 6 rules applied. Total rules applied 2578 place count 165 transition count 318
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2582 place count 165 transition count 314
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 2616 place count 148 transition count 297
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2617 place count 148 transition count 296
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2622 place count 143 transition count 291
Iterating global reduction 7 with 5 rules applied. Total rules applied 2627 place count 143 transition count 291
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2632 place count 138 transition count 286
Iterating global reduction 7 with 5 rules applied. Total rules applied 2637 place count 138 transition count 286
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2642 place count 133 transition count 281
Iterating global reduction 7 with 5 rules applied. Total rules applied 2647 place count 133 transition count 281
Performed 7 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 2661 place count 126 transition count 295
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 2662 place count 126 transition count 294
Free-agglomeration rule applied 37 times.
Iterating global reduction 7 with 37 rules applied. Total rules applied 2699 place count 126 transition count 257
Reduce places removed 37 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 38 rules applied. Total rules applied 2737 place count 89 transition count 256
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 8 with 56 rules applied. Total rules applied 2793 place count 89 transition count 200
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 2797 place count 89 transition count 200
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 2798 place count 89 transition count 200
Applied a total of 2798 rules in 342 ms. Remains 89 /1534 variables (removed 1445) and now considering 200/2136 (removed 1936) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 342 ms. Remains : 89/1534 places, 200/2136 transitions.
Incomplete random walk after 10000 steps, including 264 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 7) seen :1
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 78 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 83 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 76 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 81 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 200 rows 89 cols
[2023-03-21 23:03:23] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-21 23:03:23] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-21 23:03:23] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-21 23:03:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-21 23:03:23] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-21 23:03:23] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-21 23:03:23] [INFO ] After 67ms SMT Verify possible using 67 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-21 23:03:23] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2023-03-21 23:03:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-21 23:03:23] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2023-03-21 23:03:23] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2023-03-21 23:03:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 116 ms
[2023-03-21 23:03:23] [INFO ] After 339ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-21 23:03:23] [INFO ] After 589ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 10 ms.
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 200/200 transitions.
Graph (trivial) has 58 edges and 89 vertex of which 2 / 89 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 88 transition count 176
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 47 place count 66 transition count 174
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 47 place count 66 transition count 170
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 55 place count 62 transition count 170
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 58 transition count 166
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 58 transition count 166
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 69 place count 52 transition count 160
Iterating global reduction 2 with 6 rules applied. Total rules applied 75 place count 52 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 52 transition count 159
Performed 7 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 90 place count 45 transition count 150
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 96 place count 39 transition count 144
Iterating global reduction 3 with 6 rules applied. Total rules applied 102 place count 39 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 104 place count 39 transition count 142
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 107 place count 36 transition count 139
Iterating global reduction 4 with 3 rules applied. Total rules applied 110 place count 36 transition count 139
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 119 place count 36 transition count 130
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 120 place count 35 transition count 129
Iterating global reduction 5 with 1 rules applied. Total rules applied 121 place count 35 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 123 place count 34 transition count 132
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 126 place count 34 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 128 place count 33 transition count 136
Free-agglomeration rule applied 5 times with reduction of 8 identical transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 133 place count 33 transition count 123
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 152 place count 28 transition count 109
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 156 place count 28 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 157 place count 28 transition count 108
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 159 place count 28 transition count 106
Applied a total of 159 rules in 64 ms. Remains 28 /89 variables (removed 61) and now considering 106/200 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 28/89 places, 106/200 transitions.
Finished random walk after 44 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=44 )
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 22152 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/517/inv_0_ --invariant=/tmp/517/inv_1_ --invariant=/tmp/517/inv_2_ --invariant=/tmp/517/inv_3_ --invariant=/tmp/517/inv_4_ --invariant=/tmp/517/inv_5_ --invariant=/tmp/517/inv_6_ --invariant=/tmp/517/inv_7_ --invariant=/tmp/517/inv_8_ --invariant=/tmp/517/inv_9_ --invariant=/tmp/517/inv_10_ --invariant=/tmp/517/inv_11_ --invariant=/tmp/517/inv_12_ --invariant=/tmp/517/inv_13_ --invariant=/tmp/517/inv_14_ --invariant=/tmp/517/inv_15_ --inv-par
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679440027382

--------------------
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-04b-ReachabilityCardinality-00
rfs formula type EF
rfs formula formula --invariant=/tmp/517/inv_0_
rfs formula name StigmergyCommit-PT-04b-ReachabilityCardinality-01
rfs formula type AG
rfs formula formula --invariant=/tmp/517/inv_1_
rfs formula name StigmergyCommit-PT-04b-ReachabilityCardinality-02
rfs formula type EF
rfs formula formula --invariant=/tmp/517/inv_2_
rfs formula name StigmergyCommit-PT-04b-ReachabilityCardinality-03
rfs formula type AG
rfs formula formula --invariant=/tmp/517/inv_3_
rfs formula name StigmergyCommit-PT-04b-ReachabilityCardinality-04
rfs formula type EF
rfs formula formula --invariant=/tmp/517/inv_4_
rfs formula name StigmergyCommit-PT-04b-ReachabilityCardinality-05
rfs formula type AG
rfs formula formula --invariant=/tmp/517/inv_5_
rfs formula name StigmergyCommit-PT-04b-ReachabilityCardinality-06
rfs formula type AG
rfs formula formula --invariant=/tmp/517/inv_6_
rfs formula name StigmergyCommit-PT-04b-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/517/inv_7_
rfs formula name StigmergyCommit-PT-04b-ReachabilityCardinality-08
rfs formula type AG
rfs formula formula --invariant=/tmp/517/inv_8_
rfs formula name StigmergyCommit-PT-04b-ReachabilityCardinality-09
rfs formula type AG
rfs formula formula --invariant=/tmp/517/inv_9_
rfs formula name StigmergyCommit-PT-04b-ReachabilityCardinality-10
rfs formula type AG
rfs formula formula --invariant=/tmp/517/inv_10_
rfs formula name StigmergyCommit-PT-04b-ReachabilityCardinality-11
rfs formula type EF
rfs formula formula --invariant=/tmp/517/inv_11_
rfs formula name StigmergyCommit-PT-04b-ReachabilityCardinality-12
rfs formula type AG
rfs formula formula --invariant=/tmp/517/inv_12_
rfs formula name StigmergyCommit-PT-04b-ReachabilityCardinality-13
rfs formula type AG
rfs formula formula --invariant=/tmp/517/inv_13_
rfs formula name StigmergyCommit-PT-04b-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/517/inv_14_
rfs formula name StigmergyCommit-PT-04b-ReachabilityCardinality-15
rfs formula type AG
rfs formula formula --invariant=/tmp/517/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 1534 places, 2136 transitions and 8601 arcs
pnml2lts-sym: Petri net StigmergyCommit-PT-04b analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.030 real 0.020 user 0.010 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: 2136->2136 groups
pnml2lts-sym: Regrouping took 2.930 real 2.920 user 0.010 sys
pnml2lts-sym: state vector length is 1534; there are 2136 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: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/517/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/517/inv_2_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/517/inv_15_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/517/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/517/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/517/inv_7_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/517/inv_8_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/517/inv_10_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/517/inv_12_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/517/inv_5_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 13970097 group checks and 0 next state calls
pnml2lts-sym: reachability took 217.170 real 865.400 user 2.350 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.070 real 0.270 user 0.000 sys
pnml2lts-sym: state space has 6520573710832 states, 375790 nodes
pnml2lts-sym: group_next: 15035 nodes total
pnml2lts-sym: group_explored: 8596 nodes, 19992 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-04b"
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-04b, 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-167912649300438"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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