About the Execution of GreatSPN+red for DBSingleClientW-PT-d1m09
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1963.287 | 211865.00 | 370303.00 | 556.20 | T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r100-tall-171624200700332.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is DBSingleClientW-PT-d1m09, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-tall-171624200700332
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 12 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 12 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K 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
FORMULA_NAME QuasiLiveness
=== Now, execution of the tool begins
BK_START 1716365233073
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DBSingleClientW-PT-d1m09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 08:07:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-22 08:07:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 08:07:14] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2024-05-22 08:07:14] [INFO ] Transformed 1440 places.
[2024-05-22 08:07:14] [INFO ] Transformed 672 transitions.
[2024-05-22 08:07:14] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 217 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1440/1440 places, 672/672 transitions.
Reduce places removed 1114 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 1194 rules applied. Total rules applied 1194 place count 326 transition count 592
Applied a total of 1194 rules in 38 ms. Remains 326 /1440 variables (removed 1114) and now considering 592/672 (removed 80) transitions.
// Phase 1: matrix 592 rows 326 cols
[2024-05-22 08:07:14] [INFO ] Computed 2 invariants in 36 ms
[2024-05-22 08:07:14] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-05-22 08:07:14] [INFO ] Invariant cache hit.
[2024-05-22 08:07:15] [INFO ] State equation strengthened by 338 read => feed constraints.
[2024-05-22 08:07:16] [INFO ] Implicit Places using invariants and state equation in 1314 ms returned []
Implicit Place search using SMT with State Equation took 1750 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2024-05-22 08:07:16] [INFO ] Invariant cache hit.
[2024-05-22 08:07:16] [INFO ] State equation strengthened by 338 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/326 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 4 (OVERLAPS) 592/918 variables, 326/328 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/918 variables, 338/666 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/918 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 918/918 variables, and 666 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 326/326 constraints, ReadFeed: 338/338 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/326 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 4 (OVERLAPS) 592/918 variables, 326/328 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/918 variables, 338/666 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/918 variables, 591/1257 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 918/918 variables, and 1257 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 326/326 constraints, ReadFeed: 338/338 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 0/0 constraints]
After SMT, in 61967ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 61988ms
Starting structural reductions in LIVENESS mode, iteration 1 : 326/1440 places, 592/672 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 63814 ms. Remains : 326/1440 places, 592/672 transitions.
Discarding 275 transitions out of 592. Remains 317
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (9139 resets) in 2714 ms. (14 steps per ms) remains 256/316 properties
BEST_FIRST walk for 402 steps (19 resets) in 12 ms. (30 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (15 resets) in 11 ms. (33 steps per ms) remains 256/256 properties
BEST_FIRST walk for 401 steps (21 resets) in 9 ms. (40 steps per ms) remains 256/256 properties
BEST_FIRST walk for 402 steps (16 resets) in 13 ms. (28 steps per ms) remains 256/256 properties
BEST_FIRST walk for 404 steps (18 resets) in 12 ms. (31 steps per ms) remains 256/256 properties
BEST_FIRST walk for 404 steps (21 resets) in 14 ms. (26 steps per ms) remains 256/256 properties
BEST_FIRST walk for 401 steps (20 resets) in 15 ms. (25 steps per ms) remains 256/256 properties
BEST_FIRST walk for 402 steps (15 resets) in 13 ms. (28 steps per ms) remains 256/256 properties
BEST_FIRST walk for 402 steps (18 resets) in 8 ms. (44 steps per ms) remains 256/256 properties
BEST_FIRST walk for 402 steps (21 resets) in 7 ms. (50 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (18 resets) in 9 ms. (40 steps per ms) remains 256/256 properties
BEST_FIRST walk for 404 steps (16 resets) in 8 ms. (44 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (17 resets) in 7 ms. (50 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (23 resets) in 7 ms. (50 steps per ms) remains 256/256 properties
BEST_FIRST walk for 402 steps (16 resets) in 7 ms. (50 steps per ms) remains 256/256 properties
BEST_FIRST walk for 402 steps (16 resets) in 7 ms. (50 steps per ms) remains 256/256 properties
BEST_FIRST walk for 404 steps (28 resets) in 10 ms. (36 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (21 resets) in 9 ms. (40 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (19 resets) in 9 ms. (40 steps per ms) remains 256/256 properties
BEST_FIRST walk for 404 steps (19 resets) in 8 ms. (44 steps per ms) remains 256/256 properties
BEST_FIRST walk for 402 steps (15 resets) in 9 ms. (40 steps per ms) remains 256/256 properties
BEST_FIRST walk for 402 steps (21 resets) in 11 ms. (33 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (25 resets) in 9 ms. (40 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (20 resets) in 10 ms. (36 steps per ms) remains 256/256 properties
BEST_FIRST walk for 402 steps (21 resets) in 9 ms. (40 steps per ms) remains 256/256 properties
BEST_FIRST walk for 404 steps (18 resets) in 7 ms. (50 steps per ms) remains 256/256 properties
BEST_FIRST walk for 404 steps (15 resets) in 8 ms. (44 steps per ms) remains 256/256 properties
BEST_FIRST walk for 404 steps (18 resets) in 6 ms. (57 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (14 resets) in 8 ms. (44 steps per ms) remains 256/256 properties
BEST_FIRST walk for 402 steps (18 resets) in 9 ms. (40 steps per ms) remains 256/256 properties
BEST_FIRST walk for 404 steps (20 resets) in 8 ms. (44 steps per ms) remains 256/256 properties
BEST_FIRST walk for 402 steps (25 resets) in 10 ms. (36 steps per ms) remains 256/256 properties
BEST_FIRST walk for 404 steps (23 resets) in 7 ms. (50 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (16 resets) in 7 ms. (50 steps per ms) remains 256/256 properties
BEST_FIRST walk for 401 steps (18 resets) in 7 ms. (50 steps per ms) remains 256/256 properties
BEST_FIRST walk for 401 steps (20 resets) in 8 ms. (44 steps per ms) remains 256/256 properties
BEST_FIRST walk for 402 steps (16 resets) in 9 ms. (40 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (17 resets) in 8 ms. (44 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (22 resets) in 6 ms. (57 steps per ms) remains 256/256 properties
BEST_FIRST walk for 402 steps (21 resets) in 8 ms. (44 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (21 resets) in 22 ms. (17 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (22 resets) in 9 ms. (40 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (14 resets) in 7 ms. (50 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (16 resets) in 7 ms. (50 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (16 resets) in 9 ms. (40 steps per ms) remains 256/256 properties
BEST_FIRST walk for 402 steps (19 resets) in 7 ms. (50 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (21 resets) in 6 ms. (57 steps per ms) remains 256/256 properties
BEST_FIRST walk for 403 steps (21 resets) in 7 ms. (50 steps per ms) remains 256/256 properties
BEST_FIRST walk for 402 steps (18 resets) in 6 ms. (57 steps per ms) remains 256/256 properties
BEST_FIRST walk for 402 steps (20 resets) in 6 ms. (57 steps per ms) remains 256/256 properties
[2024-05-22 08:08:19] [INFO ] Invariant cache hit.
[2024-05-22 08:08:19] [INFO ] State equation strengthened by 338 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 20/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 26/312 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s136 0.0)
(s137 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s183 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 312/918 variables, and 2 constraints, problems are : Problem set: 0 solved, 256 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/326 constraints, ReadFeed: 0/338 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 20/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 26/312 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 578/890 variables, 312/314 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/890 variables, 324/638 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 890/918 variables, and 694 constraints, problems are : Problem set: 0 solved, 256 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 312/326 constraints, ReadFeed: 324/338 constraints, PredecessorRefiner: 56/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 10614ms problems are : Problem set: 0 solved, 256 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 266 out of 326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 326/326 places, 592/592 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 322 transition count 588
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 322 transition count 588
Applied a total of 8 rules in 64 ms. Remains 322 /326 variables (removed 4) and now considering 588/592 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 322/326 places, 588/592 transitions.
RANDOM walk for 4000000 steps (916323 resets) in 60546 ms. (66 steps per ms) remains 215/256 properties
BEST_FIRST walk for 40003 steps (1877 resets) in 194 ms. (205 steps per ms) remains 215/215 properties
BEST_FIRST walk for 40004 steps (1884 resets) in 177 ms. (224 steps per ms) remains 215/215 properties
BEST_FIRST walk for 40003 steps (1903 resets) in 174 ms. (228 steps per ms) remains 215/215 properties
BEST_FIRST walk for 40002 steps (1919 resets) in 172 ms. (231 steps per ms) remains 215/215 properties
BEST_FIRST walk for 40004 steps (1830 resets) in 170 ms. (233 steps per ms) remains 215/215 properties
BEST_FIRST walk for 40001 steps (1964 resets) in 175 ms. (227 steps per ms) remains 215/215 properties
BEST_FIRST walk for 40002 steps (1887 resets) in 176 ms. (226 steps per ms) remains 215/215 properties
BEST_FIRST walk for 40003 steps (1873 resets) in 175 ms. (227 steps per ms) remains 215/215 properties
BEST_FIRST walk for 40003 steps (2004 resets) in 176 ms. (226 steps per ms) remains 215/215 properties
BEST_FIRST walk for 40004 steps (1906 resets) in 182 ms. (218 steps per ms) remains 215/215 properties
BEST_FIRST walk for 40002 steps (1803 resets) in 170 ms. (233 steps per ms) remains 215/215 properties
BEST_FIRST walk for 40003 steps (1835 resets) in 170 ms. (233 steps per ms) remains 215/215 properties
BEST_FIRST walk for 40003 steps (1846 resets) in 170 ms. (233 steps per ms) remains 215/215 properties
BEST_FIRST walk for 40003 steps (1884 resets) in 171 ms. (232 steps per ms) remains 215/215 properties
BEST_FIRST walk for 40004 steps (1838 resets) in 172 ms. (231 steps per ms) remains 215/215 properties
BEST_FIRST walk for 40004 steps (1884 resets) in 171 ms. (232 steps per ms) remains 215/215 properties
BEST_FIRST walk for 40000 steps (1921 resets) in 174 ms. (228 steps per ms) remains 214/215 properties
BEST_FIRST walk for 40002 steps (1840 resets) in 168 ms. (236 steps per ms) remains 214/214 properties
BEST_FIRST walk for 40002 steps (1808 resets) in 170 ms. (233 steps per ms) remains 214/214 properties
BEST_FIRST walk for 40003 steps (1900 resets) in 177 ms. (224 steps per ms) remains 214/214 properties
BEST_FIRST walk for 40004 steps (1900 resets) in 175 ms. (227 steps per ms) remains 214/214 properties
BEST_FIRST walk for 40003 steps (1882 resets) in 170 ms. (233 steps per ms) remains 214/214 properties
BEST_FIRST walk for 40002 steps (1890 resets) in 177 ms. (224 steps per ms) remains 212/214 properties
BEST_FIRST walk for 40004 steps (1893 resets) in 174 ms. (228 steps per ms) remains 212/212 properties
BEST_FIRST walk for 40003 steps (1910 resets) in 170 ms. (233 steps per ms) remains 212/212 properties
BEST_FIRST walk for 40004 steps (1870 resets) in 171 ms. (232 steps per ms) remains 211/212 properties
BEST_FIRST walk for 40002 steps (1781 resets) in 167 ms. (238 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40003 steps (1906 resets) in 171 ms. (232 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40001 steps (1964 resets) in 177 ms. (224 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40002 steps (1885 resets) in 173 ms. (229 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40001 steps (1854 resets) in 175 ms. (227 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40002 steps (1907 resets) in 178 ms. (223 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40002 steps (1836 resets) in 172 ms. (231 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40001 steps (1824 resets) in 173 ms. (229 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40001 steps (1955 resets) in 177 ms. (224 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40002 steps (1870 resets) in 175 ms. (227 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40001 steps (1851 resets) in 174 ms. (228 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40004 steps (1832 resets) in 173 ms. (229 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40000 steps (1833 resets) in 173 ms. (229 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40002 steps (1841 resets) in 173 ms. (229 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40003 steps (1925 resets) in 176 ms. (226 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40003 steps (1914 resets) in 177 ms. (224 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40004 steps (1881 resets) in 176 ms. (226 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40000 steps (1894 resets) in 177 ms. (224 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40001 steps (1826 resets) in 170 ms. (233 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40002 steps (1900 resets) in 179 ms. (222 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40003 steps (1939 resets) in 180 ms. (221 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40003 steps (1917 resets) in 178 ms. (223 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40002 steps (1841 resets) in 266 ms. (149 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40002 steps (1875 resets) in 175 ms. (227 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40004 steps (1870 resets) in 174 ms. (228 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40004 steps (1877 resets) in 180 ms. (221 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40002 steps (1794 resets) in 178 ms. (223 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40003 steps (1868 resets) in 177 ms. (224 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40003 steps (1897 resets) in 177 ms. (224 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40002 steps (1839 resets) in 176 ms. (226 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40003 steps (1904 resets) in 177 ms. (224 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40002 steps (1876 resets) in 212 ms. (187 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40002 steps (1917 resets) in 180 ms. (221 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40003 steps (1886 resets) in 174 ms. (228 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40003 steps (1830 resets) in 173 ms. (229 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40003 steps (1879 resets) in 173 ms. (229 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40004 steps (1912 resets) in 176 ms. (226 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40003 steps (1845 resets) in 171 ms. (232 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40003 steps (1896 resets) in 175 ms. (227 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40003 steps (1824 resets) in 173 ms. (229 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40003 steps (1832 resets) in 223 ms. (178 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40003 steps (1946 resets) in 219 ms. (181 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40002 steps (1940 resets) in 181 ms. (219 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40004 steps (1824 resets) in 171 ms. (232 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40004 steps (1875 resets) in 178 ms. (223 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40001 steps (1932 resets) in 185 ms. (215 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40003 steps (1880 resets) in 176 ms. (226 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40002 steps (1888 resets) in 174 ms. (228 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40004 steps (1881 resets) in 172 ms. (231 steps per ms) remains 211/211 properties
// Phase 1: matrix 588 rows 322 cols
[2024-05-22 08:08:49] [INFO ] Computed 2 invariants in 6 ms
[2024-05-22 08:08:49] [INFO ] State equation strengthened by 338 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 31/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 34/290 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 538/828 variables, 290/292 constraints. Problems are: Problem set: 0 solved, 211 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/828 variables, 288/580 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/828 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 80/908 variables, 31/611 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/908 variables, 49/660 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/908 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 11 (OVERLAPS) 2/910 variables, 1/661 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/910 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/910 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 910/910 variables, and 662 constraints, problems are : Problem set: 0 solved, 211 unsolved in 45022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 322/322 constraints, ReadFeed: 338/338 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 31/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 34/290 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 538/828 variables, 290/292 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/828 variables, 288/580 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/828 variables, 38/618 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-22 08:09:41] [INFO ] Deduced a trap composed of 105 places in 94 ms of which 15 ms to minimize.
[2024-05-22 08:09:41] [INFO ] Deduced a trap composed of 108 places in 80 ms of which 2 ms to minimize.
[2024-05-22 08:09:41] [INFO ] Deduced a trap composed of 108 places in 77 ms of which 2 ms to minimize.
[2024-05-22 08:09:41] [INFO ] Deduced a trap composed of 108 places in 67 ms of which 1 ms to minimize.
[2024-05-22 08:09:41] [INFO ] Deduced a trap composed of 115 places in 69 ms of which 2 ms to minimize.
[2024-05-22 08:09:41] [INFO ] Deduced a trap composed of 109 places in 78 ms of which 2 ms to minimize.
[2024-05-22 08:09:41] [INFO ] Deduced a trap composed of 109 places in 67 ms of which 9 ms to minimize.
[2024-05-22 08:09:41] [INFO ] Deduced a trap composed of 107 places in 64 ms of which 2 ms to minimize.
[2024-05-22 08:09:41] [INFO ] Deduced a trap composed of 108 places in 58 ms of which 1 ms to minimize.
[2024-05-22 08:09:41] [INFO ] Deduced a trap composed of 110 places in 74 ms of which 1 ms to minimize.
[2024-05-22 08:09:41] [INFO ] Deduced a trap composed of 108 places in 59 ms of which 2 ms to minimize.
[2024-05-22 08:09:42] [INFO ] Deduced a trap composed of 105 places in 64 ms of which 1 ms to minimize.
[2024-05-22 08:09:42] [INFO ] Deduced a trap composed of 109 places in 63 ms of which 1 ms to minimize.
[2024-05-22 08:09:42] [INFO ] Deduced a trap composed of 109 places in 58 ms of which 2 ms to minimize.
[2024-05-22 08:09:42] [INFO ] Deduced a trap composed of 114 places in 67 ms of which 1 ms to minimize.
[2024-05-22 08:09:42] [INFO ] Deduced a trap composed of 109 places in 63 ms of which 1 ms to minimize.
[2024-05-22 08:09:42] [INFO ] Deduced a trap composed of 111 places in 68 ms of which 2 ms to minimize.
[2024-05-22 08:09:42] [INFO ] Deduced a trap composed of 112 places in 66 ms of which 2 ms to minimize.
[2024-05-22 08:09:43] [INFO ] Deduced a trap composed of 112 places in 60 ms of which 1 ms to minimize.
[2024-05-22 08:09:43] [INFO ] Deduced a trap composed of 116 places in 61 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/828 variables, 20/638 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-22 08:09:49] [INFO ] Deduced a trap composed of 114 places in 66 ms of which 1 ms to minimize.
[2024-05-22 08:09:49] [INFO ] Deduced a trap composed of 117 places in 58 ms of which 2 ms to minimize.
[2024-05-22 08:09:50] [INFO ] Deduced a trap composed of 117 places in 59 ms of which 1 ms to minimize.
[2024-05-22 08:09:50] [INFO ] Deduced a trap composed of 121 places in 64 ms of which 1 ms to minimize.
[2024-05-22 08:09:50] [INFO ] Deduced a trap composed of 121 places in 57 ms of which 1 ms to minimize.
[2024-05-22 08:09:50] [INFO ] Deduced a trap composed of 115 places in 57 ms of which 1 ms to minimize.
[2024-05-22 08:09:50] [INFO ] Deduced a trap composed of 119 places in 57 ms of which 2 ms to minimize.
[2024-05-22 08:09:50] [INFO ] Deduced a trap composed of 114 places in 72 ms of which 1 ms to minimize.
[2024-05-22 08:09:50] [INFO ] Deduced a trap composed of 114 places in 71 ms of which 3 ms to minimize.
[2024-05-22 08:09:51] [INFO ] Deduced a trap composed of 115 places in 73 ms of which 2 ms to minimize.
[2024-05-22 08:09:51] [INFO ] Deduced a trap composed of 118 places in 74 ms of which 1 ms to minimize.
[2024-05-22 08:09:51] [INFO ] Deduced a trap composed of 115 places in 72 ms of which 1 ms to minimize.
[2024-05-22 08:09:51] [INFO ] Deduced a trap composed of 113 places in 75 ms of which 2 ms to minimize.
[2024-05-22 08:09:51] [INFO ] Deduced a trap composed of 112 places in 74 ms of which 2 ms to minimize.
[2024-05-22 08:09:51] [INFO ] Deduced a trap composed of 114 places in 70 ms of which 2 ms to minimize.
[2024-05-22 08:09:51] [INFO ] Deduced a trap composed of 112 places in 72 ms of which 2 ms to minimize.
[2024-05-22 08:09:51] [INFO ] Deduced a trap composed of 109 places in 66 ms of which 2 ms to minimize.
[2024-05-22 08:09:51] [INFO ] Deduced a trap composed of 108 places in 77 ms of which 2 ms to minimize.
[2024-05-22 08:09:51] [INFO ] Deduced a trap composed of 108 places in 79 ms of which 1 ms to minimize.
[2024-05-22 08:09:52] [INFO ] Deduced a trap composed of 106 places in 78 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/828 variables, 20/658 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-22 08:09:58] [INFO ] Deduced a trap composed of 92 places in 72 ms of which 1 ms to minimize.
[2024-05-22 08:09:59] [INFO ] Deduced a trap composed of 98 places in 64 ms of which 1 ms to minimize.
[2024-05-22 08:09:59] [INFO ] Deduced a trap composed of 99 places in 70 ms of which 2 ms to minimize.
[2024-05-22 08:09:59] [INFO ] Deduced a trap composed of 105 places in 73 ms of which 2 ms to minimize.
[2024-05-22 08:09:59] [INFO ] Deduced a trap composed of 106 places in 67 ms of which 2 ms to minimize.
[2024-05-22 08:10:00] [INFO ] Deduced a trap composed of 118 places in 74 ms of which 1 ms to minimize.
[2024-05-22 08:10:00] [INFO ] Deduced a trap composed of 116 places in 67 ms of which 2 ms to minimize.
[2024-05-22 08:10:00] [INFO ] Deduced a trap composed of 117 places in 91 ms of which 1 ms to minimize.
[2024-05-22 08:10:01] [INFO ] Deduced a trap composed of 118 places in 88 ms of which 1 ms to minimize.
[2024-05-22 08:10:01] [INFO ] Deduced a trap composed of 117 places in 92 ms of which 1 ms to minimize.
[2024-05-22 08:10:01] [INFO ] Deduced a trap composed of 115 places in 84 ms of which 2 ms to minimize.
[2024-05-22 08:10:01] [INFO ] Deduced a trap composed of 115 places in 81 ms of which 1 ms to minimize.
[2024-05-22 08:10:01] [INFO ] Deduced a trap composed of 116 places in 88 ms of which 1 ms to minimize.
[2024-05-22 08:10:01] [INFO ] Deduced a trap composed of 101 places in 82 ms of which 2 ms to minimize.
[2024-05-22 08:10:01] [INFO ] Deduced a trap composed of 102 places in 84 ms of which 2 ms to minimize.
[2024-05-22 08:10:01] [INFO ] Deduced a trap composed of 104 places in 81 ms of which 2 ms to minimize.
[2024-05-22 08:10:02] [INFO ] Deduced a trap composed of 105 places in 89 ms of which 6 ms to minimize.
[2024-05-22 08:10:02] [INFO ] Deduced a trap composed of 104 places in 84 ms of which 2 ms to minimize.
[2024-05-22 08:10:02] [INFO ] Deduced a trap composed of 98 places in 79 ms of which 2 ms to minimize.
[2024-05-22 08:10:02] [INFO ] Deduced a trap composed of 95 places in 80 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/828 variables, 20/678 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-22 08:10:11] [INFO ] Deduced a trap composed of 104 places in 77 ms of which 1 ms to minimize.
[2024-05-22 08:10:11] [INFO ] Deduced a trap composed of 101 places in 78 ms of which 2 ms to minimize.
[2024-05-22 08:10:11] [INFO ] Deduced a trap composed of 102 places in 75 ms of which 1 ms to minimize.
[2024-05-22 08:10:11] [INFO ] Deduced a trap composed of 104 places in 75 ms of which 1 ms to minimize.
[2024-05-22 08:10:11] [INFO ] Deduced a trap composed of 105 places in 71 ms of which 1 ms to minimize.
[2024-05-22 08:10:12] [INFO ] Deduced a trap composed of 104 places in 77 ms of which 2 ms to minimize.
[2024-05-22 08:10:12] [INFO ] Deduced a trap composed of 105 places in 78 ms of which 1 ms to minimize.
[2024-05-22 08:10:12] [INFO ] Deduced a trap composed of 105 places in 70 ms of which 1 ms to minimize.
[2024-05-22 08:10:12] [INFO ] Deduced a trap composed of 104 places in 76 ms of which 1 ms to minimize.
[2024-05-22 08:10:12] [INFO ] Deduced a trap composed of 108 places in 80 ms of which 2 ms to minimize.
[2024-05-22 08:10:12] [INFO ] Deduced a trap composed of 109 places in 78 ms of which 1 ms to minimize.
[2024-05-22 08:10:12] [INFO ] Deduced a trap composed of 112 places in 79 ms of which 2 ms to minimize.
[2024-05-22 08:10:13] [INFO ] Deduced a trap composed of 111 places in 80 ms of which 2 ms to minimize.
[2024-05-22 08:10:13] [INFO ] Deduced a trap composed of 109 places in 73 ms of which 1 ms to minimize.
[2024-05-22 08:10:13] [INFO ] Deduced a trap composed of 108 places in 77 ms of which 2 ms to minimize.
[2024-05-22 08:10:13] [INFO ] Deduced a trap composed of 106 places in 76 ms of which 2 ms to minimize.
[2024-05-22 08:10:13] [INFO ] Deduced a trap composed of 112 places in 77 ms of which 2 ms to minimize.
[2024-05-22 08:10:13] [INFO ] Deduced a trap composed of 113 places in 74 ms of which 1 ms to minimize.
[2024-05-22 08:10:13] [INFO ] Deduced a trap composed of 115 places in 73 ms of which 2 ms to minimize.
[2024-05-22 08:10:13] [INFO ] Deduced a trap composed of 115 places in 77 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/828 variables, 20/698 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 828/910 variables, and 698 constraints, problems are : Problem set: 0 solved, 211 unsolved in 45013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 290/322 constraints, ReadFeed: 288/338 constraints, PredecessorRefiner: 38/211 constraints, Known Traps: 80/80 constraints]
After SMT, in 90451ms problems are : Problem set: 0 solved, 211 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 225 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 588/588 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 311 transition count 541
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 311 transition count 541
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 302 transition count 532
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 302 transition count 532
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 298 transition count 528
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 298 transition count 528
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 298 transition count 526
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 297 transition count 524
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 297 transition count 524
Applied a total of 52 rules in 52 ms. Remains 297 /322 variables (removed 25) and now considering 524/588 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 297/322 places, 524/588 transitions.
RANDOM walk for 4000000 steps (917215 resets) in 54387 ms. (73 steps per ms) remains 200/211 properties
BEST_FIRST walk for 40003 steps (1874 resets) in 196 ms. (203 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40003 steps (1874 resets) in 291 ms. (136 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (1875 resets) in 195 ms. (204 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40003 steps (1858 resets) in 273 ms. (145 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40003 steps (1916 resets) in 302 ms. (132 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40002 steps (1853 resets) in 291 ms. (136 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (1877 resets) in 236 ms. (168 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40002 steps (1834 resets) in 218 ms. (182 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40002 steps (1914 resets) in 318 ms. (125 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (1788 resets) in 312 ms. (127 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40003 steps (1883 resets) in 317 ms. (125 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40003 steps (1849 resets) in 321 ms. (124 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40002 steps (1834 resets) in 308 ms. (129 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40003 steps (1902 resets) in 360 ms. (110 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (1862 resets) in 327 ms. (121 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (1842 resets) in 321 ms. (124 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40003 steps (1894 resets) in 329 ms. (121 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40002 steps (1886 resets) in 231 ms. (172 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40003 steps (1869 resets) in 315 ms. (126 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40002 steps (1911 resets) in 244 ms. (163 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (1908 resets) in 228 ms. (174 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (1894 resets) in 255 ms. (156 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (1943 resets) in 294 ms. (135 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40001 steps (1887 resets) in 232 ms. (171 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40003 steps (1818 resets) in 269 ms. (148 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40003 steps (1887 resets) in 233 ms. (170 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (1839 resets) in 252 ms. (158 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (1832 resets) in 372 ms. (107 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (1862 resets) in 344 ms. (115 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40003 steps (1859 resets) in 350 ms. (113 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40003 steps (1914 resets) in 333 ms. (119 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (1862 resets) in 313 ms. (127 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40003 steps (1882 resets) in 305 ms. (130 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40001 steps (1894 resets) in 321 ms. (124 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40002 steps (1877 resets) in 231 ms. (172 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40002 steps (1867 resets) in 244 ms. (163 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40003 steps (1864 resets) in 304 ms. (131 steps per ms) remains 196/200 properties
BEST_FIRST walk for 40003 steps (1860 resets) in 314 ms. (126 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (1940 resets) in 219 ms. (181 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (1854 resets) in 217 ms. (183 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (1837 resets) in 231 ms. (172 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (1875 resets) in 260 ms. (153 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40002 steps (1828 resets) in 331 ms. (120 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (1856 resets) in 252 ms. (158 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40004 steps (1883 resets) in 300 ms. (132 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40002 steps (1906 resets) in 334 ms. (119 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40002 steps (1968 resets) in 309 ms. (129 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40002 steps (1865 resets) in 293 ms. (136 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40004 steps (1895 resets) in 232 ms. (171 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40001 steps (1923 resets) in 307 ms. (129 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40004 steps (1824 resets) in 321 ms. (124 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40002 steps (1906 resets) in 246 ms. (161 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (1925 resets) in 355 ms. (112 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40004 steps (1918 resets) in 332 ms. (120 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (1847 resets) in 312 ms. (127 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (1863 resets) in 239 ms. (166 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40002 steps (1930 resets) in 324 ms. (123 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (1829 resets) in 308 ms. (129 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40002 steps (1902 resets) in 316 ms. (126 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40002 steps (1891 resets) in 321 ms. (124 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (1867 resets) in 327 ms. (121 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (1966 resets) in 297 ms. (134 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40002 steps (1871 resets) in 322 ms. (123 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40004 steps (1807 resets) in 244 ms. (163 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (1917 resets) in 366 ms. (109 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (1964 resets) in 331 ms. (120 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (1817 resets) in 233 ms. (170 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40002 steps (1960 resets) in 263 ms. (151 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (1888 resets) in 228 ms. (174 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (1855 resets) in 233 ms. (170 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (1870 resets) in 379 ms. (105 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40001 steps (1898 resets) in 383 ms. (104 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40004 steps (1888 resets) in 363 ms. (109 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40002 steps (1936 resets) in 240 ms. (165 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40002 steps (1855 resets) in 341 ms. (116 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (1894 resets) in 394 ms. (101 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40002 steps (1906 resets) in 334 ms. (119 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40002 steps (1872 resets) in 331 ms. (120 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40002 steps (1906 resets) in 332 ms. (120 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40002 steps (1817 resets) in 260 ms. (153 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40002 steps (1876 resets) in 269 ms. (148 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40004 steps (1844 resets) in 235 ms. (169 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40004 steps (1957 resets) in 244 ms. (163 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40002 steps (1829 resets) in 344 ms. (115 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40002 steps (1900 resets) in 256 ms. (155 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40002 steps (1877 resets) in 242 ms. (164 steps per ms) remains 196/196 properties
Finished probabilistic random walk after 336837 steps, run visited all 196 properties in 2875 ms. (steps per millisecond=117 )
Probabilistic random walk after 336837 steps, saw 139569 distinct states, run finished after 2879 ms. (steps per millisecond=116 ) properties seen :196
Able to resolve query QuasiLiveness after proving 317 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 210702 ms.
ITS solved all properties within timeout
BK_STOP 1716365444938
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d1m09"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is DBSingleClientW-PT-d1m09, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r100-tall-171624200700332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m09.tgz
mv DBSingleClientW-PT-d1m09 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;