Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r016-smll-174853764600173.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is BridgeAndVehicles-COL-V10P10N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-smll-174853764600173
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 38K May 29 14:32 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-COL-V10P10N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748739787567

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V10P10N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2025-06-01 01:03:10] [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]
[2025-06-01 01:03:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 01:03:10] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-01 01:03:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-01 01:03:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1076 ms
[2025-06-01 01:03:11] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 48 PT places and 5438.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Reduction of identical properties reduced properties to check from 16 to 9
[2025-06-01 01:03:11] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 6 ms.
[2025-06-01 01:03:11] [INFO ] Skeletonized 9 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
// Phase 1: matrix 10 rows 12 cols
[2025-06-01 01:03:11] [INFO ] Computed 4 invariants in 5 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 10, 0, 0, 1, 1, 0, 1, 0] Max Struct:[1, 10, 10, 10, 1, 1, 10, 1, 10]
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-01 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-01 01:03:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:03:11] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2025-06-01 01:03:11] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2025-06-01 01:03:11] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 01:03:11] [INFO ] Added : 0 causal constraints over 0 iterations in 19 ms. Result :sat
Minimization took 10 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:03:11] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-01 01:03:11] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-01 01:03:11] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 01:03:11] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 3 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:03:11] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-01 01:03:11] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-01 01:03:11] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 01:03:11] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 5 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:03:12] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2025-06-01 01:03:12] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-01 01:03:12] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 01:03:12] [INFO ] Added : 2 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 4 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:03:12] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-01 01:03:12] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-01 01:03:12] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 01:03:12] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 10, 10, 10, 10]
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [1:1*[(MOD (ADD $cA 1) 11)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 11) 11) 11)]] contains successor/predecessor on variables of sort voitureB
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2025-06-01 01:03:12] [INFO ] Unfolded HLPN to a Petri net with 48 places and 288 transitions 2090 arcs in 51 ms.
[2025-06-01 01:03:12] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 10, 10, 10, 10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 10, 10, 10, 10]
[2025-06-01 01:03:12] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 48 cols
[2025-06-01 01:03:12] [INFO ] Computed 7 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 10, 10, 10, 10]
RANDOM walk for 10000 steps (111 resets) in 77 ms. (128 steps per ms)
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10000 steps (45 resets) in 55 ms. (178 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[10]
[2025-06-01 01:03:12] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2025-06-01 01:03:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:03:12] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-01 01:03:12] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2025-06-01 01:03:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:03:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-06-01 01:03:12] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2025-06-01 01:03:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-01 01:03:12] [INFO ] [Nat]Added 22 Read/Feed constraints in 17 ms returned sat
[2025-06-01 01:03:12] [INFO ] Computed and/alt/rep : 30/58/30 causal constraints (skipped 57 transitions) in 59 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:03:13] [INFO ] Deduced a trap composed of 5 places in 276 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:03:13] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:03:13] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 3 ms to minimize.
[2025-06-01 01:03:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 528 ms
[2025-06-01 01:03:13] [INFO ] Added : 10 causal constraints over 4 iterations in 693 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[10]
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 288/288 transitions.
Graph (complete) has 342 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 45 transition count 287
Applied a total of 3 rules in 56 ms. Remains 45 /48 variables (removed 3) and now considering 287/288 (removed 1) transitions.
Running 284 sub problems to find dead transitions.
[2025-06-01 01:03:13] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 45 cols
[2025-06-01 01:03:13] [INFO ] Computed 5 invariants in 7 ms
[2025-06-01 01:03:13] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:03:15] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:03:16] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 4 ms to minimize.
Problem TDEAD167 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 2/7 constraints. Problems are: Problem set: 20 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 20 solved, 264 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD34 is UNSAT
At refinement iteration 3 (OVERLAPS) 89/134 variables, 45/52 constraints. Problems are: Problem set: 22 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 22/74 constraints. Problems are: Problem set: 22 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/74 constraints. Problems are: Problem set: 22 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/74 constraints. Problems are: Problem set: 22 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 74 constraints, problems are : Problem set: 22 solved, 262 unsolved in 12400 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 45/45 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 22 solved, 262 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 22 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 2/7 constraints. Problems are: Problem set: 22 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 22 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 89/134 variables, 45/52 constraints. Problems are: Problem set: 22 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 22/74 constraints. Problems are: Problem set: 22 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 262/336 constraints. Problems are: Problem set: 22 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/336 constraints. Problems are: Problem set: 22 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/336 constraints. Problems are: Problem set: 22 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 336 constraints, problems are : Problem set: 22 solved, 262 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 45/45 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 262/284 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33054ms problems are : Problem set: 22 solved, 262 unsolved
Search for dead transitions found 22 dead transitions in 33074ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 22 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 45/48 places, 265/288 transitions.
Applied a total of 0 rules in 16 ms. Remains 45 /45 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33170 ms. Remains : 45/48 places, 265/288 transitions.
[2025-06-01 01:03:46] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 45 cols
[2025-06-01 01:03:46] [INFO ] Computed 7 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[10]
RANDOM walk for 1000000 steps (12760 resets) in 3357 ms. (297 steps per ms)
BEST_FIRST walk for 1000001 steps (4844 resets) in 1314 ms. (760 steps per ms)
FORMULA BridgeAndVehicles-COL-V10P10N10-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-01 01:03:51] [INFO ] Flatten gal took : 103 ms
[2025-06-01 01:03:51] [INFO ] Flatten gal took : 48 ms
[2025-06-01 01:03:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12050543979257467680.gal : 32 ms
[2025-06-01 01:03:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4910730644012619863.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/ReachabilityCardinality12050543979257467680.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4910730644012619863.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
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 ...329
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 41672 ms.

BK_STOP 1748739831779

--------------------
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-COL-V10P10N10"
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-5832"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-COL-V10P10N10, 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 r016-smll-174853764600173"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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