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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 852K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 11 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 18:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 18:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 428K 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-05b-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-08
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-11
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-13
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717010285155

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-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 19:18:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 19:18:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:18:06] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2024-05-29 19:18:06] [INFO ] Transformed 699 places.
[2024-05-29 19:18:06] [INFO ] Transformed 1266 transitions.
[2024-05-29 19:18:06] [INFO ] Found NUPN structural information;
[2024-05-29 19:18:06] [INFO ] Parsed PT model containing 699 places and 1266 transitions and 6741 arcs in 235 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (449 resets) in 1759 ms. (22 steps per ms) remains 8/12 properties
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (78 resets) in 193 ms. (206 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (78 resets) in 320 ms. (124 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (79 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (78 resets) in 352 ms. (113 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (75 resets) in 177 ms. (224 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (82 resets) in 450 ms. (88 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (78 resets) in 133 ms. (298 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (77 resets) in 442 ms. (90 steps per ms) remains 8/8 properties
// Phase 1: matrix 1266 rows 699 cols
[2024-05-29 19:18:07] [INFO ] Computed 6 invariants in 31 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 616/699 variables, 6/89 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/699 variables, 616/705 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/699 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1266/1965 variables, 699/1404 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1965 variables, 0/1404 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/1965 variables, 0/1404 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1965/1965 variables, and 1404 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1560 ms.
Refiners :[Domain max(s): 699/699 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 699/699 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem StigmergyElection-PT-05b-ReachabilityCardinality-2024-12 is UNSAT
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 616/699 variables, 6/89 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/699 variables, 616/705 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-29 19:18:10] [INFO ] Deduced a trap composed of 192 places in 455 ms of which 44 ms to minimize.
[2024-05-29 19:18:11] [INFO ] Deduced a trap composed of 192 places in 596 ms of which 18 ms to minimize.
[2024-05-29 19:18:11] [INFO ] Deduced a trap composed of 190 places in 325 ms of which 8 ms to minimize.
[2024-05-29 19:18:11] [INFO ] Deduced a trap composed of 192 places in 254 ms of which 3 ms to minimize.
[2024-05-29 19:18:12] [INFO ] Deduced a trap composed of 197 places in 352 ms of which 4 ms to minimize.
[2024-05-29 19:18:12] [INFO ] Deduced a trap composed of 192 places in 357 ms of which 4 ms to minimize.
[2024-05-29 19:18:12] [INFO ] Deduced a trap composed of 193 places in 257 ms of which 3 ms to minimize.
[2024-05-29 19:18:13] [INFO ] Deduced a trap composed of 192 places in 257 ms of which 4 ms to minimize.
[2024-05-29 19:18:13] [INFO ] Deduced a trap composed of 193 places in 235 ms of which 2 ms to minimize.
[2024-05-29 19:18:13] [INFO ] Deduced a trap composed of 189 places in 287 ms of which 4 ms to minimize.
[2024-05-29 19:18:13] [INFO ] Deduced a trap composed of 192 places in 252 ms of which 3 ms to minimize.
[2024-05-29 19:18:14] [INFO ] Deduced a trap composed of 192 places in 245 ms of which 3 ms to minimize.
[2024-05-29 19:18:14] [INFO ] Deduced a trap composed of 192 places in 217 ms of which 3 ms to minimize.
[2024-05-29 19:18:14] [INFO ] Deduced a trap composed of 189 places in 241 ms of which 3 ms to minimize.
SMT process timed out in 6734ms, After SMT, problems are : Problem set: 1 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 64 out of 699 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 699/699 places, 1266/1266 transitions.
Graph (trivial) has 575 edges and 699 vertex of which 61 / 699 are part of one of the 10 SCC in 8 ms
Free SCC test removed 51 places
Drop transitions (Empty/Sink Transition effects.) removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Graph (complete) has 1221 edges and 648 vertex of which 640 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.12 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 343 transitions
Trivial Post-agglo rules discarded 343 transitions
Performed 343 trivial Post agglomeration. Transition count delta: 343
Iterating post reduction 0 with 347 rules applied. Total rules applied 349 place count 640 transition count 850
Reduce places removed 343 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 345 rules applied. Total rules applied 694 place count 297 transition count 848
Reduce places removed 1 places and 0 transitions.
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Iterating post reduction 2 with 46 rules applied. Total rules applied 740 place count 296 transition count 803
Reduce places removed 45 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 3 with 49 rules applied. Total rules applied 789 place count 251 transition count 799
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 790 place count 250 transition count 799
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 19 Pre rules applied. Total rules applied 790 place count 250 transition count 780
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 828 place count 231 transition count 780
Discarding 34 places :
Symmetric choice reduction at 5 with 34 rule applications. Total rules 862 place count 197 transition count 746
Iterating global reduction 5 with 34 rules applied. Total rules applied 896 place count 197 transition count 746
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 5 with 2 rules applied. Total rules applied 898 place count 197 transition count 744
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 899 place count 196 transition count 744
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 906 place count 189 transition count 378
Iterating global reduction 7 with 7 rules applied. Total rules applied 913 place count 189 transition count 378
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 916 place count 189 transition count 375
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 8 with 28 rules applied. Total rules applied 944 place count 175 transition count 361
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 946 place count 173 transition count 359
Iterating global reduction 8 with 2 rules applied. Total rules applied 948 place count 173 transition count 359
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 966 place count 164 transition count 362
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 973 place count 164 transition count 355
Free-agglomeration rule applied 24 times.
Iterating global reduction 8 with 24 rules applied. Total rules applied 997 place count 164 transition count 331
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 1021 place count 140 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 9 with 15 rules applied. Total rules applied 1036 place count 140 transition count 316
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1038 place count 140 transition count 316
Applied a total of 1038 rules in 334 ms. Remains 140 /699 variables (removed 559) and now considering 316/1266 (removed 950) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 347 ms. Remains : 140/699 places, 316/1266 transitions.
RANDOM walk for 40000 steps (1299 resets) in 424 ms. (94 steps per ms) remains 2/7 properties
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (262 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (249 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
// Phase 1: matrix 316 rows 140 cols
[2024-05-29 19:18:15] [INFO ] Computed 6 invariants in 2 ms
[2024-05-29 19:18:15] [INFO ] State equation strengthened by 118 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/140 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 316/456 variables, 140/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 118/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/456 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 264 constraints, problems are : Problem set: 0 solved, 2 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 140/140 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/140 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:18:15] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:18:15] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:18:15] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:18:15] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2024-05-29 19:18:15] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:18:15] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 316/456 variables, 140/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 118/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:18:16] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 1 ms to minimize.
[2024-05-29 19:18:16] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/456 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:18:16] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/456 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/456 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 275 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1189 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 140/140 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 1415ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 285 ms.
Support contains 44 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 316/316 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 140 transition count 306
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 130 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 129 transition count 305
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 22 place count 129 transition count 298
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 36 place count 122 transition count 298
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 41 place count 117 transition count 293
Iterating global reduction 3 with 5 rules applied. Total rules applied 46 place count 117 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 47 place count 117 transition count 292
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 48 place count 116 transition count 291
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 116 transition count 291
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 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 59 place count 111 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 60 place count 111 transition count 285
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 64 place count 109 transition count 285
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 65 place count 109 transition count 284
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 69 place count 109 transition count 280
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 73 place count 105 transition count 280
Applied a total of 73 rules in 51 ms. Remains 105 /140 variables (removed 35) and now considering 280/316 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 105/140 places, 280/316 transitions.
RANDOM walk for 40000 steps (1516 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (306 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (220 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 379374 steps, run visited all 2 properties in 926 ms. (steps per millisecond=409 )
Probabilistic random walk after 379374 steps, saw 70068 distinct states, run finished after 946 ms. (steps per millisecond=401 ) properties seen :2
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 11708 ms.
ITS solved all properties within timeout

BK_STOP 1717010298049

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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-05b"
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-05b, 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-171690530100310"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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