Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620397900303.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BridgeAndVehicles-PT-V80P50N10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397900303
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.1M
-rw-r--r-- 1 mcc users 17K Apr 13 01:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 13 01:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 298K Apr 13 01:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 13 01:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 14K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 127K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 399K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 47K Apr 13 01:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 237K Apr 13 01:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 596K Apr 13 01:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.3M Apr 13 01:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.7M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716292514638

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V80P50N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 11:55:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 11:55:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 11:55:16] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2024-05-21 11:55:16] [INFO ] Transformed 188 places.
[2024-05-21 11:55:16] [INFO ] Transformed 2108 transitions.
[2024-05-21 11:55:17] [INFO ] Parsed PT model containing 188 places and 2108 transitions and 15950 arcs in 422 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 160 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (56 resets) in 4371 ms. (9 steps per ms) remains 11/16 properties
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 36430 steps (18 resets) in 16638 ms. (2 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (24 resets) in 5854 ms. (6 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (24 resets) in 3392 ms. (11 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (20 resets) in 306 ms. (130 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (20 resets) in 468 ms. (85 steps per ms) remains 10/11 properties
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (20 resets) in 698 ms. (57 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (20 resets) in 775 ms. (51 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (20 resets) in 963 ms. (41 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (20 resets) in 436 ms. (91 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (20 resets) in 397 ms. (100 steps per ms) remains 10/10 properties
[2024-05-21 11:55:28] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2024-05-21 11:55:28] [INFO ] Computed 7 invariants in 35 ms
[2024-05-21 11:55:28] [INFO ] State equation strengthened by 22 read => feed constraints.
Problem BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-04 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-01 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-06 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-09 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-13 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 2/188 variables, 2/7 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 370/558 variables, 188/195 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 22/217 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/217 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/558 variables, 0/217 constraints. Problems are: Problem set: 5 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 217 constraints, problems are : Problem set: 5 solved, 5 unsolved in 1866 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 121/188 variables, 6/7 constraints. Problems are: Problem set: 5 solved, 5 unsolved
[2024-05-21 11:55:42] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 16 ms to minimize.
[2024-05-21 11:55:42] [INFO ] Deduced a trap composed of 14 places in 294 ms of which 3 ms to minimize.
Problem BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-12 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 2/9 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/9 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 370/558 variables, 188/197 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 22/219 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 4/223 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 0/223 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/558 variables, 0/223 constraints. Problems are: Problem set: 6 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 558/558 variables, and 223 constraints, problems are : Problem set: 6 solved, 4 unsolved in 3847 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 4/10 constraints, Known Traps: 2/2 constraints]
After SMT, in 17403ms problems are : Problem set: 6 solved, 4 unsolved
Parikh walk visited 0 properties in 4817 ms.
Support contains 48 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.10 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 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 185 transition count 2107
Applied a total of 3 rules in 308 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
Running 2104 sub problems to find dead transitions.
[2024-05-21 11:55:50] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2024-05-21 11:55:50] [INFO ] Computed 5 invariants in 11 ms
[2024-05-21 11:55:50] [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
[2024-05-21 11:56:15] [INFO ] Deduced a trap composed of 5 places in 267 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 20046 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: 1/1 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
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
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 20048 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 55014ms problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 55039ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55373 ms. Remains : 185/188 places, 2107/2108 transitions.
RANDOM walk for 40000 steps (56 resets) in 650 ms. (61 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (20 resets) in 236 ms. (168 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (20 resets) in 324 ms. (123 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (20 resets) in 298 ms. (133 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (20 resets) in 297 ms. (134 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 191068 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 4
Probabilistic random walk after 191068 steps, saw 53272 distinct states, run finished after 3004 ms. (steps per millisecond=63 ) properties seen :0
[2024-05-21 11:56:49] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-21 11:56:49] [INFO ] Invariant cache hit.
[2024-05-21 11:56:49] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 136/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 369/553 variables, 184/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 22/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1/554 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/554 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 554/554 variables, and 212 constraints, problems are : Problem set: 0 solved, 4 unsolved in 867 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 136/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 369/553 variables, 184/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 22/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1/554 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/554 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/554 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 554/554 variables, and 216 constraints, problems are : Problem set: 0 solved, 4 unsolved in 21985 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 22925ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 5244 ms.
Support contains 48 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 233 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 234 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 195 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2024-05-21 11:57:18] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-21 11:57:18] [INFO ] Invariant cache hit.
[2024-05-21 11:57:18] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-21 11:57:18] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-21 11:57:18] [INFO ] Invariant cache hit.
[2024-05-21 11:57:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 11:57:19] [INFO ] Implicit Places using invariants and state equation in 911 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1164 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 184/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 225 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1586 ms. Remains : 184/185 places, 2107/2107 transitions.
RANDOM walk for 40000 steps (56 resets) in 607 ms. (65 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (20 resets) in 209 ms. (190 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (20 resets) in 289 ms. (137 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (20 resets) in 159 ms. (250 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (20 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 210397 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 4
Probabilistic random walk after 210397 steps, saw 58349 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
[2024-05-21 11:57:23] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2024-05-21 11:57:23] [INFO ] Computed 5 invariants in 10 ms
[2024-05-21 11:57:23] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 136/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 369/553 variables, 184/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 22/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 211 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4564 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 136/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 369/553 variables, 184/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 22/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 4/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/553 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 215 constraints, problems are : Problem set: 0 solved, 4 unsolved in 8275 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 12944ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 5975 ms.
Support contains 48 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 172 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 184/184 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 165 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2024-05-21 11:57:42] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-21 11:57:42] [INFO ] Invariant cache hit.
[2024-05-21 11:57:42] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-21 11:57:42] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-21 11:57:42] [INFO ] Invariant cache hit.
[2024-05-21 11:57:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 11:57:43] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
[2024-05-21 11:57:43] [INFO ] Redundant transitions in 115 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-05-21 11:57:43] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-21 11:57:43] [INFO ] Invariant cache hit.
[2024-05-21 11:57:43] [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, 2104 unsolved
[2024-05-21 11:58:10] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 1 ms to minimize.
[2024-05-21 11:58:27] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 1 ms to minimize.
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/553 variables, and 7 constraints, problems are : Problem set: 80 solved, 2024 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2104/2104 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 80 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 80 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 2/7 constraints. Problems are: Problem set: 80 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/553 variables, and 7 constraints, problems are : Problem set: 80 solved, 2024 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2104 constraints, Known Traps: 2/2 constraints]
After SMT, in 77127ms problems are : Problem set: 80 solved, 2024 unsolved
Search for dead transitions found 80 dead transitions in 77157ms
Found 80 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 80 transitions
Dead transitions reduction (with SMT) removed 80 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 184/184 places, 2027/2107 transitions.
Applied a total of 0 rules in 209 ms. Remains 184 /184 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
[2024-05-21 11:59:00] [INFO ] Redundant transitions in 111 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 78555 ms. Remains : 184/184 places, 2027/2107 transitions.
RANDOM walk for 40000 steps (56 resets) in 458 ms. (87 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (20 resets) in 140 ms. (283 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (20 resets) in 200 ms. (199 steps per ms) remains 3/4 properties
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (20 resets) in 144 ms. (275 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (20 resets) in 154 ms. (258 steps per ms) remains 3/3 properties
[2024-05-21 11:59:00] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 184 cols
[2024-05-21 11:59:00] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 11:59:00] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 161/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 367/546 variables, 179/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 21/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 6/552 variables, 5/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/552 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 210 constraints, problems are : Problem set: 0 solved, 3 unsolved in 734 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 161/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 367/546 variables, 179/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 21/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 6/552 variables, 5/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/552 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/552 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 552/552 variables, and 213 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1618 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2418ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 4339 ms.
Support contains 18 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2027/2027 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 182 transition count 2026
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 181 transition count 2025
Applied a total of 5 rules in 194 ms. Remains 181 /184 variables (removed 3) and now considering 2025/2027 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 181/184 places, 2025/2027 transitions.
RANDOM walk for 40000 steps (76 resets) in 451 ms. (88 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (36 resets) in 241 ms. (165 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (40 resets) in 197 ms. (202 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (39 resets) in 183 ms. (217 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 217473 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 3
Probabilistic random walk after 217473 steps, saw 74194 distinct states, run finished after 3002 ms. (steps per millisecond=72 ) properties seen :0
[2024-05-21 11:59:11] [INFO ] Flow matrix only has 366 transitions (discarded 1659 similar events)
// Phase 1: matrix 366 rows 181 cols
[2024-05-21 11:59:11] [INFO ] Computed 4 invariants in 9 ms
[2024-05-21 11:59:11] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 160/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 366/544 variables, 178/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/544 variables, 21/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/544 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 3/547 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/547 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 547/547 variables, and 206 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2264 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 160/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 366/544 variables, 178/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/544 variables, 21/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/544 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 3/547 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/547 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 547/547 variables, and 209 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1964 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 4283ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-14 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1471 ms.
Support contains 8 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 2025/2025 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 180 transition count 2024
Applied a total of 2 rules in 196 ms. Remains 180 /181 variables (removed 1) and now considering 2024/2025 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 180/181 places, 2024/2025 transitions.
RANDOM walk for 40000 steps (80 resets) in 455 ms. (87 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (39 resets) in 168 ms. (236 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (39 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 228685 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 2
Probabilistic random walk after 228685 steps, saw 75047 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
[2024-05-21 11:59:20] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
// Phase 1: matrix 365 rows 180 cols
[2024-05-21 11:59:20] [INFO ] Computed 4 invariants in 5 ms
[2024-05-21 11:59:20] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 169/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 365/542 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 21/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/545 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/545 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 205 constraints, problems are : Problem set: 0 solved, 2 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 180/180 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 169/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 365/542 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 21/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/545 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/545 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 545/545 variables, and 207 constraints, problems are : Problem set: 0 solved, 2 unsolved in 908 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 180/180 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1303ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 324 ms.
Support contains 8 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 2024/2024 transitions.
Applied a total of 0 rules in 180 ms. Remains 180 /180 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 180/180 places, 2024/2024 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 2024/2024 transitions.
Applied a total of 0 rules in 203 ms. Remains 180 /180 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
[2024-05-21 11:59:22] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-05-21 11:59:22] [INFO ] Invariant cache hit.
[2024-05-21 11:59:22] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-21 11:59:22] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-05-21 11:59:22] [INFO ] Invariant cache hit.
[2024-05-21 11:59:23] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 11:59:23] [INFO ] Implicit Places using invariants and state equation in 1091 ms returned [165]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1426 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 179/180 places, 2024/2024 transitions.
Applied a total of 0 rules in 157 ms. Remains 179 /179 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1786 ms. Remains : 179/180 places, 2024/2024 transitions.
RANDOM walk for 40000 steps (80 resets) in 508 ms. (78 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (36 resets) in 266 ms. (149 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (40 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 236584 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 2
Probabilistic random walk after 236584 steps, saw 77693 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
[2024-05-21 11:59:27] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
// Phase 1: matrix 365 rows 179 cols
[2024-05-21 11:59:27] [INFO ] Computed 4 invariants in 4 ms
[2024-05-21 11:59:27] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 169/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 365/542 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 21/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/544 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/544 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/544 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 544/544 variables, and 204 constraints, problems are : Problem set: 0 solved, 2 unsolved in 355 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 169/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 365/542 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 21/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/544 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/544 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 544/544 variables, and 206 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1098 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1485ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 310 ms.
Support contains 8 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 2024/2024 transitions.
Applied a total of 0 rules in 148 ms. Remains 179 /179 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 179/179 places, 2024/2024 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 2024/2024 transitions.
Applied a total of 0 rules in 153 ms. Remains 179 /179 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
[2024-05-21 11:59:29] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-05-21 11:59:29] [INFO ] Invariant cache hit.
[2024-05-21 11:59:29] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-21 11:59:29] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-05-21 11:59:29] [INFO ] Invariant cache hit.
[2024-05-21 11:59:30] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 11:59:30] [INFO ] Implicit Places using invariants and state equation in 981 ms returned []
Implicit Place search using SMT with State Equation took 1316 ms to find 0 implicit places.
[2024-05-21 11:59:30] [INFO ] Redundant transitions in 44 ms returned []
Running 2021 sub problems to find dead transitions.
[2024-05-21 11:59:30] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-05-21 11:59:30] [INFO ] Invariant cache hit.
[2024-05-21 11:59:30] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2021 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 179/544 variables, and 4 constraints, problems are : Problem set: 0 solved, 2021 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/179 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2021/2021 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2021 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2021 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 Int declared 179/544 variables, and 4 constraints, problems are : Problem set: 0 solved, 2021 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/179 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2021 constraints, Known Traps: 0/0 constraints]
After SMT, in 73388ms problems are : Problem set: 0 solved, 2021 unsolved
Search for dead transitions found 0 dead transitions in 73409ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74934 ms. Remains : 179/179 places, 2024/2024 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 1659 transitions
Reduce isomorphic transitions removed 1659 transitions.
Iterating post reduction 0 with 1659 rules applied. Total rules applied 1659 place count 179 transition count 365
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1661 place count 179 transition count 363
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1663 place count 177 transition count 363
Applied a total of 1663 rules in 23 ms. Remains 177 /179 variables (removed 2) and now considering 363/2024 (removed 1661) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 363 rows 177 cols
[2024-05-21 12:00:44] [INFO ] Computed 4 invariants in 5 ms
[2024-05-21 12:00:44] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-21 12:00:45] [INFO ] After 635ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 12:00:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-21 12:00:45] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 12:00:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 12:00:45] [INFO ] After 43ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 12:00:45] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 12:00:45] [INFO ] After 362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1059 ms.
[2024-05-21 12:00:45] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-05-21 12:00:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 179 places, 2024 transitions and 14654 arcs took 32 ms.
[2024-05-21 12:00:45] [INFO ] Flatten gal took : 243 ms
Total runtime 329366 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V80P50N10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/423/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 179
TRANSITIONS: 2024
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.057s, Sys 0.004s]


SAVING FILE /home/mcc/execution/423/model (.net / .def) ...
EXPORT TIME: [User 0.007s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 713
MODEL NAME: /home/mcc/execution/423/model
179 places, 2024 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-08 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-11 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716293262517

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is BridgeAndVehicles-PT-V80P50N10, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620397900303"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;