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.r047-tall-177946846400021.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 BridgeAndVehicles-PT-V04P05N02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tall-177946846400021
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 704K
-rw-r--r-- 1 mcc users 7.0K Mar 5 08:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Mar 5 08:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Mar 5 08:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K Mar 5 08:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.8K Mar 15 07:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 07:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 15 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Mar 15 07:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 5 08:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Mar 5 08:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 36K Mar 5 08:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 198K Mar 5 08:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 15 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 37K 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 BridgeAndVehicles-PT-V04P05N02-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779480102100

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V04P05N02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-22 20:01:43] [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-22 20:01:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 20:01:43] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2026-05-22 20:01:43] [INFO ] Transformed 28 places.
[2026-05-22 20:01:43] [INFO ] Transformed 52 transitions.
[2026-05-22 20:01:43] [INFO ] Parsed PT model containing 28 places and 52 transitions and 326 arcs in 136 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 12
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[4, 4, 0, 0, 0, 5, 0, 1, 0, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[4, 4, 0, 0, 0, 5, 0, 1, 0, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2026-05-22 20:01:43] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2026-05-22 20:01:43] [INFO ] Computed 7 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4, 4, 0, 0, 0, 5, 0, 1, 0, 0, 1] Max Struct:[4, 4, 2, 4, 4, 5, 1, 1, 4, 1, 1]
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-07 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (229 resets) in 35 ms. (277 steps per ms)
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20001 steps (200 resets) in 39 ms. (500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 2] Max Struct:[2, 4]
[2026-05-22 20:01:43] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2026-05-22 20:01:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 20:01:43] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 20:01:43] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-22 20:01:43] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2026-05-22 20:01:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-22 20:01:43] [INFO ] [Real]Added 6 Read/Feed constraints in 2 ms returned sat
[2026-05-22 20:01:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 20:01:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-22 20:01:44] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2026-05-22 20:01:44] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 20:01:44] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 7 ms to minimize.
[2026-05-22 20:01:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2026-05-22 20:01:44] [INFO ] Computed and/alt/rep : 25/123/25 causal constraints (skipped 6 transitions) in 5 ms.
[2026-05-22 20:01:44] [INFO ] Added : 13 causal constraints over 3 iterations in 36 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 2] Max Struct:[1, 4]
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[4]
Support contains 1 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 52/52 transitions.
Graph (complete) has 146 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 25 transition count 51
Applied a total of 3 rules in 25 ms. Remains 25 /28 variables (removed 3) and now considering 51/52 (removed 1) transitions.
Running 48 sub problems to find dead transitions.
[2026-05-22 20:01:44] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2026-05-22 20:01:44] [INFO ] Computed 5 invariants in 1 ms
[2026-05-22 20:01:44] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 20:01:44] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 20:01:44] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 2/7 constraints. Problems are: Problem set: 8 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 8 solved, 40 unsolved
Problem TDEAD4 is UNSAT
Problem TDEAD16 is UNSAT
At refinement iteration 3 (OVERLAPS) 33/58 variables, 25/32 constraints. Problems are: Problem set: 10 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 6/38 constraints. Problems are: Problem set: 10 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/38 constraints. Problems are: Problem set: 10 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 0/58 variables, 0/38 constraints. Problems are: Problem set: 10 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/58 variables, and 38 constraints, problems are : Problem set: 10 solved, 38 unsolved in 704 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 38 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 10 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 2/7 constraints. Problems are: Problem set: 10 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 10 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 33/58 variables, 25/32 constraints. Problems are: Problem set: 10 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 6/38 constraints. Problems are: Problem set: 10 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 38/76 constraints. Problems are: Problem set: 10 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/76 constraints. Problems are: Problem set: 10 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/58 variables, 0/76 constraints. Problems are: Problem set: 10 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 58/58 variables, and 76 constraints, problems are : Problem set: 10 solved, 38 unsolved in 907 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 38/48 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1678ms problems are : Problem set: 10 solved, 38 unsolved
Search for dead transitions found 10 dead transitions in 1687ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 10 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 25/28 places, 41/52 transitions.
Applied a total of 0 rules in 6 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1732 ms. Remains : 25/28 places, 41/52 transitions.
[2026-05-22 20:01:45] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
// Phase 1: matrix 29 rows 25 cols
[2026-05-22 20:01:45] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[4]
RANDOM walk for 1000000 steps (25587 resets) in 808 ms. (1236 steps per ms)
BEST_FIRST walk for 1000001 steps (11491 resets) in 456 ms. (2188 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[4]
[2026-05-22 20:01:47] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2026-05-22 20:01:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 20:01:47] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-22 20:01:47] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 3 ms returned sat
[2026-05-22 20:01:47] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2026-05-22 20:01:47] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-22 20:01:47] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2026-05-22 20:01:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 20:01:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-22 20:01:47] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-22 20:01:47] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2026-05-22 20:01:47] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 20:01:47] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 3 ms to minimize.
[2026-05-22 20:01:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2026-05-22 20:01:47] [INFO ] Computed and/alt/rep : 22/107/22 causal constraints (skipped 4 transitions) in 3 ms.
[2026-05-22 20:01:47] [INFO ] Added : 19 causal constraints over 5 iterations in 26 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[4]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 25/25 places, 41/41 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2026-05-22 20:01:47] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2026-05-22 20:01:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 20:01:47] [INFO ] Implicit Places using invariants in 42 ms returned [6, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 23/25 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 49 ms. Remains : 23/25 places, 41/41 transitions.
[2026-05-22 20:01:47] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
// Phase 1: matrix 29 rows 23 cols
[2026-05-22 20:01:47] [INFO ] Computed 5 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[4]
RANDOM walk for 1000000 steps (25588 resets) in 643 ms. (1552 steps per ms)
BEST_FIRST walk for 1000001 steps (11494 resets) in 360 ms. (2770 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[4]
[2026-05-22 20:01:48] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2026-05-22 20:01:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 20:01:48] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-22 20:01:48] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2026-05-22 20:01:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 20:01:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-22 20:01:48] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2026-05-22 20:01:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-22 20:01:48] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 20:01:48] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 2 ms to minimize.
[2026-05-22 20:01:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2026-05-22 20:01:48] [INFO ] Computed and/alt/rep : 22/75/22 causal constraints (skipped 4 transitions) in 2 ms.
[2026-05-22 20:01:48] [INFO ] Added : 15 causal constraints over 4 iterations in 25 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[4]
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 23/23 places, 41/41 transitions.
Applied a total of 0 rules in 3 ms. Remains 23 /23 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 23/23 places, 41/41 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 23/23 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2026-05-22 20:01:48] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2026-05-22 20:01:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 20:01:48] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-22 20:01:48] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2026-05-22 20:01:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 20:01:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-22 20:01:48] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-22 20:01:48] [INFO ] Redundant transitions in 1 ms returned []
Running 38 sub problems to find dead transitions.
[2026-05-22 20:01:48] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2026-05-22 20:01:48] [INFO ] Invariant cache hit.
[2026-05-22 20:01:48] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 20:01:48] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 29/52 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 33 constraints, problems are : Problem set: 0 solved, 38 unsolved in 460 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 23/23 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 29/52 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 38/71 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 20:01:49] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 72 constraints, problems are : Problem set: 0 solved, 38 unsolved in 890 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 23/23 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1366ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1367ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1465 ms. Remains : 23/23 places, 41/41 transitions.
RANDOM walk for 40000 steps (1021 resets) in 660 ms. (60 steps per ms) remains 2/2 properties
[2026-05-22 20:01:50] [INFO ] Flatten gal took : 42 ms
BEST_FIRST walk for 40003 steps (459 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
[2026-05-22 20:01:50] [INFO ] Flatten gal took : 16 ms
[2026-05-22 20:01:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5267968030997957786.gal : 5 ms
[2026-05-22 20:01:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4799867824448357477.prop : 0 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/ReachabilityCardinality5267968030997957786.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4799867824448357477.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (456 resets) in 206 ms. (193 steps per ms) remains 2/2 properties

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 ...328
Loading property file /tmp/ReachabilityCardinality4799867824448357477.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 25
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :88 after 91
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :91 after 205
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :486 after 547
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1139 after 1304
Probably explored full state space saw : 2246 states, properties seen :0
Probabilistic random walk after 7616 steps, saw 2246 distinct states, run finished after 60 ms. (steps per millisecond=126 ) properties seen :0
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2246,0.064858,6028,2,1318,16,6961,8,0,137,7737,0
Total reachable state count : 2246

Verifying 2 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,0.065267,6156,1,0,16,6961,8,0,138,7737,0
Invariant property MIN0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.065635,6284,1,0,16,6961,8,0,138,7737,0
Explored full state space saw : 2246 states, properties seen :0
Exhaustive walk after 7616 steps, saw 2246 distinct states, run finished after 24 ms. (steps per millisecond=317 ) properties seen :0
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-10 2 TECHNIQUES REACHABILITY_MIN
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-05 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 7164 ms.

BK_STOP 1779480110702

--------------------
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="BridgeAndVehicles-PT-V04P05N02"
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 BridgeAndVehicles-PT-V04P05N02, 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 r047-tall-177946846400021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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