About the Execution of 2024-gold for BridgeAndVehicles-COL-V20P10N50
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15675.790 | 412535.00 | 641383.00 | 1061.40 | F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r028-smll-174853774600122.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-COL-V20P10N50, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-smll-174853774600122
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K 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 41K 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 booleans
BOOL_VECTOR
FORMULA_NAME QuasiLiveness
=== Now, execution of the tool begins
BK_START 1748570670547
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=BridgeAndVehicles-COL-V20P10N50
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-30 02:04:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-05-30 02:04:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 02:04:32] [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-05-30 02:04:33] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-05-30 02:04:34] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1422 ms
[2025-05-30 02:04:34] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 108 PT places and 90298.0 transition bindings in 44 ms.
[2025-05-30 02:04:34] [INFO ] Unfolded HLPN to a Petri net with 108 places and 2228 transitions 17190 arcs in 161 ms.
[2025-05-30 02:04:34] [INFO ] Unfolded 11 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
RANDOM walk for 40000 steps (228 resets) in 5017 ms. (7 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40002 steps (108 resets) in 717 ms. (55 steps per ms) remains 1/1 properties
[2025-05-30 02:04:36] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2025-05-30 02:04:36] [INFO ] Computed 7 invariants in 37 ms
[2025-05-30 02:04:36] [INFO ] State equation strengthened by 102 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 246/303 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 91/394 variables, 47/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 102/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/398 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 4/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/398 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1083 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 246/303 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 91/394 variables, 47/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 102/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/398 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 4/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/398 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 958 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2252ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 574 ms.
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Graph (complete) has 882 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.24 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 105 transition count 2227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 103 transition count 2226
Applied a total of 6 rules in 642 ms. Remains 103 /108 variables (removed 5) and now considering 2226/2228 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 663 ms. Remains : 103/108 places, 2226/2228 transitions.
RANDOM walk for 4000000 steps (31749 resets) in 56989 ms. (70 steps per ms) remains 1/1 properties
BEST_FIRST walk for 2679180 steps (11163 resets) in 20004 ms. (133 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4680581 steps, run timeout after 57001 ms. (steps per millisecond=82 ) properties seen :0 out of 1
Probabilistic random walk after 4680581 steps, saw 1245833 distinct states, run finished after 57010 ms. (steps per millisecond=82 ) properties seen :0
[2025-05-30 02:05:56] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 103 cols
[2025-05-30 02:05:56] [INFO ] Computed 4 invariants in 4 ms
[2025-05-30 02:05:56] [INFO ] State equation strengthened by 102 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 246/303 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 86/389 variables, 44/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 102/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/391 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/391 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 514 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 246/303 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 86/389 variables, 44/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 102/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/391 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/391 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1241 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1823ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1098 ms.
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2226/2226 transitions.
Applied a total of 0 rules in 276 ms. Remains 103 /103 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 103/103 places, 2226/2226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2226/2226 transitions.
Applied a total of 0 rules in 480 ms. Remains 103 /103 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2025-05-30 02:05:59] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2025-05-30 02:05:59] [INFO ] Invariant cache hit.
[2025-05-30 02:06:00] [INFO ] Implicit Places using invariants in 639 ms returned []
[2025-05-30 02:06:00] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2025-05-30 02:06:00] [INFO ] Invariant cache hit.
[2025-05-30 02:06:00] [INFO ] State equation strengthened by 102 read => feed constraints.
[2025-05-30 02:06:03] [INFO ] Implicit Places using invariants and state equation in 2524 ms returned [22, 44]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3197 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 101/103 places, 2226/2226 transitions.
Applied a total of 0 rules in 342 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4026 ms. Remains : 101/103 places, 2226/2226 transitions.
RANDOM walk for 4000000 steps (31752 resets) in 56050 ms. (71 steps per ms) remains 1/1 properties
BEST_FIRST walk for 2706073 steps (11273 resets) in 20004 ms. (135 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4796427 steps, run timeout after 57001 ms. (steps per millisecond=84 ) properties seen :0 out of 1
Probabilistic random walk after 4796427 steps, saw 1276011 distinct states, run finished after 57001 ms. (steps per millisecond=84 ) properties seen :0
[2025-05-30 02:07:19] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2025-05-30 02:07:19] [INFO ] Computed 4 invariants in 4 ms
[2025-05-30 02:07:19] [INFO ] State equation strengthened by 102 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 246/303 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 84/387 variables, 42/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 102/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/389 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/389 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 207 constraints, problems are : Problem set: 0 solved, 1 unsolved in 422 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 246/303 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 84/387 variables, 42/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 102/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/389 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/389 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/389 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 208 constraints, problems are : Problem set: 0 solved, 1 unsolved in 949 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1419ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 555 ms.
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2226/2226 transitions.
Applied a total of 0 rules in 285 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 286 ms. Remains : 101/101 places, 2226/2226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2226/2226 transitions.
Applied a total of 0 rules in 213 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2025-05-30 02:07:22] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2025-05-30 02:07:22] [INFO ] Invariant cache hit.
[2025-05-30 02:07:22] [INFO ] Implicit Places using invariants in 586 ms returned []
[2025-05-30 02:07:22] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2025-05-30 02:07:22] [INFO ] Invariant cache hit.
[2025-05-30 02:07:22] [INFO ] State equation strengthened by 102 read => feed constraints.
[2025-05-30 02:07:24] [INFO ] Implicit Places using invariants and state equation in 2131 ms returned []
Implicit Place search using SMT with State Equation took 2735 ms to find 0 implicit places.
[2025-05-30 02:07:25] [INFO ] Redundant transitions in 192 ms returned []
Running 2223 sub problems to find dead transitions.
[2025-05-30 02:07:25] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2025-05-30 02:07:25] [INFO ] Invariant cache hit.
[2025-05-30 02:07:25] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
[2025-05-30 02:07:58] [INFO ] Deduced a trap composed of 5 places in 640 ms of which 21 ms to minimize.
[2025-05-30 02:08:02] [INFO ] Deduced a trap composed of 54 places in 500 ms of which 5 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD707 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 101/389 variables, and 6 constraints, problems are : Problem set: 12 solved, 2211 unsolved in 30166 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/101 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2223/2223 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 12 solved, 2211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 12 solved, 2211 unsolved
Problem TDEAD758 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1676 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1778 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1880 is UNSAT
Problem TDEAD1931 is UNSAT
Problem TDEAD1982 is UNSAT
Problem TDEAD2033 is UNSAT
Problem TDEAD2084 is UNSAT
Problem TDEAD2135 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/6 constraints. Problems are: Problem set: 40 solved, 2183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 101/389 variables, and 6 constraints, problems are : Problem set: 40 solved, 2183 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/101 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2223 constraints, Known Traps: 2/2 constraints]
After SMT, in 80207ms problems are : Problem set: 40 solved, 2183 unsolved
Search for dead transitions found 40 dead transitions in 80261ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 101/101 places, 2186/2226 transitions.
Applied a total of 0 rules in 201 ms. Remains 101 /101 variables (removed 0) and now considering 2186/2186 (removed 0) transitions.
[2025-05-30 02:08:45] [INFO ] Redundant transitions in 130 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 83763 ms. Remains : 101/101 places, 2186/2226 transitions.
RANDOM walk for 4000000 steps (31752 resets) in 62201 ms. (64 steps per ms) remains 1/1 properties
BEST_FIRST walk for 2797912 steps (11656 resets) in 20004 ms. (139 steps per ms) remains 1/1 properties
Probably explored full state space saw : 1577944 states, properties seen :0
Probabilistic random walk after 5950637 steps, saw 1577944 distinct states, run finished after 66258 ms. (steps per millisecond=89 ) properties seen :0
Explored full state space saw : 1577982 states, properties seen :0
Exhaustive walk after 5950760 steps, saw 1577982 distinct states, run finished after 67855 ms. (steps per millisecond=87 ) properties seen :0
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK EXHAUSTIVE_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 410425 ms.
ITS solved all properties within timeout
BK_STOP 1748571083082
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML
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-V20P10N50"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-COL-V20P10N50, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r028-smll-174853774600122"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V20P10N50.tgz
mv BridgeAndVehicles-COL-V20P10N50 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;