fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r016-smll-174853764600165
Last Updated
June 24, 2025

About the Execution of ITS-Tools for BridgeAndVehicles-COL-V04P05N02

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 18413.00 0.00 0.00 4 4 2 1 5 2 1 1 4 2 1 4 5 1 4 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r016-smll-174853764600165.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-V04P05N02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-smll-174853764600165
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K 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 37K 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-V04P05N02-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748737748000

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-V04P05N02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2025-06-01 00:29: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 00:29:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 00:29: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 00:29:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-01 00:29:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1221 ms
[2025-06-01 00:29:11] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 28 PT places and 346.0 transition bindings in 44 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 10
[2025-06-01 00:29:11] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 7 ms.
[2025-06-01 00:29:11] [INFO ] Skeletonized 10 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 00:29:11] [INFO ] Computed 4 invariants in 7 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 5, 0, 0, 0, 1, 0] Max Struct:[4, 4, 4, 1, 5, 4, 1, 4, 1, 4]
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-12 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-04 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-01 00:29:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 00:29:11] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2025-06-01 00:29:12] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-01 00:29:12] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-01 00:29:12] [INFO ] Added : 2 causal constraints over 1 iterations in 38 ms. Result :sat
Minimization took 14 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 00:29:12] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-01 00:29:12] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-01 00:29:12] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-01 00:29:12] [INFO ] Added : 0 causal constraints over 0 iterations in 19 ms. Result :sat
Minimization took 7 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 00:29:12] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-01 00:29:12] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-01 00:29:12] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 00:29:12] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 4 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 00:29:12] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-01 00:29:12] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-01 00:29:12] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 00:29:12] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2025-06-01 00:29: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 00:29:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-01 00:29:12] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-01 00:29:12] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 00:29:12] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 4 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 00:29:12] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-01 00:29:12] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-01 00:29:12] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 00:29:12] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 7 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 00:29:12] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-01 00:29:12] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-01 00:29:12] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 00:29:12] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 5 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 00:29:12] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-01 00:29:12] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-01 00:29:12] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 00:29:12] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 6 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 00:29:12] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-01 00:29:12] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-01 00:29:12] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 00:29:12] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 1, 4, 1, 4, 4]
Arc [1:1*[(MOD (ADD $cA 1) 5)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 5) 5) 5)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 3)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2025-06-01 00:29:12] [INFO ] Unfolded HLPN to a Petri net with 28 places and 52 transitions 326 arcs in 40 ms.
[2025-06-01 00:29:12] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 1, 4, 1, 4, 4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 1, 4, 1, 4, 4]
[2025-06-01 00:29:12] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2025-06-01 00:29:12] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 1, 4, 1, 4, 4]
RANDOM walk for 10000 steps (229 resets) in 78 ms. (126 steps per ms)
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20001 steps (199 resets) in 128 ms. (155 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2] Max Struct:[4, 4]
[2025-06-01 00:29:12] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2025-06-01 00:29:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 00:29:13] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned sat
[2025-06-01 00:29:13] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-01 00:29:13] [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 00:29:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-06-01 00:29:13] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-01 00:29:13] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-01 00:29:13] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:29:13] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 13 ms to minimize.
[2025-06-01 00:29:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2025-06-01 00:29:13] [INFO ] Computed and/alt/rep : 25/123/25 causal constraints (skipped 6 transitions) in 9 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:29:13] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 5 ms to minimize.
[2025-06-01 00:29:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2025-06-01 00:29:13] [INFO ] Added : 14 causal constraints over 4 iterations in 127 ms. Result :sat
Minimization took 24 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 00:29:13] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-06-01 00:29:13] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-01 00:29:13] [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 00:29:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-01 00:29:13] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-01 00:29:13] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:29:13] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 4 ms to minimize.
[2025-06-01 00:29:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2025-06-01 00:29:13] [INFO ] Computed and/alt/rep : 25/123/25 causal constraints (skipped 6 transitions) in 9 ms.
[2025-06-01 00:29:13] [INFO ] Added : 16 causal constraints over 4 iterations in 64 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2] Max Struct:[4, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2] Max Struct:[4, 4]
Support contains 2 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
Applied a total of 1 rules in 24 ms. Remains 26 /28 variables (removed 2) and now considering 52/52 (removed 0) transitions.
Running 49 sub problems to find dead transitions.
[2025-06-01 00:29:13] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2025-06-01 00:29:13] [INFO ] Computed 5 invariants in 3 ms
[2025-06-01 00:29:13] [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/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 49 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:29:14] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:29:14] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 2/7 constraints. Problems are: Problem set: 8 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 8 solved, 41 unsolved
Problem TDEAD4 is UNSAT
Problem TDEAD17 is UNSAT
At refinement iteration 3 (OVERLAPS) 34/60 variables, 26/33 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 6/39 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/39 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 0/60 variables, 0/39 constraints. Problems are: Problem set: 10 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 39 constraints, problems are : Problem set: 10 solved, 39 unsolved in 1106 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 26/26 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 39 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 5/5 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 2/7 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 34/60 variables, 26/33 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 6/39 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 39/78 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/78 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 0/60 variables, 0/78 constraints. Problems are: Problem set: 10 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 78 constraints, problems are : Problem set: 10 solved, 39 unsolved in 1613 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 26/26 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 39/49 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2869ms problems are : Problem set: 10 solved, 39 unsolved
Search for dead transitions found 10 dead transitions in 2884ms
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 : 26/28 places, 42/52 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2939 ms. Remains : 26/28 places, 42/52 transitions.
[2025-06-01 00:29:16] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
// Phase 1: matrix 30 rows 26 cols
[2025-06-01 00:29:16] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2] Max Struct:[4, 4]
RANDOM walk for 1000000 steps (22963 resets) in 1621 ms. (616 steps per ms)
BEST_FIRST walk for 2000001 steps (19518 resets) in 1380 ms. (1448 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2] Max Struct:[4, 4]
[2025-06-01 00:29:19] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2025-06-01 00:29:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 00:29:19] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-01 00:29:19] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 00:29:19] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-01 00:29:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 00:29:19] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2025-06-01 00:29:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 00:29:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-06-01 00:29:19] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 00:29:19] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-01 00:29:19] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2025-06-01 00:29:19] [INFO ] Computed and/alt/rep : 23/111/23 causal constraints (skipped 4 transitions) in 4 ms.
[2025-06-01 00:29:19] [INFO ] Added : 11 causal constraints over 3 iterations in 26 ms. Result :sat
Minimization took 21 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 00:29:19] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-06-01 00:29:19] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 00:29:19] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-01 00:29:19] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2025-06-01 00:29:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 00:29:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-01 00:29:19] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 00:29:19] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-01 00:29:19] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:29:20] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
[2025-06-01 00:29:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2025-06-01 00:29:20] [INFO ] Computed and/alt/rep : 23/111/23 causal constraints (skipped 4 transitions) in 3 ms.
[2025-06-01 00:29:20] [INFO ] Added : 11 causal constraints over 3 iterations in 26 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2] Max Struct:[4, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2] Max Struct:[4, 4]
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 26/26 places, 42/42 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2025-06-01 00:29:20] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2025-06-01 00:29:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:29:20] [INFO ] Implicit Places using invariants in 69 ms returned [7, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 71 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 24/26 places, 42/42 transitions.
Applied a total of 0 rules in 5 ms. Remains 24 /24 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 80 ms. Remains : 24/26 places, 42/42 transitions.
[2025-06-01 00:29:20] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
// Phase 1: matrix 30 rows 24 cols
[2025-06-01 00:29:20] [INFO ] Computed 5 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2] Max Struct:[4, 4]
RANDOM walk for 1000000 steps (22957 resets) in 890 ms. (1122 steps per ms)
BEST_FIRST walk for 2000002 steps (19525 resets) in 943 ms. (2118 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2] Max Struct:[4, 4]
[2025-06-01 00:29:22] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2025-06-01 00:29:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 00:29:22] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-01 00:29:22] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-01 00:29:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 00:29:22] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2025-06-01 00:29:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 00:29:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-01 00:29:22] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-01 00:29:22] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2025-06-01 00:29:22] [INFO ] Computed and/alt/rep : 23/79/23 causal constraints (skipped 4 transitions) in 3 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:29:22] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 4 ms to minimize.
[2025-06-01 00:29:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2025-06-01 00:29:22] [INFO ] Added : 13 causal constraints over 3 iterations in 81 ms. Result :sat
Minimization took 17 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 00:29:22] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-01 00:29:22] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-01 00:29:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 00:29:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-01 00:29:22] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-01 00:29:22] [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
[2025-06-01 00:29:22] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 3 ms to minimize.
[2025-06-01 00:29:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2025-06-01 00:29:22] [INFO ] Computed and/alt/rep : 23/79/23 causal constraints (skipped 4 transitions) in 4 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:29:22] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 3 ms to minimize.
[2025-06-01 00:29:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2025-06-01 00:29:22] [INFO ] Added : 19 causal constraints over 5 iterations in 90 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2] Max Struct:[4, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2] Max Struct:[4, 4]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 24/24 places, 42/42 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2025-06-01 00:29:22] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2025-06-01 00:29:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:29:22] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-01 00:29:22] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2025-06-01 00:29:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:29:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 00:29:22] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 00:29:22] [INFO ] Redundant transitions in 1 ms returned []
Running 39 sub problems to find dead transitions.
[2025-06-01 00:29:22] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2025-06-01 00:29:22] [INFO ] Invariant cache hit.
[2025-06-01 00:29:22] [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/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:29:22] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 30/54 variables, 24/30 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:29:23] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 0/54 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 35 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1050 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 24/24 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 30/54 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 39/74 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 0/54 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 74 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1757 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 24/24 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2840ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 2842ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3016 ms. Remains : 24/24 places, 42/42 transitions.
[2025-06-01 00:29:25] [INFO ] Flatten gal took : 93 ms
RANDOM walk for 40000 steps (918 resets) in 945 ms. (42 steps per ms) remains 4/4 properties
[2025-06-01 00:29:25] [INFO ] Flatten gal took : 31 ms
[2025-06-01 00:29:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5044122371244296180.gal : 30 ms
[2025-06-01 00:29:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5016126820984552911.prop : 1 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/ReachabilityCardinality5044122371244296180.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5016126820984552911.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40002 steps (392 resets) in 479 ms. (83 steps per ms) remains 4/4 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/ReachabilityCardinality5016126820984552911.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 18
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :18 after 37
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :37 after 68
BEST_FIRST walk for 40004 steps (390 resets) in 254 ms. (156 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :144 after 153
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :153 after 317
BEST_FIRST walk for 40003 steps (384 resets) in 165 ms. (240 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 512
BEST_FIRST walk for 40004 steps (386 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
SDD size :670 after 880
Probably explored full state space saw : 2874 states, properties seen :0
Probabilistic random walk after 10034 steps, saw 2874 distinct states, run finished after 83 ms. (steps per millisecond=120 ) properties seen :0
Explored full state space saw : 2874 states, properties seen :0
Exhaustive walk after 10034 steps, saw 2874 distinct states, run finished after 41 ms. (steps per millisecond=244 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:188)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:343)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:420)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-09 2 TECHNIQUES REACHABILITY_MIN
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-05 2 TECHNIQUES REACHABILITY_MIN
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-02 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 16119 ms.

BK_STOP 1748737766413

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

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