Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490600046.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-04b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903490600046
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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 138K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K 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 627K 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-04b-ReachabilityCardinality-2025-00
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2025-01
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2025-02
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2025-03
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2025-04
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2025-05
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2025-06
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2025-07
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2025-08
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2025-09
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2025-10
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2025-11
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2025-12
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2025-13
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2025-14
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749062415195

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-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-04 18:40:17] [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 18:40:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 18:40:18] [INFO ] Load time of PNML (sax parser for PT used): 327 ms
[2025-06-04 18:40:18] [INFO ] Transformed 1534 places.
[2025-06-04 18:40:18] [INFO ] Transformed 2136 transitions.
[2025-06-04 18:40:18] [INFO ] Found NUPN structural information;
[2025-06-04 18:40:18] [INFO ] Parsed PT model containing 1534 places and 2136 transitions and 8601 arcs in 509 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 33 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (417 resets) in 2897 ms. (13 steps per ms) remains 11/14 properties
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (76 resets) in 581 ms. (68 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (88 resets) in 529 ms. (75 steps per ms) remains 11/11 properties
[2025-06-04 18:40:19] [INFO ] Flatten gal took : 537 ms
BEST_FIRST walk for 40004 steps (76 resets) in 164 ms. (242 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (78 resets) in 744 ms. (53 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (77 resets) in 170 ms. (233 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (76 resets) in 188 ms. (211 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (74 resets) in 148 ms. (268 steps per ms) remains 11/11 properties
[2025-06-04 18:40:20] [INFO ] Flatten gal took : 407 ms
BEST_FIRST walk for 40004 steps (77 resets) in 149 ms. (266 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (65 resets) in 129 ms. (307 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (77 resets) in 222 ms. (179 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (76 resets) in 215 ms. (185 steps per ms) remains 11/11 properties
[2025-06-04 18:40:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12493670655049590151.gal : 161 ms
[2025-06-04 18:40:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2519549537423551810.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/ReachabilityCardinality12493670655049590151.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2519549537423551810.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 ...329
// Phase 1: matrix 2136 rows 1534 cols
[2025-06-04 18:40:20] [INFO ] Computed 6 invariants in 71 ms
Excessive predecessor constraint size, skipping predecessor.
Loading property file /tmp/ReachabilityCardinality2519549537423551810.prop.
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/116 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 1418/1534 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1534 variables, 1418/1540 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1534 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :7 after 10
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :10 after 12
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :12 after 17
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :17 after 19
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :19 after 192
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :192 after 999
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :999 after 1094
At refinement iteration 5 (OVERLAPS) 2136/3670 variables, 1534/3074 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :1094 after 2372
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :2372 after 11199
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :11199 after 1.10618e+06
At refinement iteration 6 (INCLUDED_ONLY) 0/3670 variables, 0/3074 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3670/3670 variables, and 3074 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5084 ms.
Refiners :[Domain max(s): 1534/1534 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 1534/1534 constraints, PredecessorRefiner: 11/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem StigmergyCommit-PT-04b-ReachabilityCardinality-2025-13 is UNSAT
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2025-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1418/1534 variables, 6/122 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1534 variables, 1418/1540 constraints. Problems are: Problem set: 1 solved, 10 unsolved
SDD proceeding with computation,11 properties remain. new max is 16384
SDD size :1.10618e+06 after 1.10518e+07
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:40:29] [INFO ] Deduced a trap composed of 205 places in 2366 ms of which 549 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,11 properties remain. new max is 32768
SDD size :1.10518e+07 after 1.58702e+07
[2025-06-04 18:40:31] [INFO ] Deduced a trap composed of 396 places in 1707 ms of which 659 ms to minimize.
SMT process timed out in 10602ms, After SMT, problems are : Problem set: 1 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 107 out of 1534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1534/1534 places, 2136/2136 transitions.
Graph (trivial) has 1326 edges and 1534 vertex of which 63 / 1534 are part of one of the 10 SCC in 12 ms
Free SCC test removed 53 places
Drop transitions (Empty/Sink Transition effects.) removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Graph (complete) has 2208 edges and 1481 vertex of which 1473 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.13 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 953 transitions
Trivial Post-agglo rules discarded 953 transitions
Performed 953 trivial Post agglomeration. Transition count delta: 953
Iterating post reduction 0 with 956 rules applied. Total rules applied 958 place count 1473 transition count 1108
Reduce places removed 953 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 971 rules applied. Total rules applied 1929 place count 520 transition count 1090
Reduce places removed 7 places and 0 transitions.
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Iterating post reduction 2 with 88 rules applied. Total rules applied 2017 place count 513 transition count 1009
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 3 with 81 rules applied. Total rules applied 2098 place count 432 transition count 1009
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 2098 place count 432 transition count 951
Deduced a syphon composed of 58 places in 3 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 2214 place count 374 transition count 951
Discarding 44 places :
Symmetric choice reduction at 4 with 44 rule applications. Total rules 2258 place count 330 transition count 907
Iterating global reduction 4 with 44 rules applied. Total rules applied 2302 place count 330 transition count 907
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 2304 place count 330 transition count 905
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2305 place count 329 transition count 905
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2305 place count 329 transition count 904
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2307 place count 328 transition count 904
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2321 place count 314 transition count 545
Iterating global reduction 6 with 14 rules applied. Total rules applied 2335 place count 314 transition count 545
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 2340 place count 314 transition count 540
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2342 place count 312 transition count 538
Iterating global reduction 7 with 2 rules applied. Total rules applied 2344 place count 312 transition count 538
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2346 place count 310 transition count 536
Iterating global reduction 7 with 2 rules applied. Total rules applied 2348 place count 310 transition count 536
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2349 place count 310 transition count 535
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 8 with 42 rules applied. Total rules applied 2391 place count 289 transition count 514
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2392 place count 289 transition count 513
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2395 place count 286 transition count 510
Iterating global reduction 9 with 3 rules applied. Total rules applied 2398 place count 286 transition count 510
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2399 place count 285 transition count 509
Iterating global reduction 9 with 1 rules applied. Total rules applied 2400 place count 285 transition count 509
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 2408 place count 281 transition count 513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2409 place count 281 transition count 512
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 2413 place count 281 transition count 508
Free-agglomeration rule applied 42 times.
Iterating global reduction 10 with 42 rules applied. Total rules applied 2455 place count 281 transition count 466
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 10 with 42 rules applied. Total rules applied 2497 place count 239 transition count 466
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 2499 place count 237 transition count 464
Iterating global reduction 11 with 2 rules applied. Total rules applied 2501 place count 237 transition count 464
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 11 with 26 rules applied. Total rules applied 2527 place count 237 transition count 438
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 2529 place count 237 transition count 438
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 2530 place count 237 transition count 437
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 2531 place count 237 transition count 437
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2532 place count 236 transition count 436
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 11 with 17 rules applied. Total rules applied 2549 place count 235 transition count 420
Reduce places removed 16 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 12 with 27 rules applied. Total rules applied 2576 place count 219 transition count 409
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 13 with 11 rules applied. Total rules applied 2587 place count 208 transition count 409
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 6 Pre rules applied. Total rules applied 2587 place count 208 transition count 403
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 14 with 12 rules applied. Total rules applied 2599 place count 202 transition count 403
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 14 with 16 rules applied. Total rules applied 2615 place count 194 transition count 395
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 2618 place count 194 transition count 392
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 2620 place count 192 transition count 344
Iterating global reduction 15 with 2 rules applied. Total rules applied 2622 place count 192 transition count 344
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 15 with 2 rules applied. Total rules applied 2624 place count 191 transition count 350
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 15 with 25 rules applied. Total rules applied 2649 place count 191 transition count 325
Free-agglomeration rule applied 7 times.
Iterating global reduction 15 with 7 rules applied. Total rules applied 2656 place count 191 transition count 318
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 2663 place count 184 transition count 318
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 2666 place count 184 transition count 315
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 2668 place count 184 transition count 315
Applied a total of 2668 rules in 894 ms. Remains 184 /1534 variables (removed 1350) and now considering 315/2136 (removed 1821) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 906 ms. Remains : 184/1534 places, 315/2136 transitions.
RANDOM walk for 40000 steps (1404 resets) in 975 ms. (40 steps per ms) remains 7/10 properties
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (244 resets) in 362 ms. (110 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (241 resets) in 310 ms. (128 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (248 resets) in 263 ms. (151 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (235 resets) in 333 ms. (119 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (232 resets) in 271 ms. (147 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (248 resets) in 72 ms. (548 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (238 resets) in 57 ms. (689 steps per ms) remains 7/7 properties
// Phase 1: matrix 315 rows 184 cols
[2025-06-04 18:40:32] [INFO ] Computed 4 invariants in 2 ms
[2025-06-04 18:40:32] [INFO ] State equation strengthened by 63 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/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 82/161 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 299/460 variables, 161/165 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 35/200 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 29/489 variables, 15/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 28/243 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 9/498 variables, 7/250 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/499 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/499 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/499 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 251 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2597 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 82/161 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:40:35] [INFO ] Deduced a trap composed of 36 places in 198 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:40:36] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:40:36] [INFO ] Deduced a trap composed of 45 places in 186 ms of which 24 ms to minimize.
Problem StigmergyCommit-PT-04b-ReachabilityCardinality-2025-00 is UNSAT
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2025-00 FALSE TECHNIQUES SMT_REFINEMENT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,11 properties remain. new max is 65536
SDD size :1.58702e+07 after 9.37797e+08
[2025-06-04 18:40:36] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:40:36] [INFO ] Deduced a trap composed of 38 places in 201 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:40:36] [INFO ] Deduced a trap composed of 39 places in 212 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:40:37] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:40:37] [INFO ] Deduced a trap composed of 57 places in 172 ms of which 29 ms to minimize.
Problem StigmergyCommit-PT-04b-ReachabilityCardinality-2025-03 is UNSAT
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2025-03 TRUE TECHNIQUES SMT_REFINEMENT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:40:37] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:40:37] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 5 ms to minimize.
Problem StigmergyCommit-PT-04b-ReachabilityCardinality-2025-09 is UNSAT
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2025-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 10/14 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 299/460 variables, 161/175 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 35/210 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 2/212 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 0/212 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 29/489 variables, 15/227 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/489 variables, 28/255 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 2/257 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/489 variables, 0/257 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 9/498 variables, 7/264 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/498 variables, 0/264 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/499 variables, 1/265 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/499 variables, 0/265 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/499 variables, 0/265 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 265 constraints, problems are : Problem set: 3 solved, 4 unsolved in 4014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 4/7 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6655ms problems are : Problem set: 3 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2025-15 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2025-02 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2025-01 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 1396 steps, including 73 resets, run visited all 1 properties in 9 ms. (steps per millisecond=155 )
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2025-06 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 96 ms.
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 22000 ms.

BK_STOP 1749062439737

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

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