About the Execution of GreatSPN+red for BridgeAndVehicles-PT-V20P20N50
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15809.508 | 2186017.00 | 7437152.00 | 345.20 | ?TT??TT?TTF?TFFT | normal |
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-171620397800218.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-V20P20N50, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397800218
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 9.6K Apr 13 02:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 13 02:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 435K Apr 13 02:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.7M Apr 13 02:28 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 11K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 256K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 787K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Apr 13 04:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 213K Apr 13 04:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 13 03:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.3M Apr 13 03:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K Apr 22 14:29 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.9M 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-V20P20N50-CTLFireability-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716286328862
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V20P20N50
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 10:12:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 10:12:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 10:12:10] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2024-05-21 10:12:10] [INFO ] Transformed 108 places.
[2024-05-21 10:12:10] [INFO ] Transformed 2228 transitions.
[2024-05-21 10:12:10] [INFO ] Parsed PT model containing 108 places and 2228 transitions and 17190 arcs in 272 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 105 ms.
Support contains 106 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2228
Applied a total of 2 rules in 39 ms. Remains 106 /108 variables (removed 2) and now considering 2228/2228 (removed 0) transitions.
Running 2225 sub problems to find dead transitions.
[2024-05-21 10:12:10] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2024-05-21 10:12:10] [INFO ] Computed 5 invariants in 14 ms
[2024-05-21 10:12:11] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-21 10:12:33] [INFO ] Deduced a trap composed of 5 places in 343 ms of which 20 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2225 unsolved in 20120 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2225/2225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-21 10:13:02] [INFO ] Deduced a trap composed of 55 places in 225 ms of which 2 ms to minimize.
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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/396 variables, and 7 constraints, problems are : Problem set: 20 solved, 2205 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2225 constraints, Known Traps: 2/2 constraints]
After SMT, in 55304ms problems are : Problem set: 20 solved, 2205 unsolved
Search for dead transitions found 20 dead transitions in 55370ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 20 transitions.
[2024-05-21 10:13:06] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
// Phase 1: matrix 289 rows 106 cols
[2024-05-21 10:13:06] [INFO ] Computed 5 invariants in 7 ms
[2024-05-21 10:13:06] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 10:13:06] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-05-21 10:13:06] [INFO ] Invariant cache hit.
[2024-05-21 10:13:06] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-21 10:13:06] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 106/108 places, 2208/2228 transitions.
Applied a total of 0 rules in 19 ms. Remains 106 /106 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55667 ms. Remains : 106/108 places, 2208/2228 transitions.
Support contains 106 out of 106 places after structural reductions.
[2024-05-21 10:13:07] [INFO ] Flatten gal took : 430 ms
[2024-05-21 10:13:10] [INFO ] Flatten gal took : 460 ms
[2024-05-21 10:13:14] [INFO ] Input system was already deterministic with 2208 transitions.
Reduction of identical properties reduced properties to check from 70 to 67
RANDOM walk for 40000 steps (228 resets) in 9461 ms. (4 steps per ms) remains 41/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 477 ms. (8 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 127 ms. (31 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 133 ms. (29 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 455 ms. (8 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (8 resets) in 125 ms. (31 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 80 ms. (49 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 86 ms. (46 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (8 resets) in 71 ms. (55 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (8 resets) in 87 ms. (45 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 80 ms. (49 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 77 ms. (51 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 79 ms. (50 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 89 ms. (44 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 104 ms. (38 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 89 ms. (44 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 95 ms. (41 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 75 ms. (52 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 105 ms. (37 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 116 ms. (34 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 97 ms. (40 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 115 ms. (34 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (8 resets) in 117 ms. (33 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 82 ms. (48 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 67 ms. (58 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (8 resets) in 77 ms. (51 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 92 ms. (43 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 75 ms. (52 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 84 ms. (47 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 76 ms. (51 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 81 ms. (48 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 82 ms. (48 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 70 ms. (56 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 93 ms. (42 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 73 ms. (54 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 41/41 properties
[2024-05-21 10:13:19] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-05-21 10:13:19] [INFO ] Invariant cache hit.
[2024-05-21 10:13:19] [INFO ] State equation strengthened by 101 read => feed constraints.
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp67 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 3/3 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 6/103 variables, 2/5 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 289/392 variables, 103/108 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 101/209 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/209 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 3/395 variables, 3/212 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/212 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 0/395 variables, 0/212 constraints. Problems are: Problem set: 5 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 212 constraints, problems are : Problem set: 5 solved, 36 unsolved in 4899 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 106/106 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 30/100 variables, 3/4 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 287/387 variables, 100/104 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 101/205 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/205 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 8/395 variables, 6/211 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 1/212 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 36/248 constraints. Problems are: Problem set: 5 solved, 36 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 395/395 variables, and 248 constraints, problems are : Problem set: 5 solved, 36 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 106/106 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 36/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 11102ms problems are : Problem set: 5 solved, 36 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 70 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2207
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 5 place count 103 transition count 2206
Applied a total of 5 rules in 450 ms. Remains 103 /106 variables (removed 3) and now considering 2206/2208 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 452 ms. Remains : 103/106 places, 2206/2208 transitions.
RANDOM walk for 40000 steps (316 resets) in 1003 ms. (39 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4003 steps (16 resets) in 50 ms. (78 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (16 resets) in 49 ms. (80 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (11 resets) in 36 ms. (108 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (12 resets) in 60 ms. (65 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (12 resets) in 39 ms. (100 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (14 resets) in 46 ms. (85 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (12 resets) in 38 ms. (102 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (12 resets) in 44 ms. (88 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (12 resets) in 58 ms. (67 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (13 resets) in 37 ms. (105 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (12 resets) in 43 ms. (91 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (12 resets) in 33 ms. (117 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (12 resets) in 31 ms. (125 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (12 resets) in 54 ms. (72 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (12 resets) in 31 ms. (125 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (12 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (12 resets) in 33 ms. (117 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (12 resets) in 33 ms. (117 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (12 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (12 resets) in 29 ms. (133 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (12 resets) in 33 ms. (117 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (12 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (12 resets) in 37 ms. (105 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4003 steps (12 resets) in 42 ms. (93 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (13 resets) in 38 ms. (102 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (12 resets) in 32 ms. (121 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (12 resets) in 30 ms. (129 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (16 resets) in 38 ms. (102 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (12 resets) in 32 ms. (121 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (12 resets) in 33 ms. (117 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (12 resets) in 34 ms. (114 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (12 resets) in 32 ms. (121 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (12 resets) in 32 ms. (121 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4003 steps (12 resets) in 61 ms. (64 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (12 resets) in 32 ms. (121 steps per ms) remains 33/33 properties
Interrupted probabilistic random walk after 146731 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :3 out of 33
Probabilistic random walk after 146731 steps, saw 43424 distinct states, run finished after 3005 ms. (steps per millisecond=48 ) properties seen :3
[2024-05-21 10:13:35] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
// Phase 1: matrix 287 rows 103 cols
[2024-05-21 10:13:35] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 10:13:35] [INFO ] State equation strengthened by 101 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 37/100 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 287/387 variables, 100/104 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 101/205 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 3/390 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 0/390 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 208 constraints, problems are : Problem set: 0 solved, 30 unsolved in 3113 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 37/100 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 287/387 variables, 100/104 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 101/205 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 3/390 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 27/238 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 0/390 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 238 constraints, problems are : Problem set: 0 solved, 30 unsolved in 8250 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 11548ms problems are : Problem set: 0 solved, 30 unsolved
Fused 30 Parikh solutions to 29 different solutions.
Parikh walk visited 0 properties in 7252 ms.
Support contains 63 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2206/2206 transitions.
Applied a total of 0 rules in 202 ms. Remains 103 /103 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 103/103 places, 2206/2206 transitions.
RANDOM walk for 40000 steps (316 resets) in 685 ms. (58 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (16 resets) in 41 ms. (95 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (16 resets) in 43 ms. (90 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (11 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (12 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (12 resets) in 27 ms. (143 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (12 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (12 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (13 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (12 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (12 resets) in 27 ms. (143 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (12 resets) in 27 ms. (142 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (12 resets) in 25 ms. (153 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (12 resets) in 25 ms. (154 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4000 steps (12 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (12 resets) in 25 ms. (154 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (12 resets) in 26 ms. (148 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4001 steps (12 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (12 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (12 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (16 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (12 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (14 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
Interrupted probabilistic random walk after 164047 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 29
Probabilistic random walk after 164047 steps, saw 47970 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
[2024-05-21 10:13:57] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-05-21 10:13:57] [INFO ] Invariant cache hit.
[2024-05-21 10:13:57] [INFO ] State equation strengthened by 101 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 39/100 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 287/387 variables, 100/104 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 101/205 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 3/390 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/390 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 208 constraints, problems are : Problem set: 0 solved, 29 unsolved in 3701 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 39/100 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 287/387 variables, 100/104 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 101/205 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 3/390 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 26/237 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 0/390 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 237 constraints, problems are : Problem set: 0 solved, 29 unsolved in 6452 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
After SMT, in 10391ms problems are : Problem set: 0 solved, 29 unsolved
Fused 29 Parikh solutions to 28 different solutions.
Parikh walk visited 0 properties in 3883 ms.
Support contains 61 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2206/2206 transitions.
Applied a total of 0 rules in 175 ms. Remains 103 /103 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 103/103 places, 2206/2206 transitions.
RANDOM walk for 40000 steps (316 resets) in 678 ms. (58 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (16 resets) in 47 ms. (83 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (16 resets) in 46 ms. (85 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 35 ms. (111 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (11 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (12 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (12 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (12 resets) in 36 ms. (108 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (12 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (12 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (12 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (12 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (12 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (12 resets) in 28 ms. (137 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (12 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (12 resets) in 28 ms. (137 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (12 resets) in 25 ms. (154 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (12 resets) in 25 ms. (154 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (16 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (12 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (12 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (12 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (12 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
Interrupted probabilistic random walk after 149851 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 29
Probabilistic random walk after 149851 steps, saw 44225 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
[2024-05-21 10:14:15] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-05-21 10:14:15] [INFO ] Invariant cache hit.
[2024-05-21 10:14:15] [INFO ] State equation strengthened by 101 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 39/100 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 287/387 variables, 100/104 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 101/205 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 3/390 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/390 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 208 constraints, problems are : Problem set: 0 solved, 29 unsolved in 3734 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 39/100 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 287/387 variables, 100/104 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 101/205 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 3/390 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 26/237 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 0/390 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 237 constraints, problems are : Problem set: 0 solved, 29 unsolved in 8411 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
After SMT, in 12323ms problems are : Problem set: 0 solved, 29 unsolved
Parikh walk visited 0 properties in 4345 ms.
Support contains 61 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2206/2206 transitions.
Applied a total of 0 rules in 163 ms. Remains 103 /103 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 103/103 places, 2206/2206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2206/2206 transitions.
Applied a total of 0 rules in 163 ms. Remains 103 /103 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
[2024-05-21 10:14:32] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-05-21 10:14:32] [INFO ] Invariant cache hit.
[2024-05-21 10:14:32] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-21 10:14:32] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-05-21 10:14:32] [INFO ] Invariant cache hit.
[2024-05-21 10:14:32] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-21 10:14:33] [INFO ] Implicit Places using invariants and state equation in 623 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 777 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 101/103 places, 2206/2206 transitions.
Applied a total of 0 rules in 246 ms. Remains 101 /101 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1187 ms. Remains : 101/103 places, 2206/2206 transitions.
RANDOM walk for 40000 steps (316 resets) in 654 ms. (61 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (16 resets) in 48 ms. (81 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (15 resets) in 46 ms. (85 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (12 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (12 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (12 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (12 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (12 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (12 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (12 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (12 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (13 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (12 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (12 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (12 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (12 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (13 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (12 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (12 resets) in 28 ms. (137 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (12 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (12 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (12 resets) in 27 ms. (143 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (16 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (12 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (13 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (12 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (11 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
Interrupted probabilistic random walk after 172496 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 29
Probabilistic random walk after 172496 steps, saw 50241 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
[2024-05-21 10:14:37] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
// Phase 1: matrix 287 rows 101 cols
[2024-05-21 10:14:37] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 10:14:37] [INFO ] State equation strengthened by 101 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 39/100 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 287/387 variables, 100/104 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 101/205 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 1/388 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/388 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 206 constraints, problems are : Problem set: 0 solved, 29 unsolved in 4351 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 39/100 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 287/387 variables, 100/104 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 101/205 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 29/234 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 1/388 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 0/388 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 235 constraints, problems are : Problem set: 0 solved, 29 unsolved in 9776 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
After SMT, in 14354ms problems are : Problem set: 0 solved, 29 unsolved
Fused 29 Parikh solutions to 28 different solutions.
Parikh walk visited 1 properties in 5153 ms.
Support contains 60 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2206/2206 transitions.
Applied a total of 0 rules in 193 ms. Remains 101 /101 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 101/101 places, 2206/2206 transitions.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-05-21 10:14:57] [INFO ] Flatten gal took : 219 ms
[2024-05-21 10:15:00] [INFO ] Flatten gal took : 360 ms
[2024-05-21 10:15:02] [INFO ] Input system was already deterministic with 2208 transitions.
Computed a total of 49 stabilizing places and 84 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Running 2205 sub problems to find dead transitions.
[2024-05-21 10:15:03] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
// Phase 1: matrix 289 rows 106 cols
[2024-05-21 10:15:03] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 10:15:03] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
[2024-05-21 10:15:25] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2205 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2205/2205 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2205 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2205 constraints, Known Traps: 1/1 constraints]
After SMT, in 56737ms problems are : Problem set: 0 solved, 2205 unsolved
Search for dead transitions found 0 dead transitions in 56758ms
Finished structural reductions in LTL mode , in 1 iterations and 56768 ms. Remains : 106/106 places, 2208/2208 transitions.
[2024-05-21 10:15:59] [INFO ] Flatten gal took : 77 ms
[2024-05-21 10:16:00] [INFO ] Flatten gal took : 112 ms
[2024-05-21 10:16:00] [INFO ] Input system was already deterministic with 2208 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2207
Applied a total of 2 rules in 658 ms. Remains 105 /106 variables (removed 1) and now considering 2207/2208 (removed 1) transitions.
Running 2204 sub problems to find dead transitions.
[2024-05-21 10:16:01] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
// Phase 1: matrix 288 rows 105 cols
[2024-05-21 10:16:01] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 10:16:01] [INFO ] State equation strengthened by 101 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running BridgeAndVehicles-PT-V20P20N50
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 108
TRANSITIONS: 2228
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.101s, Sys 0.009s]
SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.020s, Sys 0.004s]
----------------------------------------------------------------------
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: 692
MODEL NAME: /home/mcc/execution/model
108 places, 2228 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-V20P20N50-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-00 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-03 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-04 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-07 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLFireability-2024-11 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716288514879
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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-V20P20N50"
export BK_EXAMINATION="CTLFireability"
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-V20P20N50, examination is CTLFireability"
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-171620397800218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P20N50.tgz
mv BridgeAndVehicles-PT-V20P20N50 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;