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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 465M
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 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 464M 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-11a-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2023-06
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2023-08
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-09
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-10
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2023-11
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2023-13
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717243188430

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-11a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:59:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 11:59:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:00:07] [INFO ] Load time of PNML (sax parser for PT used): 17474 ms
[2024-06-01 12:00:08] [INFO ] Transformed 436 places.
[2024-06-01 12:00:09] [INFO ] Transformed 373236 transitions.
[2024-06-01 12:00:09] [INFO ] Found NUPN structural information;
[2024-06-01 12:00:09] [INFO ] Parsed PT model containing 436 places and 373236 transitions and 8944506 arcs in 19666 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 364478 transitions
Reduce redundant transitions removed 364478 transitions.
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 38004 ms. (1 steps per ms) remains 9/12 properties
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 734 ms. (54 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 342 ms. (116 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 305 ms. (130 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1095 ms. (36 steps per ms) remains 8/9 properties
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2023-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 8/8 properties
[2024-06-01 12:00:22] [INFO ] Flow matrix only has 8722 transitions (discarded 36 similar events)
// Phase 1: matrix 8722 rows 436 cols
[2024-06-01 12:00:22] [INFO ] Computed 13 invariants in 109 ms
[2024-06-01 12:00:24] [INFO ] State equation strengthened by 8357 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 310/436 variables, 13/139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 310/449 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 8721/9157 variables, 436/885 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9157 variables, 8356/9241 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/9157 variables, 0/9241 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SMT process timed out in 6740ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 126 out of 436 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 436/436 places, 8758/8758 transitions.
Graph (complete) has 1119 edges and 436 vertex of which 427 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.60 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 427 transition count 8695
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 1 with 39 rules applied. Total rules applied 94 place count 404 transition count 8679
Reduce places removed 2 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 2 with 22 rules applied. Total rules applied 116 place count 402 transition count 8659
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 144 place count 382 transition count 8651
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 144 place count 382 transition count 8602
Deduced a syphon composed of 49 places in 6 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 242 place count 333 transition count 8602
Discarding 41 places :
Symmetric choice reduction at 4 with 41 rule applications. Total rules 283 place count 292 transition count 8561
Iterating global reduction 4 with 41 rules applied. Total rules applied 324 place count 292 transition count 8561
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 326 place count 292 transition count 8559
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 345 place count 273 transition count 8538
Iterating global reduction 5 with 19 rules applied. Total rules applied 364 place count 273 transition count 8538
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 366 place count 273 transition count 8536
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 369 place count 270 transition count 8533
Iterating global reduction 6 with 3 rules applied. Total rules applied 372 place count 270 transition count 8533
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 374 place count 270 transition count 8531
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 392 place count 261 transition count 8522
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 399 place count 254 transition count 8515
Iterating global reduction 7 with 7 rules applied. Total rules applied 406 place count 254 transition count 8515
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 408 place count 252 transition count 8513
Iterating global reduction 7 with 2 rules applied. Total rules applied 410 place count 252 transition count 8513
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 7 with 19 rules applied. Total rules applied 429 place count 252 transition count 8494
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 430 place count 252 transition count 8493
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 431 place count 251 transition count 8493
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 435 place count 249 transition count 8491
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 436 place count 248 transition count 8490
Iterating global reduction 9 with 1 rules applied. Total rules applied 437 place count 248 transition count 8490
Free-agglomeration rule applied 13 times.
Iterating global reduction 9 with 13 rules applied. Total rules applied 450 place count 248 transition count 8477
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 463 place count 235 transition count 8477
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 466 place count 235 transition count 8477
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 469 place count 235 transition count 8474
Applied a total of 469 rules in 46360 ms. Remains 235 /436 variables (removed 201) and now considering 8474/8758 (removed 284) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46375 ms. Remains : 235/436 places, 8474/8758 transitions.
RANDOM walk for 40000 steps (8 resets) in 49381 ms. (0 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 2157474 steps, run timeout after 39001 ms. (steps per millisecond=55 ) properties seen :5 out of 8
Probabilistic random walk after 2157474 steps, saw 292678 distinct states, run finished after 39009 ms. (steps per millisecond=55 ) properties seen :5
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2023-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2023-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 8474 rows 235 cols
[2024-06-01 12:02:08] [INFO ] Computed 7 invariants in 48 ms
[2024-06-01 12:02:09] [INFO ] State equation strengthened by 8320 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 88/143 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/144 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8258/8402 variables, 144/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8402 variables, 204/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8402 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 238/8640 variables, 48/403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8640 variables, 8104/8507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8640 variables, 0/8507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 54/8694 variables, 32/8539 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8694 variables, 8/8547 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8694 variables, 0/8547 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 14/8708 variables, 10/8557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/8708 variables, 4/8561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/8708 variables, 0/8561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/8709 variables, 1/8562 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/8709 variables, 0/8562 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/8709 variables, 0/8562 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8709/8709 variables, and 8562 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5701 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 235/235 constraints, ReadFeed: 8320/8320 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 88/143 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 12:02:16] [INFO ] Deduced a trap composed of 8 places in 1192 ms of which 13 ms to minimize.
[2024-06-01 12:02:17] [INFO ] Deduced a trap composed of 12 places in 1253 ms of which 2 ms to minimize.
[2024-06-01 12:02:18] [INFO ] Deduced a trap composed of 12 places in 979 ms of which 1 ms to minimize.
[2024-06-01 12:02:19] [INFO ] Deduced a trap composed of 11 places in 930 ms of which 1 ms to minimize.
[2024-06-01 12:02:20] [INFO ] Deduced a trap composed of 14 places in 815 ms of which 1 ms to minimize.
[2024-06-01 12:02:20] [INFO ] Deduced a trap composed of 11 places in 748 ms of which 1 ms to minimize.
[2024-06-01 12:02:21] [INFO ] Deduced a trap composed of 12 places in 766 ms of which 3 ms to minimize.
[2024-06-01 12:02:22] [INFO ] Deduced a trap composed of 11 places in 760 ms of which 1 ms to minimize.
[2024-06-01 12:02:23] [INFO ] Deduced a trap composed of 12 places in 563 ms of which 1 ms to minimize.
[2024-06-01 12:02:23] [INFO ] Deduced a trap composed of 13 places in 573 ms of which 1 ms to minimize.
[2024-06-01 12:02:24] [INFO ] Deduced a trap composed of 13 places in 760 ms of which 1 ms to minimize.
[2024-06-01 12:02:25] [INFO ] Deduced a trap composed of 12 places in 757 ms of which 1 ms to minimize.
[2024-06-01 12:02:25] [INFO ] Deduced a trap composed of 11 places in 388 ms of which 1 ms to minimize.
[2024-06-01 12:02:25] [INFO ] Deduced a trap composed of 13 places in 397 ms of which 1 ms to minimize.
[2024-06-01 12:02:26] [INFO ] Deduced a trap composed of 13 places in 397 ms of which 1 ms to minimize.
[2024-06-01 12:02:26] [INFO ] Deduced a trap composed of 11 places in 384 ms of which 0 ms to minimize.
[2024-06-01 12:02:27] [INFO ] Deduced a trap composed of 13 places in 380 ms of which 0 ms to minimize.
[2024-06-01 12:02:27] [INFO ] Deduced a trap composed of 10 places in 426 ms of which 1 ms to minimize.
[2024-06-01 12:02:27] [INFO ] Deduced a trap composed of 11 places in 391 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/144 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 8258/8402 variables, 144/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8402 variables, 204/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 12:02:30] [INFO ] Deduced a trap composed of 13 places in 777 ms of which 2 ms to minimize.
[2024-06-01 12:02:30] [INFO ] Deduced a trap composed of 10 places in 588 ms of which 0 ms to minimize.
[2024-06-01 12:02:31] [INFO ] Deduced a trap composed of 12 places in 392 ms of which 1 ms to minimize.
[2024-06-01 12:02:31] [INFO ] Deduced a trap composed of 11 places in 402 ms of which 0 ms to minimize.
[2024-06-01 12:02:32] [INFO ] Deduced a trap composed of 10 places in 389 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/8402 variables, 5/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8402 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 238/8640 variables, 48/427 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8640 variables, 8104/8531 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8640 variables, 1/8532 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 12:02:39] [INFO ] Deduced a trap composed of 8 places in 1530 ms of which 0 ms to minimize.
[2024-06-01 12:02:40] [INFO ] Deduced a trap composed of 12 places in 1319 ms of which 1 ms to minimize.
[2024-06-01 12:02:42] [INFO ] Deduced a trap composed of 12 places in 1126 ms of which 0 ms to minimize.
[2024-06-01 12:02:43] [INFO ] Deduced a trap composed of 12 places in 946 ms of which 5 ms to minimize.
[2024-06-01 12:02:44] [INFO ] Deduced a trap composed of 12 places in 762 ms of which 0 ms to minimize.
[2024-06-01 12:02:45] [INFO ] Deduced a trap composed of 11 places in 576 ms of which 0 ms to minimize.
[2024-06-01 12:02:46] [INFO ] Deduced a trap composed of 12 places in 381 ms of which 0 ms to minimize.
[2024-06-01 12:02:47] [INFO ] Deduced a trap composed of 9 places in 559 ms of which 0 ms to minimize.
[2024-06-01 12:02:47] [INFO ] Deduced a trap composed of 11 places in 565 ms of which 1 ms to minimize.
[2024-06-01 12:02:48] [INFO ] Deduced a trap composed of 11 places in 380 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/8640 variables, 10/8542 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/8640 variables, 0/8542 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem StigmergyCommit-PT-11a-ReachabilityCardinality-2024-00 is UNSAT
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem StigmergyCommit-PT-11a-ReachabilityCardinality-2024-12 is UNSAT
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 15 (OVERLAPS) 54/8694 variables, 32/8574 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/8694 variables, 8/8582 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-06-01 12:02:53] [INFO ] Deduced a trap composed of 12 places in 1818 ms of which 5 ms to minimize.
[2024-06-01 12:02:55] [INFO ] Deduced a trap composed of 9 places in 1835 ms of which 1 ms to minimize.
[2024-06-01 12:02:57] [INFO ] Deduced a trap composed of 13 places in 1815 ms of which 1 ms to minimize.
[2024-06-01 12:02:59] [INFO ] Deduced a trap composed of 13 places in 1562 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/8694 variables, 4/8586 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8694/8709 variables, and 8586 constraints, problems are : Problem set: 2 solved, 1 unsolved in 45021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 224/235 constraints, ReadFeed: 8316/8320 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 38/38 constraints]
After SMT, in 51947ms problems are : Problem set: 2 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 8474/8474 transitions.
Graph (complete) has 802 edges and 235 vertex of which 232 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.17 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 232 transition count 8444
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 57 place count 210 transition count 8440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 209 transition count 8440
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 58 place count 209 transition count 8415
Deduced a syphon composed of 25 places in 3 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 108 place count 184 transition count 8415
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 141 place count 151 transition count 8382
Iterating global reduction 3 with 33 rules applied. Total rules applied 174 place count 151 transition count 8382
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 176 place count 151 transition count 8380
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 195 place count 132 transition count 8361
Iterating global reduction 4 with 19 rules applied. Total rules applied 214 place count 132 transition count 8361
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 4 with 62 rules applied. Total rules applied 276 place count 132 transition count 8299
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 280 place count 128 transition count 8295
Iterating global reduction 5 with 4 rules applied. Total rules applied 284 place count 128 transition count 8295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 285 place count 128 transition count 8294
Performed 24 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 24 places in 3 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 333 place count 104 transition count 8269
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 343 place count 104 transition count 8259
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 362 place count 85 transition count 8240
Iterating global reduction 7 with 19 rules applied. Total rules applied 381 place count 85 transition count 8240
Ensure Unique test removed 1988 transitions
Reduce isomorphic transitions removed 1988 transitions.
Iterating post reduction 7 with 1988 rules applied. Total rules applied 2369 place count 85 transition count 6252
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 2378 place count 76 transition count 6243
Iterating global reduction 8 with 9 rules applied. Total rules applied 2387 place count 76 transition count 6243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2388 place count 76 transition count 6242
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 2393 place count 71 transition count 6237
Iterating global reduction 9 with 5 rules applied. Total rules applied 2398 place count 71 transition count 6237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2399 place count 71 transition count 6236
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 10 with 10 rules applied. Total rules applied 2409 place count 71 transition count 6226
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2410 place count 71 transition count 6225
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 2412 place count 70 transition count 6224
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 11 with 8 rules applied. Total rules applied 2420 place count 70 transition count 6224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 2421 place count 70 transition count 6223
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 2426 place count 70 transition count 6218
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2427 place count 69 transition count 6217
Reduce places removed 1 places and 0 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 12 with 7 rules applied. Total rules applied 2434 place count 68 transition count 6211
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 2440 place count 62 transition count 6211
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 2 Pre rules applied. Total rules applied 2440 place count 62 transition count 6209
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 2444 place count 60 transition count 6209
Performed 24 Post agglomeration using F-continuation condition with reduction of 6117 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 14 with 48 rules applied. Total rules applied 2492 place count 36 transition count 68
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 14 with 30 rules applied. Total rules applied 2522 place count 36 transition count 38
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 15 with 12 rules applied. Total rules applied 2534 place count 29 transition count 33
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 2539 place count 29 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 2541 place count 29 transition count 26
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 16 with 6 rules applied. Total rules applied 2547 place count 23 transition count 20
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 2551 place count 19 transition count 20
Applied a total of 2551 rules in 25542 ms. Remains 19 /235 variables (removed 216) and now considering 20/8474 (removed 8454) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25542 ms. Remains : 19/235 places, 20/8474 transitions.
RANDOM walk for 40000 steps (1102 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (354 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Probably explored full state space saw : 15 states, properties seen :0
Probabilistic random walk after 35 steps, saw 15 distinct states, run finished after 5 ms. (steps per millisecond=7 ) properties seen :0
Explored full state space saw : 15 states, properties seen :0
Exhaustive walk after 35 steps, saw 15 distinct states, run finished after 7 ms. (steps per millisecond=5 ) properties seen :0
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 215668 ms.
ITS solved all properties within timeout

BK_STOP 1717243405585

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.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-11a"
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-11a, 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-171690531900238"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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