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.r015-oct2-177944372400026.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 Anderson-PT-11, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r015-oct2-177944372400026
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.6K Mar 4 18:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Mar 4 18:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 4 18:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 4 18:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 15 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Mar 4 18:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 4 18:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 4 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 4 18:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779685476616

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-25 05:04:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 05:04:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 05:04:38] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2026-05-25 05:04:38] [INFO ] Transformed 749 places.
[2026-05-25 05:04:38] [INFO ] Transformed 3245 transitions.
[2026-05-25 05:04:38] [INFO ] Found NUPN structural information;
[2026-05-25 05:04:38] [INFO ] Parsed PT model containing 749 places and 3245 transitions and 12540 arcs in 319 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 3245 rows 749 cols
[2026-05-25 05:04:38] [INFO ] Computed 25 invariants in 107 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 113 ms. (87 steps per ms)
FORMULA Anderson-PT-11-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30001 steps (6 resets) in 122 ms. (243 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-25 05:04:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:04:39] [INFO ] [Real]Absence check using 12 positive place invariants in 32 ms returned sat
[2026-05-25 05:04:39] [INFO ] [Real]Absence check using 12 positive and 13 generalized place invariants in 56 ms returned sat
[2026-05-25 05:04:41] [INFO ] [Real]Absence check using state equation in 1562 ms returned sat
[2026-05-25 05:04:41] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-25 05:04:41] [INFO ] [Real]Added 110 Read/Feed constraints in 61 ms returned sat
[2026-05-25 05:04:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:04:41] [INFO ] [Nat]Absence check using 12 positive place invariants in 32 ms returned sat
[2026-05-25 05:04:41] [INFO ] [Nat]Absence check using 12 positive and 13 generalized place invariants in 32 ms returned sat
[2026-05-25 05:04:43] [INFO ] [Nat]Absence check using state equation in 1581 ms returned sat
[2026-05-25 05:04:43] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 05:04:44] [INFO ] [Nat]Added 110 Read/Feed constraints in 923 ms returned sat
[2026-05-25 05:04:45] [INFO ] Computed and/alt/rep : 132/143/132 causal constraints (skipped 3102 transitions) in 830 ms.
[2026-05-25 05:04:45] [INFO ] Added : 2 causal constraints over 1 iterations in 1552 ms. Result :sat
Minimization took 515 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:04:46] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2026-05-25 05:04:46] [INFO ] [Real]Absence check using 12 positive and 13 generalized place invariants in 100 ms returned sat
[2026-05-25 05:04:48] [INFO ] [Real]Absence check using state equation in 1958 ms returned sat
[2026-05-25 05:04:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:04:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 19 ms returned sat
[2026-05-25 05:04:49] [INFO ] [Nat]Absence check using 12 positive and 13 generalized place invariants in 37 ms returned sat
[2026-05-25 05:04:50] [INFO ] [Nat]Absence check using state equation in 1231 ms returned sat
[2026-05-25 05:04:50] [INFO ] [Nat]Added 110 Read/Feed constraints in 175 ms returned sat
[2026-05-25 05:04:50] [INFO ] Computed and/alt/rep : 132/143/132 causal constraints (skipped 3102 transitions) in 397 ms.
[2026-05-25 05:04:51] [INFO ] Added : 0 causal constraints over 0 iterations in 683 ms. Result :sat
Minimization took 633 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:04:52] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2026-05-25 05:04:52] [INFO ] [Real]Absence check using 12 positive and 13 generalized place invariants in 25 ms returned sat
[2026-05-25 05:04:53] [INFO ] [Real]Absence check using state equation in 1495 ms returned sat
[2026-05-25 05:04:53] [INFO ] [Real]Added 110 Read/Feed constraints in 73 ms returned sat
[2026-05-25 05:04:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:04:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 21 ms returned sat
[2026-05-25 05:04:54] [INFO ] [Nat]Absence check using 12 positive and 13 generalized place invariants in 48 ms returned sat
[2026-05-25 05:04:55] [INFO ] [Nat]Absence check using state equation in 1422 ms returned sat
[2026-05-25 05:04:56] [INFO ] [Nat]Added 110 Read/Feed constraints in 493 ms returned sat
[2026-05-25 05:04:56] [INFO ] Computed and/alt/rep : 132/143/132 causal constraints (skipped 3102 transitions) in 403 ms.
[2026-05-25 05:04:56] [INFO ] Added : 0 causal constraints over 0 iterations in 653 ms. Result :sat
Minimization took 618 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 749 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 749/749 places, 3245/3245 transitions.
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 107 Pre rules applied. Total rules applied 0 place count 749 transition count 3138
Deduced a syphon composed of 107 places in 7 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 0 with 214 rules applied. Total rules applied 214 place count 642 transition count 3138
Discarding 217 places :
Symmetric choice reduction at 0 with 217 rule applications. Total rules 431 place count 425 transition count 721
Iterating global reduction 0 with 217 rules applied. Total rules applied 648 place count 425 transition count 721
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 0 with 6 rules applied. Total rules applied 654 place count 422 transition count 718
Applied a total of 654 rules in 310 ms. Remains 422 /749 variables (removed 327) and now considering 718/3245 (removed 2527) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 337 ms. Remains : 422/749 places, 718/3245 transitions.
// Phase 1: matrix 718 rows 422 cols
[2026-05-25 05:04:57] [INFO ] Computed 25 invariants in 22 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 2013 ms. (496 steps per ms)
BEST_FIRST walk for 3000002 steps (6 resets) in 3074 ms. (975 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-25 05:05:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:03] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2026-05-25 05:05:03] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 11 ms returned sat
[2026-05-25 05:05:03] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2026-05-25 05:05:03] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-25 05:05:03] [INFO ] [Real]Added 110 Read/Feed constraints in 14 ms returned sat
[2026-05-25 05:05:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2026-05-25 05:05:03] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 12 ms returned sat
[2026-05-25 05:05:03] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2026-05-25 05:05:03] [INFO ] [Nat]Added 110 Read/Feed constraints in 13 ms returned sat
[2026-05-25 05:05:03] [INFO ] Computed and/alt/rep : 25/36/25 causal constraints (skipped 682 transitions) in 85 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:04] [INFO ] Deduced a trap composed of 44 places in 322 ms of which 37 ms to minimize.
[2026-05-25 05:05:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 402 ms
[2026-05-25 05:05:04] [INFO ] Added : 2 causal constraints over 1 iterations in 697 ms. Result :sat
Minimization took 618 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:05] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2026-05-25 05:05:05] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 21 ms returned sat
[2026-05-25 05:05:05] [INFO ] [Real]Absence check using state equation in 460 ms returned sat
[2026-05-25 05:05:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2026-05-25 05:05:06] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 22 ms returned sat
[2026-05-25 05:05:06] [INFO ] [Nat]Absence check using state equation in 454 ms returned sat
[2026-05-25 05:05:06] [INFO ] [Nat]Added 110 Read/Feed constraints in 39 ms returned sat
[2026-05-25 05:05:06] [INFO ] Computed and/alt/rep : 25/36/25 causal constraints (skipped 682 transitions) in 81 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:07] [INFO ] Deduced a trap composed of 44 places in 345 ms of which 49 ms to minimize.
[2026-05-25 05:05:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 432 ms
[2026-05-25 05:05:07] [INFO ] Added : 2 causal constraints over 1 iterations in 740 ms. Result :sat
Minimization took 639 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:08] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2026-05-25 05:05:08] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 11 ms returned sat
[2026-05-25 05:05:08] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2026-05-25 05:05:08] [INFO ] [Real]Added 110 Read/Feed constraints in 17 ms returned sat
[2026-05-25 05:05:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2026-05-25 05:05:08] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 10 ms returned sat
[2026-05-25 05:05:08] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2026-05-25 05:05:08] [INFO ] [Nat]Added 110 Read/Feed constraints in 42 ms returned sat
[2026-05-25 05:05:08] [INFO ] Computed and/alt/rep : 25/36/25 causal constraints (skipped 682 transitions) in 47 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:09] [INFO ] Deduced a trap composed of 44 places in 285 ms of which 35 ms to minimize.
[2026-05-25 05:05:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 339 ms
[2026-05-25 05:05:09] [INFO ] Added : 3 causal constraints over 1 iterations in 528 ms. Result :sat
Minimization took 648 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 718/718 transitions.
Applied a total of 0 rules in 39 ms. Remains 422 /422 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 422/422 places, 718/718 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 718/718 transitions.
Applied a total of 0 rules in 23 ms. Remains 422 /422 variables (removed 0) and now considering 718/718 (removed 0) transitions.
[2026-05-25 05:05:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:05:10] [INFO ] Implicit Places using invariants in 855 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 860 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 421/422 places, 718/718 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 421 transition count 597
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 300 transition count 597
Applied a total of 242 rules in 36 ms. Remains 300 /421 variables (removed 121) and now considering 597/718 (removed 121) transitions.
// Phase 1: matrix 597 rows 300 cols
[2026-05-25 05:05:11] [INFO ] Computed 24 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:05:11] [INFO ] Implicit Places using invariants in 339 ms returned []
[2026-05-25 05:05:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:05:11] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-25 05:05:12] [INFO ] Implicit Places using invariants and state equation in 1408 ms returned []
Implicit Place search using SMT with State Equation took 1764 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 300/422 places, 597/718 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2701 ms. Remains : 300/422 places, 597/718 transitions.
[2026-05-25 05:05:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1362 ms. (733 steps per ms)
FORMULA Anderson-PT-11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 681 ms. (1466 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-25 05:05:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:14] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2026-05-25 05:05:14] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 12 ms returned sat
[2026-05-25 05:05:15] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2026-05-25 05:05:15] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-25 05:05:15] [INFO ] [Real]Added 110 Read/Feed constraints in 47 ms returned sat
[2026-05-25 05:05:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2026-05-25 05:05:15] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 21 ms returned sat
[2026-05-25 05:05:15] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2026-05-25 05:05:15] [INFO ] [Nat]Added 110 Read/Feed constraints in 35 ms returned sat
[2026-05-25 05:05:15] [INFO ] Computed and/alt/rep : 25/36/25 causal constraints (skipped 561 transitions) in 44 ms.
[2026-05-25 05:05:15] [INFO ] Added : 0 causal constraints over 0 iterations in 99 ms. Result :sat
Minimization took 262 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 300 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p1_2_20) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 596/596 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 298 transition count 594
Applied a total of 4 rules in 30 ms. Remains 298 /300 variables (removed 2) and now considering 594/596 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 298/300 places, 594/596 transitions.
// Phase 1: matrix 594 rows 298 cols
[2026-05-25 05:05:16] [INFO ] Computed 24 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 1334 ms. (749 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 663 ms. (1506 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-25 05:05:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:18] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2026-05-25 05:05:18] [INFO ] [Real]Absence check using 12 positive and 12 generalized place invariants in 33 ms returned sat
[2026-05-25 05:05:18] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2026-05-25 05:05:18] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-25 05:05:18] [INFO ] [Real]Added 110 Read/Feed constraints in 29 ms returned sat
[2026-05-25 05:05:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:18] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2026-05-25 05:05:18] [INFO ] [Nat]Absence check using 12 positive and 12 generalized place invariants in 24 ms returned sat
[2026-05-25 05:05:19] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2026-05-25 05:05:19] [INFO ] [Nat]Added 110 Read/Feed constraints in 18 ms returned sat
[2026-05-25 05:05:19] [INFO ] Computed and/alt/rep : 22/33/22 causal constraints (skipped 561 transitions) in 36 ms.
[2026-05-25 05:05:19] [INFO ] Added : 0 causal constraints over 0 iterations in 89 ms. Result :sat
Minimization took 291 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 594/594 transitions.
Applied a total of 0 rules in 34 ms. Remains 298 /298 variables (removed 0) and now considering 594/594 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 298/298 places, 594/594 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 594/594 transitions.
Applied a total of 0 rules in 9 ms. Remains 298 /298 variables (removed 0) and now considering 594/594 (removed 0) transitions.
[2026-05-25 05:05:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:05:20] [INFO ] Implicit Places using invariants in 532 ms returned []
[2026-05-25 05:05:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:05:20] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-25 05:05:21] [INFO ] Implicit Places using invariants and state equation in 1351 ms returned []
Implicit Place search using SMT with State Equation took 1893 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 05:05:21] [INFO ] Redundant transitions in 60 ms returned []
Running 583 sub problems to find dead transitions.
[2026-05-25 05:05:21] [INFO ] Invariant cache hit.
[2026-05-25 05:05:21] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 3 (OVERLAPS) 1/297 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:42] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:43] [INFO ] Deduced a trap composed of 44 places in 233 ms of which 17 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 297/892 variables, and 25 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/12 constraints, State Equation: 0/298 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 583/583 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 583 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 4 (OVERLAPS) 1/297 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:06:16] [INFO ] Deduced a trap composed of 54 places in 270 ms of which 26 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 297/892 variables, and 26 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/12 constraints, State Equation: 0/298 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/583 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60539ms problems are : Problem set: 0 solved, 583 unsolved
Search for dead transitions found 0 dead transitions in 60561ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62552 ms. Remains : 298/298 places, 594/594 transitions.
RANDOM walk for 40000 steps (8 resets) in 927 ms. (43 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 262 ms. (152 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 249 ms. (160 steps per ms) remains 2/2 properties
[2026-05-25 05:06:22] [INFO ] Flatten gal took : 124 ms
[2026-05-25 05:06:22] [INFO ] Flatten gal took : 50 ms
[2026-05-25 05:06:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1757945637137960356.gal : 34 ms
[2026-05-25 05:06:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality896072563578405129.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1757945637137960356.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality896072563578405129.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality896072563578405129.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 10
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :10 after 13
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :13 after 16
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :16 after 28
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :28 after 63
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :63 after 389
Finished probabilistic random walk after 158938 steps, run visited all 2 properties in 1250 ms. (steps per millisecond=127 )
Probabilistic random walk after 158938 steps, saw 124142 distinct states, run finished after 1253 ms. (steps per millisecond=126 ) properties seen :2
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA Anderson-PT-11-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 105579 ms.

BK_STOP 1779685583977

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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="Anderson-PT-11"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is Anderson-PT-11, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r015-oct2-177944372400026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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