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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 11 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 18:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 11 18:44 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 1.2M 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-06b-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-08
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-11
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-13
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717009268202

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-29 19:01:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 19:01:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:01:09] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2024-05-29 19:01:09] [INFO ] Transformed 835 places.
[2024-05-29 19:01:09] [INFO ] Transformed 2416 transitions.
[2024-05-29 19:01:09] [INFO ] Found NUPN structural information;
[2024-05-29 19:01:09] [INFO ] Parsed PT model containing 835 places and 2416 transitions and 20130 arcs in 310 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (377 resets) in 1873 ms. (21 steps per ms) remains 10/15 properties
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (59 resets) in 416 ms. (95 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (58 resets) in 124 ms. (320 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (58 resets) in 474 ms. (84 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (58 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (59 resets) in 1092 ms. (36 steps per ms) remains 10/10 properties
[2024-05-29 19:01:11] [INFO ] Flatten gal took : 707 ms
BEST_FIRST walk for 40002 steps (62 resets) in 145 ms. (273 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (58 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (55 resets) in 184 ms. (216 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (60 resets) in 339 ms. (117 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (60 resets) in 309 ms. (129 steps per ms) remains 10/10 properties
[2024-05-29 19:01:11] [INFO ] Flatten gal took : 389 ms
// Phase 1: matrix 2416 rows 835 cols
[2024-05-29 19:01:11] [INFO ] Computed 7 invariants in 80 ms
[2024-05-29 19:01:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6203643251844825302.gal : 226 ms
[2024-05-29 19:01:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3051133056946893674.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6203643251844825302.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3051133056946893674.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Loading property file /tmp/ReachabilityCardinality3051133056946893674.prop.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem StigmergyElection-PT-06b-ReachabilityCardinality-2024-10 is UNSAT
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 709/835 variables, 7/133 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/835 variables, 709/842 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/835 variables, 0/842 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2416/3251 variables, 835/1677 constraints. Problems are: Problem set: 1 solved, 9 unsolved
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :9 after 13
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :13 after 17
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :17 after 32
At refinement iteration 6 (INCLUDED_ONLY) 0/3251 variables, 0/1677 constraints. Problems are: Problem set: 1 solved, 9 unsolved
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :32 after 160
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :160 after 2265
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :2265 after 4616
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :4616 after 4806
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :4806 after 12487
At refinement iteration 7 (OVERLAPS) 0/3251 variables, 0/1677 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :12487 after 99812
After SMT solving in domain Real declared 3251/3251 variables, and 1677 constraints, problems are : Problem set: 1 solved, 9 unsolved in 2473 ms.
Refiners :[Domain max(s): 835/835 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 835/835 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 97/97 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem StigmergyElection-PT-06b-ReachabilityCardinality-2024-09 is UNSAT
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem StigmergyElection-PT-06b-ReachabilityCardinality-2024-12 is UNSAT
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 738/835 variables, 7/104 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/835 variables, 738/842 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-05-29 19:01:15] [INFO ] Deduced a trap composed of 193 places in 694 ms of which 40 ms to minimize.
[2024-05-29 19:01:15] [INFO ] Deduced a trap composed of 189 places in 540 ms of which 4 ms to minimize.
[2024-05-29 19:01:16] [INFO ] Deduced a trap composed of 189 places in 510 ms of which 3 ms to minimize.
[2024-05-29 19:01:16] [INFO ] Deduced a trap composed of 194 places in 563 ms of which 4 ms to minimize.
[2024-05-29 19:01:17] [INFO ] Deduced a trap composed of 193 places in 538 ms of which 4 ms to minimize.
[2024-05-29 19:01:18] [INFO ] Deduced a trap composed of 190 places in 528 ms of which 3 ms to minimize.
[2024-05-29 19:01:18] [INFO ] Deduced a trap composed of 193 places in 539 ms of which 2 ms to minimize.
[2024-05-29 19:01:19] [INFO ] Deduced a trap composed of 189 places in 540 ms of which 4 ms to minimize.
[2024-05-29 19:01:19] [INFO ] Deduced a trap composed of 194 places in 602 ms of which 3 ms to minimize.
SMT process timed out in 8425ms, After SMT, problems are : Problem set: 3 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 49 out of 835 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 835/835 places, 2416/2416 transitions.
Graph (trivial) has 755 edges and 835 vertex of which 81 / 835 are part of one of the 13 SCC in 10 ms
Free SCC test removed 68 places
Drop transitions (Empty/Sink Transition effects.) removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Graph (complete) has 1584 edges and 767 vertex of which 758 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.19 ms
Discarding 9 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 457 transitions
Trivial Post-agglo rules discarded 457 transitions
Performed 457 trivial Post agglomeration. Transition count delta: 457
Iterating post reduction 0 with 461 rules applied. Total rules applied 463 place count 758 transition count 1864
Reduce places removed 457 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 472 rules applied. Total rules applied 935 place count 301 transition count 1849
Reduce places removed 7 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 2 with 37 rules applied. Total rules applied 972 place count 294 transition count 1819
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 1003 place count 264 transition count 1818
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 1003 place count 264 transition count 1800
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 1039 place count 246 transition count 1800
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 1079 place count 206 transition count 1760
Iterating global reduction 4 with 40 rules applied. Total rules applied 1119 place count 206 transition count 1760
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1120 place count 206 transition count 1759
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1120 place count 206 transition count 1757
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1124 place count 204 transition count 1757
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1135 place count 193 transition count 495
Iterating global reduction 5 with 11 rules applied. Total rules applied 1146 place count 193 transition count 495
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1150 place count 193 transition count 491
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 1208 place count 164 transition count 462
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1209 place count 164 transition count 461
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1211 place count 162 transition count 459
Iterating global reduction 7 with 2 rules applied. Total rules applied 1213 place count 162 transition count 459
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 1229 place count 154 transition count 471
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1231 place count 154 transition count 469
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 1243 place count 154 transition count 457
Free-agglomeration rule applied 32 times.
Iterating global reduction 8 with 32 rules applied. Total rules applied 1275 place count 154 transition count 425
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 8 with 32 rules applied. Total rules applied 1307 place count 122 transition count 425
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1309 place count 120 transition count 423
Iterating global reduction 9 with 2 rules applied. Total rules applied 1311 place count 120 transition count 423
Drop transitions (Redundant composition of simpler transitions.) removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 9 with 50 rules applied. Total rules applied 1361 place count 120 transition count 373
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1363 place count 120 transition count 373
Applied a total of 1363 rules in 375 ms. Remains 120 /835 variables (removed 715) and now considering 373/2416 (removed 2043) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 399 ms. Remains : 120/835 places, 373/2416 transitions.
RANDOM walk for 40000 steps (800 resets) in 843 ms. (47 steps per ms) remains 3/7 properties
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (239 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (256 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (236 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
// Phase 1: matrix 373 rows 120 cols
[2024-05-29 19:01:20] [INFO ] Computed 6 invariants in 3 ms
[2024-05-29 19:01:20] [INFO ] State equation strengthened by 202 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 65/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 358/459 variables, 101/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 165/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 29/488 variables, 15/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 37/324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 5/493 variables, 4/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/493 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/493 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 328 constraints, problems are : Problem set: 0 solved, 3 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 120/120 constraints, ReadFeed: 202/202 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/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 65/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:01:21] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2024-05-29 19:01:21] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:01:21] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2024-05-29 19:01:21] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:01:21] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:01:21] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:01:21] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:01:21] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/101 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 358/459 variables, 101/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 165/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:01:21] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:01:21] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 29/488 variables, 15/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/488 variables, 37/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/488 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/488 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 5/493 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/493 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/493 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 493/493 variables, and 341 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1193 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 120/120 constraints, ReadFeed: 202/202 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 10/10 constraints]
After SMT, in 1523ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 390 ms.
Support contains 35 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 373/373 transitions.
Graph (trivial) has 33 edges and 120 vertex of which 4 / 120 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 397 edges and 118 vertex of which 117 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 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 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 10 place count 117 transition count 360
Reduce places removed 7 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 110 transition count 356
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 27 place count 106 transition count 354
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 29 place count 105 transition count 353
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 29 place count 105 transition count 352
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 31 place count 104 transition count 352
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 41 place count 99 transition count 347
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 43 place count 99 transition count 345
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 45 place count 97 transition count 343
Iterating global reduction 5 with 2 rules applied. Total rules applied 47 place count 97 transition count 343
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 49 place count 96 transition count 343
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 53 place count 96 transition count 339
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 54 place count 96 transition count 338
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 56 place count 96 transition count 336
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 58 place count 94 transition count 336
Applied a total of 58 rules in 76 ms. Remains 94 /120 variables (removed 26) and now considering 336/373 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 94/120 places, 336/373 transitions.
RANDOM walk for 40000 steps (1133 resets) in 186 ms. (213 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (259 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (290 resets) in 131 ms. (303 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (253 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :99812 after 8.78753e+06
Reachability property StigmergyElection-PT-06b-ReachabilityCardinality-2024-11 is true.
Finished probabilistic random walk after 1666761 steps, run visited all 3 properties in 2873 ms. (steps per millisecond=580 )
Probabilistic random walk after 1666761 steps, saw 249098 distinct states, run finished after 2878 ms. (steps per millisecond=579 ) properties seen :3
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 16394 ms.

BK_STOP 1717009285788

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-06b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is StigmergyElection-PT-06b, 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 r400-tall-171690532100326"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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