fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r113-smll-171624274300159
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for DLCround-PT-05b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5122.724 580983.00 634817.00 1791.30 FFFTFFTFTTFTTTT? 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.r113-smll-171624274300159.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 DLCround-PT-05b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r113-smll-171624274300159
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 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 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 12:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 13 12:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 12:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 145K Apr 13 12:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 674K 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 DLCround-PT-05b-ReachabilityFireability-2024-00
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-2024-01
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-2024-02
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-2024-03
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-2024-04
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-2024-05
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-2024-06
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-2024-07
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-2024-08
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-2024-09
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-2024-10
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-2024-11
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-2024-12
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-2024-13
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-2024-14
FORMULA_NAME DLCround-PT-05b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716355038080

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 05:17:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 05:17:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 05:17:21] [INFO ] Load time of PNML (sax parser for PT used): 527 ms
[2024-05-22 05:17:21] [INFO ] Transformed 1999 places.
[2024-05-22 05:17:21] [INFO ] Transformed 2887 transitions.
[2024-05-22 05:17:21] [INFO ] Found NUPN structural information;
[2024-05-22 05:17:21] [INFO ] Parsed PT model containing 1999 places and 2887 transitions and 7649 arcs in 834 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 47 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2349 ms. (17 steps per ms) remains 5/16 properties
FORMULA DLCround-PT-05b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 851 ms. (46 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 421 ms. (94 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 378 ms. (105 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 248 ms. (160 steps per ms) remains 5/5 properties
// Phase 1: matrix 2887 rows 1999 cols
[2024-05-22 05:17:23] [INFO ] Computed 88 invariants in 54 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 246/246 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1723/1969 variables, 85/331 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1969 variables, 1723/2054 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1969 variables, 0/2054 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 30/1999 variables, 3/2057 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1999 variables, 30/2087 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1999 variables, 0/2087 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2887/4886 variables, 1999/4086 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4886 variables, 0/4086 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.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 (/ 1.0 56.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 (/ 1.0 56.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 (/ 1.0 56.0))
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 (/ 1.0 56.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 (/ 1.0 56.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 (/ 1.0 56.0))
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 (/ 25.0 28.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 (/ 6.0 7.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 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 (/ 1.0 56.0))
(s165 0.0)
(s166 0.0)
(s167 (/ 1.0 56.0))
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 (/ 1.0 56.0))
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 (/ 1.0 56.0))
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 (/ 1.0 56.0))
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 (/ 1.0 56.0))
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 (/ 1.0 56.0))
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 (/ 1.0 56.0))
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 (/ 1.0 56.0))
(s241 0.0)
(s242 0.0)
(s243 (/ 1.0 56.0))
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 (/ 1.0 56.0))
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 (/ 1.0 56.0))
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 (/ 1.0 56.0))
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 (/ 51.0 56.0))
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 (/ 1.0 56.0))
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 (/ 1.0 56.0))
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 (/ 1.0 56.0))
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4886/4886 variables, and 4086 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5061 ms.
Refiners :[Domain max(s): 1999/1999 constraints, Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 1999/1999 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 246/246 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem DLCround-PT-05b-ReachabilityFireability-2024-08 is UNSAT
FORMULA DLCround-PT-05b-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1723/1969 variables, 85/331 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1969 variables, 1723/2054 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1969 variables, 0/2054 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 30/1999 variables, 3/2057 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1999 variables, 30/2087 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1999 variables, 0/2087 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2887/4886 variables, 1999/4086 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4886 variables, 4/4090 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4886/4886 variables, and 4090 constraints, problems are : Problem set: 1 solved, 4 unsolved in 5010 ms.
Refiners :[Domain max(s): 1999/1999 constraints, Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 1999/1999 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 10705ms problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 223 out of 1999 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1999/1999 places, 2887/2887 transitions.
Graph (trivial) has 1495 edges and 1999 vertex of which 122 / 1999 are part of one of the 17 SCC in 12 ms
Free SCC test removed 105 places
Drop transitions (Empty/Sink Transition effects.) removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 686 transitions
Trivial Post-agglo rules discarded 686 transitions
Performed 686 trivial Post agglomeration. Transition count delta: 686
Iterating post reduction 0 with 686 rules applied. Total rules applied 687 place count 1894 transition count 2079
Reduce places removed 686 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 703 rules applied. Total rules applied 1390 place count 1208 transition count 2062
Reduce places removed 9 places and 0 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 2 with 88 rules applied. Total rules applied 1478 place count 1199 transition count 1983
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 82 rules applied. Total rules applied 1560 place count 1120 transition count 1980
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1561 place count 1119 transition count 1980
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 73 Pre rules applied. Total rules applied 1561 place count 1119 transition count 1907
Deduced a syphon composed of 73 places in 8 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 1707 place count 1046 transition count 1907
Discarding 199 places :
Symmetric choice reduction at 5 with 199 rule applications. Total rules 1906 place count 847 transition count 1708
Iterating global reduction 5 with 199 rules applied. Total rules applied 2105 place count 847 transition count 1708
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 14 rules applied. Total rules applied 2119 place count 847 transition count 1694
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 2121 place count 846 transition count 1693
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2122 place count 845 transition count 1693
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 51 Pre rules applied. Total rules applied 2122 place count 845 transition count 1642
Deduced a syphon composed of 51 places in 21 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 8 with 102 rules applied. Total rules applied 2224 place count 794 transition count 1642
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 2233 place count 785 transition count 1588
Iterating global reduction 8 with 9 rules applied. Total rules applied 2242 place count 785 transition count 1588
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2243 place count 785 transition count 1587
Performed 166 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 166 places in 3 ms
Reduce places removed 166 places and 0 transitions.
Iterating global reduction 9 with 332 rules applied. Total rules applied 2575 place count 619 transition count 1419
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2577 place count 617 transition count 1401
Iterating global reduction 9 with 2 rules applied. Total rules applied 2579 place count 617 transition count 1401
Performed 45 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 45 places in 5 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 9 with 90 rules applied. Total rules applied 2669 place count 572 transition count 1741
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 9 with 29 rules applied. Total rules applied 2698 place count 572 transition count 1712
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2701 place count 569 transition count 1668
Iterating global reduction 10 with 3 rules applied. Total rules applied 2704 place count 569 transition count 1668
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 2711 place count 569 transition count 1661
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 11 with 33 rules applied. Total rules applied 2744 place count 569 transition count 1628
Free-agglomeration rule applied 92 times with reduction of 5 identical transitions.
Iterating global reduction 11 with 92 rules applied. Total rules applied 2836 place count 569 transition count 1531
Reduce places removed 92 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 11 with 142 rules applied. Total rules applied 2978 place count 477 transition count 1481
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 12 with 26 rules applied. Total rules applied 3004 place count 477 transition count 1455
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 12 with 15 rules applied. Total rules applied 3019 place count 477 transition count 1455
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 3021 place count 477 transition count 1455
Applied a total of 3021 rules in 1059 ms. Remains 477 /1999 variables (removed 1522) and now considering 1455/2887 (removed 1432) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1073 ms. Remains : 477/1999 places, 1455/2887 transitions.
RANDOM walk for 40000 steps (8 resets) in 849 ms. (47 steps per ms) remains 3/4 properties
FORMULA DLCround-PT-05b-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 487 ms. (81 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 286 ms. (139 steps per ms) remains 3/3 properties
[2024-05-22 05:17:35] [INFO ] Flow matrix only has 1113 transitions (discarded 342 similar events)
// Phase 1: matrix 1113 rows 477 cols
[2024-05-22 05:17:35] [INFO ] Computed 88 invariants in 5 ms
[2024-05-22 05:17:35] [INFO ] State equation strengthened by 160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 287/470 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/477 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1113/1590 variables, 477/565 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1590 variables, 160/725 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1590 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1590 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1590/1590 variables, and 725 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1264 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 477/477 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 287/470 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/477 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1113/1590 variables, 477/565 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1590 variables, 160/725 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1590 variables, 3/728 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1590 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1590 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1590/1590 variables, and 728 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2679 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 477/477 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 4167ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA DLCround-PT-05b-ReachabilityFireability-2024-07 FALSE TECHNIQUES PARIKH_WALK
FORMULA DLCround-PT-05b-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 616 ms.
Support contains 74 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 1455/1455 transitions.
Graph (trivial) has 267 edges and 477 vertex of which 35 / 477 are part of one of the 10 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 452 transition count 1380
Reduce places removed 32 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 37 rules applied. Total rules applied 70 place count 420 transition count 1375
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 77 place count 415 transition count 1373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 414 transition count 1373
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 78 place count 414 transition count 1360
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 104 place count 401 transition count 1360
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 108 place count 401 transition count 1356
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 121 place count 388 transition count 1271
Iterating global reduction 5 with 13 rules applied. Total rules applied 134 place count 388 transition count 1271
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 144 place count 388 transition count 1261
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 144 place count 388 transition count 1260
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 146 place count 387 transition count 1260
Performed 42 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 230 place count 345 transition count 1217
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 255 place count 345 transition count 1192
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 257 place count 343 transition count 1177
Iterating global reduction 7 with 2 rules applied. Total rules applied 259 place count 343 transition count 1177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 260 place count 343 transition count 1176
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -151
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 8 with 44 rules applied. Total rules applied 304 place count 321 transition count 1327
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 8 with 57 rules applied. Total rules applied 361 place count 321 transition count 1270
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 366 place count 316 transition count 1202
Iterating global reduction 9 with 5 rules applied. Total rules applied 371 place count 316 transition count 1202
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 376 place count 316 transition count 1197
Drop transitions (Redundant composition of simpler transitions.) removed 90 transitions
Redundant transition composition rules discarded 90 transitions
Iterating global reduction 10 with 90 rules applied. Total rules applied 466 place count 316 transition count 1107
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 469 place count 313 transition count 1080
Iterating global reduction 10 with 3 rules applied. Total rules applied 472 place count 313 transition count 1080
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 475 place count 313 transition count 1077
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 477 place count 312 transition count 1083
Free-agglomeration rule applied 58 times with reduction of 16 identical transitions.
Iterating global reduction 11 with 58 rules applied. Total rules applied 535 place count 312 transition count 1009
Reduce places removed 58 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 111 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 116 transitions.
Graph (complete) has 956 edges and 254 vertex of which 253 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 11 with 175 rules applied. Total rules applied 710 place count 253 transition count 893
Drop transitions (Redundant composition of simpler transitions.) removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 12 with 62 rules applied. Total rules applied 772 place count 253 transition count 831
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 916 edges and 252 vertex of which 250 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 2 rules applied. Total rules applied 774 place count 250 transition count 831
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 784 place count 250 transition count 821
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 786 place count 248 transition count 810
Iterating global reduction 14 with 2 rules applied. Total rules applied 788 place count 248 transition count 810
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 790 place count 247 transition count 816
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 791 place count 247 transition count 815
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 14 with 9 rules applied. Total rules applied 800 place count 246 transition count 807
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 15 with 4 rules applied. Total rules applied 804 place count 246 transition count 803
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 805 place count 246 transition count 802
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 806 place count 245 transition count 802
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 16 with 7 rules applied. Total rules applied 813 place count 245 transition count 802
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 814 place count 245 transition count 802
Applied a total of 814 rules in 271 ms. Remains 245 /477 variables (removed 232) and now considering 802/1455 (removed 653) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 271 ms. Remains : 245/477 places, 802/1455 transitions.
RANDOM walk for 40000 steps (8 resets) in 938 ms. (42 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 258 ms. (154 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 736101 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :0 out of 1
Probabilistic random walk after 736101 steps, saw 623630 distinct states, run finished after 3006 ms. (steps per millisecond=244 ) properties seen :0
[2024-05-22 05:17:43] [INFO ] Flow matrix only has 483 transitions (discarded 319 similar events)
// Phase 1: matrix 483 rows 245 cols
[2024-05-22 05:17:43] [INFO ] Computed 83 invariants in 4 ms
[2024-05-22 05:17:43] [INFO ] State equation strengthened by 111 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 162/236 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/245 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 483/728 variables, 245/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/728 variables, 111/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/728 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/728 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 728/728 variables, and 439 constraints, problems are : Problem set: 0 solved, 1 unsolved in 305 ms.
Refiners :[Positive P Invariants (semi-flows): 83/83 constraints, State Equation: 245/245 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 162/236 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/245 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 483/728 variables, 245/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/728 variables, 111/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/728 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/728 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/728 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 728/728 variables, and 440 constraints, problems are : Problem set: 0 solved, 1 unsolved in 932 ms.
Refiners :[Positive P Invariants (semi-flows): 83/83 constraints, State Equation: 245/245 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1295ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 129 ms.
Support contains 74 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 802/802 transitions.
Applied a total of 0 rules in 20 ms. Remains 245 /245 variables (removed 0) and now considering 802/802 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 245/245 places, 802/802 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 802/802 transitions.
Applied a total of 0 rules in 22 ms. Remains 245 /245 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2024-05-22 05:17:45] [INFO ] Flow matrix only has 483 transitions (discarded 319 similar events)
[2024-05-22 05:17:45] [INFO ] Invariant cache hit.
[2024-05-22 05:17:45] [INFO ] Implicit Places using invariants in 306 ms returned [242]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 319 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 244/245 places, 802/802 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 63 transitions
Redundant transition composition rules discarded 63 transitions
Iterating global reduction 0 with 63 rules applied. Total rules applied 63 place count 244 transition count 739
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 242 transition count 739
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 240 transition count 733
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 240 transition count 733
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 240 transition count 732
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 73 place count 239 transition count 730
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 79 place count 239 transition count 724
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 239 transition count 723
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 238 transition count 723
Applied a total of 81 rules in 82 ms. Remains 238 /244 variables (removed 6) and now considering 723/802 (removed 79) transitions.
[2024-05-22 05:17:45] [INFO ] Flow matrix only has 465 transitions (discarded 258 similar events)
// Phase 1: matrix 465 rows 238 cols
[2024-05-22 05:17:45] [INFO ] Computed 78 invariants in 3 ms
[2024-05-22 05:17:46] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-22 05:17:46] [INFO ] Flow matrix only has 465 transitions (discarded 258 similar events)
[2024-05-22 05:17:46] [INFO ] Invariant cache hit.
[2024-05-22 05:17:46] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-22 05:17:46] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 238/245 places, 723/802 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1214 ms. Remains : 238/245 places, 723/802 transitions.
RANDOM walk for 40000 steps (8 resets) in 368 ms. (108 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 774088 steps, run timeout after 3001 ms. (steps per millisecond=257 ) properties seen :0 out of 1
Probabilistic random walk after 774088 steps, saw 653724 distinct states, run finished after 3001 ms. (steps per millisecond=257 ) properties seen :0
[2024-05-22 05:17:49] [INFO ] Flow matrix only has 465 transitions (discarded 258 similar events)
[2024-05-22 05:17:49] [INFO ] Invariant cache hit.
[2024-05-22 05:17:49] [INFO ] State equation strengthened by 102 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 157/231 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/238 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 465/703 variables, 238/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 102/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/703 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 703/703 variables, and 418 constraints, problems are : Problem set: 0 solved, 1 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 78/78 constraints, State Equation: 238/238 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 157/231 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/238 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 465/703 variables, 238/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 102/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 05:17:50] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/703 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/703 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/703 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 703/703 variables, and 420 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1048 ms.
Refiners :[Positive P Invariants (semi-flows): 78/78 constraints, State Equation: 238/238 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1367ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 74 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 723/723 transitions.
Applied a total of 0 rules in 13 ms. Remains 238 /238 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 238/238 places, 723/723 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 723/723 transitions.
Applied a total of 0 rules in 12 ms. Remains 238 /238 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2024-05-22 05:17:51] [INFO ] Flow matrix only has 465 transitions (discarded 258 similar events)
[2024-05-22 05:17:51] [INFO ] Invariant cache hit.
[2024-05-22 05:17:51] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-22 05:17:51] [INFO ] Flow matrix only has 465 transitions (discarded 258 similar events)
[2024-05-22 05:17:51] [INFO ] Invariant cache hit.
[2024-05-22 05:17:51] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-22 05:17:52] [INFO ] Implicit Places using invariants and state equation in 732 ms returned []
Implicit Place search using SMT with State Equation took 998 ms to find 0 implicit places.
[2024-05-22 05:17:52] [INFO ] Redundant transitions in 74 ms returned []
Running 715 sub problems to find dead transitions.
[2024-05-22 05:17:52] [INFO ] Flow matrix only has 465 transitions (discarded 258 similar events)
[2024-05-22 05:17:52] [INFO ] Invariant cache hit.
[2024-05-22 05:17:52] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 715 unsolved
[2024-05-22 05:18:03] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 6 ms to minimize.
[2024-05-22 05:18:03] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 3 ms to minimize.
[2024-05-22 05:18:04] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 3 ms to minimize.
[2024-05-22 05:18:04] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 2 ms to minimize.
[2024-05-22 05:18:04] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 2 ms to minimize.
[2024-05-22 05:18:05] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 4 (OVERLAPS) 465/703 variables, 238/322 constraints. Problems are: Problem set: 0 solved, 715 unsolved
SMT process timed out in 30728ms, After SMT, problems are : Problem set: 0 solved, 715 unsolved
Search for dead transitions found 0 dead transitions in 30748ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31849 ms. Remains : 238/238 places, 723/723 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 265 edges and 238 vertex of which 35 / 238 are part of one of the 17 SCC in 1 ms
Free SCC test removed 18 places
Drop transitions (Empty/Sink Transition effects.) removed 89 transitions
Ensure Unique test removed 245 transitions
Reduce isomorphic transitions removed 334 transitions.
Graph (complete) has 518 edges and 220 vertex of which 188 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.0 ms
Discarding 32 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 188 transition count 387
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 186 transition count 386
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 12 place count 181 transition count 369
Iterating global reduction 2 with 5 rules applied. Total rules applied 17 place count 181 transition count 369
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 181 transition count 367
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 23 place count 179 transition count 365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 24 place count 179 transition count 364
Drop transitions (Redundant composition of simpler transitions.) removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 4 with 62 rules applied. Total rules applied 86 place count 179 transition count 302
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 10 rules applied. Total rules applied 96 place count 170 transition count 301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 97 place count 169 transition count 301
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 99 place count 167 transition count 299
Iterating global reduction 6 with 2 rules applied. Total rules applied 101 place count 167 transition count 299
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 103 place count 167 transition count 297
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 105 place count 165 transition count 297
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 106 place count 165 transition count 301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 107 place count 164 transition count 301
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 121 place count 164 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 122 place count 164 transition count 300
Applied a total of 122 rules in 64 ms. Remains 164 /238 variables (removed 74) and now considering 300/723 (removed 423) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 300 rows 164 cols
[2024-05-22 05:18:23] [INFO ] Computed 34 invariants in 6 ms
[2024-05-22 05:18:23] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 05:18:23] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2024-05-22 05:18:23] [INFO ] After 299ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 05:18:23] [INFO ] After 452ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 05:18:23] [INFO ] After 692ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 881 ms.
[2024-05-22 05:18:23] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2024-05-22 05:18:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 238 places, 723 transitions and 3465 arcs took 16 ms.
[2024-05-22 05:18:24] [INFO ] Flatten gal took : 169 ms
Total runtime 63918 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DLCround-PT-05b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 238
TRANSITIONS: 723
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.025s, Sys 0.000s]


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


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

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

Process ID: 636
MODEL NAME: /home/mcc/execution/414/model
238 places, 723 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 DLCround-PT-05b-ReachabilityFireability-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716355619063

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

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="DLCround-PT-05b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is DLCround-PT-05b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r113-smll-171624274300159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-05b.tgz
mv DLCround-PT-05b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;