Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r538-tall-171690547500098.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is StigmergyCommit-PT-06a, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r538-tall-171690547500098
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 11 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 17:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.8M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717226440183

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=StigmergyCommit-PT-06a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:20:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 07:20:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:20:41] [INFO ] Load time of PNML (sax parser for PT used): 224 ms
[2024-06-01 07:20:41] [INFO ] Transformed 256 places.
[2024-06-01 07:20:41] [INFO ] Transformed 2816 transitions.
[2024-06-01 07:20:41] [INFO ] Found NUPN structural information;
[2024-06-01 07:20:41] [INFO ] Parsed PT model containing 256 places and 2816 transitions and 35321 arcs in 338 ms.
Structural test allowed to assert that 16 places are NOT stable. Took 10 ms.
Ensure Unique test removed 2229 transitions
Reduce redundant transitions removed 2229 transitions.
RANDOM walk for 40000 steps (13 resets) in 2874 ms. (13 steps per ms) remains 20/240 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
[2024-06-01 07:20:42] [INFO ] Flow matrix only has 566 transitions (discarded 21 similar events)
// Phase 1: matrix 566 rows 256 cols
[2024-06-01 07:20:42] [INFO ] Computed 8 invariants in 20 ms
[2024-06-01 07:20:42] [INFO ] State equation strengthened by 351 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 163/183 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 163/188 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 73/256 variables, 3/191 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 73/264 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 565/821 variables, 256/520 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/821 variables, 350/870 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/821 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 1/822 variables, 1/871 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/822 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 0/822 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 822/822 variables, and 871 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1841 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 256/256 constraints, ReadFeed: 351/351 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 163/183 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 163/188 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:20:44] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 26 ms to minimize.
[2024-06-01 07:20:45] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:20:45] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 1 ms to minimize.
[2024-06-01 07:20:45] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:20:45] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:20:45] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:20:45] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:20:45] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 6 ms to minimize.
[2024-06-01 07:20:45] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:20:45] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:20:45] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:20:45] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:20:45] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:20:45] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 20/208 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 7/215 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 73/256 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 73/294 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 4 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 20/314 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/256 variables, 8/322 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 565/821 variables, 256/578 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/821 variables, 350/928 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/821 variables, 20/948 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 821/822 variables, and 948 constraints, problems are : Problem set: 0 solved, 20 unsolved in 5011 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 256/256 constraints, ReadFeed: 350/351 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 58/58 constraints]
After SMT, in 6958ms problems are : Problem set: 0 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 587/587 transitions.
Graph (complete) has 549 edges and 256 vertex of which 251 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 251 transition count 525
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 64 rules applied. Total rules applied 122 place count 216 transition count 496
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 129 place count 209 transition count 496
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 129 place count 209 transition count 449
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 223 place count 162 transition count 449
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 256 place count 129 transition count 416
Iterating global reduction 3 with 33 rules applied. Total rules applied 289 place count 129 transition count 416
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 322 place count 96 transition count 383
Iterating global reduction 3 with 33 rules applied. Total rules applied 355 place count 96 transition count 383
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Iterating post reduction 3 with 132 rules applied. Total rules applied 487 place count 96 transition count 251
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 494 place count 89 transition count 244
Iterating global reduction 4 with 7 rules applied. Total rules applied 501 place count 89 transition count 244
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 508 place count 82 transition count 237
Iterating global reduction 4 with 7 rules applied. Total rules applied 515 place count 82 transition count 237
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 521 place count 82 transition count 231
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 539 place count 73 transition count 222
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 543 place count 73 transition count 218
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 549 place count 67 transition count 212
Iterating global reduction 6 with 6 rules applied. Total rules applied 555 place count 67 transition count 212
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 561 place count 61 transition count 206
Iterating global reduction 6 with 6 rules applied. Total rules applied 567 place count 61 transition count 206
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 573 place count 55 transition count 200
Iterating global reduction 6 with 6 rules applied. Total rules applied 579 place count 55 transition count 200
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 588 place count 55 transition count 191
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 598 place count 55 transition count 191
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 603 place count 55 transition count 186
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 604 place count 54 transition count 185
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 3 rules applied. Total rules applied 607 place count 53 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 609 place count 51 transition count 183
Performed 12 Post agglomeration using F-continuation condition with reduction of 116 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 633 place count 39 transition count 55
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 640 place count 39 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 646 place count 35 transition count 46
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 648 place count 35 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 652 place count 35 transition count 40
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 653 place count 35 transition count 40
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 654 place count 35 transition count 39
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 11 with 5 rules applied. Total rules applied 659 place count 30 transition count 34
Applied a total of 659 rules in 144 ms. Remains 30 /256 variables (removed 226) and now considering 34/587 (removed 553) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 30/256 places, 34/587 transitions.
RANDOM walk for 785 steps (29 resets) in 8 ms. (87 steps per ms) remains 0/20 properties
Able to resolve query StableMarking after proving 241 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 8643 ms.
ITS solved all properties within timeout

BK_STOP 1717226449938

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

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-06a"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is StigmergyCommit-PT-06a, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r538-tall-171690547500098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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