About the Execution of 2024-gold for BridgeAndVehicles-PT-V80P50N10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 199714.00 | 0.00 | 0.00 | 80 80 ? 80 ? 80 1 1 1 80 1 80 80 80 1 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-174853774300058.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-V80P50N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r027-smll-174853774300058
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 12K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 191K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 738K 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 8.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 70K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 210K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 337K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 511K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.9M 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_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-V80P50N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748549462089
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-V80P50N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 20:11:04] [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:11:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 20:11:05] [INFO ] Load time of PNML (sax parser for PT used): 364 ms
[2025-05-29 20:11:05] [INFO ] Transformed 188 places.
[2025-05-29 20:11:05] [INFO ] Transformed 2108 transitions.
[2025-05-29 20:11:05] [INFO ] Parsed PT model containing 188 places and 2108 transitions and 15950 arcs in 583 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Reduction of identical properties reduced properties to check from 16 to 11
Current structural bounds on expressions (Initially) : Max Seen:[80, 0, 0, 80, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[80, 0, 0, 80, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-29 20:11:05] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2025-05-29 20:11:05] [INFO ] Computed 7 invariants in 58 ms
Current structural bounds on expressions (after invariants) : Max Seen:[80, 0, 0, 80, 0, 0, 0, 0, 0, 0, 0] Max Struct:[80, 80, 50, 80, 80, 2, 1, 1, 80, 1, 1]
FORMULA BridgeAndVehicles-PT-V80P50N10-UpperBounds-11 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P50N10-UpperBounds-03 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P50N10-UpperBounds-12 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P50N10-UpperBounds-00 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (14 resets) in 348 ms. (28 steps per ms)
FORMULA BridgeAndVehicles-PT-V80P50N10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-UpperBounds-09 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-UpperBounds-01 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-UpperBounds-13 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-UpperBounds-05 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30002 steps (16 resets) in 146 ms. (204 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 1] Max Struct:[50, 2]
[2025-05-29 20:11:05] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2025-05-29 20:11:05] [INFO ] Invariant cache hit.
[2025-05-29 20:11:06] [INFO ] [Real]Absence check using 7 positive place invariants in 21 ms returned sat
[2025-05-29 20:11:06] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2025-05-29 20:11:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 20:11:06] [INFO ] [Real]Added 22 Read/Feed constraints in 58 ms returned sat
[2025-05-29 20:11:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:11:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-29 20:11:07] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2025-05-29 20:11:07] [INFO ] [Nat]Added 22 Read/Feed constraints in 51 ms returned sat
[2025-05-29 20:11:07] [INFO ] Deduced a trap composed of 6 places in 589 ms of which 15 ms to minimize.
[2025-05-29 20:11:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 697 ms
[2025-05-29 20:11:08] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 150 ms.
[2025-05-29 20:11:08] [INFO ] Added : 1 causal constraints over 1 iterations in 283 ms. Result :sat
Minimization took 508 ms.
[2025-05-29 20:11:08] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[5, 1] Max Struct:[50, 1]
FORMULA BridgeAndVehicles-PT-V80P50N10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[50]
Support contains 1 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.15 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 185 transition count 2107
Applied a total of 3 rules in 505 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
Running 2104 sub problems to find dead transitions.
[2025-05-29 20:11:09] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2025-05-29 20:11:09] [INFO ] Computed 5 invariants in 9 ms
[2025-05-29 20:11:09] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
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 185/554 variables, and 5 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 20146 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2104/2104 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2025-05-29 20:11:56] [INFO ] Deduced a trap composed of 5 places in 545 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 20054 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2104 constraints, Known Traps: 1/1 constraints]
After SMT, in 58541ms problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 58613ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59163 ms. Remains : 185/188 places, 2107/2108 transitions.
[2025-05-29 20:12:08] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2025-05-29 20:12:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[50]
RANDOM walk for 1000000 steps (1643 resets) in 10251 ms. (97 steps per ms)
BEST_FIRST walk for 1000001 steps (672 resets) in 3922 ms. (254 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2025-05-29 20:12:22] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2025-05-29 20:12:22] [INFO ] Invariant cache hit.
[2025-05-29 20:12:22] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-05-29 20:12:22] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2025-05-29 20:12:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 20:12:22] [INFO ] [Real]Added 22 Read/Feed constraints in 23 ms returned sat
[2025-05-29 20:12:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:12:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-05-29 20:12:22] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2025-05-29 20:12:22] [INFO ] [Nat]Added 22 Read/Feed constraints in 62 ms returned sat
[2025-05-29 20:12:22] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 141 ms.
[2025-05-29 20:12:23] [INFO ] Deduced a trap composed of 14 places in 366 ms of which 3 ms to minimize.
[2025-05-29 20:12:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 424 ms
[2025-05-29 20:12:23] [INFO ] Added : 12 causal constraints over 10 iterations in 1114 ms. Result :sat
Minimization took 287 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 269 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 185/185 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 226 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2025-05-29 20:12:25] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2025-05-29 20:12:25] [INFO ] Invariant cache hit.
[2025-05-29 20:12:26] [INFO ] Implicit Places using invariants in 687 ms returned []
[2025-05-29 20:12:26] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2025-05-29 20:12:26] [INFO ] Invariant cache hit.
[2025-05-29 20:12:26] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 20:12:28] [INFO ] Implicit Places using invariants and state equation in 2429 ms returned [82, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3132 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 183/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 231 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3598 ms. Remains : 183/185 places, 2107/2107 transitions.
[2025-05-29 20:12:28] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2025-05-29 20:12:28] [INFO ] Computed 5 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[50]
RANDOM walk for 1000000 steps (1643 resets) in 9547 ms. (104 steps per ms)
BEST_FIRST walk for 1000001 steps (671 resets) in 3695 ms. (270 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2025-05-29 20:12:42] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2025-05-29 20:12:42] [INFO ] Invariant cache hit.
[2025-05-29 20:12:42] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2025-05-29 20:12:42] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2025-05-29 20:12:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:12:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-05-29 20:12:42] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2025-05-29 20:12:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 20:12:42] [INFO ] [Nat]Added 22 Read/Feed constraints in 79 ms returned sat
[2025-05-29 20:12:43] [INFO ] Deduced a trap composed of 5 places in 507 ms of which 2 ms to minimize.
[2025-05-29 20:12:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 573 ms
[2025-05-29 20:12:43] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 128 ms.
[2025-05-29 20:12:43] [INFO ] Added : 7 causal constraints over 7 iterations in 519 ms. Result :sat
Minimization took 403 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 371 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 371 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 283 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2025-05-29 20:12:44] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2025-05-29 20:12:44] [INFO ] Invariant cache hit.
[2025-05-29 20:12:45] [INFO ] Implicit Places using invariants in 680 ms returned []
[2025-05-29 20:12:45] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2025-05-29 20:12:45] [INFO ] Invariant cache hit.
[2025-05-29 20:12:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 20:12:47] [INFO ] Implicit Places using invariants and state equation in 1673 ms returned []
Implicit Place search using SMT with State Equation took 2361 ms to find 0 implicit places.
[2025-05-29 20:12:47] [INFO ] Redundant transitions in 221 ms returned []
Running 2104 sub problems to find dead transitions.
[2025-05-29 20:12:47] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2025-05-29 20:12:47] [INFO ] Invariant cache hit.
[2025-05-29 20:12:47] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2025-05-29 20:13:27] [INFO ] Deduced a trap composed of 5 places in 525 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/552 variables, and 6 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2104/2104 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/552 variables, and 6 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2104 constraints, Known Traps: 1/1 constraints]
After SMT, in 75580ms problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 75623ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78514 ms. Remains : 183/183 places, 2107/2107 transitions.
RANDOM walk for 40000 steps (64 resets) in 1548 ms. (25 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40010 steps (24 resets) in 454 ms. (87 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (24 resets) in 497 ms. (80 steps per ms) remains 2/2 properties
[2025-05-29 20:14:04] [INFO ] Flatten gal took : 444 ms
[2025-05-29 20:14:04] [INFO ] Flatten gal took : 208 ms
[2025-05-29 20:14:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18419348727019981440.gal : 101 ms
[2025-05-29 20:14:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13667915852534929726.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18419348727019981440.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13667915852534929726.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality13667915852534929726.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 20
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :20 after 56
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :56 after 159
Interrupted probabilistic random walk after 137323 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 2
Probabilistic random walk after 137323 steps, saw 41167 distinct states, run finished after 3006 ms. (steps per millisecond=45 ) properties seen :0
[2025-05-29 20:14:06] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2025-05-29 20:14:06] [INFO ] Invariant cache hit.
[2025-05-29 20:14:06] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/270 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/274 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 20:14:07] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 115/389 variables, 16/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/389 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/389 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 20:14:07] [INFO ] Deduced a trap composed of 5 places in 386 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/389 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/389 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 162/551 variables, 81/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/551 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/551 variables, 11/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/551 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/552 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/552 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/552 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1420 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 187/270 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :159 after 565
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :565 after 566
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/274 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 115/389 variables, 16/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/389 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/389 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/389 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/389 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 162/551 variables, 81/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/551 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/551 variables, 11/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/551 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/552 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/552 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/552 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 552/552 variables, and 214 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2168 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 3632ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 580 ms.
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 191 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Running 2104 sub problems to find dead transitions.
[2025-05-29 20:14:11] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2025-05-29 20:14:11] [INFO ] Invariant cache hit.
[2025-05-29 20:14:11] [INFO ] State equation strengthened by 22 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :566 after 2030
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2030 after 6535
BK_STOP 1748549661803
--------------------
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-V80P50N10"
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-V80P50N10, 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-174853774300058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V80P50N10.tgz
mv BridgeAndVehicles-PT-V80P50N10 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 '
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 ;