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.r536-tall-171690531600118.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-03b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690531600118
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 17:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 17:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 11 17:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 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 359K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-06
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-08
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-09
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-10
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-11
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-13
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717228948206

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-03b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:02:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 08:02:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:02:29] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2024-06-01 08:02:29] [INFO ] Transformed 1231 places.
[2024-06-01 08:02:29] [INFO ] Transformed 1476 transitions.
[2024-06-01 08:02:29] [INFO ] Found NUPN structural information;
[2024-06-01 08:02:29] [INFO ] Parsed PT model containing 1231 places and 1476 transitions and 4168 arcs in 236 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (507 resets) in 1542 ms. (25 steps per ms) remains 9/14 properties
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (109 resets) in 289 ms. (137 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (108 resets) in 448 ms. (89 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (108 resets) in 116 ms. (341 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (107 resets) in 220 ms. (181 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (107 resets) in 197 ms. (202 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (113 resets) in 150 ms. (264 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (115 resets) in 122 ms. (325 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (107 resets) in 123 ms. (322 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (108 resets) in 104 ms. (380 steps per ms) remains 9/9 properties
// Phase 1: matrix 1476 rows 1231 cols
[2024-06-01 08:02:30] [INFO ] Computed 5 invariants in 36 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1151/1212 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1212 variables, 1151/1216 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1212 variables, 0/1216 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 19/1231 variables, 1/1217 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1231 variables, 19/1236 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1231 variables, 0/1236 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1476/2707 variables, 1231/2467 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2707 variables, 0/2467 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/2707 variables, 0/2467 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2707/2707 variables, and 2467 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2269 ms.
Refiners :[Domain max(s): 1231/1231 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 1231/1231 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1151/1212 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1212 variables, 1151/1216 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 08:02:34] [INFO ] Deduced a trap composed of 396 places in 579 ms of which 69 ms to minimize.
[2024-06-01 08:02:34] [INFO ] Deduced a trap composed of 396 places in 339 ms of which 7 ms to minimize.
[2024-06-01 08:02:34] [INFO ] Deduced a trap composed of 398 places in 350 ms of which 7 ms to minimize.
[2024-06-01 08:02:35] [INFO ] Deduced a trap composed of 490 places in 352 ms of which 6 ms to minimize.
[2024-06-01 08:02:35] [INFO ] Deduced a trap composed of 397 places in 254 ms of which 5 ms to minimize.
[2024-06-01 08:02:35] [INFO ] Deduced a trap composed of 397 places in 248 ms of which 4 ms to minimize.
[2024-06-01 08:02:36] [INFO ] Deduced a trap composed of 397 places in 279 ms of which 5 ms to minimize.
[2024-06-01 08:02:36] [INFO ] Deduced a trap composed of 398 places in 238 ms of which 4 ms to minimize.
[2024-06-01 08:02:37] [INFO ] Deduced a trap composed of 489 places in 328 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1212 variables, 9/1225 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 08:02:37] [INFO ] Deduced a trap composed of 398 places in 332 ms of which 6 ms to minimize.
[2024-06-01 08:02:38] [INFO ] Deduced a trap composed of 398 places in 310 ms of which 6 ms to minimize.
[2024-06-01 08:02:38] [INFO ] Deduced a trap composed of 396 places in 265 ms of which 4 ms to minimize.
SMT process timed out in 7553ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 61 out of 1231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1231/1231 places, 1476/1476 transitions.
Graph (trivial) has 1108 edges and 1231 vertex of which 76 / 1231 are part of one of the 12 SCC in 7 ms
Free SCC test removed 64 places
Drop transitions (Empty/Sink Transition effects.) removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Graph (complete) has 1656 edges and 1167 vertex of which 1159 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 782 transitions
Trivial Post-agglo rules discarded 782 transitions
Performed 782 trivial Post agglomeration. Transition count delta: 782
Iterating post reduction 0 with 786 rules applied. Total rules applied 788 place count 1159 transition count 605
Reduce places removed 782 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 795 rules applied. Total rules applied 1583 place count 377 transition count 592
Reduce places removed 6 places and 0 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Iterating post reduction 2 with 50 rules applied. Total rules applied 1633 place count 371 transition count 548
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 3 with 44 rules applied. Total rules applied 1677 place count 327 transition count 548
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 53 Pre rules applied. Total rules applied 1677 place count 327 transition count 495
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 1783 place count 274 transition count 495
Discarding 34 places :
Symmetric choice reduction at 4 with 34 rule applications. Total rules 1817 place count 240 transition count 461
Iterating global reduction 4 with 34 rules applied. Total rules applied 1851 place count 240 transition count 461
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1851 place count 240 transition count 460
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1853 place count 239 transition count 460
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1868 place count 224 transition count 323
Iterating global reduction 4 with 15 rules applied. Total rules applied 1883 place count 224 transition count 323
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1886 place count 224 transition count 320
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1888 place count 222 transition count 318
Iterating global reduction 5 with 2 rules applied. Total rules applied 1890 place count 222 transition count 318
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1892 place count 220 transition count 316
Iterating global reduction 5 with 2 rules applied. Total rules applied 1894 place count 220 transition count 316
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1895 place count 220 transition count 315
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 1935 place count 200 transition count 295
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1936 place count 200 transition count 294
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1939 place count 197 transition count 291
Iterating global reduction 7 with 3 rules applied. Total rules applied 1942 place count 197 transition count 291
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1944 place count 195 transition count 289
Iterating global reduction 7 with 2 rules applied. Total rules applied 1946 place count 195 transition count 289
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1948 place count 193 transition count 287
Iterating global reduction 7 with 2 rules applied. Total rules applied 1950 place count 193 transition count 287
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1956 place count 190 transition count 290
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1958 place count 190 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1960 place count 190 transition count 286
Free-agglomeration rule applied 39 times.
Iterating global reduction 8 with 39 rules applied. Total rules applied 1999 place count 190 transition count 247
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 8 with 39 rules applied. Total rules applied 2038 place count 151 transition count 247
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2040 place count 149 transition count 245
Iterating global reduction 9 with 2 rules applied. Total rules applied 2042 place count 149 transition count 245
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 9 with 19 rules applied. Total rules applied 2061 place count 149 transition count 226
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 2064 place count 149 transition count 226
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 2065 place count 149 transition count 225
Applied a total of 2065 rules in 216 ms. Remains 149 /1231 variables (removed 1082) and now considering 225/1476 (removed 1251) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 149/1231 places, 225/1476 transitions.
RANDOM walk for 40000 steps (1159 resets) in 514 ms. (77 steps per ms) remains 6/9 properties
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (242 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (228 resets) in 140 ms. (283 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (245 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (235 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (285 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (247 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
// Phase 1: matrix 225 rows 149 cols
[2024-06-01 08:02:38] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 08:02:38] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 92/148 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/149 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 225/374 variables, 149/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 71/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/374 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 225 constraints, problems are : Problem set: 0 solved, 6 unsolved in 254 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 149/149 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 92/148 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 08:02:39] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-06-01 08:02:39] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1/149 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 225/374 variables, 149/156 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 71/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 6/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/374 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 233 constraints, problems are : Problem set: 0 solved, 6 unsolved in 539 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 149/149 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 812ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 84 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=84 )
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 34 ms.
All properties solved without resorting to model-checking.
Total runtime 10453 ms.
ITS solved all properties within timeout

BK_STOP 1717228959857

--------------------
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 ReachabilityCardinality -timeout 360 -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-03b"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is StigmergyCommit-PT-03b, 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 r536-tall-171690531600118"
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 [ "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 ;