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.r034-tall-177946841800165.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 itstools
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 r034-tall-177946841800165
=====================================================================

--------------------
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 1779530090851

Invoking MCC driver with
BK_TOOL=itstools
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 202604301425
[2026-05-23 09:54:51] [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-23 09:54:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 09:54:52] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2026-05-23 09:54:52] [INFO ] Transformed 28 places.
[2026-05-23 09:54:52] [INFO ] Transformed 52 transitions.
[2026-05-23 09:54:52] [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 7 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]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11564967946502806157.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15408531243805325431.kers'
[2026-05-23 09:54:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11564967946502806157.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15408531243805325431.kers]
Normalized transition count is 34 out of 52 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 34 rows 28 cols 150 entries
Finished phase 1 with 13 SingleSign rule and 8 generalized
[2026-05-23 09:54:52] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15408531243805325431.kers
Total runtime 1 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 32 ms. (303 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 (201 resets) in 38 ms. (512 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 2] Max Struct:[2, 4]
[2026-05-23 09:54:52] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16142582268709578586.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17608585806233297298.kers'
[2026-05-23 09:54:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16142582268709578586.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17608585806233297298.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 34 rows 28 cols 150 entries
Finished phase 1 with 13 SingleSign rule and 8 generalized
[2026-05-23 09:54:52] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17608585806233297298.kers
Total runtime 0 ms.
[2026-05-23 09:54:52] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2026-05-23 09:54:52] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-23 09:54:52] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2026-05-23 09:54:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 09:54:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-23 09:54:52] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2026-05-23 09:54:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-23 09:54:52] [INFO ] [Nat]Added 6 Read/Feed constraints in 14 ms returned sat
[2026-05-23 09:54:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2026-05-23 09:54:52] [INFO ] Computed and/alt/rep : 25/123/25 causal constraints (skipped 6 transitions) in 5 ms.
[2026-05-23 09:54:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2026-05-23 09:54:52] [INFO ] Added : 13 causal constraints over 3 iterations in 89 ms. Result :sat
Minimization took 14 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.2 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 26 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-23 09:54:52] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6622525888183411868.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17029225468366939246.kers'
[2026-05-23 09:54:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6622525888183411868.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17029225468366939246.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 33 rows 24 cols 133 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-05-23 09:54:52] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17029225468366939246.kers
Total runtime 0 ms.
[2026-05-23 09:54:52] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
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
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 998 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 1756ms problems are : Problem set: 10 solved, 38 unsolved
Search for dead transitions found 10 dead transitions in 1765ms
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 5 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 1831 ms. Remains : 25/28 places, 41/52 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8965248099884002248.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-666356334287921695.kers'
[2026-05-23 09:54:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8965248099884002248.kers, --Pflows, --basisKERS=/tmp/petrispot-output-666356334287921695.kers]
Normalized transition count is 29 out of 41 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 29 rows 24 cols 121 entries
Finished phase 1 with 17 SingleSign rule and 1 generalized
[2026-05-23 09:54:54] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-666356334287921695.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[4]
RANDOM walk for 1000000 steps (25596 resets) in 854 ms. (1169 steps per ms)
BEST_FIRST walk for 1000001 steps (11489 resets) in 416 ms. (2398 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[4]
[2026-05-23 09:54:55] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16643123833172259019.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11557682353988851432.kers'
[2026-05-23 09:54:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16643123833172259019.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11557682353988851432.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 29 rows 24 cols 121 entries
Finished phase 1 with 17 SingleSign rule and 1 generalized
[2026-05-23 09:54:55] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11557682353988851432.kers
Total runtime 1 ms.
[2026-05-23 09:54:55] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2026-05-23 09:54:55] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-05-23 09:54:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-23 09:54:55] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-23 09:54:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 09:54:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-23 09:54:56] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2026-05-23 09:54:56] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-23 09:54:56] [INFO ] Computed and/alt/rep : 22/107/22 causal constraints (skipped 4 transitions) in 2 ms.
[2026-05-23 09:54:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2026-05-23 09:54:56] [INFO ] Added : 18 causal constraints over 5 iterations in 68 ms. Result :sat
Minimization took 18 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 3 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 3 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 1 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2026-05-23 09:54:56] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2026-05-23 09:54:56] [INFO ] Invariant cache hit.
[2026-05-23 09:54:56] [INFO ] Implicit Places using invariants in 43 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.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7332329014000668873.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7537422447834067931.kers'
[2026-05-23 09:54:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7332329014000668873.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7537422447834067931.kers]
Normalized transition count is 29 out of 41 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 29 rows 22 cols 105 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-05-23 09:54:56] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7537422447834067931.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[4]
RANDOM walk for 1000000 steps (25581 resets) in 606 ms. (1647 steps per ms)
BEST_FIRST walk for 1000001 steps (11485 resets) in 340 ms. (2932 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[4]
[2026-05-23 09:54:57] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18395451845437981238.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15411081673217131910.kers'
[2026-05-23 09:54:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18395451845437981238.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15411081673217131910.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 29 rows 22 cols 105 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-05-23 09:54:57] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15411081673217131910.kers
Total runtime 0 ms.
[2026-05-23 09:54:57] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-23 09:54:57] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2026-05-23 09:54:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 09:54:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 09:54:57] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2026-05-23 09:54:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-23 09:54:57] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-23 09:54:57] [INFO ] Computed and/alt/rep : 22/75/22 causal constraints (skipped 4 transitions) in 2 ms.
[2026-05-23 09:54:57] [INFO ] Added : 16 causal constraints over 5 iterations in 20 ms. Result :sat
Minimization took 14 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 2 ms. Remains 23 /23 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2026-05-23 09:54:57] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2026-05-23 09:54:57] [INFO ] Invariant cache hit.
[2026-05-23 09:54:57] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-23 09:54:57] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2026-05-23 09:54:57] [INFO ] Invariant cache hit.
[2026-05-23 09:54:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-23 09:54:57] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2026-05-23 09:54:57] [INFO ] Redundant transitions in 1 ms returned []
Running 38 sub problems to find dead transitions.
[2026-05-23 09:54:57] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2026-05-23 09:54:57] [INFO ] Invariant cache hit.
[2026-05-23 09:54:57] [INFO ] State equation strengthened by 4 read => feed constraints.
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, 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 474 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
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
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 71 constraints, problems are : Problem set: 0 solved, 38 unsolved in 827 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]
After SMT, in 1313ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1314ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1407 ms. Remains : 23/23 places, 41/41 transitions.
RANDOM walk for 40000 steps (1022 resets) in 511 ms. (78 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (461 resets) in 235 ms. (169 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (459 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
Probably explored full state space saw : 2246 states, properties seen :0
Probabilistic random walk after 7616 steps, saw 2246 distinct states, run finished after 46 ms. (steps per millisecond=165 ) properties seen :0
[2026-05-23 09:54:58] [INFO ] Flatten gal took : 39 ms
Explored full state space saw : 2246 states, properties seen :0
Exhaustive walk after 7616 steps, saw 2246 distinct states, run finished after 38 ms. (steps per millisecond=200 ) properties seen :0
[2026-05-23 09:54:58] [INFO ] Flatten gal took : 13 ms
[2026-05-23 09:54:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2158727193983995730.gal : 5 ms
[2026-05-23 09:54:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8309915026083115530.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2158727193983995730.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8309915026083115530.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
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 check) : Max Seen:[] Max Struct:[]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7194049504538962963.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16998556905287411238.kers'
[2026-05-23 09:54:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7194049504538962963.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16998556905287411238.kers]
Normalized transition count is 29 out of 41 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 29 rows 22 cols 105 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-05-23 09:54:59] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16998556905287411238.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (25598 resets) in 598 ms. (1669 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 7676 ms.

BK_STOP 1779530099694

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="itstools"
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 itstools"
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 r034-tall-177946841800165"
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 ;