Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r016-oct2-177944372700183.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5973
Executing tool gold2025
Input is ASLink-PT-01b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-oct2-177944372700183
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 6.9K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Mar 5 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 293K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1779687208006

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-01b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202505121319
[2026-05-25 05:33:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2026-05-25 05:33:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 05:33:29] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2026-05-25 05:33:29] [INFO ] Transformed 846 places.
[2026-05-25 05:33:29] [INFO ] Transformed 1148 transitions.
[2026-05-25 05:33:29] [INFO ] Found NUPN structural information;
[2026-05-25 05:33:29] [INFO ] Parsed PT model containing 846 places and 1148 transitions and 3624 arcs in 261 ms.
Structural test allowed to assert that 96 places are NOT stable. Took 11 ms.
[2026-05-25 05:33:30] [INFO ] Flatten gal took : 227 ms
[2026-05-25 05:33:30] [INFO ] Flatten gal took : 73 ms
RANDOM walk for 40000 steps (239 resets) in 2526 ms. (15 steps per ms) remains 25/750 properties
[2026-05-25 05:33:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5600212443398580881.gal : 55 ms
BEST_FIRST walk for 4003 steps (10 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
[2026-05-25 05:33:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality118668516455664178.prop : 6 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/ReachabilityCardinality5600212443398580881.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality118668516455664178.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4003 steps (9 resets) in 25 ms. (153 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (9 resets) in 33 ms. (117 steps per ms) remains 25/25 properties

its-reach command run as :

BEST_FIRST walk for 4002 steps (9 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
/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 4004 steps (10 resets) in 10 ms. (364 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (9 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (9 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (10 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (10 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (10 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
Loading property file /tmp/ReachabilityCardinality118668516455664178.prop.
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (10 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (10 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (10 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
// Phase 1: matrix 1148 rows 846 cols
[2026-05-25 05:33:31] [INFO ] Computed 82 invariants in 36 ms
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/25 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 25 unsolved
SDD proceeding with computation,25 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,25 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,25 properties remain. new max is 16
SDD size :7 after 13
SDD proceeding with computation,25 properties remain. new max is 32
SDD size :13 after 46
SDD proceeding with computation,25 properties remain. new max is 64
SDD size :46 after 178
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 25 unsolved
SDD proceeding with computation,25 properties remain. new max is 128
SDD size :178 after 571
At refinement iteration 3 (OVERLAPS) 64/89 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 25 unsolved
SDD proceeding with computation,25 properties remain. new max is 256
SDD size :571 after 689
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 64/93 constraints. Problems are: Problem set: 0 solved, 25 unsolved
SDD proceeding with computation,25 properties remain. new max is 512
SDD size :689 after 10045
SDD proceeding with computation,25 properties remain. new max is 1024
SDD size :10045 after 28954
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 182/271 variables, 16/109 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 182/291 constraints. Problems are: Problem set: 0 solved, 25 unsolved
SDD proceeding with computation,25 properties remain. new max is 2048
SDD size :28954 after 435646
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 25 unsolved
SDD proceeding with computation,25 properties remain. new max is 4096
SDD size :435646 after 9.83056e+07
At refinement iteration 9 (OVERLAPS) 560/831 variables, 57/348 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/831 variables, 560/908 constraints. Problems are: Problem set: 0 solved, 25 unsolved
SDD proceeding with computation,25 properties remain. new max is 8192
SDD size :9.83056e+07 after 1.00295e+08
At refinement iteration 11 (INCLUDED_ONLY) 0/831 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (OVERLAPS) 15/846 variables, 5/913 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/846 variables, 15/928 constraints. Problems are: Problem set: 0 solved, 25 unsolved
SDD proceeding with computation,25 properties remain. new max is 16384
SDD size :1.00295e+08 after 1.16726e+08
At refinement iteration 14 (INCLUDED_ONLY) 0/846 variables, 0/928 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 15 (OVERLAPS) 1148/1994 variables, 846/1774 constraints. Problems are: Problem set: 0 solved, 25 unsolved
SDD proceeding with computation,25 properties remain. new max is 32768
SDD size :1.16726e+08 after 1.59208e+08
At refinement iteration 16 (INCLUDED_ONLY) 0/1994 variables, 0/1774 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 17 (OVERLAPS) 0/1994 variables, 0/1774 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1994/1994 variables, and 1774 constraints, problems are : Problem set: 0 solved, 25 unsolved in 4824 ms.
Refiners :[Domain max(s): 846/846 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 846/846 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 64/89 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 64/93 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 182/271 variables, 16/109 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 182/291 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 560/831 variables, 57/348 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/831 variables, 560/908 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:33:37] [INFO ] Deduced a trap composed of 35 places in 419 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:33:37] [INFO ] Deduced a trap composed of 47 places in 365 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:33:38] [INFO ] Deduced a trap composed of 52 places in 331 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:33:38] [INFO ] Deduced a trap composed of 101 places in 394 ms of which 109 ms to minimize.
SDD proceeding with computation,25 properties remain. new max is 65536
SDD size :1.59208e+08 after 1.88343e+09
At refinement iteration 11 (INCLUDED_ONLY) 0/831 variables, 4/912 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 831/1994 variables, and 912 constraints, problems are : Problem set: 0 solved, 25 unsolved in 5018 ms.
Refiners :[Domain max(s): 831/846 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 58/63 constraints, State Equation: 0/846 constraints, PredecessorRefiner: 0/25 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9975ms problems are : Problem set: 0 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 846/846 places, 1148/1148 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 181 transitions
Trivial Post-agglo rules discarded 181 transitions
Performed 181 trivial Post agglomeration. Transition count delta: 181
Iterating post reduction 0 with 181 rules applied. Total rules applied 181 place count 846 transition count 967
Reduce places removed 181 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 191 rules applied. Total rules applied 372 place count 665 transition count 957
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 375 place count 662 transition count 957
Performed 186 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 186 Pre rules applied. Total rules applied 375 place count 662 transition count 771
Deduced a syphon composed of 186 places in 2 ms
Ensure Unique test removed 13 places
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 385 rules applied. Total rules applied 760 place count 463 transition count 771
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 11 rules applied. Total rules applied 771 place count 462 transition count 761
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 781 place count 452 transition count 761
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 781 place count 452 transition count 757
Deduced a syphon composed of 4 places in 2 ms
Ensure Unique test removed 4 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 793 place count 444 transition count 757
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 793 place count 444 transition count 753
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 801 place count 440 transition count 753
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 826 place count 415 transition count 728
Iterating global reduction 5 with 25 rules applied. Total rules applied 851 place count 415 transition count 728
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 852 place count 415 transition count 727
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 852 place count 415 transition count 717
Deduced a syphon composed of 10 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 21 rules applied. Total rules applied 873 place count 404 transition count 717
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 873 place count 404 transition count 716
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 876 place count 402 transition count 716
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 878 place count 400 transition count 701
Iterating global reduction 6 with 2 rules applied. Total rules applied 880 place count 400 transition count 701
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 880 place count 400 transition count 700
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 882 place count 399 transition count 700
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 883 place count 398 transition count 692
Iterating global reduction 6 with 1 rules applied. Total rules applied 884 place count 398 transition count 692
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 885 place count 397 transition count 684
Iterating global reduction 6 with 1 rules applied. Total rules applied 886 place count 397 transition count 684
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 887 place count 396 transition count 676
Iterating global reduction 6 with 1 rules applied. Total rules applied 888 place count 396 transition count 676
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 889 place count 395 transition count 668
Iterating global reduction 6 with 1 rules applied. Total rules applied 890 place count 395 transition count 668
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 891 place count 394 transition count 660
Iterating global reduction 6 with 1 rules applied. Total rules applied 892 place count 394 transition count 660
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 893 place count 393 transition count 652
Iterating global reduction 6 with 1 rules applied. Total rules applied 894 place count 393 transition count 652
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 895 place count 392 transition count 644
Iterating global reduction 6 with 1 rules applied. Total rules applied 896 place count 392 transition count 644
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 897 place count 391 transition count 636
Iterating global reduction 6 with 1 rules applied. Total rules applied 898 place count 391 transition count 636
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 899 place count 390 transition count 628
Iterating global reduction 6 with 1 rules applied. Total rules applied 900 place count 390 transition count 628
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 901 place count 389 transition count 620
Iterating global reduction 6 with 1 rules applied. Total rules applied 902 place count 389 transition count 620
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 903 place count 388 transition count 612
Iterating global reduction 6 with 1 rules applied. Total rules applied 904 place count 388 transition count 612
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 905 place count 387 transition count 604
Iterating global reduction 6 with 1 rules applied. Total rules applied 906 place count 387 transition count 604
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 907 place count 386 transition count 596
Iterating global reduction 6 with 1 rules applied. Total rules applied 908 place count 386 transition count 596
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 909 place count 385 transition count 588
Iterating global reduction 6 with 1 rules applied. Total rules applied 910 place count 385 transition count 588
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 911 place count 384 transition count 580
Iterating global reduction 6 with 1 rules applied. Total rules applied 912 place count 384 transition count 580
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 913 place count 383 transition count 572
Iterating global reduction 6 with 1 rules applied. Total rules applied 914 place count 383 transition count 572
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 996 place count 342 transition count 531
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 997 place count 341 transition count 530
Ensure Unique test removed 1 places
Iterating global reduction 6 with 2 rules applied. Total rules applied 999 place count 340 transition count 530
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1000 place count 339 transition count 529
Iterating global reduction 6 with 1 rules applied. Total rules applied 1001 place count 339 transition count 529
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 6 with 2 rules applied. Total rules applied 1003 place count 339 transition count 527
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1004 place count 338 transition count 527
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1006 place count 337 transition count 536
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1008 place count 337 transition count 534
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1010 place count 335 transition count 534
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1011 place count 334 transition count 533
Reduce places removed 2 places and 0 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 9 with 3 rules applied. Total rules applied 1014 place count 332 transition count 532
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1015 place count 331 transition count 532
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 3 Pre rules applied. Total rules applied 1015 place count 331 transition count 529
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 7 rules applied. Total rules applied 1022 place count 327 transition count 529
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 11 with 2 rules applied. Total rules applied 1024 place count 325 transition count 529
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 1024 place count 325 transition count 528
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1026 place count 324 transition count 528
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 1032 place count 321 transition count 525
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1033 place count 320 transition count 524
Iterating global reduction 12 with 1 rules applied. Total rules applied 1034 place count 320 transition count 524
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1035 place count 320 transition count 523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1036 place count 319 transition count 523
Applied a total of 1036 rules in 496 ms. Remains 319 /846 variables (removed 527) and now considering 523/1148 (removed 625) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 505 ms. Remains : 319/846 places, 523/1148 transitions.
RANDOM walk for 4000000 steps (84670 resets) in 11025 ms. (362 steps per ms) remains 2/25 properties
BEST_FIRST walk for 4000002 steps (37261 resets) in 5161 ms. (774 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000000 steps (36937 resets) in 5213 ms. (767 steps per ms) remains 2/2 properties
// Phase 1: matrix 523 rows 319 cols
[2026-05-25 05:33:48] [INFO ] Computed 56 invariants in 10 ms
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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/47 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 117/164 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 63/227 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/229 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 88/317 variables, 26/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/318 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/319 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/319 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 523/842 variables, 319/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/842 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/842 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 842/842 variables, and 375 constraints, problems are : Problem set: 0 solved, 2 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/47 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 117/164 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 63/227 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/229 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 88/317 variables, 26/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/318 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/319 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/319 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 523/842 variables, 319/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/842 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/842 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/842 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 842/842 variables, and 377 constraints, problems are : Problem set: 0 solved, 2 unsolved in 682 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 953ms problems are : Problem set: 0 solved, 2 unsolved
Invariant property smplace_64 does not hold.
Invariant property smplace_63 does not hold.
SDD proceeding with computation,23 properties remain. new max is 65536
SDD size :1.88343e+09 after 2.30125e+09
Parikh walk visited 0 properties in 1681 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 751 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST DECISION_DIAGRAMS COLLATERAL_PROCESSING TOPOLOGICAL
Total runtime 21156 ms.

BK_STOP 1779687230819

--------------------
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
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="ASLink-PT-01b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2025"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5973"
echo " Executing tool gold2025"
echo " Input is ASLink-PT-01b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r016-oct2-177944372700183"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-01b.tgz
mv ASLink-PT-01b execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;