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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
398.184 113225.00 361831.00 522.10 TFFTFFTTTFFFFTTF 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-167912649300423.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-03b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r457-smll-167912649300423
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 6.2K Feb 26 10:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 10:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 10:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 10:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 26 10:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 10:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 10:52 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 359K 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-03b-ReachabilityFireability-00
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-01
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-02
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-03
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-04
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-05
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-06
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-07
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-08
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-09
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-10
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-11
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-12
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-13
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-14
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679436288263

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-03b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 22:04:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 22:04:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:04:51] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2023-03-21 22:04:51] [INFO ] Transformed 1231 places.
[2023-03-21 22:04:51] [INFO ] Transformed 1476 transitions.
[2023-03-21 22:04:51] [INFO ] Found NUPN structural information;
[2023-03-21 22:04:51] [INFO ] Parsed PT model containing 1231 places and 1476 transitions and 4168 arcs in 297 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 125 resets, run finished after 739 ms. (steps per millisecond=13 ) properties (out of 16) seen :4
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 12) seen :1
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1476 rows 1231 cols
[2023-03-21 22:04:53] [INFO ] Computed 5 place invariants in 36 ms
[2023-03-21 22:04:54] [INFO ] After 1088ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-21 22:04:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 17 ms returned sat
[2023-03-21 22:04:58] [INFO ] After 2877ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-21 22:04:59] [INFO ] Deduced a trap composed of 207 places in 637 ms of which 15 ms to minimize.
[2023-03-21 22:04:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 813 ms
[2023-03-21 22:05:00] [INFO ] Deduced a trap composed of 398 places in 732 ms of which 2 ms to minimize.
[2023-03-21 22:05:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 893 ms
[2023-03-21 22:05:01] [INFO ] Deduced a trap composed of 398 places in 427 ms of which 2 ms to minimize.
[2023-03-21 22:05:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 561 ms
[2023-03-21 22:05:02] [INFO ] Deduced a trap composed of 399 places in 719 ms of which 3 ms to minimize.
[2023-03-21 22:05:03] [INFO ] Deduced a trap composed of 207 places in 749 ms of which 3 ms to minimize.
[2023-03-21 22:05:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1709 ms
[2023-03-21 22:05:04] [INFO ] Deduced a trap composed of 398 places in 554 ms of which 2 ms to minimize.
[2023-03-21 22:05:05] [INFO ] Deduced a trap composed of 398 places in 404 ms of which 1 ms to minimize.
[2023-03-21 22:05:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1164 ms
[2023-03-21 22:05:06] [INFO ] Deduced a trap composed of 398 places in 449 ms of which 2 ms to minimize.
[2023-03-21 22:05:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 884 ms
[2023-03-21 22:05:06] [INFO ] After 10992ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1985 ms.
[2023-03-21 22:05:08] [INFO ] After 13900ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 6 properties in 106 ms.
Support contains 84 out of 1231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1231/1231 places, 1476/1476 transitions.
Graph (trivial) has 1044 edges and 1231 vertex of which 52 / 1231 are part of one of the 8 SCC in 10 ms
Free SCC test removed 44 places
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Graph (complete) has 1681 edges and 1187 vertex of which 1181 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 765 transitions
Trivial Post-agglo rules discarded 765 transitions
Performed 765 trivial Post agglomeration. Transition count delta: 765
Iterating post reduction 0 with 768 rules applied. Total rules applied 770 place count 1181 transition count 649
Reduce places removed 765 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 780 rules applied. Total rules applied 1550 place count 416 transition count 634
Reduce places removed 7 places and 0 transitions.
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Iterating post reduction 2 with 65 rules applied. Total rules applied 1615 place count 409 transition count 576
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 59 rules applied. Total rules applied 1674 place count 351 transition count 575
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1674 place count 351 transition count 525
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 1774 place count 301 transition count 525
Discarding 50 places :
Symmetric choice reduction at 4 with 50 rule applications. Total rules 1824 place count 251 transition count 475
Iterating global reduction 4 with 50 rules applied. Total rules applied 1874 place count 251 transition count 475
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1877 place count 251 transition count 472
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1885 place count 243 transition count 457
Iterating global reduction 5 with 8 rules applied. Total rules applied 1893 place count 243 transition count 457
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1896 place count 243 transition count 454
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1897 place count 242 transition count 453
Iterating global reduction 6 with 1 rules applied. Total rules applied 1898 place count 242 transition count 453
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1899 place count 241 transition count 452
Iterating global reduction 6 with 1 rules applied. Total rules applied 1900 place count 241 transition count 452
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 1934 place count 224 transition count 435
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1938 place count 220 transition count 431
Iterating global reduction 6 with 4 rules applied. Total rules applied 1942 place count 220 transition count 431
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1945 place count 217 transition count 428
Iterating global reduction 6 with 3 rules applied. Total rules applied 1948 place count 217 transition count 428
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1949 place count 216 transition count 427
Iterating global reduction 6 with 1 rules applied. Total rules applied 1950 place count 216 transition count 427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1952 place count 215 transition count 427
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1953 place count 215 transition count 426
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1956 place count 215 transition count 423
Free-agglomeration rule applied 28 times.
Iterating global reduction 7 with 28 rules applied. Total rules applied 1984 place count 215 transition count 395
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 7 with 28 rules applied. Total rules applied 2012 place count 187 transition count 395
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 2014 place count 187 transition count 395
Applied a total of 2014 rules in 337 ms. Remains 187 /1231 variables (removed 1044) and now considering 395/1476 (removed 1081) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 338 ms. Remains : 187/1231 places, 395/1476 transitions.
Incomplete random walk after 10000 steps, including 541 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 110 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 469831 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 469831 steps, saw 99390 distinct states, run finished after 3004 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 395 rows 187 cols
[2023-03-21 22:05:12] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-21 22:05:12] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 22:05:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-21 22:05:13] [INFO ] After 362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 22:05:13] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-21 22:05:13] [INFO ] After 233ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-21 22:05:13] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 0 ms to minimize.
[2023-03-21 22:05:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-03-21 22:05:13] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 1 ms to minimize.
[2023-03-21 22:05:14] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 1 ms to minimize.
[2023-03-21 22:05:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 263 ms
[2023-03-21 22:05:14] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 0 ms to minimize.
[2023-03-21 22:05:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-03-21 22:05:14] [INFO ] After 1069ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 225 ms.
[2023-03-21 22:05:14] [INFO ] After 1776ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 19 ms.
Support contains 83 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 395/395 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 185 transition count 393
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 185 transition count 393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 184 transition count 392
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 184 transition count 392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 183 transition count 391
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 183 transition count 391
Applied a total of 8 rules in 39 ms. Remains 183 /187 variables (removed 4) and now considering 391/395 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 183/187 places, 391/395 transitions.
Incomplete random walk after 10000 steps, including 533 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 107 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 102 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 121 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 511787 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :{}
Probabilistic random walk after 511787 steps, saw 107353 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 391 rows 183 cols
[2023-03-21 22:05:18] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-21 22:05:18] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 22:05:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-21 22:05:18] [INFO ] After 356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 22:05:18] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-21 22:05:19] [INFO ] After 224ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 22:05:19] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 1 ms to minimize.
[2023-03-21 22:05:19] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 0 ms to minimize.
[2023-03-21 22:05:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 266 ms
[2023-03-21 22:05:19] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 1 ms to minimize.
[2023-03-21 22:05:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2023-03-21 22:05:19] [INFO ] After 847ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 215 ms.
[2023-03-21 22:05:19] [INFO ] After 1520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 6 ms.
Support contains 79 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 391/391 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 183 transition count 387
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 179 transition count 385
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 177 transition count 385
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 177 transition count 384
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 176 transition count 384
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 176 transition count 384
Applied a total of 15 rules in 35 ms. Remains 176 /183 variables (removed 7) and now considering 384/391 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 176/183 places, 384/391 transitions.
Incomplete random walk after 10000 steps, including 589 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 776120 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :{0=1}
Probabilistic random walk after 776120 steps, saw 160459 distinct states, run finished after 3001 ms. (steps per millisecond=258 ) properties seen :1
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 384 rows 176 cols
[2023-03-21 22:05:23] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-21 22:05:23] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 22:05:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-21 22:05:23] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 22:05:23] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-21 22:05:23] [INFO ] After 120ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 22:05:23] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 1 ms to minimize.
[2023-03-21 22:05:23] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 1 ms to minimize.
[2023-03-21 22:05:23] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 1 ms to minimize.
[2023-03-21 22:05:24] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 3 ms to minimize.
[2023-03-21 22:05:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 530 ms
[2023-03-21 22:05:24] [INFO ] After 751ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-21 22:05:24] [INFO ] After 1165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 12 ms.
Support contains 42 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 384/384 transitions.
Graph (trivial) has 66 edges and 176 vertex of which 10 / 176 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 476 edges and 171 vertex of which 170 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 170 transition count 354
Reduce places removed 20 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 27 rules applied. Total rules applied 49 place count 150 transition count 347
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 56 place count 143 transition count 347
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 56 place count 143 transition count 341
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 68 place count 137 transition count 341
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 77 place count 128 transition count 278
Iterating global reduction 3 with 9 rules applied. Total rules applied 86 place count 128 transition count 278
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 89 place count 128 transition count 275
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 91 place count 126 transition count 273
Iterating global reduction 4 with 2 rules applied. Total rules applied 93 place count 126 transition count 273
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 94 place count 125 transition count 272
Iterating global reduction 4 with 1 rules applied. Total rules applied 95 place count 125 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 96 place count 125 transition count 271
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 106 place count 120 transition count 266
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 108 place count 120 transition count 264
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 110 place count 118 transition count 262
Iterating global reduction 6 with 2 rules applied. Total rules applied 112 place count 118 transition count 262
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 113 place count 117 transition count 261
Iterating global reduction 6 with 1 rules applied. Total rules applied 114 place count 117 transition count 261
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 115 place count 116 transition count 260
Iterating global reduction 6 with 1 rules applied. Total rules applied 116 place count 116 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 117 place count 116 transition count 259
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 121 place count 114 transition count 269
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 129 place count 114 transition count 261
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 135 place count 114 transition count 255
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 141 place count 108 transition count 255
Applied a total of 141 rules in 75 ms. Remains 108 /176 variables (removed 68) and now considering 255/384 (removed 129) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 108/176 places, 255/384 transitions.
Incomplete random walk after 10000 steps, including 735 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 140 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Finished probabilistic random walk after 84707 steps, run visited all 1 properties in 147 ms. (steps per millisecond=576 )
Probabilistic random walk after 84707 steps, saw 20101 distinct states, run finished after 147 ms. (steps per millisecond=576 ) properties seen :1
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 33457 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/545/inv_0_ --invariant=/tmp/545/inv_1_ --invariant=/tmp/545/inv_2_ --invariant=/tmp/545/inv_3_ --invariant=/tmp/545/inv_4_ --invariant=/tmp/545/inv_5_ --invariant=/tmp/545/inv_6_ --invariant=/tmp/545/inv_7_ --invariant=/tmp/545/inv_8_ --invariant=/tmp/545/inv_9_ --invariant=/tmp/545/inv_10_ --invariant=/tmp/545/inv_11_ --invariant=/tmp/545/inv_12_ --invariant=/tmp/545/inv_13_ --invariant=/tmp/545/inv_14_ --invariant=/tmp/545/inv_15_ --inv-par
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679436401488

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name StigmergyCommit-PT-03b-ReachabilityFireability-00
rfs formula type EF
rfs formula formula --invariant=/tmp/545/inv_0_
rfs formula name StigmergyCommit-PT-03b-ReachabilityFireability-01
rfs formula type AG
rfs formula formula --invariant=/tmp/545/inv_1_
rfs formula name StigmergyCommit-PT-03b-ReachabilityFireability-02
rfs formula type AG
rfs formula formula --invariant=/tmp/545/inv_2_
rfs formula name StigmergyCommit-PT-03b-ReachabilityFireability-03
rfs formula type EF
rfs formula formula --invariant=/tmp/545/inv_3_
rfs formula name StigmergyCommit-PT-03b-ReachabilityFireability-04
rfs formula type AG
rfs formula formula --invariant=/tmp/545/inv_4_
rfs formula name StigmergyCommit-PT-03b-ReachabilityFireability-05
rfs formula type AG
rfs formula formula --invariant=/tmp/545/inv_5_
rfs formula name StigmergyCommit-PT-03b-ReachabilityFireability-06
rfs formula type EF
rfs formula formula --invariant=/tmp/545/inv_6_
rfs formula name StigmergyCommit-PT-03b-ReachabilityFireability-07
rfs formula type EF
rfs formula formula --invariant=/tmp/545/inv_7_
rfs formula name StigmergyCommit-PT-03b-ReachabilityFireability-08
rfs formula type EF
rfs formula formula --invariant=/tmp/545/inv_8_
rfs formula name StigmergyCommit-PT-03b-ReachabilityFireability-09
rfs formula type AG
rfs formula formula --invariant=/tmp/545/inv_9_
rfs formula name StigmergyCommit-PT-03b-ReachabilityFireability-10
rfs formula type AG
rfs formula formula --invariant=/tmp/545/inv_10_
rfs formula name StigmergyCommit-PT-03b-ReachabilityFireability-11
rfs formula type AG
rfs formula formula --invariant=/tmp/545/inv_11_
rfs formula name StigmergyCommit-PT-03b-ReachabilityFireability-12
rfs formula type AG
rfs formula formula --invariant=/tmp/545/inv_12_
rfs formula name StigmergyCommit-PT-03b-ReachabilityFireability-13
rfs formula type EF
rfs formula formula --invariant=/tmp/545/inv_13_
rfs formula name StigmergyCommit-PT-03b-ReachabilityFireability-14
rfs formula type EF
rfs formula formula --invariant=/tmp/545/inv_14_
rfs formula name StigmergyCommit-PT-03b-ReachabilityFireability-15
rfs formula type AG
rfs formula formula --invariant=/tmp/545/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 1231 places, 1476 transitions and 4168 arcs
pnml2lts-sym: Petri net StigmergyCommit-PT-03b analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.020 real 0.010 user 0.000 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: 1476->1476 groups
pnml2lts-sym: Regrouping took 1.160 real 1.160 user 0.010 sys
pnml2lts-sym: state vector length is 1231; there are 1476 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: 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/545/inv_15_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/545/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/545/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/545/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/545/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/545/inv_6_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/545/inv_7_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/545/inv_11_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/545/inv_12_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/545/inv_13_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/545/inv_14_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/545/inv_9_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/545/inv_8_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/545/inv_10_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/545/inv_5_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/545/inv_2_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 73.300 real 292.110 user 0.680 sys
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-03b"
export BK_EXAMINATION="ReachabilityFireability"
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-03b, examination is ReachabilityFireability"
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-167912649300423"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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