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-171690532200398.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 StigmergyElection-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-171690532200398
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 154M
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 21:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 11 21:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Apr 11 20:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 11 20:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 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 153M 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 StigmergyElection-PT-11a-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-08
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-11
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-13
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717254555000

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-11a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:09:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:09:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:09:21] [INFO ] Load time of PNML (sax parser for PT used): 4992 ms
[2024-06-01 15:09:21] [INFO ] Transformed 156 places.
[2024-06-01 15:09:21] [INFO ] Transformed 136650 transitions.
[2024-06-01 15:09:21] [INFO ] Found NUPN structural information;
[2024-06-01 15:09:21] [INFO ] Parsed PT model containing 156 places and 136650 transitions and 3001363 arcs in 5854 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 132345 transitions
Reduce redundant transitions removed 132345 transitions.
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (12 resets) in 12442 ms. (3 steps per ms) remains 4/9 properties
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 334 ms. (119 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 656 ms. (60 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
[2024-06-01 15:09:26] [INFO ] Flow matrix only has 4272 transitions (discarded 33 similar events)
// Phase 1: matrix 4272 rows 156 cols
[2024-06-01 15:09:26] [INFO ] Computed 12 invariants in 62 ms
[2024-06-01 15:09:27] [INFO ] State equation strengthened by 4148 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 86/155 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 86/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/156 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 4271/4427 variables, 156/324 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4427 variables, 4147/4471 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4427 variables, 0/4471 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/4428 variables, 1/4472 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4428 variables, 0/4472 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/4428 variables, 0/4472 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4428/4428 variables, and 4472 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3023 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 156/156 constraints, ReadFeed: 4148/4148 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 86/155 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 86/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 15:09:32] [INFO ] Deduced a trap composed of 13 places in 1228 ms of which 16 ms to minimize.
[2024-06-01 15:09:33] [INFO ] Deduced a trap composed of 13 places in 1183 ms of which 3 ms to minimize.
[2024-06-01 15:09:34] [INFO ] Deduced a trap composed of 13 places in 968 ms of which 4 ms to minimize.
[2024-06-01 15:09:35] [INFO ] Deduced a trap composed of 13 places in 962 ms of which 2 ms to minimize.
[2024-06-01 15:09:36] [INFO ] Deduced a trap composed of 13 places in 848 ms of which 1 ms to minimize.
SMT process timed out in 9438ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 69 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 4305/4305 transitions.
Graph (complete) has 584 edges and 156 vertex of which 152 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.36 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 152 transition count 4263
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 12 rules applied. Total rules applied 51 place count 147 transition count 4256
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 54 place count 145 transition count 4255
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 56 place count 144 transition count 4254
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 56 place count 144 transition count 4246
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 72 place count 136 transition count 4246
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 80 place count 128 transition count 4238
Iterating global reduction 4 with 8 rules applied. Total rules applied 88 place count 128 transition count 4238
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 89 place count 127 transition count 4237
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 127 transition count 4237
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 98 place count 123 transition count 4233
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 100 place count 121 transition count 4231
Iterating global reduction 4 with 2 rules applied. Total rules applied 102 place count 121 transition count 4231
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 119 place count 121 transition count 4214
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 120 place count 121 transition count 4213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 121 place count 120 transition count 4213
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 127 place count 117 transition count 4210
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 130 place count 117 transition count 4207
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 133 place count 114 transition count 4207
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 134 place count 114 transition count 4207
Applied a total of 134 rules in 9257 ms. Remains 114 /156 variables (removed 42) and now considering 4207/4305 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9268 ms. Remains : 114/156 places, 4207/4305 transitions.
RANDOM walk for 40000 steps (8 resets) in 13180 ms. (3 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 890761 steps, run timeout after 9001 ms. (steps per millisecond=98 ) properties seen :1 out of 4
Probabilistic random walk after 890761 steps, saw 122513 distinct states, run finished after 9015 ms. (steps per millisecond=98 ) properties seen :1
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 4207 rows 114 cols
[2024-06-01 15:09:57] [INFO ] Computed 11 invariants in 25 ms
[2024-06-01 15:09:58] [INFO ] State equation strengthened by 4144 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) 52/107 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/108 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4201/4309 variables, 108/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4309 variables, 2086/2205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4309 variables, 0/2205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 10/4319 variables, 4/2209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4319 variables, 2058/4267 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4319 variables, 0/4267 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/4321 variables, 2/4269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4321 variables, 0/4269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/4321 variables, 0/4269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4321/4321 variables, and 4269 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1968 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 114/114 constraints, ReadFeed: 4144/4144 constraints, PredecessorRefiner: 3/0 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) 52/107 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 15:10:01] [INFO ] Deduced a trap composed of 8 places in 808 ms of which 1 ms to minimize.
[2024-06-01 15:10:02] [INFO ] Deduced a trap composed of 9 places in 794 ms of which 1 ms to minimize.
[2024-06-01 15:10:02] [INFO ] Deduced a trap composed of 11 places in 811 ms of which 0 ms to minimize.
[2024-06-01 15:10:03] [INFO ] Deduced a trap composed of 10 places in 821 ms of which 1 ms to minimize.
[2024-06-01 15:10:04] [INFO ] Deduced a trap composed of 8 places in 710 ms of which 1 ms to minimize.
[2024-06-01 15:10:05] [INFO ] Deduced a trap composed of 10 places in 595 ms of which 1 ms to minimize.
[2024-06-01 15:10:05] [INFO ] Deduced a trap composed of 10 places in 601 ms of which 3 ms to minimize.
[2024-06-01 15:10:06] [INFO ] Deduced a trap composed of 11 places in 593 ms of which 2 ms to minimize.
[2024-06-01 15:10:06] [INFO ] Deduced a trap composed of 9 places in 601 ms of which 1 ms to minimize.
Problem StigmergyElection-PT-11a-ReachabilityCardinality-2024-00 is UNSAT
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-01 15:10:07] [INFO ] Deduced a trap composed of 9 places in 936 ms of which 1 ms to minimize.
[2024-06-01 15:10:08] [INFO ] Deduced a trap composed of 11 places in 822 ms of which 0 ms to minimize.
[2024-06-01 15:10:09] [INFO ] Deduced a trap composed of 8 places in 813 ms of which 1 ms to minimize.
[2024-06-01 15:10:10] [INFO ] Deduced a trap composed of 12 places in 826 ms of which 1 ms to minimize.
[2024-06-01 15:10:11] [INFO ] Deduced a trap composed of 8 places in 706 ms of which 0 ms to minimize.
[2024-06-01 15:10:11] [INFO ] Deduced a trap composed of 13 places in 707 ms of which 1 ms to minimize.
[2024-06-01 15:10:12] [INFO ] Deduced a trap composed of 10 places in 589 ms of which 0 ms to minimize.
[2024-06-01 15:10:12] [INFO ] Deduced a trap composed of 9 places in 487 ms of which 0 ms to minimize.
[2024-06-01 15:10:13] [INFO ] Deduced a trap composed of 11 places in 601 ms of which 1 ms to minimize.
[2024-06-01 15:10:13] [INFO ] Deduced a trap composed of 10 places in 480 ms of which 1 ms to minimize.
[2024-06-01 15:10:14] [INFO ] Deduced a trap composed of 9 places in 518 ms of which 0 ms to minimize.
Problem StigmergyElection-PT-11a-ReachabilityCardinality-2024-00 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 20/30 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 15:10:15] [INFO ] Deduced a trap composed of 8 places in 716 ms of which 5 ms to minimize.
[2024-06-01 15:10:15] [INFO ] Deduced a trap composed of 12 places in 697 ms of which 1 ms to minimize.
[2024-06-01 15:10:16] [INFO ] Deduced a trap composed of 10 places in 710 ms of which 1 ms to minimize.
[2024-06-01 15:10:17] [INFO ] Deduced a trap composed of 12 places in 707 ms of which 1 ms to minimize.
[2024-06-01 15:10:17] [INFO ] Deduced a trap composed of 10 places in 582 ms of which 1 ms to minimize.
[2024-06-01 15:10:18] [INFO ] Deduced a trap composed of 8 places in 495 ms of which 1 ms to minimize.
[2024-06-01 15:10:19] [INFO ] Deduced a trap composed of 10 places in 582 ms of which 0 ms to minimize.
[2024-06-01 15:10:19] [INFO ] Deduced a trap composed of 8 places in 594 ms of which 0 ms to minimize.
[2024-06-01 15:10:20] [INFO ] Deduced a trap composed of 10 places in 575 ms of which 1 ms to minimize.
[2024-06-01 15:10:20] [INFO ] Deduced a trap composed of 11 places in 481 ms of which 2 ms to minimize.
[2024-06-01 15:10:21] [INFO ] Deduced a trap composed of 8 places in 391 ms of which 0 ms to minimize.
[2024-06-01 15:10:21] [INFO ] Deduced a trap composed of 10 places in 611 ms of which 1 ms to minimize.
[2024-06-01 15:10:22] [INFO ] Deduced a trap composed of 10 places in 516 ms of which 1 ms to minimize.
[2024-06-01 15:10:22] [INFO ] Deduced a trap composed of 10 places in 405 ms of which 1 ms to minimize.
Problem StigmergyElection-PT-11a-ReachabilityCardinality-2024-12 is UNSAT
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-01 15:10:23] [INFO ] Deduced a trap composed of 8 places in 691 ms of which 1 ms to minimize.
[2024-06-01 15:10:24] [INFO ] Deduced a trap composed of 9 places in 679 ms of which 0 ms to minimize.
[2024-06-01 15:10:24] [INFO ] Deduced a trap composed of 11 places in 697 ms of which 0 ms to minimize.
Problem StigmergyElection-PT-11a-ReachabilityCardinality-2024-15 is UNSAT
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 107/4321 variables, and 47 constraints, problems are : Problem set: 3 solved, 0 unsolved in 24228 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, State Equation: 0/114 constraints, ReadFeed: 0/4144 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 37/37 constraints]
After SMT, in 26792ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 68684 ms.
ITS solved all properties within timeout

BK_STOP 1717254624777

--------------------
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="StigmergyElection-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 StigmergyElection-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-171690532200398"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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