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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 11 18:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 18:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 11 18:39 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 12M 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-08b-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-2024-08
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-2024-11
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-2024-13
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717013213160

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-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-29 20:06:54] [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 20:06:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:06:55] [INFO ] Load time of PNML (sax parser for PT used): 746 ms
[2024-05-29 20:06:55] [INFO ] Transformed 1107 places.
[2024-05-29 20:06:55] [INFO ] Transformed 14564 transitions.
[2024-05-29 20:06:55] [INFO ] Found NUPN structural information;
[2024-05-29 20:06:55] [INFO ] Parsed PT model containing 1107 places and 14564 transitions and 216524 arcs in 1010 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (291 resets) in 2278 ms. (17 steps per ms) remains 6/14 properties
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (36 resets) in 210 ms. (189 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (37 resets) in 320 ms. (124 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (37 resets) in 478 ms. (83 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (38 resets) in 460 ms. (86 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (39 resets) in 354 ms. (112 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (36 resets) in 309 ms. (129 steps per ms) remains 6/6 properties
// Phase 1: matrix 14564 rows 1107 cols
[2024-05-29 20:06:57] [INFO ] Computed 9 invariants in 312 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1047/1088 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1088 variables, 1047/1096 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1088 variables, 0/1096 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 19/1107 variables, 1/1097 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1107 variables, 19/1116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1107 variables, 0/1116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 20:06:58] [INFO ] Flatten gal took : 2143 ms
[2024-05-29 20:07:00] [INFO ] Flatten gal took : 1193 ms
[2024-05-29 20:07:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3364563237800517297.gal : 260 ms
[2024-05-29 20:07:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4014412562216178509.prop : 1 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/ReachabilityCardinality3364563237800517297.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4014412562216178509.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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 15671/15671 variables, and 2223 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5069 ms.
Refiners :[Domain max(s): 1107/1107 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 1107/1107 constraints, PredecessorRefiner: 6/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1047/1088 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1088 variables, 1047/1096 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Loading property file /tmp/ReachabilityCardinality4014412562216178509.prop.
[2024-05-29 20:07:10] [INFO ] Deduced a trap composed of 189 places in 7256 ms of which 55 ms to minimize.
SMT process timed out in 13327ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 41 out of 1107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1107/1107 places, 14564/14564 transitions.
Graph (trivial) has 1038 edges and 1107 vertex of which 146 / 1107 are part of one of the 21 SCC in 8 ms
Free SCC test removed 125 places
Drop transitions (Empty/Sink Transition effects.) removed 157 transitions
Reduce isomorphic transitions removed 157 transitions.
Graph (complete) has 2416 edges and 982 vertex of which 973 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.85 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 633 transitions
Trivial Post-agglo rules discarded 633 transitions
Performed 633 trivial Post agglomeration. Transition count delta: 633
Iterating post reduction 0 with 637 rules applied. Total rules applied 639 place count 973 transition count 13766
Reduce places removed 633 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 661 rules applied. Total rules applied 1300 place count 340 transition count 13738
Reduce places removed 14 places and 0 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Iterating post reduction 2 with 48 rules applied. Total rules applied 1348 place count 326 transition count 13704
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 1382 place count 292 transition count 13704
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 1382 place count 292 transition count 13684
Deduced a syphon composed of 20 places in 20 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 1422 place count 272 transition count 13684
Discarding 58 places :
Symmetric choice reduction at 4 with 58 rule applications. Total rules 1480 place count 214 transition count 13626
Iterating global reduction 4 with 58 rules applied. Total rules applied 1538 place count 214 transition count 13626
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 4 with 2 rules applied. Total rules applied 1540 place count 214 transition count 13624
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1541 place count 213 transition count 13624
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 1541 place count 213 transition count 13621
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1547 place count 210 transition count 13621
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1563 place count 194 transition count 1601
Iterating global reduction 6 with 16 rules applied. Total rules applied 1579 place count 194 transition count 1601
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1591 place count 194 transition count 1589
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 3 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 1647 place count 166 transition count 1561
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1653 place count 160 transition count 1555
Iterating global reduction 7 with 6 rules applied. Total rules applied 1659 place count 160 transition count 1555
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 1671 place count 154 transition count 1563
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1673 place count 154 transition count 1561
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 1685 place count 154 transition count 1549
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1687 place count 153 transition count 1555
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1695 place count 153 transition count 1547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1697 place count 152 transition count 1553
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1705 place count 152 transition count 1545
Free-agglomeration rule applied 37 times.
Iterating global reduction 8 with 37 rules applied. Total rules applied 1742 place count 152 transition count 1508
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 8 with 37 rules applied. Total rules applied 1779 place count 115 transition count 1508
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1783 place count 111 transition count 1504
Iterating global reduction 9 with 4 rules applied. Total rules applied 1787 place count 111 transition count 1504
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1789 place count 111 transition count 1502
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 1794 place count 111 transition count 1502
Applied a total of 1794 rules in 2869 ms. Remains 111 /1107 variables (removed 996) and now considering 1502/14564 (removed 13062) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2880 ms. Remains : 111/1107 places, 1502/14564 transitions.
RANDOM walk for 40000 steps (1449 resets) in 1279 ms. (31 steps per ms) remains 5/6 properties
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (194 resets) in 111 ms. (357 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (204 resets) in 109 ms. (363 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (201 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (193 resets) in 108 ms. (367 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (204 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
// Phase 1: matrix 1502 rows 111 cols
[2024-05-29 20:07:14] [INFO ] Computed 8 invariants in 8 ms
[2024-05-29 20:07:14] [INFO ] State equation strengthened by 1375 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 59/71 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 31/102 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1493/1595 variables, 102/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1595 variables, 813/923 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1595 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 11/1606 variables, 5/928 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1606 variables, 562/1490 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1606 variables, 0/1490 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 6/1612 variables, 3/1493 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1612 variables, 0/1493 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/1613 variables, 1/1494 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1613 variables, 0/1494 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/1613 variables, 0/1494 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1613/1613 variables, and 1494 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2116 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 1375/1375 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 59/71 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 20:07:16] [INFO ] Deduced a trap composed of 29 places in 241 ms of which 1 ms to minimize.
[2024-05-29 20:07:16] [INFO ] Deduced a trap composed of 19 places in 293 ms of which 0 ms to minimize.
[2024-05-29 20:07:17] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 1 ms to minimize.
[2024-05-29 20:07:17] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 1 ms to minimize.
[2024-05-29 20:07:17] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 1 ms to minimize.
[2024-05-29 20:07:17] [INFO ] Deduced a trap composed of 22 places in 239 ms of which 1 ms to minimize.
[2024-05-29 20:07:17] [INFO ] Deduced a trap composed of 26 places in 239 ms of which 1 ms to minimize.
[2024-05-29 20:07:18] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 1 ms to minimize.
[2024-05-29 20:07:18] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 0 ms to minimize.
[2024-05-29 20:07:18] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 2 ms to minimize.
Problem StigmergyElection-PT-08b-ReachabilityCardinality-2024-08 is UNSAT
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 10/14 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 31/102 variables, 4/18 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-29 20:07:18] [INFO ] Deduced a trap composed of 17 places in 264 ms of which 0 ms to minimize.
[2024-05-29 20:07:19] [INFO ] Deduced a trap composed of 16 places in 213 ms of which 1 ms to minimize.
[2024-05-29 20:07:19] [INFO ] Deduced a trap composed of 28 places in 179 ms of which 1 ms to minimize.
[2024-05-29 20:07:19] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 4/22 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1493/1595 variables, 102/124 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1595 variables, 813/937 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1595 variables, 4/941 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-29 20:07:20] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 2 ms to minimize.
[2024-05-29 20:07:20] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1595 variables, 2/943 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1595 variables, 0/943 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 11/1606 variables, 5/948 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1606 variables, 562/1510 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-29 20:07:21] [INFO ] Deduced a trap composed of 16 places in 246 ms of which 1 ms to minimize.
[2024-05-29 20:07:21] [INFO ] Deduced a trap composed of 16 places in 261 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1606 variables, 2/1512 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-29 20:07:22] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1606 variables, 1/1513 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1606 variables, 0/1513 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 6/1612 variables, 3/1516 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1612 variables, 0/1516 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 1/1613 variables, 1/1517 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1613 variables, 0/1517 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/1613 variables, 0/1517 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1613/1613 variables, and 1517 constraints, problems are : Problem set: 1 solved, 4 unsolved in 8134 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 1375/1375 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 19/19 constraints]
After SMT, in 10459ms problems are : Problem set: 1 solved, 4 unsolved
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 425 ms.
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 1502/1502 transitions.
Graph (trivial) has 81 edges and 111 vertex of which 16 / 111 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 521 edges and 103 vertex of which 99 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 28 rules applied. Total rules applied 30 place count 99 transition count 1457
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 54 place count 75 transition count 1457
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 54 place count 75 transition count 1454
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 72 transition count 1454
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 69 place count 63 transition count 1445
Iterating global reduction 2 with 9 rules applied. Total rules applied 78 place count 63 transition count 1445
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 78 place count 63 transition count 1444
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 62 transition count 1444
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 60 transition count 1155
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 60 transition count 1155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 60 transition count 1154
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 101 place count 52 transition count 1146
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 107 place count 52 transition count 1140
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 115 place count 44 transition count 1132
Iterating global reduction 4 with 8 rules applied. Total rules applied 123 place count 44 transition count 1132
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 125 place count 43 transition count 1138
Drop transitions (Redundant composition of simpler transitions.) removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 4 with 43 rules applied. Total rules applied 168 place count 43 transition count 1095
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 170 place count 42 transition count 1101
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 178 place count 42 transition count 1093
Free-agglomeration rule applied 14 times with reduction of 178 identical transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 192 place count 42 transition count 901
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 176 transitions
Reduce isomorphic transitions removed 178 transitions.
Iterating post reduction 4 with 192 rules applied. Total rules applied 384 place count 28 transition count 723
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 504 place count 28 transition count 603
Applied a total of 504 rules in 728 ms. Remains 28 /111 variables (removed 83) and now considering 603/1502 (removed 899) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 728 ms. Remains : 28/111 places, 603/1502 transitions.
RANDOM walk for 335 steps (0 resets) in 25 ms. (12 steps per ms) remains 0/3 properties
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_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 31341 ms.

BK_STOP 1717013245749

--------------------
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-08b"
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-08b, 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-171690532100358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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