Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r151-tall-162089151400316.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is Peterson-PT-5, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-tall-162089151400316
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.8M
-rw-r--r-- 1 mcc users 562K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.1M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 612K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.7M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 52K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 165K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 60K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 201K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 69K Mar 27 07:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Mar 27 07:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 47K Mar 25 08:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 154K Mar 25 08:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 26K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 927K May 5 16:51 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 Peterson-PT-5-ReachabilityFireability-00
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-01
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-02
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-03
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-04
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-05
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-06
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-07
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-08
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-09
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-10
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-11
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-12
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-13
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-14
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621027057919

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 21:17:39] [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, -timeout, 3600, -rebuildPNML]
[2021-05-14 21:17:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 21:17:39] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2021-05-14 21:17:39] [INFO ] Transformed 834 places.
[2021-05-14 21:17:39] [INFO ] Transformed 1242 transitions.
[2021-05-14 21:17:39] [INFO ] Found NUPN structural information;
[2021-05-14 21:17:39] [INFO ] Parsed PT model containing 834 places and 1242 transitions in 179 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 57 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-5-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 194 ms. (steps per millisecond=51 ) properties seen :[0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA Peterson-PT-5-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 128 ms. (steps per millisecond=78 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 215 ms. (steps per millisecond=46 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA Peterson-PT-5-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
[2021-05-14 21:17:40] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2021-05-14 21:17:40] [INFO ] Computed 23 place invariants in 36 ms
[2021-05-14 21:17:41] [INFO ] [Real]Absence check using 17 positive place invariants in 118 ms returned sat
[2021-05-14 21:17:41] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 25 ms returned sat
[2021-05-14 21:17:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:17:45] [INFO ] [Real]Absence check using state equation in 4496 ms returned sat
[2021-05-14 21:17:45] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 21:17:45] [INFO ] [Real]Added 230 Read/Feed constraints in 65 ms returned sat
[2021-05-14 21:17:46] [INFO ] Deduced a trap composed of 2 places in 580 ms
[2021-05-14 21:17:46] [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 (> (+ s399 s401) 0)") while checking expression at index 0
[2021-05-14 21:17:46] [INFO ] [Real]Absence check using 17 positive place invariants in 39 ms returned sat
[2021-05-14 21:17:46] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 8 ms returned sat
[2021-05-14 21:17:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:17:48] [INFO ] [Real]Absence check using state equation in 1604 ms returned sat
[2021-05-14 21:17:48] [INFO ] [Real]Added 230 Read/Feed constraints in 142 ms returned sat
[2021-05-14 21:17:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:17:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 148 ms returned sat
[2021-05-14 21:17:48] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 14 ms returned sat
[2021-05-14 21:17:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:17:50] [INFO ] [Nat]Absence check using state equation in 1654 ms returned sat
[2021-05-14 21:17:50] [INFO ] [Nat]Added 230 Read/Feed constraints in 61 ms returned sat
[2021-05-14 21:17:51] [INFO ] Deduced a trap composed of 11 places in 568 ms
[2021-05-14 21:17:51] [INFO ] Deduced a trap composed of 51 places in 358 ms
[2021-05-14 21:17:51] [INFO ] Deduced a trap composed of 11 places in 376 ms
[2021-05-14 21:17:52] [INFO ] Deduced a trap composed of 63 places in 363 ms
[2021-05-14 21:17:52] [INFO ] Deduced a trap composed of 37 places in 323 ms
[2021-05-14 21:17:52] [INFO ] Deduced a trap composed of 37 places in 310 ms
[2021-05-14 21:17:53] [INFO ] Deduced a trap composed of 11 places in 359 ms
[2021-05-14 21:17:53] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 21:17:53] [INFO ] Deduced a trap composed of 2 places in 527 ms
[2021-05-14 21:17:53] [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 (> (+ s399 s401) 0)") while checking expression at index 1
[2021-05-14 21:17:54] [INFO ] [Real]Absence check using 17 positive place invariants in 33 ms returned sat
[2021-05-14 21:17:54] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 21:17:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:17:55] [INFO ] [Real]Absence check using state equation in 1386 ms returned sat
[2021-05-14 21:17:55] [INFO ] [Real]Added 230 Read/Feed constraints in 29 ms returned sat
[2021-05-14 21:17:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:17:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 86 ms returned sat
[2021-05-14 21:17:55] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 21:17:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:17:57] [INFO ] [Nat]Absence check using state equation in 1355 ms returned sat
[2021-05-14 21:17:57] [INFO ] [Nat]Added 230 Read/Feed constraints in 51 ms returned sat
[2021-05-14 21:17:57] [INFO ] Deduced a trap composed of 41 places in 296 ms
[2021-05-14 21:17:57] [INFO ] Deduced a trap composed of 37 places in 296 ms
[2021-05-14 21:17:58] [INFO ] Deduced a trap composed of 37 places in 290 ms
[2021-05-14 21:17:58] [INFO ] Deduced a trap composed of 37 places in 298 ms
[2021-05-14 21:17:58] [INFO ] Deduced a trap composed of 48 places in 290 ms
[2021-05-14 21:17:59] [INFO ] Deduced a trap composed of 37 places in 295 ms
[2021-05-14 21:17:59] [INFO ] Deduced a trap composed of 59 places in 291 ms
[2021-05-14 21:17:59] [INFO ] Deduced a trap composed of 59 places in 294 ms
[2021-05-14 21:18:00] [INFO ] Deduced a trap composed of 127 places in 290 ms
[2021-05-14 21:18:00] [INFO ] Deduced a trap composed of 27 places in 309 ms
[2021-05-14 21:18:00] [INFO ] Deduced a trap composed of 28 places in 307 ms
[2021-05-14 21:18:00] [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 s175 s186 s207 s214 s215 s250 s387 s391 s396 s401 s436 s519 s522 s528 s578 s614 s615 s624 s721 s784 s786 s787 s793 s797 s802 s818 s827) 0)") while checking expression at index 2
[2021-05-14 21:18:00] [INFO ] [Real]Absence check using 17 positive place invariants in 34 ms returned sat
[2021-05-14 21:18:00] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 21:18:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:18:02] [INFO ] [Real]Absence check using state equation in 1382 ms returned sat
[2021-05-14 21:18:02] [INFO ] [Real]Added 230 Read/Feed constraints in 28 ms returned sat
[2021-05-14 21:18:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:18:02] [INFO ] [Nat]Absence check using 17 positive place invariants in 40 ms returned sat
[2021-05-14 21:18:02] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 21:18:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:18:03] [INFO ] [Nat]Absence check using state equation in 1352 ms returned sat
[2021-05-14 21:18:03] [INFO ] [Nat]Added 230 Read/Feed constraints in 49 ms returned sat
[2021-05-14 21:18:04] [INFO ] Deduced a trap composed of 51 places in 370 ms
[2021-05-14 21:18:04] [INFO ] Deduced a trap composed of 51 places in 371 ms
[2021-05-14 21:18:05] [INFO ] Deduced a trap composed of 51 places in 442 ms
[2021-05-14 21:18:05] [INFO ] Deduced a trap composed of 51 places in 369 ms
[2021-05-14 21:18:06] [INFO ] Deduced a trap composed of 51 places in 370 ms
[2021-05-14 21:18:06] [INFO ] Deduced a trap composed of 32 places in 371 ms
[2021-05-14 21:18:06] [INFO ] Deduced a trap composed of 29 places in 367 ms
[2021-05-14 21:18:07] [INFO ] Deduced a trap composed of 67 places in 372 ms
[2021-05-14 21:18:07] [INFO ] Deduced a trap composed of 27 places in 311 ms
[2021-05-14 21:18:07] [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 (> (+ s173 s175 s206 s209 s215 s382 s394 s396 s401 s517 s519 s529 s615 s617 s621 s721 s724 s786 s793 s795 s797 s798 s802 s803 s814 s818 s824) 0)") while checking expression at index 3
[2021-05-14 21:18:07] [INFO ] [Real]Absence check using 17 positive place invariants in 33 ms returned sat
[2021-05-14 21:18:07] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 21:18:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:18:09] [INFO ] [Real]Absence check using state equation in 1318 ms returned sat
[2021-05-14 21:18:09] [INFO ] [Real]Added 230 Read/Feed constraints in 29 ms returned sat
[2021-05-14 21:18:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:18:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 82 ms returned sat
[2021-05-14 21:18:09] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 21:18:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:18:10] [INFO ] [Nat]Absence check using state equation in 1315 ms returned sat
[2021-05-14 21:18:10] [INFO ] [Nat]Added 230 Read/Feed constraints in 51 ms returned sat
[2021-05-14 21:18:11] [INFO ] Deduced a trap composed of 28 places in 322 ms
[2021-05-14 21:18:11] [INFO ] Deduced a trap composed of 28 places in 323 ms
[2021-05-14 21:18:11] [INFO ] Deduced a trap composed of 56 places in 324 ms
[2021-05-14 21:18:12] [INFO ] Deduced a trap composed of 32 places in 336 ms
[2021-05-14 21:18:12] [INFO ] Deduced a trap composed of 41 places in 331 ms
[2021-05-14 21:18:13] [INFO ] Deduced a trap composed of 11 places in 440 ms
[2021-05-14 21:18:13] [INFO ] Deduced a trap composed of 11 places in 335 ms
[2021-05-14 21:18:13] [INFO ] Deduced a trap composed of 58 places in 323 ms
[2021-05-14 21:18:14] [INFO ] Deduced a trap composed of 43 places in 348 ms
[2021-05-14 21:18:14] [INFO ] Deduced a trap composed of 11 places in 333 ms
[2021-05-14 21:18:14] [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 (> (+ s210 s383 s401 s518 s618 s724 s786 s798 s814 s817 s823) 0)") while checking expression at index 4
[2021-05-14 21:18:14] [INFO ] [Real]Absence check using 17 positive place invariants in 34 ms returned sat
[2021-05-14 21:18:14] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-14 21:18:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:18:16] [INFO ] [Real]Absence check using state equation in 1467 ms returned sat
[2021-05-14 21:18:16] [INFO ] [Real]Added 230 Read/Feed constraints in 48 ms returned sat
[2021-05-14 21:18:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:18:16] [INFO ] [Nat]Absence check using 17 positive place invariants in 82 ms returned sat
[2021-05-14 21:18:16] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-14 21:18:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:18:17] [INFO ] [Nat]Absence check using state equation in 1443 ms returned sat
[2021-05-14 21:18:17] [INFO ] [Nat]Added 230 Read/Feed constraints in 58 ms returned sat
[2021-05-14 21:18:18] [INFO ] Deduced a trap composed of 19 places in 307 ms
[2021-05-14 21:18:18] [INFO ] Deduced a trap composed of 220 places in 309 ms
[2021-05-14 21:18:18] [INFO ] Deduced a trap composed of 222 places in 277 ms
[2021-05-14 21:18:19] [INFO ] Deduced a trap composed of 26 places in 288 ms
[2021-05-14 21:18:19] [INFO ] Deduced a trap composed of 108 places in 275 ms
[2021-05-14 21:18:19] [INFO ] Deduced a trap composed of 108 places in 275 ms
[2021-05-14 21:18:20] [INFO ] Deduced a trap composed of 30 places in 294 ms
[2021-05-14 21:18:20] [INFO ] Deduced a trap composed of 26 places in 286 ms
[2021-05-14 21:18:20] [INFO ] Deduced a trap composed of 32 places in 285 ms
[2021-05-14 21:18:21] [INFO ] Deduced a trap composed of 97 places in 221 ms
[2021-05-14 21:18:21] [INFO ] Deduced a trap composed of 108 places in 221 ms
[2021-05-14 21:18:21] [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 (> (+ s5 s11 s18 s22 s33 s43 s46 s50 s61 s75 s78 s82 s97 s101 s107 s114 s130 s134 s140 s147 s149 s158 s172 s179 s194 s204 s211 s226 s230 s236 s237 s243 s258 s268 s275 s279 s290 s296 s303 s307 s322 s326 s332 s335 s339 s352 s354 s358 s371 s384 s385 s395 s408 s417 s420 s423 s428 s439 s444 s451 s456 s459 s465 s478 s496 s497 s502 s511 s526 s532 s536 s544 s547 s556 s587 s590 s600 s604 s605 s619 s626 s632 s636 s638 s644 s659 s663 s676 s691 s695 s697 s702 s716 s727 s731 s738 s748 s759 s763 s772 s778 s783 s789 s800 s811 s816 s819 s825) 0)") while checking expression at index 5
[2021-05-14 21:18:21] [INFO ] [Real]Absence check using 17 positive place invariants in 35 ms returned sat
[2021-05-14 21:18:21] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 21:18:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:18:22] [INFO ] [Real]Absence check using state equation in 1366 ms returned sat
[2021-05-14 21:18:22] [INFO ] [Real]Added 230 Read/Feed constraints in 28 ms returned sat
[2021-05-14 21:18:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:18:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 83 ms returned sat
[2021-05-14 21:18:23] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 21:18:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:18:24] [INFO ] [Nat]Absence check using state equation in 1348 ms returned sat
[2021-05-14 21:18:24] [INFO ] [Nat]Added 230 Read/Feed constraints in 54 ms returned sat
[2021-05-14 21:18:24] [INFO ] Deduced a trap composed of 18 places in 384 ms
[2021-05-14 21:18:25] [INFO ] Deduced a trap composed of 11 places in 386 ms
[2021-05-14 21:18:25] [INFO ] Deduced a trap composed of 11 places in 384 ms
[2021-05-14 21:18:26] [INFO ] Deduced a trap composed of 18 places in 389 ms
[2021-05-14 21:18:26] [INFO ] Deduced a trap composed of 11 places in 381 ms
[2021-05-14 21:18:26] [INFO ] Deduced a trap composed of 186 places in 388 ms
[2021-05-14 21:18:27] [INFO ] Deduced a trap composed of 32 places in 384 ms
[2021-05-14 21:18:27] [INFO ] Deduced a trap composed of 134 places in 382 ms
[2021-05-14 21:18:28] [INFO ] Deduced a trap composed of 11 places in 344 ms
[2021-05-14 21:18:28] [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 (> (+ s210 s383 s401 s518 s618 s724 s786 s798 s814 s817 s823) 0)") while checking expression at index 6
[2021-05-14 21:18:28] [INFO ] [Real]Absence check using 17 positive place invariants in 34 ms returned sat
[2021-05-14 21:18:28] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 21:18:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:18:29] [INFO ] [Real]Absence check using state equation in 1384 ms returned sat
[2021-05-14 21:18:29] [INFO ] [Real]Added 230 Read/Feed constraints in 27 ms returned sat
[2021-05-14 21:18:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:18:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 42 ms returned sat
[2021-05-14 21:18:29] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 21:18:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:18:31] [INFO ] [Nat]Absence check using state equation in 1357 ms returned sat
[2021-05-14 21:18:31] [INFO ] [Nat]Added 230 Read/Feed constraints in 64 ms returned sat
[2021-05-14 21:18:31] [INFO ] Deduced a trap composed of 15 places in 390 ms
[2021-05-14 21:18:32] [INFO ] Deduced a trap composed of 18 places in 392 ms
[2021-05-14 21:18:32] [INFO ] Deduced a trap composed of 28 places in 396 ms
[2021-05-14 21:18:33] [INFO ] Deduced a trap composed of 11 places in 385 ms
[2021-05-14 21:18:33] [INFO ] Deduced a trap composed of 15 places in 387 ms
[2021-05-14 21:18:33] [INFO ] Deduced a trap composed of 87 places in 390 ms
[2021-05-14 21:18:34] [INFO ] Deduced a trap composed of 14 places in 388 ms
[2021-05-14 21:18:34] [INFO ] Deduced a trap composed of 43 places in 385 ms
[2021-05-14 21:18:35] [INFO ] Deduced a trap composed of 73 places in 390 ms
[2021-05-14 21:18:35] [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 s6 s12 s17 s175 s177 s180 s186 s193 s196 s198 s203 s205 s212 s214 s215 s228 s229 s234 s235 s238 s244 s250 s251 s276 s381 s386 s391 s396 s401 s413 s418 s424 s431 s436 s442 s519 s522 s525 s530 s531 s534 s535 s540 s578 s579 s588 s589 s599 s611 s614 s615 s620 s622 s625 s628 s631 s634 s766 s771 s777 s780 s784 s786 s787 s790 s791 s793 s799 s810 s813 s820 s826) 0)") while checking expression at index 7
[2021-05-14 21:18:35] [INFO ] [Real]Absence check using 17 positive place invariants in 33 ms returned sat
[2021-05-14 21:18:35] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-14 21:18:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:18:36] [INFO ] [Real]Absence check using state equation in 1344 ms returned sat
[2021-05-14 21:18:36] [INFO ] [Real]Added 230 Read/Feed constraints in 25 ms returned sat
[2021-05-14 21:18:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:18:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 40 ms returned sat
[2021-05-14 21:18:36] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 21:18:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:18:38] [INFO ] [Nat]Absence check using state equation in 1315 ms returned sat
[2021-05-14 21:18:38] [INFO ] [Nat]Added 230 Read/Feed constraints in 51 ms returned sat
[2021-05-14 21:18:38] [INFO ] Deduced a trap composed of 11 places in 386 ms
[2021-05-14 21:18:39] [INFO ] Deduced a trap composed of 11 places in 383 ms
[2021-05-14 21:18:39] [INFO ] Deduced a trap composed of 11 places in 386 ms
[2021-05-14 21:18:39] [INFO ] Deduced a trap composed of 11 places in 384 ms
[2021-05-14 21:18:40] [INFO ] Deduced a trap composed of 18 places in 400 ms
[2021-05-14 21:18:40] [INFO ] Deduced a trap composed of 11 places in 380 ms
[2021-05-14 21:18:41] [INFO ] Deduced a trap composed of 78 places in 363 ms
[2021-05-14 21:18:41] [INFO ] Deduced a trap composed of 78 places in 355 ms
[2021-05-14 21:18:41] [INFO ] Deduced a trap composed of 45 places in 361 ms
[2021-05-14 21:18: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 (> (+ s2 s9 s30 s37 s66 s87 s119 s144 s176 s207 s216 s239 s248 s253 s262 s285 s342 s374 s387 s392 s393 s426 s435 s462 s484 s508 s520 s528 s558 s584 s592 s616 s624 s647 s672 s679 s711 s721 s743 s788 s794 s797 s802 s818 s827) 0)") while checking expression at index 8
Support contains 473 out of 834 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 834/834 places, 1242/1242 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 834 transition count 1217
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 809 transition count 1217
Applied a total of 50 rules in 147 ms. Remains 809 /834 variables (removed 25) and now considering 1217/1242 (removed 25) transitions.
Finished structural reductions, in 1 iterations. Remains : 809/834 places, 1217/1242 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 12693 ms. (steps per millisecond=78 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 491218 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=98 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 376796 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=75 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2192 ms. (steps per millisecond=456 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2174 ms. (steps per millisecond=459 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2103 ms. (steps per millisecond=475 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2375 ms. (steps per millisecond=421 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2192 ms. (steps per millisecond=456 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0, 0]
FORMULA Peterson-PT-5-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2369 ms. (steps per millisecond=422 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2215 ms. (steps per millisecond=451 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
[2021-05-14 21:19:20] [INFO ] Flow matrix only has 1097 transitions (discarded 120 similar events)
// Phase 1: matrix 1097 rows 809 cols
[2021-05-14 21:19:20] [INFO ] Computed 23 place invariants in 15 ms
[2021-05-14 21:19:20] [INFO ] [Real]Absence check using 17 positive place invariants in 101 ms returned sat
[2021-05-14 21:19:20] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 25 ms returned sat
[2021-05-14 21:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:19:24] [INFO ] [Real]Absence check using state equation in 4165 ms returned sat
[2021-05-14 21:19:24] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 21:19:24] [INFO ] [Real]Added 230 Read/Feed constraints in 54 ms returned sat
[2021-05-14 21:19:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:19:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 210 ms returned sat
[2021-05-14 21:19:25] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 25 ms returned sat
[2021-05-14 21:19:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:19:29] [INFO ] [Nat]Absence check using state equation in 4534 ms returned sat
[2021-05-14 21:19:29] [INFO ] [Nat]Added 230 Read/Feed constraints in 68 ms returned sat
[2021-05-14 21:19:30] [INFO ] Deduced a trap composed of 11 places in 370 ms
[2021-05-14 21:19:30] [INFO ] Deduced a trap composed of 29 places in 372 ms
[2021-05-14 21:19:31] [INFO ] Deduced a trap composed of 11 places in 370 ms
[2021-05-14 21:19:31] [INFO ] Deduced a trap composed of 43 places in 351 ms
[2021-05-14 21:19:31] [INFO ] Deduced a trap composed of 27 places in 347 ms
[2021-05-14 21:19:32] [INFO ] Deduced a trap composed of 27 places in 348 ms
[2021-05-14 21:19:32] [INFO ] Deduced a trap composed of 29 places in 349 ms
[2021-05-14 21:19:33] [INFO ] Deduced a trap composed of 27 places in 349 ms
[2021-05-14 21:19:33] [INFO ] Deduced a trap composed of 27 places in 350 ms
[2021-05-14 21:19:33] [INFO ] Deduced a trap composed of 27 places in 352 ms
[2021-05-14 21:19:34] [INFO ] Deduced a trap composed of 39 places in 387 ms
[2021-05-14 21:19:34] [INFO ] Deduced a trap composed of 11 places in 341 ms
[2021-05-14 21:19:35] [INFO ] Deduced a trap composed of 39 places in 338 ms
[2021-05-14 21:19:35] [INFO ] Deduced a trap composed of 70 places in 338 ms
[2021-05-14 21:19:35] [INFO ] Deduced a trap composed of 25 places in 338 ms
[2021-05-14 21:19:36] [INFO ] Deduced a trap composed of 114 places in 319 ms
[2021-05-14 21:19:36] [INFO ] Deduced a trap composed of 112 places in 318 ms
[2021-05-14 21:19:37] [INFO ] Deduced a trap composed of 68 places in 330 ms
[2021-05-14 21:19:37] [INFO ] Deduced a trap composed of 97 places in 320 ms
[2021-05-14 21:19:37] [INFO ] Deduced a trap composed of 112 places in 318 ms
[2021-05-14 21:19:38] [INFO ] Deduced a trap composed of 136 places in 321 ms
[2021-05-14 21:19:38] [INFO ] Deduced a trap composed of 138 places in 319 ms
[2021-05-14 21:19:38] [INFO ] Deduced a trap composed of 13 places in 336 ms
[2021-05-14 21:19:39] [INFO ] Deduced a trap composed of 61 places in 297 ms
[2021-05-14 21:19:39] [INFO ] Deduced a trap composed of 61 places in 308 ms
[2021-05-14 21:19:39] [INFO ] Deduced a trap composed of 61 places in 296 ms
[2021-05-14 21:19:40] [INFO ] Deduced a trap composed of 61 places in 294 ms
[2021-05-14 21:19:40] [INFO ] Deduced a trap composed of 74 places in 255 ms
[2021-05-14 21:19:41] [INFO ] Deduced a trap composed of 115 places in 254 ms
[2021-05-14 21:19:41] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 11253 ms
[2021-05-14 21:19:41] [INFO ] Computed and/alt/rep : 1211/4697/1091 causal constraints in 61 ms.
[2021-05-14 21:20:02] [INFO ] Added : 1080 causal constraints over 216 iterations in 21865 ms.(timeout) Result :sat
[2021-05-14 21:20:03] [INFO ] Deduced a trap composed of 67 places in 352 ms
[2021-05-14 21:20:03] [INFO ] Deduced a trap composed of 20 places in 346 ms
[2021-05-14 21:20:04] [INFO ] Deduced a trap composed of 11 places in 350 ms
[2021-05-14 21:20:04] [INFO ] Deduced a trap composed of 98 places in 282 ms
[2021-05-14 21:20:05] [INFO ] Deduced a trap composed of 81 places in 251 ms
[2021-05-14 21:20:05] [INFO ] Deduced a trap composed of 83 places in 263 ms
[2021-05-14 21:20:05] [INFO ] Deduced a trap composed of 73 places in 251 ms
[2021-05-14 21:20:06] [INFO ] Deduced a trap composed of 73 places in 249 ms
[2021-05-14 21:20:06] [INFO ] Deduced a trap composed of 71 places in 249 ms
[2021-05-14 21:20:06] [INFO ] Deduced a trap composed of 194 places in 177 ms
[2021-05-14 21:20:07] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4096 ms
Attempting to minimize the solution found.
Minimization took 75 ms.
[2021-05-14 21:20:07] [INFO ] [Real]Absence check using 17 positive place invariants in 39 ms returned sat
[2021-05-14 21:20:07] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-14 21:20:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:20:08] [INFO ] [Real]Absence check using state equation in 1664 ms returned sat
[2021-05-14 21:20:09] [INFO ] [Real]Added 230 Read/Feed constraints in 55 ms returned sat
[2021-05-14 21:20:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:20:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 183 ms returned sat
[2021-05-14 21:20:09] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-14 21:20:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:20:10] [INFO ] [Nat]Absence check using state equation in 1548 ms returned sat
[2021-05-14 21:20:10] [INFO ] [Nat]Added 230 Read/Feed constraints in 51 ms returned sat
[2021-05-14 21:20:11] [INFO ] Deduced a trap composed of 11 places in 354 ms
[2021-05-14 21:20:11] [INFO ] Deduced a trap composed of 15 places in 347 ms
[2021-05-14 21:20:12] [INFO ] Deduced a trap composed of 25 places in 344 ms
[2021-05-14 21:20:12] [INFO ] Deduced a trap composed of 47 places in 323 ms
[2021-05-14 21:20:12] [INFO ] Deduced a trap composed of 29 places in 326 ms
[2021-05-14 21:20:13] [INFO ] Deduced a trap composed of 60 places in 316 ms
[2021-05-14 21:20:13] [INFO ] Deduced a trap composed of 144 places in 317 ms
[2021-05-14 21:20:13] [INFO ] Deduced a trap composed of 62 places in 318 ms
[2021-05-14 21:20:14] [INFO ] Deduced a trap composed of 21 places in 318 ms
[2021-05-14 21:20:14] [INFO ] Deduced a trap composed of 40 places in 284 ms
[2021-05-14 21:20:14] [INFO ] Deduced a trap composed of 65 places in 244 ms
[2021-05-14 21:20:15] [INFO ] Deduced a trap composed of 115 places in 200 ms
[2021-05-14 21:20:15] [INFO ] Deduced a trap composed of 115 places in 208 ms
[2021-05-14 21:20:15] [INFO ] Deduced a trap composed of 115 places in 199 ms
[2021-05-14 21:20:15] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4699 ms
[2021-05-14 21:20:15] [INFO ] Computed and/alt/rep : 1211/4697/1091 causal constraints in 63 ms.
[2021-05-14 21:20:33] [INFO ] Added : 1085 causal constraints over 217 iterations in 17743 ms. Result :sat
[2021-05-14 21:20:33] [INFO ] Deduced a trap composed of 50 places in 306 ms
[2021-05-14 21:20:34] [INFO ] Deduced a trap composed of 81 places in 292 ms
[2021-05-14 21:20:34] [INFO ] Deduced a trap composed of 85 places in 287 ms
[2021-05-14 21:20:35] [INFO ] Deduced a trap composed of 107 places in 288 ms
[2021-05-14 21:20:35] [INFO ] Deduced a trap composed of 107 places in 288 ms
[2021-05-14 21:20:35] [INFO ] Deduced a trap composed of 55 places in 296 ms
[2021-05-14 21:20:36] [INFO ] Deduced a trap composed of 36 places in 277 ms
[2021-05-14 21:20:36] [INFO ] Deduced a trap composed of 38 places in 285 ms
[2021-05-14 21:20:37] [INFO ] Deduced a trap composed of 65 places in 247 ms
[2021-05-14 21:20:37] [INFO ] Deduced a trap composed of 94 places in 215 ms
[2021-05-14 21:20:37] [INFO ] Deduced a trap composed of 92 places in 213 ms
[2021-05-14 21:20:38] [INFO ] Deduced a trap composed of 81 places in 213 ms
[2021-05-14 21:20:38] [INFO ] Deduced a trap composed of 90 places in 213 ms
[2021-05-14 21:20:38] [INFO ] Deduced a trap composed of 90 places in 212 ms
[2021-05-14 21:20:39] [INFO ] Deduced a trap composed of 67 places in 255 ms
[2021-05-14 21:20:39] [INFO ] Deduced a trap composed of 65 places in 251 ms
[2021-05-14 21:20:40] [INFO ] Deduced a trap composed of 83 places in 240 ms
[2021-05-14 21:20:40] [INFO ] Deduced a trap composed of 65 places in 266 ms
[2021-05-14 21:20:41] [INFO ] Deduced a trap composed of 63 places in 265 ms
[2021-05-14 21:20:41] [INFO ] Deduced a trap composed of 13 places in 233 ms
[2021-05-14 21:20:41] [INFO ] Deduced a trap composed of 11 places in 289 ms
[2021-05-14 21:20:42] [INFO ] Deduced a trap composed of 29 places in 288 ms
[2021-05-14 21:20:42] [INFO ] Deduced a trap composed of 31 places in 293 ms
[2021-05-14 21:20:43] [INFO ] Deduced a trap composed of 25 places in 304 ms
[2021-05-14 21:20:43] [INFO ] Deduced a trap composed of 13 places in 303 ms
[2021-05-14 21:20:43] [INFO ] Deduced a trap composed of 11 places in 228 ms
[2021-05-14 21:20:44] [INFO ] Deduced a trap composed of 27 places in 227 ms
[2021-05-14 21:20:44] [INFO ] Deduced a trap composed of 55 places in 302 ms
[2021-05-14 21:20:45] [INFO ] Deduced a trap composed of 40 places in 325 ms
[2021-05-14 21:20:45] [INFO ] Deduced a trap composed of 55 places in 303 ms
[2021-05-14 21:20:46] [INFO ] Deduced a trap composed of 17 places in 319 ms
[2021-05-14 21:20:46] [INFO ] Deduced a trap composed of 113 places in 259 ms
[2021-05-14 21:20:46] [INFO ] Deduced a trap composed of 40 places in 251 ms
[2021-05-14 21:20:47] [INFO ] Deduced a trap composed of 31 places in 238 ms
[2021-05-14 21:20:47] [INFO ] Deduced a trap composed of 36 places in 238 ms
[2021-05-14 21:20:48] [INFO ] Deduced a trap composed of 44 places in 245 ms
[2021-05-14 21:20:48] [INFO ] Deduced a trap composed of 46 places in 255 ms
[2021-05-14 21:20:49] [INFO ] Deduced a trap composed of 15 places in 286 ms
[2021-05-14 21:20:49] [INFO ] Deduced a trap composed of 69 places in 296 ms
[2021-05-14 21:20:49] [INFO ] Deduced a trap composed of 69 places in 293 ms
[2021-05-14 21:20:50] [INFO ] Deduced a trap composed of 68 places in 293 ms
[2021-05-14 21:20:50] [INFO ] Deduced a trap composed of 44 places in 291 ms
[2021-05-14 21:20:51] [INFO ] Deduced a trap composed of 44 places in 292 ms
[2021-05-14 21:20:51] [INFO ] Deduced a trap composed of 55 places in 298 ms
[2021-05-14 21:20:52] [INFO ] Deduced a trap composed of 133 places in 236 ms
[2021-05-14 21:20:52] [INFO ] Deduced a trap composed of 86 places in 296 ms
[2021-05-14 21:20:52] [INFO ] Deduced a trap composed of 61 places in 299 ms
[2021-05-14 21:20:53] [INFO ] Deduced a trap composed of 121 places in 247 ms
[2021-05-14 21:20:53] [INFO ] Deduced a trap composed of 86 places in 232 ms
[2021-05-14 21:20:54] [INFO ] Deduced a trap composed of 125 places in 235 ms
[2021-05-14 21:20: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 (> (+ s4 s10 s15 s21 s26 s36 s38 s47 s49 s54 s68 s72 s74 s77 s90 s94 s100 s104 s110 s113 s117 s127 s137 s146 s150 s159 s161 s165 s174 s189 s199 s201 s208 s210 s222 s225 s231 s240 s246 s259 s261 s270 s280 s283 s287 s293 s299 s302 s308 s311 s317 s323 s327 s336 s347 s349 s363 s367 s372 s376 s383 s388 s390 s407 s416 s422 s427 s429 s440 s443 s447 s452 s455 s461 s466 s476 s486 s491 s493 s498 s507 s512 s515 s518 s527 s537 s551 s560 s571 s573 s581 s588 s590 s598 s601 s604 s612 s616 s621 s626 s630 s635 s643 s647 s652 s656 s658 s670 s673 s675 s683 s685 s689 s712 s729 s742 s744 s748 s757 s771 s774 s779 s785 s795 s801) 0)") while checking expression at index 1
[2021-05-14 21:20:54] [INFO ] [Real]Absence check using 17 positive place invariants in 31 ms returned sat
[2021-05-14 21:20:54] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-14 21:20:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:20:55] [INFO ] [Real]Absence check using state equation in 1281 ms returned sat
[2021-05-14 21:20:55] [INFO ] [Real]Added 230 Read/Feed constraints in 27 ms returned sat
[2021-05-14 21:20:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:20:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 117 ms returned sat
[2021-05-14 21:20:55] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-14 21:20:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:20:57] [INFO ] [Nat]Absence check using state equation in 1248 ms returned sat
[2021-05-14 21:20:57] [INFO ] [Nat]Added 230 Read/Feed constraints in 53 ms returned sat
[2021-05-14 21:20:57] [INFO ] Deduced a trap composed of 41 places in 330 ms
[2021-05-14 21:20:57] [INFO ] Deduced a trap composed of 41 places in 336 ms
[2021-05-14 21:20:58] [INFO ] Deduced a trap composed of 41 places in 332 ms
[2021-05-14 21:20:58] [INFO ] Deduced a trap composed of 41 places in 335 ms
[2021-05-14 21:20:58] [INFO ] Deduced a trap composed of 41 places in 334 ms
[2021-05-14 21:20:59] [INFO ] Deduced a trap composed of 11 places in 335 ms
[2021-05-14 21:20:59] [INFO ] Deduced a trap composed of 11 places in 335 ms
[2021-05-14 21:21:00] [INFO ] Deduced a trap composed of 27 places in 336 ms
[2021-05-14 21:21:00] [INFO ] Deduced a trap composed of 83 places in 337 ms
[2021-05-14 21:21:00] [INFO ] Deduced a trap composed of 50 places in 334 ms
[2021-05-14 21:21:01] [INFO ] Deduced a trap composed of 11 places in 323 ms
[2021-05-14 21:21:01] [INFO ] Deduced a trap composed of 67 places in 305 ms
[2021-05-14 21:21:01] [INFO ] Deduced a trap composed of 67 places in 303 ms
[2021-05-14 21:21:02] [INFO ] Deduced a trap composed of 11 places in 319 ms
[2021-05-14 21:21:02] [INFO ] Deduced a trap composed of 13 places in 317 ms
[2021-05-14 21:21:02] [INFO ] Deduced a trap composed of 70 places in 320 ms
[2021-05-14 21:21:03] [INFO ] Deduced a trap composed of 70 places in 318 ms
[2021-05-14 21:21:03] [INFO ] Deduced a trap composed of 70 places in 320 ms
[2021-05-14 21:21:03] [INFO ] Deduced a trap composed of 83 places in 319 ms
[2021-05-14 21:21:04] [INFO ] Deduced a trap composed of 70 places in 326 ms
[2021-05-14 21:21:04] [INFO ] Deduced a trap composed of 36 places in 323 ms
[2021-05-14 21:21:05] [INFO ] Deduced a trap composed of 17 places in 313 ms
[2021-05-14 21:21:05] [INFO ] Deduced a trap composed of 86 places in 315 ms
[2021-05-14 21:21:05] [INFO ] Deduced a trap composed of 69 places in 297 ms
[2021-05-14 21:21:06] [INFO ] Deduced a trap composed of 60 places in 298 ms
[2021-05-14 21:21:06] [INFO ] Deduced a trap composed of 55 places in 269 ms
[2021-05-14 21:21:06] [INFO ] Deduced a trap composed of 94 places in 269 ms
[2021-05-14 21:21:06] [INFO ] Deduced a trap composed of 107 places in 141 ms
[2021-05-14 21:21:07] [INFO ] Deduced a trap composed of 107 places in 134 ms
[2021-05-14 21:21:07] [INFO ] Deduced a trap composed of 82 places in 69 ms
[2021-05-14 21:21:07] [INFO ] Deduced a trap composed of 80 places in 230 ms
[2021-05-14 21:21:07] [INFO ] Deduced a trap composed of 90 places in 213 ms
[2021-05-14 21:21:07] [INFO ] Deduced a trap composed of 38 places in 231 ms
[2021-05-14 21:21:08] [INFO ] Deduced a trap composed of 40 places in 227 ms
[2021-05-14 21:21:08] [INFO ] Deduced a trap composed of 102 places in 225 ms
[2021-05-14 21:21:08] [INFO ] Deduced a trap composed of 27 places in 232 ms
[2021-05-14 21:21:08] [INFO ] Deduced a trap composed of 27 places in 229 ms
[2021-05-14 21:21:09] [INFO ] Deduced a trap composed of 55 places in 156 ms
[2021-05-14 21:21:09] [INFO ] Deduced a trap composed of 90 places in 170 ms
[2021-05-14 21:21:09] [INFO ] Deduced a trap composed of 63 places in 170 ms
[2021-05-14 21:21:09] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 12526 ms
[2021-05-14 21:21:09] [INFO ] Computed and/alt/rep : 1211/4697/1091 causal constraints in 60 ms.
[2021-05-14 21:21:23] [INFO ] Added : 1071 causal constraints over 215 iterations in 13661 ms. Result :sat
[2021-05-14 21:21:23] [INFO ] Deduced a trap composed of 36 places in 349 ms
[2021-05-14 21:21:23] [INFO ] Deduced a trap composed of 107 places in 222 ms
[2021-05-14 21:21:24] [INFO ] Deduced a trap composed of 133 places in 150 ms
[2021-05-14 21:21:24] [INFO ] Deduced a trap composed of 133 places in 153 ms
[2021-05-14 21:21:24] [INFO ] Deduced a trap composed of 133 places in 150 ms
[2021-05-14 21:21:24] [INFO ] Deduced a trap composed of 133 places in 151 ms
[2021-05-14 21:21:25] [INFO ] Deduced a trap composed of 134 places in 156 ms
[2021-05-14 21:21:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2035 ms
Attempting to minimize the solution found.
Minimization took 55 ms.
[2021-05-14 21:21:25] [INFO ] [Real]Absence check using 17 positive place invariants in 33 ms returned sat
[2021-05-14 21:21:25] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-14 21:21:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:21:26] [INFO ] [Real]Absence check using state equation in 1284 ms returned sat
[2021-05-14 21:21:26] [INFO ] [Real]Added 230 Read/Feed constraints in 37 ms returned sat
[2021-05-14 21:21:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:21:27] [INFO ] [Nat]Absence check using 17 positive place invariants in 80 ms returned sat
[2021-05-14 21:21:27] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-14 21:21:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:21:28] [INFO ] [Nat]Absence check using state equation in 1239 ms returned sat
[2021-05-14 21:21:28] [INFO ] [Nat]Added 230 Read/Feed constraints in 63 ms returned sat
[2021-05-14 21:21:28] [INFO ] Deduced a trap composed of 11 places in 360 ms
[2021-05-14 21:21:29] [INFO ] Deduced a trap composed of 11 places in 362 ms
[2021-05-14 21:21:29] [INFO ] Deduced a trap composed of 11 places in 358 ms
[2021-05-14 21:21:29] [INFO ] Deduced a trap composed of 13 places in 364 ms
[2021-05-14 21:21:30] [INFO ] Deduced a trap composed of 11 places in 362 ms
[2021-05-14 21:21:30] [INFO ] Deduced a trap composed of 11 places in 359 ms
[2021-05-14 21:21:31] [INFO ] Deduced a trap composed of 25 places in 351 ms
[2021-05-14 21:21:31] [INFO ] Deduced a trap composed of 36 places in 347 ms
[2021-05-14 21:21:31] [INFO ] Deduced a trap composed of 55 places in 333 ms
[2021-05-14 21:21:32] [INFO ] Deduced a trap composed of 31 places in 333 ms
[2021-05-14 21:21:32] [INFO ] Deduced a trap composed of 31 places in 335 ms
[2021-05-14 21:21:33] [INFO ] Deduced a trap composed of 47 places in 335 ms
[2021-05-14 21:21:33] [INFO ] Deduced a trap composed of 61 places in 337 ms
[2021-05-14 21:21:33] [INFO ] Deduced a trap composed of 31 places in 338 ms
[2021-05-14 21:21:34] [INFO ] Deduced a trap composed of 61 places in 335 ms
[2021-05-14 21:21:34] [INFO ] Deduced a trap composed of 61 places in 333 ms
[2021-05-14 21:21:34] [INFO ] Deduced a trap composed of 65 places in 333 ms
[2021-05-14 21:21:35] [INFO ] Deduced a trap composed of 65 places in 328 ms
[2021-05-14 21:21:35] [INFO ] Deduced a trap composed of 61 places in 333 ms
[2021-05-14 21:21:35] [INFO ] Deduced a trap composed of 43 places in 304 ms
[2021-05-14 21:21:36] [INFO ] Deduced a trap composed of 81 places in 285 ms
[2021-05-14 21:21:36] [INFO ] Deduced a trap composed of 96 places in 283 ms
[2021-05-14 21:21:36] [INFO ] Deduced a trap composed of 90 places in 284 ms
[2021-05-14 21:21:37] [INFO ] Deduced a trap composed of 98 places in 279 ms
[2021-05-14 21:21:37] [INFO ] Deduced a trap composed of 98 places in 282 ms
[2021-05-14 21:21:37] [INFO ] Deduced a trap composed of 96 places in 284 ms
[2021-05-14 21:21:38] [INFO ] Deduced a trap composed of 94 places in 293 ms
[2021-05-14 21:21:38] [INFO ] Deduced a trap composed of 94 places in 297 ms
[2021-05-14 21:21:38] [INFO ] Deduced a trap composed of 94 places in 295 ms
[2021-05-14 21:21:39] [INFO ] Deduced a trap composed of 67 places in 230 ms
[2021-05-14 21:21:39] [INFO ] Deduced a trap composed of 69 places in 227 ms
[2021-05-14 21:21:39] [INFO ] Deduced a trap composed of 61 places in 230 ms
[2021-05-14 21:21:39] [INFO ] Deduced a trap composed of 94 places in 219 ms
[2021-05-14 21:21:40] [INFO ] Deduced a trap composed of 50 places in 217 ms
[2021-05-14 21:21:40] [INFO ] Deduced a trap composed of 91 places in 152 ms
[2021-05-14 21:21:40] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 11918 ms
[2021-05-14 21:21:40] [INFO ] Computed and/alt/rep : 1211/4697/1091 causal constraints in 65 ms.
[2021-05-14 21:21:53] [INFO ] Added : 1082 causal constraints over 217 iterations in 13571 ms. Result :sat
[2021-05-14 21:21:54] [INFO ] Deduced a trap composed of 36 places in 365 ms
[2021-05-14 21:21:54] [INFO ] Deduced a trap composed of 27 places in 366 ms
[2021-05-14 21:21:55] [INFO ] Deduced a trap composed of 45 places in 364 ms
[2021-05-14 21:21:55] [INFO ] Deduced a trap composed of 36 places in 362 ms
[2021-05-14 21:21:56] [INFO ] Deduced a trap composed of 45 places in 346 ms
[2021-05-14 21:21:56] [INFO ] Deduced a trap composed of 43 places in 324 ms
[2021-05-14 21:21:57] [INFO ] Deduced a trap composed of 57 places in 254 ms
[2021-05-14 21:21:57] [INFO ] Deduced a trap composed of 74 places in 253 ms
[2021-05-14 21:21:57] [INFO ] Deduced a trap composed of 67 places in 296 ms
[2021-05-14 21:21:58] [INFO ] Deduced a trap composed of 39 places in 260 ms
[2021-05-14 21:21:58] [INFO ] Deduced a trap composed of 89 places in 243 ms
[2021-05-14 21:21:58] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4680 ms
Attempting to minimize the solution found.
Minimization took 54 ms.
[2021-05-14 21:21:58] [INFO ] [Real]Absence check using 17 positive place invariants in 31 ms returned sat
[2021-05-14 21:21:58] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-14 21:21:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:22:00] [INFO ] [Real]Absence check using state equation in 1249 ms returned sat
[2021-05-14 21:22:00] [INFO ] [Real]Added 230 Read/Feed constraints in 24 ms returned sat
[2021-05-14 21:22:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:22:00] [INFO ] [Nat]Absence check using 17 positive place invariants in 114 ms returned sat
[2021-05-14 21:22:00] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-14 21:22:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:22:01] [INFO ] [Nat]Absence check using state equation in 1215 ms returned sat
[2021-05-14 21:22:01] [INFO ] [Nat]Added 230 Read/Feed constraints in 48 ms returned sat
[2021-05-14 21:22:02] [INFO ] Deduced a trap composed of 31 places in 380 ms
[2021-05-14 21:22:02] [INFO ] Deduced a trap composed of 31 places in 378 ms
[2021-05-14 21:22:02] [INFO ] Deduced a trap composed of 31 places in 376 ms
[2021-05-14 21:22:03] [INFO ] Deduced a trap composed of 31 places in 384 ms
[2021-05-14 21:22:03] [INFO ] Deduced a trap composed of 11 places in 377 ms
[2021-05-14 21:22:04] [INFO ] Deduced a trap composed of 11 places in 379 ms
[2021-05-14 21:22:04] [INFO ] Deduced a trap composed of 25 places in 377 ms
[2021-05-14 21:22:04] [INFO ] Deduced a trap composed of 13 places in 381 ms
[2021-05-14 21:22:05] [INFO ] Deduced a trap composed of 81 places in 378 ms
[2021-05-14 21:22:05] [INFO ] Deduced a trap composed of 31 places in 336 ms
[2021-05-14 21:22:06] [INFO ] Deduced a trap composed of 17 places in 337 ms
[2021-05-14 21:22:06] [INFO ] Deduced a trap composed of 119 places in 353 ms
[2021-05-14 21:22:06] [INFO ] Deduced a trap composed of 11 places in 334 ms
[2021-05-14 21:22:07] [INFO ] Deduced a trap composed of 17 places in 312 ms
[2021-05-14 21:22:07] [INFO ] Deduced a trap composed of 76 places in 263 ms
[2021-05-14 21:22:07] [INFO ] Deduced a trap composed of 77 places in 246 ms
[2021-05-14 21:22:08] [INFO ] Deduced a trap composed of 94 places in 258 ms
[2021-05-14 21:22:08] [INFO ] Deduced a trap composed of 100 places in 235 ms
[2021-05-14 21:22:08] [INFO ] Deduced a trap composed of 67 places in 239 ms
[2021-05-14 21:22:08] [INFO ] Deduced a trap composed of 69 places in 236 ms
[2021-05-14 21:22:09] [INFO ] Deduced a trap composed of 77 places in 240 ms
[2021-05-14 21:22:09] [INFO ] Deduced a trap composed of 82 places in 238 ms
[2021-05-14 21:22:09] [INFO ] Deduced a trap composed of 89 places in 250 ms
[2021-05-14 21:22:09] [INFO ] Deduced a trap composed of 67 places in 224 ms
[2021-05-14 21:22:10] [INFO ] Deduced a trap composed of 94 places in 234 ms
[2021-05-14 21:22:10] [INFO ] Deduced a trap composed of 107 places in 256 ms
[2021-05-14 21:22:10] [INFO ] Deduced a trap composed of 49 places in 279 ms
[2021-05-14 21:22:11] [INFO ] Deduced a trap composed of 81 places in 283 ms
[2021-05-14 21:22:11] [INFO ] Deduced a trap composed of 64 places in 262 ms
[2021-05-14 21:22:11] [INFO ] Deduced a trap composed of 91 places in 275 ms
[2021-05-14 21:22:11] [INFO ] Deduced a trap composed of 95 places in 158 ms
[2021-05-14 21:22:12] [INFO ] Deduced a trap composed of 108 places in 165 ms
[2021-05-14 21:22:12] [INFO ] Deduced a trap composed of 138 places in 166 ms
[2021-05-14 21:22:12] [INFO ] Deduced a trap composed of 222 places in 235 ms
[2021-05-14 21:22:12] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 10988 ms
[2021-05-14 21:22:12] [INFO ] Computed and/alt/rep : 1211/4697/1091 causal constraints in 57 ms.
[2021-05-14 21:22:24] [INFO ] Added : 976 causal constraints over 196 iterations in 12087 ms. Result :sat
[2021-05-14 21:22:25] [INFO ] Deduced a trap composed of 151 places in 342 ms
[2021-05-14 21:22:25] [INFO ] Deduced a trap composed of 74 places in 265 ms
[2021-05-14 21:22:25] [INFO ] Deduced a trap composed of 55 places in 334 ms
[2021-05-14 21:22:26] [INFO ] Deduced a trap composed of 55 places in 303 ms
[2021-05-14 21:22:26] [INFO ] Deduced a trap composed of 133 places in 228 ms
[2021-05-14 21:22:26] [INFO ] Deduced a trap composed of 81 places in 233 ms
[2021-05-14 21:22:27] [INFO ] Deduced a trap composed of 133 places in 232 ms
[2021-05-14 21:22:27] [INFO ] Deduced a trap composed of 107 places in 141 ms
[2021-05-14 21:22:27] [INFO ] Deduced a trap composed of 81 places in 88 ms
[2021-05-14 21:22:28] [INFO ] Deduced a trap composed of 41 places in 250 ms
[2021-05-14 21:22:28] [INFO ] Deduced a trap composed of 43 places in 248 ms
[2021-05-14 21:22:28] [INFO ] Deduced a trap composed of 41 places in 250 ms
[2021-05-14 21:22:29] [INFO ] Deduced a trap composed of 108 places in 106 ms
[2021-05-14 21:22:29] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4520 ms
Attempting to minimize the solution found.
Minimization took 56 ms.
[2021-05-14 21:22:29] [INFO ] [Real]Absence check using 17 positive place invariants in 33 ms returned sat
[2021-05-14 21:22:29] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 10 ms returned sat
[2021-05-14 21:22:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:22:30] [INFO ] [Real]Absence check using state equation in 1298 ms returned sat
[2021-05-14 21:22:30] [INFO ] [Real]Added 230 Read/Feed constraints in 38 ms returned sat
[2021-05-14 21:22:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:22:31] [INFO ] [Nat]Absence check using 17 positive place invariants in 79 ms returned sat
[2021-05-14 21:22:31] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-14 21:22:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:22:32] [INFO ] [Nat]Absence check using state equation in 1256 ms returned sat
[2021-05-14 21:22:32] [INFO ] [Nat]Added 230 Read/Feed constraints in 51 ms returned sat
[2021-05-14 21:22:32] [INFO ] Deduced a trap composed of 15 places in 369 ms
[2021-05-14 21:22:33] [INFO ] Deduced a trap composed of 27 places in 368 ms
[2021-05-14 21:22:33] [INFO ] Deduced a trap composed of 27 places in 374 ms
[2021-05-14 21:22:33] [INFO ] Deduced a trap composed of 27 places in 366 ms
[2021-05-14 21:22:34] [INFO ] Deduced a trap composed of 11 places in 367 ms
[2021-05-14 21:22:34] [INFO ] Deduced a trap composed of 11 places in 368 ms
[2021-05-14 21:22:35] [INFO ] Deduced a trap composed of 27 places in 370 ms
[2021-05-14 21:22:35] [INFO ] Deduced a trap composed of 40 places in 378 ms
[2021-05-14 21:22:35] [INFO ] Deduced a trap composed of 40 places in 368 ms
[2021-05-14 21:22:36] [INFO ] Deduced a trap composed of 55 places in 368 ms
[2021-05-14 21:22:36] [INFO ] Deduced a trap composed of 55 places in 371 ms
[2021-05-14 21:22:37] [INFO ] Deduced a trap composed of 69 places in 373 ms
[2021-05-14 21:22:37] [INFO ] Deduced a trap composed of 40 places in 328 ms
[2021-05-14 21:22:37] [INFO ] Deduced a trap composed of 82 places in 337 ms
[2021-05-14 21:22:38] [INFO ] Deduced a trap composed of 82 places in 339 ms
[2021-05-14 21:22:38] [INFO ] Deduced a trap composed of 82 places in 342 ms
[2021-05-14 21:22:39] [INFO ] Deduced a trap composed of 97 places in 336 ms
[2021-05-14 21:22:39] [INFO ] Deduced a trap composed of 97 places in 334 ms
[2021-05-14 21:22:39] [INFO ] Deduced a trap composed of 99 places in 334 ms
[2021-05-14 21:22:40] [INFO ] Deduced a trap composed of 93 places in 339 ms
[2021-05-14 21:22:40] [INFO ] Deduced a trap composed of 97 places in 335 ms
[2021-05-14 21:22:40] [INFO ] Deduced a trap composed of 69 places in 334 ms
[2021-05-14 21:22:41] [INFO ] Deduced a trap composed of 107 places in 338 ms
[2021-05-14 21:22:41] [INFO ] Deduced a trap composed of 81 places in 311 ms
[2021-05-14 21:22:41] [INFO ] Deduced a trap composed of 81 places in 314 ms
[2021-05-14 21:22:42] [INFO ] Deduced a trap composed of 69 places in 332 ms
[2021-05-14 21:22:42] [INFO ] Deduced a trap composed of 69 places in 334 ms
[2021-05-14 21:22:43] [INFO ] Deduced a trap composed of 82 places in 338 ms
[2021-05-14 21:22:43] [INFO ] Deduced a trap composed of 69 places in 336 ms
[2021-05-14 21:22:43] [INFO ] Deduced a trap composed of 80 places in 333 ms
[2021-05-14 21:22:44] [INFO ] Deduced a trap composed of 70 places in 284 ms
[2021-05-14 21:22:44] [INFO ] Deduced a trap composed of 35 places in 291 ms
[2021-05-14 21:22:44] [INFO ] Deduced a trap composed of 69 places in 301 ms
[2021-05-14 21:22:45] [INFO ] Deduced a trap composed of 11 places in 283 ms
[2021-05-14 21:22:45] [INFO ] Deduced a trap composed of 36 places in 363 ms
[2021-05-14 21:22:45] [INFO ] Deduced a trap composed of 75 places in 260 ms
[2021-05-14 21:22:46] [INFO ] Deduced a trap composed of 133 places in 212 ms
[2021-05-14 21:22:46] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 13836 ms
[2021-05-14 21:22:46] [INFO ] Computed and/alt/rep : 1211/4697/1091 causal constraints in 57 ms.
[2021-05-14 21:23:00] [INFO ] Added : 1089 causal constraints over 218 iterations in 14263 ms. Result :sat
[2021-05-14 21:23:00] [INFO ] Deduced a trap composed of 111 places in 381 ms
[2021-05-14 21:23:01] [INFO ] Deduced a trap composed of 79 places in 378 ms
[2021-05-14 21:23:01] [INFO ] Deduced a trap composed of 72 places in 370 ms
[2021-05-14 21:23:02] [INFO ] Deduced a trap composed of 39 places in 373 ms
[2021-05-14 21:23:02] [INFO ] Deduced a trap composed of 72 places in 382 ms
[2021-05-14 21:23:03] [INFO ] Deduced a trap composed of 69 places in 373 ms
[2021-05-14 21:23:03] [INFO ] Deduced a trap composed of 72 places in 370 ms
[2021-05-14 21:23:04] [INFO ] Deduced a trap composed of 39 places in 370 ms
[2021-05-14 21:23:04] [INFO ] Deduced a trap composed of 39 places in 376 ms
[2021-05-14 21:23:05] [INFO ] Deduced a trap composed of 69 places in 373 ms
[2021-05-14 21:23:05] [INFO ] Deduced a trap composed of 122 places in 383 ms
[2021-05-14 21:23:06] [INFO ] Deduced a trap composed of 75 places in 368 ms
[2021-05-14 21:23:06] [INFO ] Deduced a trap composed of 139 places in 379 ms
[2021-05-14 21:23:07] [INFO ] Deduced a trap composed of 46 places in 370 ms
[2021-05-14 21:23:07] [INFO ] Deduced a trap composed of 107 places in 370 ms
[2021-05-14 21:23:08] [INFO ] Deduced a trap composed of 125 places in 405 ms
[2021-05-14 21:23:09] [INFO ] Deduced a trap composed of 15 places in 389 ms
[2021-05-14 21:23:09] [INFO ] Deduced a trap composed of 42 places in 392 ms
[2021-05-14 21:23:10] [INFO ] Deduced a trap composed of 44 places in 389 ms
[2021-05-14 21:23:10] [INFO ] Deduced a trap composed of 17 places in 389 ms
[2021-05-14 21:23:11] [INFO ] Deduced a trap composed of 15 places in 388 ms
[2021-05-14 21:23:11] [INFO ] Deduced a trap composed of 79 places in 386 ms
[2021-05-14 21:23:12] [INFO ] Deduced a trap composed of 79 places in 394 ms
[2021-05-14 21:23:12] [INFO ] Deduced a trap composed of 79 places in 390 ms
[2021-05-14 21:23:13] [INFO ] Deduced a trap composed of 27 places in 372 ms
[2021-05-14 21:23:13] [INFO ] Deduced a trap composed of 27 places in 373 ms
[2021-05-14 21:23:14] [INFO ] Deduced a trap composed of 70 places in 389 ms
[2021-05-14 21:23:15] [INFO ] Deduced a trap composed of 70 places in 394 ms
[2021-05-14 21:23:15] [INFO ] Deduced a trap composed of 70 places in 387 ms
[2021-05-14 21:23:15] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 21:23:16] [INFO ] Deduced a trap composed of 2 places in 443 ms
[2021-05-14 21:23:16] [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 (> (+ s403 s780) 0)") while checking expression at index 5
[2021-05-14 21:23:16] [INFO ] [Real]Absence check using 17 positive place invariants in 33 ms returned sat
[2021-05-14 21:23:16] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-14 21:23:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:23:17] [INFO ] [Real]Absence check using state equation in 1275 ms returned sat
[2021-05-14 21:23:17] [INFO ] [Real]Added 230 Read/Feed constraints in 28 ms returned sat
[2021-05-14 21:23:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:23:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 115 ms returned sat
[2021-05-14 21:23:17] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-14 21:23:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:23:19] [INFO ] [Nat]Absence check using state equation in 1270 ms returned sat
[2021-05-14 21:23:19] [INFO ] [Nat]Added 230 Read/Feed constraints in 60 ms returned sat
[2021-05-14 21:23:19] [INFO ] Deduced a trap composed of 11 places in 360 ms
[2021-05-14 21:23:20] [INFO ] Deduced a trap composed of 11 places in 361 ms
[2021-05-14 21:23:20] [INFO ] Deduced a trap composed of 11 places in 362 ms
[2021-05-14 21:23:20] [INFO ] Deduced a trap composed of 11 places in 356 ms
[2021-05-14 21:23:21] [INFO ] Deduced a trap composed of 11 places in 360 ms
[2021-05-14 21:23:21] [INFO ] Deduced a trap composed of 15 places in 358 ms
[2021-05-14 21:23:21] [INFO ] Deduced a trap composed of 92 places in 325 ms
[2021-05-14 21:23:22] [INFO ] Deduced a trap composed of 94 places in 324 ms
[2021-05-14 21:23:22] [INFO ] Deduced a trap composed of 94 places in 328 ms
[2021-05-14 21:23:23] [INFO ] Deduced a trap composed of 83 places in 327 ms
[2021-05-14 21:23:23] [INFO ] Deduced a trap composed of 144 places in 326 ms
[2021-05-14 21:23:23] [INFO ] Deduced a trap composed of 39 places in 245 ms
[2021-05-14 21:23:23] [INFO ] Deduced a trap composed of 39 places in 246 ms
[2021-05-14 21:23:24] [INFO ] Deduced a trap composed of 39 places in 244 ms
[2021-05-14 21:23:24] [INFO ] Deduced a trap composed of 39 places in 242 ms
[2021-05-14 21:23:24] [INFO ] Deduced a trap composed of 107 places in 211 ms
[2021-05-14 21:23:25] [INFO ] Deduced a trap composed of 94 places in 226 ms
[2021-05-14 21:23:25] [INFO ] Deduced a trap composed of 83 places in 289 ms
[2021-05-14 21:23:25] [INFO ] Deduced a trap composed of 97 places in 149 ms
[2021-05-14 21:23:25] [INFO ] Deduced a trap composed of 69 places in 148 ms
[2021-05-14 21:23:25] [INFO ] Deduced a trap composed of 97 places in 147 ms
[2021-05-14 21:23:26] [INFO ] Deduced a trap composed of 81 places in 140 ms
[2021-05-14 21:23:26] [INFO ] Deduced a trap composed of 61 places in 151 ms
[2021-05-14 21:23:26] [INFO ] Deduced a trap composed of 37 places in 280 ms
[2021-05-14 21:23:27] [INFO ] Deduced a trap composed of 81 places in 272 ms
[2021-05-14 21:23:27] [INFO ] Deduced a trap composed of 17 places in 198 ms
[2021-05-14 21:23:27] [INFO ] Deduced a trap composed of 15 places in 208 ms
[2021-05-14 21:23:27] [INFO ] Deduced a trap composed of 15 places in 197 ms
[2021-05-14 21:23:28] [INFO ] Deduced a trap composed of 15 places in 207 ms
[2021-05-14 21:23:28] [INFO ] Deduced a trap composed of 15 places in 196 ms
[2021-05-14 21:23:28] [INFO ] Deduced a trap composed of 75 places in 143 ms
[2021-05-14 21:23:28] [INFO ] Deduced a trap composed of 105 places in 237 ms
[2021-05-14 21:23:29] [INFO ] Deduced a trap composed of 83 places in 235 ms
[2021-05-14 21:23:29] [INFO ] Deduced a trap composed of 109 places in 236 ms
[2021-05-14 21:23:29] [INFO ] Deduced a trap composed of 114 places in 243 ms
[2021-05-14 21:23:30] [INFO ] Deduced a trap composed of 184 places in 319 ms
[2021-05-14 21:23:30] [INFO ] Deduced a trap composed of 81 places in 274 ms
[2021-05-14 21:23:31] [INFO ] Deduced a trap composed of 73 places in 307 ms
[2021-05-14 21:23:31] [INFO ] Deduced a trap composed of 70 places in 240 ms
[2021-05-14 21:23:31] [INFO ] Deduced a trap composed of 123 places in 291 ms
[2021-05-14 21:23:32] [INFO ] Deduced a trap composed of 75 places in 223 ms
[2021-05-14 21:23:32] [INFO ] Deduced a trap composed of 167 places in 282 ms
[2021-05-14 21:23:32] [INFO ] Deduced a trap composed of 166 places in 279 ms
[2021-05-14 21:23:33] [INFO ] Deduced a trap composed of 75 places in 286 ms
[2021-05-14 21:23:33] [INFO ] Deduced a trap composed of 52 places in 254 ms
[2021-05-14 21:23:33] [INFO ] Deduced a trap composed of 50 places in 255 ms
[2021-05-14 21:23:33] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 14389 ms
[2021-05-14 21:23:33] [INFO ] Computed and/alt/rep : 1211/4697/1091 causal constraints in 53 ms.
[2021-05-14 21:23:45] [INFO ] Added : 962 causal constraints over 194 iterations in 11463 ms. Result :sat
[2021-05-14 21:23:45] [INFO ] Deduced a trap composed of 50 places in 272 ms
[2021-05-14 21:23:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 408 ms
Attempting to minimize the solution found.
Minimization took 55 ms.
[2021-05-14 21:23:45] [INFO ] [Real]Absence check using 17 positive place invariants in 31 ms returned sat
[2021-05-14 21:23:45] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-14 21:23:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:23:47] [INFO ] [Real]Absence check using state equation in 1260 ms returned sat
[2021-05-14 21:23:47] [INFO ] [Real]Added 230 Read/Feed constraints in 35 ms returned sat
[2021-05-14 21:23:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:23:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 112 ms returned sat
[2021-05-14 21:23:47] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 21:23:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:23:48] [INFO ] [Nat]Absence check using state equation in 1221 ms returned sat
[2021-05-14 21:23:48] [INFO ] [Nat]Added 230 Read/Feed constraints in 50 ms returned sat
[2021-05-14 21:23:49] [INFO ] Deduced a trap composed of 11 places in 391 ms
[2021-05-14 21:23:49] [INFO ] Deduced a trap composed of 11 places in 388 ms
[2021-05-14 21:23:49] [INFO ] Deduced a trap composed of 11 places in 389 ms
[2021-05-14 21:23:50] [INFO ] Deduced a trap composed of 13 places in 386 ms
[2021-05-14 21:23:50] [INFO ] Deduced a trap composed of 11 places in 388 ms
[2021-05-14 21:23:51] [INFO ] Deduced a trap composed of 11 places in 392 ms
[2021-05-14 21:23:51] [INFO ] Deduced a trap composed of 131 places in 362 ms
[2021-05-14 21:23:51] [INFO ] Deduced a trap composed of 113 places in 368 ms
[2021-05-14 21:23:52] [INFO ] Deduced a trap composed of 27 places in 360 ms
[2021-05-14 21:23:52] [INFO ] Deduced a trap composed of 48 places in 361 ms
[2021-05-14 21:23:53] [INFO ] Deduced a trap composed of 27 places in 366 ms
[2021-05-14 21:23:53] [INFO ] Deduced a trap composed of 79 places in 367 ms
[2021-05-14 21:23:53] [INFO ] Deduced a trap composed of 50 places in 365 ms
[2021-05-14 21:23:54] [INFO ] Deduced a trap composed of 27 places in 363 ms
[2021-05-14 21:23:54] [INFO ] Deduced a trap composed of 92 places in 164 ms
[2021-05-14 21:23:54] [INFO ] Deduced a trap composed of 83 places in 164 ms
[2021-05-14 21:23:54] [INFO ] Deduced a trap composed of 70 places in 168 ms
[2021-05-14 21:23:55] [INFO ] Deduced a trap composed of 69 places in 163 ms
[2021-05-14 21:23:55] [INFO ] Deduced a trap composed of 68 places in 164 ms
[2021-05-14 21:23:55] [INFO ] Deduced a trap composed of 70 places in 168 ms
[2021-05-14 21:23:55] [INFO ] Deduced a trap composed of 113 places in 144 ms
[2021-05-14 21:23:55] [INFO ] Deduced a trap composed of 94 places in 146 ms
[2021-05-14 21:23:56] [INFO ] Deduced a trap composed of 94 places in 144 ms
[2021-05-14 21:23:56] [INFO ] Deduced a trap composed of 94 places in 140 ms
[2021-05-14 21:23:56] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 7667 ms
[2021-05-14 21:23:56] [INFO ] Computed and/alt/rep : 1211/4697/1091 causal constraints in 53 ms.
[2021-05-14 21:24:09] [INFO ] Added : 1023 causal constraints over 205 iterations in 12863 ms. Result :sat
[2021-05-14 21:24:09] [INFO ] Deduced a trap composed of 57 places in 333 ms
[2021-05-14 21:24:09] [INFO ] Deduced a trap composed of 88 places in 350 ms
[2021-05-14 21:24:10] [INFO ] Deduced a trap composed of 63 places in 296 ms
[2021-05-14 21:24:10] [INFO ] Deduced a trap composed of 37 places in 353 ms
[2021-05-14 21:24:11] [INFO ] Deduced a trap composed of 52 places in 301 ms
[2021-05-14 21:24:11] [INFO ] Deduced a trap composed of 88 places in 275 ms
[2021-05-14 21:24:12] [INFO ] Deduced a trap composed of 99 places in 294 ms
[2021-05-14 21:24:13] [INFO ] Deduced a trap composed of 107 places in 304 ms
[2021-05-14 21:24:13] [INFO ] Deduced a trap composed of 139 places in 296 ms
[2021-05-14 21:24:13] [INFO ] Deduced a trap composed of 90 places in 309 ms
[2021-05-14 21:24:14] [INFO ] Deduced a trap composed of 75 places in 296 ms
[2021-05-14 21:24:14] [INFO ] Deduced a trap composed of 134 places in 306 ms
[2021-05-14 21:24:15] [INFO ] Deduced a trap composed of 81 places in 309 ms
[2021-05-14 21:24:15] [INFO ] Deduced a trap composed of 81 places in 315 ms
[2021-05-14 21:24:16] [INFO ] Deduced a trap composed of 81 places in 312 ms
[2021-05-14 21:24:16] [INFO ] Deduced a trap composed of 29 places in 301 ms
[2021-05-14 21:24:16] [INFO ] Deduced a trap composed of 86 places in 227 ms
[2021-05-14 21:24:16] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 7732 ms
Attempting to minimize the solution found.
Minimization took 57 ms.
Incomplete Parikh walk after 225800 steps, including 1000 resets, run finished after 2645 ms. (steps per millisecond=85 ) properties seen :[1, 0, 1, 1, 1, 0, 0, 0] could not realise parikh vector
FORMULA Peterson-PT-5-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 170100 steps, including 1000 resets, run finished after 1926 ms. (steps per millisecond=88 ) properties seen :[0, 1, 1, 0] could not realise parikh vector
FORMULA Peterson-PT-5-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 340700 steps, including 1000 resets, run finished after 3768 ms. (steps per millisecond=90 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 340300 steps, including 1000 resets, run finished after 3848 ms. (steps per millisecond=88 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 311700 steps, including 1000 resets, run finished after 3446 ms. (steps per millisecond=90 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 344200 steps, including 1000 resets, run finished after 3826 ms. (steps per millisecond=89 ) properties seen :[0, 0] could not realise parikh vector
Support contains 68 out of 809 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 809/809 places, 1217/1217 transitions.
Performed 333 Post agglomeration using F-continuation condition.Transition count delta: 333
Iterating post reduction 0 with 333 rules applied. Total rules applied 333 place count 809 transition count 884
Reduce places removed 333 places and 0 transitions.
Iterating post reduction 1 with 333 rules applied. Total rules applied 666 place count 476 transition count 884
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 666 place count 476 transition count 733
Deduced a syphon composed of 151 places in 0 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 968 place count 325 transition count 733
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 1016 place count 301 transition count 709
Applied a total of 1016 rules in 65 ms. Remains 301 /809 variables (removed 508) and now considering 709/1217 (removed 508) transitions.
Finished structural reductions, in 1 iterations. Remains : 301/809 places, 709/1217 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 10489 ms. (steps per millisecond=95 ) properties seen :[0, 0]
Interrupted Best-First random walk after 390845 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=78 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1889 ms. (steps per millisecond=529 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 9098481 steps, run timeout after 30001 ms. (steps per millisecond=303 ) properties seen :[0, 0]
Probabilistic random walk after 9098481 steps, saw 1299784 distinct states, run finished after 30001 ms. (steps per millisecond=303 ) properties seen :[0, 0]
[2021-05-14 21:25:23] [INFO ] Flow matrix only has 589 transitions (discarded 120 similar events)
// Phase 1: matrix 589 rows 301 cols
[2021-05-14 21:25:23] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-14 21:25:23] [INFO ] [Real]Absence check using 17 positive place invariants in 19 ms returned sat
[2021-05-14 21:25:23] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-14 21:25:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:25:24] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2021-05-14 21:25:24] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 21:25:24] [INFO ] [Real]Added 230 Read/Feed constraints in 35 ms returned sat
[2021-05-14 21:25:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:25:24] [INFO ] [Nat]Absence check using 17 positive place invariants in 66 ms returned sat
[2021-05-14 21:25:24] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 21:25:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:25:24] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2021-05-14 21:25:24] [INFO ] [Nat]Added 230 Read/Feed constraints in 27 ms returned sat
[2021-05-14 21:25:24] [INFO ] Deduced a trap composed of 48 places in 104 ms
[2021-05-14 21:25:24] [INFO ] Deduced a trap composed of 87 places in 106 ms
[2021-05-14 21:25:25] [INFO ] Deduced a trap composed of 9 places in 85 ms
[2021-05-14 21:25:25] [INFO ] Deduced a trap composed of 12 places in 85 ms
[2021-05-14 21:25:25] [INFO ] Deduced a trap composed of 10 places in 105 ms
[2021-05-14 21:25:25] [INFO ] Deduced a trap composed of 9 places in 108 ms
[2021-05-14 21:25:25] [INFO ] Deduced a trap composed of 39 places in 96 ms
[2021-05-14 21:25:25] [INFO ] Deduced a trap composed of 17 places in 86 ms
[2021-05-14 21:25:25] [INFO ] Deduced a trap composed of 34 places in 86 ms
[2021-05-14 21:25:25] [INFO ] Deduced a trap composed of 21 places in 86 ms
[2021-05-14 21:25:25] [INFO ] Deduced a trap composed of 25 places in 85 ms
[2021-05-14 21:25:26] [INFO ] Deduced a trap composed of 17 places in 87 ms
[2021-05-14 21:25:26] [INFO ] Deduced a trap composed of 45 places in 96 ms
[2021-05-14 21:25:26] [INFO ] Deduced a trap composed of 18 places in 88 ms
[2021-05-14 21:25:26] [INFO ] Deduced a trap composed of 71 places in 97 ms
[2021-05-14 21:25:26] [INFO ] Deduced a trap composed of 60 places in 97 ms
[2021-05-14 21:25:26] [INFO ] Deduced a trap composed of 51 places in 99 ms
[2021-05-14 21:25:26] [INFO ] Deduced a trap composed of 51 places in 96 ms
[2021-05-14 21:25:26] [INFO ] Deduced a trap composed of 17 places in 98 ms
[2021-05-14 21:25:26] [INFO ] Deduced a trap composed of 35 places in 80 ms
[2021-05-14 21:25:27] [INFO ] Deduced a trap composed of 25 places in 80 ms
[2021-05-14 21:25:27] [INFO ] Deduced a trap composed of 25 places in 80 ms
[2021-05-14 21:25:27] [INFO ] Deduced a trap composed of 25 places in 81 ms
[2021-05-14 21:25:27] [INFO ] Deduced a trap composed of 26 places in 80 ms
[2021-05-14 21:25:27] [INFO ] Deduced a trap composed of 25 places in 80 ms
[2021-05-14 21:25:27] [INFO ] Deduced a trap composed of 17 places in 86 ms
[2021-05-14 21:25:27] [INFO ] Deduced a trap composed of 17 places in 86 ms
[2021-05-14 21:25:27] [INFO ] Deduced a trap composed of 13 places in 86 ms
[2021-05-14 21:25:27] [INFO ] Deduced a trap composed of 12 places in 88 ms
[2021-05-14 21:25:28] [INFO ] Deduced a trap composed of 10 places in 90 ms
[2021-05-14 21:25:28] [INFO ] Deduced a trap composed of 12 places in 89 ms
[2021-05-14 21:25:28] [INFO ] Deduced a trap composed of 38 places in 90 ms
[2021-05-14 21:25:28] [INFO ] Deduced a trap composed of 11 places in 92 ms
[2021-05-14 21:25:28] [INFO ] Deduced a trap composed of 34 places in 91 ms
[2021-05-14 21:25:28] [INFO ] Deduced a trap composed of 34 places in 89 ms
[2021-05-14 21:25:28] [INFO ] Deduced a trap composed of 57 places in 91 ms
[2021-05-14 21:25:28] [INFO ] Deduced a trap composed of 25 places in 76 ms
[2021-05-14 21:25:28] [INFO ] Deduced a trap composed of 41 places in 72 ms
[2021-05-14 21:25:28] [INFO ] Deduced a trap composed of 35 places in 70 ms
[2021-05-14 21:25:29] [INFO ] Deduced a trap composed of 42 places in 70 ms
[2021-05-14 21:25:29] [INFO ] Deduced a trap composed of 34 places in 69 ms
[2021-05-14 21:25:29] [INFO ] Deduced a trap composed of 33 places in 69 ms
[2021-05-14 21:25:29] [INFO ] Deduced a trap composed of 34 places in 68 ms
[2021-05-14 21:25:29] [INFO ] Deduced a trap composed of 41 places in 77 ms
[2021-05-14 21:25:29] [INFO ] Deduced a trap composed of 41 places in 77 ms
[2021-05-14 21:25:29] [INFO ] Deduced a trap composed of 43 places in 74 ms
[2021-05-14 21:25:29] [INFO ] Deduced a trap composed of 41 places in 77 ms
[2021-05-14 21:25:29] [INFO ] Deduced a trap composed of 41 places in 69 ms
[2021-05-14 21:25:29] [INFO ] Deduced a trap composed of 41 places in 71 ms
[2021-05-14 21:25:30] [INFO ] Deduced a trap composed of 33 places in 47 ms
[2021-05-14 21:25:30] [INFO ] Deduced a trap composed of 33 places in 47 ms
[2021-05-14 21:25:30] [INFO ] Deduced a trap composed of 33 places in 47 ms
[2021-05-14 21:25:30] [INFO ] Deduced a trap composed of 33 places in 48 ms
[2021-05-14 21:25:30] [INFO ] Deduced a trap composed of 33 places in 47 ms
[2021-05-14 21:25:30] [INFO ] Trap strengthening (SAT) tested/added 55/54 trap constraints in 5549 ms
[2021-05-14 21:25:30] [INFO ] Computed and/alt/rep : 703/4189/583 causal constraints in 30 ms.
[2021-05-14 21:25:36] [INFO ] Added : 571 causal constraints over 115 iterations in 6021 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 39 ms.
[2021-05-14 21:25:36] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2021-05-14 21:25:36] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 21:25:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:25:36] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2021-05-14 21:25:36] [INFO ] [Real]Added 230 Read/Feed constraints in 21 ms returned sat
[2021-05-14 21:25:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:25:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 19 ms returned sat
[2021-05-14 21:25:36] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-14 21:25:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:25:37] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2021-05-14 21:25:37] [INFO ] [Nat]Added 230 Read/Feed constraints in 24 ms returned sat
[2021-05-14 21:25:37] [INFO ] Deduced a trap composed of 9 places in 93 ms
[2021-05-14 21:25:37] [INFO ] Deduced a trap composed of 37 places in 94 ms
[2021-05-14 21:25:37] [INFO ] Deduced a trap composed of 45 places in 89 ms
[2021-05-14 21:25:37] [INFO ] Deduced a trap composed of 27 places in 92 ms
[2021-05-14 21:25:37] [INFO ] Deduced a trap composed of 34 places in 92 ms
[2021-05-14 21:25:37] [INFO ] Deduced a trap composed of 9 places in 93 ms
[2021-05-14 21:25:37] [INFO ] Deduced a trap composed of 12 places in 92 ms
[2021-05-14 21:25:37] [INFO ] Deduced a trap composed of 12 places in 92 ms
[2021-05-14 21:25:38] [INFO ] Deduced a trap composed of 13 places in 91 ms
[2021-05-14 21:25:38] [INFO ] Deduced a trap composed of 52 places in 83 ms
[2021-05-14 21:25:38] [INFO ] Deduced a trap composed of 34 places in 84 ms
[2021-05-14 21:25:38] [INFO ] Deduced a trap composed of 17 places in 84 ms
[2021-05-14 21:25:38] [INFO ] Deduced a trap composed of 31 places in 85 ms
[2021-05-14 21:25:38] [INFO ] Deduced a trap composed of 17 places in 83 ms
[2021-05-14 21:25:38] [INFO ] Deduced a trap composed of 29 places in 84 ms
[2021-05-14 21:25:38] [INFO ] Deduced a trap composed of 28 places in 84 ms
[2021-05-14 21:25:38] [INFO ] Deduced a trap composed of 36 places in 83 ms
[2021-05-14 21:25:38] [INFO ] Deduced a trap composed of 33 places in 106 ms
[2021-05-14 21:25:39] [INFO ] Deduced a trap composed of 33 places in 105 ms
[2021-05-14 21:25:39] [INFO ] Deduced a trap composed of 37 places in 98 ms
[2021-05-14 21:25:39] [INFO ] Deduced a trap composed of 33 places in 99 ms
[2021-05-14 21:25:39] [INFO ] Deduced a trap composed of 20 places in 98 ms
[2021-05-14 21:25:39] [INFO ] Deduced a trap composed of 21 places in 100 ms
[2021-05-14 21:25:39] [INFO ] Deduced a trap composed of 48 places in 76 ms
[2021-05-14 21:25:39] [INFO ] Deduced a trap composed of 42 places in 74 ms
[2021-05-14 21:25:39] [INFO ] Deduced a trap composed of 34 places in 57 ms
[2021-05-14 21:25:39] [INFO ] Deduced a trap composed of 48 places in 76 ms
[2021-05-14 21:25:39] [INFO ] Deduced a trap composed of 46 places in 56 ms
[2021-05-14 21:25:40] [INFO ] Deduced a trap composed of 27 places in 97 ms
[2021-05-14 21:25:40] [INFO ] Deduced a trap composed of 26 places in 90 ms
[2021-05-14 21:25:40] [INFO ] Deduced a trap composed of 41 places in 57 ms
[2021-05-14 21:25:40] [INFO ] Deduced a trap composed of 41 places in 56 ms
[2021-05-14 21:25:40] [INFO ] Deduced a trap composed of 41 places in 58 ms
[2021-05-14 21:25:40] [INFO ] Deduced a trap composed of 41 places in 58 ms
[2021-05-14 21:25:40] [INFO ] Deduced a trap composed of 51 places in 59 ms
[2021-05-14 21:25:40] [INFO ] Deduced a trap composed of 9 places in 92 ms
[2021-05-14 21:25:40] [INFO ] Deduced a trap composed of 29 places in 94 ms
[2021-05-14 21:25:41] [INFO ] Deduced a trap composed of 27 places in 75 ms
[2021-05-14 21:25:41] [INFO ] Deduced a trap composed of 29 places in 81 ms
[2021-05-14 21:25:41] [INFO ] Deduced a trap composed of 11 places in 82 ms
[2021-05-14 21:25:41] [INFO ] Deduced a trap composed of 25 places in 75 ms
[2021-05-14 21:25:41] [INFO ] Deduced a trap composed of 27 places in 76 ms
[2021-05-14 21:25:41] [INFO ] Deduced a trap composed of 17 places in 75 ms
[2021-05-14 21:25:41] [INFO ] Deduced a trap composed of 25 places in 55 ms
[2021-05-14 21:25:41] [INFO ] Deduced a trap composed of 26 places in 53 ms
[2021-05-14 21:25:41] [INFO ] Deduced a trap composed of 44 places in 57 ms
[2021-05-14 21:25:41] [INFO ] Deduced a trap composed of 26 places in 55 ms
[2021-05-14 21:25:42] [INFO ] Deduced a trap composed of 60 places in 96 ms
[2021-05-14 21:25:42] [INFO ] Deduced a trap composed of 39 places in 75 ms
[2021-05-14 21:25:42] [INFO ] Deduced a trap composed of 21 places in 54 ms
[2021-05-14 21:25:42] [INFO ] Deduced a trap composed of 9 places in 100 ms
[2021-05-14 21:25:42] [INFO ] Deduced a trap composed of 36 places in 78 ms
[2021-05-14 21:25:42] [INFO ] Deduced a trap composed of 25 places in 55 ms
[2021-05-14 21:25:42] [INFO ] Deduced a trap composed of 33 places in 56 ms
[2021-05-14 21:25:42] [INFO ] Deduced a trap composed of 33 places in 57 ms
[2021-05-14 21:25:42] [INFO ] Deduced a trap composed of 33 places in 57 ms
[2021-05-14 21:25:42] [INFO ] Deduced a trap composed of 33 places in 57 ms
[2021-05-14 21:25:42] [INFO ] Deduced a trap composed of 27 places in 55 ms
[2021-05-14 21:25:42] [INFO ] Deduced a trap composed of 17 places in 59 ms
[2021-05-14 21:25:43] [INFO ] Deduced a trap composed of 27 places in 53 ms
[2021-05-14 21:25:43] [INFO ] Deduced a trap composed of 31 places in 81 ms
[2021-05-14 21:25:43] [INFO ] Deduced a trap composed of 27 places in 117 ms
[2021-05-14 21:25:43] [INFO ] Deduced a trap composed of 15 places in 103 ms
[2021-05-14 21:25:43] [INFO ] Deduced a trap composed of 17 places in 106 ms
[2021-05-14 21:25:43] [INFO ] Deduced a trap composed of 29 places in 80 ms
[2021-05-14 21:25:43] [INFO ] Deduced a trap composed of 36 places in 72 ms
[2021-05-14 21:25:43] [INFO ] Deduced a trap composed of 28 places in 65 ms
[2021-05-14 21:25:44] [INFO ] Deduced a trap composed of 20 places in 104 ms
[2021-05-14 21:25:44] [INFO ] Deduced a trap composed of 18 places in 114 ms
[2021-05-14 21:25:44] [INFO ] Deduced a trap composed of 39 places in 113 ms
[2021-05-14 21:25:44] [INFO ] Deduced a trap composed of 18 places in 100 ms
[2021-05-14 21:25:44] [INFO ] Deduced a trap composed of 10 places in 84 ms
[2021-05-14 21:25:44] [INFO ] Deduced a trap composed of 20 places in 104 ms
[2021-05-14 21:25:44] [INFO ] Deduced a trap composed of 29 places in 106 ms
[2021-05-14 21:25:45] [INFO ] Deduced a trap composed of 11 places in 84 ms
[2021-05-14 21:25:45] [INFO ] Deduced a trap composed of 37 places in 61 ms
[2021-05-14 21:25:45] [INFO ] Trap strengthening (SAT) tested/added 77/76 trap constraints in 8016 ms
[2021-05-14 21:25:45] [INFO ] Computed and/alt/rep : 703/4189/583 causal constraints in 30 ms.
[2021-05-14 21:25:48] [INFO ] Added : 417 causal constraints over 84 iterations in 3346 ms. Result :sat
[2021-05-14 21:25:48] [INFO ] Deduced a trap composed of 73 places in 102 ms
[2021-05-14 21:25:48] [INFO ] Deduced a trap composed of 51 places in 113 ms
[2021-05-14 21:25:48] [INFO ] Deduced a trap composed of 29 places in 101 ms
[2021-05-14 21:25:49] [INFO ] Deduced a trap composed of 32 places in 85 ms
[2021-05-14 21:25:49] [INFO ] Deduced a trap composed of 19 places in 85 ms
[2021-05-14 21:25:49] [INFO ] Deduced a trap composed of 11 places in 111 ms
[2021-05-14 21:25:49] [INFO ] Deduced a trap composed of 19 places in 96 ms
[2021-05-14 21:25:49] [INFO ] Deduced a trap composed of 37 places in 97 ms
[2021-05-14 21:25:49] [INFO ] Deduced a trap composed of 54 places in 95 ms
[2021-05-14 21:25:50] [INFO ] Deduced a trap composed of 61 places in 97 ms
[2021-05-14 21:25:50] [INFO ] Deduced a trap composed of 26 places in 87 ms
[2021-05-14 21:25:50] [INFO ] Deduced a trap composed of 23 places in 87 ms
[2021-05-14 21:25:50] [INFO ] Deduced a trap composed of 26 places in 86 ms
[2021-05-14 21:25:50] [INFO ] Deduced a trap composed of 11 places in 119 ms
[2021-05-14 21:25:50] [INFO ] Deduced a trap composed of 73 places in 92 ms
[2021-05-14 21:25:50] [INFO ] Deduced a trap composed of 21 places in 96 ms
[2021-05-14 21:25:51] [INFO ] Deduced a trap composed of 21 places in 91 ms
[2021-05-14 21:25:51] [INFO ] Deduced a trap composed of 35 places in 78 ms
[2021-05-14 21:25:51] [INFO ] Deduced a trap composed of 34 places in 78 ms
[2021-05-14 21:25:51] [INFO ] Deduced a trap composed of 43 places in 95 ms
[2021-05-14 21:25:52] [INFO ] Deduced a trap composed of 43 places in 94 ms
[2021-05-14 21:25:52] [INFO ] Deduced a trap composed of 42 places in 94 ms
[2021-05-14 21:25:52] [INFO ] Deduced a trap composed of 55 places in 97 ms
[2021-05-14 21:25:52] [INFO ] Deduced a trap composed of 42 places in 80 ms
[2021-05-14 21:25:52] [INFO ] Deduced a trap composed of 47 places in 64 ms
[2021-05-14 21:25:53] [INFO ] Deduced a trap composed of 35 places in 97 ms
[2021-05-14 21:25:53] [INFO ] Deduced a trap composed of 30 places in 101 ms
[2021-05-14 21:25:54] [INFO ] Deduced a trap composed of 59 places in 79 ms
[2021-05-14 21:25:54] [INFO ] Deduced a trap composed of 42 places in 59 ms
[2021-05-14 21:25:54] [INFO ] Deduced a trap composed of 43 places in 58 ms
[2021-05-14 21:25:54] [INFO ] Deduced a trap composed of 48 places in 86 ms
[2021-05-14 21:25:54] [INFO ] Deduced a trap composed of 37 places in 57 ms
[2021-05-14 21:25:54] [INFO ] Deduced a trap composed of 26 places in 56 ms
[2021-05-14 21:25:57] [INFO ] Deduced a trap composed of 34 places in 44 ms
[2021-05-14 21:25:58] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 9589 ms
Attempting to minimize the solution found.
Minimization took 31 ms.
Incomplete Parikh walk after 134500 steps, including 1000 resets, run finished after 1423 ms. (steps per millisecond=94 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 144100 steps, including 1000 resets, run finished after 1565 ms. (steps per millisecond=92 ) properties seen :[0, 0] could not realise parikh vector
Support contains 68 out of 301 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 301/301 places, 709/709 transitions.
Applied a total of 0 rules in 16 ms. Remains 301 /301 variables (removed 0) and now considering 709/709 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 301/301 places, 709/709 transitions.
Starting structural reductions, iteration 0 : 301/301 places, 709/709 transitions.
Applied a total of 0 rules in 12 ms. Remains 301 /301 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2021-05-14 21:26:01] [INFO ] Flow matrix only has 589 transitions (discarded 120 similar events)
// Phase 1: matrix 589 rows 301 cols
[2021-05-14 21:26:01] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-14 21:26:01] [INFO ] Implicit Places using invariants in 255 ms returned [252, 272, 273, 274, 275, 276]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 257 ms to find 6 implicit places.
[2021-05-14 21:26:01] [INFO ] Redundant transitions in 38 ms returned []
[2021-05-14 21:26:01] [INFO ] Flow matrix only has 589 transitions (discarded 120 similar events)
// Phase 1: matrix 589 rows 295 cols
[2021-05-14 21:26:01] [INFO ] Computed 17 place invariants in 3 ms
[2021-05-14 21:26:01] [INFO ] Dead Transitions using invariants and state equation in 558 ms returned []
Starting structural reductions, iteration 1 : 295/301 places, 709/709 transitions.
Applied a total of 0 rules in 11 ms. Remains 295 /295 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2021-05-14 21:26:02] [INFO ] Redundant transitions in 7 ms returned []
[2021-05-14 21:26:02] [INFO ] Flow matrix only has 589 transitions (discarded 120 similar events)
// Phase 1: matrix 589 rows 295 cols
[2021-05-14 21:26:02] [INFO ] Computed 17 place invariants in 3 ms
[2021-05-14 21:26:02] [INFO ] Dead Transitions using invariants and state equation in 565 ms returned []
Finished structural reductions, in 2 iterations. Remains : 295/301 places, 709/709 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 11154 ms. (steps per millisecond=89 ) properties seen :[0, 0]
Interrupted Best-First random walk after 396550 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=79 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2056 ms. (steps per millisecond=486 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 8905428 steps, run timeout after 30001 ms. (steps per millisecond=296 ) properties seen :[0, 0]
Probabilistic random walk after 8905428 steps, saw 1272205 distinct states, run finished after 30001 ms. (steps per millisecond=296 ) properties seen :[0, 0]
[2021-05-14 21:26:50] [INFO ] Flow matrix only has 589 transitions (discarded 120 similar events)
// Phase 1: matrix 589 rows 295 cols
[2021-05-14 21:26:50] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-14 21:26:50] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2021-05-14 21:26:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:26:51] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2021-05-14 21:26:51] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 21:26:51] [INFO ] [Real]Added 230 Read/Feed constraints in 29 ms returned sat
[2021-05-14 21:26:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:26:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 45 ms returned sat
[2021-05-14 21:26:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:26:51] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2021-05-14 21:26:51] [INFO ] [Nat]Added 230 Read/Feed constraints in 24 ms returned sat
[2021-05-14 21:26:51] [INFO ] Deduced a trap composed of 11 places in 109 ms
[2021-05-14 21:26:51] [INFO ] Deduced a trap composed of 28 places in 114 ms
[2021-05-14 21:26:51] [INFO ] Deduced a trap composed of 12 places in 102 ms
[2021-05-14 21:26:52] [INFO ] Deduced a trap composed of 10 places in 99 ms
[2021-05-14 21:26:52] [INFO ] Deduced a trap composed of 43 places in 81 ms
[2021-05-14 21:26:52] [INFO ] Deduced a trap composed of 27 places in 96 ms
[2021-05-14 21:26:52] [INFO ] Deduced a trap composed of 27 places in 96 ms
[2021-05-14 21:26:52] [INFO ] Deduced a trap composed of 21 places in 90 ms
[2021-05-14 21:26:52] [INFO ] Deduced a trap composed of 28 places in 94 ms
[2021-05-14 21:26:52] [INFO ] Deduced a trap composed of 19 places in 95 ms
[2021-05-14 21:26:52] [INFO ] Deduced a trap composed of 28 places in 78 ms
[2021-05-14 21:26:52] [INFO ] Deduced a trap composed of 28 places in 81 ms
[2021-05-14 21:26:53] [INFO ] Deduced a trap composed of 34 places in 88 ms
[2021-05-14 21:26:53] [INFO ] Deduced a trap composed of 9 places in 87 ms
[2021-05-14 21:26:53] [INFO ] Deduced a trap composed of 9 places in 90 ms
[2021-05-14 21:26:53] [INFO ] Deduced a trap composed of 9 places in 88 ms
[2021-05-14 21:26:53] [INFO ] Deduced a trap composed of 46 places in 72 ms
[2021-05-14 21:26:53] [INFO ] Deduced a trap composed of 35 places in 72 ms
[2021-05-14 21:26:53] [INFO ] Deduced a trap composed of 64 places in 73 ms
[2021-05-14 21:26:53] [INFO ] Deduced a trap composed of 27 places in 73 ms
[2021-05-14 21:26:53] [INFO ] Deduced a trap composed of 26 places in 72 ms
[2021-05-14 21:26:53] [INFO ] Deduced a trap composed of 20 places in 88 ms
[2021-05-14 21:26:54] [INFO ] Deduced a trap composed of 36 places in 88 ms
[2021-05-14 21:26:54] [INFO ] Deduced a trap composed of 36 places in 84 ms
[2021-05-14 21:26:54] [INFO ] Deduced a trap composed of 20 places in 85 ms
[2021-05-14 21:26:54] [INFO ] Deduced a trap composed of 42 places in 85 ms
[2021-05-14 21:26:54] [INFO ] Deduced a trap composed of 34 places in 117 ms
[2021-05-14 21:26:54] [INFO ] Deduced a trap composed of 26 places in 88 ms
[2021-05-14 21:26:54] [INFO ] Deduced a trap composed of 17 places in 84 ms
[2021-05-14 21:26:54] [INFO ] Deduced a trap composed of 20 places in 82 ms
[2021-05-14 21:26:54] [INFO ] Deduced a trap composed of 35 places in 65 ms
[2021-05-14 21:26:54] [INFO ] Deduced a trap composed of 11 places in 74 ms
[2021-05-14 21:26:55] [INFO ] Deduced a trap composed of 44 places in 71 ms
[2021-05-14 21:26:55] [INFO ] Deduced a trap composed of 42 places in 82 ms
[2021-05-14 21:26:55] [INFO ] Deduced a trap composed of 45 places in 71 ms
[2021-05-14 21:26:55] [INFO ] Deduced a trap composed of 12 places in 73 ms
[2021-05-14 21:26:55] [INFO ] Deduced a trap composed of 19 places in 82 ms
[2021-05-14 21:26:55] [INFO ] Deduced a trap composed of 44 places in 74 ms
[2021-05-14 21:26:55] [INFO ] Deduced a trap composed of 11 places in 64 ms
[2021-05-14 21:26:55] [INFO ] Deduced a trap composed of 10 places in 86 ms
[2021-05-14 21:26:55] [INFO ] Deduced a trap composed of 21 places in 99 ms
[2021-05-14 21:26:56] [INFO ] Deduced a trap composed of 35 places in 112 ms
[2021-05-14 21:26:56] [INFO ] Deduced a trap composed of 65 places in 102 ms
[2021-05-14 21:26:56] [INFO ] Deduced a trap composed of 23 places in 103 ms
[2021-05-14 21:26:56] [INFO ] Deduced a trap composed of 10 places in 101 ms
[2021-05-14 21:26:56] [INFO ] Deduced a trap composed of 20 places in 86 ms
[2021-05-14 21:26:56] [INFO ] Deduced a trap composed of 18 places in 36 ms
[2021-05-14 21:26:56] [INFO ] Deduced a trap composed of 10 places in 97 ms
[2021-05-14 21:26:56] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 5110 ms
[2021-05-14 21:26:56] [INFO ] Computed and/alt/rep : 703/4189/583 causal constraints in 29 ms.
[2021-05-14 21:27:01] [INFO ] Added : 479 causal constraints over 96 iterations in 4546 ms. Result :sat
[2021-05-14 21:27:01] [INFO ] Deduced a trap composed of 33 places in 83 ms
[2021-05-14 21:27:01] [INFO ] Deduced a trap composed of 25 places in 80 ms
[2021-05-14 21:27:01] [INFO ] Deduced a trap composed of 26 places in 81 ms
[2021-05-14 21:27:01] [INFO ] Deduced a trap composed of 17 places in 80 ms
[2021-05-14 21:27:01] [INFO ] Deduced a trap composed of 21 places in 81 ms
[2021-05-14 21:27:02] [INFO ] Deduced a trap composed of 49 places in 77 ms
[2021-05-14 21:27:02] [INFO ] Deduced a trap composed of 43 places in 76 ms
[2021-05-14 21:27:02] [INFO ] Deduced a trap composed of 43 places in 79 ms
[2021-05-14 21:27:02] [INFO ] Deduced a trap composed of 17 places in 79 ms
[2021-05-14 21:27:02] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1489 ms
Attempting to minimize the solution found.
Minimization took 37 ms.
[2021-05-14 21:27:02] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2021-05-14 21:27:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:27:03] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2021-05-14 21:27:03] [INFO ] [Real]Added 230 Read/Feed constraints in 20 ms returned sat
[2021-05-14 21:27:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:27:03] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2021-05-14 21:27:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:27:03] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2021-05-14 21:27:03] [INFO ] [Nat]Added 230 Read/Feed constraints in 24 ms returned sat
[2021-05-14 21:27:03] [INFO ] Deduced a trap composed of 21 places in 110 ms
[2021-05-14 21:27:03] [INFO ] Deduced a trap composed of 20 places in 109 ms
[2021-05-14 21:27:03] [INFO ] Deduced a trap composed of 20 places in 111 ms
[2021-05-14 21:27:04] [INFO ] Deduced a trap composed of 12 places in 111 ms
[2021-05-14 21:27:04] [INFO ] Deduced a trap composed of 29 places in 101 ms
[2021-05-14 21:27:04] [INFO ] Deduced a trap composed of 28 places in 102 ms
[2021-05-14 21:27:04] [INFO ] Deduced a trap composed of 28 places in 100 ms
[2021-05-14 21:27:04] [INFO ] Deduced a trap composed of 29 places in 100 ms
[2021-05-14 21:27:04] [INFO ] Deduced a trap composed of 37 places in 107 ms
[2021-05-14 21:27:04] [INFO ] Deduced a trap composed of 37 places in 102 ms
[2021-05-14 21:27:04] [INFO ] Deduced a trap composed of 37 places in 101 ms
[2021-05-14 21:27:04] [INFO ] Deduced a trap composed of 37 places in 102 ms
[2021-05-14 21:27:05] [INFO ] Deduced a trap composed of 21 places in 102 ms
[2021-05-14 21:27:05] [INFO ] Deduced a trap composed of 20 places in 101 ms
[2021-05-14 21:27:05] [INFO ] Deduced a trap composed of 20 places in 108 ms
[2021-05-14 21:27:05] [INFO ] Deduced a trap composed of 29 places in 107 ms
[2021-05-14 21:27:05] [INFO ] Deduced a trap composed of 11 places in 96 ms
[2021-05-14 21:27:05] [INFO ] Deduced a trap composed of 12 places in 95 ms
[2021-05-14 21:27:05] [INFO ] Deduced a trap composed of 9 places in 94 ms
[2021-05-14 21:27:05] [INFO ] Deduced a trap composed of 11 places in 96 ms
[2021-05-14 21:27:05] [INFO ] Deduced a trap composed of 37 places in 91 ms
[2021-05-14 21:27:06] [INFO ] Deduced a trap composed of 36 places in 76 ms
[2021-05-14 21:27:06] [INFO ] Deduced a trap composed of 44 places in 78 ms
[2021-05-14 21:27:06] [INFO ] Deduced a trap composed of 44 places in 77 ms
[2021-05-14 21:27:06] [INFO ] Deduced a trap composed of 45 places in 81 ms
[2021-05-14 21:27:06] [INFO ] Deduced a trap composed of 11 places in 48 ms
[2021-05-14 21:27:06] [INFO ] Deduced a trap composed of 13 places in 77 ms
[2021-05-14 21:27:06] [INFO ] Deduced a trap composed of 45 places in 55 ms
[2021-05-14 21:27:06] [INFO ] Deduced a trap composed of 45 places in 54 ms
[2021-05-14 21:27:06] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 3150 ms
[2021-05-14 21:27:06] [INFO ] Computed and/alt/rep : 703/4189/583 causal constraints in 32 ms.
[2021-05-14 21:27:10] [INFO ] Added : 485 causal constraints over 97 iterations in 3832 ms. Result :sat
[2021-05-14 21:27:10] [INFO ] Deduced a trap composed of 25 places in 97 ms
[2021-05-14 21:27:10] [INFO ] Deduced a trap composed of 17 places in 91 ms
[2021-05-14 21:27:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 305 ms
Attempting to minimize the solution found.
Minimization took 29 ms.
Incomplete Parikh walk after 90700 steps, including 1000 resets, run finished after 982 ms. (steps per millisecond=92 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 174200 steps, including 1000 resets, run finished after 1913 ms. (steps per millisecond=91 ) properties seen :[0, 0] could not realise parikh vector
Support contains 68 out of 295 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 295/295 places, 709/709 transitions.
Applied a total of 0 rules in 11 ms. Remains 295 /295 variables (removed 0) and now considering 709/709 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 295/295 places, 709/709 transitions.
Starting structural reductions, iteration 0 : 295/295 places, 709/709 transitions.
Applied a total of 0 rules in 10 ms. Remains 295 /295 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2021-05-14 21:27:13] [INFO ] Flow matrix only has 589 transitions (discarded 120 similar events)
// Phase 1: matrix 589 rows 295 cols
[2021-05-14 21:27:13] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-14 21:27:13] [INFO ] Implicit Places using invariants in 203 ms returned []
[2021-05-14 21:27:13] [INFO ] Flow matrix only has 589 transitions (discarded 120 similar events)
// Phase 1: matrix 589 rows 295 cols
[2021-05-14 21:27:13] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-14 21:27:14] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 21:27:15] [INFO ] Implicit Places using invariants and state equation in 1632 ms returned []
Implicit Place search using SMT with State Equation took 1836 ms to find 0 implicit places.
[2021-05-14 21:27:15] [INFO ] Redundant transitions in 4 ms returned []
[2021-05-14 21:27:15] [INFO ] Flow matrix only has 589 transitions (discarded 120 similar events)
// Phase 1: matrix 589 rows 295 cols
[2021-05-14 21:27:15] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-14 21:27:16] [INFO ] Dead Transitions using invariants and state equation in 577 ms returned []
Finished structural reductions, in 1 iterations. Remains : 295/295 places, 709/709 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1120 ms. (steps per millisecond=89 ) properties seen :[0, 0]
[2021-05-14 21:27:17] [INFO ] Flow matrix only has 589 transitions (discarded 120 similar events)
// Phase 1: matrix 589 rows 295 cols
[2021-05-14 21:27:17] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-14 21:27:17] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-14 21:27:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:27:17] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2021-05-14 21:27:17] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 21:27:17] [INFO ] [Real]Added 230 Read/Feed constraints in 30 ms returned sat
[2021-05-14 21:27:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:27:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 44 ms returned sat
[2021-05-14 21:27:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:27:18] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2021-05-14 21:27:18] [INFO ] [Nat]Added 230 Read/Feed constraints in 25 ms returned sat
[2021-05-14 21:27:18] [INFO ] Deduced a trap composed of 11 places in 108 ms
[2021-05-14 21:27:18] [INFO ] Deduced a trap composed of 28 places in 110 ms
[2021-05-14 21:27:18] [INFO ] Deduced a trap composed of 12 places in 101 ms
[2021-05-14 21:27:18] [INFO ] Deduced a trap composed of 10 places in 99 ms
[2021-05-14 21:27:18] [INFO ] Deduced a trap composed of 43 places in 81 ms
[2021-05-14 21:27:18] [INFO ] Deduced a trap composed of 27 places in 96 ms
[2021-05-14 21:27:18] [INFO ] Deduced a trap composed of 27 places in 96 ms
[2021-05-14 21:27:19] [INFO ] Deduced a trap composed of 21 places in 88 ms
[2021-05-14 21:27:19] [INFO ] Deduced a trap composed of 28 places in 99 ms
[2021-05-14 21:27:19] [INFO ] Deduced a trap composed of 19 places in 95 ms
[2021-05-14 21:27:19] [INFO ] Deduced a trap composed of 28 places in 80 ms
[2021-05-14 21:27:19] [INFO ] Deduced a trap composed of 28 places in 81 ms
[2021-05-14 21:27:19] [INFO ] Deduced a trap composed of 34 places in 89 ms
[2021-05-14 21:27:19] [INFO ] Deduced a trap composed of 9 places in 102 ms
[2021-05-14 21:27:19] [INFO ] Deduced a trap composed of 9 places in 88 ms
[2021-05-14 21:27:19] [INFO ] Deduced a trap composed of 9 places in 92 ms
[2021-05-14 21:27:20] [INFO ] Deduced a trap composed of 46 places in 73 ms
[2021-05-14 21:27:20] [INFO ] Deduced a trap composed of 35 places in 72 ms
[2021-05-14 21:27:20] [INFO ] Deduced a trap composed of 64 places in 74 ms
[2021-05-14 21:27:20] [INFO ] Deduced a trap composed of 27 places in 72 ms
[2021-05-14 21:27:20] [INFO ] Deduced a trap composed of 26 places in 72 ms
[2021-05-14 21:27:20] [INFO ] Deduced a trap composed of 20 places in 87 ms
[2021-05-14 21:27:20] [INFO ] Deduced a trap composed of 36 places in 85 ms
[2021-05-14 21:27:20] [INFO ] Deduced a trap composed of 36 places in 86 ms
[2021-05-14 21:27:20] [INFO ] Deduced a trap composed of 20 places in 85 ms
[2021-05-14 21:27:20] [INFO ] Deduced a trap composed of 42 places in 85 ms
[2021-05-14 21:27:21] [INFO ] Deduced a trap composed of 34 places in 82 ms
[2021-05-14 21:27:21] [INFO ] Deduced a trap composed of 26 places in 83 ms
[2021-05-14 21:27:21] [INFO ] Deduced a trap composed of 17 places in 86 ms
[2021-05-14 21:27:21] [INFO ] Deduced a trap composed of 20 places in 87 ms
[2021-05-14 21:27:21] [INFO ] Deduced a trap composed of 35 places in 64 ms
[2021-05-14 21:27:21] [INFO ] Deduced a trap composed of 11 places in 79 ms
[2021-05-14 21:27:21] [INFO ] Deduced a trap composed of 44 places in 71 ms
[2021-05-14 21:27:21] [INFO ] Deduced a trap composed of 42 places in 73 ms
[2021-05-14 21:27:21] [INFO ] Deduced a trap composed of 45 places in 71 ms
[2021-05-14 21:27:21] [INFO ] Deduced a trap composed of 12 places in 75 ms
[2021-05-14 21:27:22] [INFO ] Deduced a trap composed of 19 places in 82 ms
[2021-05-14 21:27:22] [INFO ] Deduced a trap composed of 44 places in 74 ms
[2021-05-14 21:27:22] [INFO ] Deduced a trap composed of 11 places in 64 ms
[2021-05-14 21:27:22] [INFO ] Deduced a trap composed of 10 places in 88 ms
[2021-05-14 21:27:22] [INFO ] Deduced a trap composed of 21 places in 101 ms
[2021-05-14 21:27:22] [INFO ] Deduced a trap composed of 35 places in 102 ms
[2021-05-14 21:27:22] [INFO ] Deduced a trap composed of 65 places in 102 ms
[2021-05-14 21:27:22] [INFO ] Deduced a trap composed of 23 places in 102 ms
[2021-05-14 21:27:22] [INFO ] Deduced a trap composed of 10 places in 98 ms
[2021-05-14 21:27:23] [INFO ] Deduced a trap composed of 20 places in 88 ms
[2021-05-14 21:27:23] [INFO ] Deduced a trap composed of 18 places in 18 ms
[2021-05-14 21:27:23] [INFO ] Deduced a trap composed of 10 places in 106 ms
[2021-05-14 21:27:23] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 5087 ms
[2021-05-14 21:27:23] [INFO ] Computed and/alt/rep : 703/4189/583 causal constraints in 29 ms.
[2021-05-14 21:27:27] [INFO ] Added : 479 causal constraints over 96 iterations in 4459 ms. Result :sat
[2021-05-14 21:27:27] [INFO ] Deduced a trap composed of 33 places in 86 ms
[2021-05-14 21:27:27] [INFO ] Deduced a trap composed of 25 places in 82 ms
[2021-05-14 21:27:28] [INFO ] Deduced a trap composed of 26 places in 80 ms
[2021-05-14 21:27:28] [INFO ] Deduced a trap composed of 17 places in 80 ms
[2021-05-14 21:27:28] [INFO ] Deduced a trap composed of 21 places in 79 ms
[2021-05-14 21:27:28] [INFO ] Deduced a trap composed of 49 places in 79 ms
[2021-05-14 21:27:28] [INFO ] Deduced a trap composed of 43 places in 76 ms
[2021-05-14 21:27:28] [INFO ] Deduced a trap composed of 43 places in 78 ms
[2021-05-14 21:27:29] [INFO ] Deduced a trap composed of 17 places in 81 ms
[2021-05-14 21:27:29] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1492 ms
[2021-05-14 21:27:29] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2021-05-14 21:27:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:27:29] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2021-05-14 21:27:29] [INFO ] [Real]Added 230 Read/Feed constraints in 20 ms returned sat
[2021-05-14 21:27:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:27:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2021-05-14 21:27:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:27:29] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2021-05-14 21:27:29] [INFO ] [Nat]Added 230 Read/Feed constraints in 24 ms returned sat
[2021-05-14 21:27:29] [INFO ] Deduced a trap composed of 21 places in 113 ms
[2021-05-14 21:27:30] [INFO ] Deduced a trap composed of 20 places in 111 ms
[2021-05-14 21:27:30] [INFO ] Deduced a trap composed of 20 places in 109 ms
[2021-05-14 21:27:30] [INFO ] Deduced a trap composed of 12 places in 110 ms
[2021-05-14 21:27:30] [INFO ] Deduced a trap composed of 29 places in 102 ms
[2021-05-14 21:27:30] [INFO ] Deduced a trap composed of 28 places in 105 ms
[2021-05-14 21:27:30] [INFO ] Deduced a trap composed of 28 places in 103 ms
[2021-05-14 21:27:30] [INFO ] Deduced a trap composed of 29 places in 102 ms
[2021-05-14 21:27:30] [INFO ] Deduced a trap composed of 37 places in 102 ms
[2021-05-14 21:27:31] [INFO ] Deduced a trap composed of 37 places in 101 ms
[2021-05-14 21:27:31] [INFO ] Deduced a trap composed of 37 places in 102 ms
[2021-05-14 21:27:31] [INFO ] Deduced a trap composed of 37 places in 102 ms
[2021-05-14 21:27:31] [INFO ] Deduced a trap composed of 21 places in 102 ms
[2021-05-14 21:27:31] [INFO ] Deduced a trap composed of 20 places in 101 ms
[2021-05-14 21:27:31] [INFO ] Deduced a trap composed of 20 places in 112 ms
[2021-05-14 21:27:31] [INFO ] Deduced a trap composed of 29 places in 107 ms
[2021-05-14 21:27:31] [INFO ] Deduced a trap composed of 11 places in 98 ms
[2021-05-14 21:27:32] [INFO ] Deduced a trap composed of 12 places in 96 ms
[2021-05-14 21:27:32] [INFO ] Deduced a trap composed of 9 places in 94 ms
[2021-05-14 21:27:32] [INFO ] Deduced a trap composed of 11 places in 94 ms
[2021-05-14 21:27:32] [INFO ] Deduced a trap composed of 37 places in 93 ms
[2021-05-14 21:27:32] [INFO ] Deduced a trap composed of 36 places in 77 ms
[2021-05-14 21:27:32] [INFO ] Deduced a trap composed of 44 places in 94 ms
[2021-05-14 21:27:32] [INFO ] Deduced a trap composed of 44 places in 78 ms
[2021-05-14 21:27:32] [INFO ] Deduced a trap composed of 45 places in 85 ms
[2021-05-14 21:27:32] [INFO ] Deduced a trap composed of 11 places in 48 ms
[2021-05-14 21:27:32] [INFO ] Deduced a trap composed of 13 places in 80 ms
[2021-05-14 21:27:32] [INFO ] Deduced a trap composed of 45 places in 55 ms
[2021-05-14 21:27:33] [INFO ] Deduced a trap composed of 45 places in 55 ms
[2021-05-14 21:27:33] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 3181 ms
[2021-05-14 21:27:33] [INFO ] Computed and/alt/rep : 703/4189/583 causal constraints in 30 ms.
[2021-05-14 21:27:36] [INFO ] Added : 485 causal constraints over 97 iterations in 3782 ms. Result :sat
[2021-05-14 21:27:36] [INFO ] Deduced a trap composed of 25 places in 97 ms
[2021-05-14 21:27:37] [INFO ] Deduced a trap composed of 17 places in 90 ms
[2021-05-14 21:27:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 301 ms
Graph (trivial) has 448 edges and 295 vertex of which 179 / 295 are part of one of the 30 SCC in 5 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 143 transitions
Reduce isomorphic transitions removed 441 transitions.
Iterating post reduction 0 with 441 rules applied. Total rules applied 442 place count 146 transition count 268
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 23 Pre rules applied. Total rules applied 442 place count 146 transition count 245
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 1 with 46 rules applied. Total rules applied 488 place count 123 transition count 245
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 490 place count 122 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 491 place count 122 transition count 249
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 497 place count 122 transition count 243
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 509 place count 116 transition count 237
Applied a total of 509 rules in 20 ms. Remains 116 /295 variables (removed 179) and now considering 237/709 (removed 472) transitions.
// Phase 1: matrix 237 rows 116 cols
[2021-05-14 21:27:37] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-14 21:27:37] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2021-05-14 21:27:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:27:37] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2021-05-14 21:27:37] [INFO ] Computed and/alt/rep : 231/1064/231 causal constraints in 11 ms.
[2021-05-14 21:27:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:27:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 29 ms returned sat
[2021-05-14 21:27:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:27:37] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2021-05-14 21:27:37] [INFO ] Computed and/alt/rep : 231/1064/231 causal constraints in 12 ms.
[2021-05-14 21:27:38] [INFO ] Added : 227 causal constraints over 46 iterations in 647 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2021-05-14 21:27:38] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2021-05-14 21:27:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:27:38] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2021-05-14 21:27:38] [INFO ] Computed and/alt/rep : 231/1064/231 causal constraints in 13 ms.
[2021-05-14 21:27:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:27:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2021-05-14 21:27:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:27:38] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2021-05-14 21:27:38] [INFO ] Computed and/alt/rep : 231/1064/231 causal constraints in 12 ms.
[2021-05-14 21:27:39] [INFO ] Added : 229 causal constraints over 46 iterations in 601 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2021-05-14 21:27:39] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2021-05-14 21:27:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
[2021-05-14 21:27:39] [INFO ] Flatten gal took : 94 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ Peterson-PT-5 @ 3570 seconds

FORMULA Peterson-PT-5-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-5-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3300
rslt: Output for ReachabilityFireability @ Peterson-PT-5

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 14 21:27:40 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1779
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p195) AND (1 <= p219))))",
"processed_size": 37,
"rewrites": 1
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3558
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 187,
"aneg": 0,
"comp": 366,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 366,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 66,
"visible_transitions": 0
},
"processed": "A (G (((((p253 <= 0) OR (p264 <= 0)) AND ((p260 <= 0) OR (p288 <= 0)) AND ((p235 <= 0) OR (p266 <= 0)) AND ((p255 <= 0) OR (p279 <= 0)) AND ((p250 <= 0) OR (p269 <= 0)) AND ((p244 <= 0) OR (p270 <= 0)) AND ((p262 <= 0) OR (p268 <= 0)) AND ((p230 <= 0) OR (p236 <= 0)) AND ((p232 <= 0) OR (p280 <= 0)) AND ((p256 <= 0) OR (p289 <= 0)) AND ((p249 <= 0) OR (p278 <= 0)) AND ((p239 <= 0) OR (p276 <= 0)) AND ((p257 <= 0) OR (p267 <= 0)) AND ((p232 <= 0) OR (p272 <= 0)) AND ((p233 <= 0) OR (p266 <= 0)) AND ((p247 <= 0) OR (p287 <= 0)) AND ((p235 <= 0) OR (p277 <= 0)) AND ((p241 <= 0) OR (p265 <= 0)) AND ((p231 <= 0) OR (p248 <= 0)) AND ((p244 <= 0) OR (p281 <= 0)) AND ((p240 <= 0) OR (p274 <= 0)) AND ((p256 <= 0) OR (p273 <= 0)) AND ((p251 <= 0) OR (p263 <= 0)) AND ((p247 <= 0) OR (p271 <= 0)) AND ((p257 <= 0) OR (p282 <= 0)) AND ((p238 <= 0) OR (p283 <= 0)) AND ((p234 <= 0) OR (p280 <= 0)) AND ((p237 <= 0) OR (p273 <= 0)) AND ((p246 <= 0) OR (p270 <= 0)) AND ((p229 <= 0) OR (p251 <= 0)) AND ((p259 <= 0) OR (p263 <= 0)) AND ((p253 <= 0) OR (p275 <= 0)) AND ((p234 <= 0) OR (p272 <= 0)) AND ((p245 <= 0) OR (p283 <= 0)) AND ((p261 <= 0) OR (p285 <= 0)) AND ((p230 <= 0) OR (p256 <= 0)) AND ((p255 <= 0) OR (p268 <= 0)) AND ((p237 <= 0) OR (p289 <= 0)) AND ((p262 <= 0) OR (p279 <= 0)) AND ((p229 <= 0) OR (p262 <= 0)) AND ((p233 <= 0) OR (p286 <= 0)) AND ((p250 <= 0) OR (p284 <= 0)) AND ((p246 <= 0) OR (p281 <= 0)) AND ((p258 <= 0) OR (p276 <= 0)) AND ((p243 <= 0) OR (p265 <= 0)) AND ((p249 <= 0) OR (p264 <= 0)) AND ((p240 <= 0) OR (p271 <= 0)) AND ((p236 <= 0) OR (p282 <= 0)) AND ((p259 <= 0) OR (p279 <= 0)) AND ((p260 <= 0) OR (p285 <= 0)) AND ((p241 <= 0) OR (p281 <= 0)) AND ((p230 <= 0) OR (p237 <= 0)) AND ((p254 <= 0) OR (p284 <= 0)) AND ((p262 <= 0) OR (p263 <= 0)) AND ((p251 <= 0) OR (p279 <= 0)) AND ((p235 <= 0) OR (p272 <= 0)) AND ((p244 <= 0) OR (p265 <= 0)) AND ((p239 <= 0) OR (p273 <= 0)) AND ((p252 <= 0) OR (p269 <= 0)) AND ((p232 <= 0) OR (p277 <= 0)) AND ((p249 <= 0) OR (p275 <= 0)) AND ((p240 <= 0) OR (p287 <= 0)) AND ((p231 <= 0) OR (p254 <= 0)) AND ((p235 <= 0) OR (p280 <= 0)) AND ((p241 <= 0) OR (p270 <= 0)) AND ((p236 <= 0) OR (p267 <= 0)) AND ((p256 <= 0) OR (p276 <= 0)) AND ((p248 <= 0) OR (p284 <= 0)) AND ((p239 <= 0) OR (p289 <= 0)) AND ((p243 <= 0) OR (p281 <= 0)) AND ((p246 <= 0) OR (p265 <= 0)) AND ((p247 <= 0) OR (p274 <= 0)) AND ((p252 <= 0) OR (p284 <= 0)) AND ((p258 <= 0) OR (p289 <= 0)) AND ((p248 <= 0) OR (p269 <= 0)) AND ((p238 <= 0) OR (p286 <= 0)) AND ((p237 <= 0) OR (p276 <= 0)) AND ((p261 <= 0) OR (p288 <= 0)) AND ((p243 <= 0) OR (p270 <= 0)) AND ((p230 <= 0) OR (p257 <= 0)) AND ((p254 <= 0) OR (p269 <= 0)) AND ((p234 <= 0) OR (p277 <= 0)) AND ((p229 <= 0) OR (p255 <= 0)) AND ((p253 <= 0) OR (p278 <= 0)) AND ((p245 <= 0) OR (p286 <= 0)) AND ((p251 <= 0) OR (p268 <= 0)) AND ((p229 <= 0) OR (p259 <= 0)) AND ((p259 <= 0) OR (p268 <= 0)) AND ((p258 <= 0) OR (p273 <= 0)) AND ((p255 <= 0) OR (p263 <= 0)) AND ((p233 <= 0) OR (p283 <= 0)) AND ((p258 <= 0) OR (p267 <= 0)) AND ((p251 <= 0) OR (p288 <= 0)) AND ((p255 <= 0) OR (p285 <= 0)) AND ((p254 <= 0) OR (p275 <= 0)) AND ((p234 <= 0) OR (p266 <= 0)) AND ((p246 <= 0) OR (p287 <= 0)) AND ((p240 <= 0) OR (p265 <= 0)) AND ((p236 <= 0) OR (p289 <= 0)) AND ((p232 <= 0) OR (p286 <= 0)) AND ((p245 <= 0) OR (p277 <= 0)) AND ((p241 <= 0) OR (p274 <= 0)) AND ((p247 <= 0) OR (p281 <= 0)) AND ((p235 <= 0) OR (p283 <= 0)) AND ((p252 <= 0) OR (p264 <= 0)) AND ((p244 <= 0) OR (p271 <= 0)) AND ((p236 <= 0) OR (p273 <= 0)) AND ((p231 <= 0) OR (p250 <= 0)) AND ((p239 <= 0) OR (p282 <= 0)) AND ((p261 <= 0) OR (p268 <= 0)) AND ((p259 <= 0) OR (p288 <= 0)) AND ((p231 <= 0) OR (p253 <= 0)) AND ((p249 <= 0) OR (p269 <= 0)) AND ((p245 <= 0) OR (p266 <= 0)) AND ((p247 <= 0) OR (p270 <= 0)) AND ((p232 <= 0) OR (p266 <= 0)) AND ((p234 <= 0) OR (p286 <= 0)) AND ((p238 <= 0) OR (p277 <= 0)) AND ((p260 <= 0) OR (p263 <= 0)) AND ((p233 <= 0) OR (p272 <= 0)) AND ((p248 <= 0) OR (p275 <= 0)) AND ((p252 <= 0) OR (p275 <= 0)) AND ((p244 <= 0) OR (p287 <= 0)) AND ((p262 <= 0) OR (p285 <= 0)) AND ((p249 <= 0) OR (p284 <= 0)) AND ((p261 <= 0) OR (p279 <= 0)) AND ((p257 <= 0) OR (p276 <= 0)) AND ((p243 <= 0) OR (p274 <= 0)) AND ((p238 <= 0) OR (p266 <= 0)) AND ((p254 <= 0) OR (p264 <= 0)) AND ((p230 <= 0) OR (p258 <= 0)) AND ((p248 <= 0) OR (p264 <= 0)) AND ((p258 <= 0) OR (p282 <= 0)) AND ((p246 <= 0) OR (p271 <= 0)) AND ((p229 <= 0) OR (p260 <= 0)) AND ((p233 <= 0) OR (p280 <= 0)) AND ((p250 <= 0) OR (p278 <= 0)) AND ((p251 <= 0) OR (p285 <= 0)) AND ((p245 <= 0) OR (p272 <= 0)) AND ((p254 <= 0) OR (p278 <= 0)) AND ((p236 <= 0) OR (p276 <= 0)) AND ((p253 <= 0) OR (p269 <= 0)) AND ((p250 <= 0) OR (p275 <= 0)) AND ((p240 <= 0) OR (p270 <= 0)) AND ((p230 <= 0) OR (p239 <= 0)) AND ((p245 <= 0) OR (p280 <= 0)) AND ((p241 <= 0) OR (p271 <= 0)) AND ((p232 <= 0) OR (p283 <= 0)) AND ((p244 <= 0) OR (p274 <= 0)) AND ((p256 <= 0) OR (p282 <= 0)) AND ((p250 <= 0) OR (p264 <= 0)) AND ((p240 <= 0) OR (p281 <= 0)) AND ((p259 <= 0) OR (p285 <= 0)) AND ((p231 <= 0) OR (p249 <= 0)) AND ((p260 <= 0) OR (p279 <= 0)) AND ((p243 <= 0) OR (p287 <= 0)) AND ((p261 <= 0) OR (p263 <= 0)) AND ((p231 <= 0) OR (p252 <= 0)) AND ((p235 <= 0) OR (p286 <= 0)) AND ((p255 <= 0) OR (p288 <= 0)) AND ((p237 <= 0) OR (p267 <= 0)) AND ((p248 <= 0) OR (p278 <= 0)) AND ((p238 <= 0) OR (p280 <= 0)) AND ((p262 <= 0) OR (p288 <= 0)) AND ((p233 <= 0) OR (p277 <= 0)) AND ((p252 <= 0) OR (p278 <= 0)) AND ((p257 <= 0) OR (p273 <= 0)) AND ((p260 <= 0) OR (p268 <= 0)) AND ((p256 <= 0) OR (p267 <= 0)) AND ((p243 <= 0) OR (p271 <= 0)) AND ((p234 <= 0) OR (p283 <= 0)) AND ((p237 <= 0) OR (p282 <= 0)) AND ((p253 <= 0) OR (p284 <= 0)) AND ((p239 <= 0) OR (p267 <= 0)) AND ((p246 <= 0) OR (p274 <= 0)) AND ((p247 <= 0) OR (p265 <= 0)) AND ((p241 <= 0) OR (p287 <= 0)) AND ((p229 <= 0) OR (p261 <= 0)) AND ((p257 <= 0) OR (p289 <= 0)) AND ((p238 <= 0) OR (p272 <= 0))) OR (((p159 <= 0)) AND ((p165 <= 0)) AND ((p164 <= 0)) AND ((p163 <= 0)) AND ((p137 <= 0)) AND ((p166 <= 0))))))",
"processed_size": 6237,
"rewrites": 2
},
"result":
{
"edges": 44044212,
"markings": 10421837,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3240,
"problems": 1080
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 145808,
"runtime": 270.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F(**))"
},
"net":
{
"arcs": 2750,
"conflict_clusters": 48,
"places": 295,
"places_significant": 278,
"singleton_clusters": 0,
"transitions": 709
},
"result":
{
"preliminary_value": "no yes ",
"value": "no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1004/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 295
lola: finding significant places
lola: 295 places, 709 transitions, 278 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p253 <= 1)
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p260 <= 1)
lola: LP says that atomic proposition is always true: (p288 <= 1)
lola: LP says that atomic proposition is always true: (p235 <= 1)
lola: LP says that atomic proposition is always true: (p266 <= 1)
lola: LP says that atomic proposition is always true: (p255 <= 1)
lola: LP says that atomic proposition is always true: (p279 <= 1)
lola: LP says that atomic proposition is always true: (p250 <= 1)
lola: LP says that atomic proposition is always true: (p269 <= 1)
lola: LP says that atomic proposition is always true: (p244 <= 1)
lola: LP says that atomic proposition is always true: (p270 <= 1)
lola: LP says that atomic proposition is always true: (p262 <= 1)
lola: LP says that atomic proposition is always true: (p268 <= 1)
lola: LP says that atomic proposition is always true: (p230 <= 1)
lola: LP says that atomic proposition is always true: (p236 <= 1)
lola: LP says that atomic proposition is always true: (p232 <= 1)
lola: LP says that atomic proposition is always true: (p280 <= 1)
lola: LP says that atomic proposition is always true: (p256 <= 1)
lola: LP says that atomic proposition is always true: (p289 <= 1)
lola: LP says that atomic proposition is always true: (p249 <= 1)
lola: LP says that atomic proposition is always true: (p278 <= 1)
lola: LP says that atomic proposition is always true: (p239 <= 1)
lola: LP says that atomic proposition is always true: (p276 <= 1)
lola: LP says that atomic proposition is always true: (p257 <= 1)
lola: LP says that atomic proposition is always true: (p267 <= 1)
lola: LP says that atomic proposition is always true: (p232 <= 1)
lola: LP says that atomic proposition is always true: (p272 <= 1)
lola: LP says that atomic proposition is always true: (p233 <= 1)
lola: LP says that atomic proposition is always true: (p266 <= 1)
lola: LP says that atomic proposition is always true: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p287 <= 1)
lola: LP says that atomic proposition is always true: (p235 <= 1)
lola: LP says that atomic proposition is always true: (p277 <= 1)
lola: LP says that atomic proposition is always true: (p241 <= 1)
lola: LP says that atomic proposition is always true: (p265 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p248 <= 1)
lola: LP says that atomic proposition is always true: (p244 <= 1)
lola: LP says that atomic proposition is always true: (p281 <= 1)
lola: LP says that atomic proposition is always true: (p240 <= 1)
lola: LP says that atomic proposition is always true: (p274 <= 1)
lola: LP says that atomic proposition is always true: (p256 <= 1)
lola: LP says that atomic proposition is always true: (p273 <= 1)
lola: LP says that atomic proposition is always true: (p251 <= 1)
lola: LP says that atomic proposition is always true: (p263 <= 1)
lola: LP says that atomic proposition is always true: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p271 <= 1)
lola: LP says that atomic proposition is always true: (p257 <= 1)
lola: LP says that atomic proposition is always true: (p282 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p283 <= 1)
lola: LP says that atomic proposition is always true: (p234 <= 1)
lola: LP says that atomic proposition is always true: (p280 <= 1)
lola: LP says that atomic proposition is always true: (p237 <= 1)
lola: LP says that atomic proposition is always true: (p273 <= 1)
lola: LP says that atomic proposition is always true: (p246 <= 1)
lola: LP says that atomic proposition is always true: (p270 <= 1)
lola: LP says that atomic proposition is always true: (p229 <= 1)
lola: LP says that atomic proposition is always true: (p251 <= 1)
lola: LP says that atomic proposition is always true: (p259 <= 1)
lola: LP says that atomic proposition is always true: (p263 <= 1)
lola: LP says that atomic proposition is always true: (p253 <= 1)
lola: LP says that atomic proposition is always true: (p275 <= 1)
lola: LP says that atomic proposition is always true: (p234 <= 1)
lola: LP says that atomic proposition is always true: (p272 <= 1)
lola: LP says that atomic proposition is always true: (p245 <= 1)
lola: LP says that atomic proposition is always true: (p283 <= 1)
lola: LP says that atomic proposition is always true: (p261 <= 1)
lola: LP says that atomic proposition is always true: (p285 <= 1)
lola: LP says that atomic proposition is always true: (p230 <= 1)
lola: LP says that atomic proposition is always true: (p256 <= 1)
lola: LP says that atomic proposition is always true: (p255 <= 1)
lola: LP says that atomic proposition is always true: (p268 <= 1)
lola: LP says that atomic proposition is always true: (p237 <= 1)
lola: LP says that atomic proposition is always true: (p289 <= 1)
lola: LP says that atomic proposition is always true: (p262 <= 1)
lola: LP says that atomic proposition is always true: (p279 <= 1)
lola: LP says that atomic proposition is always true: (p229 <= 1)
lola: LP says that atomic proposition is always true: (p262 <= 1)
lola: LP says that atomic proposition is always true: (p233 <= 1)
lola: LP says that atomic proposition is always true: (p286 <= 1)
lola: LP says that atomic proposition is always true: (p250 <= 1)
lola: LP says that atomic proposition is always true: (p284 <= 1)
lola: LP says that atomic proposition is always true: (p246 <= 1)
lola: LP says that atomic proposition is always true: (p281 <= 1)
lola: LP says that atomic proposition is always true: (p258 <= 1)
lola: LP says that atomic proposition is always true: (p276 <= 1)
lola: LP says that atomic proposition is always true: (p243 <= 1)
lola: LP says that atomic proposition is always true: (p265 <= 1)
lola: LP says that atomic proposition is always true: (p249 <= 1)
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p240 <= 1)
lola: LP says that atomic proposition is always true: (p271 <= 1)
lola: LP says that atomic proposition is always true: (p236 <= 1)
lola: LP says that atomic proposition is always true: (p282 <= 1)
lola: LP says that atomic proposition is always true: (p259 <= 1)
lola: LP says that atomic proposition is always true: (p279 <= 1)
lola: LP says that atomic proposition is always true: (p260 <= 1)
lola: LP says that atomic proposition is always true: (p285 <= 1)
lola: LP says that atomic proposition is always true: (p241 <= 1)
lola: LP says that atomic proposition is always true: (p281 <= 1)
lola: LP says that atomic proposition is always true: (p230 <= 1)
lola: LP says that atomic proposition is always true: (p237 <= 1)
lola: LP says that atomic proposition is always true: (p254 <= 1)
lola: LP says that atomic proposition is always true: (p284 <= 1)
lola: LP says that atomic proposition is always true: (p262 <= 1)
lola: LP says that atomic proposition is always true: (p263 <= 1)
lola: LP says that atomic proposition is always true: (p251 <= 1)
lola: LP says that atomic proposition is always true: (p279 <= 1)
lola: LP says that atomic proposition is always true: (p235 <= 1)
lola: LP says that atomic proposition is always true: (p272 <= 1)
lola: LP says that atomic proposition is always true: (p244 <= 1)
lola: LP says that atomic proposition is always true: (p265 <= 1)
lola: LP says that atomic proposition is always true: (p239 <= 1)
lola: LP says that atomic proposition is always true: (p273 <= 1)
lola: LP says that atomic proposition is always true: (p252 <= 1)
lola: LP says that atomic proposition is always true: (p269 <= 1)
lola: LP says that atomic proposition is always true: (p232 <= 1)
lola: LP says that atomic proposition is always true: (p277 <= 1)
lola: LP says that atomic proposition is always true: (p249 <= 1)
lola: LP says that atomic proposition is always true: (p275 <= 1)
lola: LP says that atomic proposition is always true: (p240 <= 1)
lola: LP says that atomic proposition is always true: (p287 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p254 <= 1)
lola: LP says that atomic proposition is always true: (p235 <= 1)
lola: LP says that atomic proposition is always true: (p280 <= 1)
lola: LP says that atomic proposition is always true: (p241 <= 1)
lola: LP says that atomic proposition is always true: (p270 <= 1)
lola: LP says that atomic proposition is always true: (p236 <= 1)
lola: LP says that atomic proposition is always true: (p267 <= 1)
lola: LP says that atomic proposition is always true: (p256 <= 1)
lola: LP says that atomic proposition is always true: (p276 <= 1)
lola: LP says that atomic proposition is always true: (p248 <= 1)
lola: LP says that atomic proposition is always true: (p284 <= 1)
lola: LP says that atomic proposition is always true: (p239 <= 1)
lola: LP says that atomic proposition is always true: (p289 <= 1)
lola: LP says that atomic proposition is always true: (p243 <= 1)
lola: LP says that atomic proposition is always true: (p281 <= 1)
lola: LP says that atomic proposition is always true: (p246 <= 1)
lola: LP says that atomic proposition is always true: (p265 <= 1)
lola: LP says that atomic proposition is always true: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p274 <= 1)
lola: LP says that atomic proposition is always true: (p252 <= 1)
lola: LP says that atomic proposition is always true: (p284 <= 1)
lola: LP says that atomic proposition is always true: (p258 <= 1)
lola: LP says that atomic proposition is always true: (p289 <= 1)
lola: LP says that atomic proposition is always true: (p248 <= 1)
lola: LP says that atomic proposition is always true: (p269 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p286 <= 1)
lola: LP says that atomic proposition is always true: (p237 <= 1)
lola: LP says that atomic proposition is always true: (p276 <= 1)
lola: LP says that atomic proposition is always true: (p261 <= 1)
lola: LP says that atomic proposition is always true: (p288 <= 1)
lola: LP says that atomic proposition is always true: (p243 <= 1)
lola: LP says that atomic proposition is always true: (p270 <= 1)
lola: LP says that atomic proposition is always true: (p230 <= 1)
lola: LP says that atomic proposition is always true: (p257 <= 1)
lola: LP says that atomic proposition is always true: (p254 <= 1)
lola: LP says that atomic proposition is always true: (p269 <= 1)
lola: LP says that atomic proposition is always true: (p234 <= 1)
lola: LP says that atomic proposition is always true: (p277 <= 1)
lola: LP says that atomic proposition is always true: (p229 <= 1)
lola: LP says that atomic proposition is always true: (p255 <= 1)
lola: LP says that atomic proposition is always true: (p253 <= 1)
lola: LP says that atomic proposition is always true: (p278 <= 1)
lola: LP says that atomic proposition is always true: (p245 <= 1)
lola: LP says that atomic proposition is always true: (p286 <= 1)
lola: LP says that atomic proposition is always true: (p251 <= 1)
lola: LP says that atomic proposition is always true: (p268 <= 1)
lola: LP says that atomic proposition is always true: (p229 <= 1)
lola: LP says that atomic proposition is always true: (p259 <= 1)
lola: LP says that atomic proposition is always true: (p259 <= 1)
lola: LP says that atomic proposition is always true: (p268 <= 1)
lola: LP says that atomic proposition is always true: (p258 <= 1)
lola: LP says that atomic proposition is always true: (p273 <= 1)
lola: LP says that atomic proposition is always true: (p255 <= 1)
lola: LP says that atomic proposition is always true: (p263 <= 1)
lola: LP says that atomic proposition is always true: (p233 <= 1)
lola: LP says that atomic proposition is always true: (p283 <= 1)
lola: LP says that atomic proposition is always true: (p258 <= 1)
lola: LP says that atomic proposition is always true: (p267 <= 1)
lola: LP says that atomic proposition is always true: (p251 <= 1)
lola: LP says that atomic proposition is always true: (p288 <= 1)
lola: LP says that atomic proposition is always true: (p255 <= 1)
lola: LP says that atomic proposition is always true: (p285 <= 1)
lola: LP says that atomic proposition is always true: (p254 <= 1)
lola: LP says that atomic proposition is always true: (p275 <= 1)
lola: LP says that atomic proposition is always true: (p234 <= 1)
lola: LP says that atomic proposition is always true: (p266 <= 1)
lola: LP says that atomic proposition is always true: (p246 <= 1)
lola: LP says that atomic proposition is always true: (p287 <= 1)
lola: LP says that atomic proposition is always true: (p240 <= 1)
lola: LP says that atomic proposition is always true: (p265 <= 1)
lola: LP says that atomic proposition is always true: (p236 <= 1)
lola: LP says that atomic proposition is always true: (p289 <= 1)
lola: LP says that atomic proposition is always true: (p232 <= 1)
lola: LP says that atomic proposition is always true: (p286 <= 1)
lola: LP says that atomic proposition is always true: (p245 <= 1)
lola: LP says that atomic proposition is always true: (p277 <= 1)
lola: LP says that atomic proposition is always true: (p241 <= 1)
lola: LP says that atomic proposition is always true: (p274 <= 1)
lola: LP says that atomic proposition is always true: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p281 <= 1)
lola: LP says that atomic proposition is always true: (p235 <= 1)
lola: LP says that atomic proposition is always true: (p283 <= 1)
lola: LP says that atomic proposition is always true: (p252 <= 1)
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p244 <= 1)
lola: LP says that atomic proposition is always true: (p271 <= 1)
lola: LP says that atomic proposition is always true: (p236 <= 1)
lola: LP says that atomic proposition is always true: (p273 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p250 <= 1)
lola: LP says that atomic proposition is always true: (p239 <= 1)
lola: LP says that atomic proposition is always true: (p282 <= 1)
lola: LP says that atomic proposition is always true: (p261 <= 1)
lola: LP says that atomic proposition is always true: (p268 <= 1)
lola: LP says that atomic proposition is always true: (p259 <= 1)
lola: LP says that atomic proposition is always true: (p288 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p253 <= 1)
lola: LP says that atomic proposition is always true: (p249 <= 1)
lola: LP says that atomic proposition is always true: (p269 <= 1)
lola: LP says that atomic proposition is always true: (p245 <= 1)
lola: LP says that atomic proposition is always true: (p266 <= 1)
lola: LP says that atomic proposition is always true: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p270 <= 1)
lola: LP says that atomic proposition is always true: (p232 <= 1)
lola: LP says that atomic proposition is always true: (p266 <= 1)
lola: LP says that atomic proposition is always true: (p234 <= 1)
lola: LP says that atomic proposition is always true: (p286 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p277 <= 1)
lola: LP says that atomic proposition is always true: (p260 <= 1)
lola: LP says that atomic proposition is always true: (p263 <= 1)
lola: LP says that atomic proposition is always true: (p233 <= 1)
lola: LP says that atomic proposition is always true: (p272 <= 1)
lola: LP says that atomic proposition is always true: (p248 <= 1)
lola: LP says that atomic proposition is always true: (p275 <= 1)
lola: LP says that atomic proposition is always true: (p252 <= 1)
lola: LP says that atomic proposition is always true: (p275 <= 1)
lola: LP says that atomic proposition is always true: (p244 <= 1)
lola: LP says that atomic proposition is always true: (p287 <= 1)
lola: LP says that atomic proposition is always true: (p262 <= 1)
lola: LP says that atomic proposition is always true: (p285 <= 1)
lola: LP says that atomic proposition is always true: (p249 <= 1)
lola: LP says that atomic proposition is always true: (p284 <= 1)
lola: LP says that atomic proposition is always true: (p261 <= 1)
lola: LP says that atomic proposition is always true: (p279 <= 1)
lola: LP says that atomic proposition is always true: (p257 <= 1)
lola: LP says that atomic proposition is always true: (p276 <= 1)
lola: LP says that atomic proposition is always true: (p243 <= 1)
lola: LP says that atomic proposition is always true: (p274 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p266 <= 1)
lola: LP says that atomic proposition is always true: (p254 <= 1)
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p230 <= 1)
lola: LP says that atomic proposition is always true: (p258 <= 1)
lola: LP says that atomic proposition is always true: (p248 <= 1)
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p258 <= 1)
lola: LP says that atomic proposition is always true: (p282 <= 1)
lola: LP says that atomic proposition is always true: (p246 <= 1)
lola: LP says that atomic proposition is always true: (p271 <= 1)
lola: LP says that atomic proposition is always true: (p229 <= 1)
lola: LP says that atomic proposition is always true: (p260 <= 1)
lola: LP says that atomic proposition is always true: (p233 <= 1)
lola: LP says that atomic proposition is always true: (p280 <= 1)
lola: LP says that atomic proposition is always true: (p250 <= 1)
lola: LP says that atomic proposition is always true: (p278 <= 1)
lola: LP says that atomic proposition is always true: (p251 <= 1)
lola: LP says that atomic proposition is always true: (p285 <= 1)
lola: LP says that atomic proposition is always true: (p245 <= 1)
lola: LP says that atomic proposition is always true: (p272 <= 1)
lola: LP says that atomic proposition is always true: (p254 <= 1)
lola: LP says that atomic proposition is always true: (p278 <= 1)
lola: LP says that atomic proposition is always true: (p236 <= 1)
lola: LP says that atomic proposition is always true: (p276 <= 1)
lola: LP says that atomic proposition is always true: (p253 <= 1)
lola: LP says that atomic proposition is always true: (p269 <= 1)
lola: LP says that atomic proposition is always true: (p250 <= 1)
lola: LP says that atomic proposition is always true: (p275 <= 1)
lola: LP says that atomic proposition is always true: (p240 <= 1)
lola: LP says that atomic proposition is always true: (p270 <= 1)
lola: LP says that atomic proposition is always true: (p230 <= 1)
lola: LP says that atomic proposition is always true: (p239 <= 1)
lola: LP says that atomic proposition is always true: (p245 <= 1)
lola: LP says that atomic proposition is always true: (p280 <= 1)
lola: LP says that atomic proposition is always true: (p241 <= 1)
lola: LP says that atomic proposition is always true: (p271 <= 1)
lola: LP says that atomic proposition is always true: (p232 <= 1)
lola: LP says that atomic proposition is always true: (p283 <= 1)
lola: LP says that atomic proposition is always true: (p244 <= 1)
lola: LP says that atomic proposition is always true: (p274 <= 1)
lola: LP says that atomic proposition is always true: (p256 <= 1)
lola: LP says that atomic proposition is always true: (p282 <= 1)
lola: LP says that atomic proposition is always true: (p250 <= 1)
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p240 <= 1)
lola: LP says that atomic proposition is always true: (p281 <= 1)
lola: LP says that atomic proposition is always true: (p259 <= 1)
lola: LP says that atomic proposition is always true: (p285 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p249 <= 1)
lola: LP says that atomic proposition is always true: (p260 <= 1)
lola: LP says that atomic proposition is always true: (p279 <= 1)
lola: LP says that atomic proposition is always true: (p243 <= 1)
lola: LP says that atomic proposition is always true: (p287 <= 1)
lola: LP says that atomic proposition is always true: (p261 <= 1)
lola: LP says that atomic proposition is always true: (p263 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p252 <= 1)
lola: LP says that atomic proposition is always true: (p235 <= 1)
lola: LP says that atomic proposition is always true: (p286 <= 1)
lola: LP says that atomic proposition is always true: (p255 <= 1)
lola: LP says that atomic proposition is always true: (p288 <= 1)
lola: LP says that atomic proposition is always true: (p237 <= 1)
lola: LP says that atomic proposition is always true: (p267 <= 1)
lola: LP says that atomic proposition is always true: (p248 <= 1)
lola: LP says that atomic proposition is always true: (p278 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p280 <= 1)
lola: LP says that atomic proposition is always true: (p262 <= 1)
lola: LP says that atomic proposition is always true: (p288 <= 1)
lola: LP says that atomic proposition is always true: (p233 <= 1)
lola: LP says that atomic proposition is always true: (p277 <= 1)
lola: LP says that atomic proposition is always true: (p252 <= 1)
lola: LP says that atomic proposition is always true: (p278 <= 1)
lola: LP says that atomic proposition is always true: (p257 <= 1)
lola: LP says that atomic proposition is always true: (p273 <= 1)
lola: LP says that atomic proposition is always true: (p260 <= 1)
lola: LP says that atomic proposition is always true: (p268 <= 1)
lola: LP says that atomic proposition is always true: (p256 <= 1)
lola: LP says that atomic proposition is always true: (p267 <= 1)
lola: LP says that atomic proposition is always true: (p243 <= 1)
lola: LP says that atomic proposition is always true: (p271 <= 1)
lola: LP says that atomic proposition is always true: (p234 <= 1)
lola: LP says that atomic proposition is always true: (p283 <= 1)
lola: LP says that atomic proposition is always true: (p237 <= 1)
lola: LP says that atomic proposition is always true: (p282 <= 1)
lola: LP says that atomic proposition is always true: (p253 <= 1)
lola: LP says that atomic proposition is always true: (p284 <= 1)
lola: LP says that atomic proposition is always true: (p239 <= 1)
lola: LP says that atomic proposition is always true: (p267 <= 1)
lola: LP says that atomic proposition is always true: (p246 <= 1)
lola: LP says that atomic proposition is always true: (p274 <= 1)
lola: LP says that atomic proposition is always true: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p265 <= 1)
lola: LP says that atomic proposition is always true: (p241 <= 1)
lola: LP says that atomic proposition is always true: (p287 <= 1)
lola: LP says that atomic proposition is always true: (p229 <= 1)
lola: LP says that atomic proposition is always true: (p261 <= 1)
lola: LP says that atomic proposition is always true: (p257 <= 1)
lola: LP says that atomic proposition is always true: (p289 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p272 <= 1)
lola: LP says that atomic proposition is always true: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p165 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p163 <= 1)
lola: LP says that atomic proposition is always true: (p137 <= 1)
lola: LP says that atomic proposition is always true: (p166 <= 1)
lola: LP says that atomic proposition is always true: (p195 <= 1)
lola: LP says that atomic proposition is always true: (p219 <= 1)
lola: A (G (((((p253 <= 0) OR (p264 <= 0)) AND ((p260 <= 0) OR (p288 <= 0)) AND ((p235 <= 0) OR (p266 <= 0)) AND ((p255 <= 0) OR (p279 <= 0)) AND ((p250 <= 0) OR (p269 <= 0)) AND ((p244 <= 0) OR (p270 <= 0)) AND ((p262 <= 0) OR (p268 <= 0)) AND ((p230 <= 0) OR (p236 <= 0)) AND ((p232 <= 0) OR (p280 <= 0)) AND ((p256 <= 0) OR (p289 <= 0)) AND ((p249 <= 0) OR (p278 <= 0)) AND ((p239 <= 0) OR (p276 <= 0)) AND ((p257 <= 0) OR (p267 <= 0)) AND ((p232 <= 0) OR (p272 <= 0)) AND ((p233 <= 0) OR (p266 <= 0)) AND ((p247 <= 0) OR (p287 <= 0)) AND ((p235 <= 0) OR (p277 <= 0)) AND ((p241 <= 0) OR (p265 <= 0)) AND ((p231 <= 0) OR (p248 <= 0)) AND ((p244 <= 0) OR (p281 <= 0)) AND ((p240 <= 0) OR (p274 <= 0)) AND ((p256 <= 0) OR (p273 <= 0)) AND ((p251 <= 0) OR (p263 <= 0)) AND ((p247 <= 0) OR (p271 <= 0)) AND ((p257 <= 0) OR (p282 <= 0)) AND ((p238 <= 0) OR (p283 <= 0)) AND ((p234 <= 0) OR (p280 <= 0)) AND ((p237 <= 0) OR (p273 <= 0)) AND ((p246 <= 0) OR (p270 <= 0)) AND ((p229 <= 0) OR (p251 <= 0)) AND ((p259 <= 0) OR (p263 <= 0)) AND ((p253 <= 0) OR (p275 <= 0)) AND ((p234 <= 0) OR (p272 <= 0)) AND ((p245 <= 0) OR (p283 <= 0)) AND ((p261 <= 0) OR (p285 <= 0)) AND ((p230 <= 0) OR (p256 <= 0)) AND ((p255 <= 0) OR (p268 <= 0)) AND ((p237 <= 0) OR (p289 <= 0)) AND ((p262 <= 0) OR (p279 <= 0)) AND ((p229 <= 0) OR (p262 <= 0)) AND ((p233 <= 0) OR (p286 <= 0)) AND ((p250 <= 0) OR (p284 <= 0)) AND ((p246 <= 0) OR (p281 <= 0)) AND ((p258 <= 0) OR (p276 <= 0)) AND ((p243 <= 0) OR (p265 <= 0)) AND ((p249 <= 0) OR (p264 <= 0)) AND ((p240 <= 0) OR (p271 <= 0)) AND ((p236 <= 0) OR (p282 <= 0)) AND ((p259 <= 0) OR (p279 <= 0)) AND ((p260 <= 0) OR (p285 <= 0)) AND ((p241 <= 0) OR (p281 <= 0)) AND ((p230 <= 0) OR (p237 <= 0)) AND ((p254 <= 0) OR (p284 <= 0)) AND ((p262 <= 0) OR (p263 <= 0)) AND ((p251 <= 0) OR (p279 <= 0)) AND ((p235 <= 0) OR (p272 <= 0)) AND ((p244 <= 0) OR (p265 <= 0)) AND ((p239 <= 0) OR (p273 <= 0)) AND ((p252 <= 0) OR (p269 <= 0)) AND ((p232 <= 0) OR (p277 <= 0)) AND ((p249 <= 0) OR (p275 <= 0)) AND ((p240 <= 0) OR (p287 <= 0)) AND ((p231 <= 0) OR (p254 <= 0)) AND ((p235 <= 0) OR (p280 <= 0)) AND ((p241 <= 0) OR (p270 <= 0)) AND ((p236 <= 0) OR (p267 <= 0)) AND ((p256 <= 0) OR (p276 <= 0)) AND ((p248 <= 0) OR (p284 <= 0)) AND ((p239 <= 0) OR (p289 <= 0)) AND ((p243 <= 0) OR (p281 <= 0)) AND ((p246 <= 0) OR (p265 <= 0)) AND ((p247 <= 0) OR (p274 <= 0)) AND ((p252 <= 0) OR (p284 <= 0)) AND ((p258 <= 0) OR (p289 <= 0)) AND ((p248 <= 0) OR (p269 <= 0)) AND ((p238 <= 0) OR (p286 <= 0)) AND ((p237 <= 0) OR (p276 <= 0)) AND ((p261 <= 0) OR (p288 <= 0)) AND ((p243 <= 0) OR (p270 <= 0)) AND ((p230 <= 0) OR (p257 <= 0)) AND ((p254 <= 0) OR (p269 <= 0)) AND ((p234 <= 0) OR (p277 <= 0)) AND ((p229 <= 0) OR (p255 <= 0)) AND ((p253 <= 0) OR (p278 <= 0)) AND ((p245 <= 0) OR (p286 <= 0)) AND ((p251 <= 0) OR (p268 <= 0)) AND ((p229 <= 0) OR (p259 <= 0)) AND ((p259 <= 0) OR (p268 <= 0)) AND ((p258 <= 0) OR (p273 <= 0)) AND ((p255 <= 0) OR (p263 <= 0)) AND ((p233 <= 0) OR (p283 <= 0)) AND ((p258 <= 0) OR (p267 <= 0)) AND ((p251 <= 0) OR (p288 <= 0)) AND ((p255 <= 0) OR (p285 <= 0)) AND ((p254 <= 0) OR (p275 <= 0)) AND ((p234 <= 0) OR (p266 <= 0)) AND ((p246 <= 0) OR (p287 <= 0)) AND ((p240 <= 0) OR (p265 <= 0)) AND ((p236 <= 0) OR (p289 <= 0)) AND ((p232 <= 0) OR (p286 <= 0)) AND ((p245 <= 0) OR (p277 <= 0)) AND ((p241 <= 0) OR (p274 <= 0)) AND ((p247 <= 0) OR (p281 <= 0)) AND ((p235 <= 0) OR (p283 <= 0)) AND ((p252 <= 0) OR (p264 <= 0)) AND ((p244 <= 0) OR (p271 <= 0)) AND ((p236 <= 0) OR (p273 <= 0)) AND ((p231 <= 0) OR (p250 <= 0)) AND ((p239 <= 0) OR (p282 <= 0)) AND ((p261 <= 0) OR (p268 <= 0)) AND ((p259 <= 0) OR (p288 <= 0)) AND ((p231 <= 0) OR (p253 <= 0)) AND ((p249 <= 0) OR (p269 <= 0)) AND ((p245 <= 0) OR (p266 <= 0)) AND ((p247 <= 0) OR (p270 <= 0)) AND ((p232 <= 0) OR (p266 <= 0)) AND ((p234 <= 0) OR (p286 <= 0)) AND ((p238 <= 0) OR (p277 <= 0)) AND ((p260 <= 0) OR (p263 <= 0)) AND ((p233 <= 0) OR (p272 <= 0)) AND ((p248 <= 0) OR (p275 <= 0)) AND ((p252 <= 0) OR (p275 <= 0)) AND ((p244 <= 0) OR (p287 <= 0)) AND ((p262 <= 0) OR (p285 <= 0)) AND ((p249 <= 0) OR (p284 <= 0)) AND ((p261 <= 0) OR (p279 <= 0)) AND ((p257 <= 0) OR (p276 <= 0)) AND ((p243 <= 0) OR (p274 <= 0)) AND ((p238 <= 0) OR (p266 <= 0)) AND ((p254 <= 0) OR (p264 <= 0)) AND ((p230 <= 0) OR (p258 <= 0)) AND ((p248 <= 0) OR (p264 <= 0)) AND ((p258 <= 0) OR (p282 <= 0)) AND ((p246 <= 0) OR (p271 <= 0)) AND ((p229 <= 0) OR (p260 <= 0)) AND ((p233 <= 0) OR (p280 <= 0)) AND ((p250 <= 0) OR (p278 <= 0)) AND ((p251 <= 0) OR (p285 <= 0)) AND ((p245 <= 0) OR (p272 <= 0)) AND ((p254 <= 0) OR (p278 <= 0)) AND ((p236 <= 0) OR (p276 <= 0)) AND ((p253 <= 0) OR (p269 <= 0)) AND ((p250 <= 0) OR (p275 <= 0)) AND ((p240 <= 0) OR (p270 <= 0)) AND ((p230 <= 0) OR (p239 <= 0)) AND ((p245 <= 0) OR (p280 <= 0)) AND ((p241 <= 0) OR (p271 <= 0)) AND ((p232 <= 0) OR (p283 <= 0)) AND ((p244 <= 0) OR (p274 <= 0)) AND ((p256 <= 0) OR (p282 <= 0)) AND ((p250 <= 0) OR (p264 <= 0)) AND ((p240 <= 0) OR (p281 <= 0)) AND ((p259 <= 0) OR (p285 <= 0)) AND ((p231 <= 0) OR (p249 <= 0)) AND ((p260 <= 0) OR (p279 <= 0)) AND ((p243 <= 0) OR (p287 <= 0)) AND ((p261 <= 0) OR (p263 <= 0)) AND ((p231 <= 0) OR (p252 <= 0)) AND ((p235 <= 0) OR (p286 <= 0)) AND ((p255 <= 0) OR (p288 <= 0)) AND ((p237 <= 0) OR (p267 <= 0)) AND ((p248 <= 0) OR (p278 <= 0)) AND ((p238 <= 0) OR (p280 <= 0)) AND ((p262 <= 0) OR (p288 <= 0)) AND ((p233 <= 0) OR (p277 <= 0)) AND ((p252 <= 0) OR (p278 <= 0)) AND ((p257 <= 0) OR (p273 <= 0)) AND ((p260 <= 0) OR (p268 <= 0)) AND ((p256 <= 0) OR (p267 <= 0)) AND ((p243 <= 0) OR (p271 <= 0)) AND ((p234 <= 0) OR (p283 <= 0)) AND ((p237 <= 0) OR (p282 <= 0)) AND ((p253 <= 0) OR (p284 <= 0)) AND ((p239 <= 0) OR (p267 <= 0)) AND ((p246 <= 0) OR (p274 <= 0)) AND ((p247 <= 0) OR (p265 <= 0)) AND ((p241 <= 0) OR (p287 <= 0)) AND ((p229 <= 0) OR (p261 <= 0)) AND ((p257 <= 0) OR (p289 <= 0)) AND ((p238 <= 0) OR (p272 <= 0))) OR (((p159 <= 0)) AND ((p165 <= 0)) AND ((p164 <= 0)) AND ((p163 <= 0)) AND ((p137 <= 0)) AND ((p166 <= 0)))))) : E (F (((1 <= p195) AND (1 <= p219))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p195) AND (1 <= p219))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p195) AND (1 <= p219))))
lola: processed formula length: 37
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p195) AND (1 <= p219))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 1 will run for 3558 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((((p253 <= 0) OR (p264 <= 0)) AND ((p260 <= 0) OR (p288 <= 0)) AND ((p235 <= 0) OR (p266 <= 0)) AND ((p255 <= 0) OR (p279 <= 0)) AND ((p250 <= 0) OR (p269 <= 0)) AND ((p244 <= 0) OR (p270 <= 0)) AND ((p262 <= 0) OR (p268 <= 0)) AND ((p230 <= 0) OR (p236 <= 0)) AND ((p232 <= 0) OR (p280 <= 0)) AND ((p256 <= 0) OR (p289 <= 0)) AND ((p249 <= 0) OR (p278 <= 0)) AND ((p239 <= 0) OR (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((((p253 <= 0) OR (p264 <= 0)) AND ((p260 <= 0) OR (p288 <= 0)) AND ((p235 <= 0) OR (p266 <= 0)) AND ((p255 <= 0) OR (p279 <= 0)) AND ((p250 <= 0) OR (p269 <= 0)) AND ((p244 <= 0) OR (p270 <= 0)) AND ((p262 <= 0) OR (p268 <= 0)) AND ((p230 <= 0) OR (p236 <= 0)) AND ((p232 <= 0) OR (p280 <= 0)) AND ((p256 <= 0) OR (p289 <= 0)) AND ((p249 <= 0) OR (p278 <= 0)) AND ((p239 <= 0) OR (... (shortened)
lola: processed formula length: 6237
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((1 <= p253) AND (1 <= p264)) OR ((1 <= p260) AND (1 <= p288)) OR ((1 <= p235) AND (1 <= p266)) OR ((1 <= p255) AND (1 <= p279)) OR ((1 <= p250) AND (1 <= p269)) OR ((1 <= p244) AND (1 <= p270)) OR ((1 <= p262) AND (1 <= p268)) OR ((1 <= p230) AND (1 <= p236)) OR ((1 <= p232) AND (1 <= p280)) OR ((1 <= p256) AND (1 <= p289)) OR ((1 <= p249) AND (1 <= p278)) OR ((1 <= p239) AND (1 <= p276)) OR ((1 <= p257) AND (1 <= p267)) OR ((1 <= p232) AND (1 <= p272)) OR ((1 <= p233) AND (1 <= p266)) OR ((1 <= p247) AND (1 <= p287)) OR ((1 <= p235) AND (1 <= p277)) OR ((1 <= p241) AND (1 <= p265)) OR ((1 <= p231) AND (1 <= p248)) OR ((1 <= p244) AND (1 <= p281)) OR ((1 <= p240) AND (1 <= p274)) OR ((1 <= p256) AND (1 <= p273)) OR ((1 <= p251) AND (1 <= p263)) OR ((1 <= p247) AND (1 <= p271)) OR ((1 <= p257) AND (1 <= p282)) OR ((1 <= p238) AND (1 <= p283)) OR ((1 <= p234) AND (1 <= p280)) OR ((1 <= p237) AND (1 <= p273)) OR ((1 <= p246) AND (1 <= p270)) OR ((1 <= p229) AND (1 <= p251)) OR ((1 <= p259) AND (1 <= p263)) OR ((1 <= p253) AND (1 <= p275)) OR ((1 <= p234) AND (1 <= p272)) OR ((1 <= p245) AND (1 <= p283)) OR ((1 <= p261) AND (1 <= p285)) OR ((1 <= p230) AND (1 <= p256)) OR ((1 <= p255) AND (1 <= p268)) OR ((1 <= p237) AND (1 <= p289)) OR ((1 <= p262) AND (1 <= p279)) OR ((1 <= p229) AND (1 <= p262)) OR ((1 <= p233) AND (1 <= p286)) OR ((1 <= p250) AND (1 <= p284)) OR ((1 <= p246) AND (1 <= p281)) OR ((1 <= p258) AND (1 <= p276)) OR ((1 <= p243) AND (1 <= p265)) OR ((1 <= p249) AND (1 <= p264)) OR ((1 <= p240) AND (1 <= p271)) OR ((1 <= p236) AND (1 <= p282)) OR ((1 <= p259) AND (1 <= p279)) OR ((1 <= p260) AND (1 <= p285)) OR ((1 <= p241) AND (1 <= p281)) OR ((1 <= p230) AND (1 <= p237)) OR ((1 <= p254) AND (1 <= p284)) OR ((1 <= p262) AND (1 <= p263)) OR ((1 <= p251) AND (1 <= p279)) OR ((1 <= p235) AND (1 <= p272)) OR ((1 <= p244) AND (1 <= p265)) OR ((1 <= p239) AND (1 <= p273)) OR ((1 <= p252) AND (1 <= p269)) OR ((1 <= p232) AND (1 <= p277)) OR ((1 <= p249) AND (1 <= p275)) OR ((1 <= p240) AND (1 <= p287)) OR ((1 <= p231) AND (1 <= p254)) OR ((1 <= p235) AND (1 <= p280)) OR ((1 <= p241) AND (1 <= p270)) OR ((1 <= p236) AND (1 <= p267)) OR ((1 <= p256) AND (1 <= p276)) OR ((1 <= p248) AND (1 <= p284)) OR ((1 <= p239) AND (1 <= p289)) OR ((1 <= p243) AND (1 <= p281)) OR ((1 <= p246) AND (1 <= p265)) OR ((1 <= p247) AND (1 <= p274)) OR ((1 <= p252) AND (1 <= p284)) OR ((1 <= p258) AND (1 <= p289)) OR ((1 <= p248) AND (1 <= p269)) OR ((1 <= p238) AND (1 <= p286)) OR ((1 <= p237) AND (1 <= p276)) OR ((1 <= p261) AND (1 <= p288)) OR ((1 <= p243) AND (1 <= p270)) OR ((1 <= p230) AND (1 <= p257)) OR ((1 <= p254) AND (1 <= p269)) OR ((1 <= p234) AND (1 <= p277)) OR ((1 <= p229) AND (1 <= p255)) OR ((1 <= p253) AND (1 <= p278)) OR ((1 <= p245) AND (1 <= p286)) OR ((1 <= p251) AND (1 <= p268)) OR ((1 <= p229) AND (1 <= p259)) OR ((1 <= p259) AND (1 <= p268)) OR ((1 <= p258) AND (1 <= p273)) OR ((1 <= p255) AND (1 <= p263)) OR ((1 <= p233) AND (1 <= p283)) OR ((1 <= p258) AND (1 <= p267)) OR ((1 <= p251) AND (1 <= p288)) OR ((1 <= p255) AND (1 <= p285)) OR ((1 <= p254) AND (1 <= p275)) OR ((1 <= p234) AND (1 <= p266)) OR ((1 <= p246) AND (1 <= p287)) OR ((1 <= p240) AND (1 <= p265)) OR ((1 <= p236) AND (1 <= p289)) OR ((1 <= p232) AND (1 <= p286)) OR ((1 <= p245) AND (1 <= p277)) OR ((1 <= p241) AND (1 <= p274)) OR ((1 <= p247) AND (1 <= p281)) OR ((1 <= p235) AND (1 <= p283)) OR ((1 <= p252) AND (1 <= p264)) OR ((1 <= p244) AND (1 <= p271)) OR ((1 <= p236) AND (1 <= p273)) OR ((1 <= p231) AND (1 <= p250)) OR ((1 <= p239) AND (1 <= p282)) OR ((1 <= p261) AND (1 <= p268)) OR ((1 <= p259) AND (1 <= p288)) OR ((1 <= p231) AND (1 <= p253)) OR ((1 <= p249) AND (1 <= p269)) OR ((1 <= p245) AND (1 <= p266)) OR ((1 <= p247) AND (1 <= p270)) OR ((1 <= p232) AND (1 <= p266)) OR ((1 <= p234) AND (1 <= p286)) OR ((1 <= p238) AND (1 <= p277)) OR ((1 <= p260) AND (1 <= p263)) OR ((1 <= p233) AND (1 <= p272)) OR ((1 <= p248) AND (1 <= p275)) OR ((1 <= p252) AND (1 <= p275)) OR ((1 <= p244) AND (1 <= p287)) OR ((1 <= p262) AND (1 <= p285)) OR ((1 <= p249) AND (1 <= p284)) OR ((1 <= p261) AND (1 <= p279)) OR ((1 <= p257) AND (1 <= p276)) OR ((1 <= p243) AND (1 <= p274)) OR ((1 <= p238) AND (1 <= p266)) OR ((1 <= p254) AND (1 <= p264)) OR ((1 <= p230) AND (1 <= p258)) OR ((1 <= p248) AND (1 <= p264)) OR ((1 <= p258) AND (1 <= p282)) OR ((1 <= p246) AND (1 <= p271)) OR ((1 <= p229) AND (1 <= p260)) OR ((1 <= p233) AND (1 <= p280)) OR ((1 <= p250) AND (1 <= p278)) OR ((1 <= p251) AND (1 <= p285)) OR ((1 <= p245) AND (1 <= p272)) OR ((1 <= p254) AND (1 <= p278)) OR ((1 <= p236) AND (1 <= p276)) OR ((1 <= p253) AND (1 <= p269)) OR ((1 <= p250) AND (1 <= p275)) OR ((1 <= p240) AND (1 <= p270)) OR ((1 <= p230) AND (1 <= p239)) OR ((1 <= p245) AND (1 <= p280)) OR ((1 <= p241) AND (1 <= p271)) OR ((1 <= p232) AND (1 <= p283)) OR ((1 <= p244) AND (1 <= p274)) OR ((1 <= p256) AND (1 <= p282)) OR ((1 <= p250) AND (1 <= p264)) OR ((1 <= p240) AND (1 <= p281)) OR ((1 <= p259) AND (1 <= p285)) OR ((1 <= p231) AND (1 <= p249)) OR ((1 <= p260) AND (1 <= p279)) OR ((1 <= p243) AND (1 <= p287)) OR ((1 <= p261) AND (1 <= p263)) OR ((1 <= p231) AND (1 <= p252)) OR ((1 <= p235) AND (1 <= p286)) OR ((1 <= p255) AND (1 <= p288)) OR ((1 <= p237) AND (1 <= p267)) OR ((1 <= p248) AND (1 <= p278)) OR ((1 <= p238) AND (1 <= p280)) OR ((1 <= p262) AND (1 <= p288)) OR ((1 <= p233) AND (1 <= p277)) OR ((1 <= p252) AND (1 <= p278)) OR ((1 <= p257) AND (1 <= p273)) OR ((1 <= p260) AND (1 <= p268)) OR ((1 <= p256) AND (1 <= p267)) OR ((1 <= p243) AND (1 <= p271)) OR ((1 <= p234) AND (1 <= p283)) OR ((1 <= p237) AND (1 <= p282)) OR ((1 <= p253) AND (1 <= p284)) OR ((1 <= p239) AND (1 <= p267)) OR ((1 <= p246) AND (1 <= p274)) OR ((1 <= p247) AND (1 <= p265)) OR ((1 <= p241) AND (1 <= p287)) OR ((1 <= p229) AND (1 <= p261)) OR ((1 <= p257) AND (1 <= p289)) OR ((1 <= p238) AND (1 <= p272))) AND (((1 <= p159)) OR ((1 <= p165)) OR ((1 <= p164)) OR ((1 <= p163)) OR ((1 <= p137)) OR ((1 <= p166))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3240 literals and 1080 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 239982 markings, 663278 edges, 47996 markings/sec, 0 secs
lola: sara is running 5 secs || 460123 markings, 1527284 edges, 44028 markings/sec, 5 secs
lola: sara is running 10 secs || 674009 markings, 2436078 edges, 42777 markings/sec, 10 secs
lola: sara is running 15 secs || 884153 markings, 3354080 edges, 42029 markings/sec, 15 secs
lola: sara is running 20 secs || 1097443 markings, 4260979 edges, 42658 markings/sec, 20 secs
lola: sara is running 25 secs || 1297780 markings, 5175447 edges, 40067 markings/sec, 25 secs
lola: sara is running 30 secs || 1506412 markings, 6054259 edges, 41726 markings/sec, 30 secs
lola: sara is running 35 secs || 1716566 markings, 6897349 edges, 42031 markings/sec, 35 secs
lola: sara is running 40 secs || 1921913 markings, 7762901 edges, 41069 markings/sec, 40 secs
lola: sara is running 45 secs || 2129284 markings, 8603368 edges, 41474 markings/sec, 45 secs
lola: sara is running 50 secs || 2337584 markings, 9458213 edges, 41660 markings/sec, 50 secs
sara: warning, failure of lp_solve (at job 14936)
lola: sara is running 55 secs || 2539405 markings, 10349925 edges, 40364 markings/sec, 55 secs
lola: sara is running 60 secs || 2748412 markings, 11189062 edges, 41801 markings/sec, 60 secs
lola: sara is running 65 secs || 2956443 markings, 12048682 edges, 41606 markings/sec, 65 secs
lola: sara is running 70 secs || 3158454 markings, 12955703 edges, 40402 markings/sec, 70 secs
lola: sara is running 75 secs || 3366607 markings, 13803686 edges, 41631 markings/sec, 75 secs
lola: sara is running 80 secs || 3571090 markings, 14668791 edges, 40897 markings/sec, 80 secs
lola: sara is running 85 secs || 3776960 markings, 15528145 edges, 41174 markings/sec, 85 secs
lola: sara is running 90 secs || 3975621 markings, 16433974 edges, 39732 markings/sec, 90 secs
lola: sara is running 95 secs || 4182590 markings, 17266067 edges, 41394 markings/sec, 95 secs
lola: sara is running 100 secs || 4388393 markings, 18130740 edges, 41161 markings/sec, 100 secs
lola: sara is running 105 secs || 4588621 markings, 19027840 edges, 40046 markings/sec, 105 secs
lola: sara is running 110 secs || 4793328 markings, 19890389 edges, 40941 markings/sec, 110 secs
lola: sara is running 115 secs || 4989886 markings, 20806155 edges, 39312 markings/sec, 115 secs
lola: sara is running 120 secs || 5197203 markings, 21630999 edges, 41463 markings/sec, 120 secs
lola: sara is running 125 secs || 5399076 markings, 22525451 edges, 40375 markings/sec, 125 secs
lola: sara is running 130 secs || 5599838 markings, 23398346 edges, 40152 markings/sec, 130 secs
lola: sara is running 135 secs || 5787874 markings, 24261965 edges, 37607 markings/sec, 135 secs
lola: sara is running 140 secs || 5978599 markings, 25066292 edges, 38145 markings/sec, 140 secs
lola: sara is running 145 secs || 6165728 markings, 25894293 edges, 37426 markings/sec, 145 secs
lola: sara is running 150 secs || 6353133 markings, 26727689 edges, 37481 markings/sec, 150 secs
lola: sara is running 155 secs || 6539012 markings, 27565929 edges, 37176 markings/sec, 155 secs
lola: sara is running 160 secs || 6721891 markings, 28380907 edges, 36576 markings/sec, 160 secs
lola: sara is running 165 secs || 6904297 markings, 29203643 edges, 36481 markings/sec, 165 secs
lola: sara is running 170 secs || 7097930 markings, 30076426 edges, 38727 markings/sec, 170 secs
lola: sara is running 175 secs || 7292929 markings, 30965819 edges, 39000 markings/sec, 175 secs
lola: sara is running 180 secs || 7483236 markings, 31906061 edges, 38061 markings/sec, 180 secs
lola: sara is running 185 secs || 7673007 markings, 32731377 edges, 37954 markings/sec, 185 secs
lola: sara is running 190 secs || 7878374 markings, 33589598 edges, 41073 markings/sec, 190 secs
lola: sara is running 195 secs || 8078194 markings, 34497520 edges, 39964 markings/sec, 195 secs
lola: sara is running 200 secs || 8274750 markings, 35386779 edges, 39311 markings/sec, 200 secs
lola: sara is running 205 secs || 8467630 markings, 36240310 edges, 38576 markings/sec, 205 secs
lola: sara is running 210 secs || 8662744 markings, 37003259 edges, 39023 markings/sec, 210 secs
lola: sara is running 215 secs || 8864149 markings, 37782320 edges, 40281 markings/sec, 215 secs
lola: sara is running 220 secs || 9072637 markings, 38622754 edges, 41698 markings/sec, 220 secs
lola: sara is running 225 secs || 9280681 markings, 39431904 edges, 41609 markings/sec, 225 secs
lola: sara is running 230 secs || 9480672 markings, 40216871 edges, 39998 markings/sec, 230 secs
lola: sara is running 235 secs || 9678568 markings, 41085118 edges, 39579 markings/sec, 235 secs
lola: sara is running 240 secs || 9870460 markings, 41926103 edges, 38378 markings/sec, 240 secs
lola: sara is running 245 secs || 10062146 markings, 42669444 edges, 38337 markings/sec, 245 secs
lola: sara is running 250 secs || 10272514 markings, 43460440 edges, 42074 markings/sec, 250 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10421837 markings, 44044212 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes
lola:
preliminary result: no yes
lola: memory consumption: 145808 KB
lola: time consumption: 270 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is Peterson-PT-5, 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 r151-tall-162089151400316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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