Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490600030.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is StigmergyCommit-PT-03b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903490600030
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 359K May 29 14:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2025-00
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2025-01
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2025-02
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2025-03
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2025-04
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2025-05
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2025-06
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2025-07
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2025-08
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2025-09
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2025-10
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2025-11
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2025-12
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2025-13
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2025-14
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749056449730

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-04 17:00:52] [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]
[2025-06-04 17:00:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 17:00:52] [INFO ] Load time of PNML (sax parser for PT used): 319 ms
[2025-06-04 17:00:52] [INFO ] Transformed 1231 places.
[2025-06-04 17:00:52] [INFO ] Transformed 1476 transitions.
[2025-06-04 17:00:52] [INFO ] Found NUPN structural information;
[2025-06-04 17:00:53] [INFO ] Parsed PT model containing 1231 places and 1476 transitions and 4168 arcs in 567 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (512 resets) in 2583 ms. (15 steps per ms) remains 10/12 properties
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (111 resets) in 481 ms. (82 steps per ms) remains 10/10 properties
[2025-06-04 17:00:54] [INFO ] Flatten gal took : 307 ms
BEST_FIRST walk for 40004 steps (109 resets) in 450 ms. (88 steps per ms) remains 10/10 properties
[2025-06-04 17:00:54] [INFO ] Flatten gal took : 193 ms
BEST_FIRST walk for 40004 steps (106 resets) in 611 ms. (65 steps per ms) remains 10/10 properties
[2025-06-04 17:00:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6284773386937367075.gal : 141 ms
BEST_FIRST walk for 40003 steps (108 resets) in 344 ms. (115 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (107 resets) in 190 ms. (209 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (111 resets) in 165 ms. (240 steps per ms) remains 10/10 properties
[2025-06-04 17:00:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality808462233157159591.prop : 4 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6284773386937367075.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality808462233157159591.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
BEST_FIRST walk for 40004 steps (109 resets) in 161 ms. (246 steps per ms) remains 9/10 properties
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (110 resets) in 245 ms. (162 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (109 resets) in 149 ms. (266 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (101 resets) in 219 ms. (181 steps per ms) remains 9/9 properties
Loading property file /tmp/ReachabilityCardinality808462233157159591.prop.
// Phase 1: matrix 1476 rows 1231 cols
[2025-06-04 17:00:55] [INFO ] Computed 5 invariants in 44 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1105/1231 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1231 variables, 1105/1236 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :7 after 11
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :11 after 16
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :16 after 19
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :19 after 22
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :22 after 99
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :99 after 119
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :119 after 176
At refinement iteration 4 (INCLUDED_ONLY) 0/1231 variables, 0/1236 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :176 after 5681
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :5681 after 119571
Invariant property StigmergyCommit-PT-03b-ReachabilityCardinality-2025-01 does not hold.
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :119571 after 165294
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :165294 after 197125
At refinement iteration 5 (OVERLAPS) 1476/2707 variables, 1231/2467 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2707 variables, 0/2467 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/2707 variables, 0/2467 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2707/2707 variables, and 2467 constraints, problems are : Problem set: 1 solved, 8 unsolved in 3755 ms.
Refiners :[Domain max(s): 1231/1231 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 1231/1231 constraints, PredecessorRefiner: 9/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :197125 after 4.08348e+06
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem StigmergyCommit-PT-03b-ReachabilityCardinality-2025-12 is UNSAT
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2025-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1107/1231 variables, 5/129 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1231 variables, 1107/1236 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:01] [INFO ] Deduced a trap composed of 397 places in 1790 ms of which 682 ms to minimize.
SDD proceeding with computation,9 properties remain. new max is 32768
SDD size :4.08348e+06 after 4.9388e+08
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:03] [INFO ] Deduced a trap composed of 397 places in 1742 ms of which 648 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:04] [INFO ] Deduced a trap composed of 397 places in 835 ms of which 89 ms to minimize.
SMT process timed out in 9412ms, After SMT, problems are : Problem set: 2 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 106 out of 1231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1231/1231 places, 1476/1476 transitions.
Graph (trivial) has 1008 edges and 1231 vertex of which 43 / 1231 are part of one of the 7 SCC in 12 ms
Free SCC test removed 36 places
Drop transitions (Empty/Sink Transition effects.) removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Graph (complete) has 1691 edges and 1195 vertex of which 1190 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.10 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 727 transitions
Trivial Post-agglo rules discarded 727 transitions
Performed 727 trivial Post agglomeration. Transition count delta: 727
Iterating post reduction 0 with 729 rules applied. Total rules applied 731 place count 1190 transition count 699
Reduce places removed 727 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 737 rules applied. Total rules applied 1468 place count 463 transition count 689
Reduce places removed 5 places and 0 transitions.
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Iterating post reduction 2 with 74 rules applied. Total rules applied 1542 place count 458 transition count 620
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 70 rules applied. Total rules applied 1612 place count 389 transition count 619
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1612 place count 389 transition count 573
Deduced a syphon composed of 46 places in 2 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1704 place count 343 transition count 573
Discarding 41 places :
Symmetric choice reduction at 4 with 41 rule applications. Total rules 1745 place count 302 transition count 532
Iterating global reduction 4 with 41 rules applied. Total rules applied 1786 place count 302 transition count 532
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1787 place count 302 transition count 531
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1787 place count 302 transition count 529
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1791 place count 300 transition count 529
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1802 place count 289 transition count 403
Iterating global reduction 5 with 11 rules applied. Total rules applied 1813 place count 289 transition count 403
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1814 place count 289 transition count 402
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1846 place count 273 transition count 386
Performed 4 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1854 place count 269 transition count 394
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1855 place count 269 transition count 393
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 1861 place count 269 transition count 387
Free-agglomeration rule applied 41 times.
Iterating global reduction 7 with 41 rules applied. Total rules applied 1902 place count 269 transition count 346
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 7 with 41 rules applied. Total rules applied 1943 place count 228 transition count 346
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 8 with 20 rules applied. Total rules applied 1963 place count 228 transition count 326
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1966 place count 228 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1967 place count 228 transition count 325
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1968 place count 228 transition count 325
Applied a total of 1968 rules in 639 ms. Remains 228 /1231 variables (removed 1003) and now considering 325/1476 (removed 1151) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 657 ms. Remains : 228/1231 places, 325/1476 transitions.
RANDOM walk for 40000 steps (2332 resets) in 732 ms. (54 steps per ms) remains 5/7 properties
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (397 resets) in 196 ms. (203 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (402 resets) in 172 ms. (231 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (411 resets) in 108 ms. (367 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (401 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (400 resets) in 212 ms. (187 steps per ms) remains 5/5 properties
// Phase 1: matrix 325 rows 228 cols
[2025-06-04 17:01:05] [INFO ] Computed 4 invariants in 12 ms
[2025-06-04 17:01:05] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 116/187 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 294/481 variables, 187/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 44/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 41/522 variables, 21/256 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 7/263 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/522 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 22/544 variables, 14/277 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/544 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/544 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 6/550 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/550 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/550 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 3/553 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/553 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/553 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 287 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1576 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 228/228 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 116/187 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:07] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:07] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:07] [INFO ] Deduced a trap composed of 70 places in 154 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:07] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 7 ms to minimize.
Problem StigmergyCommit-PT-03b-ReachabilityCardinality-2025-10 is UNSAT
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2025-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 4/8 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 294/481 variables, 187/195 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 44/239 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 1/240 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 0/240 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 41/522 variables, 21/261 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/522 variables, 7/268 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/522 variables, 3/271 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/522 variables, 0/271 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 22/544 variables, 14/285 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/544 variables, 3/288 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/544 variables, 0/288 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 6/550 variables, 4/292 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/550 variables, 1/293 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/550 variables, 0/293 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 3/553 variables, 2/295 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/553 variables, 0/295 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/553 variables, 0/295 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 295 constraints, problems are : Problem set: 1 solved, 4 unsolved in 2617 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 228/228 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4268ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2025-03 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 288 ms.
Support contains 29 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 325/325 transitions.
Graph (trivial) has 147 edges and 228 vertex of which 10 / 228 are part of one of the 4 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 486 edges and 222 vertex of which 221 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 221 transition count 242
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 142 place count 154 transition count 237
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 147 place count 153 transition count 233
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 151 place count 149 transition count 233
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 151 place count 149 transition count 225
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 167 place count 141 transition count 225
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 179 place count 129 transition count 213
Iterating global reduction 4 with 12 rules applied. Total rules applied 191 place count 129 transition count 213
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 195 place count 125 transition count 209
Iterating global reduction 4 with 4 rules applied. Total rules applied 199 place count 125 transition count 209
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 200 place count 124 transition count 208
Iterating global reduction 4 with 1 rules applied. Total rules applied 201 place count 124 transition count 208
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 215 place count 117 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 217 place count 117 transition count 199
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 225 place count 109 transition count 184
Iterating global reduction 5 with 8 rules applied. Total rules applied 233 place count 109 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 234 place count 109 transition count 183
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 239 place count 104 transition count 178
Iterating global reduction 6 with 5 rules applied. Total rules applied 244 place count 104 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 245 place count 104 transition count 177
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 247 place count 102 transition count 175
Iterating global reduction 7 with 2 rules applied. Total rules applied 249 place count 102 transition count 175
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 7 with 2 rules applied. Total rules applied 251 place count 101 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 260 place count 101 transition count 166
Free-agglomeration rule applied 17 times with reduction of 8 identical transitions.
Iterating global reduction 7 with 17 rules applied. Total rules applied 277 place count 101 transition count 141
Reduce places removed 17 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 295 place count 84 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 299 place count 84 transition count 136
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 302 place count 84 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 303 place count 84 transition count 135
Applied a total of 303 rules in 76 ms. Remains 84 /228 variables (removed 144) and now considering 135/325 (removed 190) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 84/228 places, 135/325 transitions.
RANDOM walk for 34235 steps (598 resets) in 235 ms. (145 steps per ms) remains 0/3 properties
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2025-04 TRUE 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 18077 ms.

BK_STOP 1749056470500

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="StigmergyCommit-PT-03b"
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-5832"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-03b, 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 r226-smll-174903490600030"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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