fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r027-smll-174853774300055
Last Updated
June 24, 2025

About the Execution of 2024-gold for BridgeAndVehicles-PT-V80P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 234893.00 0.00 0.00 ? 1 1 ? 1 1 ? 80 80 80 80 ? 80 ? 20 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r027-smll-174853774300055.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 gold2024
Input is BridgeAndVehicles-PT-V80P20N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r027-smll-174853774300055
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.3M
-rw-r--r-- 1 mcc users 23K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 334K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M 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 14K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 163K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 478K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 49K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 250K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 795K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.1M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.7M 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-PT-V80P20N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748549174447

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V80P20N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 20:06:16] [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-05-29 20:06:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 20:06:16] [INFO ] Load time of PNML (sax parser for PT used): 339 ms
[2025-05-29 20:06:16] [INFO ] Transformed 188 places.
[2025-05-29 20:06:16] [INFO ] Transformed 2108 transitions.
[2025-05-29 20:06:16] [INFO ] Parsed PT model containing 188 places and 2108 transitions and 15950 arcs in 526 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Reduction of identical properties reduced properties to check from 16 to 11
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 1, 0, 0, 0, 80, 0, 20, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 1, 0, 0, 0, 80, 0, 20, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-29 20:06:16] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2025-05-29 20:06:16] [INFO ] Computed 7 invariants in 56 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 0, 0, 0, 80, 0, 20, 0] Max Struct:[20, 2, 2, 20, 80, 80, 80, 80, 20, 1]
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-14 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-09 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (14 resets) in 314 ms. (31 steps per ms)
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-08 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-10 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-07 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-12 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (21 resets) in 211 ms. (188 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 1, 1, 10] Max Struct:[20, 2, 2, 20]
[2025-05-29 20:06:17] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2025-05-29 20:06:17] [INFO ] Invariant cache hit.
[2025-05-29 20:06:17] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2025-05-29 20:06:18] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2025-05-29 20:06:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 20:06:18] [INFO ] [Real]Added 22 Read/Feed constraints in 48 ms returned sat
[2025-05-29 20:06:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:06:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-29 20:06:18] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2025-05-29 20:06:18] [INFO ] [Nat]Added 22 Read/Feed constraints in 127 ms returned sat
[2025-05-29 20:06:18] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 156 ms.
[2025-05-29 20:06:19] [INFO ] Added : 12 causal constraints over 10 iterations in 559 ms. Result :sat
Minimization took 308 ms.
[2025-05-29 20:06:19] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
[2025-05-29 20:06:19] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2025-05-29 20:06:19] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-29 20:06:19] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2025-05-29 20:06:20] [INFO ] [Real]Added 22 Read/Feed constraints in 41 ms returned sat
[2025-05-29 20:06:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:06:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 20:06:20] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2025-05-29 20:06:20] [INFO ] [Nat]Added 22 Read/Feed constraints in 72 ms returned sat
[2025-05-29 20:06:20] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 257 ms.
[2025-05-29 20:06:20] [INFO ] Added : 10 causal constraints over 2 iterations in 534 ms. Result :sat
Minimization took 513 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 1, 1, 10] Max Struct:[20, 1, 1, 20]
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[20, 20]
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 1882 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 413 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
Running 2105 sub problems to find dead transitions.
[2025-05-29 20:06:22] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2025-05-29 20:06:22] [INFO ] Computed 5 invariants in 10 ms
[2025-05-29 20:06:22] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 5 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20166 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2025-05-29 20:07:07] [INFO ] Deduced a trap composed of 5 places in 532 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20063 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 1/1 constraints]
After SMT, in 57407ms problems are : Problem set: 0 solved, 2105 unsolved
Search for dead transitions found 0 dead transitions in 57493ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57946 ms. Remains : 186/188 places, 2108/2108 transitions.
[2025-05-29 20:07:19] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2025-05-29 20:07:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10] Max Struct:[20, 20]
RANDOM walk for 1000000 steps (1424 resets) in 9994 ms. (100 steps per ms)
BEST_FIRST walk for 2000002 steps (1083 resets) in 6884 ms. (290 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[20, 20]
[2025-05-29 20:07:36] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2025-05-29 20:07:36] [INFO ] Invariant cache hit.
[2025-05-29 20:07:36] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-05-29 20:07:36] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2025-05-29 20:07:36] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:07:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 20:07:36] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2025-05-29 20:07:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 20:07:37] [INFO ] [Nat]Added 22 Read/Feed constraints in 79 ms returned sat
[2025-05-29 20:07:37] [INFO ] Deduced a trap composed of 5 places in 629 ms of which 7 ms to minimize.
[2025-05-29 20:07:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 693 ms
[2025-05-29 20:07:37] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 101 ms.
[2025-05-29 20:07:38] [INFO ] Deduced a trap composed of 14 places in 489 ms of which 3 ms to minimize.
[2025-05-29 20:07:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 570 ms
[2025-05-29 20:07:39] [INFO ] Added : 6 causal constraints over 6 iterations in 1318 ms. Result :sat
Minimization took 407 ms.
[2025-05-29 20:07:39] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2025-05-29 20:07:39] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2025-05-29 20:07:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:07:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2025-05-29 20:07:40] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2025-05-29 20:07:40] [INFO ] [Nat]Added 22 Read/Feed constraints in 76 ms returned sat
[2025-05-29 20:07:40] [INFO ] Deduced a trap composed of 5 places in 582 ms of which 3 ms to minimize.
[2025-05-29 20:07:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 643 ms
[2025-05-29 20:07:40] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 94 ms.
[2025-05-29 20:07:41] [INFO ] Deduced a trap composed of 15 places in 504 ms of which 4 ms to minimize.
[2025-05-29 20:07:42] [INFO ] Deduced a trap composed of 14 places in 488 ms of which 3 ms to minimize.
[2025-05-29 20:07:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1085 ms
[2025-05-29 20:07:42] [INFO ] Added : 10 causal constraints over 2 iterations in 1597 ms. Result :sat
Minimization took 450 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[20, 20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[20, 20]
Support contains 2 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 283 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 284 ms. Remains : 186/186 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 317 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2025-05-29 20:07:43] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2025-05-29 20:07:43] [INFO ] Invariant cache hit.
[2025-05-29 20:07:44] [INFO ] Implicit Places using invariants in 577 ms returned []
[2025-05-29 20:07:44] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2025-05-29 20:07:44] [INFO ] Invariant cache hit.
[2025-05-29 20:07:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 20:07:46] [INFO ] Implicit Places using invariants and state equation in 2505 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3096 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 184/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 259 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3676 ms. Remains : 184/186 places, 2108/2108 transitions.
[2025-05-29 20:07:47] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2025-05-29 20:07:47] [INFO ] Computed 5 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10] Max Struct:[20, 20]
RANDOM walk for 1000000 steps (1423 resets) in 8997 ms. (111 steps per ms)
BEST_FIRST walk for 2000002 steps (1083 resets) in 6331 ms. (315 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[20, 20]
[2025-05-29 20:08:02] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2025-05-29 20:08:02] [INFO ] Invariant cache hit.
[2025-05-29 20:08:02] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 20:08:02] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2025-05-29 20:08:02] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 20:08:02] [INFO ] [Real]Added 22 Read/Feed constraints in 36 ms returned sat
[2025-05-29 20:08:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:08:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2025-05-29 20:08:03] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2025-05-29 20:08:03] [INFO ] [Nat]Added 22 Read/Feed constraints in 69 ms returned sat
[2025-05-29 20:08:03] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 84 ms.
[2025-05-29 20:08:03] [INFO ] Added : 6 causal constraints over 6 iterations in 625 ms. Result :sat
Minimization took 374 ms.
[2025-05-29 20:08:04] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2025-05-29 20:08:04] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2025-05-29 20:08:04] [INFO ] [Real]Added 22 Read/Feed constraints in 38 ms returned sat
[2025-05-29 20:08:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:08:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2025-05-29 20:08:04] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2025-05-29 20:08:04] [INFO ] [Nat]Added 22 Read/Feed constraints in 80 ms returned sat
[2025-05-29 20:08:05] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 88 ms.
[2025-05-29 20:08:05] [INFO ] Added : 11 causal constraints over 3 iterations in 422 ms. Result :sat
Minimization took 415 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[20, 20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[20, 20]
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2108/2108 transitions.
Applied a total of 0 rules in 193 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 184/184 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2108/2108 transitions.
Applied a total of 0 rules in 177 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2025-05-29 20:08:06] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2025-05-29 20:08:06] [INFO ] Invariant cache hit.
[2025-05-29 20:08:07] [INFO ] Implicit Places using invariants in 594 ms returned []
[2025-05-29 20:08:07] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2025-05-29 20:08:07] [INFO ] Invariant cache hit.
[2025-05-29 20:08:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 20:08:09] [INFO ] Implicit Places using invariants and state equation in 2054 ms returned []
Implicit Place search using SMT with State Equation took 2650 ms to find 0 implicit places.
[2025-05-29 20:08:09] [INFO ] Redundant transitions in 150 ms returned []
Running 2105 sub problems to find dead transitions.
[2025-05-29 20:08:09] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2025-05-29 20:08:09] [INFO ] Invariant cache hit.
[2025-05-29 20:08:09] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2025-05-29 20:08:42] [INFO ] Deduced a trap composed of 5 places in 495 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2025-05-29 20:09:24] [INFO ] Deduced a trap composed of 15 places in 275 ms of which 1 ms to minimize.
Problem TDEAD1148 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1258 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/554 variables, and 7 constraints, problems are : Problem set: 11 solved, 2094 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 2/2 constraints]
After SMT, in 76968ms problems are : Problem set: 11 solved, 2094 unsolved
Search for dead transitions found 11 dead transitions in 76997ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 184/184 places, 2097/2108 transitions.
Applied a total of 0 rules in 208 ms. Remains 184 /184 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2025-05-29 20:09:26] [INFO ] Redundant transitions in 118 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 80321 ms. Remains : 184/184 places, 2097/2108 transitions.
[2025-05-29 20:09:26] [INFO ] Flow matrix only has 370 transitions (discarded 1727 similar events)
// Phase 1: matrix 370 rows 184 cols
[2025-05-29 20:09:26] [INFO ] Computed 5 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10] Max Struct:[20, 20]
RANDOM walk for 1000000 steps (1423 resets) in 8841 ms. (113 steps per ms)
BEST_FIRST walk for 2000001 steps (1083 resets) in 6377 ms. (313 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[20, 20]
[2025-05-29 20:09:42] [INFO ] Flow matrix only has 370 transitions (discarded 1727 similar events)
[2025-05-29 20:09:42] [INFO ] Invariant cache hit.
[2025-05-29 20:09:42] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 20:09:42] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2025-05-29 20:09:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 20:09:42] [INFO ] [Real]Added 22 Read/Feed constraints in 27 ms returned sat
[2025-05-29 20:09:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:09:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-05-29 20:09:42] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2025-05-29 20:09:42] [INFO ] [Nat]Added 22 Read/Feed constraints in 49 ms returned sat
[2025-05-29 20:09:42] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 54 ms.
[2025-05-29 20:09:42] [INFO ] Added : 7 causal constraints over 6 iterations in 410 ms. Result :sat
Minimization took 219 ms.
[2025-05-29 20:09:43] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 20:09:43] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2025-05-29 20:09:43] [INFO ] [Real]Added 22 Read/Feed constraints in 24 ms returned sat
[2025-05-29 20:09:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:09:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-05-29 20:09:43] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2025-05-29 20:09:43] [INFO ] [Nat]Added 22 Read/Feed constraints in 48 ms returned sat
[2025-05-29 20:09:43] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 53 ms.
[2025-05-29 20:09:43] [INFO ] Added : 10 causal constraints over 2 iterations in 311 ms. Result :sat
Minimization took 313 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[20, 20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[20, 20]
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2097/2097 transitions.
Applied a total of 0 rules in 184 ms. Remains 184 /184 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 184/184 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2097/2097 transitions.
Applied a total of 0 rules in 181 ms. Remains 184 /184 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2025-05-29 20:09:44] [INFO ] Flow matrix only has 370 transitions (discarded 1727 similar events)
[2025-05-29 20:09:44] [INFO ] Invariant cache hit.
[2025-05-29 20:09:45] [INFO ] Implicit Places using invariants in 486 ms returned []
[2025-05-29 20:09:45] [INFO ] Flow matrix only has 370 transitions (discarded 1727 similar events)
[2025-05-29 20:09:45] [INFO ] Invariant cache hit.
[2025-05-29 20:09:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 20:09:47] [INFO ] Implicit Places using invariants and state equation in 1663 ms returned []
Implicit Place search using SMT with State Equation took 2154 ms to find 0 implicit places.
[2025-05-29 20:09:47] [INFO ] Redundant transitions in 59 ms returned []
Running 2094 sub problems to find dead transitions.
[2025-05-29 20:09:47] [INFO ] Flow matrix only has 370 transitions (discarded 1727 similar events)
[2025-05-29 20:09:47] [INFO ] Invariant cache hit.
[2025-05-29 20:09:47] [INFO ] State equation strengthened by 22 read => feed constraints.

BK_STOP 1748549409340

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V80P20N10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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 gold2024"
echo " Input is BridgeAndVehicles-PT-V80P20N10, 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 r027-smll-174853774300055"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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