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.r399-tall-171690530100342.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 greatspnxred
Input is StigmergyElection-PT-07b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530100342
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 18:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 18:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 18:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 18:41 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 3.4M 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-07b-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-08
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-11
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-13
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717012402228

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-07b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 19:53:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 19:53:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:53:23] [INFO ] Load time of PNML (sax parser for PT used): 356 ms
[2024-05-29 19:53:23] [INFO ] Transformed 971 places.
[2024-05-29 19:53:23] [INFO ] Transformed 5542 transitions.
[2024-05-29 19:53:23] [INFO ] Found NUPN structural information;
[2024-05-29 19:53:23] [INFO ] Parsed PT model containing 971 places and 5542 transitions and 65199 arcs in 502 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (327 resets) in 1696 ms. (23 steps per ms) remains 11/14 properties
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (48 resets) in 206 ms. (193 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (49 resets) in 130 ms. (305 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (45 resets) in 66 ms. (597 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (44 resets) in 176 ms. (226 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (47 resets) in 420 ms. (95 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (46 resets) in 212 ms. (187 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (47 resets) in 195 ms. (204 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (59 resets) in 75 ms. (526 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (48 resets) in 59 ms. (666 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (46 resets) in 61 ms. (645 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (45 resets) in 61 ms. (645 steps per ms) remains 11/11 properties
// Phase 1: matrix 5542 rows 971 cols
[2024-05-29 19:53:25] [INFO ] Computed 8 invariants in 124 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 868/971 variables, 8/111 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/971 variables, 868/979 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/971 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 5542/6513 variables, 971/1950 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6513 variables, 0/1950 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/6513 variables, 0/1950 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6513/6513 variables, and 1950 constraints, problems are : Problem set: 0 solved, 11 unsolved in 4044 ms.
Refiners :[Domain max(s): 971/971 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 971/971 constraints, PredecessorRefiner: 11/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem StigmergyElection-PT-07b-ReachabilityCardinality-2024-10 is UNSAT
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 868/971 variables, 8/111 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/971 variables, 868/979 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-29 19:53:31] [INFO ] Deduced a trap composed of 189 places in 1774 ms of which 45 ms to minimize.
[2024-05-29 19:53:33] [INFO ] Deduced a trap composed of 190 places in 1600 ms of which 4 ms to minimize.
[2024-05-29 19:53:34] [INFO ] Deduced a trap composed of 191 places in 1606 ms of which 11 ms to minimize.
SMT process timed out in 9773ms, After SMT, problems are : Problem set: 1 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 101 out of 971 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 971/971 places, 5542/5542 transitions.
Graph (trivial) has 815 edges and 971 vertex of which 90 / 971 are part of one of the 15 SCC in 6 ms
Free SCC test removed 75 places
Drop transitions (Empty/Sink Transition effects.) removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Graph (complete) has 2004 edges and 896 vertex of which 886 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.33 ms
Discarding 10 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 473 transitions
Trivial Post-agglo rules discarded 473 transitions
Performed 473 trivial Post agglomeration. Transition count delta: 473
Iterating post reduction 0 with 477 rules applied. Total rules applied 479 place count 886 transition count 4965
Reduce places removed 473 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 489 rules applied. Total rules applied 968 place count 413 transition count 4949
Reduce places removed 8 places and 0 transitions.
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Iterating post reduction 2 with 64 rules applied. Total rules applied 1032 place count 405 transition count 4893
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 3 with 56 rules applied. Total rules applied 1088 place count 349 transition count 4893
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 1088 place count 349 transition count 4870
Deduced a syphon composed of 23 places in 3 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 1134 place count 326 transition count 4870
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 1169 place count 291 transition count 4835
Iterating global reduction 4 with 35 rules applied. Total rules applied 1204 place count 291 transition count 4835
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1211 place count 284 transition count 1541
Iterating global reduction 4 with 7 rules applied. Total rules applied 1218 place count 284 transition count 1541
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1221 place count 284 transition count 1538
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 1263 place count 263 transition count 1517
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1264 place count 263 transition count 1516
Performed 13 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 1290 place count 250 transition count 1518
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 1297 place count 250 transition count 1511
Free-agglomeration rule applied 47 times.
Iterating global reduction 6 with 47 rules applied. Total rules applied 1344 place count 250 transition count 1464
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 6 with 47 rules applied. Total rules applied 1391 place count 203 transition count 1464
Drop transitions (Redundant composition of simpler transitions.) removed 218 transitions
Redundant transition composition rules discarded 218 transitions
Iterating global reduction 7 with 218 rules applied. Total rules applied 1609 place count 203 transition count 1246
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 1610 place count 203 transition count 1246
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1611 place count 203 transition count 1246
Applied a total of 1611 rules in 1210 ms. Remains 203 /971 variables (removed 768) and now considering 1246/5542 (removed 4296) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1219 ms. Remains : 203/971 places, 1246/5542 transitions.
RANDOM walk for 40000 steps (1518 resets) in 346 ms. (115 steps per ms) remains 9/10 properties
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (241 resets) in 92 ms. (430 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (305 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (251 resets) in 51 ms. (769 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (240 resets) in 121 ms. (327 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (260 resets) in 114 ms. (347 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (256 resets) in 112 ms. (354 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (257 resets) in 82 ms. (481 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (249 resets) in 80 ms. (493 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (244 resets) in 55 ms. (714 steps per ms) remains 9/9 properties
// Phase 1: matrix 1246 rows 203 cols
[2024-05-29 19:53:36] [INFO ] Computed 6 invariants in 11 ms
[2024-05-29 19:53:36] [INFO ] State equation strengthened by 740 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 75/173 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1238/1411 variables, 173/179 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1411 variables, 641/820 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1411 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 37/1448 variables, 29/849 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1448 variables, 99/948 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1448 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/1449 variables, 1/949 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1449 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/1449 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1449/1449 variables, and 949 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1848 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 203/203 constraints, ReadFeed: 740/740 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/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 75/173 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 19:53:38] [INFO ] Deduced a trap composed of 27 places in 194 ms of which 1 ms to minimize.
[2024-05-29 19:53:39] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 1 ms to minimize.
[2024-05-29 19:53:39] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 0 ms to minimize.
[2024-05-29 19:53:39] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 1 ms to minimize.
[2024-05-29 19:53:39] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 1 ms to minimize.
[2024-05-29 19:53:39] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 1 ms to minimize.
[2024-05-29 19:53:40] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 1 ms to minimize.
[2024-05-29 19:53:40] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 0 ms to minimize.
[2024-05-29 19:53:40] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 0 ms to minimize.
Problem StigmergyElection-PT-07b-ReachabilityCardinality-2024-06 is UNSAT
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-29 19:53:40] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 1 ms to minimize.
[2024-05-29 19:53:40] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 0 ms to minimize.
[2024-05-29 19:53:40] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 1 ms to minimize.
[2024-05-29 19:53:41] [INFO ] Deduced a trap composed of 39 places in 182 ms of which 1 ms to minimize.
[2024-05-29 19:53:41] [INFO ] Deduced a trap composed of 34 places in 179 ms of which 1 ms to minimize.
[2024-05-29 19:53:41] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 15/21 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-29 19:53:41] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 1 ms to minimize.
[2024-05-29 19:53:41] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-29 19:53:42] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 1 ms to minimize.
[2024-05-29 19:53:42] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 2/25 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 1238/1411 variables, 173/198 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1411 variables, 641/839 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1411 variables, 1/840 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1411 variables, 0/840 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 37/1448 variables, 29/869 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1448 variables, 99/968 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1448 variables, 7/975 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-29 19:53:44] [INFO ] Deduced a trap composed of 38 places in 195 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1448 variables, 1/976 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1448 variables, 0/976 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 1/1449 variables, 1/977 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-29 19:53:46] [INFO ] Deduced a trap composed of 38 places in 254 ms of which 1 ms to minimize.
[2024-05-29 19:53:46] [INFO ] Deduced a trap composed of 38 places in 249 ms of which 1 ms to minimize.
[2024-05-29 19:53:46] [INFO ] Deduced a trap composed of 42 places in 240 ms of which 1 ms to minimize.
[2024-05-29 19:53:47] [INFO ] Deduced a trap composed of 43 places in 207 ms of which 1 ms to minimize.
Problem StigmergyElection-PT-07b-ReachabilityCardinality-2024-08 is UNSAT
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-29 19:53:47] [INFO ] Deduced a trap composed of 43 places in 263 ms of which 1 ms to minimize.
[2024-05-29 19:53:47] [INFO ] Deduced a trap composed of 42 places in 239 ms of which 1 ms to minimize.
[2024-05-29 19:53:48] [INFO ] Deduced a trap composed of 46 places in 243 ms of which 1 ms to minimize.
[2024-05-29 19:53:48] [INFO ] Deduced a trap composed of 38 places in 204 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1449 variables, 8/985 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-05-29 19:53:49] [INFO ] Deduced a trap composed of 45 places in 262 ms of which 1 ms to minimize.
[2024-05-29 19:53:49] [INFO ] Deduced a trap composed of 36 places in 263 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1449 variables, 2/987 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-05-29 19:53:50] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1449 variables, 1/988 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1449 variables, 0/988 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-05-29 19:53:51] [INFO ] Deduced a trap composed of 50 places in 253 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/1449 variables, 1/989 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1449 variables, 0/989 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-05-29 19:53:53] [INFO ] Deduced a trap composed of 34 places in 244 ms of which 1 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/1449 variables, 1/990 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1449 variables, 0/990 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 24 (OVERLAPS) 0/1449 variables, 0/990 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1449/1449 variables, and 990 constraints, problems are : Problem set: 2 solved, 7 unsolved in 16614 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 203/203 constraints, ReadFeed: 740/740 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 33/33 constraints]
After SMT, in 18611ms problems are : Problem set: 2 solved, 7 unsolved
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 2168 ms.
Support contains 39 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 1246/1246 transitions.
Graph (trivial) has 110 edges and 203 vertex of which 6 / 203 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 753 edges and 200 vertex of which 199 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 199 transition count 1200
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 46 rules applied. Total rules applied 88 place count 160 transition count 1193
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 93 place count 155 transition count 1193
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 93 place count 155 transition count 1183
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 113 place count 145 transition count 1183
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 119 place count 139 transition count 1177
Iterating global reduction 3 with 6 rules applied. Total rules applied 125 place count 139 transition count 1177
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 127 place count 139 transition count 1175
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 147 place count 129 transition count 1163
Ensure Unique test removed 147 transitions
Reduce isomorphic transitions removed 147 transitions.
Iterating post reduction 4 with 147 rules applied. Total rules applied 294 place count 129 transition count 1016
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 295 place count 128 transition count 1015
Iterating global reduction 5 with 1 rules applied. Total rules applied 296 place count 128 transition count 1015
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 298 place count 127 transition count 1014
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 300 place count 127 transition count 1012
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 306 place count 124 transition count 1018
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 6 with 108 rules applied. Total rules applied 414 place count 124 transition count 910
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 416 place count 123 transition count 916
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 424 place count 123 transition count 908
Free-agglomeration rule applied 19 times.
Iterating global reduction 6 with 19 rules applied. Total rules applied 443 place count 123 transition count 889
Reduce places removed 19 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 38 rules applied. Total rules applied 481 place count 104 transition count 870
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 485 place count 100 transition count 866
Iterating global reduction 7 with 4 rules applied. Total rules applied 489 place count 100 transition count 866
Drop transitions (Redundant composition of simpler transitions.) removed 117 transitions
Redundant transition composition rules discarded 117 transitions
Iterating global reduction 7 with 117 rules applied. Total rules applied 606 place count 100 transition count 749
Applied a total of 606 rules in 406 ms. Remains 100 /203 variables (removed 103) and now considering 749/1246 (removed 497) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 406 ms. Remains : 100/203 places, 749/1246 transitions.
RANDOM walk for 40000 steps (1945 resets) in 1593 ms. (25 steps per ms) remains 3/6 properties
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (322 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (308 resets) in 60 ms. (655 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (302 resets) in 45 ms. (869 steps per ms) remains 3/3 properties
// Phase 1: matrix 749 rows 100 cols
[2024-05-29 19:53:58] [INFO ] Computed 6 invariants in 3 ms
[2024-05-29 19:53:58] [INFO ] State equation strengthened by 643 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 46/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 728/809 variables, 81/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/809 variables, 255/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/809 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 39/848 variables, 18/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/848 variables, 388/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/848 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/849 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/849 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/849 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 849/849 variables, and 749 constraints, problems are : Problem set: 0 solved, 3 unsolved in 568 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 100/100 constraints, ReadFeed: 643/643 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 46/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:53:59] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 0 ms to minimize.
[2024-05-29 19:53:59] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 0 ms to minimize.
[2024-05-29 19:53:59] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 0 ms to minimize.
[2024-05-29 19:53:59] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:53:59] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-05-29 19:53:59] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-29 19:53:59] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 0 ms to minimize.
[2024-05-29 19:53:59] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:53:59] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:53:59] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/81 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:53:59] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 728/809 variables, 81/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/809 variables, 255/353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/809 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 39/848 variables, 18/371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/848 variables, 388/759 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/848 variables, 3/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/848 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/849 variables, 1/763 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/849 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/849 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 849/849 variables, and 763 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1906 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 100/100 constraints, ReadFeed: 643/643 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 11/11 constraints]
After SMT, in 2565ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 189 ms.
Support contains 34 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 749/749 transitions.
Graph (trivial) has 15 edges and 100 vertex of which 2 / 100 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 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 0 with 2 rules applied. Total rules applied 3 place count 99 transition count 745
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 97 transition count 743
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 96 transition count 743
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 96 transition count 742
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 95 transition count 742
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 11 place count 94 transition count 741
Iterating global reduction 3 with 1 rules applied. Total rules applied 12 place count 94 transition count 741
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 93 transition count 740
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 93 transition count 739
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 16 place count 92 transition count 738
Iterating global reduction 4 with 1 rules applied. Total rules applied 17 place count 92 transition count 738
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 19 place count 91 transition count 744
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 27 place count 91 transition count 736
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 91 transition count 735
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 29 place count 90 transition count 735
Drop transitions (Redundant composition of simpler transitions.) removed 120 transitions
Redundant transition composition rules discarded 120 transitions
Iterating global reduction 5 with 120 rules applied. Total rules applied 149 place count 90 transition count 615
Applied a total of 149 rules in 199 ms. Remains 90 /100 variables (removed 10) and now considering 615/749 (removed 134) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 90/100 places, 615/749 transitions.
RANDOM walk for 40000 steps (1971 resets) in 302 ms. (132 steps per ms) remains 1/3 properties
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (330 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
// Phase 1: matrix 615 rows 90 cols
[2024-05-29 19:54:01] [INFO ] Computed 6 invariants in 3 ms
[2024-05-29 19:54:01] [INFO ] State equation strengthened by 526 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/68 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/69 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 589/658 variables, 69/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 194/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/658 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 42/700 variables, 17/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/700 variables, 332/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/700 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/705 variables, 4/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/705 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/705 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 705/705 variables, and 622 constraints, problems are : Problem set: 0 solved, 1 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 90/90 constraints, ReadFeed: 526/526 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/68 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:54:01] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 0 ms to minimize.
[2024-05-29 19:54:01] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-29 19:54:01] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:54:01] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/69 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 589/658 variables, 69/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/658 variables, 194/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:54:02] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:54:02] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/658 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/658 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 42/700 variables, 17/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/700 variables, 332/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/700 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:54:02] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/700 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/700 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/705 variables, 4/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/705 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/705 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 705/705 variables, and 630 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1009 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 90/90 constraints, ReadFeed: 526/526 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1327ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 22 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 615/615 transitions.
Graph (trivial) has 28 edges and 90 vertex of which 2 / 90 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 89 transition count 604
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 80 transition count 603
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 79 transition count 603
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 21 place count 79 transition count 602
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 78 transition count 602
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 77 transition count 601
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 77 transition count 601
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 37 place count 71 transition count 595
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 40 place count 68 transition count 592
Iterating global reduction 3 with 3 rules applied. Total rules applied 43 place count 68 transition count 592
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 44 place count 68 transition count 591
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 47 place count 68 transition count 588
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 50 place count 68 transition count 585
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 56 place count 65 transition count 582
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 5 with 30 rules applied. Total rules applied 86 place count 65 transition count 552
Applied a total of 86 rules in 155 ms. Remains 65 /90 variables (removed 25) and now considering 552/615 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 65/90 places, 552/615 transitions.
RANDOM walk for 40000 steps (2095 resets) in 277 ms. (143 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (295 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
Probably explored full state space saw : 52717 states, properties seen :0
Probabilistic random walk after 354998 steps, saw 52717 distinct states, run finished after 647 ms. (steps per millisecond=548 ) properties seen :0
Explored full state space saw : 52717 states, properties seen :0
Exhaustive walk after 354998 steps, saw 52717 distinct states, run finished after 530 ms. (steps per millisecond=669 ) properties seen :0
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 40841 ms.
ITS solved all properties within timeout

BK_STOP 1717012444216

--------------------
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-07b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is StigmergyElection-PT-07b, 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 r399-tall-171690530100342"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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