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-178021502100052.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-N02I10B08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-smll-178021502100052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 5.8K May 27 10:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 27 10:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 27 10:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 27 10:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 16 12:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K Jun 16 12:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 21K May 27 10:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 190K May 27 10:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 27 10:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K May 27 10:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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-N02I10B08-UpperBounds-00
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-01
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-02
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-03
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-04
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-05
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-06
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-07
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-08
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-09
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-10
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-11
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-12
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-13
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-14
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1781614859481

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FileSystem-PT-N02I10B08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-06-16 13:01:01] [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:01:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-16 13:01:02] [INFO ] Load time of PNML (sax parser for PT used): 203 ms
[2026-06-16 13:01:02] [INFO ] Transformed 455 places.
[2026-06-16 13:01:02] [INFO ] Transformed 420 transitions.
[2026-06-16 13:01:02] [INFO ] Parsed PT model containing 455 places and 420 transitions and 1490 arcs in 433 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Reduce places removed 10 places and 0 transitions.
FORMULA FileSystem-PT-N02I10B08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+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, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+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:01:02] [INFO ] Computed 35 invariants in 60 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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 120 ms. (82 steps per ms)
FORMULA FileSystem-PT-N02I10B08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N02I10B08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N02I10B08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N02I10B08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N02I10B08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N02I10B08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N02I10B08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N02I10B08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N02I10B08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60005 steps (12 resets) in 171 ms. (348 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2026-06-16 13:01:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:01:03] [INFO ] [Real]Absence check using 27 positive place invariants in 65 ms returned sat
[2026-06-16 13:01:03] [INFO ] [Real]Absence check using 27 positive and 8 generalized place invariants in 13 ms returned sat
[2026-06-16 13:01:04] [INFO ] [Real]Absence check using state equation in 540 ms returned sat
[2026-06-16 13:01:04] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:01:04] [INFO ] [Real]Added 80 Read/Feed constraints in 65 ms returned sat
[2026-06-16 13:01:04] [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:01:04] [INFO ] [Nat]Absence check using 27 positive place invariants in 47 ms returned sat
[2026-06-16 13:01:04] [INFO ] [Nat]Absence check using 27 positive and 8 generalized place invariants in 10 ms returned sat
[2026-06-16 13:01:05] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2026-06-16 13:01:05] [INFO ] [Nat]Added 80 Read/Feed constraints in 76 ms returned sat
[2026-06-16 13:01:05] [INFO ] Computed and/alt/rep : 330/340/330 causal constraints (skipped 80 transitions) in 67 ms.
[2026-06-16 13:01:06] [INFO ] Added : 42 causal constraints over 9 iterations in 796 ms. Result :sat
Minimization took 529 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:01:06] [INFO ] [Real]Absence check using 27 positive place invariants in 42 ms returned sat
[2026-06-16 13:01:06] [INFO ] [Real]Absence check using 27 positive and 8 generalized place invariants in 16 ms returned sat
[2026-06-16 13:01:07] [INFO ] [Real]Absence check using state equation in 541 ms returned sat
[2026-06-16 13:01:07] [INFO ] [Real]Added 80 Read/Feed constraints in 68 ms returned sat
[2026-06-16 13:01:07] [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:01:07] [INFO ] [Nat]Absence check using 27 positive place invariants in 39 ms returned sat
[2026-06-16 13:01:07] [INFO ] [Nat]Absence check using 27 positive and 8 generalized place invariants in 9 ms returned sat
[2026-06-16 13:01:08] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2026-06-16 13:01:08] [INFO ] [Nat]Added 80 Read/Feed constraints in 114 ms returned sat
[2026-06-16 13:01:08] [INFO ] Computed and/alt/rep : 330/340/330 causal constraints (skipped 80 transitions) in 55 ms.
[2026-06-16 13:01:09] [INFO ] Added : 69 causal constraints over 14 iterations in 1028 ms. Result :sat
Minimization took 524 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:01:09] [INFO ] [Real]Absence check using 27 positive place invariants in 36 ms returned sat
[2026-06-16 13:01:09] [INFO ] [Real]Absence check using 27 positive and 8 generalized place invariants in 10 ms returned sat
[2026-06-16 13:01:10] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2026-06-16 13:01:10] [INFO ] [Real]Added 80 Read/Feed constraints in 58 ms returned sat
[2026-06-16 13:01:10] [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:01:10] [INFO ] [Nat]Absence check using 27 positive place invariants in 38 ms returned sat
[2026-06-16 13:01:10] [INFO ] [Nat]Absence check using 27 positive and 8 generalized place invariants in 11 ms returned sat
[2026-06-16 13:01:11] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2026-06-16 13:01:11] [INFO ] [Nat]Added 80 Read/Feed constraints in 49 ms returned sat
[2026-06-16 13:01:11] [INFO ] Computed and/alt/rep : 330/340/330 causal constraints (skipped 80 transitions) in 57 ms.
[2026-06-16 13:01:12] [INFO ] Added : 139 causal constraints over 28 iterations in 1458 ms. Result :sat
Minimization took 502 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:01:13] [INFO ] [Real]Absence check using 27 positive place invariants in 31 ms returned sat
[2026-06-16 13:01:13] [INFO ] [Real]Absence check using 27 positive and 8 generalized place invariants in 8 ms returned sat
[2026-06-16 13:01:13] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2026-06-16 13:01:13] [INFO ] [Real]Added 80 Read/Feed constraints in 55 ms returned sat
[2026-06-16 13:01:13] [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:01:13] [INFO ] [Nat]Absence check using 27 positive place invariants in 28 ms returned sat
[2026-06-16 13:01:13] [INFO ] [Nat]Absence check using 27 positive and 8 generalized place invariants in 7 ms returned sat
[2026-06-16 13:01:14] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2026-06-16 13:01:14] [INFO ] [Nat]Added 80 Read/Feed constraints in 92 ms returned sat
[2026-06-16 13:01:14] [INFO ] Computed and/alt/rep : 330/340/330 causal constraints (skipped 80 transitions) in 40 ms.
[2026-06-16 13:01:14] [INFO ] Added : 48 causal constraints over 10 iterations in 504 ms. Result :sat
Minimization took 462 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:01:15] [INFO ] [Real]Absence check using 27 positive place invariants in 27 ms returned sat
[2026-06-16 13:01:15] [INFO ] [Real]Absence check using 27 positive and 8 generalized place invariants in 6 ms returned sat
[2026-06-16 13:01:15] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2026-06-16 13:01:15] [INFO ] [Real]Added 80 Read/Feed constraints in 31 ms returned sat
[2026-06-16 13:01:15] [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:01:15] [INFO ] [Nat]Absence check using 27 positive place invariants in 24 ms returned sat
[2026-06-16 13:01:15] [INFO ] [Nat]Absence check using 27 positive and 8 generalized place invariants in 7 ms returned sat
[2026-06-16 13:01:16] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2026-06-16 13:01:16] [INFO ] [Nat]Added 80 Read/Feed constraints in 52 ms returned sat
[2026-06-16 13:01:16] [INFO ] Computed and/alt/rep : 330/340/330 causal constraints (skipped 80 transitions) in 35 ms.
[2026-06-16 13:01:16] [INFO ] Added : 48 causal constraints over 10 iterations in 603 ms. Result :sat
Minimization took 502 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:01:17] [INFO ] [Real]Absence check using 27 positive place invariants in 29 ms returned sat
[2026-06-16 13:01:17] [INFO ] [Real]Absence check using 27 positive and 8 generalized place invariants in 9 ms returned sat
[2026-06-16 13:01:17] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2026-06-16 13:01:17] [INFO ] [Real]Added 80 Read/Feed constraints in 51 ms returned sat
[2026-06-16 13:01:17] [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:01:18] [INFO ] [Nat]Absence check using 27 positive place invariants in 36 ms returned sat
[2026-06-16 13:01:18] [INFO ] [Nat]Absence check using 27 positive and 8 generalized place invariants in 10 ms returned sat
[2026-06-16 13:01:18] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2026-06-16 13:01:18] [INFO ] [Nat]Added 80 Read/Feed constraints in 76 ms returned sat
[2026-06-16 13:01:18] [INFO ] Computed and/alt/rep : 330/340/330 causal constraints (skipped 80 transitions) in 49 ms.
[2026-06-16 13:01:19] [INFO ] Added : 55 causal constraints over 11 iterations in 699 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 1, 1, 0, 1] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 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 369 are kept as prefixes of interest. Removing 76 places using SCC suffix rule.3 ms
Discarding 76 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 369 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 359 transition count 410
Discarding 66 places :
Symmetric choice reduction at 2 with 66 rule applications. Total rules 87 place count 293 transition count 344
Iterating global reduction 2 with 66 rules applied. Total rules applied 153 place count 293 transition count 344
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 329 place count 205 transition count 256
Free-agglomeration rule (complex) applied 80 times.
Iterating global reduction 2 with 80 rules applied. Total rules applied 409 place count 205 transition count 176
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 493 place count 121 transition count 176
Applied a total of 493 rules in 353 ms. Remains 121 /445 variables (removed 324) and now considering 176/420 (removed 244) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 365 ms. Remains : 121/445 places, 176/420 transitions.
// Phase 1: matrix 176 rows 121 cols
[2026-06-16 13:01:20] [INFO ] Computed 14 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 1, 1, 0, 1] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA FileSystem-PT-N02I10B08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I10B08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I10B08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I10B08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 1368 ms. (730 steps per ms)
BEST_FIRST walk for 2000000 steps (4 resets) in 1234 ms. (1619 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-06-16 13:01:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:01:23] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2026-06-16 13:01:23] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2026-06-16 13:01:23] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:01:23] [INFO ] [Real]Added 80 Read/Feed constraints in 27 ms returned sat
[2026-06-16 13:01:23] [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:01:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2026-06-16 13:01:23] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2026-06-16 13:01:23] [INFO ] [Nat]Added 80 Read/Feed constraints in 28 ms returned sat
[2026-06-16 13:01:23] [INFO ] Computed and/alt/rep : 86/96/86 causal constraints (skipped 80 transitions) in 22 ms.
[2026-06-16 13:01:23] [INFO ] Added : 8 causal constraints over 2 iterations in 92 ms. Result :sat
Minimization took 132 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:01:23] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2026-06-16 13:01:23] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2026-06-16 13:01:23] [INFO ] [Real]Added 80 Read/Feed constraints in 20 ms returned sat
[2026-06-16 13:01:23] [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:01:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2026-06-16 13:01:24] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2026-06-16 13:01:24] [INFO ] [Nat]Added 80 Read/Feed constraints in 33 ms returned sat
[2026-06-16 13:01:24] [INFO ] Computed and/alt/rep : 86/96/86 causal constraints (skipped 80 transitions) in 22 ms.
[2026-06-16 13:01:24] [INFO ] Added : 8 causal constraints over 2 iterations in 105 ms. Result :sat
Minimization took 132 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
FORMULA FileSystem-PT-N02I10B08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 121 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place endloop_7_14) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 175/175 transitions.
Graph (complete) has 430 edges and 121 vertex of which 117 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 116 transition count 174
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 116 transition count 174
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 11 rules applied. Total rules applied 14 place count 109 transition count 170
Applied a total of 14 rules in 27 ms. Remains 109 /121 variables (removed 12) and now considering 170/175 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 109/121 places, 170/175 transitions.
// Phase 1: matrix 170 rows 109 cols
[2026-06-16 13:01:24] [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 1051 ms. (950 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 547 ms. (1824 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-06-16 13:01:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:01:26] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-06-16 13:01:26] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2026-06-16 13:01:26] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:01:26] [INFO ] [Real]Added 80 Read/Feed constraints in 27 ms returned sat
[2026-06-16 13:01:26] [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:01:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2026-06-16 13:01:26] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2026-06-16 13:01:26] [INFO ] [Nat]Added 80 Read/Feed constraints in 52 ms returned sat
[2026-06-16 13:01:26] [INFO ] Computed and/alt/rep : 80/90/80 causal constraints (skipped 80 transitions) in 20 ms.
[2026-06-16 13:01:26] [INFO ] Added : 8 causal constraints over 2 iterations in 98 ms. Result :sat
Minimization took 117 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 11 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 12 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 11 ms. Remains 109 /109 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2026-06-16 13:01:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-06-16 13:01:27] [INFO ] Implicit Places using invariants in 326 ms returned []
[2026-06-16 13:01:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-06-16 13:01:27] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:01:27] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 866 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-06-16 13:01:27] [INFO ] Redundant transitions in 8 ms returned []
Running 160 sub problems to find dead transitions.
[2026-06-16 13:01:27] [INFO ] Invariant cache hit.
[2026-06-16 13:01:27] [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:01:30] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:01:30] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:01:30] [INFO ] Deduced a trap composed of 3 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:01:30] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:01:30] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:01:30] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:01:30] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:01:30] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:01:30] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:01:30] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:01:31] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:01:31] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 12/23 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:01:32] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:01:32] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:01:32] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:01:32] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:01:32] [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:01:32] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:01:32] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:01:33] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:01:33] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 9/32 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:01:33] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:01:33] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:01:34] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:01:34] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:01:34] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:01:34] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:01:34] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:01:34] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:01:35] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 9/41 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:01:35] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:01:35] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:01:35] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 3/44 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:01:37] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:01:38] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:01:38] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (OVERLAPS) 170/279 variables, 109/156 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 80/236 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 12 (OVERLAPS) 0/279 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 236 constraints, problems are : Problem set: 0 solved, 160 unsolved in 23480 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: 36/36 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, 35/47 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 170/279 variables, 109/156 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 80/236 constraints. Problems are: Problem set: 12 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 148/384 constraints. Problems are: Problem set: 12 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/384 constraints. Problems are: Problem set: 12 solved, 148 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 279/279 variables, and 384 constraints, problems are : Problem set: 12 solved, 148 unsolved in 30031 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: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53641ms problems are : Problem set: 12 solved, 148 unsolved
Search for dead transitions found 12 dead transitions in 53651ms
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.0 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:02:21] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-06-16 13:02:21] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-06-16 13:02:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-06-16 13:02:21] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 75 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 54634 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-N02I10B08-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 79418 ms.

BK_STOP 1781614941395

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

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