Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r066-tajo-158922814800783.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DoubleExponent-PT-010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814800783
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 344K
-rw-r--r-- 1 mcc users 3.3K Mar 31 07:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 31 07:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 30 00:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 30 00:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 28 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 27 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 27 07:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 169K Mar 24 05:37 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 DoubleExponent-PT-010-ReachabilityFireability-00
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-01
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-02
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-03
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-04
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-05
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-06
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-07
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-08
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-09
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-10
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-11
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-12
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-13
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-14
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1590135947067

[2020-05-22 08:25:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-22 08:25:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 08:25:48] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2020-05-22 08:25:48] [INFO ] Transformed 534 places.
[2020-05-22 08:25:48] [INFO ] Transformed 498 transitions.
[2020-05-22 08:25:48] [INFO ] Parsed PT model containing 534 places and 498 transitions in 110 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 47 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 327 resets, run finished after 61 ms. (steps per millisecond=163 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 290 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 287 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 286 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 276 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 370 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 278 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Probably explored full state space saw : 1402705 states, properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 2805612 steps, saw 1402705 distinct states, run finished after 14920 ms. (steps per millisecond=188 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 5295097 steps, run timeout after 30119 ms. (steps per millisecond=175 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Exhaustive walk after 5295097 steps, saw 2647248 distinct states, run finished after 30119 ms. (steps per millisecond=175 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA DoubleExponent-PT-010-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
// Phase 1: matrix 498 rows 534 cols
[2020-05-22 08:26:34] [INFO ] Computed 54 place invariants in 81 ms
[2020-05-22 08:26:34] [INFO ] [Real]Absence check using 2 positive place invariants in 24 ms returned sat
[2020-05-22 08:26:34] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 34 ms returned unsat
[2020-05-22 08:26:34] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2020-05-22 08:26:34] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 56 ms returned sat
[2020-05-22 08:26:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:26:35] [INFO ] [Real]Absence check using state equation in 827 ms returned sat
[2020-05-22 08:26:35] [INFO ] Deduced a trap composed of 65 places in 236 ms
[2020-05-22 08:26:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 318 ms
[2020-05-22 08:26:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:26:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2020-05-22 08:26:35] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 37 ms returned sat
[2020-05-22 08:26:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:26:36] [INFO ] [Nat]Absence check using state equation in 969 ms returned sat
[2020-05-22 08:26:37] [INFO ] Deduced a trap composed of 48 places in 212 ms
[2020-05-22 08:26:37] [INFO ] Deduced a trap composed of 65 places in 134 ms
[2020-05-22 08:26:37] [INFO ] Deduced a trap composed of 216 places in 234 ms
[2020-05-22 08:26:37] [INFO ] Deduced a trap composed of 129 places in 85 ms
[2020-05-22 08:26:37] [INFO ] Deduced a trap composed of 186 places in 214 ms
[2020-05-22 08:26:38] [INFO ] Deduced a trap composed of 193 places in 203 ms
[2020-05-22 08:26:38] [INFO ] Deduced a trap composed of 101 places in 100 ms
[2020-05-22 08:26:38] [INFO ] Deduced a trap composed of 133 places in 115 ms
[2020-05-22 08:26:38] [INFO ] Deduced a trap composed of 121 places in 93 ms
[2020-05-22 08:26:38] [INFO ] Deduced a trap composed of 103 places in 98 ms
[2020-05-22 08:26:38] [INFO ] Deduced a trap composed of 77 places in 141 ms
[2020-05-22 08:26:39] [INFO ] Deduced a trap composed of 79 places in 151 ms
[2020-05-22 08:26:39] [INFO ] Deduced a trap composed of 67 places in 165 ms
[2020-05-22 08:26:39] [INFO ] Deduced a trap composed of 89 places in 134 ms
[2020-05-22 08:26:39] [INFO ] Deduced a trap composed of 91 places in 89 ms
[2020-05-22 08:26:39] [INFO ] Deduced a trap composed of 245 places in 180 ms
[2020-05-22 08:26:40] [INFO ] Deduced a trap composed of 43 places in 170 ms
[2020-05-22 08:26:40] [INFO ] Deduced a trap composed of 212 places in 250 ms
[2020-05-22 08:26:40] [INFO ] Deduced a trap composed of 210 places in 156 ms
[2020-05-22 08:26:40] [INFO ] Deduced a trap composed of 202 places in 255 ms
[2020-05-22 08:26:41] [INFO ] Deduced a trap composed of 188 places in 236 ms
[2020-05-22 08:26:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s17 s18 s19 s20 s21 s22 s24 s25 s26 s27 s28 s29 s45 s56 s67 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s89 s100 s111 s112 s123 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s156 s167 s191 s192 s193 s194 s195 s196 s203 s204 s205 s213 s214 s218 s222 s232 s233 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s252 s253 s254 s255 s257 s258 s259 s260 s261 s262 s263 s264 s277 s291 s292 s293 s294 s295 s301 s302 s303 s308 s310 s312 s313 s314 s320 s321 s323 s329 s330 s331 s332 s333 s335 s337 s350 s351 s352 s353 s354 s355 s357 s358 s359 s360 s361 s362 s363 s370 s371 s372 s373 s374 s375 s376 s377 s379 s380 s382 s395 s396 s397 s398 s399 s402 s403 s408 s409 s410 s412 s413 s418 s419 s420 s425 s428 s429 s438 s439 s440 s444 s454 s461 s462 s463 s464 s465 s468 s469 s470 s471 s472 s473 s474 s475 s476 s477 s480 s490 s492 s493 s494 s495 s496 s497 s498 s499 s500 s501 s502 s503 s504) 0)") while checking expression at index 1
[2020-05-22 08:26:41] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-05-22 08:26:41] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 20 ms returned unsat
[2020-05-22 08:26:41] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-05-22 08:26:41] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 45 ms returned sat
[2020-05-22 08:26:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:26:42] [INFO ] [Real]Absence check using state equation in 789 ms returned sat
[2020-05-22 08:26:42] [INFO ] Deduced a trap composed of 84 places in 151 ms
[2020-05-22 08:26:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2020-05-22 08:26:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:26:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned sat
[2020-05-22 08:26:42] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 41 ms returned sat
[2020-05-22 08:26:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:26:43] [INFO ] [Nat]Absence check using state equation in 947 ms returned sat
[2020-05-22 08:26:43] [INFO ] Deduced a trap composed of 53 places in 261 ms
[2020-05-22 08:26:43] [INFO ] Deduced a trap composed of 67 places in 159 ms
[2020-05-22 08:26:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 512 ms
[2020-05-22 08:26:43] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 31 ms.
[2020-05-22 08:26:47] [INFO ] Added : 340 causal constraints over 68 iterations in 3452 ms. Result :unknown
[2020-05-22 08:26:47] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2020-05-22 08:26:47] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 37 ms returned sat
[2020-05-22 08:26:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:26:48] [INFO ] [Real]Absence check using state equation in 771 ms returned sat
[2020-05-22 08:26:48] [INFO ] Deduced a trap composed of 207 places in 272 ms
[2020-05-22 08:26:48] [INFO ] Deduced a trap composed of 225 places in 228 ms
[2020-05-22 08:26:48] [INFO ] Deduced a trap composed of 53 places in 195 ms
[2020-05-22 08:26:49] [INFO ] Deduced a trap composed of 211 places in 242 ms
[2020-05-22 08:26:49] [INFO ] Deduced a trap composed of 222 places in 201 ms
[2020-05-22 08:26:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1307 ms
[2020-05-22 08:26:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:26:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-05-22 08:26:49] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 56 ms returned sat
[2020-05-22 08:26:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:26:50] [INFO ] [Nat]Absence check using state equation in 832 ms returned sat
[2020-05-22 08:26:50] [INFO ] Deduced a trap composed of 207 places in 303 ms
[2020-05-22 08:26:51] [INFO ] Deduced a trap composed of 211 places in 272 ms
[2020-05-22 08:26:51] [INFO ] Deduced a trap composed of 204 places in 279 ms
[2020-05-22 08:26:51] [INFO ] Deduced a trap composed of 219 places in 291 ms
[2020-05-22 08:26:52] [INFO ] Deduced a trap composed of 43 places in 282 ms
[2020-05-22 08:26:52] [INFO ] Deduced a trap composed of 206 places in 252 ms
[2020-05-22 08:26:52] [INFO ] Deduced a trap composed of 186 places in 248 ms
[2020-05-22 08:26:53] [INFO ] Deduced a trap composed of 212 places in 276 ms
[2020-05-22 08:26:53] [INFO ] Deduced a trap composed of 202 places in 239 ms
[2020-05-22 08:26:53] [INFO ] Deduced a trap composed of 234 places in 289 ms
[2020-05-22 08:26:54] [INFO ] Deduced a trap composed of 216 places in 271 ms
[2020-05-22 08:26:54] [INFO ] Deduced a trap composed of 152 places in 235 ms
[2020-05-22 08:26:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s17 s18 s19 s20 s21 s22 s24 s25 s26 s27 s28 s29 s45 s56 s67 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s89 s100 s111 s112 s123 s131 s134 s135 s136 s145 s147 s156 s166 s167 s168 s169 s170 s171 s172 s173 s190 s193 s194 s203 s204 s205 s218 s222 s226 s227 s228 s229 s230 s232 s233 s235 s244 s246 s249 s252 s253 s262 s264 s277 s279 s280 s281 s282 s284 s285 s291 s292 s293 s301 s302 s303 s307 s310 s312 s320 s321 s323 s333 s337 s343 s344 s346 s347 s348 s350 s351 s352 s360 s362 s366 s370 s371 s380 s381 s382 s395 s402 s403 s404 s405 s406 s408 s409 s410 s418 s419 s420 s428 s429 s430 s431 s432 s438 s439 s440 s444 s454 s468 s469 s470 s477 s479 s480 s481 s490 s492 s493 s494 s495 s496 s497 s498 s499 s500 s501 s502 s503 s504) 0)") while checking expression at index 4
[2020-05-22 08:26:54] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-05-22 08:26:54] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 43 ms returned sat
[2020-05-22 08:26:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:26:55] [INFO ] [Real]Absence check using state equation in 980 ms returned sat
[2020-05-22 08:26:55] [INFO ] Deduced a trap composed of 77 places in 130 ms
[2020-05-22 08:26:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2020-05-22 08:26:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:26:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2020-05-22 08:26:56] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 56 ms returned sat
[2020-05-22 08:26:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:26:57] [INFO ] [Nat]Absence check using state equation in 969 ms returned sat
[2020-05-22 08:26:57] [INFO ] Deduced a trap composed of 77 places in 173 ms
[2020-05-22 08:26:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2020-05-22 08:26:57] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 36 ms.
[2020-05-22 08:27:00] [INFO ] Added : 392 causal constraints over 79 iterations in 3620 ms. Result :sat
[2020-05-22 08:27:01] [INFO ] Deduced a trap composed of 24 places in 217 ms
[2020-05-22 08:27:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s2 s7 s12 s56 s67 s78 s145 s234 s245 s256 s267 s278 s289 s300 s311 s322 s334 s345 s367 s378 s512 s532 s533) 0)") while checking expression at index 5
[2020-05-22 08:27:01] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-05-22 08:27:01] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 45 ms returned sat
[2020-05-22 08:27:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:27:02] [INFO ] [Real]Absence check using state equation in 878 ms returned sat
[2020-05-22 08:27:02] [INFO ] Deduced a trap composed of 77 places in 182 ms
[2020-05-22 08:27:02] [INFO ] Deduced a trap composed of 79 places in 155 ms
[2020-05-22 08:27:02] [INFO ] Deduced a trap composed of 152 places in 148 ms
[2020-05-22 08:27:02] [INFO ] Deduced a trap composed of 150 places in 141 ms
[2020-05-22 08:27:03] [INFO ] Deduced a trap composed of 157 places in 193 ms
[2020-05-22 08:27:03] [INFO ] Deduced a trap composed of 157 places in 155 ms
[2020-05-22 08:27:03] [INFO ] Deduced a trap composed of 165 places in 156 ms
[2020-05-22 08:27:03] [INFO ] Deduced a trap composed of 159 places in 149 ms
[2020-05-22 08:27:03] [INFO ] Deduced a trap composed of 151 places in 159 ms
[2020-05-22 08:27:04] [INFO ] Deduced a trap composed of 152 places in 164 ms
[2020-05-22 08:27:04] [INFO ] Deduced a trap composed of 150 places in 146 ms
[2020-05-22 08:27:04] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2155 ms
[2020-05-22 08:27:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:27:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-05-22 08:27:04] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 49 ms returned sat
[2020-05-22 08:27:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:27:05] [INFO ] [Nat]Absence check using state equation in 1030 ms returned sat
[2020-05-22 08:27:05] [INFO ] Deduced a trap composed of 77 places in 197 ms
[2020-05-22 08:27:05] [INFO ] Deduced a trap composed of 153 places in 166 ms
[2020-05-22 08:27:06] [INFO ] Deduced a trap composed of 91 places in 185 ms
[2020-05-22 08:27:06] [INFO ] Deduced a trap composed of 65 places in 185 ms
[2020-05-22 08:27:06] [INFO ] Deduced a trap composed of 67 places in 165 ms
[2020-05-22 08:27:06] [INFO ] Deduced a trap composed of 53 places in 198 ms
[2020-05-22 08:27:07] [INFO ] Deduced a trap composed of 162 places in 214 ms
[2020-05-22 08:27:07] [INFO ] Deduced a trap composed of 155 places in 204 ms
[2020-05-22 08:27:07] [INFO ] Deduced a trap composed of 162 places in 210 ms
[2020-05-22 08:27:07] [INFO ] Deduced a trap composed of 55 places in 219 ms
[2020-05-22 08:27:08] [INFO ] Deduced a trap composed of 169 places in 168 ms
[2020-05-22 08:27:08] [INFO ] Deduced a trap composed of 156 places in 166 ms
[2020-05-22 08:27:08] [INFO ] Deduced a trap composed of 156 places in 163 ms
[2020-05-22 08:27:08] [INFO ] Deduced a trap composed of 164 places in 159 ms
[2020-05-22 08:27:08] [INFO ] Deduced a trap composed of 149 places in 154 ms
[2020-05-22 08:27:08] [INFO ] Deduced a trap composed of 146 places in 143 ms
[2020-05-22 08:27:09] [INFO ] Deduced a trap composed of 153 places in 172 ms
[2020-05-22 08:27:09] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3717 ms
[2020-05-22 08:27:09] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 31 ms.
[2020-05-22 08:27:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t11 0) (and (and (> t9 0) (< o9 o11)) (and (> t28 0) (< o28 o11))))") while checking expression at index 6
[2020-05-22 08:27:09] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2020-05-22 08:27:09] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 24 ms returned unsat
[2020-05-22 08:27:09] [INFO ] [Real]Absence check using 2 positive place invariants in 21 ms returned sat
[2020-05-22 08:27:09] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 42 ms returned unsat
[2020-05-22 08:27:09] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-05-22 08:27:09] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 43 ms returned sat
[2020-05-22 08:27:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:27:10] [INFO ] [Real]Absence check using state equation in 1029 ms returned sat
[2020-05-22 08:27:10] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 40 ms.
[2020-05-22 08:27:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:27:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2020-05-22 08:27:11] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 43 ms returned sat
[2020-05-22 08:27:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:27:12] [INFO ] [Nat]Absence check using state equation in 976 ms returned sat
[2020-05-22 08:27:12] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 32 ms.
[2020-05-22 08:27:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t443 0) (and (> t333 0) (< o333 o443)))") while checking expression at index 9
[2020-05-22 08:27:16] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2020-05-22 08:27:16] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 30 ms returned unsat
[2020-05-22 08:27:16] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-05-22 08:27:16] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 43 ms returned sat
[2020-05-22 08:27:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:27:16] [INFO ] [Real]Absence check using state equation in 789 ms returned sat
[2020-05-22 08:27:17] [INFO ] Deduced a trap composed of 101 places in 140 ms
[2020-05-22 08:27:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2020-05-22 08:27:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:27:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-05-22 08:27:17] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 44 ms returned sat
[2020-05-22 08:27:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:27:18] [INFO ] [Nat]Absence check using state equation in 870 ms returned sat
[2020-05-22 08:27:18] [INFO ] Deduced a trap composed of 101 places in 94 ms
[2020-05-22 08:27:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2020-05-22 08:27:18] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 28 ms.
[2020-05-22 08:27:22] [INFO ] Added : 355 causal constraints over 71 iterations in 3890 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-22 08:27:22] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-05-22 08:27:22] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 29 ms returned unsat
[2020-05-22 08:27:22] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-05-22 08:27:22] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 31 ms returned unsat
[2020-05-22 08:27:22] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-05-22 08:27:22] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 25 ms returned unsat
FORMULA DoubleExponent-PT-010-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 376200 steps, including 13407 resets, run finished after 729 ms. (steps per millisecond=516 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 24 out of 534 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 534/534 places, 498/498 transitions.
Discarding 6 places :
Also discarding 0 output transitions
Graph (complete) has 906 edges and 534 vertex of which 528 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.10 ms
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Iterating post reduction 0 with 109 rules applied. Total rules applied 110 place count 527 transition count 390
Reduce places removed 106 places and 0 transitions.
Iterating post reduction 1 with 106 rules applied. Total rules applied 216 place count 421 transition count 390
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 216 place count 421 transition count 370
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 256 place count 401 transition count 370
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 3 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 420 place count 319 transition count 288
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 452 place count 303 transition count 288
Free-agglomeration rule (complex) applied 43 times.
Iterating global reduction 2 with 43 rules applied. Total rules applied 495 place count 303 transition count 245
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 538 place count 260 transition count 245
Partial Free-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 3 with 34 rules applied. Total rules applied 572 place count 260 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 573 place count 259 transition count 244
Applied a total of 573 rules in 165 ms. Remains 259 /534 variables (removed 275) and now considering 244/498 (removed 254) transitions.
Finished structural reductions, in 1 iterations. Remains : 259/534 places, 244/498 transitions.
Incomplete random walk after 1000000 steps, including 101756 resets, run finished after 1557 ms. (steps per millisecond=642 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 72372 resets, run finished after 1109 ms. (steps per millisecond=901 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 72465 resets, run finished after 945 ms. (steps per millisecond=1058 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 72466 resets, run finished after 1071 ms. (steps per millisecond=933 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 72490 resets, run finished after 977 ms. (steps per millisecond=1023 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 72441 resets, run finished after 1031 ms. (steps per millisecond=969 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 72478 resets, run finished after 975 ms. (steps per millisecond=1025 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 72539 resets, run finished after 936 ms. (steps per millisecond=1068 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Probably explored full state space saw : 890055 states, properties seen :[0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 1780182 steps, saw 890055 distinct states, run finished after 5952 ms. (steps per millisecond=299 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 6635671 steps, run timeout after 30001 ms. (steps per millisecond=221 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Exhaustive walk after 6635671 steps, saw 3317640 distinct states, run finished after 30001 ms. (steps per millisecond=221 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 244 rows 259 cols
[2020-05-22 08:28:08] [INFO ] Computed 50 place invariants in 13 ms
[2020-05-22 08:28:08] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2020-05-22 08:28:08] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 33 ms returned sat
[2020-05-22 08:28:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:28:08] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2020-05-22 08:28:08] [INFO ] State equation strengthened by 28 read => feed constraints.
[2020-05-22 08:28:08] [INFO ] [Real]Added 28 Read/Feed constraints in 5 ms returned sat
[2020-05-22 08:28:08] [INFO ] Deduced a trap composed of 4 places in 160 ms
[2020-05-22 08:28:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2020-05-22 08:28:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:28:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2020-05-22 08:28:08] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 23 ms returned sat
[2020-05-22 08:28:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:28:08] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2020-05-22 08:28:08] [INFO ] [Nat]Added 28 Read/Feed constraints in 13 ms returned sat
[2020-05-22 08:28:08] [INFO ] Deduced a trap composed of 28 places in 88 ms
[2020-05-22 08:28:09] [INFO ] Deduced a trap composed of 18 places in 96 ms
[2020-05-22 08:28:09] [INFO ] Deduced a trap composed of 17 places in 104 ms
[2020-05-22 08:28:09] [INFO ] Deduced a trap composed of 25 places in 81 ms
[2020-05-22 08:28:09] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-05-22 08:28:09] [INFO ] Deduced a trap composed of 34 places in 46 ms
[2020-05-22 08:28:09] [INFO ] Deduced a trap composed of 43 places in 38 ms
[2020-05-22 08:28:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 631 ms
[2020-05-22 08:28:09] [INFO ] Computed and/alt/rep : 243/1725/243 causal constraints in 17 ms.
[2020-05-22 08:28:12] [INFO ] Added : 237 causal constraints over 48 iterations in 2696 ms. Result :sat
[2020-05-22 08:28:12] [INFO ] Deduced a trap composed of 8 places in 123 ms
[2020-05-22 08:28:12] [INFO ] Deduced a trap composed of 22 places in 109 ms
[2020-05-22 08:28:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 403 ms
Attempting to minimize the solution found.
Minimization took 35 ms.
[2020-05-22 08:28:12] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2020-05-22 08:28:12] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 28 ms returned sat
[2020-05-22 08:28:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:28:13] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2020-05-22 08:28:13] [INFO ] [Real]Added 28 Read/Feed constraints in 6 ms returned sat
[2020-05-22 08:28:13] [INFO ] Computed and/alt/rep : 243/1725/243 causal constraints in 15 ms.
[2020-05-22 08:28:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:28:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2020-05-22 08:28:13] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 25 ms returned sat
[2020-05-22 08:28:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:28:13] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2020-05-22 08:28:13] [INFO ] [Nat]Added 28 Read/Feed constraints in 21 ms returned sat
[2020-05-22 08:28:13] [INFO ] Deduced a trap composed of 37 places in 204 ms
[2020-05-22 08:28:13] [INFO ] Deduced a trap composed of 28 places in 53 ms
[2020-05-22 08:28:13] [INFO ] Deduced a trap composed of 62 places in 47 ms
[2020-05-22 08:28:13] [INFO ] Deduced a trap composed of 64 places in 46 ms
[2020-05-22 08:28:13] [INFO ] Deduced a trap composed of 61 places in 48 ms
[2020-05-22 08:28:13] [INFO ] Deduced a trap composed of 62 places in 49 ms
[2020-05-22 08:28:14] [INFO ] Deduced a trap composed of 65 places in 47 ms
[2020-05-22 08:28:14] [INFO ] Deduced a trap composed of 67 places in 45 ms
[2020-05-22 08:28:14] [INFO ] Deduced a trap composed of 72 places in 46 ms
[2020-05-22 08:28:14] [INFO ] Deduced a trap composed of 67 places in 51 ms
[2020-05-22 08:28:14] [INFO ] Deduced a trap composed of 40 places in 42 ms
[2020-05-22 08:28:14] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 818 ms
[2020-05-22 08:28:14] [INFO ] Computed and/alt/rep : 243/1725/243 causal constraints in 15 ms.
[2020-05-22 08:28:15] [INFO ] Added : 204 causal constraints over 42 iterations in 1654 ms. Result :sat
[2020-05-22 08:28:16] [INFO ] Deduced a trap composed of 15 places in 130 ms
[2020-05-22 08:28:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
Attempting to minimize the solution found.
Minimization took 21 ms.
[2020-05-22 08:28:16] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2020-05-22 08:28:16] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 33 ms returned sat
[2020-05-22 08:28:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:28:16] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2020-05-22 08:28:16] [INFO ] [Real]Added 28 Read/Feed constraints in 7 ms returned sat
[2020-05-22 08:28:16] [INFO ] Computed and/alt/rep : 243/1725/243 causal constraints in 23 ms.
[2020-05-22 08:28:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:28:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2020-05-22 08:28:16] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 25 ms returned sat
[2020-05-22 08:28:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:28:17] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2020-05-22 08:28:17] [INFO ] [Nat]Added 28 Read/Feed constraints in 24 ms returned sat
[2020-05-22 08:28:17] [INFO ] Deduced a trap composed of 76 places in 120 ms
[2020-05-22 08:28:17] [INFO ] Deduced a trap composed of 84 places in 122 ms
[2020-05-22 08:28:17] [INFO ] Deduced a trap composed of 91 places in 107 ms
[2020-05-22 08:28:17] [INFO ] Deduced a trap composed of 95 places in 121 ms
[2020-05-22 08:28:17] [INFO ] Deduced a trap composed of 76 places in 187 ms
[2020-05-22 08:28:17] [INFO ] Deduced a trap composed of 28 places in 113 ms
[2020-05-22 08:28:18] [INFO ] Deduced a trap composed of 84 places in 104 ms
[2020-05-22 08:28:18] [INFO ] Deduced a trap composed of 81 places in 77 ms
[2020-05-22 08:28:18] [INFO ] Deduced a trap composed of 82 places in 102 ms
[2020-05-22 08:28:18] [INFO ] Deduced a trap composed of 20 places in 117 ms
[2020-05-22 08:28:18] [INFO ] Deduced a trap composed of 90 places in 91 ms
[2020-05-22 08:28:18] [INFO ] Deduced a trap composed of 84 places in 104 ms
[2020-05-22 08:28:18] [INFO ] Deduced a trap composed of 88 places in 95 ms
[2020-05-22 08:28:18] [INFO ] Deduced a trap composed of 18 places in 91 ms
[2020-05-22 08:28:18] [INFO ] Deduced a trap composed of 50 places in 80 ms
[2020-05-22 08:28:18] [INFO ] Deduced a trap composed of 17 places in 81 ms
[2020-05-22 08:28:19] [INFO ] Deduced a trap composed of 19 places in 80 ms
[2020-05-22 08:28:19] [INFO ] Deduced a trap composed of 95 places in 78 ms
[2020-05-22 08:28:19] [INFO ] Deduced a trap composed of 96 places in 78 ms
[2020-05-22 08:28:19] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2199 ms
[2020-05-22 08:28:19] [INFO ] Computed and/alt/rep : 243/1725/243 causal constraints in 15 ms.
[2020-05-22 08:28:22] [INFO ] Added : 235 causal constraints over 47 iterations in 3174 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 99 ms.
[2020-05-22 08:28:22] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2020-05-22 08:28:22] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 17 ms returned sat
[2020-05-22 08:28:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:28:22] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2020-05-22 08:28:22] [INFO ] [Real]Added 28 Read/Feed constraints in 5 ms returned sat
[2020-05-22 08:28:22] [INFO ] Deduced a trap composed of 27 places in 65 ms
[2020-05-22 08:28:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2020-05-22 08:28:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:28:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2020-05-22 08:28:23] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 22 ms returned sat
[2020-05-22 08:28:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:28:23] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2020-05-22 08:28:23] [INFO ] [Nat]Added 28 Read/Feed constraints in 11 ms returned sat
[2020-05-22 08:28:23] [INFO ] Deduced a trap composed of 27 places in 50 ms
[2020-05-22 08:28:23] [INFO ] Deduced a trap composed of 28 places in 55 ms
[2020-05-22 08:28:23] [INFO ] Deduced a trap composed of 34 places in 42 ms
[2020-05-22 08:28:23] [INFO ] Deduced a trap composed of 37 places in 45 ms
[2020-05-22 08:28:23] [INFO ] Deduced a trap composed of 33 places in 30 ms
[2020-05-22 08:28:23] [INFO ] Deduced a trap composed of 30 places in 35 ms
[2020-05-22 08:28:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 328 ms
[2020-05-22 08:28:23] [INFO ] Computed and/alt/rep : 243/1725/243 causal constraints in 13 ms.
[2020-05-22 08:28:26] [INFO ] Added : 243 causal constraints over 49 iterations in 3236 ms. Result :sat
[2020-05-22 08:28:26] [INFO ] Deduced a trap composed of 8 places in 148 ms
[2020-05-22 08:28:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
Attempting to minimize the solution found.
Minimization took 27 ms.
[2020-05-22 08:28:27] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2020-05-22 08:28:27] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 30 ms returned sat
[2020-05-22 08:28:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:28:27] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2020-05-22 08:28:27] [INFO ] [Real]Added 28 Read/Feed constraints in 6 ms returned sat
[2020-05-22 08:28:27] [INFO ] Deduced a trap composed of 46 places in 44 ms
[2020-05-22 08:28:27] [INFO ] Deduced a trap composed of 51 places in 55 ms
[2020-05-22 08:28:27] [INFO ] Deduced a trap composed of 49 places in 58 ms
[2020-05-22 08:28:27] [INFO ] Deduced a trap composed of 53 places in 55 ms
[2020-05-22 08:28:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 300 ms
[2020-05-22 08:28:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:28:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2020-05-22 08:28:27] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 14 ms returned sat
[2020-05-22 08:28:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:28:27] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2020-05-22 08:28:28] [INFO ] [Nat]Added 28 Read/Feed constraints in 9 ms returned sat
[2020-05-22 08:28:28] [INFO ] Deduced a trap composed of 37 places in 57 ms
[2020-05-22 08:28:28] [INFO ] Deduced a trap composed of 23 places in 51 ms
[2020-05-22 08:28:28] [INFO ] Deduced a trap composed of 58 places in 51 ms
[2020-05-22 08:28:28] [INFO ] Deduced a trap composed of 28 places in 42 ms
[2020-05-22 08:28:28] [INFO ] Deduced a trap composed of 38 places in 43 ms
[2020-05-22 08:28:28] [INFO ] Deduced a trap composed of 60 places in 57 ms
[2020-05-22 08:28:28] [INFO ] Deduced a trap composed of 63 places in 55 ms
[2020-05-22 08:28:28] [INFO ] Deduced a trap composed of 62 places in 51 ms
[2020-05-22 08:28:28] [INFO ] Deduced a trap composed of 65 places in 48 ms
[2020-05-22 08:28:28] [INFO ] Deduced a trap composed of 65 places in 44 ms
[2020-05-22 08:28:28] [INFO ] Deduced a trap composed of 62 places in 46 ms
[2020-05-22 08:28:28] [INFO ] Deduced a trap composed of 64 places in 48 ms
[2020-05-22 08:28:28] [INFO ] Deduced a trap composed of 65 places in 50 ms
[2020-05-22 08:28:28] [INFO ] Deduced a trap composed of 66 places in 49 ms
[2020-05-22 08:28:28] [INFO ] Deduced a trap composed of 66 places in 32 ms
[2020-05-22 08:28:28] [INFO ] Deduced a trap composed of 71 places in 47 ms
[2020-05-22 08:28:28] [INFO ] Deduced a trap composed of 51 places in 33 ms
[2020-05-22 08:28:28] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 993 ms
[2020-05-22 08:28:29] [INFO ] Computed and/alt/rep : 243/1725/243 causal constraints in 12 ms.
[2020-05-22 08:28:31] [INFO ] Added : 236 causal constraints over 48 iterations in 2144 ms. Result :sat
[2020-05-22 08:28:31] [INFO ] Deduced a trap composed of 15 places in 138 ms
[2020-05-22 08:28:31] [INFO ] Deduced a trap composed of 12 places in 125 ms
[2020-05-22 08:28:31] [INFO ] Deduced a trap composed of 16 places in 96 ms
[2020-05-22 08:28:31] [INFO ] Deduced a trap composed of 18 places in 69 ms
[2020-05-22 08:28:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 621 ms
Attempting to minimize the solution found.
Minimization took 27 ms.
[2020-05-22 08:28:31] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2020-05-22 08:28:31] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 26 ms returned sat
[2020-05-22 08:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:28:32] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2020-05-22 08:28:32] [INFO ] [Real]Added 28 Read/Feed constraints in 4 ms returned sat
[2020-05-22 08:28:32] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-05-22 08:28:32] [INFO ] Deduced a trap composed of 28 places in 58 ms
[2020-05-22 08:28:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 169 ms
[2020-05-22 08:28:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:28:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2020-05-22 08:28:32] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2020-05-22 08:28:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:28:32] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2020-05-22 08:28:32] [INFO ] [Nat]Added 28 Read/Feed constraints in 8 ms returned sat
[2020-05-22 08:28:32] [INFO ] Deduced a trap composed of 20 places in 71 ms
[2020-05-22 08:28:32] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-05-22 08:28:32] [INFO ] Deduced a trap composed of 28 places in 33 ms
[2020-05-22 08:28:32] [INFO ] Deduced a trap composed of 53 places in 34 ms
[2020-05-22 08:28:32] [INFO ] Deduced a trap composed of 49 places in 31 ms
[2020-05-22 08:28:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 320 ms
[2020-05-22 08:28:32] [INFO ] Computed and/alt/rep : 243/1725/243 causal constraints in 12 ms.
[2020-05-22 08:28:37] [INFO ] Added : 243 causal constraints over 49 iterations in 4198 ms. Result :sat
[2020-05-22 08:28:37] [INFO ] Deduced a trap composed of 5 places in 112 ms
[2020-05-22 08:28:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
Attempting to minimize the solution found.
Minimization took 20 ms.
[2020-05-22 08:28:37] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-05-22 08:28:37] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 23 ms returned sat
[2020-05-22 08:28:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:28:37] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2020-05-22 08:28:37] [INFO ] [Real]Added 28 Read/Feed constraints in 6 ms returned sat
[2020-05-22 08:28:37] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2020-05-22 08:28:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2020-05-22 08:28:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:28:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2020-05-22 08:28:37] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 16 ms returned sat
[2020-05-22 08:28:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:28:37] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2020-05-22 08:28:37] [INFO ] [Nat]Added 28 Read/Feed constraints in 8 ms returned sat
[2020-05-22 08:28:38] [INFO ] Deduced a trap composed of 28 places in 101 ms
[2020-05-22 08:28:38] [INFO ] Deduced a trap composed of 15 places in 81 ms
[2020-05-22 08:28:38] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-05-22 08:28:38] [INFO ] Deduced a trap composed of 37 places in 35 ms
[2020-05-22 08:28:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 338 ms
[2020-05-22 08:28:38] [INFO ] Computed and/alt/rep : 243/1725/243 causal constraints in 12 ms.
[2020-05-22 08:28:42] [INFO ] Added : 243 causal constraints over 50 iterations in 3742 ms. Result :sat
[2020-05-22 08:28:42] [INFO ] Deduced a trap composed of 11 places in 95 ms
[2020-05-22 08:28:42] [INFO ] Deduced a trap composed of 17 places in 86 ms
[2020-05-22 08:28:42] [INFO ] Deduced a trap composed of 5 places in 89 ms
[2020-05-22 08:28:42] [INFO ] Deduced a trap composed of 19 places in 65 ms
[2020-05-22 08:28:42] [INFO ] Deduced a trap composed of 15 places in 71 ms
[2020-05-22 08:28:42] [INFO ] Deduced a trap composed of 24 places in 85 ms
[2020-05-22 08:28:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 780 ms
Attempting to minimize the solution found.
Minimization took 30 ms.
Incomplete Parikh walk after 1652800 steps, including 192111 resets, run finished after 2508 ms. (steps per millisecond=659 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 12915600 steps, including 1502529 resets, run finished after 19157 ms. (steps per millisecond=674 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 433700 steps, including 50421 resets, run finished after 632 ms. (steps per millisecond=686 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 9619800 steps, including 1118421 resets, run finished after 14808 ms. (steps per millisecond=649 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 379800 steps, including 44110 resets, run finished after 570 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 181300 steps, including 21053 resets, run finished after 272 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 5645500 steps, including 656377 resets, run finished after 8735 ms. (steps per millisecond=646 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 24 out of 259 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 259/259 places, 244/244 transitions.
Applied a total of 0 rules in 10 ms. Remains 259 /259 variables (removed 0) and now considering 244/244 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 259/259 places, 244/244 transitions.
Starting structural reductions, iteration 0 : 259/259 places, 244/244 transitions.
Applied a total of 0 rules in 9 ms. Remains 259 /259 variables (removed 0) and now considering 244/244 (removed 0) transitions.
// Phase 1: matrix 244 rows 259 cols
[2020-05-22 08:29:29] [INFO ] Computed 50 place invariants in 14 ms
[2020-05-22 08:29:29] [INFO ] Implicit Places using invariants in 420 ms returned [21, 28, 50, 55, 78, 85, 106, 115, 138, 143, 144, 165, 172, 195, 201, 208, 216, 223, 249, 256]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 422 ms to find 20 implicit places.
[2020-05-22 08:29:30] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 244 rows 239 cols
[2020-05-22 08:29:30] [INFO ] Computed 31 place invariants in 7 ms
[2020-05-22 08:29:30] [INFO ] Dead Transitions using invariants and state equation in 384 ms returned []
Starting structural reductions, iteration 1 : 239/259 places, 244/244 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 238 transition count 243
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 7 place count 238 transition count 238
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 12 place count 233 transition count 238
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 233 transition count 238
Applied a total of 15 rules in 21 ms. Remains 233 /239 variables (removed 6) and now considering 238/244 (removed 6) transitions.
// Phase 1: matrix 238 rows 233 cols
[2020-05-22 08:29:30] [INFO ] Computed 31 place invariants in 9 ms
[2020-05-22 08:29:30] [INFO ] Implicit Places using invariants in 299 ms returned []
// Phase 1: matrix 238 rows 233 cols
[2020-05-22 08:29:30] [INFO ] Computed 31 place invariants in 15 ms
[2020-05-22 08:29:30] [INFO ] State equation strengthened by 30 read => feed constraints.
[2020-05-22 08:29:31] [INFO ] Implicit Places using invariants and state equation in 1099 ms returned []
Implicit Place search using SMT with State Equation took 1399 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 233/259 places, 238/244 transitions.
Incomplete random walk after 1000000 steps, including 112034 resets, run finished after 1309 ms. (steps per millisecond=763 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 77329 resets, run finished after 1108 ms. (steps per millisecond=902 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 77461 resets, run finished after 916 ms. (steps per millisecond=1091 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 77496 resets, run finished after 967 ms. (steps per millisecond=1034 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 77286 resets, run finished after 978 ms. (steps per millisecond=1022 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 77347 resets, run finished after 1010 ms. (steps per millisecond=990 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 77265 resets, run finished after 940 ms. (steps per millisecond=1063 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 77232 resets, run finished after 990 ms. (steps per millisecond=1010 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 8162921 steps, run timeout after 30001 ms. (steps per millisecond=272 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 8162921 steps, saw 4080470 distinct states, run finished after 30001 ms. (steps per millisecond=272 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 238 rows 233 cols
[2020-05-22 08:30:10] [INFO ] Computed 31 place invariants in 7 ms
[2020-05-22 08:30:10] [INFO ] [Real]Absence check using 13 positive place invariants in 26 ms returned sat
[2020-05-22 08:30:10] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2020-05-22 08:30:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:30:10] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2020-05-22 08:30:10] [INFO ] State equation strengthened by 30 read => feed constraints.
[2020-05-22 08:30:10] [INFO ] [Real]Added 30 Read/Feed constraints in 6 ms returned sat
[2020-05-22 08:30:10] [INFO ] Deduced a trap composed of 4 places in 107 ms
[2020-05-22 08:30:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2020-05-22 08:30:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:30:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 30 ms returned sat
[2020-05-22 08:30:10] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 11 ms returned sat
[2020-05-22 08:30:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:30:10] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2020-05-22 08:30:10] [INFO ] [Nat]Added 30 Read/Feed constraints in 15 ms returned sat
[2020-05-22 08:30:10] [INFO ] Deduced a trap composed of 17 places in 89 ms
[2020-05-22 08:30:11] [INFO ] Deduced a trap composed of 27 places in 49 ms
[2020-05-22 08:30:11] [INFO ] Deduced a trap composed of 27 places in 60 ms
[2020-05-22 08:30:11] [INFO ] Deduced a trap composed of 37 places in 30 ms
[2020-05-22 08:30:11] [INFO ] Deduced a trap composed of 34 places in 32 ms
[2020-05-22 08:30:11] [INFO ] Deduced a trap composed of 37 places in 34 ms
[2020-05-22 08:30:11] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 363 ms
[2020-05-22 08:30:11] [INFO ] Computed and/alt/rep : 237/1513/237 causal constraints in 14 ms.
[2020-05-22 08:30:14] [INFO ] Added : 235 causal constraints over 47 iterations in 2946 ms. Result :sat
[2020-05-22 08:30:14] [INFO ] Deduced a trap composed of 8 places in 105 ms
[2020-05-22 08:30:14] [INFO ] Deduced a trap composed of 12 places in 86 ms
[2020-05-22 08:30:14] [INFO ] Deduced a trap composed of 16 places in 100 ms
[2020-05-22 08:30:14] [INFO ] Deduced a trap composed of 20 places in 96 ms
[2020-05-22 08:30:14] [INFO ] Deduced a trap composed of 21 places in 99 ms
[2020-05-22 08:30:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 687 ms
Attempting to minimize the solution found.
Minimization took 31 ms.
[2020-05-22 08:30:14] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2020-05-22 08:30:14] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2020-05-22 08:30:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:30:15] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2020-05-22 08:30:15] [INFO ] [Real]Added 30 Read/Feed constraints in 5 ms returned sat
[2020-05-22 08:30:15] [INFO ] Deduced a trap composed of 18 places in 96 ms
[2020-05-22 08:30:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2020-05-22 08:30:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:30:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 22 ms returned sat
[2020-05-22 08:30:15] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 11 ms returned sat
[2020-05-22 08:30:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:30:15] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2020-05-22 08:30:15] [INFO ] [Nat]Added 30 Read/Feed constraints in 88 ms returned sat
[2020-05-22 08:30:15] [INFO ] Deduced a trap composed of 83 places in 126 ms
[2020-05-22 08:30:16] [INFO ] Deduced a trap composed of 84 places in 101 ms
[2020-05-22 08:30:16] [INFO ] Deduced a trap composed of 80 places in 100 ms
[2020-05-22 08:30:16] [INFO ] Deduced a trap composed of 18 places in 97 ms
[2020-05-22 08:30:16] [INFO ] Deduced a trap composed of 77 places in 97 ms
[2020-05-22 08:30:16] [INFO ] Deduced a trap composed of 76 places in 85 ms
[2020-05-22 08:30:16] [INFO ] Deduced a trap composed of 63 places in 130 ms
[2020-05-22 08:30:16] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 829 ms
[2020-05-22 08:30:16] [INFO ] Computed and/alt/rep : 237/1513/237 causal constraints in 16 ms.
[2020-05-22 08:30:19] [INFO ] Added : 234 causal constraints over 47 iterations in 3118 ms. Result :sat
[2020-05-22 08:30:19] [INFO ] Deduced a trap composed of 84 places in 137 ms
[2020-05-22 08:30:20] [INFO ] Deduced a trap composed of 84 places in 117 ms
[2020-05-22 08:30:20] [INFO ] Deduced a trap composed of 23 places in 117 ms
[2020-05-22 08:30:20] [INFO ] Deduced a trap composed of 85 places in 121 ms
[2020-05-22 08:30:20] [INFO ] Deduced a trap composed of 20 places in 129 ms
[2020-05-22 08:30:20] [INFO ] Deduced a trap composed of 28 places in 131 ms
[2020-05-22 08:30:20] [INFO ] Deduced a trap composed of 84 places in 134 ms
[2020-05-22 08:30:21] [INFO ] Deduced a trap composed of 87 places in 146 ms
[2020-05-22 08:30:21] [INFO ] Deduced a trap composed of 74 places in 127 ms
[2020-05-22 08:30:21] [INFO ] Deduced a trap composed of 80 places in 114 ms
[2020-05-22 08:30:21] [INFO ] Deduced a trap composed of 91 places in 131 ms
[2020-05-22 08:30:21] [INFO ] Deduced a trap composed of 87 places in 127 ms
[2020-05-22 08:30:21] [INFO ] Deduced a trap composed of 19 places in 125 ms
[2020-05-22 08:30:22] [INFO ] Deduced a trap composed of 75 places in 126 ms
[2020-05-22 08:30:22] [INFO ] Deduced a trap composed of 97 places in 138 ms
[2020-05-22 08:30:22] [INFO ] Deduced a trap composed of 89 places in 127 ms
[2020-05-22 08:30:22] [INFO ] Deduced a trap composed of 90 places in 94 ms
[2020-05-22 08:30:22] [INFO ] Deduced a trap composed of 80 places in 105 ms
[2020-05-22 08:30:22] [INFO ] Deduced a trap composed of 94 places in 109 ms
[2020-05-22 08:30:23] [INFO ] Deduced a trap composed of 90 places in 120 ms
[2020-05-22 08:30:23] [INFO ] Deduced a trap composed of 92 places in 126 ms
[2020-05-22 08:30:23] [INFO ] Deduced a trap composed of 90 places in 117 ms
[2020-05-22 08:30:23] [INFO ] Deduced a trap composed of 89 places in 118 ms
[2020-05-22 08:30:23] [INFO ] Deduced a trap composed of 93 places in 107 ms
[2020-05-22 08:30:23] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4078 ms
Attempting to minimize the solution found.
Minimization took 25 ms.
[2020-05-22 08:30:23] [INFO ] [Real]Absence check using 13 positive place invariants in 22 ms returned sat
[2020-05-22 08:30:23] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2020-05-22 08:30:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:30:24] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2020-05-22 08:30:24] [INFO ] [Real]Added 30 Read/Feed constraints in 14 ms returned sat
[2020-05-22 08:30:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:30:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 18 ms returned sat
[2020-05-22 08:30:24] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2020-05-22 08:30:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:30:24] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2020-05-22 08:30:24] [INFO ] [Nat]Added 30 Read/Feed constraints in 48 ms returned sat
[2020-05-22 08:30:24] [INFO ] Deduced a trap composed of 75 places in 129 ms
[2020-05-22 08:30:24] [INFO ] Deduced a trap composed of 76 places in 93 ms
[2020-05-22 08:30:24] [INFO ] Deduced a trap composed of 14 places in 53 ms
[2020-05-22 08:30:24] [INFO ] Deduced a trap composed of 27 places in 45 ms
[2020-05-22 08:30:25] [INFO ] Deduced a trap composed of 89 places in 108 ms
[2020-05-22 08:30:25] [INFO ] Deduced a trap composed of 93 places in 101 ms
[2020-05-22 08:30:25] [INFO ] Deduced a trap composed of 71 places in 114 ms
[2020-05-22 08:30:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 751 ms
[2020-05-22 08:30:25] [INFO ] Computed and/alt/rep : 237/1513/237 causal constraints in 16 ms.
[2020-05-22 08:30:27] [INFO ] Added : 220 causal constraints over 44 iterations in 2484 ms. Result :sat
[2020-05-22 08:30:27] [INFO ] Deduced a trap composed of 75 places in 148 ms
[2020-05-22 08:30:28] [INFO ] Deduced a trap composed of 75 places in 147 ms
[2020-05-22 08:30:28] [INFO ] Deduced a trap composed of 12 places in 187 ms
[2020-05-22 08:30:28] [INFO ] Deduced a trap composed of 73 places in 148 ms
[2020-05-22 08:30:28] [INFO ] Deduced a trap composed of 63 places in 140 ms
[2020-05-22 08:30:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 954 ms
Attempting to minimize the solution found.
Minimization took 17 ms.
[2020-05-22 08:30:28] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2020-05-22 08:30:28] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2020-05-22 08:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:30:29] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2020-05-22 08:30:29] [INFO ] [Real]Added 30 Read/Feed constraints in 7 ms returned sat
[2020-05-22 08:30:29] [INFO ] Computed and/alt/rep : 237/1513/237 causal constraints in 16 ms.
[2020-05-22 08:30:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:30:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 26 ms returned sat
[2020-05-22 08:30:29] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 12 ms returned sat
[2020-05-22 08:30:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:30:29] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2020-05-22 08:30:29] [INFO ] [Nat]Added 30 Read/Feed constraints in 26 ms returned sat
[2020-05-22 08:30:29] [INFO ] Deduced a trap composed of 69 places in 141 ms
[2020-05-22 08:30:29] [INFO ] Deduced a trap composed of 64 places in 108 ms
[2020-05-22 08:30:29] [INFO ] Deduced a trap composed of 69 places in 87 ms
[2020-05-22 08:30:30] [INFO ] Deduced a trap composed of 69 places in 79 ms
[2020-05-22 08:30:30] [INFO ] Deduced a trap composed of 68 places in 118 ms
[2020-05-22 08:30:30] [INFO ] Deduced a trap composed of 68 places in 118 ms
[2020-05-22 08:30:30] [INFO ] Deduced a trap composed of 63 places in 103 ms
[2020-05-22 08:30:30] [INFO ] Deduced a trap composed of 69 places in 99 ms
[2020-05-22 08:30:30] [INFO ] Deduced a trap composed of 71 places in 118 ms
[2020-05-22 08:30:30] [INFO ] Deduced a trap composed of 27 places in 96 ms
[2020-05-22 08:30:30] [INFO ] Deduced a trap composed of 20 places in 125 ms
[2020-05-22 08:30:31] [INFO ] Deduced a trap composed of 72 places in 102 ms
[2020-05-22 08:30:31] [INFO ] Deduced a trap composed of 86 places in 94 ms
[2020-05-22 08:30:31] [INFO ] Deduced a trap composed of 81 places in 118 ms
[2020-05-22 08:30:31] [INFO ] Deduced a trap composed of 82 places in 102 ms
[2020-05-22 08:30:31] [INFO ] Deduced a trap composed of 81 places in 99 ms
[2020-05-22 08:30:31] [INFO ] Deduced a trap composed of 76 places in 120 ms
[2020-05-22 08:30:31] [INFO ] Deduced a trap composed of 75 places in 122 ms
[2020-05-22 08:30:31] [INFO ] Deduced a trap composed of 77 places in 93 ms
[2020-05-22 08:30:31] [INFO ] Deduced a trap composed of 72 places in 94 ms
[2020-05-22 08:30:32] [INFO ] Deduced a trap composed of 72 places in 92 ms
[2020-05-22 08:30:32] [INFO ] Deduced a trap composed of 73 places in 94 ms
[2020-05-22 08:30:32] [INFO ] Deduced a trap composed of 72 places in 112 ms
[2020-05-22 08:30:32] [INFO ] Deduced a trap composed of 79 places in 80 ms
[2020-05-22 08:30:32] [INFO ] Deduced a trap composed of 76 places in 79 ms
[2020-05-22 08:30:32] [INFO ] Deduced a trap composed of 80 places in 123 ms
[2020-05-22 08:30:32] [INFO ] Deduced a trap composed of 68 places in 102 ms
[2020-05-22 08:30:32] [INFO ] Deduced a trap composed of 78 places in 89 ms
[2020-05-22 08:30:32] [INFO ] Deduced a trap composed of 78 places in 88 ms
[2020-05-22 08:30:33] [INFO ] Deduced a trap composed of 74 places in 88 ms
[2020-05-22 08:30:33] [INFO ] Deduced a trap composed of 70 places in 111 ms
[2020-05-22 08:30:33] [INFO ] Deduced a trap composed of 81 places in 109 ms
[2020-05-22 08:30:33] [INFO ] Deduced a trap composed of 73 places in 94 ms
[2020-05-22 08:30:33] [INFO ] Deduced a trap composed of 78 places in 83 ms
[2020-05-22 08:30:33] [INFO ] Deduced a trap composed of 75 places in 111 ms
[2020-05-22 08:30:33] [INFO ] Deduced a trap composed of 71 places in 114 ms
[2020-05-22 08:30:33] [INFO ] Deduced a trap composed of 82 places in 85 ms
[2020-05-22 08:30:33] [INFO ] Deduced a trap composed of 78 places in 83 ms
[2020-05-22 08:30:34] [INFO ] Deduced a trap composed of 72 places in 89 ms
[2020-05-22 08:30:34] [INFO ] Deduced a trap composed of 72 places in 88 ms
[2020-05-22 08:30:34] [INFO ] Deduced a trap composed of 65 places in 114 ms
[2020-05-22 08:30:34] [INFO ] Deduced a trap composed of 70 places in 106 ms
[2020-05-22 08:30:34] [INFO ] Deduced a trap composed of 70 places in 101 ms
[2020-05-22 08:30:34] [INFO ] Deduced a trap composed of 75 places in 122 ms
[2020-05-22 08:30:34] [INFO ] Deduced a trap composed of 74 places in 104 ms
[2020-05-22 08:30:34] [INFO ] Deduced a trap composed of 75 places in 103 ms
[2020-05-22 08:30:34] [INFO ] Deduced a trap composed of 80 places in 104 ms
[2020-05-22 08:30:35] [INFO ] Deduced a trap composed of 75 places in 105 ms
[2020-05-22 08:30:35] [INFO ] Deduced a trap composed of 90 places in 101 ms
[2020-05-22 08:30:35] [INFO ] Deduced a trap composed of 75 places in 110 ms
[2020-05-22 08:30:35] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 5807 ms
[2020-05-22 08:30:35] [INFO ] Computed and/alt/rep : 237/1513/237 causal constraints in 16 ms.
[2020-05-22 08:30:39] [INFO ] Added : 229 causal constraints over 46 iterations in 3727 ms. Result :sat
[2020-05-22 08:30:39] [INFO ] Deduced a trap composed of 18 places in 102 ms
[2020-05-22 08:30:39] [INFO ] Deduced a trap composed of 23 places in 79 ms
[2020-05-22 08:30:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 263 ms
Attempting to minimize the solution found.
Minimization took 20 ms.
[2020-05-22 08:30:39] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2020-05-22 08:30:39] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2020-05-22 08:30:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:30:39] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2020-05-22 08:30:39] [INFO ] [Real]Added 30 Read/Feed constraints in 6 ms returned sat
[2020-05-22 08:30:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:30:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2020-05-22 08:30:39] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2020-05-22 08:30:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:30:39] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2020-05-22 08:30:39] [INFO ] [Nat]Added 30 Read/Feed constraints in 11 ms returned sat
[2020-05-22 08:30:40] [INFO ] Deduced a trap composed of 60 places in 106 ms
[2020-05-22 08:30:40] [INFO ] Deduced a trap composed of 9 places in 116 ms
[2020-05-22 08:30:40] [INFO ] Deduced a trap composed of 25 places in 101 ms
[2020-05-22 08:30:40] [INFO ] Deduced a trap composed of 28 places in 92 ms
[2020-05-22 08:30:40] [INFO ] Deduced a trap composed of 23 places in 101 ms
[2020-05-22 08:30:40] [INFO ] Deduced a trap composed of 20 places in 90 ms
[2020-05-22 08:30:40] [INFO ] Deduced a trap composed of 61 places in 80 ms
[2020-05-22 08:30:40] [INFO ] Deduced a trap composed of 57 places in 73 ms
[2020-05-22 08:30:40] [INFO ] Deduced a trap composed of 70 places in 74 ms
[2020-05-22 08:30:40] [INFO ] Deduced a trap composed of 71 places in 78 ms
[2020-05-22 08:30:40] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-05-22 08:30:41] [INFO ] Deduced a trap composed of 66 places in 75 ms
[2020-05-22 08:30:41] [INFO ] Deduced a trap composed of 62 places in 71 ms
[2020-05-22 08:30:41] [INFO ] Deduced a trap composed of 63 places in 69 ms
[2020-05-22 08:30:41] [INFO ] Deduced a trap composed of 27 places in 72 ms
[2020-05-22 08:30:41] [INFO ] Deduced a trap composed of 80 places in 72 ms
[2020-05-22 08:30:41] [INFO ] Deduced a trap composed of 27 places in 81 ms
[2020-05-22 08:30:41] [INFO ] Deduced a trap composed of 71 places in 75 ms
[2020-05-22 08:30:41] [INFO ] Deduced a trap composed of 79 places in 72 ms
[2020-05-22 08:30:41] [INFO ] Deduced a trap composed of 78 places in 70 ms
[2020-05-22 08:30:41] [INFO ] Deduced a trap composed of 72 places in 72 ms
[2020-05-22 08:30:41] [INFO ] Deduced a trap composed of 74 places in 77 ms
[2020-05-22 08:30:41] [INFO ] Deduced a trap composed of 70 places in 70 ms
[2020-05-22 08:30:42] [INFO ] Deduced a trap composed of 72 places in 70 ms
[2020-05-22 08:30:42] [INFO ] Deduced a trap composed of 73 places in 93 ms
[2020-05-22 08:30:42] [INFO ] Deduced a trap composed of 68 places in 70 ms
[2020-05-22 08:30:42] [INFO ] Deduced a trap composed of 57 places in 70 ms
[2020-05-22 08:30:42] [INFO ] Deduced a trap composed of 63 places in 69 ms
[2020-05-22 08:30:42] [INFO ] Deduced a trap composed of 84 places in 70 ms
[2020-05-22 08:30:42] [INFO ] Deduced a trap composed of 81 places in 70 ms
[2020-05-22 08:30:42] [INFO ] Deduced a trap composed of 78 places in 71 ms
[2020-05-22 08:30:42] [INFO ] Deduced a trap composed of 59 places in 70 ms
[2020-05-22 08:30:42] [INFO ] Deduced a trap composed of 80 places in 77 ms
[2020-05-22 08:30:42] [INFO ] Deduced a trap composed of 62 places in 73 ms
[2020-05-22 08:30:42] [INFO ] Deduced a trap composed of 91 places in 69 ms
[2020-05-22 08:30:43] [INFO ] Deduced a trap composed of 72 places in 69 ms
[2020-05-22 08:30:43] [INFO ] Deduced a trap composed of 70 places in 69 ms
[2020-05-22 08:30:43] [INFO ] Deduced a trap composed of 67 places in 70 ms
[2020-05-22 08:30:43] [INFO ] Deduced a trap composed of 86 places in 80 ms
[2020-05-22 08:30:43] [INFO ] Deduced a trap composed of 26 places in 96 ms
[2020-05-22 08:30:43] [INFO ] Deduced a trap composed of 89 places in 101 ms
[2020-05-22 08:30:43] [INFO ] Deduced a trap composed of 75 places in 125 ms
[2020-05-22 08:30:43] [INFO ] Deduced a trap composed of 75 places in 71 ms
[2020-05-22 08:30:43] [INFO ] Deduced a trap composed of 86 places in 97 ms
[2020-05-22 08:30:43] [INFO ] Deduced a trap composed of 85 places in 69 ms
[2020-05-22 08:30:44] [INFO ] Deduced a trap composed of 62 places in 83 ms
[2020-05-22 08:30:44] [INFO ] Deduced a trap composed of 77 places in 80 ms
[2020-05-22 08:30:44] [INFO ] Deduced a trap composed of 76 places in 81 ms
[2020-05-22 08:30:44] [INFO ] Deduced a trap composed of 81 places in 81 ms
[2020-05-22 08:30:44] [INFO ] Deduced a trap composed of 51 places in 109 ms
[2020-05-22 08:30:44] [INFO ] Deduced a trap composed of 56 places in 115 ms
[2020-05-22 08:30:44] [INFO ] Deduced a trap composed of 69 places in 101 ms
[2020-05-22 08:30:44] [INFO ] Deduced a trap composed of 72 places in 88 ms
[2020-05-22 08:30:44] [INFO ] Deduced a trap composed of 56 places in 81 ms
[2020-05-22 08:30:45] [INFO ] Deduced a trap composed of 73 places in 81 ms
[2020-05-22 08:30:45] [INFO ] Deduced a trap composed of 76 places in 100 ms
[2020-05-22 08:30:45] [INFO ] Deduced a trap composed of 56 places in 69 ms
[2020-05-22 08:30:45] [INFO ] Deduced a trap composed of 82 places in 91 ms
[2020-05-22 08:30:45] [INFO ] Deduced a trap composed of 79 places in 121 ms
[2020-05-22 08:30:45] [INFO ] Deduced a trap composed of 82 places in 99 ms
[2020-05-22 08:30:45] [INFO ] Deduced a trap composed of 74 places in 96 ms
[2020-05-22 08:30:45] [INFO ] Deduced a trap composed of 79 places in 124 ms
[2020-05-22 08:30:45] [INFO ] Deduced a trap composed of 72 places in 92 ms
[2020-05-22 08:30:46] [INFO ] Deduced a trap composed of 82 places in 113 ms
[2020-05-22 08:30:46] [INFO ] Deduced a trap composed of 56 places in 95 ms
[2020-05-22 08:30:46] [INFO ] Deduced a trap composed of 92 places in 89 ms
[2020-05-22 08:30:46] [INFO ] Deduced a trap composed of 75 places in 91 ms
[2020-05-22 08:30:46] [INFO ] Deduced a trap composed of 73 places in 89 ms
[2020-05-22 08:30:46] [INFO ] Deduced a trap composed of 81 places in 89 ms
[2020-05-22 08:30:46] [INFO ] Deduced a trap composed of 76 places in 89 ms
[2020-05-22 08:30:46] [INFO ] Deduced a trap composed of 82 places in 111 ms
[2020-05-22 08:30:46] [INFO ] Deduced a trap composed of 60 places in 119 ms
[2020-05-22 08:30:47] [INFO ] Deduced a trap composed of 62 places in 87 ms
[2020-05-22 08:30:47] [INFO ] Deduced a trap composed of 78 places in 89 ms
[2020-05-22 08:30:47] [INFO ] Deduced a trap composed of 85 places in 88 ms
[2020-05-22 08:30:47] [INFO ] Deduced a trap composed of 78 places in 90 ms
[2020-05-22 08:30:47] [INFO ] Deduced a trap composed of 54 places in 88 ms
[2020-05-22 08:30:47] [INFO ] Deduced a trap composed of 80 places in 89 ms
[2020-05-22 08:30:47] [INFO ] Deduced a trap composed of 82 places in 88 ms
[2020-05-22 08:30:47] [INFO ] Deduced a trap composed of 75 places in 99 ms
[2020-05-22 08:30:47] [INFO ] Deduced a trap composed of 78 places in 107 ms
[2020-05-22 08:30:48] [INFO ] Deduced a trap composed of 80 places in 99 ms
[2020-05-22 08:30:48] [INFO ] Deduced a trap composed of 81 places in 92 ms
[2020-05-22 08:30:48] [INFO ] Deduced a trap composed of 74 places in 79 ms
[2020-05-22 08:30:48] [INFO ] Deduced a trap composed of 82 places in 97 ms
[2020-05-22 08:30:48] [INFO ] Deduced a trap composed of 88 places in 110 ms
[2020-05-22 08:30:48] [INFO ] Deduced a trap composed of 77 places in 121 ms
[2020-05-22 08:30:48] [INFO ] Deduced a trap composed of 89 places in 132 ms
[2020-05-22 08:30:48] [INFO ] Deduced a trap composed of 92 places in 100 ms
[2020-05-22 08:30:48] [INFO ] Deduced a trap composed of 77 places in 115 ms
[2020-05-22 08:30:49] [INFO ] Deduced a trap composed of 77 places in 111 ms
[2020-05-22 08:30:49] [INFO ] Deduced a trap composed of 83 places in 116 ms
[2020-05-22 08:30:49] [INFO ] Deduced a trap composed of 77 places in 105 ms
[2020-05-22 08:30:49] [INFO ] Deduced a trap composed of 77 places in 118 ms
[2020-05-22 08:30:49] [INFO ] Deduced a trap composed of 79 places in 99 ms
[2020-05-22 08:30:49] [INFO ] Deduced a trap composed of 83 places in 106 ms
[2020-05-22 08:30:49] [INFO ] Deduced a trap composed of 82 places in 119 ms
[2020-05-22 08:30:50] [INFO ] Deduced a trap composed of 84 places in 107 ms
[2020-05-22 08:30:50] [INFO ] Deduced a trap composed of 81 places in 105 ms
[2020-05-22 08:30:50] [INFO ] Deduced a trap composed of 78 places in 95 ms
[2020-05-22 08:30:50] [INFO ] Deduced a trap composed of 80 places in 98 ms
[2020-05-22 08:30:50] [INFO ] Deduced a trap composed of 64 places in 112 ms
[2020-05-22 08:30:50] [INFO ] Deduced a trap composed of 77 places in 96 ms
[2020-05-22 08:30:50] [INFO ] Deduced a trap composed of 83 places in 95 ms
[2020-05-22 08:30:50] [INFO ] Deduced a trap composed of 88 places in 94 ms
[2020-05-22 08:30:50] [INFO ] Deduced a trap composed of 82 places in 91 ms
[2020-05-22 08:30:51] [INFO ] Deduced a trap composed of 73 places in 123 ms
[2020-05-22 08:30:51] [INFO ] Deduced a trap composed of 75 places in 91 ms
[2020-05-22 08:30:51] [INFO ] Deduced a trap composed of 84 places in 94 ms
[2020-05-22 08:30:51] [INFO ] Deduced a trap composed of 83 places in 88 ms
[2020-05-22 08:30:51] [INFO ] Deduced a trap composed of 87 places in 84 ms
[2020-05-22 08:30:51] [INFO ] Deduced a trap composed of 67 places in 85 ms
[2020-05-22 08:30:51] [INFO ] Deduced a trap composed of 18 places in 60 ms
[2020-05-22 08:30:51] [INFO ] Trap strengthening (SAT) tested/added 114/113 trap constraints in 11761 ms
[2020-05-22 08:30:51] [INFO ] Computed and/alt/rep : 237/1513/237 causal constraints in 12 ms.
[2020-05-22 08:30:56] [INFO ] Added : 226 causal constraints over 46 iterations in 4887 ms. Result :sat
[2020-05-22 08:30:56] [INFO ] Deduced a trap composed of 14 places in 105 ms
[2020-05-22 08:30:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
Attempting to minimize the solution found.
Minimization took 27 ms.
[2020-05-22 08:30:56] [INFO ] [Real]Absence check using 13 positive place invariants in 20 ms returned sat
[2020-05-22 08:30:56] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2020-05-22 08:30:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:30:57] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2020-05-22 08:30:57] [INFO ] [Real]Added 30 Read/Feed constraints in 12 ms returned sat
[2020-05-22 08:30:57] [INFO ] Deduced a trap composed of 18 places in 101 ms
[2020-05-22 08:30:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2020-05-22 08:30:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:30:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 20 ms returned sat
[2020-05-22 08:30:57] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2020-05-22 08:30:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:30:57] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2020-05-22 08:30:57] [INFO ] [Nat]Added 30 Read/Feed constraints in 12 ms returned sat
[2020-05-22 08:30:57] [INFO ] Deduced a trap composed of 15 places in 82 ms
[2020-05-22 08:30:57] [INFO ] Deduced a trap composed of 27 places in 45 ms
[2020-05-22 08:30:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 164 ms
[2020-05-22 08:30:57] [INFO ] Computed and/alt/rep : 237/1513/237 causal constraints in 17 ms.
[2020-05-22 08:31:01] [INFO ] Added : 236 causal constraints over 48 iterations in 3652 ms. Result :sat
[2020-05-22 08:31:01] [INFO ] Deduced a trap composed of 23 places in 59 ms
[2020-05-22 08:31:01] [INFO ] Deduced a trap composed of 34 places in 40 ms
[2020-05-22 08:31:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 277 ms
Attempting to minimize the solution found.
Minimization took 29 ms.
[2020-05-22 08:31:01] [INFO ] [Real]Absence check using 13 positive place invariants in 21 ms returned sat
[2020-05-22 08:31:01] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2020-05-22 08:31:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:31:02] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2020-05-22 08:31:02] [INFO ] [Real]Added 30 Read/Feed constraints in 6 ms returned sat
[2020-05-22 08:31:02] [INFO ] Deduced a trap composed of 30 places in 46 ms
[2020-05-22 08:31:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2020-05-22 08:31:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:31:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 25 ms returned sat
[2020-05-22 08:31:02] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2020-05-22 08:31:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:31:02] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2020-05-22 08:31:02] [INFO ] [Nat]Added 30 Read/Feed constraints in 13 ms returned sat
[2020-05-22 08:31:02] [INFO ] Deduced a trap composed of 72 places in 123 ms
[2020-05-22 08:31:02] [INFO ] Deduced a trap composed of 30 places in 96 ms
[2020-05-22 08:31:02] [INFO ] Deduced a trap composed of 34 places in 102 ms
[2020-05-22 08:31:02] [INFO ] Deduced a trap composed of 70 places in 106 ms
[2020-05-22 08:31:03] [INFO ] Deduced a trap composed of 64 places in 110 ms
[2020-05-22 08:31:03] [INFO ] Deduced a trap composed of 65 places in 112 ms
[2020-05-22 08:31:03] [INFO ] Deduced a trap composed of 37 places in 102 ms
[2020-05-22 08:31:03] [INFO ] Deduced a trap composed of 77 places in 119 ms
[2020-05-22 08:31:03] [INFO ] Deduced a trap composed of 68 places in 91 ms
[2020-05-22 08:31:03] [INFO ] Deduced a trap composed of 70 places in 111 ms
[2020-05-22 08:31:03] [INFO ] Deduced a trap composed of 82 places in 120 ms
[2020-05-22 08:31:03] [INFO ] Deduced a trap composed of 84 places in 114 ms
[2020-05-22 08:31:04] [INFO ] Deduced a trap composed of 81 places in 103 ms
[2020-05-22 08:31:04] [INFO ] Deduced a trap composed of 89 places in 129 ms
[2020-05-22 08:31:04] [INFO ] Deduced a trap composed of 81 places in 99 ms
[2020-05-22 08:31:04] [INFO ] Deduced a trap composed of 75 places in 107 ms
[2020-05-22 08:31:04] [INFO ] Deduced a trap composed of 77 places in 111 ms
[2020-05-22 08:31:04] [INFO ] Deduced a trap composed of 70 places in 98 ms
[2020-05-22 08:31:04] [INFO ] Deduced a trap composed of 62 places in 117 ms
[2020-05-22 08:31:04] [INFO ] Deduced a trap composed of 78 places in 126 ms
[2020-05-22 08:31:05] [INFO ] Deduced a trap composed of 70 places in 135 ms
[2020-05-22 08:31:05] [INFO ] Deduced a trap composed of 69 places in 100 ms
[2020-05-22 08:31:05] [INFO ] Deduced a trap composed of 68 places in 96 ms
[2020-05-22 08:31:05] [INFO ] Deduced a trap composed of 55 places in 110 ms
[2020-05-22 08:31:05] [INFO ] Deduced a trap composed of 67 places in 107 ms
[2020-05-22 08:31:05] [INFO ] Deduced a trap composed of 69 places in 93 ms
[2020-05-22 08:31:05] [INFO ] Deduced a trap composed of 69 places in 88 ms
[2020-05-22 08:31:05] [INFO ] Deduced a trap composed of 84 places in 93 ms
[2020-05-22 08:31:05] [INFO ] Deduced a trap composed of 71 places in 121 ms
[2020-05-22 08:31:06] [INFO ] Deduced a trap composed of 82 places in 93 ms
[2020-05-22 08:31:06] [INFO ] Deduced a trap composed of 37 places in 91 ms
[2020-05-22 08:31:06] [INFO ] Deduced a trap composed of 76 places in 88 ms
[2020-05-22 08:31:06] [INFO ] Deduced a trap composed of 89 places in 120 ms
[2020-05-22 08:31:06] [INFO ] Deduced a trap composed of 72 places in 117 ms
[2020-05-22 08:31:06] [INFO ] Deduced a trap composed of 75 places in 114 ms
[2020-05-22 08:31:06] [INFO ] Deduced a trap composed of 80 places in 120 ms
[2020-05-22 08:31:06] [INFO ] Deduced a trap composed of 81 places in 112 ms
[2020-05-22 08:31:07] [INFO ] Deduced a trap composed of 78 places in 131 ms
[2020-05-22 08:31:07] [INFO ] Deduced a trap composed of 91 places in 94 ms
[2020-05-22 08:31:07] [INFO ] Deduced a trap composed of 85 places in 95 ms
[2020-05-22 08:31:07] [INFO ] Deduced a trap composed of 77 places in 94 ms
[2020-05-22 08:31:07] [INFO ] Deduced a trap composed of 91 places in 94 ms
[2020-05-22 08:31:07] [INFO ] Deduced a trap composed of 88 places in 89 ms
[2020-05-22 08:31:07] [INFO ] Deduced a trap composed of 95 places in 105 ms
[2020-05-22 08:31:07] [INFO ] Deduced a trap composed of 58 places in 92 ms
[2020-05-22 08:31:07] [INFO ] Deduced a trap composed of 76 places in 95 ms
[2020-05-22 08:31:08] [INFO ] Deduced a trap composed of 75 places in 94 ms
[2020-05-22 08:31:08] [INFO ] Deduced a trap composed of 78 places in 95 ms
[2020-05-22 08:31:08] [INFO ] Deduced a trap composed of 75 places in 92 ms
[2020-05-22 08:31:08] [INFO ] Deduced a trap composed of 75 places in 93 ms
[2020-05-22 08:31:08] [INFO ] Deduced a trap composed of 87 places in 80 ms
[2020-05-22 08:31:08] [INFO ] Deduced a trap composed of 85 places in 67 ms
[2020-05-22 08:31:08] [INFO ] Deduced a trap composed of 78 places in 65 ms
[2020-05-22 08:31:08] [INFO ] Deduced a trap composed of 82 places in 91 ms
[2020-05-22 08:31:08] [INFO ] Deduced a trap composed of 85 places in 89 ms
[2020-05-22 08:31:08] [INFO ] Deduced a trap composed of 82 places in 112 ms
[2020-05-22 08:31:09] [INFO ] Deduced a trap composed of 86 places in 114 ms
[2020-05-22 08:31:09] [INFO ] Deduced a trap composed of 82 places in 81 ms
[2020-05-22 08:31:09] [INFO ] Deduced a trap composed of 83 places in 80 ms
[2020-05-22 08:31:09] [INFO ] Deduced a trap composed of 77 places in 79 ms
[2020-05-22 08:31:09] [INFO ] Deduced a trap composed of 75 places in 94 ms
[2020-05-22 08:31:09] [INFO ] Deduced a trap composed of 85 places in 129 ms
[2020-05-22 08:31:09] [INFO ] Deduced a trap composed of 60 places in 101 ms
[2020-05-22 08:31:09] [INFO ] Deduced a trap composed of 77 places in 96 ms
[2020-05-22 08:31:09] [INFO ] Deduced a trap composed of 84 places in 96 ms
[2020-05-22 08:31:10] [INFO ] Deduced a trap composed of 86 places in 124 ms
[2020-05-22 08:31:10] [INFO ] Deduced a trap composed of 85 places in 97 ms
[2020-05-22 08:31:10] [INFO ] Deduced a trap composed of 94 places in 125 ms
[2020-05-22 08:31:10] [INFO ] Deduced a trap composed of 75 places in 104 ms
[2020-05-22 08:31:10] [INFO ] Deduced a trap composed of 85 places in 91 ms
[2020-05-22 08:31:10] [INFO ] Deduced a trap composed of 82 places in 91 ms
[2020-05-22 08:31:10] [INFO ] Deduced a trap composed of 80 places in 93 ms
[2020-05-22 08:31:10] [INFO ] Deduced a trap composed of 82 places in 98 ms
[2020-05-22 08:31:10] [INFO ] Deduced a trap composed of 64 places in 86 ms
[2020-05-22 08:31:10] [INFO ] Trap strengthening (SAT) tested/added 75/74 trap constraints in 8536 ms
[2020-05-22 08:31:11] [INFO ] Computed and/alt/rep : 237/1513/237 causal constraints in 17 ms.
[2020-05-22 08:31:15] [INFO ] Added : 237 causal constraints over 48 iterations in 4121 ms. Result :sat
[2020-05-22 08:31:15] [INFO ] Deduced a trap composed of 19 places in 91 ms
[2020-05-22 08:31:15] [INFO ] Deduced a trap composed of 27 places in 60 ms
[2020-05-22 08:31:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 280 ms
Attempting to minimize the solution found.
Minimization took 34 ms.
Incomplete Parikh walk after 7346700 steps, including 920754 resets, run finished after 12528 ms. (steps per millisecond=586 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 2277700 steps, including 285367 resets, run finished after 3416 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 174500 steps, including 21899 resets, run finished after 369 ms. (steps per millisecond=472 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 232500 steps, including 29205 resets, run finished after 436 ms. (steps per millisecond=533 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 158500 steps, including 19839 resets, run finished after 212 ms. (steps per millisecond=747 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 2285900 steps, including 286773 resets, run finished after 3376 ms. (steps per millisecond=677 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1498300 steps, including 187647 resets, run finished after 2072 ms. (steps per millisecond=723 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 24 out of 233 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 233/233 places, 238/238 transitions.
Applied a total of 0 rules in 7 ms. Remains 233 /233 variables (removed 0) and now considering 238/238 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 233/233 places, 238/238 transitions.
Starting structural reductions, iteration 0 : 233/233 places, 238/238 transitions.
Applied a total of 0 rules in 5 ms. Remains 233 /233 variables (removed 0) and now considering 238/238 (removed 0) transitions.
// Phase 1: matrix 238 rows 233 cols
[2020-05-22 08:31:37] [INFO ] Computed 31 place invariants in 7 ms
[2020-05-22 08:31:38] [INFO ] Implicit Places using invariants in 309 ms returned []
// Phase 1: matrix 238 rows 233 cols
[2020-05-22 08:31:38] [INFO ] Computed 31 place invariants in 8 ms
[2020-05-22 08:31:38] [INFO ] State equation strengthened by 30 read => feed constraints.
[2020-05-22 08:31:39] [INFO ] Implicit Places using invariants and state equation in 1412 ms returned []
Implicit Place search using SMT with State Equation took 1722 ms to find 0 implicit places.
[2020-05-22 08:31:39] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 238 rows 233 cols
[2020-05-22 08:31:39] [INFO ] Computed 31 place invariants in 8 ms
[2020-05-22 08:31:39] [INFO ] Dead Transitions using invariants and state equation in 292 ms returned []
Finished structural reductions, in 1 iterations. Remains : 233/233 places, 238/238 transitions.
Incomplete random walk after 100000 steps, including 11269 resets, run finished after 134 ms. (steps per millisecond=746 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 238 rows 233 cols
[2020-05-22 08:31:40] [INFO ] Computed 31 place invariants in 8 ms
[2020-05-22 08:31:40] [INFO ] [Real]Absence check using 13 positive place invariants in 28 ms returned sat
[2020-05-22 08:31:40] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2020-05-22 08:31:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:31:40] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2020-05-22 08:31:40] [INFO ] State equation strengthened by 30 read => feed constraints.
[2020-05-22 08:31:40] [INFO ] [Real]Added 30 Read/Feed constraints in 5 ms returned sat
[2020-05-22 08:31:40] [INFO ] Deduced a trap composed of 4 places in 127 ms
[2020-05-22 08:31:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2020-05-22 08:31:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:31:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 31 ms returned sat
[2020-05-22 08:31:40] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 12 ms returned sat
[2020-05-22 08:31:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:31:40] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2020-05-22 08:31:40] [INFO ] [Nat]Added 30 Read/Feed constraints in 11 ms returned sat
[2020-05-22 08:31:40] [INFO ] Deduced a trap composed of 17 places in 79 ms
[2020-05-22 08:31:40] [INFO ] Deduced a trap composed of 27 places in 59 ms
[2020-05-22 08:31:41] [INFO ] Deduced a trap composed of 27 places in 53 ms
[2020-05-22 08:31:41] [INFO ] Deduced a trap composed of 37 places in 28 ms
[2020-05-22 08:31:41] [INFO ] Deduced a trap composed of 34 places in 33 ms
[2020-05-22 08:31:41] [INFO ] Deduced a trap composed of 37 places in 41 ms
[2020-05-22 08:31:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 423 ms
[2020-05-22 08:31:41] [INFO ] Computed and/alt/rep : 237/1513/237 causal constraints in 16 ms.
[2020-05-22 08:31:44] [INFO ] Added : 235 causal constraints over 47 iterations in 3704 ms. Result :sat
[2020-05-22 08:31:45] [INFO ] Deduced a trap composed of 8 places in 114 ms
[2020-05-22 08:31:45] [INFO ] Deduced a trap composed of 12 places in 101 ms
[2020-05-22 08:31:45] [INFO ] Deduced a trap composed of 16 places in 105 ms
[2020-05-22 08:31:45] [INFO ] Deduced a trap composed of 20 places in 100 ms
[2020-05-22 08:31:45] [INFO ] Deduced a trap composed of 21 places in 109 ms
[2020-05-22 08:31:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 773 ms
[2020-05-22 08:31:45] [INFO ] [Real]Absence check using 13 positive place invariants in 21 ms returned sat
[2020-05-22 08:31:45] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2020-05-22 08:31:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:31:45] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2020-05-22 08:31:45] [INFO ] [Real]Added 30 Read/Feed constraints in 5 ms returned sat
[2020-05-22 08:31:46] [INFO ] Deduced a trap composed of 18 places in 100 ms
[2020-05-22 08:31:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2020-05-22 08:31:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:31:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 20 ms returned sat
[2020-05-22 08:31:46] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2020-05-22 08:31:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:31:46] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2020-05-22 08:31:46] [INFO ] [Nat]Added 30 Read/Feed constraints in 56 ms returned sat
[2020-05-22 08:31:46] [INFO ] Deduced a trap composed of 83 places in 113 ms
[2020-05-22 08:31:46] [INFO ] Deduced a trap composed of 84 places in 101 ms
[2020-05-22 08:31:46] [INFO ] Deduced a trap composed of 80 places in 111 ms
[2020-05-22 08:31:46] [INFO ] Deduced a trap composed of 18 places in 128 ms
[2020-05-22 08:31:47] [INFO ] Deduced a trap composed of 77 places in 112 ms
[2020-05-22 08:31:47] [INFO ] Deduced a trap composed of 76 places in 105 ms
[2020-05-22 08:31:47] [INFO ] Deduced a trap composed of 63 places in 102 ms
[2020-05-22 08:31:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 884 ms
[2020-05-22 08:31:47] [INFO ] Computed and/alt/rep : 237/1513/237 causal constraints in 17 ms.
[2020-05-22 08:31:51] [INFO ] Added : 234 causal constraints over 47 iterations in 3913 ms. Result :sat
[2020-05-22 08:31:51] [INFO ] Deduced a trap composed of 84 places in 135 ms
[2020-05-22 08:31:51] [INFO ] Deduced a trap composed of 84 places in 97 ms
[2020-05-22 08:31:51] [INFO ] Deduced a trap composed of 23 places in 95 ms
[2020-05-22 08:31:51] [INFO ] Deduced a trap composed of 85 places in 93 ms
[2020-05-22 08:31:52] [INFO ] Deduced a trap composed of 20 places in 130 ms
[2020-05-22 08:31:52] [INFO ] Deduced a trap composed of 28 places in 149 ms
[2020-05-22 08:31:52] [INFO ] Deduced a trap composed of 84 places in 139 ms
[2020-05-22 08:31:52] [INFO ] Deduced a trap composed of 87 places in 136 ms
[2020-05-22 08:31:52] [INFO ] Deduced a trap composed of 74 places in 173 ms
[2020-05-22 08:31:53] [INFO ] Deduced a trap composed of 80 places in 134 ms
[2020-05-22 08:31:53] [INFO ] Deduced a trap composed of 91 places in 143 ms
[2020-05-22 08:31:53] [INFO ] Deduced a trap composed of 87 places in 98 ms
[2020-05-22 08:31:53] [INFO ] Deduced a trap composed of 19 places in 108 ms
[2020-05-22 08:31:53] [INFO ] Deduced a trap composed of 75 places in 149 ms
[2020-05-22 08:31:54] [INFO ] Deduced a trap composed of 97 places in 123 ms
[2020-05-22 08:31:54] [INFO ] Deduced a trap composed of 89 places in 149 ms
[2020-05-22 08:31:54] [INFO ] Deduced a trap composed of 90 places in 100 ms
[2020-05-22 08:31:54] [INFO ] Deduced a trap composed of 80 places in 106 ms
[2020-05-22 08:31:54] [INFO ] Deduced a trap composed of 94 places in 94 ms
[2020-05-22 08:31:54] [INFO ] Deduced a trap composed of 90 places in 97 ms
[2020-05-22 08:31:55] [INFO ] Deduced a trap composed of 92 places in 114 ms
[2020-05-22 08:31:55] [INFO ] Deduced a trap composed of 90 places in 104 ms
[2020-05-22 08:31:55] [INFO ] Deduced a trap composed of 89 places in 139 ms
[2020-05-22 08:31:55] [INFO ] Deduced a trap composed of 93 places in 97 ms
[2020-05-22 08:31:55] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4274 ms
[2020-05-22 08:31:55] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2020-05-22 08:31:55] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 4 ms returned sat
[2020-05-22 08:31:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:31:55] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2020-05-22 08:31:55] [INFO ] [Real]Added 30 Read/Feed constraints in 14 ms returned sat
[2020-05-22 08:31:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:31:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 31 ms returned sat
[2020-05-22 08:31:55] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2020-05-22 08:31:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:31:56] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2020-05-22 08:31:56] [INFO ] [Nat]Added 30 Read/Feed constraints in 48 ms returned sat
[2020-05-22 08:31:56] [INFO ] Deduced a trap composed of 75 places in 157 ms
[2020-05-22 08:31:56] [INFO ] Deduced a trap composed of 76 places in 157 ms
[2020-05-22 08:31:56] [INFO ] Deduced a trap composed of 14 places in 65 ms
[2020-05-22 08:31:56] [INFO ] Deduced a trap composed of 27 places in 57 ms
[2020-05-22 08:31:56] [INFO ] Deduced a trap composed of 89 places in 106 ms
[2020-05-22 08:31:57] [INFO ] Deduced a trap composed of 93 places in 120 ms
[2020-05-22 08:31:57] [INFO ] Deduced a trap composed of 71 places in 95 ms
[2020-05-22 08:31:57] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 889 ms
[2020-05-22 08:31:57] [INFO ] Computed and/alt/rep : 237/1513/237 causal constraints in 22 ms.
[2020-05-22 08:31:59] [INFO ] Added : 220 causal constraints over 44 iterations in 2803 ms. Result :sat
[2020-05-22 08:32:00] [INFO ] Deduced a trap composed of 75 places in 150 ms
[2020-05-22 08:32:00] [INFO ] Deduced a trap composed of 75 places in 125 ms
[2020-05-22 08:32:00] [INFO ] Deduced a trap composed of 12 places in 118 ms
[2020-05-22 08:32:00] [INFO ] Deduced a trap composed of 73 places in 130 ms
[2020-05-22 08:32:00] [INFO ] Deduced a trap composed of 63 places in 117 ms
[2020-05-22 08:32:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 817 ms
[2020-05-22 08:32:00] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2020-05-22 08:32:00] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 12 ms returned sat
[2020-05-22 08:32:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:32:01] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2020-05-22 08:32:01] [INFO ] [Real]Added 30 Read/Feed constraints in 5 ms returned sat
[2020-05-22 08:32:01] [INFO ] Computed and/alt/rep : 237/1513/237 causal constraints in 15 ms.
[2020-05-22 08:32:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:32:01] [INFO ] [Nat]Absence check using 13 positive place invariants in 27 ms returned sat
[2020-05-22 08:32:01] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2020-05-22 08:32:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:32:01] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2020-05-22 08:32:01] [INFO ] [Nat]Added 30 Read/Feed constraints in 26 ms returned sat
[2020-05-22 08:32:01] [INFO ] Deduced a trap composed of 69 places in 105 ms
[2020-05-22 08:32:01] [INFO ] Deduced a trap composed of 64 places in 104 ms
[2020-05-22 08:32:01] [INFO ] Deduced a trap composed of 69 places in 77 ms
[2020-05-22 08:32:01] [INFO ] Deduced a trap composed of 69 places in 107 ms
[2020-05-22 08:32:02] [INFO ] Deduced a trap composed of 68 places in 128 ms
[2020-05-22 08:32:02] [INFO ] Deduced a trap composed of 68 places in 102 ms
[2020-05-22 08:32:02] [INFO ] Deduced a trap composed of 63 places in 109 ms
[2020-05-22 08:32:02] [INFO ] Deduced a trap composed of 69 places in 109 ms
[2020-05-22 08:32:02] [INFO ] Deduced a trap composed of 71 places in 100 ms
[2020-05-22 08:32:02] [INFO ] Deduced a trap composed of 27 places in 111 ms
[2020-05-22 08:32:02] [INFO ] Deduced a trap composed of 20 places in 99 ms
[2020-05-22 08:32:02] [INFO ] Deduced a trap composed of 72 places in 82 ms
[2020-05-22 08:32:03] [INFO ] Deduced a trap composed of 86 places in 83 ms
[2020-05-22 08:32:03] [INFO ] Deduced a trap composed of 81 places in 81 ms
[2020-05-22 08:32:03] [INFO ] Deduced a trap composed of 82 places in 85 ms
[2020-05-22 08:32:03] [INFO ] Deduced a trap composed of 81 places in 92 ms
[2020-05-22 08:32:03] [INFO ] Deduced a trap composed of 76 places in 79 ms
[2020-05-22 08:32:03] [INFO ] Deduced a trap composed of 75 places in 80 ms
[2020-05-22 08:32:03] [INFO ] Deduced a trap composed of 77 places in 80 ms
[2020-05-22 08:32:03] [INFO ] Deduced a trap composed of 72 places in 84 ms
[2020-05-22 08:32:03] [INFO ] Deduced a trap composed of 72 places in 79 ms
[2020-05-22 08:32:03] [INFO ] Deduced a trap composed of 73 places in 95 ms
[2020-05-22 08:32:03] [INFO ] Deduced a trap composed of 72 places in 77 ms
[2020-05-22 08:32:04] [INFO ] Deduced a trap composed of 79 places in 86 ms
[2020-05-22 08:32:04] [INFO ] Deduced a trap composed of 76 places in 81 ms
[2020-05-22 08:32:04] [INFO ] Deduced a trap composed of 80 places in 81 ms
[2020-05-22 08:32:04] [INFO ] Deduced a trap composed of 68 places in 78 ms
[2020-05-22 08:32:04] [INFO ] Deduced a trap composed of 78 places in 108 ms
[2020-05-22 08:32:04] [INFO ] Deduced a trap composed of 78 places in 80 ms
[2020-05-22 08:32:04] [INFO ] Deduced a trap composed of 74 places in 93 ms
[2020-05-22 08:32:04] [INFO ] Deduced a trap composed of 70 places in 79 ms
[2020-05-22 08:32:04] [INFO ] Deduced a trap composed of 81 places in 99 ms
[2020-05-22 08:32:04] [INFO ] Deduced a trap composed of 73 places in 80 ms
[2020-05-22 08:32:05] [INFO ] Deduced a trap composed of 78 places in 92 ms
[2020-05-22 08:32:05] [INFO ] Deduced a trap composed of 75 places in 80 ms
[2020-05-22 08:32:05] [INFO ] Deduced a trap composed of 71 places in 79 ms
[2020-05-22 08:32:05] [INFO ] Deduced a trap composed of 82 places in 84 ms
[2020-05-22 08:32:05] [INFO ] Deduced a trap composed of 78 places in 80 ms
[2020-05-22 08:32:05] [INFO ] Deduced a trap composed of 72 places in 80 ms
[2020-05-22 08:32:05] [INFO ] Deduced a trap composed of 72 places in 82 ms
[2020-05-22 08:32:05] [INFO ] Deduced a trap composed of 65 places in 94 ms
[2020-05-22 08:32:05] [INFO ] Deduced a trap composed of 70 places in 79 ms
[2020-05-22 08:32:05] [INFO ] Deduced a trap composed of 70 places in 79 ms
[2020-05-22 08:32:06] [INFO ] Deduced a trap composed of 75 places in 97 ms
[2020-05-22 08:32:06] [INFO ] Deduced a trap composed of 74 places in 81 ms
[2020-05-22 08:32:06] [INFO ] Deduced a trap composed of 75 places in 88 ms
[2020-05-22 08:32:06] [INFO ] Deduced a trap composed of 80 places in 83 ms
[2020-05-22 08:32:06] [INFO ] Deduced a trap composed of 75 places in 75 ms
[2020-05-22 08:32:06] [INFO ] Deduced a trap composed of 90 places in 99 ms
[2020-05-22 08:32:06] [INFO ] Deduced a trap composed of 75 places in 82 ms
[2020-05-22 08:32:06] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 5166 ms
[2020-05-22 08:32:06] [INFO ] Computed and/alt/rep : 237/1513/237 causal constraints in 16 ms.
[2020-05-22 08:32:10] [INFO ] Added : 229 causal constraints over 46 iterations in 3555 ms. Result :sat
[2020-05-22 08:32:10] [INFO ] Deduced a trap composed of 18 places in 88 ms
[2020-05-22 08:32:10] [INFO ] Deduced a trap composed of 23 places in 75 ms
[2020-05-22 08:32:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 266 ms
[2020-05-22 08:32:10] [INFO ] [Real]Absence check using 13 positive place invariants in 22 ms returned sat
[2020-05-22 08:32:10] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 13 ms returned sat
[2020-05-22 08:32:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:32:10] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2020-05-22 08:32:10] [INFO ] [Real]Added 30 Read/Feed constraints in 16 ms returned sat
[2020-05-22 08:32:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:32:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 24 ms returned sat
[2020-05-22 08:32:10] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2020-05-22 08:32:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:32:11] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2020-05-22 08:32:11] [INFO ] [Nat]Added 30 Read/Feed constraints in 15 ms returned sat
[2020-05-22 08:32:11] [INFO ] Deduced a trap composed of 60 places in 145 ms
[2020-05-22 08:32:11] [INFO ] Deduced a trap composed of 9 places in 142 ms
[2020-05-22 08:32:11] [INFO ] Deduced a trap composed of 25 places in 114 ms
[2020-05-22 08:32:11] [INFO ] Deduced a trap composed of 28 places in 108 ms
[2020-05-22 08:32:11] [INFO ] Deduced a trap composed of 23 places in 127 ms
[2020-05-22 08:32:12] [INFO ] Deduced a trap composed of 20 places in 110 ms
[2020-05-22 08:32:12] [INFO ] Deduced a trap composed of 61 places in 97 ms
[2020-05-22 08:32:12] [INFO ] Deduced a trap composed of 57 places in 97 ms
[2020-05-22 08:32:12] [INFO ] Deduced a trap composed of 70 places in 95 ms
[2020-05-22 08:32:12] [INFO ] Deduced a trap composed of 71 places in 99 ms
[2020-05-22 08:32:12] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2020-05-22 08:32:12] [INFO ] Deduced a trap composed of 66 places in 73 ms
[2020-05-22 08:32:12] [INFO ] Deduced a trap composed of 62 places in 121 ms
[2020-05-22 08:32:12] [INFO ] Deduced a trap composed of 63 places in 125 ms
[2020-05-22 08:32:13] [INFO ] Deduced a trap composed of 27 places in 113 ms
[2020-05-22 08:32:13] [INFO ] Deduced a trap composed of 80 places in 96 ms
[2020-05-22 08:32:13] [INFO ] Deduced a trap composed of 27 places in 98 ms
[2020-05-22 08:32:13] [INFO ] Deduced a trap composed of 71 places in 128 ms
[2020-05-22 08:32:13] [INFO ] Deduced a trap composed of 79 places in 96 ms
[2020-05-22 08:32:13] [INFO ] Deduced a trap composed of 78 places in 117 ms
[2020-05-22 08:32:13] [INFO ] Deduced a trap composed of 72 places in 130 ms
[2020-05-22 08:32:13] [INFO ] Deduced a trap composed of 74 places in 109 ms
[2020-05-22 08:32:14] [INFO ] Deduced a trap composed of 70 places in 94 ms
[2020-05-22 08:32:14] [INFO ] Deduced a trap composed of 72 places in 128 ms
[2020-05-22 08:32:14] [INFO ] Deduced a trap composed of 73 places in 98 ms
[2020-05-22 08:32:14] [INFO ] Deduced a trap composed of 68 places in 120 ms
[2020-05-22 08:32:14] [INFO ] Deduced a trap composed of 57 places in 115 ms
[2020-05-22 08:32:14] [INFO ] Deduced a trap composed of 63 places in 129 ms
[2020-05-22 08:32:14] [INFO ] Deduced a trap composed of 84 places in 115 ms
[2020-05-22 08:32:14] [INFO ] Deduced a trap composed of 81 places in 115 ms
[2020-05-22 08:32:15] [INFO ] Deduced a trap composed of 78 places in 118 ms
[2020-05-22 08:32:15] [INFO ] Deduced a trap composed of 59 places in 95 ms
[2020-05-22 08:32:15] [INFO ] Deduced a trap composed of 80 places in 95 ms
[2020-05-22 08:32:15] [INFO ] Deduced a trap composed of 62 places in 91 ms
[2020-05-22 08:32:15] [INFO ] Deduced a trap composed of 91 places in 96 ms
[2020-05-22 08:32:15] [INFO ] Deduced a trap composed of 72 places in 80 ms
[2020-05-22 08:32:15] [INFO ] Deduced a trap composed of 70 places in 75 ms
[2020-05-22 08:32:15] [INFO ] Deduced a trap composed of 67 places in 76 ms
[2020-05-22 08:32:15] [INFO ] Deduced a trap composed of 86 places in 77 ms
[2020-05-22 08:32:16] [INFO ] Deduced a trap composed of 26 places in 97 ms
[2020-05-22 08:32:16] [INFO ] Deduced a trap composed of 89 places in 97 ms
[2020-05-22 08:32:16] [INFO ] Deduced a trap composed of 75 places in 84 ms
[2020-05-22 08:32:16] [INFO ] Deduced a trap composed of 75 places in 77 ms
[2020-05-22 08:32:16] [INFO ] Deduced a trap composed of 86 places in 75 ms
[2020-05-22 08:32:16] [INFO ] Deduced a trap composed of 85 places in 116 ms
[2020-05-22 08:32:16] [INFO ] Deduced a trap composed of 62 places in 123 ms
[2020-05-22 08:32:16] [INFO ] Deduced a trap composed of 77 places in 89 ms
[2020-05-22 08:32:16] [INFO ] Deduced a trap composed of 76 places in 115 ms
[2020-05-22 08:32:17] [INFO ] Deduced a trap composed of 81 places in 93 ms
[2020-05-22 08:32:17] [INFO ] Deduced a trap composed of 51 places in 125 ms
[2020-05-22 08:32:17] [INFO ] Deduced a trap composed of 56 places in 125 ms
[2020-05-22 08:32:17] [INFO ] Deduced a trap composed of 69 places in 99 ms
[2020-05-22 08:32:17] [INFO ] Deduced a trap composed of 72 places in 100 ms
[2020-05-22 08:32:17] [INFO ] Deduced a trap composed of 56 places in 95 ms
[2020-05-22 08:32:17] [INFO ] Deduced a trap composed of 73 places in 115 ms
[2020-05-22 08:32:17] [INFO ] Deduced a trap composed of 76 places in 94 ms
[2020-05-22 08:32:17] [INFO ] Deduced a trap composed of 56 places in 118 ms
[2020-05-22 08:32:18] [INFO ] Deduced a trap composed of 82 places in 93 ms
[2020-05-22 08:32:18] [INFO ] Deduced a trap composed of 79 places in 99 ms
[2020-05-22 08:32:18] [INFO ] Deduced a trap composed of 82 places in 96 ms
[2020-05-22 08:32:18] [INFO ] Deduced a trap composed of 74 places in 100 ms
[2020-05-22 08:32:18] [INFO ] Deduced a trap composed of 79 places in 88 ms
[2020-05-22 08:32:18] [INFO ] Deduced a trap composed of 72 places in 87 ms
[2020-05-22 08:32:18] [INFO ] Deduced a trap composed of 82 places in 92 ms
[2020-05-22 08:32:18] [INFO ] Deduced a trap composed of 56 places in 111 ms
[2020-05-22 08:32:18] [INFO ] Deduced a trap composed of 92 places in 85 ms
[2020-05-22 08:32:19] [INFO ] Deduced a trap composed of 75 places in 82 ms
[2020-05-22 08:32:19] [INFO ] Deduced a trap composed of 73 places in 89 ms
[2020-05-22 08:32:19] [INFO ] Deduced a trap composed of 81 places in 118 ms
[2020-05-22 08:32:19] [INFO ] Deduced a trap composed of 76 places in 102 ms
[2020-05-22 08:32:19] [INFO ] Deduced a trap composed of 82 places in 113 ms
[2020-05-22 08:32:19] [INFO ] Deduced a trap composed of 60 places in 127 ms
[2020-05-22 08:32:19] [INFO ] Deduced a trap composed of 62 places in 104 ms
[2020-05-22 08:32:19] [INFO ] Deduced a trap composed of 78 places in 141 ms
[2020-05-22 08:32:20] [INFO ] Deduced a trap composed of 85 places in 100 ms
[2020-05-22 08:32:20] [INFO ] Deduced a trap composed of 78 places in 118 ms
[2020-05-22 08:32:20] [INFO ] Deduced a trap composed of 54 places in 102 ms
[2020-05-22 08:32:20] [INFO ] Deduced a trap composed of 80 places in 102 ms
[2020-05-22 08:32:20] [INFO ] Deduced a trap composed of 82 places in 111 ms
[2020-05-22 08:32:20] [INFO ] Deduced a trap composed of 75 places in 97 ms
[2020-05-22 08:32:20] [INFO ] Deduced a trap composed of 78 places in 92 ms
[2020-05-22 08:32:20] [INFO ] Deduced a trap composed of 80 places in 90 ms
[2020-05-22 08:32:20] [INFO ] Deduced a trap composed of 81 places in 91 ms
[2020-05-22 08:32:21] [INFO ] Deduced a trap composed of 74 places in 90 ms
[2020-05-22 08:32:21] [INFO ] Deduced a trap composed of 82 places in 112 ms
[2020-05-22 08:32:21] [INFO ] Deduced a trap composed of 88 places in 90 ms
[2020-05-22 08:32:21] [INFO ] Deduced a trap composed of 77 places in 105 ms
[2020-05-22 08:32:21] [INFO ] Deduced a trap composed of 89 places in 103 ms
[2020-05-22 08:32:21] [INFO ] Deduced a trap composed of 92 places in 86 ms
[2020-05-22 08:32:21] [INFO ] Deduced a trap composed of 77 places in 81 ms
[2020-05-22 08:32:21] [INFO ] Deduced a trap composed of 77 places in 80 ms
[2020-05-22 08:32:21] [INFO ] Deduced a trap composed of 83 places in 115 ms
[2020-05-22 08:32:22] [INFO ] Deduced a trap composed of 77 places in 109 ms
[2020-05-22 08:32:22] [INFO ] Deduced a trap composed of 77 places in 116 ms
[2020-05-22 08:32:22] [INFO ] Deduced a trap composed of 79 places in 102 ms
[2020-05-22 08:32:22] [INFO ] Deduced a trap composed of 83 places in 92 ms
[2020-05-22 08:32:22] [INFO ] Deduced a trap composed of 82 places in 122 ms
[2020-05-22 08:32:22] [INFO ] Deduced a trap composed of 84 places in 117 ms
[2020-05-22 08:32:22] [INFO ] Deduced a trap composed of 81 places in 116 ms
[2020-05-22 08:32:22] [INFO ] Deduced a trap composed of 78 places in 95 ms
[2020-05-22 08:32:23] [INFO ] Deduced a trap composed of 80 places in 83 ms
[2020-05-22 08:32:23] [INFO ] Deduced a trap composed of 64 places in 79 ms
[2020-05-22 08:32:23] [INFO ] Deduced a trap composed of 77 places in 100 ms
[2020-05-22 08:32:23] [INFO ] Deduced a trap composed of 83 places in 84 ms
[2020-05-22 08:32:23] [INFO ] Deduced a trap composed of 88 places in 76 ms
[2020-05-22 08:32:23] [INFO ] Deduced a trap composed of 82 places in 95 ms
[2020-05-22 08:32:23] [INFO ] Deduced a trap composed of 73 places in 75 ms
[2020-05-22 08:32:23] [INFO ] Deduced a trap composed of 75 places in 71 ms
[2020-05-22 08:32:23] [INFO ] Deduced a trap composed of 84 places in 77 ms
[2020-05-22 08:32:23] [INFO ] Deduced a trap composed of 83 places in 74 ms
[2020-05-22 08:32:24] [INFO ] Deduced a trap composed of 87 places in 84 ms
[2020-05-22 08:32:24] [INFO ] Deduced a trap composed of 67 places in 78 ms
[2020-05-22 08:32:24] [INFO ] Deduced a trap composed of 18 places in 58 ms
[2020-05-22 08:32:24] [INFO ] Trap strengthening (SAT) tested/added 114/113 trap constraints in 12938 ms
[2020-05-22 08:32:24] [INFO ] Computed and/alt/rep : 237/1513/237 causal constraints in 12 ms.
[2020-05-22 08:32:30] [INFO ] Added : 226 causal constraints over 46 iterations in 5803 ms. Result :sat
[2020-05-22 08:32:30] [INFO ] Deduced a trap composed of 14 places in 120 ms
[2020-05-22 08:32:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2020-05-22 08:32:30] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2020-05-22 08:32:30] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2020-05-22 08:32:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:32:30] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2020-05-22 08:32:30] [INFO ] [Real]Added 30 Read/Feed constraints in 6 ms returned sat
[2020-05-22 08:32:30] [INFO ] Deduced a trap composed of 18 places in 86 ms
[2020-05-22 08:32:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2020-05-22 08:32:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:32:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 24 ms returned sat
[2020-05-22 08:32:30] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2020-05-22 08:32:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:32:30] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2020-05-22 08:32:31] [INFO ] [Nat]Added 30 Read/Feed constraints in 11 ms returned sat
[2020-05-22 08:32:31] [INFO ] Deduced a trap composed of 15 places in 49 ms
[2020-05-22 08:32:31] [INFO ] Deduced a trap composed of 27 places in 46 ms
[2020-05-22 08:32:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 128 ms
[2020-05-22 08:32:31] [INFO ] Computed and/alt/rep : 237/1513/237 causal constraints in 15 ms.
[2020-05-22 08:32:35] [INFO ] Added : 236 causal constraints over 48 iterations in 3950 ms. Result :sat
[2020-05-22 08:32:35] [INFO ] Deduced a trap composed of 23 places in 59 ms
[2020-05-22 08:32:35] [INFO ] Deduced a trap composed of 34 places in 48 ms
[2020-05-22 08:32:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 253 ms
[2020-05-22 08:32:35] [INFO ] [Real]Absence check using 13 positive place invariants in 22 ms returned sat
[2020-05-22 08:32:35] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2020-05-22 08:32:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:32:35] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2020-05-22 08:32:35] [INFO ] [Real]Added 30 Read/Feed constraints in 6 ms returned sat
[2020-05-22 08:32:35] [INFO ] Deduced a trap composed of 30 places in 51 ms
[2020-05-22 08:32:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2020-05-22 08:32:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:32:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 22 ms returned sat
[2020-05-22 08:32:35] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2020-05-22 08:32:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:32:36] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2020-05-22 08:32:36] [INFO ] [Nat]Added 30 Read/Feed constraints in 19 ms returned sat
[2020-05-22 08:32:36] [INFO ] Deduced a trap composed of 72 places in 140 ms
[2020-05-22 08:32:36] [INFO ] Deduced a trap composed of 30 places in 119 ms
[2020-05-22 08:32:36] [INFO ] Deduced a trap composed of 34 places in 99 ms
[2020-05-22 08:32:36] [INFO ] Deduced a trap composed of 70 places in 99 ms
[2020-05-22 08:32:36] [INFO ] Deduced a trap composed of 64 places in 109 ms
[2020-05-22 08:32:36] [INFO ] Deduced a trap composed of 65 places in 99 ms
[2020-05-22 08:32:36] [INFO ] Deduced a trap composed of 37 places in 97 ms
[2020-05-22 08:32:37] [INFO ] Deduced a trap composed of 77 places in 125 ms
[2020-05-22 08:32:37] [INFO ] Deduced a trap composed of 68 places in 109 ms
[2020-05-22 08:32:37] [INFO ] Deduced a trap composed of 70 places in 94 ms
[2020-05-22 08:32:37] [INFO ] Deduced a trap composed of 82 places in 83 ms
[2020-05-22 08:32:37] [INFO ] Deduced a trap composed of 84 places in 100 ms
[2020-05-22 08:32:37] [INFO ] Deduced a trap composed of 81 places in 117 ms
[2020-05-22 08:32:37] [INFO ] Deduced a trap composed of 89 places in 80 ms
[2020-05-22 08:32:37] [INFO ] Deduced a trap composed of 81 places in 124 ms
[2020-05-22 08:32:38] [INFO ] Deduced a trap composed of 75 places in 98 ms
[2020-05-22 08:32:38] [INFO ] Deduced a trap composed of 77 places in 80 ms
[2020-05-22 08:32:38] [INFO ] Deduced a trap composed of 70 places in 122 ms
[2020-05-22 08:32:38] [INFO ] Deduced a trap composed of 62 places in 73 ms
[2020-05-22 08:32:38] [INFO ] Deduced a trap composed of 78 places in 74 ms
[2020-05-22 08:32:38] [INFO ] Deduced a trap composed of 70 places in 119 ms
[2020-05-22 08:32:38] [INFO ] Deduced a trap composed of 69 places in 63 ms
[2020-05-22 08:32:38] [INFO ] Deduced a trap composed of 68 places in 63 ms
[2020-05-22 08:32:38] [INFO ] Deduced a trap composed of 55 places in 117 ms
[2020-05-22 08:32:38] [INFO ] Deduced a trap composed of 67 places in 78 ms
[2020-05-22 08:32:38] [INFO ] Deduced a trap composed of 69 places in 60 ms
[2020-05-22 08:32:39] [INFO ] Deduced a trap composed of 69 places in 77 ms
[2020-05-22 08:32:39] [INFO ] Deduced a trap composed of 84 places in 71 ms
[2020-05-22 08:32:39] [INFO ] Deduced a trap composed of 71 places in 63 ms
[2020-05-22 08:32:39] [INFO ] Deduced a trap composed of 82 places in 64 ms
[2020-05-22 08:32:39] [INFO ] Deduced a trap composed of 37 places in 65 ms
[2020-05-22 08:32:39] [INFO ] Deduced a trap composed of 76 places in 118 ms
[2020-05-22 08:32:39] [INFO ] Deduced a trap composed of 89 places in 97 ms
[2020-05-22 08:32:39] [INFO ] Deduced a trap composed of 72 places in 74 ms
[2020-05-22 08:32:39] [INFO ] Deduced a trap composed of 75 places in 147 ms
[2020-05-22 08:32:39] [INFO ] Deduced a trap composed of 80 places in 99 ms
[2020-05-22 08:32:40] [INFO ] Deduced a trap composed of 81 places in 102 ms
[2020-05-22 08:32:40] [INFO ] Deduced a trap composed of 78 places in 105 ms
[2020-05-22 08:32:40] [INFO ] Deduced a trap composed of 91 places in 107 ms
[2020-05-22 08:32:40] [INFO ] Deduced a trap composed of 85 places in 140 ms
[2020-05-22 08:32:40] [INFO ] Deduced a trap composed of 77 places in 97 ms
[2020-05-22 08:32:40] [INFO ] Deduced a trap composed of 91 places in 89 ms
[2020-05-22 08:32:40] [INFO ] Deduced a trap composed of 88 places in 92 ms
[2020-05-22 08:32:40] [INFO ] Deduced a trap composed of 95 places in 91 ms
[2020-05-22 08:32:40] [INFO ] Deduced a trap composed of 58 places in 89 ms
[2020-05-22 08:32:41] [INFO ] Deduced a trap composed of 76 places in 93 ms
[2020-05-22 08:32:41] [INFO ] Deduced a trap composed of 75 places in 103 ms
[2020-05-22 08:32:41] [INFO ] Deduced a trap composed of 78 places in 91 ms
[2020-05-22 08:32:41] [INFO ] Deduced a trap composed of 75 places in 92 ms
[2020-05-22 08:32:41] [INFO ] Deduced a trap composed of 75 places in 79 ms
[2020-05-22 08:32:41] [INFO ] Deduced a trap composed of 87 places in 78 ms
[2020-05-22 08:32:41] [INFO ] Deduced a trap composed of 85 places in 81 ms
[2020-05-22 08:32:41] [INFO ] Deduced a trap composed of 78 places in 91 ms
[2020-05-22 08:32:41] [INFO ] Deduced a trap composed of 82 places in 87 ms
[2020-05-22 08:32:41] [INFO ] Deduced a trap composed of 85 places in 82 ms
[2020-05-22 08:32:42] [INFO ] Deduced a trap composed of 82 places in 80 ms
[2020-05-22 08:32:42] [INFO ] Deduced a trap composed of 86 places in 81 ms
[2020-05-22 08:32:42] [INFO ] Deduced a trap composed of 82 places in 88 ms
[2020-05-22 08:32:42] [INFO ] Deduced a trap composed of 83 places in 84 ms
[2020-05-22 08:32:42] [INFO ] Deduced a trap composed of 77 places in 77 ms
[2020-05-22 08:32:42] [INFO ] Deduced a trap composed of 75 places in 77 ms
[2020-05-22 08:32:42] [INFO ] Deduced a trap composed of 85 places in 78 ms
[2020-05-22 08:32:42] [INFO ] Deduced a trap composed of 60 places in 76 ms
[2020-05-22 08:32:42] [INFO ] Deduced a trap composed of 77 places in 77 ms
[2020-05-22 08:32:42] [INFO ] Deduced a trap composed of 84 places in 78 ms
[2020-05-22 08:32:42] [INFO ] Deduced a trap composed of 86 places in 76 ms
[2020-05-22 08:32:43] [INFO ] Deduced a trap composed of 85 places in 78 ms
[2020-05-22 08:32:43] [INFO ] Deduced a trap composed of 94 places in 77 ms
[2020-05-22 08:32:43] [INFO ] Deduced a trap composed of 75 places in 69 ms
[2020-05-22 08:32:43] [INFO ] Deduced a trap composed of 85 places in 66 ms
[2020-05-22 08:32:43] [INFO ] Deduced a trap composed of 82 places in 66 ms
[2020-05-22 08:32:43] [INFO ] Deduced a trap composed of 80 places in 92 ms
[2020-05-22 08:32:43] [INFO ] Deduced a trap composed of 82 places in 74 ms
[2020-05-22 08:32:43] [INFO ] Deduced a trap composed of 64 places in 83 ms
[2020-05-22 08:32:43] [INFO ] Trap strengthening (SAT) tested/added 75/74 trap constraints in 7552 ms
[2020-05-22 08:32:43] [INFO ] Computed and/alt/rep : 237/1513/237 causal constraints in 13 ms.
[2020-05-22 08:32:47] [INFO ] Added : 237 causal constraints over 48 iterations in 4078 ms. Result :sat
[2020-05-22 08:32:47] [INFO ] Deduced a trap composed of 19 places in 70 ms
[2020-05-22 08:32:47] [INFO ] Deduced a trap composed of 27 places in 59 ms
[2020-05-22 08:32:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 229 ms
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 232 transition count 237
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 2 place count 232 transition count 226
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 24 place count 221 transition count 226
Symmetric choice reduction at 2 with 4 rule applications. Total rules 28 place count 221 transition count 226
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 36 place count 217 transition count 222
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 217 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 216 transition count 221
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 216 transition count 221
Applied a total of 39 rules in 64 ms. Remains 216 /233 variables (removed 17) and now considering 221/238 (removed 17) transitions.
// Phase 1: matrix 221 rows 216 cols
[2020-05-22 08:32:48] [INFO ] Computed 31 place invariants in 12 ms
[2020-05-22 08:32:48] [INFO ] [Real]Absence check using 6 positive place invariants in 14 ms returned sat
[2020-05-22 08:32:48] [INFO ] [Real]Absence check using 6 positive and 25 generalized place invariants in 13 ms returned sat
[2020-05-22 08:32:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:32:48] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2020-05-22 08:32:48] [INFO ] Deduced a trap composed of 5 places in 59 ms
[2020-05-22 08:32:48] [INFO ] Deduced a trap composed of 37 places in 25 ms
[2020-05-22 08:32:48] [INFO ] Deduced a trap composed of 31 places in 24 ms
[2020-05-22 08:32:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 139 ms
[2020-05-22 08:32:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:32:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2020-05-22 08:32:48] [INFO ] [Nat]Absence check using 6 positive and 25 generalized place invariants in 9 ms returned sat
[2020-05-22 08:32:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:32:48] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2020-05-22 08:32:48] [INFO ] Deduced a trap composed of 9 places in 89 ms
[2020-05-22 08:32:48] [INFO ] Deduced a trap composed of 17 places in 70 ms
[2020-05-22 08:32:48] [INFO ] Deduced a trap composed of 37 places in 22 ms
[2020-05-22 08:32:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 224 ms
[2020-05-22 08:32:48] [INFO ] Computed and/alt/rep : 220/1413/220 causal constraints in 13 ms.
[2020-05-22 08:32:51] [INFO ] Added : 217 causal constraints over 45 iterations in 2760 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
[2020-05-22 08:32:51] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2020-05-22 08:32:51] [INFO ] [Real]Absence check using 6 positive and 25 generalized place invariants in 13 ms returned sat
[2020-05-22 08:32:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:32:51] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2020-05-22 08:32:52] [INFO ] Computed and/alt/rep : 220/1413/220 causal constraints in 13 ms.
[2020-05-22 08:32:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:32:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2020-05-22 08:32:52] [INFO ] [Nat]Absence check using 6 positive and 25 generalized place invariants in 19 ms returned sat
[2020-05-22 08:32:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:32:52] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2020-05-22 08:32:52] [INFO ] Computed and/alt/rep : 220/1413/220 causal constraints in 12 ms.
[2020-05-22 08:32:54] [INFO ] Added : 210 causal constraints over 43 iterations in 1821 ms. Result :sat
[2020-05-22 08:32:54] [INFO ] Deduced a trap composed of 20 places in 112 ms
[2020-05-22 08:32:54] [INFO ] Deduced a trap composed of 5 places in 96 ms
[2020-05-22 08:32:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 286 ms
Attempting to minimize the solution found.
Minimization took 19 ms.
[2020-05-22 08:32:54] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2020-05-22 08:32:54] [INFO ] [Real]Absence check using 6 positive and 25 generalized place invariants in 13 ms returned sat
[2020-05-22 08:32:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:32:54] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2020-05-22 08:32:54] [INFO ] Deduced a trap composed of 5 places in 58 ms
[2020-05-22 08:32:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2020-05-22 08:32:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:32:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 18 ms returned sat
[2020-05-22 08:32:54] [INFO ] [Nat]Absence check using 6 positive and 25 generalized place invariants in 19 ms returned sat
[2020-05-22 08:32:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:32:55] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2020-05-22 08:32:55] [INFO ] Deduced a trap composed of 13 places in 108 ms
[2020-05-22 08:32:55] [INFO ] Deduced a trap composed of 71 places in 98 ms
[2020-05-22 08:32:55] [INFO ] Deduced a trap composed of 71 places in 99 ms
[2020-05-22 08:32:55] [INFO ] Deduced a trap composed of 18 places in 136 ms
[2020-05-22 08:32:55] [INFO ] Deduced a trap composed of 75 places in 86 ms
[2020-05-22 08:32:55] [INFO ] Deduced a trap composed of 80 places in 76 ms
[2020-05-22 08:32:55] [INFO ] Deduced a trap composed of 21 places in 104 ms
[2020-05-22 08:32:56] [INFO ] Deduced a trap composed of 29 places in 75 ms
[2020-05-22 08:32:56] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 892 ms
[2020-05-22 08:32:56] [INFO ] Computed and/alt/rep : 220/1413/220 causal constraints in 10 ms.
[2020-05-22 08:32:59] [INFO ] Added : 213 causal constraints over 43 iterations in 3080 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2020-05-22 08:32:59] [INFO ] [Real]Absence check using 6 positive place invariants in 12 ms returned sat
[2020-05-22 08:32:59] [INFO ] [Real]Absence check using 6 positive and 25 generalized place invariants in 16 ms returned sat
[2020-05-22 08:32:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:32:59] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2020-05-22 08:32:59] [INFO ] Deduced a trap composed of 80 places in 125 ms
[2020-05-22 08:32:59] [INFO ] Deduced a trap composed of 81 places in 91 ms
[2020-05-22 08:32:59] [INFO ] Deduced a trap composed of 13 places in 54 ms
[2020-05-22 08:32:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 320 ms
[2020-05-22 08:32:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:32:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 17 ms returned sat
[2020-05-22 08:32:59] [INFO ] [Nat]Absence check using 6 positive and 25 generalized place invariants in 15 ms returned sat
[2020-05-22 08:32:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:33:00] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2020-05-22 08:33:00] [INFO ] Computed and/alt/rep : 220/1413/220 causal constraints in 14 ms.
[2020-05-22 08:33:01] [INFO ] Added : 215 causal constraints over 43 iterations in 1870 ms. Result :sat
[2020-05-22 08:33:02] [INFO ] Deduced a trap composed of 77 places in 127 ms
[2020-05-22 08:33:02] [INFO ] Deduced a trap composed of 81 places in 121 ms
[2020-05-22 08:33:02] [INFO ] Deduced a trap composed of 77 places in 101 ms
[2020-05-22 08:33:02] [INFO ] Deduced a trap composed of 9 places in 114 ms
[2020-05-22 08:33:02] [INFO ] Deduced a trap composed of 21 places in 121 ms
[2020-05-22 08:33:02] [INFO ] Deduced a trap composed of 79 places in 117 ms
[2020-05-22 08:33:03] [INFO ] Deduced a trap composed of 81 places in 123 ms
[2020-05-22 08:33:03] [INFO ] Deduced a trap composed of 87 places in 117 ms
[2020-05-22 08:33:03] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1329 ms
Attempting to minimize the solution found.
Minimization took 28 ms.
[2020-05-22 08:33:03] [INFO ] [Real]Absence check using 6 positive place invariants in 13 ms returned sat
[2020-05-22 08:33:03] [INFO ] [Real]Absence check using 6 positive and 25 generalized place invariants in 19 ms returned sat
[2020-05-22 08:33:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:33:03] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2020-05-22 08:33:03] [INFO ] Deduced a trap composed of 5 places in 76 ms
[2020-05-22 08:33:03] [INFO ] Deduced a trap composed of 24 places in 46 ms
[2020-05-22 08:33:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 155 ms
[2020-05-22 08:33:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:33:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2020-05-22 08:33:03] [INFO ] [Nat]Absence check using 6 positive and 25 generalized place invariants in 37 ms returned sat
[2020-05-22 08:33:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:33:04] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2020-05-22 08:33:04] [INFO ] Deduced a trap composed of 5 places in 69 ms
[2020-05-22 08:33:04] [INFO ] Deduced a trap composed of 24 places in 41 ms
[2020-05-22 08:33:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 135 ms
[2020-05-22 08:33:04] [INFO ] Computed and/alt/rep : 220/1413/220 causal constraints in 11 ms.
[2020-05-22 08:33:06] [INFO ] Added : 215 causal constraints over 43 iterations in 2071 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 38 ms.
[2020-05-22 08:33:06] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2020-05-22 08:33:06] [INFO ] [Real]Absence check using 6 positive and 25 generalized place invariants in 9 ms returned sat
[2020-05-22 08:33:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:33:06] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2020-05-22 08:33:06] [INFO ] Deduced a trap composed of 31 places in 60 ms
[2020-05-22 08:33:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2020-05-22 08:33:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:33:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2020-05-22 08:33:06] [INFO ] [Nat]Absence check using 6 positive and 25 generalized place invariants in 8 ms returned sat
[2020-05-22 08:33:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:33:06] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2020-05-22 08:33:06] [INFO ] Deduced a trap composed of 31 places in 35 ms
[2020-05-22 08:33:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2020-05-22 08:33:06] [INFO ] Computed and/alt/rep : 220/1413/220 causal constraints in 17 ms.
[2020-05-22 08:33:09] [INFO ] Added : 219 causal constraints over 44 iterations in 2127 ms. Result :sat
[2020-05-22 08:33:09] [INFO ] Deduced a trap composed of 28 places in 86 ms
[2020-05-22 08:33:09] [INFO ] Deduced a trap composed of 21 places in 59 ms
[2020-05-22 08:33:09] [INFO ] Deduced a trap composed of 26 places in 52 ms
[2020-05-22 08:33:09] [INFO ] Deduced a trap composed of 22 places in 55 ms
[2020-05-22 08:33:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 754 ms
Attempting to minimize the solution found.
Minimization took 41 ms.
[2020-05-22 08:33:09] [INFO ] [Real]Absence check using 6 positive place invariants in 13 ms returned sat
[2020-05-22 08:33:09] [INFO ] [Real]Absence check using 6 positive and 25 generalized place invariants in 16 ms returned sat
[2020-05-22 08:33:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:33:10] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2020-05-22 08:33:10] [INFO ] Deduced a trap composed of 31 places in 31 ms
[2020-05-22 08:33:10] [INFO ] Deduced a trap composed of 37 places in 29 ms
[2020-05-22 08:33:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 93 ms
[2020-05-22 08:33:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:33:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 14 ms returned sat
[2020-05-22 08:33:10] [INFO ] [Nat]Absence check using 6 positive and 25 generalized place invariants in 12 ms returned sat
[2020-05-22 08:33:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:33:10] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2020-05-22 08:33:10] [INFO ] Deduced a trap composed of 5 places in 69 ms
[2020-05-22 08:33:10] [INFO ] Deduced a trap composed of 37 places in 47 ms
[2020-05-22 08:33:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 152 ms
[2020-05-22 08:33:10] [INFO ] Computed and/alt/rep : 220/1413/220 causal constraints in 14 ms.
[2020-05-22 08:33:14] [INFO ] Added : 220 causal constraints over 44 iterations in 3296 ms. Result :sat
[2020-05-22 08:33:14] [INFO ] Deduced a trap composed of 8 places in 75 ms
[2020-05-22 08:33:14] [INFO ] Deduced a trap composed of 24 places in 60 ms
[2020-05-22 08:33:14] [INFO ] Deduced a trap composed of 27 places in 48 ms
[2020-05-22 08:33:14] [INFO ] Deduced a trap composed of 21 places in 51 ms
[2020-05-22 08:33:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 386 ms
Attempting to minimize the solution found.
Minimization took 28 ms.
[2020-05-22 08:33:14] [INFO ] Flatten gal took : 112 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 08:33:14] [INFO ] Applying decomposition
[2020-05-22 08:33:14] [INFO ] Flatten gal took : 58 ms
[2020-05-22 08:33:14] [INFO ] Flatten gal took : 61 ms
[2020-05-22 08:33:14] [INFO ] Input system was already deterministic with 238 transitions.
[2020-05-22 08:33:15] [INFO ] Input system was already deterministic with 238 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph13721467974979987004.txt, -o, /tmp/graph13721467974979987004.bin, -w, /tmp/graph13721467974979987004.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph13721467974979987004.bin, -l, -1, -v, -w, /tmp/graph13721467974979987004.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 238 rows 233 cols
[2020-05-22 08:33:15] [INFO ] Computed 31 place invariants in 10 ms
inv : p116 + p122 + p124 + p14 + p16 + p169 + p174 + p175 + p177 + p22 + p222 + p228 + p230 + p24 + p275 + p281 + p283 + p3 + p328 + p330 + p334 + p336 + p381 + p387 + p389 + p4 + p432 + p434 + p440 + p442 + p485 + p487 + p499 + p500 + p502 + p505 + p517 + p521 + p523 + p525 + p527 + p528 + p530 + p63 + p65 + p69 + p70 + p71 = 1
inv : p116 + p122 + p124 + p14 + p16 + p169 + p174 + p175 + p177 + p22 + p222 + p228 + p230 + p24 + p275 + p281 + p283 + p3 + p328 + p330 + p340 + p342 + p343 + p346 + p352 + p354 + p355 + p358 + p364 + p366 + p369 + p371 + p381 + p393 + p395 + p396 + p399 + p4 + p405 + p406 + p407 + p408 + p409 + p411 + p417 + p419 + p432 + p434 + p446 + p448 + p449 + p452 + p453 + p458 + p460 + p461 + p464 + p468 + p470 + p472 + p485 + p487 + p499 + p500 + p502 + p505 + p517 + p521 + p523 + p525 + p527 + p63 + p65 + p69 + p70 + p71 = 1
inv : p116 + p128 + p130 + p131 + p133 + p134 + p14 + p140 + p141 + p142 + p143 + p146 + p152 + p154 + p157 + p159 + p16 + p169 + p174 + p179 + p181 + p183 + p184 + p187 + p193 + p195 + p196 + p199 + p203 + p205 + p207 + p22 + p222 + p234 + p236 + p237 + p238 + p24 + p240 + p241 + p244 + p245 + p246 + p248 + p249 + p252 + p256 + p258 + p260 + p262 + p275 + p287 + p289 + p290 + p293 + p299 + p3 + p300 + p301 + p302 + p305 + p306 + p309 + p310 + p311 + p313 + p328 + p330 + p340 + p342 + p343 + p346 + p352 + p354 + p355 + p358 + p364 + p366 + p381 + p393 + p395 + p396 + p399 + p4 + p405 + p406 + p407 + p408 + p409 + p411 + p417 + p419 + p432 + p434 + p446 + p448 + p449 + p452 + p453 + p458 + p460 + p461 + p464 + p468 + p470 + p472 + p485 + p487 + p499 + p500 + p502 + p505 + p517 + p521 + p523 + p525 + p527 + p63 + p65 + p69 + p70 + p71 = 1
inv : p374 - p375 + p377 - p378 + p399 + p411 = 0
inv : p55 - p57 + p58 - p60 + p81 + p91 + p93 = 0
inv : p162 - p163 + p165 - p166 + p187 + p199 = 0
inv : p480 - p481 + p483 - p484 + p500 + p505 + p517 = 0
inv : p427 - p428 + p430 - p431 + p452 + p464 = 0
inv : p116 + p122 + p124 + p14 + p16 + p169 + p174 + p175 + p177 + p22 + p222 + p228 + p230 + p24 + p275 + p287 + p289 + p290 + p293 + p299 + p3 + p300 + p301 + p302 + p305 + p306 + p309 + p310 + p311 + p313 + p316 + p318 + p328 + p330 + p340 + p342 + p343 + p346 + p352 + p354 + p355 + p358 + p364 + p366 + p381 + p393 + p395 + p396 + p399 + p4 + p405 + p406 + p407 + p408 + p409 + p411 + p417 + p419 + p432 + p434 + p446 + p448 + p449 + p452 + p453 + p458 + p460 + p461 + p464 + p468 + p470 + p472 + p485 + p487 + p499 + p500 + p502 + p505 + p517 + p521 + p523 + p525 + p527 + p63 + p65 + p69 + p70 + p71 = 1
inv : p268 - p269 + p271 - p272 + p293 + p305 = 0
inv : p116 + p122 + p124 + p14 + p16 + p169 + p174 + p175 + p177 + p22 + p222 + p228 + p230 + p24 + p275 + p281 + p283 + p3 + p328 + p330 + p334 + p336 + p381 + p393 + p395 + p396 + p399 + p4 + p405 + p406 + p407 + p408 + p409 + p411 + p417 + p419 + p422 + p424 + p432 + p434 + p446 + p448 + p449 + p452 + p453 + p458 + p460 + p461 + p464 + p468 + p470 + p472 + p485 + p487 + p499 + p500 + p502 + p505 + p517 + p521 + p523 + p525 + p527 + p63 + p65 + p69 + p70 + p71 = 1
inv : p116 + p122 + p124 + p14 + p16 + p169 + p174 + p175 + p177 + p22 + p222 + p234 + p236 + p237 + p238 + p24 + p240 + p241 + p244 + p245 + p246 + p248 + p249 + p252 + p256 + p258 + p260 + p262 + p263 + p265 + p275 + p287 + p289 + p290 + p293 + p299 + p3 + p300 + p301 + p302 + p305 + p306 + p309 + p310 + p311 + p313 + p328 + p330 + p340 + p342 + p343 + p346 + p352 + p354 + p355 + p358 + p364 + p366 + p381 + p393 + p395 + p396 + p399 + p4 + p405 + p406 + p407 + p408 + p409 + p411 + p417 + p419 + p432 + p434 + p446 + p448 + p449 + p452 + p453 + p458 + p460 + p461 + p464 + p468 + p470 + p472 + p485 + p487 + p499 + p500 + p502 + p505 + p517 + p521 + p523 + p525 + p527 + p63 + p65 + p69 + p70 + p71 = 1
inv : p116 + p122 + p124 + p14 + p16 + p169 + p174 + p175 + p177 + p22 + p222 + p228 + p230 + p24 + p275 + p281 + p283 + p3 + p328 + p330 + p334 + p336 + p381 + p387 + p389 + p4 + p432 + p434 + p446 + p448 + p449 + p452 + p453 + p458 + p460 + p461 + p464 + p468 + p470 + p472 + p475 + p477 + p485 + p487 + p499 + p500 + p502 + p505 + p517 + p521 + p523 + p525 + p527 + p63 + p65 + p69 + p70 + p71 = 1
inv : p426 - p428 + p429 - p431 + p452 + p464 = 0
inv : p215 - p216 + p218 - p219 + p238 + p240 + p252 = 0
inv : p108 - p110 + p111 - p113 + p134 + p141 + p146 = 0
inv : p321 - p322 + p324 - p325 + p346 + p358 = 0
inv : p101 + p116 + p12 + p128 + p13 + p130 + p131 + p133 + p134 + p14 + p140 + p141 + p142 + p143 + p146 + p152 + p154 + p16 + p169 + p174 + p179 + p181 + p183 + p184 + p187 + p193 + p195 + p196 + p199 + p203 + p205 + p207 + p222 + p234 + p236 + p237 + p238 + p240 + p241 + p244 + p245 + p246 + p248 + p249 + p252 + p256 + p258 + p260 + p262 + p275 + p28 + p287 + p289 + p290 + p293 + p299 + 3*p3 + p30 + p300 + p301 + p302 + p305 + p306 + p309 + p31 + p310 + p311 + p313 + p328 + p330 + p340 + p342 + p343 + p346 + p352 + p354 + p355 + p358 + p364 + p366 + p381 + p393 + p395 + p396 + p399 + 2*p4 + p40 + p405 + p406 + p407 + p408 + p409 + p411 + p417 + p419 + p42 + p43 + p432 + p434 + p446 + p448 + p449 + p452 + p453 + p458 + p460 + p461 + p464 + p468 + p470 + p472 + p485 + p487 + p499 + p500 + p502 + p505 + p517 + p52 + p521 + p523 + p525 + p527 + p54 + p63 + p65 + p70 + p75 + p77 + p78 + p81 + p87 + p89 + p90 + p91 + p93 + p99 = 3
inv : p10 + p11 + p3 + p4 = 2
inv : p320 - p322 + p323 - p325 + p346 + p358 = 0
inv : p116 + p122 + p124 + p14 + p16 + p169 + p174 + p179 + p181 + p183 + p184 + p187 + p193 + p195 + p196 + p199 + p203 + p205 + p207 + p210 + p212 + p22 + p222 + p234 + p236 + p237 + p238 + p24 + p240 + p241 + p244 + p245 + p246 + p248 + p249 + p252 + p256 + p258 + p260 + p262 + p275 + p287 + p289 + p290 + p293 + p299 + p3 + p300 + p301 + p302 + p305 + p306 + p309 + p310 + p311 + p313 + p328 + p330 + p340 + p342 + p343 + p346 + p352 + p354 + p355 + p358 + p364 + p366 + p381 + p393 + p395 + p396 + p399 + p4 + p405 + p406 + p407 + p408 + p409 + p411 + p417 + p419 + p432 + p434 + p446 + p448 + p449 + p452 + p453 + p458 + p460 + p461 + p464 + p468 + p470 + p472 + p485 + p487 + p499 + p500 + p502 + p505 + p517 + p521 + p523 + p525 + p527 + p63 + p65 + p69 + p70 + p71 = 1
inv : p214 - p216 + p217 - p219 + p240 + p252 + p310 = 0
inv : p56 - p57 + p59 - p60 + p81 + p93 = 0
inv : p479 - p481 + p482 - p484 + p505 + p517 = 0
inv : p267 - p269 + p270 - p272 + p293 + p300 + p305 = 0
inv : p101 + p104 + p106 + p116 + p128 + p130 + p131 + p133 + p134 + p14 + p140 + p141 + p142 + p143 + p146 + p152 + p154 + p16 + p169 + p174 + p179 + p181 + p183 + p184 + p187 + p193 + p195 + p196 + p199 + p203 + p205 + p207 + p22 + p222 + p234 + p236 + p237 + p238 + p24 + p240 + p241 + p244 + p245 + p246 + p248 + p249 + p252 + p256 + p258 + p260 + p262 + p275 + p287 + p289 + p290 + p293 + p299 + p3 + p300 + p301 + p302 + p305 + p306 + p309 + p310 + p311 + p313 + p328 + p330 + p340 + p342 + p343 + p346 + p352 + p354 + p355 + p358 + p364 + p366 + p381 + p393 + p395 + p396 + p399 + p4 + p405 + p406 + p407 + p408 + p409 + p411 + p417 + p419 + p432 + p434 + p446 + p448 + p449 + p452 + p453 + p458 + p460 + p461 + p464 + p468 + p470 + p472 + p485 + p487 + p499 + p500 + p502 + p505 + p517 + p521 + p523 + p525 + p527 + p63 + p65 + p70 + p75 + p77 + p78 + p81 + p87 + p89 + p90 + p91 + p93 + p99 = 1
inv : p101 + p116 + p128 + p130 + p131 + p133 + p134 + p14 + p140 + p141 + p142 + p143 + p146 + p152 + p154 + p16 + p169 + p174 + p179 + p181 + p183 + p184 + p187 + p193 + p195 + p196 + p199 + p203 + p205 + p207 + p222 + p234 + p236 + p237 + p238 + p240 + p241 + p244 + p245 + p246 + p248 + p249 + p252 + p256 + p258 + p260 + p262 + p275 + p28 + p287 + p289 + p290 + p293 + p299 + p3 + p30 + p300 + p301 + p302 + p305 + p306 + p309 + p31 + p310 + p311 + p313 + p328 + p330 + p34 + p340 + p342 + p343 + p346 + p352 + p354 + p355 + p358 + p364 + p366 + p381 + p393 + p395 + p396 + p399 + p4 + p40 + p405 + p406 + p407 + p408 + p409 + p411 + p417 + p419 + p42 + p43 + p432 + p434 + p446 + p448 + p449 + p452 + p453 + p458 + p46 + p460 + p461 + p464 + p468 + p470 + p472 + p485 + p487 + p499 + p500 + p502 + p505 + p517 + p52 + p521 + p523 + p525 + p527 + p54 + p63 + p65 + p70 + p75 + p77 + p78 + p81 + p87 + p89 + p90 + p91 + p93 + p99 = 1
inv : p109 - p110 + p112 - p113 + p134 + p146 = 0
inv : p3 + p4 + p8 + p9 = 2
inv : p161 - p163 + p164 - p166 + p187 + p199 = 0
inv : p373 - p375 + p376 - p378 + p399 + p406 + p409 + p411 = 0
Total of 31 invariants.
[2020-05-22 08:33:15] [INFO ] Computed 31 place invariants in 14 ms
[2020-05-22 08:33:15] [INFO ] Decomposing Gal with order
[2020-05-22 08:33:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 08:33:15] [INFO ] Removed a total of 106 redundant transitions.
[2020-05-22 08:33:15] [INFO ] Ran tautology test, simplified 0 / 7 in 557 ms.
[2020-05-22 08:33:15] [INFO ] Flatten gal took : 178 ms
[2020-05-22 08:33:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-01(UNSAT) depth K=0 took 31 ms
[2020-05-22 08:33:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=0 took 7 ms
[2020-05-22 08:33:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-05(UNSAT) depth K=0 took 3 ms
[2020-05-22 08:33:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=0 took 1 ms
[2020-05-22 08:33:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=0 took 1 ms
[2020-05-22 08:33:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=0 took 17 ms
[2020-05-22 08:33:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-12(UNSAT) depth K=0 took 9 ms
[2020-05-22 08:33:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 64 ms.
[2020-05-22 08:33:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-01(UNSAT) depth K=1 took 6 ms
[2020-05-22 08:33:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=1 took 1 ms
[2020-05-22 08:33:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-05(UNSAT) depth K=1 took 0 ms
[2020-05-22 08:33:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=1 took 1 ms
[2020-05-22 08:33:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=1 took 0 ms
[2020-05-22 08:33:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=1 took 0 ms
[2020-05-22 08:33:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-12(UNSAT) depth K=1 took 0 ms
[2020-05-22 08:33:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-01(UNSAT) depth K=2 took 20 ms
[2020-05-22 08:33:15] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 38 ms
[2020-05-22 08:33:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=2 took 35 ms
[2020-05-22 08:33:15] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityFireability.pnml.gal, -t, CGAL, -reachable-file, ReachabilityFireability.prop, --nowitness], workingDir=/home/mcc/execution]
[2020-05-22 08:33:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-05(UNSAT) depth K=2 took 23 ms

[2020-05-22 08:33:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=2 took 43 ms
[2020-05-22 08:33:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=2 took 3 ms
[2020-05-22 08:33:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=2 took 1 ms
[2020-05-22 08:33:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-12(UNSAT) depth K=2 took 0 ms
its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 238 rows 233 cols
[2020-05-22 08:33:15] [INFO ] Computed 31 place invariants in 9 ms
inv : p116 + p122 + p124 + p14 + p16 + p169 + p174 + p175 + p177 + p22 + p222 + p228 + p230 + p24 + p275 + p281 + p283 + p3 + p328 + p330 + p334 + p336 + p381 + p387 + p389 + p4 + p432 + p434 + p440 + p442 + p485 + p487 + p499 + p500 + p502 + p505 + p517 + p521 + p523 + p525 + p527 + p528 + p530 + p63 + p65 + p69 + p70 + p71 = 1
inv : p116 + p122 + p124 + p14 + p16 + p169 + p174 + p175 + p177 + p22 + p222 + p228 + p230 + p24 + p275 + p281 + p283 + p3 + p328 + p330 + p340 + p342 + p343 + p346 + p352 + p354 + p355 + p358 + p364 + p366 + p369 + p371 + p381 + p393 + p395 + p396 + p399 + p4 + p405 + p406 + p407 + p408 + p409 + p411 + p417 + p419 + p432 + p434 + p446 + p448 + p449 + p452 + p453 + p458 + p460 + p461 + p464 + p468 + p470 + p472 + p485 + p487 + p499 + p500 + p502 + p505 + p517 + p521 + p523 + p525 + p527 + p63 + p65 + p69 + p70 + p71 = 1
[2020-05-22 08:33:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-01(UNSAT) depth K=3 took 31 ms
inv : p116 + p128 + p130 + p131 + p133 + p134 + p14 + p140 + p141 + p142 + p143 + p146 + p152 + p154 + p157 + p159 + p16 + p169 + p174 + p179 + p181 + p183 + p184 + p187 + p193 + p195 + p196 + p199 + p203 + p205 + p207 + p22 + p222 + p234 + p236 + p237 + p238 + p24 + p240 + p241 + p244 + p245 + p246 + p248 + p249 + p252 + p256 + p258 + p260 + p262 + p275 + p287 + p289 + p290 + p293 + p299 + p3 + p300 + p301 + p302 + p305 + p306 + p309 + p310 + p311 + p313 + p328 + p330 + p340 + p342 + p343 + p346 + p352 + p354 + p355 + p358 + p364 + p366 + p381 + p393 + p395 + p396 + p399 + p4 + p405 + p406 + p407 + p408 + p409 + p411 + p417 + p419 + p432 + p434 + p446 + p448 + p449 + p452 + p453 + p458 + p460 + p461 + p464 + p468 + p470 + p472 + p485 + p487 + p499 + p500 + p502 + p505 + p517 + p521 + p523 + p525 + p527 + p63 + p65 + p69 + p70 + p71 = 1
inv : p374 - p375 + p377 - p378 + p399 + p411 = 0
inv : p55 - p57 + p58 - p60 + p81 + p91 + p93 = 0
inv : p162 - p163 + p165 - p166 + p187 + p199 = 0
inv : p480 - p481 + p483 - p484 + p500 + p505 + p517 = 0
inv : p427 - p428 + p430 - p431 + p452 + p464 = 0
inv : p116 + p122 + p124 + p14 + p16 + p169 + p174 + p175 + p177 + p22 + p222 + p228 + p230 + p24 + p275 + p287 + p289 + p290 + p293 + p299 + p3 + p300 + p301 + p302 + p305 + p306 + p309 + p310 + p311 + p313 + p316 + p318 + p328 + p330 + p340 + p342 + p343 + p346 + p352 + p354 + p355 + p358 + p364 + p366 + p381 + p393 + p395 + p396 + p399 + p4 + p405 + p406 + p407 + p408 + p409 + p411 + p417 + p419 + p432 + p434 + p446 + p448 + p449 + p452 + p453 + p458 + p460 + p461 + p464 + p468 + p470 + p472 + p485 + p487 + p499 + p500 + p502 + p505 + p517 + p521 + p523 + p525 + p527 + p63 + p65 + p69 + p70 + p71 = 1
inv : p268 - p269 + p271 - p272 + p293 + p305 = 0
inv : p116 + p122 + p124 + p14 + p16 + p169 + p174 + p175 + p177 + p22 + p222 + p228 + p230 + p24 + p275 + p281 + p283 + p3 + p328 + p330 + p334 + p336 + p381 + p393 + p395 + p396 + p399 + p4 + p405 + p406 + p407 + p408 + p409 + p411 + p417 + p419 + p422 + p424 + p432 + p434 + p446 + p448 + p449 + p452 + p453 + p458 + p460 + p461 + p464 + p468 + p470 + p472 + p485 + p487 + p499 + p500 + p502 + p505 + p517 + p521 + p523 + p525 + p527 + p63 + p65 + p69 + p70 + p71 = 1
inv : p116 + p122 + p124 + p14 + p16 + p169 + p174 + p175 + p177 + p22 + p222 + p234 + p236 + p237 + p238 + p24 + p240 + p241 + p244 + p245 + p246 + p248 + p249 + p252 + p256 + p258 + p260 + p262 + p263 + p265 + p275 + p287 + p289 + p290 + p293 + p299 + p3 + p300 + p301 + p302 + p305 + p306 + p309 + p310 + p311 + p313 + p328 + p330 + p340 + p342 + p343 + p346 + p352 + p354 + p355 + p358 + p364 + p366 + p381 + p393 + p395 + p396 + p399 + p4 + p405 + p406 + p407 + p408 + p409 + p411 + p417 + p419 + p432 + p434 + p446 + p448 + p449 + p452 + p453 + p458 + p460 + p461 + p464 + p468 + p470 + p472 + p485 + p487 + p499 + p500 + p502 + p505 + p517 + p521 + p523 + p525 + p527 + p63 + p65 + p69 + p70 + p71 = 1
inv : p116 + p122 + p124 + p14 + p16 + p169 + p174 + p175 + p177 + p22 + p222 + p228 + p230 + p24 + p275 + p281 + p283 + p3 + p328 + p330 + p334 + p336 + p381 + p387 + p389 + p4 + p432 + p434 + p446 + p448 + p449 + p452 + p453 + p458 + p460 + p461 + p464 + p468 + p470 + p472 + p475 + p477 + p485 + p487 + p499 + p500 + p502 + p505 + p517 + p521 + p523 + p525 + p527 + p63 + p65 + p69 + p70 + p71 = 1
inv : p426 - p428 + p429 - p431 + p452 + p464 = 0
inv : p215 - p216 + p218 - p219 + p238 + p240 + p252 = 0
inv : p108 - p110 + p111 - p113 + p134 + p141 + p146 = 0
inv : p321 - p322 + p324 - p325 + p346 + p358 = 0
inv : p101 + p116 + p12 + p128 + p13 + p130 + p131 + p133 + p134 + p14 + p140 + p141 + p142 + p143 + p146 + p152 + p154 + p16 + p169 + p174 + p179 + p181 + p183 + p184 + p187 + p193 + p195 + p196 + p199 + p203 + p205 + p207 + p222 + p234 + p236 + p237 + p238 + p240 + p241 + p244 + p245 + p246 + p248 + p249 + p252 + p256 + p258 + p260 + p262 + p275 + p28 + p287 + p289 + p290 + p293 + p299 + 3*p3 + p30 + p300 + p301 + p302 + p305 + p306 + p309 + p31 + p310 + p311 + p313 + p328 + p330 + p340 + p342 + p343 + p346 + p352 + p354 + p355 + p358 + p364 + p366 + p381 + p393 + p395 + p396 + p399 + 2*p4 + p40 + p405 + p406 + p407 + p408 + p409 + p411 + p417 + p419 + p42 + p43 + p432 + p434 + p446 + p448 + p449 + p452 + p453 + p458 + p460 + p461 + p464 + p468 + p470 + p472 + p485 + p487 + p499 + p500 + p502 + p505 + p517 + p52 + p521 + p523 + p525 + p527 + p54 + p63 + p65 + p70 + p75 + p77 + p78 + p81 + p87 + p89 + p90 + p91 + p93 + p99 = 3
inv : p10 + p11 + p3 + p4 = 2
inv : p320 - p322 + p323 - p325 + p346 + p358 = 0
inv : p116 + p122 + p124 + p14 + p16 + p169 + p174 + p179 + p181 + p183 + p184 + p187 + p193 + p195 + p196 + p199 + p203 + p205 + p207 + p210 + p212 + p22 + p222 + p234 + p236 + p237 + p238 + p24 + p240 + p241 + p244 + p245 + p246 + p248 + p249 + p252 + p256 + p258 + p260 + p262 + p275 + p287 + p289 + p290 + p293 + p299 + p3 + p300 + p301 + p302 + p305 + p306 + p309 + p310 + p311 + p313 + p328 + p330 + p340 + p342 + p343 + p346 + p352 + p354 + p355 + p358 + p364 + p366 + p381 + p393 + p395 + p396 + p399 + p4 + p405 + p406 + p407 + p408 + p409 + p411 + p417 + p419 + p432 + p434 + p446 + p448 + p449 + p452 + p453 + p458 + p460 + p461 + p464 + p468 + p470 + p472 + p485 + p487 + p499 + p500 + p502 + p505 + p517 + p521 + p523 + p525 + p527 + p63 + p65 + p69 + p70 + p71 = 1
inv : p214 - p216 + p217 - p219 + p240 + p252 + p310 = 0
inv : p56 - p57 + p59 - p60 + p81 + p93 = 0
inv : p479 - p481 + p482 - p484 + p505 + p517 = 0
inv : p267 - p269 + p270 - p272 + p293 + p300 + p305 = 0
inv : p101 + p104 + p106 + p116 + p128 + p130 + p131 + p133 + p134 + p14 + p140 + p141 + p142 + p143 + p146 + p152 + p154 + p16 + p169 + p174 + p179 + p181 + p183 + p184 + p187 + p193 + p195 + p196 + p199 + p203 + p205 + p207 + p22 + p222 + p234 + p236 + p237 + p238 + p24 + p240 + p241 + p244 + p245 + p246 + p248 + p249 + p252 + p256 + p258 + p260 + p262 + p275 + p287 + p289 + p290 + p293 + p299 + p3 + p300 + p301 + p302 + p305 + p306 + p309 + p310 + p311 + p313 + p328 + p330 + p340 + p342 + p343 + p346 + p352 + p354 + p355 + p358 + p364 + p366 + p381 + p393 + p395 + p396 + p399 + p4 + p405 + p406 + p407 + p408 + p409 + p411 + p417 + p419 + p432 + p434 + p446 + p448 + p449 + p452 + p453 + p458 + p460 + p461 + p464 + p468 + p470 + p472 + p485 + p487 + p499 + p500 + p502 + p505 + p517 + p521 + p523 + p525 + p527 + p63 + p65 + p70 + p75 + p77 + p78 + p81 + p87 + p89 + p90 + p91 + p93 + p99 = 1
inv : p101 + p116 + p128 + p130 + p131 + p133 + p134 + p14 + p140 + p141 + p142 + p143 + p146 + p152 + p154 + p16 + p169 + p174 + p179 + p181 + p183 + p184 + p187 + p193 + p195 + p196 + p199 + p203 + p205 + p207 + p222 + p234 + p236 + p237 + p238 + p240 + p241 + p244 + p245 + p246 + p248 + p249 + p252 + p256 + p258 + p260 + p262 + p275 + p28 + p287 + p289 + p290 + p293 + p299 + p3 + p30 + p300 + p301 + p302 + p305 + p306 + p309 + p31 + p310 + p311 + p313 + p328 + p330 + p34 + p340 + p342 + p343 + p346 + p352 + p354 + p355 + p358 + p364 + p366 + p381 + p393 + p395 + p396 + p399 + p4 + p40 + p405 + p406 + p407 + p408 + p409 + p411 + p417 + p419 + p42 + p43 + p432 + p434 + p446 + p448 + p449 + p452 + p453 + p458 + p46 + p460 + p461 + p464 + p468 + p470 + p472 + p485 + p487 + p499 + p500 + p502 + p505 + p517 + p52 + p521 + p523 + p525 + p527 + p54 + p63 + p65 + p70 + p75 + p77 + p78 + p81 + p87 + p89 + p90 + p91 + p93 + p99 = 1
inv : p109 - p110 + p112 - p113 + p134 + p146 = 0
inv : p3 + p4 + p8 + p9 = 2
inv : p161 - p163 + p164 - p166 + p187 + p199 = 0
inv : p373 - p375 + p376 - p378 + p399 + p406 + p409 + p411 = 0
Total of 31 invariants.
[2020-05-22 08:33:15] [INFO ] Computed 31 place invariants in 11 ms
[2020-05-22 08:33:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=3 took 27 ms
[2020-05-22 08:33:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-05(UNSAT) depth K=3 took 15 ms
[2020-05-22 08:33:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=3 took 8 ms
[2020-05-22 08:33:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=3 took 2 ms
Loading property file ReachabilityFireability.prop.
[2020-05-22 08:33:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=3 took 16 ms
[2020-05-22 08:33:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-12(UNSAT) depth K=3 took 1 ms
Read [invariant] property : DoubleExponent-PT-010-ReachabilityFireability-01 with value :(((((u31.p442<1)||(i5.u29.p460<1))||(((i2.u16.p310>=1)||((i1.i0.u1.p108>=1)&&(i1.i0.u6.p203>=1)))&&((i2.u10.p238>=1)||((i5.u27.p448>=1)&&(i5.u34.p528>=1)))))||((i4.i0.u28.p453>=1)&&(i1.i1.u8.p179>=1)))&&((((i0.u21.p4>=1)||(i7.u3.p133>=1))||(i5.u32.p500<1))||(i7.u37.p70<1)))
Read [reachable] property : DoubleExponent-PT-010-ReachabilityFireability-04 with value :(i2.u11.p245>=1)
Read [invariant] property : DoubleExponent-PT-010-ReachabilityFireability-05 with value :(((i1.i1.u5.p183<1)||(i1.i1.u12.p263<1))||((i7.u39.p91>=1)&&(i2.u10.p241>=1)))
Read [invariant] property : DoubleExponent-PT-010-ReachabilityFireability-06 with value :(i2.u15.p306<1)
Read [reachable] property : DoubleExponent-PT-010-ReachabilityFireability-07 with value :(i3.i1.u14.p300>=1)
Read [invariant] property : DoubleExponent-PT-010-ReachabilityFireability-10 with value :((i4.i1.u22.p373<1)||(i4.i0.u28.p468<1))
Read [invariant] property : DoubleExponent-PT-010-ReachabilityFireability-12 with value :(i4.i1.u23.p409<1)
built 17 ordering constraints for composite.
built 34 ordering constraints for composite.
built 30 ordering constraints for composite.
built 26 ordering constraints for composite.
built 21 ordering constraints for composite.
built 26 ordering constraints for composite.
built 18 ordering constraints for composite.
built 20 ordering constraints for composite.
built 22 ordering constraints for composite.
built 31 ordering constraints for composite.
built 28 ordering constraints for composite.
built 21 ordering constraints for composite.
built 10 ordering constraints for composite.
built 20 ordering constraints for composite.
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
[2020-05-22 08:33:15] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-01(UNSAT) depth K=4 took 49 ms
SDD proceeding with computation, new max is 512
[2020-05-22 08:33:16] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=4 took 76 ms
SDD proceeding with computation, new max is 1024
[2020-05-22 08:33:16] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-05(UNSAT) depth K=4 took 16 ms
[2020-05-22 08:33:16] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=4 took 21 ms
[2020-05-22 08:33:16] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=4 took 19 ms
[2020-05-22 08:33:16] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=4 took 23 ms
[2020-05-22 08:33:16] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-12(UNSAT) depth K=4 took 14 ms
SDD proceeding with computation, new max is 2048
[2020-05-22 08:33:16] [INFO ] Proved 233 variables to be positive in 1459 ms
[2020-05-22 08:33:16] [INFO ] Computing symmetric may disable matrix : 238 transitions.
[2020-05-22 08:33:16] [INFO ] Computation of disable matrix completed :0/238 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 08:33:16] [INFO ] Computation of Complete disable matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 08:33:16] [INFO ] Computing symmetric may enable matrix : 238 transitions.
[2020-05-22 08:33:16] [INFO ] Computation of Complete enable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 08:33:16] [INFO ] Proved 233 variables to be positive in 959 ms
[2020-05-22 08:33:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-01
[2020-05-22 08:33:16] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-01(SAT) depth K=0 took 18 ms
[2020-05-22 08:33:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-04
[2020-05-22 08:33:16] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-04(SAT) depth K=0 took 8 ms
[2020-05-22 08:33:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-05
[2020-05-22 08:33:16] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-05(SAT) depth K=0 took 6 ms
[2020-05-22 08:33:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-06
[2020-05-22 08:33:16] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-06(SAT) depth K=0 took 7 ms
[2020-05-22 08:33:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-07
[2020-05-22 08:33:16] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-07(SAT) depth K=0 took 8 ms
[2020-05-22 08:33:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-10
[2020-05-22 08:33:16] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-10(SAT) depth K=0 took 7 ms
[2020-05-22 08:33:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-12
[2020-05-22 08:33:16] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-12(SAT) depth K=0 took 7 ms
SDD proceeding with computation, new max is 4096
[2020-05-22 08:33:16] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-01(UNSAT) depth K=5 took 773 ms
[2020-05-22 08:33:16] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=5 took 79 ms
[2020-05-22 08:33:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-01
[2020-05-22 08:33:16] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-01(SAT) depth K=1 took 156 ms
[2020-05-22 08:33:17] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-05(UNSAT) depth K=5 took 29 ms
[2020-05-22 08:33:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-04
[2020-05-22 08:33:17] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-04(SAT) depth K=1 took 37 ms
[2020-05-22 08:33:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-05
[2020-05-22 08:33:17] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-05(SAT) depth K=1 took 27 ms
[2020-05-22 08:33:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-06
[2020-05-22 08:33:17] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-06(SAT) depth K=1 took 50 ms
[2020-05-22 08:33:17] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=5 took 174 ms
[2020-05-22 08:33:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-07
[2020-05-22 08:33:17] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-07(SAT) depth K=1 took 74 ms
[2020-05-22 08:33:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-10
[2020-05-22 08:33:17] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-10(SAT) depth K=1 took 33 ms
[2020-05-22 08:33:17] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=5 took 59 ms
[2020-05-22 08:33:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-12
[2020-05-22 08:33:17] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-12(SAT) depth K=1 took 21 ms
[2020-05-22 08:33:17] [INFO ] Computing symmetric co enabling matrix : 238 transitions.
[2020-05-22 08:33:17] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=5 took 63 ms
[2020-05-22 08:33:17] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-12(UNSAT) depth K=5 took 105 ms
[2020-05-22 08:33:17] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-01(UNSAT) depth K=6 took 202 ms
[2020-05-22 08:33:17] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=6 took 261 ms
[2020-05-22 08:33:18] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-05(UNSAT) depth K=6 took 543 ms
[2020-05-22 08:33:19] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=6 took 628 ms
[2020-05-22 08:33:19] [INFO ] Computation of co-enabling matrix(14/238) took 2545 ms. Total solver calls (SAT/UNSAT): 3450(2/3448)
[2020-05-22 08:33:20] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=6 took 1126 ms
[2020-05-22 08:33:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-01
[2020-05-22 08:33:20] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-01(SAT) depth K=2 took 3177 ms
[2020-05-22 08:33:21] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=6 took 1392 ms
[2020-05-22 08:33:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-04
[2020-05-22 08:33:21] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-04(SAT) depth K=2 took 1248 ms
[2020-05-22 08:33:22] [INFO ] Computation of co-enabling matrix(46/238) took 5605 ms. Total solver calls (SAT/UNSAT): 10058(4/10054)
[2020-05-22 08:33:23] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-12(UNSAT) depth K=6 took 1642 ms
SDD proceeding with computation, new max is 8192
[2020-05-22 08:33:25] [INFO ] Computation of co-enabling matrix(87/238) took 8637 ms. Total solver calls (SAT/UNSAT): 17028(5/17023)
[2020-05-22 08:33:26] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-01(UNSAT) depth K=7 took 2843 ms
[2020-05-22 08:33:26] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=7 took 823 ms
[2020-05-22 08:33:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-05
[2020-05-22 08:33:28] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-05(SAT) depth K=2 took 6874 ms
[2020-05-22 08:33:29] [INFO ] Computation of co-enabling matrix(105/238) took 12099 ms. Total solver calls (SAT/UNSAT): 19557(10/19547)
[2020-05-22 08:33:32] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-06
[2020-05-22 08:33:32] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-06(SAT) depth K=2 took 3486 ms
[2020-05-22 08:33:32] [INFO ] Computation of co-enabling matrix(127/238) took 15349 ms. Total solver calls (SAT/UNSAT): 22208(21/22187)
[2020-05-22 08:33:35] [INFO ] Computation of co-enabling matrix(148/238) took 18443 ms. Total solver calls (SAT/UNSAT): 24287(28/24259)
[2020-05-22 08:33:37] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-07
[2020-05-22 08:33:37] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-07(SAT) depth K=2 took 5217 ms
[2020-05-22 08:33:38] [INFO ] Computation of co-enabling matrix(176/238) took 21536 ms. Total solver calls (SAT/UNSAT): 26373(38/26335)
[2020-05-22 08:33:39] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-10
[2020-05-22 08:33:39] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-10(SAT) depth K=2 took 2569 ms
[2020-05-22 08:33:41] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-05(UNSAT) depth K=7 took 14543 ms
[2020-05-22 08:33:42] [INFO ] Computation of co-enabling matrix(203/238) took 24872 ms. Total solver calls (SAT/UNSAT): 27642(48/27594)
SDD proceeding with computation, new max is 16384
[2020-05-22 08:33:45] [INFO ] Computation of co-enabling matrix(235/238) took 27886 ms. Total solver calls (SAT/UNSAT): 28202(56/28146)
[2020-05-22 08:33:45] [INFO ] Computation of Finished co-enabling matrix. took 27924 ms. Total solver calls (SAT/UNSAT): 28203(56/28147)
[2020-05-22 08:33:45] [INFO ] Computing Do-Not-Accords matrix : 238 transitions.
[2020-05-22 08:33:45] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 08:33:45] [INFO ] Built C files in 30302ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
[2020-05-22 08:33:46] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=7 took 5310 ms
[2020-05-22 08:33:46] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=7 took 267 ms
[2020-05-22 08:33:47] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=7 took 324 ms
[2020-05-22 08:33:47] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-12(UNSAT) depth K=7 took 205 ms
Compilation finished in 2415 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 48 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT010ReachabilityFireability01==true], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT010ReachabilityFireability01==true], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT010ReachabilityFireability01==true], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-22 08:33:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-12
[2020-05-22 08:33:48] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-12(SAT) depth K=2 took 8559 ms
[2020-05-22 08:33:49] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-01(UNSAT) depth K=8 took 1915 ms
[2020-05-22 08:33:51] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=8 took 2277 ms
[2020-05-22 08:33:53] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-05(UNSAT) depth K=8 took 1320 ms
[2020-05-22 08:33:56] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=8 took 3311 ms
[2020-05-22 08:33:58] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=8 took 1890 ms
[2020-05-22 08:34:01] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=8 took 3311 ms
[2020-05-22 08:34:05] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-12(UNSAT) depth K=8 took 3963 ms
[2020-05-22 08:34:06] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-01
[2020-05-22 08:34:06] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-01(SAT) depth K=3 took 18136 ms
[2020-05-22 08:34:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-04
[2020-05-22 08:34:16] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-04(SAT) depth K=3 took 10065 ms
[2020-05-22 08:34:20] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-01(UNSAT) depth K=9 took 15113 ms
[2020-05-22 08:34:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-05
[2020-05-22 08:34:25] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-05(SAT) depth K=3 took 8557 ms
[2020-05-22 08:34:25] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=9 took 4916 ms
[2020-05-22 08:34:34] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-06
[2020-05-22 08:34:34] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-06(SAT) depth K=3 took 9333 ms
[2020-05-22 08:34:35] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-05(UNSAT) depth K=9 took 9763 ms
[2020-05-22 08:34:36] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=9 took 733 ms
[2020-05-22 08:34:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=9 took 4090 ms
[2020-05-22 08:34:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-07
[2020-05-22 08:34:45] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-07(SAT) depth K=3 took 10627 ms
[2020-05-22 08:34:46] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=9 took 6814 ms
[2020-05-22 08:34:57] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-12(UNSAT) depth K=9 took 10333 ms
[2020-05-22 08:35:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-10
[2020-05-22 08:35:21] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-10(SAT) depth K=3 took 36032 ms
[2020-05-22 08:35:29] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-01(UNSAT) depth K=10 took 32447 ms
[2020-05-22 08:35:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-12
[2020-05-22 08:35:41] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-12(SAT) depth K=3 took 20589 ms
[2020-05-22 08:35:46] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=10 took 16278 ms
[2020-05-22 08:36:01] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-05(UNSAT) depth K=10 took 15142 ms
[2020-05-22 08:36:10] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=10 took 8876 ms
[2020-05-22 08:36:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-01
[2020-05-22 08:36:17] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-01(SAT) depth K=4 took 36015 ms
[2020-05-22 08:36:19] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=10 took 8964 ms
SDD proceeding with computation, new max is 32768
[2020-05-22 08:36:27] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=10 took 8631 ms
[2020-05-22 08:36:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-04
[2020-05-22 08:36:45] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-04(SAT) depth K=4 took 27565 ms
[2020-05-22 08:36:59] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-12(UNSAT) depth K=10 took 31728 ms
[2020-05-22 08:37:02] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-05
[2020-05-22 08:37:02] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-05(SAT) depth K=4 took 17279 ms
[2020-05-22 08:37:03] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-01(UNSAT) depth K=11 took 3914 ms
[2020-05-22 08:37:21] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=11 took 18130 ms
[2020-05-22 08:37:35] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-05(UNSAT) depth K=11 took 14086 ms
[2020-05-22 08:37:46] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-06
[2020-05-22 08:37:46] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-06(SAT) depth K=4 took 43672 ms
[2020-05-22 08:37:49] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=11 took 14047 ms
[2020-05-22 08:38:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-07
[2020-05-22 08:38:05] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-07(SAT) depth K=4 took 19030 ms
[2020-05-22 08:38:20] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=11 took 31243 ms
[2020-05-22 08:38:30] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=11 took 9985 ms
[2020-05-22 08:38:34] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-12(UNSAT) depth K=11 took 3987 ms
[2020-05-22 08:38:41] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-01(UNSAT) depth K=12 took 6306 ms
[2020-05-22 08:39:00] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-10
[2020-05-22 08:39:00] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-10(SAT) depth K=4 took 55216 ms
[2020-05-22 08:39:04] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=12 took 23076 ms
[2020-05-22 08:39:32] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-05(UNSAT) depth K=12 took 28346 ms
[2020-05-22 08:39:51] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-12
[2020-05-22 08:39:51] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-12(SAT) depth K=4 took 50620 ms
[2020-05-22 08:40:01] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=12 took 29497 ms
[2020-05-22 08:40:36] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-01
[2020-05-22 08:40:36] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-01(SAT) depth K=5 took 44945 ms
[2020-05-22 08:41:05] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=12 took 63986 ms
[2020-05-22 08:41:25] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=12 took 19249 ms
[2020-05-22 08:41:26] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-04
[2020-05-22 08:41:26] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-04(SAT) depth K=5 took 50645 ms
[2020-05-22 08:41:51] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-05
[2020-05-22 08:41:51] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-05(SAT) depth K=5 took 24501 ms
[2020-05-22 08:41:57] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-12(UNSAT) depth K=12 took 32056 ms
[2020-05-22 08:43:00] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-01(UNSAT) depth K=13 took 62962 ms
[2020-05-22 08:43:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-06
[2020-05-22 08:43:09] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-06(SAT) depth K=5 took 78760 ms
[2020-05-22 08:43:22] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=13 took 22444 ms
[2020-05-22 08:43:53] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-07
[2020-05-22 08:43:53] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-07(SAT) depth K=5 took 43705 ms
[2020-05-22 08:44:36] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-10
[2020-05-22 08:44:36] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-10(SAT) depth K=5 took 42989 ms
[2020-05-22 08:44:39] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-05(UNSAT) depth K=13 took 77146 ms
[2020-05-22 08:45:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-12
[2020-05-22 08:45:05] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-12(SAT) depth K=5 took 28516 ms
[2020-05-22 08:46:23] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-01
[2020-05-22 08:46:23] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-01(SAT) depth K=6 took 77902 ms
[2020-05-22 08:47:44] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=13 took 184219 ms
[2020-05-22 08:47:59] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-04
[2020-05-22 08:47:59] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-04(SAT) depth K=6 took 96852 ms
[2020-05-22 08:49:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-05
[2020-05-22 08:49:01] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-05(SAT) depth K=6 took 61395 ms
[2020-05-22 08:49:51] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-06
[2020-05-22 08:49:51] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-06(SAT) depth K=6 took 49710 ms
[2020-05-22 08:51:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-07
[2020-05-22 08:51:28] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-07(SAT) depth K=6 took 97247 ms
Detected timeout of ITS tools.
[2020-05-22 08:55:43] [INFO ] Flatten gal took : 19 ms
[2020-05-22 08:55:43] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 5 ms
[2020-05-22 08:55:43] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityFireability.pnml.gal, -t, CGAL, -reachable-file, ReachabilityFireability.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness --gen-order FOLLOW
Loading property file ReachabilityFireability.prop.
Read [invariant] property : DoubleExponent-PT-010-ReachabilityFireability-01 with value :(((((p442<1)||(p460<1))||(((p310>=1)||((p108>=1)&&(p203>=1)))&&((p238>=1)||((p448>=1)&&(p528>=1)))))||((p453>=1)&&(p179>=1)))&&((((p4>=1)||(p133>=1))||(p500<1))||(p70<1)))
Read [reachable] property : DoubleExponent-PT-010-ReachabilityFireability-04 with value :(p245>=1)
Read [invariant] property : DoubleExponent-PT-010-ReachabilityFireability-05 with value :(((p183<1)||(p263<1))||((p91>=1)&&(p241>=1)))
Read [invariant] property : DoubleExponent-PT-010-ReachabilityFireability-06 with value :(p306<1)
Read [reachable] property : DoubleExponent-PT-010-ReachabilityFireability-07 with value :(p300>=1)
Read [invariant] property : DoubleExponent-PT-010-ReachabilityFireability-10 with value :((p373<1)||(p468<1))
Read [invariant] property : DoubleExponent-PT-010-ReachabilityFireability-12 with value :(p409<1)
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
SDD proceeding with computation, new max is 8192
SDD proceeding with computation, new max is 16384
SDD proceeding with computation, new max is 32768
SDD proceeding with computation, new max is 65536
SDD proceeding with computation, new max is 131072
SDD proceeding with computation, new max is 262144
[2020-05-22 08:57:33] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-10
[2020-05-22 08:57:33] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-10(SAT) depth K=6 took 365595 ms
SDD proceeding with computation, new max is 524288
[2020-05-22 08:59:03] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-12
[2020-05-22 08:59:03] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-12(SAT) depth K=6 took 89886 ms
[2020-05-22 09:00:06] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=13 took 742754 ms
SDD proceeding with computation, new max is 1048576
[2020-05-22 09:01:09] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=13 took 62328 ms
[2020-05-22 09:01:50] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-01
[2020-05-22 09:01:50] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-01(SAT) depth K=7 took 166380 ms
[2020-05-22 09:01:51] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-12(UNSAT) depth K=13 took 42088 ms
[2020-05-22 09:02:11] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-01(UNSAT) depth K=14 took 20196 ms
[2020-05-22 09:02:48] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=14 took 36705 ms
[2020-05-22 09:03:29] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-05(UNSAT) depth K=14 took 40927 ms
SDD proceeding with computation, new max is 2097152
[2020-05-22 09:06:21] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=14 took 172732 ms
[2020-05-22 09:06:40] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-04
[2020-05-22 09:06:40] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-04(SAT) depth K=7 took 290618 ms
[2020-05-22 09:06:49] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=14 took 27392 ms
[2020-05-22 09:07:28] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=14 took 39647 ms
[2020-05-22 09:08:02] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-12(UNSAT) depth K=14 took 33863 ms
[2020-05-22 09:10:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-05
[2020-05-22 09:10:49] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-05(SAT) depth K=7 took 249064 ms
SDD proceeding with computation, new max is 4194304
[2020-05-22 09:12:27] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-06
[2020-05-22 09:12:27] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-06(SAT) depth K=7 took 97197 ms
[2020-05-22 09:13:19] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-01(UNSAT) depth K=15 took 316897 ms
[2020-05-22 09:14:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-07
[2020-05-22 09:14:25] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-07(SAT) depth K=7 took 118818 ms
[2020-05-22 09:14:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=15 took 95632 ms
[2020-05-22 09:18:11] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-10
[2020-05-22 09:18:11] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-10(SAT) depth K=7 took 225521 ms
Detected timeout of ITS tools.
[2020-05-22 09:18:12] [INFO ] Flatten gal took : 151 ms
[2020-05-22 09:18:13] [INFO ] Input system was already deterministic with 238 transitions.
[2020-05-22 09:18:13] [INFO ] Transformed 233 places.
[2020-05-22 09:18:13] [INFO ] Transformed 238 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-22 09:18:13] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 6 ms
[2020-05-22 09:18:13] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityFireability.pnml.gal, -t, CGAL, -reachable-file, ReachabilityFireability.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file ReachabilityFireability.prop.
Read [invariant] property : DoubleExponent-PT-010-ReachabilityFireability-01 with value :(((((p442<1)||(p460<1))||(((p310>=1)||((p108>=1)&&(p203>=1)))&&((p238>=1)||((p448>=1)&&(p528>=1)))))||((p453>=1)&&(p179>=1)))&&((((p4>=1)||(p133>=1))||(p500<1))||(p70<1)))
Read [reachable] property : DoubleExponent-PT-010-ReachabilityFireability-04 with value :(p245>=1)
Read [invariant] property : DoubleExponent-PT-010-ReachabilityFireability-05 with value :(((p183<1)||(p263<1))||((p91>=1)&&(p241>=1)))
Read [invariant] property : DoubleExponent-PT-010-ReachabilityFireability-06 with value :(p306<1)
Read [reachable] property : DoubleExponent-PT-010-ReachabilityFireability-07 with value :(p300>=1)
Read [invariant] property : DoubleExponent-PT-010-ReachabilityFireability-10 with value :((p373<1)||(p468<1))
Read [invariant] property : DoubleExponent-PT-010-ReachabilityFireability-12 with value :(p409<1)
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
SDD proceeding with computation, new max is 8192
SDD proceeding with computation, new max is 16384
SDD proceeding with computation, new max is 32768
SDD proceeding with computation, new max is 65536
[2020-05-22 09:19:04] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-05(UNSAT) depth K=15 took 249032 ms
SDD proceeding with computation, new max is 131072
[2020-05-22 09:20:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-12
[2020-05-22 09:20:01] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-12(SAT) depth K=7 took 110069 ms
[2020-05-22 09:22:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-01
[2020-05-22 09:22:24] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-01(SAT) depth K=8 took 143198 ms
SDD proceeding with computation, new max is 262144
[2020-05-22 09:24:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-04
[2020-05-22 09:24:28] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-04(SAT) depth K=8 took 123999 ms
[2020-05-22 09:25:46] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=15 took 402655 ms

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="DoubleExponent-PT-010"
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"

# 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-4028"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-010, 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 r066-tajo-158922814800783"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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