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.r070-tall-171620505000031.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 itstools
Input is CANConstruction-PT-030, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505000031
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 18:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 12 18:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 18:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 18:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:31 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 1.4M 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 CANConstruction-PT-030-ReachabilityFireability-2024-00
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-01
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-02
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-03
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-04
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-05
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-06
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-07
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-08
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-09
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-10
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-11
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-12
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-13
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-14
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716217249314

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-030
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-20 15:00:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 15:00:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 15:00:50] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2024-05-20 15:00:50] [INFO ] Transformed 2162 places.
[2024-05-20 15:00:50] [INFO ] Transformed 3840 transitions.
[2024-05-20 15:00:50] [INFO ] Parsed PT model containing 2162 places and 3840 transitions and 11400 arcs in 291 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (74 resets) in 3206 ms. (12 steps per ms) remains 4/16 properties
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 319 ms. (125 steps per ms) remains 4/4 properties
[2024-05-20 15:00:51] [INFO ] Flatten gal took : 576 ms
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 728 ms. (54 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 108 ms. (367 steps per ms) remains 4/4 properties
[2024-05-20 15:00:52] [INFO ] Flatten gal took : 289 ms
// Phase 1: matrix 3840 rows 2162 cols
[2024-05-20 15:00:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6637382757648279009.gal : 84 ms
[2024-05-20 15:00:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16372286632711257925.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6637382757648279009.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16372286632711257925.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
[2024-05-20 15:00:52] [INFO ] Computed 61 invariants in 111 ms
[2024-05-20 15:00:52] [INFO ] State equation strengthened by 1770 read => feed constraints.
Loading property file /tmp/ReachabilityCardinality16372286632711257925.prop.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2071/2130 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2130 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/2130 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/2132 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2132 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 29/2161 variables, 29/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2161 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 3840/6001 variables, 2161/2222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6001 variables, 1770/3992 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/6001 variables, 0/3992 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/6002 variables, 1/3993 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/6002 variables, 0/3993 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/6002 variables, 0/3993 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6002/6002 variables, and 3993 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3450 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 2162/2162 constraints, ReadFeed: 1770/1770 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 32
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :32 after 33
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :33 after 35
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :35 after 38
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :38 after 44
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :44 after 55
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :55 after 64
At refinement iteration 1 (OVERLAPS) 2071/2130 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :64 after 74
At refinement iteration 2 (INCLUDED_ONLY) 0/2130 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :74 after 85
[2024-05-20 15:00:56] [INFO ] Deduced a trap composed of 69 places in 358 ms of which 44 ms to minimize.
[2024-05-20 15:00:57] [INFO ] Deduced a trap composed of 62 places in 253 ms of which 5 ms to minimize.
[2024-05-20 15:00:57] [INFO ] Deduced a trap composed of 63 places in 241 ms of which 4 ms to minimize.
[2024-05-20 15:00:57] [INFO ] Deduced a trap composed of 64 places in 207 ms of which 4 ms to minimize.
[2024-05-20 15:00:57] [INFO ] Deduced a trap composed of 62 places in 213 ms of which 4 ms to minimize.
[2024-05-20 15:00:58] [INFO ] Deduced a trap composed of 64 places in 241 ms of which 4 ms to minimize.
[2024-05-20 15:00:58] [INFO ] Deduced a trap composed of 71 places in 247 ms of which 4 ms to minimize.
[2024-05-20 15:00:58] [INFO ] Deduced a trap composed of 62 places in 246 ms of which 5 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 2048
[2024-05-20 15:00:58] [INFO ] Deduced a trap composed of 62 places in 179 ms of which 3 ms to minimize.
SDD size :991 after 1018
[2024-05-20 15:00:59] [INFO ] Deduced a trap composed of 63 places in 229 ms of which 4 ms to minimize.
[2024-05-20 15:00:59] [INFO ] Deduced a trap composed of 64 places in 190 ms of which 4 ms to minimize.
[2024-05-20 15:00:59] [INFO ] Deduced a trap composed of 62 places in 195 ms of which 3 ms to minimize.
[2024-05-20 15:00:59] [INFO ] Deduced a trap composed of 65 places in 234 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2130 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 15:01:00] [INFO ] Deduced a trap composed of 68 places in 158 ms of which 3 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1018 after 1076
[2024-05-20 15:01:00] [INFO ] Deduced a trap composed of 67 places in 168 ms of which 4 ms to minimize.
[2024-05-20 15:01:00] [INFO ] Deduced a trap composed of 67 places in 185 ms of which 4 ms to minimize.
[2024-05-20 15:01:00] [INFO ] Deduced a trap composed of 64 places in 182 ms of which 4 ms to minimize.
[2024-05-20 15:01:01] [INFO ] Deduced a trap composed of 67 places in 177 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 1)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 1)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 1)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s209 0)
(s210 0)
(s211 0)
(s212 1)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 1)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 1)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 1)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 1)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 1)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 1)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 1)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 1)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2130/6002 variables, and 48 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 29/31 constraints, Generalized P Invariants (flows): 1/30 constraints, State Equation: 0/2162 constraints, ReadFeed: 0/1770 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 18/18 constraints]
After SMT, in 8814ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 59 out of 2162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2162/2162 places, 3840/3840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 164 transitions
Trivial Post-agglo rules discarded 164 transitions
Performed 164 trivial Post agglomeration. Transition count delta: 164
Iterating post reduction 0 with 164 rules applied. Total rules applied 164 place count 2162 transition count 3676
Reduce places removed 164 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 168 rules applied. Total rules applied 332 place count 1998 transition count 3672
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 336 place count 1994 transition count 3672
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 336 place count 1994 transition count 3665
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 350 place count 1987 transition count 3665
Discarding 814 places :
Symmetric choice reduction at 3 with 814 rule applications. Total rules 1164 place count 1173 transition count 2037
Iterating global reduction 3 with 814 rules applied. Total rules applied 1978 place count 1173 transition count 2037
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 8 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 2022 place count 1151 transition count 2015
Free-agglomeration rule applied 23 times.
Iterating global reduction 3 with 23 rules applied. Total rules applied 2045 place count 1151 transition count 1992
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 2068 place count 1128 transition count 1992
Free-agglomeration rule (complex) applied 30 times.
Iterating global reduction 4 with 30 rules applied. Total rules applied 2098 place count 1128 transition count 1962
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 2128 place count 1098 transition count 1962
Partial Free-agglomeration rule applied 42 times.
Drop transitions (Partial Free agglomeration) removed 42 transitions
Iterating global reduction 5 with 42 rules applied. Total rules applied 2170 place count 1098 transition count 1962
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 2172 place count 1098 transition count 1962
Applied a total of 2172 rules in 945 ms. Remains 1098 /2162 variables (removed 1064) and now considering 1962/3840 (removed 1878) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 960 ms. Remains : 1098/2162 places, 1962/3840 transitions.
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1076 after 1241
RANDOM walk for 40000 steps (174 resets) in 707 ms. (56 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 184975 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 4
Probabilistic random walk after 184975 steps, saw 62986 distinct states, run finished after 3004 ms. (steps per millisecond=61 ) properties seen :0
// Phase 1: matrix 1962 rows 1098 cols
[2024-05-20 15:01:05] [INFO ] Computed 61 invariants in 10 ms
[2024-05-20 15:01:05] [INFO ] State equation strengthened by 1811 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1007/1066 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1066 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1066 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/1068 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1068 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 29/1097 variables, 29/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1097 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1962/3059 variables, 1097/1158 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3059 variables, 1811/2969 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3059 variables, 0/2969 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/3060 variables, 1/2970 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3060 variables, 0/2970 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/3060 variables, 0/2970 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3060/3060 variables, and 2970 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1530 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1098/1098 constraints, ReadFeed: 1811/1811 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1007/1066 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1066 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 15:01:07] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 3 ms to minimize.
[2024-05-20 15:01:07] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 5 ms to minimize.
[2024-05-20 15:01:07] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 3 ms to minimize.
[2024-05-20 15:01:07] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 3 ms to minimize.
[2024-05-20 15:01:08] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 3 ms to minimize.
[2024-05-20 15:01:08] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 3 ms to minimize.
[2024-05-20 15:01:08] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1066 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 15:01:08] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 3 ms to minimize.
[2024-05-20 15:01:08] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 2 ms to minimize.
[2024-05-20 15:01:08] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 3 ms to minimize.
[2024-05-20 15:01:09] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 2 ms to minimize.
[2024-05-20 15:01:09] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 3 ms to minimize.
[2024-05-20 15:01:09] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 2 ms to minimize.
[2024-05-20 15:01:09] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 3 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :1241 after 3177
[2024-05-20 15:01:09] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 3 ms to minimize.
[2024-05-20 15:01:09] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 3 ms to minimize.
[2024-05-20 15:01:09] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 6 ms to minimize.
[2024-05-20 15:01:09] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
[2024-05-20 15:01:10] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
[2024-05-20 15:01:10] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
[2024-05-20 15:01:10] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 2 ms to minimize.
[2024-05-20 15:01:10] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 3 ms to minimize.
[2024-05-20 15:01:10] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
[2024-05-20 15:01:10] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
[2024-05-20 15:01:10] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 2 ms to minimize.
[2024-05-20 15:01:10] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
[2024-05-20 15:01:11] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1066 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 15:01:11] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 3 ms to minimize.
[2024-05-20 15:01:11] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 3 ms to minimize.
[2024-05-20 15:01:11] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 3 ms to minimize.
[2024-05-20 15:01:11] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1066 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 15:01:12] [INFO ] Deduced a trap composed of 36 places in 180 ms of which 4 ms to minimize.
[2024-05-20 15:01:12] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 5 ms to minimize.
[2024-05-20 15:01:12] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 4 ms to minimize.
[2024-05-20 15:01:12] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 3 ms to minimize.
[2024-05-20 15:01:12] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 3 ms to minimize.
[2024-05-20 15:01:12] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 3 ms to minimize.
[2024-05-20 15:01:13] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1066 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 15:01:13] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 3 ms to minimize.
[2024-05-20 15:01:13] [INFO ] Deduced a trap composed of 2 places in 307 ms of which 5 ms to minimize.
[2024-05-20 15:01:13] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 3 ms to minimize.
[2024-05-20 15:01:13] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 3 ms to minimize.
[2024-05-20 15:01:14] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 2 ms to minimize.
[2024-05-20 15:01:14] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 2 ms to minimize.
[2024-05-20 15:01:14] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 3 ms to minimize.
[2024-05-20 15:01:14] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 3 ms to minimize.
[2024-05-20 15:01:14] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 3 ms to minimize.
[2024-05-20 15:01:14] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 3 ms to minimize.
[2024-05-20 15:01:14] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 2 ms to minimize.
[2024-05-20 15:01:15] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 2 ms to minimize.
[2024-05-20 15:01:15] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 2 ms to minimize.
[2024-05-20 15:01:15] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 3 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 32768
[2024-05-20 15:01:15] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 3 ms to minimize.
SDD size :3177 after 4283
[2024-05-20 15:01:15] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 3 ms to minimize.
[2024-05-20 15:01:15] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 3 ms to minimize.
[2024-05-20 15:01:15] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 3 ms to minimize.
[2024-05-20 15:01:15] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 3 ms to minimize.
[2024-05-20 15:01:16] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1066 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 15:01:16] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 3 ms to minimize.
[2024-05-20 15:01:16] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 2 ms to minimize.
[2024-05-20 15:01:16] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 3 ms to minimize.
[2024-05-20 15:01:16] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
[2024-05-20 15:01:16] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2024-05-20 15:01:16] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 2 ms to minimize.
[2024-05-20 15:01:16] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 4 ms to minimize.
[2024-05-20 15:01:17] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 3 ms to minimize.
[2024-05-20 15:01:17] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 2 ms to minimize.
[2024-05-20 15:01:17] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 3 ms to minimize.
[2024-05-20 15:01:17] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 3 ms to minimize.
[2024-05-20 15:01:17] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1066 variables, 12/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 15:01:17] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 2 ms to minimize.
[2024-05-20 15:01:18] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 3 ms to minimize.
[2024-05-20 15:01:18] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1066 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1066 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/1068 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 15:01:18] [INFO ] Deduced a trap composed of 36 places in 325 ms of which 5 ms to minimize.
[2024-05-20 15:01:19] [INFO ] Deduced a trap composed of 34 places in 306 ms of which 5 ms to minimize.
[2024-05-20 15:01:19] [INFO ] Deduced a trap composed of 33 places in 286 ms of which 4 ms to minimize.
[2024-05-20 15:01:19] [INFO ] Deduced a trap composed of 33 places in 268 ms of which 4 ms to minimize.
[2024-05-20 15:01:19] [INFO ] Deduced a trap composed of 33 places in 266 ms of which 5 ms to minimize.
[2024-05-20 15:01:20] [INFO ] Deduced a trap composed of 33 places in 266 ms of which 4 ms to minimize.
[2024-05-20 15:01:20] [INFO ] Deduced a trap composed of 33 places in 263 ms of which 5 ms to minimize.
[2024-05-20 15:01:20] [INFO ] Deduced a trap composed of 33 places in 260 ms of which 5 ms to minimize.
[2024-05-20 15:01:21] [INFO ] Deduced a trap composed of 33 places in 271 ms of which 4 ms to minimize.
[2024-05-20 15:01:21] [INFO ] Deduced a trap composed of 33 places in 255 ms of which 5 ms to minimize.
[2024-05-20 15:01:21] [INFO ] Deduced a trap composed of 36 places in 253 ms of which 5 ms to minimize.
[2024-05-20 15:01:21] [INFO ] Deduced a trap composed of 36 places in 254 ms of which 5 ms to minimize.
[2024-05-20 15:01:22] [INFO ] Deduced a trap composed of 33 places in 254 ms of which 5 ms to minimize.
[2024-05-20 15:01:22] [INFO ] Deduced a trap composed of 33 places in 253 ms of which 4 ms to minimize.
[2024-05-20 15:01:22] [INFO ] Deduced a trap composed of 33 places in 250 ms of which 5 ms to minimize.
[2024-05-20 15:01:22] [INFO ] Deduced a trap composed of 33 places in 261 ms of which 4 ms to minimize.
[2024-05-20 15:01:23] [INFO ] Deduced a trap composed of 36 places in 243 ms of which 5 ms to minimize.
[2024-05-20 15:01:23] [INFO ] Deduced a trap composed of 39 places in 238 ms of which 4 ms to minimize.
[2024-05-20 15:01:23] [INFO ] Deduced a trap composed of 33 places in 241 ms of which 5 ms to minimize.
[2024-05-20 15:01:24] [INFO ] Deduced a trap composed of 33 places in 234 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1068 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 15:01:24] [INFO ] Deduced a trap composed of 33 places in 231 ms of which 4 ms to minimize.
[2024-05-20 15:01:24] [INFO ] Deduced a trap composed of 33 places in 244 ms of which 5 ms to minimize.
[2024-05-20 15:01:24] [INFO ] Deduced a trap composed of 33 places in 231 ms of which 5 ms to minimize.
[2024-05-20 15:01:25] [INFO ] Deduced a trap composed of 33 places in 229 ms of which 4 ms to minimize.
[2024-05-20 15:01:25] [INFO ] Deduced a trap composed of 36 places in 246 ms of which 6 ms to minimize.
[2024-05-20 15:01:25] [INFO ] Deduced a trap composed of 37 places in 241 ms of which 5 ms to minimize.
[2024-05-20 15:01:25] [INFO ] Deduced a trap composed of 33 places in 223 ms of which 5 ms to minimize.
[2024-05-20 15:01:26] [INFO ] Deduced a trap composed of 36 places in 221 ms of which 5 ms to minimize.
[2024-05-20 15:01:26] [INFO ] Deduced a trap composed of 36 places in 223 ms of which 4 ms to minimize.
[2024-05-20 15:01:26] [INFO ] Deduced a trap composed of 37 places in 228 ms of which 5 ms to minimize.
[2024-05-20 15:01:26] [INFO ] Deduced a trap composed of 36 places in 226 ms of which 4 ms to minimize.
[2024-05-20 15:01:27] [INFO ] Deduced a trap composed of 33 places in 219 ms of which 4 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :4283 after 6567
[2024-05-20 15:01:27] [INFO ] Deduced a trap composed of 33 places in 216 ms of which 5 ms to minimize.
[2024-05-20 15:01:27] [INFO ] Deduced a trap composed of 33 places in 218 ms of which 4 ms to minimize.
[2024-05-20 15:01:27] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 5 ms to minimize.
[2024-05-20 15:01:27] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 4 ms to minimize.
[2024-05-20 15:01:28] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 4 ms to minimize.
[2024-05-20 15:01:28] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 4 ms to minimize.
[2024-05-20 15:01:28] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 3 ms to minimize.
[2024-05-20 15:01:28] [INFO ] Deduced a trap composed of 36 places in 179 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1068 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 15:01:29] [INFO ] Deduced a trap composed of 36 places in 221 ms of which 4 ms to minimize.
[2024-05-20 15:01:29] [INFO ] Deduced a trap composed of 36 places in 193 ms of which 4 ms to minimize.
[2024-05-20 15:01:29] [INFO ] Deduced a trap composed of 36 places in 191 ms of which 4 ms to minimize.
[2024-05-20 15:01:29] [INFO ] Deduced a trap composed of 36 places in 207 ms of which 5 ms to minimize.
[2024-05-20 15:01:29] [INFO ] Deduced a trap composed of 33 places in 182 ms of which 4 ms to minimize.
[2024-05-20 15:01:30] [INFO ] Deduced a trap composed of 36 places in 176 ms of which 4 ms to minimize.
[2024-05-20 15:01:30] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 4 ms to minimize.
[2024-05-20 15:01:30] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 4 ms to minimize.
[2024-05-20 15:01:30] [INFO ] Deduced a trap composed of 33 places in 190 ms of which 4 ms to minimize.
[2024-05-20 15:01:30] [INFO ] Deduced a trap composed of 33 places in 186 ms of which 4 ms to minimize.
[2024-05-20 15:01:31] [INFO ] Deduced a trap composed of 36 places in 176 ms of which 4 ms to minimize.
[2024-05-20 15:01:31] [INFO ] Deduced a trap composed of 36 places in 236 ms of which 6 ms to minimize.
[2024-05-20 15:01:31] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 3 ms to minimize.
[2024-05-20 15:01:31] [INFO ] Deduced a trap composed of 36 places in 199 ms of which 4 ms to minimize.
[2024-05-20 15:01:32] [INFO ] Deduced a trap composed of 36 places in 197 ms of which 4 ms to minimize.
[2024-05-20 15:01:32] [INFO ] Deduced a trap composed of 36 places in 206 ms of which 4 ms to minimize.
[2024-05-20 15:01:32] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 3 ms to minimize.
[2024-05-20 15:01:32] [INFO ] Deduced a trap composed of 33 places in 185 ms of which 4 ms to minimize.
[2024-05-20 15:01:32] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 4 ms to minimize.
[2024-05-20 15:01:33] [INFO ] Deduced a trap composed of 36 places in 168 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1068 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 15:01:33] [INFO ] Deduced a trap composed of 33 places in 199 ms of which 9 ms to minimize.
[2024-05-20 15:01:33] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 4 ms to minimize.
[2024-05-20 15:01:33] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 4 ms to minimize.
[2024-05-20 15:01:33] [INFO ] Deduced a trap composed of 33 places in 193 ms of which 4 ms to minimize.
[2024-05-20 15:01:34] [INFO ] Deduced a trap composed of 36 places in 205 ms of which 4 ms to minimize.
[2024-05-20 15:01:34] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 4 ms to minimize.
[2024-05-20 15:01:34] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 3 ms to minimize.
[2024-05-20 15:01:34] [INFO ] Deduced a trap composed of 33 places in 185 ms of which 3 ms to minimize.
[2024-05-20 15:01:34] [INFO ] Deduced a trap composed of 36 places in 183 ms of which 4 ms to minimize.
[2024-05-20 15:01:35] [INFO ] Deduced a trap composed of 37 places in 227 ms of which 4 ms to minimize.
[2024-05-20 15:01:35] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 3 ms to minimize.
[2024-05-20 15:01:35] [INFO ] Deduced a trap composed of 37 places in 200 ms of which 4 ms to minimize.
[2024-05-20 15:01:35] [INFO ] Deduced a trap composed of 36 places in 204 ms of which 3 ms to minimize.
[2024-05-20 15:01:36] [INFO ] Deduced a trap composed of 36 places in 202 ms of which 4 ms to minimize.
[2024-05-20 15:01:36] [INFO ] Deduced a trap composed of 36 places in 190 ms of which 4 ms to minimize.
[2024-05-20 15:01:36] [INFO ] Deduced a trap composed of 36 places in 178 ms of which 4 ms to minimize.
[2024-05-20 15:01:36] [INFO ] Deduced a trap composed of 33 places in 182 ms of which 3 ms to minimize.
[2024-05-20 15:01:36] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 3 ms to minimize.
[2024-05-20 15:01:37] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 4 ms to minimize.
[2024-05-20 15:01:37] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1068 variables, 20/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 15:01:37] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 4 ms to minimize.
[2024-05-20 15:01:37] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 4 ms to minimize.
[2024-05-20 15:01:37] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 4 ms to minimize.
[2024-05-20 15:01:38] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 4 ms to minimize.
[2024-05-20 15:01:38] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 4 ms to minimize.
[2024-05-20 15:01:38] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 3 ms to minimize.
[2024-05-20 15:01:38] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 3 ms to minimize.
[2024-05-20 15:01:38] [INFO ] Deduced a trap composed of 33 places in 172 ms of which 4 ms to minimize.
[2024-05-20 15:01:39] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 3 ms to minimize.
[2024-05-20 15:01:39] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 4 ms to minimize.
[2024-05-20 15:01:39] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 4 ms to minimize.
[2024-05-20 15:01:39] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1068 variables, 12/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1068 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 29/1097 variables, 29/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 15:01:39] [INFO ] Deduced a trap composed of 36 places in 191 ms of which 3 ms to minimize.
[2024-05-20 15:01:40] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 4 ms to minimize.
[2024-05-20 15:01:40] [INFO ] Deduced a trap composed of 33 places in 183 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1097 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 1962/3059 variables, 1097/1326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3059 variables, 1811/3137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3059 variables, 4/3141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3059 variables, 0/3141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 1/3060 variables, 1/3142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3060 variables, 0/3142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 0/3060 variables, 0/3142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3060/3060 variables, and 3142 constraints, problems are : Problem set: 0 solved, 4 unsolved in 35849 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1098/1098 constraints, ReadFeed: 1811/1811 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 168/168 constraints]
After SMT, in 37476ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 575 ms.
Support contains 43 out of 1098 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1098/1098 places, 1962/1962 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 0 with 1 rules applied. Total rules applied 1 place count 1098 transition count 1961
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1097 transition count 1961
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 1096 transition count 1959
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 1096 transition count 1959
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 16 place count 1090 transition count 1953
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 1089 transition count 1953
Applied a total of 18 rules in 298 ms. Remains 1089 /1098 variables (removed 9) and now considering 1953/1962 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 299 ms. Remains : 1089/1098 places, 1953/1962 transitions.
RANDOM walk for 40000 steps (179 resets) in 458 ms. (87 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 1/2 properties
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 1953 rows 1089 cols
[2024-05-20 15:01:44] [INFO ] Computed 61 invariants in 8 ms
[2024-05-20 15:01:44] [INFO ] State equation strengthened by 1819 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1012/1051 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1051 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1051 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/1059 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1059 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 29/1088 variables, 29/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1088 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1953/3041 variables, 1088/1149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3041 variables, 1819/2968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3041 variables, 0/2968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/3042 variables, 1/2969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3042 variables, 0/2969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/3042 variables, 0/2969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3042/3042 variables, and 2969 constraints, problems are : Problem set: 0 solved, 1 unsolved in 900 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1089/1089 constraints, ReadFeed: 1819/1819 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/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1012/1051 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1051 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 15:01:45] [INFO ] Deduced a trap composed of 2 places in 386 ms of which 5 ms to minimize.
[2024-05-20 15:01:45] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 2 ms to minimize.
[2024-05-20 15:01:45] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 3 ms to minimize.
[2024-05-20 15:01:45] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
[2024-05-20 15:01:46] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1051 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1051 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/1059 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 15:01:46] [INFO ] Deduced a trap composed of 35 places in 396 ms of which 6 ms to minimize.
[2024-05-20 15:01:46] [INFO ] Deduced a trap composed of 33 places in 376 ms of which 6 ms to minimize.
[2024-05-20 15:01:47] [INFO ] Deduced a trap composed of 33 places in 360 ms of which 6 ms to minimize.
[2024-05-20 15:01:47] [INFO ] Deduced a trap composed of 33 places in 357 ms of which 5 ms to minimize.
[2024-05-20 15:01:48] [INFO ] Deduced a trap composed of 33 places in 391 ms of which 6 ms to minimize.
[2024-05-20 15:01:48] [INFO ] Deduced a trap composed of 33 places in 329 ms of which 5 ms to minimize.
[2024-05-20 15:01:48] [INFO ] Deduced a trap composed of 33 places in 396 ms of which 6 ms to minimize.
[2024-05-20 15:01:49] [INFO ] Deduced a trap composed of 33 places in 398 ms of which 6 ms to minimize.
[2024-05-20 15:01:49] [INFO ] Deduced a trap composed of 33 places in 383 ms of which 6 ms to minimize.
[2024-05-20 15:01:49] [INFO ] Deduced a trap composed of 33 places in 355 ms of which 6 ms to minimize.
[2024-05-20 15:01:50] [INFO ] Deduced a trap composed of 35 places in 362 ms of which 6 ms to minimize.
[2024-05-20 15:01:50] [INFO ] Deduced a trap composed of 39 places in 350 ms of which 6 ms to minimize.
[2024-05-20 15:01:51] [INFO ] Deduced a trap composed of 41 places in 352 ms of which 6 ms to minimize.
[2024-05-20 15:01:51] [INFO ] Deduced a trap composed of 39 places in 354 ms of which 6 ms to minimize.
[2024-05-20 15:01:51] [INFO ] Deduced a trap composed of 35 places in 343 ms of which 6 ms to minimize.
[2024-05-20 15:01:52] [INFO ] Deduced a trap composed of 33 places in 401 ms of which 6 ms to minimize.
[2024-05-20 15:01:52] [INFO ] Deduced a trap composed of 33 places in 393 ms of which 5 ms to minimize.
[2024-05-20 15:01:53] [INFO ] Deduced a trap composed of 38 places in 322 ms of which 6 ms to minimize.
[2024-05-20 15:01:53] [INFO ] Deduced a trap composed of 37 places in 327 ms of which 5 ms to minimize.
[2024-05-20 15:01:53] [INFO ] Deduced a trap composed of 37 places in 320 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1059 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 15:01:54] [INFO ] Deduced a trap composed of 33 places in 336 ms of which 5 ms to minimize.
[2024-05-20 15:01:54] [INFO ] Deduced a trap composed of 33 places in 341 ms of which 5 ms to minimize.
[2024-05-20 15:01:54] [INFO ] Deduced a trap composed of 33 places in 336 ms of which 5 ms to minimize.
[2024-05-20 15:01:55] [INFO ] Deduced a trap composed of 39 places in 321 ms of which 5 ms to minimize.
[2024-05-20 15:01:55] [INFO ] Deduced a trap composed of 40 places in 337 ms of which 5 ms to minimize.
[2024-05-20 15:01:55] [INFO ] Deduced a trap composed of 33 places in 323 ms of which 6 ms to minimize.
[2024-05-20 15:01:56] [INFO ] Deduced a trap composed of 33 places in 309 ms of which 5 ms to minimize.
[2024-05-20 15:01:56] [INFO ] Deduced a trap composed of 33 places in 302 ms of which 5 ms to minimize.
[2024-05-20 15:01:56] [INFO ] Deduced a trap composed of 33 places in 302 ms of which 5 ms to minimize.
[2024-05-20 15:01:57] [INFO ] Deduced a trap composed of 39 places in 291 ms of which 5 ms to minimize.
[2024-05-20 15:01:57] [INFO ] Deduced a trap composed of 39 places in 300 ms of which 5 ms to minimize.
[2024-05-20 15:01:57] [INFO ] Deduced a trap composed of 39 places in 292 ms of which 5 ms to minimize.
[2024-05-20 15:01:58] [INFO ] Deduced a trap composed of 33 places in 289 ms of which 4 ms to minimize.
[2024-05-20 15:01:58] [INFO ] Deduced a trap composed of 33 places in 289 ms of which 8 ms to minimize.
[2024-05-20 15:01:58] [INFO ] Deduced a trap composed of 37 places in 295 ms of which 5 ms to minimize.
[2024-05-20 15:01:58] [INFO ] Deduced a trap composed of 33 places in 284 ms of which 5 ms to minimize.
[2024-05-20 15:01:59] [INFO ] Deduced a trap composed of 33 places in 287 ms of which 5 ms to minimize.
[2024-05-20 15:01:59] [INFO ] Deduced a trap composed of 36 places in 329 ms of which 5 ms to minimize.
[2024-05-20 15:01:59] [INFO ] Deduced a trap composed of 35 places in 341 ms of which 5 ms to minimize.
[2024-05-20 15:02:00] [INFO ] Deduced a trap composed of 36 places in 321 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1059 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 15:02:00] [INFO ] Deduced a trap composed of 35 places in 324 ms of which 6 ms to minimize.
[2024-05-20 15:02:00] [INFO ] Deduced a trap composed of 33 places in 303 ms of which 5 ms to minimize.
[2024-05-20 15:02:01] [INFO ] Deduced a trap composed of 40 places in 318 ms of which 5 ms to minimize.
[2024-05-20 15:02:01] [INFO ] Deduced a trap composed of 33 places in 342 ms of which 5 ms to minimize.
[2024-05-20 15:02:02] [INFO ] Deduced a trap composed of 36 places in 351 ms of which 5 ms to minimize.
[2024-05-20 15:02:02] [INFO ] Deduced a trap composed of 33 places in 300 ms of which 5 ms to minimize.
[2024-05-20 15:02:02] [INFO ] Deduced a trap composed of 33 places in 333 ms of which 5 ms to minimize.
[2024-05-20 15:02:03] [INFO ] Deduced a trap composed of 36 places in 315 ms of which 5 ms to minimize.
[2024-05-20 15:02:03] [INFO ] Deduced a trap composed of 36 places in 276 ms of which 4 ms to minimize.
[2024-05-20 15:02:03] [INFO ] Deduced a trap composed of 33 places in 301 ms of which 5 ms to minimize.
[2024-05-20 15:02:03] [INFO ] Deduced a trap composed of 37 places in 314 ms of which 5 ms to minimize.
[2024-05-20 15:02:04] [INFO ] Deduced a trap composed of 35 places in 283 ms of which 4 ms to minimize.
[2024-05-20 15:02:04] [INFO ] Deduced a trap composed of 36 places in 309 ms of which 5 ms to minimize.
[2024-05-20 15:02:04] [INFO ] Deduced a trap composed of 35 places in 284 ms of which 5 ms to minimize.
[2024-05-20 15:02:05] [INFO ] Deduced a trap composed of 35 places in 280 ms of which 5 ms to minimize.
[2024-05-20 15:02:05] [INFO ] Deduced a trap composed of 33 places in 278 ms of which 5 ms to minimize.
[2024-05-20 15:02:05] [INFO ] Deduced a trap composed of 33 places in 287 ms of which 5 ms to minimize.
[2024-05-20 15:02:06] [INFO ] Deduced a trap composed of 35 places in 267 ms of which 5 ms to minimize.
[2024-05-20 15:02:06] [INFO ] Deduced a trap composed of 35 places in 271 ms of which 4 ms to minimize.
[2024-05-20 15:02:06] [INFO ] Deduced a trap composed of 33 places in 259 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1059 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 15:02:06] [INFO ] Deduced a trap composed of 33 places in 251 ms of which 4 ms to minimize.
[2024-05-20 15:02:07] [INFO ] Deduced a trap composed of 33 places in 246 ms of which 5 ms to minimize.
[2024-05-20 15:02:07] [INFO ] Deduced a trap composed of 33 places in 300 ms of which 7 ms to minimize.
[2024-05-20 15:02:07] [INFO ] Deduced a trap composed of 35 places in 245 ms of which 4 ms to minimize.
[2024-05-20 15:02:08] [INFO ] Deduced a trap composed of 33 places in 331 ms of which 6 ms to minimize.
[2024-05-20 15:02:08] [INFO ] Deduced a trap composed of 33 places in 288 ms of which 5 ms to minimize.
[2024-05-20 15:02:08] [INFO ] Deduced a trap composed of 36 places in 317 ms of which 6 ms to minimize.
[2024-05-20 15:02:09] [INFO ] Deduced a trap composed of 33 places in 285 ms of which 5 ms to minimize.
[2024-05-20 15:02:09] [INFO ] Deduced a trap composed of 33 places in 289 ms of which 5 ms to minimize.
[2024-05-20 15:02:09] [INFO ] Deduced a trap composed of 34 places in 306 ms of which 5 ms to minimize.
[2024-05-20 15:02:09] [INFO ] Deduced a trap composed of 34 places in 306 ms of which 5 ms to minimize.
[2024-05-20 15:02:10] [INFO ] Deduced a trap composed of 34 places in 298 ms of which 5 ms to minimize.
[2024-05-20 15:02:10] [INFO ] Deduced a trap composed of 33 places in 276 ms of which 5 ms to minimize.
[2024-05-20 15:02:10] [INFO ] Deduced a trap composed of 33 places in 274 ms of which 5 ms to minimize.
[2024-05-20 15:02:11] [INFO ] Deduced a trap composed of 33 places in 271 ms of which 4 ms to minimize.
[2024-05-20 15:02:11] [INFO ] Deduced a trap composed of 35 places in 262 ms of which 5 ms to minimize.
[2024-05-20 15:02:11] [INFO ] Deduced a trap composed of 33 places in 284 ms of which 4 ms to minimize.
[2024-05-20 15:02:12] [INFO ] Deduced a trap composed of 35 places in 294 ms of which 4 ms to minimize.
[2024-05-20 15:02:12] [INFO ] Deduced a trap composed of 37 places in 292 ms of which 5 ms to minimize.
[2024-05-20 15:02:12] [INFO ] Deduced a trap composed of 35 places in 295 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1059 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 15:02:13] [INFO ] Deduced a trap composed of 42 places in 293 ms of which 5 ms to minimize.
[2024-05-20 15:02:13] [INFO ] Deduced a trap composed of 42 places in 297 ms of which 5 ms to minimize.
[2024-05-20 15:02:13] [INFO ] Deduced a trap composed of 33 places in 290 ms of which 5 ms to minimize.
[2024-05-20 15:02:13] [INFO ] Deduced a trap composed of 41 places in 283 ms of which 5 ms to minimize.
[2024-05-20 15:02:14] [INFO ] Deduced a trap composed of 33 places in 291 ms of which 5 ms to minimize.
[2024-05-20 15:02:14] [INFO ] Deduced a trap composed of 35 places in 271 ms of which 4 ms to minimize.
[2024-05-20 15:02:14] [INFO ] Deduced a trap composed of 35 places in 262 ms of which 4 ms to minimize.
[2024-05-20 15:02:15] [INFO ] Deduced a trap composed of 35 places in 256 ms of which 4 ms to minimize.
[2024-05-20 15:02:15] [INFO ] Deduced a trap composed of 33 places in 252 ms of which 4 ms to minimize.
[2024-05-20 15:02:15] [INFO ] Deduced a trap composed of 33 places in 252 ms of which 5 ms to minimize.
[2024-05-20 15:02:15] [INFO ] Deduced a trap composed of 33 places in 250 ms of which 4 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 131072
SDD size :6567 after 8553
[2024-05-20 15:02:16] [INFO ] Deduced a trap composed of 37 places in 263 ms of which 5 ms to minimize.
[2024-05-20 15:02:16] [INFO ] Deduced a trap composed of 37 places in 254 ms of which 5 ms to minimize.
[2024-05-20 15:02:16] [INFO ] Deduced a trap composed of 37 places in 246 ms of which 4 ms to minimize.
[2024-05-20 15:02:16] [INFO ] Deduced a trap composed of 37 places in 247 ms of which 4 ms to minimize.
[2024-05-20 15:02:17] [INFO ] Deduced a trap composed of 36 places in 249 ms of which 4 ms to minimize.
[2024-05-20 15:02:17] [INFO ] Deduced a trap composed of 33 places in 261 ms of which 5 ms to minimize.
[2024-05-20 15:02:17] [INFO ] Deduced a trap composed of 38 places in 241 ms of which 4 ms to minimize.
[2024-05-20 15:02:18] [INFO ] Deduced a trap composed of 35 places in 278 ms of which 5 ms to minimize.
[2024-05-20 15:02:18] [INFO ] Deduced a trap composed of 37 places in 279 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1059 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 15:02:18] [INFO ] Deduced a trap composed of 33 places in 276 ms of which 5 ms to minimize.
[2024-05-20 15:02:18] [INFO ] Deduced a trap composed of 37 places in 228 ms of which 4 ms to minimize.
[2024-05-20 15:02:19] [INFO ] Deduced a trap composed of 33 places in 257 ms of which 4 ms to minimize.
[2024-05-20 15:02:19] [INFO ] Deduced a trap composed of 36 places in 220 ms of which 4 ms to minimize.
[2024-05-20 15:02:19] [INFO ] Deduced a trap composed of 37 places in 221 ms of which 4 ms to minimize.
[2024-05-20 15:02:19] [INFO ] Deduced a trap composed of 33 places in 261 ms of which 5 ms to minimize.
[2024-05-20 15:02:20] [INFO ] Deduced a trap composed of 37 places in 277 ms of which 5 ms to minimize.
[2024-05-20 15:02:20] [INFO ] Deduced a trap composed of 33 places in 249 ms of which 4 ms to minimize.
[2024-05-20 15:02:20] [INFO ] Deduced a trap composed of 33 places in 245 ms of which 4 ms to minimize.
[2024-05-20 15:02:21] [INFO ] Deduced a trap composed of 33 places in 245 ms of which 4 ms to minimize.
[2024-05-20 15:02:21] [INFO ] Deduced a trap composed of 33 places in 265 ms of which 5 ms to minimize.
[2024-05-20 15:02:21] [INFO ] Deduced a trap composed of 33 places in 249 ms of which 4 ms to minimize.
[2024-05-20 15:02:21] [INFO ] Deduced a trap composed of 33 places in 257 ms of which 5 ms to minimize.
[2024-05-20 15:02:22] [INFO ] Deduced a trap composed of 36 places in 240 ms of which 5 ms to minimize.
[2024-05-20 15:02:22] [INFO ] Deduced a trap composed of 36 places in 243 ms of which 4 ms to minimize.
[2024-05-20 15:02:22] [INFO ] Deduced a trap composed of 36 places in 240 ms of which 5 ms to minimize.
[2024-05-20 15:02:22] [INFO ] Deduced a trap composed of 36 places in 242 ms of which 4 ms to minimize.
[2024-05-20 15:02:23] [INFO ] Deduced a trap composed of 33 places in 250 ms of which 5 ms to minimize.
[2024-05-20 15:02:23] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 5 ms to minimize.
[2024-05-20 15:02:23] [INFO ] Deduced a trap composed of 33 places in 228 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1059 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 15:02:23] [INFO ] Deduced a trap composed of 36 places in 219 ms of which 4 ms to minimize.
[2024-05-20 15:02:24] [INFO ] Deduced a trap composed of 33 places in 229 ms of which 4 ms to minimize.
[2024-05-20 15:02:24] [INFO ] Deduced a trap composed of 38 places in 242 ms of which 4 ms to minimize.
[2024-05-20 15:02:24] [INFO ] Deduced a trap composed of 35 places in 226 ms of which 4 ms to minimize.
[2024-05-20 15:02:24] [INFO ] Deduced a trap composed of 33 places in 215 ms of which 4 ms to minimize.
[2024-05-20 15:02:25] [INFO ] Deduced a trap composed of 33 places in 208 ms of which 4 ms to minimize.
[2024-05-20 15:02:25] [INFO ] Deduced a trap composed of 35 places in 199 ms of which 4 ms to minimize.
[2024-05-20 15:02:25] [INFO ] Deduced a trap composed of 33 places in 219 ms of which 4 ms to minimize.
[2024-05-20 15:02:25] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 4 ms to minimize.
[2024-05-20 15:02:26] [INFO ] Deduced a trap composed of 33 places in 207 ms of which 4 ms to minimize.
[2024-05-20 15:02:26] [INFO ] Deduced a trap composed of 33 places in 210 ms of which 4 ms to minimize.
[2024-05-20 15:02:26] [INFO ] Deduced a trap composed of 35 places in 199 ms of which 4 ms to minimize.
[2024-05-20 15:02:26] [INFO ] Deduced a trap composed of 35 places in 251 ms of which 5 ms to minimize.
[2024-05-20 15:02:27] [INFO ] Deduced a trap composed of 36 places in 240 ms of which 4 ms to minimize.
[2024-05-20 15:02:27] [INFO ] Deduced a trap composed of 36 places in 244 ms of which 4 ms to minimize.
[2024-05-20 15:02:27] [INFO ] Deduced a trap composed of 33 places in 260 ms of which 5 ms to minimize.
[2024-05-20 15:02:27] [INFO ] Deduced a trap composed of 33 places in 240 ms of which 5 ms to minimize.
[2024-05-20 15:02:28] [INFO ] Deduced a trap composed of 36 places in 233 ms of which 5 ms to minimize.
[2024-05-20 15:02:28] [INFO ] Deduced a trap composed of 33 places in 229 ms of which 4 ms to minimize.
[2024-05-20 15:02:28] [INFO ] Deduced a trap composed of 33 places in 233 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1059 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 15:02:28] [INFO ] Deduced a trap composed of 35 places in 242 ms of which 4 ms to minimize.
[2024-05-20 15:02:29] [INFO ] Deduced a trap composed of 35 places in 227 ms of which 5 ms to minimize.
[2024-05-20 15:02:29] [INFO ] Deduced a trap composed of 35 places in 221 ms of which 5 ms to minimize.
[2024-05-20 15:02:29] [INFO ] Deduced a trap composed of 36 places in 225 ms of which 4 ms to minimize.
[2024-05-20 15:02:29] [INFO ] Deduced a trap composed of 35 places in 211 ms of which 4 ms to minimize.
[2024-05-20 15:02:30] [INFO ] Deduced a trap composed of 35 places in 247 ms of which 4 ms to minimize.
[2024-05-20 15:02:30] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 4 ms to minimize.
[2024-05-20 15:02:30] [INFO ] Deduced a trap composed of 33 places in 231 ms of which 4 ms to minimize.
[2024-05-20 15:02:30] [INFO ] Deduced a trap composed of 35 places in 233 ms of which 5 ms to minimize.
[2024-05-20 15:02:31] [INFO ] Deduced a trap composed of 35 places in 239 ms of which 4 ms to minimize.
[2024-05-20 15:02:31] [INFO ] Deduced a trap composed of 35 places in 238 ms of which 4 ms to minimize.
[2024-05-20 15:02:31] [INFO ] Deduced a trap composed of 33 places in 220 ms of which 4 ms to minimize.
[2024-05-20 15:02:31] [INFO ] Deduced a trap composed of 33 places in 222 ms of which 4 ms to minimize.
[2024-05-20 15:02:31] [INFO ] Deduced a trap composed of 33 places in 228 ms of which 4 ms to minimize.
[2024-05-20 15:02:32] [INFO ] Deduced a trap composed of 35 places in 232 ms of which 4 ms to minimize.
[2024-05-20 15:02:32] [INFO ] Deduced a trap composed of 36 places in 205 ms of which 4 ms to minimize.
[2024-05-20 15:02:32] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 4 ms to minimize.
[2024-05-20 15:02:32] [INFO ] Deduced a trap composed of 35 places in 221 ms of which 4 ms to minimize.
[2024-05-20 15:02:33] [INFO ] Deduced a trap composed of 35 places in 221 ms of which 3 ms to minimize.
[2024-05-20 15:02:33] [INFO ] Deduced a trap composed of 33 places in 210 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1059 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 15:02:33] [INFO ] Deduced a trap composed of 33 places in 214 ms of which 3 ms to minimize.
[2024-05-20 15:02:33] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 3 ms to minimize.
[2024-05-20 15:02:34] [INFO ] Deduced a trap composed of 36 places in 228 ms of which 4 ms to minimize.
[2024-05-20 15:02:34] [INFO ] Deduced a trap composed of 33 places in 221 ms of which 3 ms to minimize.
[2024-05-20 15:02:34] [INFO ] Deduced a trap composed of 33 places in 239 ms of which 4 ms to minimize.
[2024-05-20 15:02:34] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 4 ms to minimize.
[2024-05-20 15:02:34] [INFO ] Deduced a trap composed of 35 places in 209 ms of which 3 ms to minimize.
[2024-05-20 15:02:35] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 4 ms to minimize.
[2024-05-20 15:02:35] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 4 ms to minimize.
[2024-05-20 15:02:35] [INFO ] Deduced a trap composed of 36 places in 237 ms of which 4 ms to minimize.
[2024-05-20 15:02:35] [INFO ] Deduced a trap composed of 35 places in 234 ms of which 4 ms to minimize.
[2024-05-20 15:02:36] [INFO ] Deduced a trap composed of 36 places in 217 ms of which 4 ms to minimize.
[2024-05-20 15:02:36] [INFO ] Deduced a trap composed of 36 places in 245 ms of which 4 ms to minimize.
[2024-05-20 15:02:36] [INFO ] Deduced a trap composed of 35 places in 208 ms of which 4 ms to minimize.
[2024-05-20 15:02:36] [INFO ] Deduced a trap composed of 33 places in 200 ms of which 4 ms to minimize.
[2024-05-20 15:02:37] [INFO ] Deduced a trap composed of 35 places in 212 ms of which 3 ms to minimize.
[2024-05-20 15:02:37] [INFO ] Deduced a trap composed of 33 places in 190 ms of which 4 ms to minimize.
[2024-05-20 15:02:37] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 4 ms to minimize.
[2024-05-20 15:02:37] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 3 ms to minimize.
[2024-05-20 15:02:37] [INFO ] Deduced a trap composed of 36 places in 189 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1059 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 15:02:38] [INFO ] Deduced a trap composed of 35 places in 196 ms of which 3 ms to minimize.
[2024-05-20 15:02:38] [INFO ] Deduced a trap composed of 36 places in 192 ms of which 4 ms to minimize.
[2024-05-20 15:02:38] [INFO ] Deduced a trap composed of 33 places in 193 ms of which 4 ms to minimize.
[2024-05-20 15:02:38] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 3 ms to minimize.
[2024-05-20 15:02:38] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 3 ms to minimize.
[2024-05-20 15:02:39] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 4 ms to minimize.
[2024-05-20 15:02:39] [INFO ] Deduced a trap composed of 33 places in 183 ms of which 3 ms to minimize.
[2024-05-20 15:02:39] [INFO ] Deduced a trap composed of 36 places in 181 ms of which 4 ms to minimize.
[2024-05-20 15:02:39] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 4 ms to minimize.
[2024-05-20 15:02:39] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 3 ms to minimize.
[2024-05-20 15:02:39] [INFO ] Deduced a trap composed of 36 places in 174 ms of which 3 ms to minimize.
[2024-05-20 15:02:40] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 3 ms to minimize.
[2024-05-20 15:02:40] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 4 ms to minimize.
[2024-05-20 15:02:40] [INFO ] Deduced a trap composed of 35 places in 169 ms of which 3 ms to minimize.
[2024-05-20 15:02:40] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 3 ms to minimize.
[2024-05-20 15:02:40] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 3 ms to minimize.
[2024-05-20 15:02:41] [INFO ] Deduced a trap composed of 35 places in 204 ms of which 3 ms to minimize.
[2024-05-20 15:02:41] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 3 ms to minimize.
[2024-05-20 15:02:41] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 4 ms to minimize.
[2024-05-20 15:02:41] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1059 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 15:02:41] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 3 ms to minimize.
[2024-05-20 15:02:41] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 3 ms to minimize.
[2024-05-20 15:02:42] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 3 ms to minimize.
[2024-05-20 15:02:42] [INFO ] Deduced a trap composed of 36 places in 176 ms of which 4 ms to minimize.
[2024-05-20 15:02:42] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 3 ms to minimize.
[2024-05-20 15:02:42] [INFO ] Deduced a trap composed of 36 places in 152 ms of which 3 ms to minimize.
[2024-05-20 15:02:42] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 3 ms to minimize.
[2024-05-20 15:02:43] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 3 ms to minimize.
[2024-05-20 15:02:43] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 3 ms to minimize.
[2024-05-20 15:02:43] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 3 ms to minimize.
[2024-05-20 15:02:43] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 3 ms to minimize.
[2024-05-20 15:02:43] [INFO ] Deduced a trap composed of 40 places in 187 ms of which 3 ms to minimize.
[2024-05-20 15:02:43] [INFO ] Deduced a trap composed of 35 places in 185 ms of which 3 ms to minimize.
[2024-05-20 15:02:44] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 3 ms to minimize.
[2024-05-20 15:02:44] [INFO ] Deduced a trap composed of 36 places in 188 ms of which 3 ms to minimize.
[2024-05-20 15:02:44] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 3 ms to minimize.
[2024-05-20 15:02:44] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 3 ms to minimize.
[2024-05-20 15:02:44] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 3 ms to minimize.
[2024-05-20 15:02:45] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 3 ms to minimize.
[2024-05-20 15:02:45] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1059 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 15:02:45] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 3 ms to minimize.
[2024-05-20 15:02:45] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 3 ms to minimize.
[2024-05-20 15:02:45] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 3 ms to minimize.
[2024-05-20 15:02:45] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 3 ms to minimize.
[2024-05-20 15:02:46] [INFO ] Deduced a trap composed of 35 places in 173 ms of which 3 ms to minimize.
[2024-05-20 15:02:46] [INFO ] Deduced a trap composed of 36 places in 174 ms of which 4 ms to minimize.
[2024-05-20 15:02:46] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 3 ms to minimize.
[2024-05-20 15:02:46] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 3 ms to minimize.
[2024-05-20 15:02:46] [INFO ] Deduced a trap composed of 35 places in 169 ms of which 4 ms to minimize.
[2024-05-20 15:02:47] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 3 ms to minimize.
[2024-05-20 15:02:47] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 3 ms to minimize.
[2024-05-20 15:02:47] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 2 ms to minimize.
[2024-05-20 15:02:47] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 3 ms to minimize.
[2024-05-20 15:02:47] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 3 ms to minimize.
[2024-05-20 15:02:47] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 3 ms to minimize.
[2024-05-20 15:02:47] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 3 ms to minimize.
[2024-05-20 15:02:48] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 3 ms to minimize.
[2024-05-20 15:02:48] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 3 ms to minimize.
[2024-05-20 15:02:48] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 5 ms to minimize.
[2024-05-20 15:02:48] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1059 variables, 20/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 15:02:48] [INFO ] Deduced a trap composed of 35 places in 178 ms of which 3 ms to minimize.
[2024-05-20 15:02:49] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 4 ms to minimize.
[2024-05-20 15:02:49] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 4 ms to minimize.
[2024-05-20 15:02:49] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 3 ms to minimize.
[2024-05-20 15:02:49] [INFO ] Deduced a trap composed of 36 places in 152 ms of which 2 ms to minimize.
[2024-05-20 15:02:49] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 3 ms to minimize.
[2024-05-20 15:02:49] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 3 ms to minimize.
[2024-05-20 15:02:50] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 3 ms to minimize.
[2024-05-20 15:02:50] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 4 ms to minimize.
[2024-05-20 15:02:50] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 3 ms to minimize.
[2024-05-20 15:02:50] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 3 ms to minimize.
[2024-05-20 15:02:50] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 3 ms to minimize.
[2024-05-20 15:02:51] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 3 ms to minimize.
[2024-05-20 15:02:51] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 3 ms to minimize.
[2024-05-20 15:02:51] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 3 ms to minimize.
[2024-05-20 15:02:51] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 3 ms to minimize.
[2024-05-20 15:02:51] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 3 ms to minimize.
[2024-05-20 15:02:51] [INFO ] Deduced a trap composed of 35 places in 133 ms of which 2 ms to minimize.
[2024-05-20 15:02:51] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 3 ms to minimize.
[2024-05-20 15:02:52] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1059 variables, 20/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 15:02:52] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 3 ms to minimize.
[2024-05-20 15:02:52] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 3 ms to minimize.
[2024-05-20 15:02:52] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 3 ms to minimize.
[2024-05-20 15:02:52] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 3 ms to minimize.
[2024-05-20 15:02:52] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 3 ms to minimize.
[2024-05-20 15:02:52] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 3 ms to minimize.
[2024-05-20 15:02:53] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2024-05-20 15:02:53] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 3 ms to minimize.
[2024-05-20 15:02:53] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1059 variables, 9/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1059 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 29/1088 variables, 29/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1088 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1953/3041 variables, 1088/1423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3041 variables, 1819/3242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3041 variables, 1/3243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3041 variables, 0/3243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3042 variables, 1/3244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3042 variables, 0/3244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3042 variables, 0/3244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3042/3042 variables, and 3244 constraints, problems are : Problem set: 0 solved, 1 unsolved in 69590 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1089/1089 constraints, ReadFeed: 1819/1819 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 274/274 constraints]
After SMT, in 70548ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 39 out of 1089 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1089/1089 places, 1953/1953 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1087 transition count 1951
Applied a total of 4 rules in 90 ms. Remains 1087 /1089 variables (removed 2) and now considering 1951/1953 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 1087/1089 places, 1951/1953 transitions.
RANDOM walk for 28547 steps (125 resets) in 476 ms. (59 steps per ms) remains 0/1 properties
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 124653 ms.

BK_STOP 1716217375114

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="CANConstruction-PT-030"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is CANConstruction-PT-030, 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 r070-tall-171620505000031"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-030.tgz
mv CANConstruction-PT-030 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 ;