Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r351-smll-178021502100055.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool gold2025
Input is FileSystem-PT-N03I10B08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-smll-178021502100055
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 8.2K May 27 10:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 27 10:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 27 10:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 27 10:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Jun 16 12:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 16 12:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 16 12:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 16 12:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 16K May 27 10:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K May 27 10:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 27 10:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K May 27 10:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 16 12:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 16 12:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 10 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 191K Jun 10 11:57 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 FileSystem-PT-N03I10B08-UpperBounds-00
FORMULA_NAME FileSystem-PT-N03I10B08-UpperBounds-01
FORMULA_NAME FileSystem-PT-N03I10B08-UpperBounds-02
FORMULA_NAME FileSystem-PT-N03I10B08-UpperBounds-03
FORMULA_NAME FileSystem-PT-N03I10B08-UpperBounds-04
FORMULA_NAME FileSystem-PT-N03I10B08-UpperBounds-05
FORMULA_NAME FileSystem-PT-N03I10B08-UpperBounds-06
FORMULA_NAME FileSystem-PT-N03I10B08-UpperBounds-07
FORMULA_NAME FileSystem-PT-N03I10B08-UpperBounds-08
FORMULA_NAME FileSystem-PT-N03I10B08-UpperBounds-09
FORMULA_NAME FileSystem-PT-N03I10B08-UpperBounds-10
FORMULA_NAME FileSystem-PT-N03I10B08-UpperBounds-11
FORMULA_NAME FileSystem-PT-N03I10B08-UpperBounds-12
FORMULA_NAME FileSystem-PT-N03I10B08-UpperBounds-13
FORMULA_NAME FileSystem-PT-N03I10B08-UpperBounds-14
FORMULA_NAME FileSystem-PT-N03I10B08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1781615003963

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FileSystem-PT-N03I10B08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-06-16 13:03:26] [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-06-16 13:03:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-16 13:03:26] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2026-06-16 13:03:26] [INFO ] Transformed 455 places.
[2026-06-16 13:03:26] [INFO ] Transformed 420 transitions.
[2026-06-16 13:03:26] [INFO ] Parsed PT model containing 455 places and 420 transitions and 1490 arcs in 445 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Reduce places removed 10 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 420 rows 445 cols
[2026-06-16 13:03:26] [INFO ] Computed 35 invariants in 60 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 391, 1, 1]
FORMULA FileSystem-PT-N03I10B08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2 resets) in 87 ms. (113 steps per ms)
FORMULA FileSystem-PT-N03I10B08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N03I10B08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N03I10B08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N03I10B08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N03I10B08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N03I10B08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N03I10B08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N03I10B08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N03I10B08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N03I10B08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30002 steps (6 resets) in 62 ms. (476 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1] Max Struct:[1, 1, 391]
[2026-06-16 13:03:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:03:27] [INFO ] [Real]Absence check using 27 positive place invariants in 51 ms returned sat
[2026-06-16 13:03:27] [INFO ] [Real]Absence check using 27 positive and 8 generalized place invariants in 10 ms returned sat
[2026-06-16 13:03:28] [INFO ] [Real]Absence check using state equation in 506 ms returned sat
[2026-06-16 13:03:28] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:03:28] [INFO ] [Real]Added 80 Read/Feed constraints in 61 ms returned sat
[2026-06-16 13:03:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:03:28] [INFO ] [Nat]Absence check using 27 positive place invariants in 41 ms returned sat
[2026-06-16 13:03:28] [INFO ] [Nat]Absence check using 27 positive and 8 generalized place invariants in 10 ms returned sat
[2026-06-16 13:03:29] [INFO ] [Nat]Absence check using state equation in 424 ms returned sat
[2026-06-16 13:03:29] [INFO ] [Nat]Added 80 Read/Feed constraints in 142 ms returned sat
[2026-06-16 13:03:29] [INFO ] Computed and/alt/rep : 330/340/330 causal constraints (skipped 80 transitions) in 76 ms.
[2026-06-16 13:03:30] [INFO ] Added : 61 causal constraints over 13 iterations in 879 ms. Result :sat
Minimization took 524 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:03:30] [INFO ] [Real]Absence check using 27 positive place invariants in 38 ms returned sat
[2026-06-16 13:03:30] [INFO ] [Real]Absence check using 27 positive and 8 generalized place invariants in 9 ms returned sat
[2026-06-16 13:03:31] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2026-06-16 13:03:31] [INFO ] [Real]Added 80 Read/Feed constraints in 50 ms returned sat
[2026-06-16 13:03:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:03:31] [INFO ] [Nat]Absence check using 27 positive place invariants in 35 ms returned sat
[2026-06-16 13:03:31] [INFO ] [Nat]Absence check using 27 positive and 8 generalized place invariants in 8 ms returned sat
[2026-06-16 13:03:32] [INFO ] [Nat]Absence check using state equation in 380 ms returned sat
[2026-06-16 13:03:32] [INFO ] [Nat]Added 80 Read/Feed constraints in 155 ms returned sat
[2026-06-16 13:03:32] [INFO ] Computed and/alt/rep : 330/340/330 causal constraints (skipped 80 transitions) in 59 ms.
[2026-06-16 13:03:33] [INFO ] Added : 72 causal constraints over 15 iterations in 1327 ms. Result :sat
Minimization took 510 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:03:34] [INFO ] [Real]Absence check using 27 positive place invariants in 42 ms returned sat
[2026-06-16 13:03:34] [INFO ] [Real]Absence check using 27 positive and 8 generalized place invariants in 10 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1] Max Struct:[1, 1, 1]
FORMULA FileSystem-PT-N03I10B08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 420/420 transitions.
Graph (complete) has 998 edges and 445 vertex of which 365 are kept as prefixes of interest. Removing 80 places using SCC suffix rule.6 ms
Discarding 80 places :
Also discarding 0 output transitions
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 0 with 10 rules applied. Total rules applied 11 place count 365 transition count 410
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 355 transition count 410
Discarding 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 92 place count 284 transition count 339
Iterating global reduction 2 with 71 rules applied. Total rules applied 163 place count 284 transition count 339
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 3 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 337 place count 197 transition count 252
Free-agglomeration rule (complex) applied 80 times.
Iterating global reduction 2 with 80 rules applied. Total rules applied 417 place count 197 transition count 172
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 2 with 87 rules applied. Total rules applied 504 place count 110 transition count 172
Applied a total of 504 rules in 259 ms. Remains 110 /445 variables (removed 335) and now considering 172/420 (removed 248) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 289 ms. Remains : 110/445 places, 172/420 transitions.
// Phase 1: matrix 172 rows 110 cols
[2026-06-16 13:03:34] [INFO ] Computed 11 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1270 ms. (786 steps per ms)
BEST_FIRST walk for 2000001 steps (4 resets) in 1111 ms. (1798 steps per ms)
FORMULA FileSystem-PT-N03I10B08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-06-16 13:03:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:03:37] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-06-16 13:03:37] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2026-06-16 13:03:37] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:03:37] [INFO ] [Real]Added 80 Read/Feed constraints in 14 ms returned sat
[2026-06-16 13:03:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:03:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-06-16 13:03:37] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2026-06-16 13:03:37] [INFO ] [Nat]Added 80 Read/Feed constraints in 20 ms returned sat
[2026-06-16 13:03:37] [INFO ] Computed and/alt/rep : 82/92/82 causal constraints (skipped 80 transitions) in 30 ms.
[2026-06-16 13:03:37] [INFO ] Added : 8 causal constraints over 2 iterations in 102 ms. Result :sat
Minimization took 98 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 110 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place endloop_4_13) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 171/171 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 109 transition count 170
Applied a total of 2 rules in 20 ms. Remains 109 /110 variables (removed 1) and now considering 170/171 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 109/110 places, 170/171 transitions.
// Phase 1: matrix 170 rows 109 cols
[2026-06-16 13:03:37] [INFO ] Computed 11 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 1019 ms. (980 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 321 ms. (3105 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-06-16 13:03:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:03:38] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-06-16 13:03:39] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2026-06-16 13:03:39] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:03:39] [INFO ] [Real]Added 80 Read/Feed constraints in 17 ms returned sat
[2026-06-16 13:03:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:03:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-06-16 13:03:39] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2026-06-16 13:03:39] [INFO ] [Nat]Added 80 Read/Feed constraints in 19 ms returned sat
[2026-06-16 13:03:39] [INFO ] Computed and/alt/rep : 80/90/80 causal constraints (skipped 80 transitions) in 29 ms.
[2026-06-16 13:03:39] [INFO ] Added : 8 causal constraints over 2 iterations in 95 ms. Result :sat
Minimization took 113 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 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 170/170 transitions.
Applied a total of 0 rules in 12 ms. Remains 109 /109 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 109/109 places, 170/170 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 170/170 transitions.
Applied a total of 0 rules in 17 ms. Remains 109 /109 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2026-06-16 13:03:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-06-16 13:03:39] [INFO ] Implicit Places using invariants in 364 ms returned []
[2026-06-16 13:03:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-06-16 13:03:40] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:03:40] [INFO ] Implicit Places using invariants and state equation in 696 ms returned []
Implicit Place search using SMT with State Equation took 1062 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-06-16 13:03:40] [INFO ] Redundant transitions in 10 ms returned []
Running 160 sub problems to find dead transitions.
[2026-06-16 13:03:40] [INFO ] Invariant cache hit.
[2026-06-16 13:03:40] [INFO ] State equation strengthened by 80 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 12/109 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:43] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:43] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:43] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:43] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:43] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:43] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:43] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:43] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:43] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:43] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:44] [INFO ] Deduced a trap composed of 52 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:44] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:44] [INFO ] Deduced a trap composed of 56 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:44] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:45] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:45] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:45] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:45] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:46] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:46] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:46] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:46] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:46] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:46] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:47] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 11/36 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:47] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:47] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:47] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:47] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:47] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:03:48] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 170/279 variables, 109/151 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 80/231 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 10 (OVERLAPS) 0/279 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 231 constraints, problems are : Problem set: 0 solved, 160 unsolved in 18330 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 109/109 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (OVERLAPS) 12/109 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 170/279 variables, 109/151 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD147 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 80/231 constraints. Problems are: Problem set: 12 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 148/379 constraints. Problems are: Problem set: 12 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/379 constraints. Problems are: Problem set: 12 solved, 148 unsolved
At refinement iteration 10 (OVERLAPS) 0/279 variables, 0/379 constraints. Problems are: Problem set: 12 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 379 constraints, problems are : Problem set: 12 solved, 148 unsolved in 29509 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 109/109 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 148/160 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48008ms problems are : Problem set: 12 solved, 148 unsolved
Search for dead transitions found 12 dead transitions in 48024ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 109/109 places, 158/170 transitions.
Graph (complete) has 344 edges and 109 vertex of which 1 are kept as prefixes of interest. Removing 108 places using SCC suffix rule.1 ms
Discarding 108 places :
Also discarding 158 output transitions
Drop transitions (Output transitions of discarded places.) removed 158 transitions
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 2 ms. Remains 1 /109 variables (removed 108) and now considering 0/158 (removed 158) transitions.
[2026-06-16 13:04:28] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-06-16 13:04:28] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-06-16 13:04:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-06-16 13:04:28] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1/109 places, 0/170 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 49200 ms. Remains : 1/109 places, 0/170 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA FileSystem-PT-N03I10B08-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 62365 ms.

BK_STOP 1781615068756

--------------------
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
++ 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 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="FileSystem-PT-N03I10B08"
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 FileSystem-PT-N03I10B08, 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 r351-smll-178021502100055"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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