Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853600735.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
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 r174-csrt-158987853600735
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 63K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 170K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 72K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 245K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 54K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 49K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 50K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 169K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 22K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 911K Apr 27 15:14 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 1591166311874

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 06:38:34] [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]
[2020-06-03 06:38:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 06:38:34] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2020-06-03 06:38:34] [INFO ] Transformed 834 places.
[2020-06-03 06:38:34] [INFO ] Transformed 1242 transitions.
[2020-06-03 06:38:34] [INFO ] Parsed PT model containing 834 places and 1242 transitions in 212 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 70 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-5-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 190 ms. (steps per millisecond=52 ) properties seen :[0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0]
FORMULA Peterson-PT-5-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 165 ms. (steps per millisecond=60 ) 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 380 ms. (steps per millisecond=26 ) 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 84 ms. (steps per millisecond=119 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0]
FORMULA Peterson-PT-5-ReachabilityFireability-14 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]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
[2020-06-03 06:38:35] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2020-06-03 06:38:35] [INFO ] Computed 23 place invariants in 38 ms
[2020-06-03 06:38:35] [INFO ] [Real]Absence check using 17 positive place invariants in 55 ms returned sat
[2020-06-03 06:38:35] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 7 ms returned sat
[2020-06-03 06:38:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:38:38] [INFO ] [Real]Absence check using state equation in 2179 ms returned sat
[2020-06-03 06:38:38] [INFO ] State equation strengthened by 230 read => feed constraints.
[2020-06-03 06:38:38] [INFO ] [Real]Added 230 Read/Feed constraints in 79 ms returned sat
[2020-06-03 06:38:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:38:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 69 ms returned sat
[2020-06-03 06:38:38] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 7 ms returned sat
[2020-06-03 06:38:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:38:40] [INFO ] [Nat]Absence check using state equation in 2181 ms returned sat
[2020-06-03 06:38:40] [INFO ] [Nat]Added 230 Read/Feed constraints in 64 ms returned sat
[2020-06-03 06:38:41] [INFO ] Deduced a trap composed of 141 places in 396 ms
[2020-06-03 06:38:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 552 ms
[2020-06-03 06:38:41] [INFO ] Computed and/alt/rep : 1236/4722/1116 causal constraints in 95 ms.
[2020-06-03 06:38:43] [INFO ] Added : 140 causal constraints over 28 iterations in 1915 ms. Result :(error "Failed to check-sat")
[2020-06-03 06:38:43] [INFO ] [Real]Absence check using 17 positive place invariants in 65 ms returned sat
[2020-06-03 06:38:43] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 17 ms returned sat
[2020-06-03 06:38:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:38:46] [INFO ] [Real]Absence check using state equation in 3372 ms returned sat
[2020-06-03 06:38:47] [INFO ] [Real]Added 230 Read/Feed constraints in 106 ms returned sat
[2020-06-03 06:38:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:38:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 75 ms returned sat
[2020-06-03 06:38:47] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 14 ms returned sat
[2020-06-03 06:38:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:38:50] [INFO ] [Nat]Absence check using state equation in 3316 ms returned sat
[2020-06-03 06:38:50] [INFO ] [Nat]Added 230 Read/Feed constraints in 81 ms returned sat
[2020-06-03 06:38:51] [INFO ] Deduced a trap composed of 15 places in 494 ms
[2020-06-03 06:38:51] [INFO ] Deduced a trap composed of 30 places in 510 ms
[2020-06-03 06:38:52] [INFO ] Deduced a trap composed of 63 places in 578 ms
[2020-06-03 06:38:52] [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 s32 s34 s57 s62 s85 s98 s121 s133 s142 s148 s180 s186 s212 s214 s232 s244 s250 s255 s257 s289 s316 s321 s344 s353 s380 s401 s424 s436 s437 s464 s469 s479 s482 s501 s506 s522 s531 s538 s559 s564 s578 s588 s614 s620 s630 s643 s649 s675 s677 s715 s722 s741 s747 s756 s784 s786 s790 s801 s812 s815 s828) 0)") while checking expression at index 1
[2020-06-03 06:38:52] [INFO ] [Real]Absence check using 17 positive place invariants in 35 ms returned sat
[2020-06-03 06:38:52] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-06-03 06:38:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:38:54] [INFO ] [Real]Absence check using state equation in 1732 ms returned sat
[2020-06-03 06:38:54] [INFO ] [Real]Added 230 Read/Feed constraints in 54 ms returned sat
[2020-06-03 06:38:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:38:54] [INFO ] [Nat]Absence check using 17 positive place invariants in 34 ms returned sat
[2020-06-03 06:38:54] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-06-03 06:38:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:38:56] [INFO ] [Nat]Absence check using state equation in 1687 ms returned sat
[2020-06-03 06:38:56] [INFO ] [Nat]Added 230 Read/Feed constraints in 119 ms returned sat
[2020-06-03 06:38:56] [INFO ] Deduced a trap composed of 60 places in 630 ms
[2020-06-03 06:38:57] [INFO ] Deduced a trap composed of 39 places in 555 ms
[2020-06-03 06:38:58] [INFO ] Deduced a trap composed of 11 places in 558 ms
[2020-06-03 06:38:58] [INFO ] Deduced a trap composed of 11 places in 600 ms
[2020-06-03 06:38:59] [INFO ] Deduced a trap composed of 11 places in 553 ms
[2020-06-03 06:38:59] [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 2
[2020-06-03 06:38:59] [INFO ] [Real]Absence check using 17 positive place invariants in 36 ms returned sat
[2020-06-03 06:38:59] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2020-06-03 06:38:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:39:01] [INFO ] [Real]Absence check using state equation in 1683 ms returned sat
[2020-06-03 06:39:01] [INFO ] [Real]Added 230 Read/Feed constraints in 27 ms returned sat
[2020-06-03 06:39:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:39:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 30 ms returned sat
[2020-06-03 06:39:01] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2020-06-03 06:39:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:39:03] [INFO ] [Nat]Absence check using state equation in 1646 ms returned sat
[2020-06-03 06:39:03] [INFO ] [Nat]Added 230 Read/Feed constraints in 61 ms returned sat
[2020-06-03 06:39:03] [INFO ] Deduced a trap composed of 54 places in 445 ms
[2020-06-03 06:39:04] [INFO ] Deduced a trap composed of 11 places in 465 ms
[2020-06-03 06:39:04] [INFO ] Deduced a trap composed of 11 places in 458 ms
[2020-06-03 06:39:05] [INFO ] Deduced a trap composed of 11 places in 419 ms
[2020-06-03 06:39:05] [INFO ] Deduced a trap composed of 94 places in 538 ms
[2020-06-03 06:39:06] [INFO ] Deduced a trap composed of 46 places in 595 ms
[2020-06-03 06:39:06] [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 s32 s57 s85 s121 s142 s186 s208 s214 s222 s250 s255 s316 s344 s380 s388 s401 s429 s436 s469 s482 s506 s522 s527 s564 s573 s578 s609 s614 s623 s649 s677 s721 s741 s756 s784 s786 s797 s799 s804 s810 s818 s820 s824 s826 s827) 0)") while checking expression at index 3
[2020-06-03 06:39:06] [INFO ] [Real]Absence check using 17 positive place invariants in 28 ms returned sat
[2020-06-03 06:39:06] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2020-06-03 06:39:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:39:08] [INFO ] [Real]Absence check using state equation in 1647 ms returned sat
[2020-06-03 06:39:08] [INFO ] [Real]Added 230 Read/Feed constraints in 39 ms returned sat
[2020-06-03 06:39:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:39:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 38 ms returned sat
[2020-06-03 06:39:08] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2020-06-03 06:39:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:39:10] [INFO ] [Nat]Absence check using state equation in 1620 ms returned sat
[2020-06-03 06:39:10] [INFO ] [Nat]Added 230 Read/Feed constraints in 96 ms returned sat
[2020-06-03 06:39:10] [INFO ] Deduced a trap composed of 41 places in 424 ms
[2020-06-03 06:39:11] [INFO ] Deduced a trap composed of 79 places in 417 ms
[2020-06-03 06:39:11] [INFO ] Deduced a trap composed of 75 places in 453 ms
[2020-06-03 06:39:12] [INFO ] Deduced a trap composed of 34 places in 480 ms
[2020-06-03 06:39:12] [INFO ] Deduced a trap composed of 53 places in 458 ms
[2020-06-03 06:39:13] [INFO ] Deduced a trap composed of 34 places in 421 ms
[2020-06-03 06:39:13] [INFO ] Deduced a trap composed of 11 places in 403 ms
[2020-06-03 06:39:13] [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
[2020-06-03 06:39:13] [INFO ] [Real]Absence check using 17 positive place invariants in 33 ms returned sat
[2020-06-03 06:39:13] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 7 ms returned sat
[2020-06-03 06:39:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:39:15] [INFO ] [Real]Absence check using state equation in 1554 ms returned sat
[2020-06-03 06:39:15] [INFO ] [Real]Added 230 Read/Feed constraints in 33 ms returned sat
[2020-06-03 06:39:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:39:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 31 ms returned sat
[2020-06-03 06:39:15] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-06-03 06:39:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:39:17] [INFO ] [Nat]Absence check using state equation in 1727 ms returned sat
[2020-06-03 06:39:17] [INFO ] [Nat]Added 230 Read/Feed constraints in 64 ms returned sat
[2020-06-03 06:39:17] [INFO ] Deduced a trap composed of 139 places in 491 ms
[2020-06-03 06:39:18] [INFO ] Deduced a trap composed of 93 places in 502 ms
[2020-06-03 06:39:18] [INFO ] Deduced a trap composed of 14 places in 473 ms
[2020-06-03 06:39:19] [INFO ] Deduced a trap composed of 11 places in 572 ms
[2020-06-03 06:39:20] [INFO ] Deduced a trap composed of 15 places in 579 ms
[2020-06-03 06:39:20] [INFO ] Deduced a trap composed of 15 places in 548 ms
[2020-06-03 06:39:20] [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 s216 s248 s391 s393 s435 s520 s584 s616 s724 s787 s798 s803 s817 s823) 0)") while checking expression at index 5
[2020-06-03 06:39:20] [INFO ] [Real]Absence check using 17 positive place invariants in 27 ms returned unsat
[2020-06-03 06:39:20] [INFO ] [Real]Absence check using 17 positive place invariants in 26 ms returned unsat
FORMULA Peterson-PT-5-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-5-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 486 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
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 50 place count 809 transition count 1211
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 62 place count 803 transition count 1211
Applied a total of 62 rules in 133 ms. Remains 803 /834 variables (removed 31) and now considering 1211/1242 (removed 31) transitions.
Finished structural reductions, in 1 iterations. Remains : 803/834 places, 1211/1242 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 11914 ms. (steps per millisecond=83 ) properties seen :[0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 389711 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=77 ) properties seen :[0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 124978 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=24 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2521 ms. (steps per millisecond=396 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1997 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2032 ms. (steps per millisecond=492 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2070 ms. (steps per millisecond=483 ) properties seen :[0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 5083008 steps, run timeout after 30001 ms. (steps per millisecond=169 ) properties seen :[0, 0, 0, 0, 0, 0]
Probabilistic random walk after 5083008 steps, saw 726145 distinct states, run finished after 30001 ms. (steps per millisecond=169 ) properties seen :[0, 0, 0, 0, 0, 0]
[2020-06-03 06:40:21] [INFO ] Flow matrix only has 1091 transitions (discarded 120 similar events)
// Phase 1: matrix 1091 rows 803 cols
[2020-06-03 06:40:21] [INFO ] Computed 23 place invariants in 18 ms
[2020-06-03 06:40:21] [INFO ] [Real]Absence check using 17 positive place invariants in 36 ms returned sat
[2020-06-03 06:40:21] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-06-03 06:40:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:40:23] [INFO ] [Real]Absence check using state equation in 1937 ms returned sat
[2020-06-03 06:40:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:40:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 37 ms returned sat
[2020-06-03 06:40:23] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2020-06-03 06:40:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:40:25] [INFO ] [Nat]Absence check using state equation in 1764 ms returned sat
[2020-06-03 06:40:25] [INFO ] State equation strengthened by 230 read => feed constraints.
[2020-06-03 06:40:25] [INFO ] [Nat]Added 230 Read/Feed constraints in 100 ms returned sat
[2020-06-03 06:40:25] [INFO ] Deduced a trap composed of 38 places in 187 ms
[2020-06-03 06:40:26] [INFO ] Deduced a trap composed of 55 places in 407 ms
[2020-06-03 06:40:26] [INFO ] Deduced a trap composed of 45 places in 406 ms
[2020-06-03 06:40:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1199 ms
[2020-06-03 06:40:27] [INFO ] Computed and/alt/rep : 1205/4691/1085 causal constraints in 81 ms.
[2020-06-03 06:40:45] [INFO ] Added : 981 causal constraints over 197 iterations in 18119 ms. Result :sat
[2020-06-03 06:40:45] [INFO ] Deduced a trap composed of 42 places in 376 ms
[2020-06-03 06:40:45] [INFO ] Deduced a trap composed of 50 places in 357 ms
[2020-06-03 06:40:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1058 ms
Attempting to minimize the solution found.
Minimization took 67 ms.
[2020-06-03 06:40:46] [INFO ] [Real]Absence check using 17 positive place invariants in 53 ms returned sat
[2020-06-03 06:40:46] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 13 ms returned sat
[2020-06-03 06:40:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:40:49] [INFO ] [Real]Absence check using state equation in 2964 ms returned sat
[2020-06-03 06:40:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:40:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 78 ms returned sat
[2020-06-03 06:40:49] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 9 ms returned sat
[2020-06-03 06:40:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:40:51] [INFO ] [Nat]Absence check using state equation in 2420 ms returned sat
[2020-06-03 06:40:52] [INFO ] [Nat]Added 230 Read/Feed constraints in 69 ms returned sat
[2020-06-03 06:40:52] [INFO ] Deduced a trap composed of 31 places in 507 ms
[2020-06-03 06:40:53] [INFO ] Deduced a trap composed of 11 places in 525 ms
[2020-06-03 06:40:53] [INFO ] Deduced a trap composed of 29 places in 466 ms
[2020-06-03 06:40:54] [INFO ] Deduced a trap composed of 69 places in 480 ms
[2020-06-03 06:40:54] [INFO ] Deduced a trap composed of 75 places in 507 ms
[2020-06-03 06:40:55] [INFO ] Deduced a trap composed of 55 places in 483 ms
[2020-06-03 06:40:55] [INFO ] Deduced a trap composed of 31 places in 479 ms
[2020-06-03 06:40:56] [INFO ] Deduced a trap composed of 55 places in 470 ms
[2020-06-03 06:40:57] [INFO ] Deduced a trap composed of 55 places in 502 ms
[2020-06-03 06:40:57] [INFO ] Deduced a trap composed of 31 places in 463 ms
[2020-06-03 06:40:58] [INFO ] Deduced a trap composed of 11 places in 508 ms
[2020-06-03 06:40:58] [INFO ] Deduced a trap composed of 75 places in 477 ms
[2020-06-03 06:40:59] [INFO ] Deduced a trap composed of 65 places in 474 ms
[2020-06-03 06:40:59] [INFO ] Deduced a trap composed of 91 places in 471 ms
[2020-06-03 06:41:00] [INFO ] Deduced a trap composed of 91 places in 440 ms
[2020-06-03 06:41:00] [INFO ] Deduced a trap composed of 65 places in 361 ms
[2020-06-03 06:41:01] [INFO ] Deduced a trap composed of 81 places in 415 ms
[2020-06-03 06:41:01] [INFO ] Deduced a trap composed of 11 places in 487 ms
[2020-06-03 06:41:02] [INFO ] Deduced a trap composed of 13 places in 495 ms
[2020-06-03 06:41:02] [INFO ] Deduced a trap composed of 11 places in 502 ms
[2020-06-03 06:41:03] [INFO ] Deduced a trap composed of 11 places in 509 ms
[2020-06-03 06:41:04] [INFO ] Deduced a trap composed of 211 places in 346 ms
[2020-06-03 06:41:04] [INFO ] Deduced a trap composed of 81 places in 314 ms
[2020-06-03 06:41:04] [INFO ] Deduced a trap composed of 81 places in 314 ms
[2020-06-03 06:41:05] [INFO ] Deduced a trap composed of 55 places in 292 ms
[2020-06-03 06:41:05] [INFO ] Deduced a trap composed of 50 places in 293 ms
[2020-06-03 06:41:06] [INFO ] Deduced a trap composed of 44 places in 328 ms
[2020-06-03 06:41:06] [INFO ] Deduced a trap composed of 67 places in 366 ms
[2020-06-03 06:41:07] [INFO ] Deduced a trap composed of 61 places in 355 ms
[2020-06-03 06:41:07] [INFO ] Deduced a trap composed of 81 places in 324 ms
[2020-06-03 06:41:08] [INFO ] Deduced a trap composed of 61 places in 386 ms
[2020-06-03 06:41:08] [INFO ] Deduced a trap composed of 44 places in 425 ms
[2020-06-03 06:41:09] [INFO ] Deduced a trap composed of 19 places in 515 ms
[2020-06-03 06:41:09] [INFO ] Deduced a trap composed of 40 places in 455 ms
[2020-06-03 06:41:10] [INFO ] Deduced a trap composed of 15 places in 485 ms
[2020-06-03 06:41:10] [INFO ] Deduced a trap composed of 15 places in 511 ms
[2020-06-03 06:41:11] [INFO ] Deduced a trap composed of 29 places in 514 ms
[2020-06-03 06:41:12] [INFO ] Deduced a trap composed of 52 places in 515 ms
[2020-06-03 06:41:12] [INFO ] Deduced a trap composed of 15 places in 466 ms
[2020-06-03 06:41:13] [INFO ] Deduced a trap composed of 40 places in 486 ms
[2020-06-03 06:41:13] [INFO ] Deduced a trap composed of 36 places in 462 ms
[2020-06-03 06:41:14] [INFO ] Deduced a trap composed of 55 places in 487 ms
[2020-06-03 06:41:14] [INFO ] Deduced a trap composed of 40 places in 428 ms
[2020-06-03 06:41:15] [INFO ] Deduced a trap composed of 23 places in 509 ms
[2020-06-03 06:41:15] [INFO ] Deduced a trap composed of 73 places in 440 ms
[2020-06-03 06:41:16] [INFO ] Deduced a trap composed of 57 places in 368 ms
[2020-06-03 06:41:16] [INFO ] Deduced a trap composed of 25 places in 516 ms
[2020-06-03 06:41:17] [INFO ] Deduced a trap composed of 130 places in 526 ms
[2020-06-03 06:41:18] [INFO ] Deduced a trap composed of 58 places in 518 ms
[2020-06-03 06:41:18] [INFO ] Deduced a trap composed of 17 places in 484 ms
[2020-06-03 06:41:19] [INFO ] Deduced a trap composed of 36 places in 457 ms
[2020-06-03 06:41:19] [INFO ] Deduced a trap composed of 123 places in 369 ms
[2020-06-03 06:41:20] [INFO ] Deduced a trap composed of 123 places in 366 ms
[2020-06-03 06:41:20] [INFO ] Deduced a trap composed of 121 places in 347 ms
[2020-06-03 06:41:20] [INFO ] Deduced a trap composed of 121 places in 328 ms
[2020-06-03 06:41:20] [INFO ] Trap strengthening (SAT) tested/added 56/55 trap constraints in 28917 ms
[2020-06-03 06:41:21] [INFO ] Computed and/alt/rep : 1205/4691/1085 causal constraints in 74 ms.
[2020-06-03 06:41:34] [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 (=> (> t653 0) (and (> t203 0) (< o203 o653)))") while checking expression at index 1
[2020-06-03 06:41:34] [INFO ] [Real]Absence check using 17 positive place invariants in 25 ms returned sat
[2020-06-03 06:41:34] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 10 ms returned sat
[2020-06-03 06:41:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:41:36] [INFO ] [Real]Absence check using state equation in 1594 ms returned sat
[2020-06-03 06:41:36] [INFO ] [Real]Added 230 Read/Feed constraints in 30 ms returned sat
[2020-06-03 06:41:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:41:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 40 ms returned sat
[2020-06-03 06:41:36] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-06-03 06:41:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:41:37] [INFO ] [Nat]Absence check using state equation in 1581 ms returned sat
[2020-06-03 06:41:37] [INFO ] [Nat]Added 230 Read/Feed constraints in 65 ms returned sat
[2020-06-03 06:41:38] [INFO ] Deduced a trap composed of 41 places in 486 ms
[2020-06-03 06:41:39] [INFO ] Deduced a trap composed of 40 places in 530 ms
[2020-06-03 06:41:39] [INFO ] Deduced a trap composed of 40 places in 495 ms
[2020-06-03 06:41:40] [INFO ] Deduced a trap composed of 55 places in 504 ms
[2020-06-03 06:41:40] [INFO ] Deduced a trap composed of 40 places in 493 ms
[2020-06-03 06:41:41] [INFO ] Deduced a trap composed of 36 places in 436 ms
[2020-06-03 06:41:41] [INFO ] Deduced a trap composed of 74 places in 546 ms
[2020-06-03 06:41:42] [INFO ] Deduced a trap composed of 50 places in 519 ms
[2020-06-03 06:41:42] [INFO ] Deduced a trap composed of 237 places in 480 ms
[2020-06-03 06:41:43] [INFO ] Deduced a trap composed of 158 places in 496 ms
[2020-06-03 06:41:43] [INFO ] Deduced a trap composed of 87 places in 501 ms
[2020-06-03 06:41:44] [INFO ] Deduced a trap composed of 25 places in 580 ms
[2020-06-03 06:41:45] [INFO ] Deduced a trap composed of 62 places in 597 ms
[2020-06-03 06:41:45] [INFO ] Deduced a trap composed of 50 places in 542 ms
[2020-06-03 06:41:46] [INFO ] Deduced a trap composed of 13 places in 551 ms
[2020-06-03 06:41:47] [INFO ] Deduced a trap composed of 15 places in 556 ms
[2020-06-03 06:41:47] [INFO ] Deduced a trap composed of 233 places in 528 ms
[2020-06-03 06:41:48] [INFO ] Deduced a trap composed of 231 places in 530 ms
[2020-06-03 06:41:48] [INFO ] Deduced a trap composed of 231 places in 545 ms
[2020-06-03 06:41:49] [INFO ] Deduced a trap composed of 25 places in 567 ms
[2020-06-03 06:41:49] [INFO ] Deduced a trap composed of 65 places in 497 ms
[2020-06-03 06:41:50] [INFO ] Deduced a trap composed of 65 places in 474 ms
[2020-06-03 06:41:51] [INFO ] Deduced a trap composed of 90 places in 477 ms
[2020-06-03 06:41:51] [INFO ] Deduced a trap composed of 233 places in 494 ms
[2020-06-03 06:41:52] [INFO ] Deduced a trap composed of 90 places in 480 ms
[2020-06-03 06:41:52] [INFO ] Deduced a trap composed of 107 places in 518 ms
[2020-06-03 06:41:53] [INFO ] Deduced a trap composed of 11 places in 501 ms
[2020-06-03 06:41:53] [INFO ] Deduced a trap composed of 27 places in 490 ms
[2020-06-03 06:41:54] [INFO ] Deduced a trap composed of 75 places in 414 ms
[2020-06-03 06:41:54] [INFO ] Deduced a trap composed of 88 places in 395 ms
[2020-06-03 06:41:55] [INFO ] Deduced a trap composed of 101 places in 412 ms
[2020-06-03 06:41:55] [INFO ] Deduced a trap composed of 110 places in 415 ms
[2020-06-03 06:41:56] [INFO ] Deduced a trap composed of 119 places in 422 ms
[2020-06-03 06:41:56] [INFO ] Deduced a trap composed of 86 places in 438 ms
[2020-06-03 06:41:57] [INFO ] Deduced a trap composed of 86 places in 475 ms
[2020-06-03 06:41:57] [INFO ] Deduced a trap composed of 29 places in 397 ms
[2020-06-03 06:41:58] [INFO ] Deduced a trap composed of 38 places in 530 ms
[2020-06-03 06:41:58] [INFO ] Deduced a trap composed of 63 places in 527 ms
[2020-06-03 06:41:59] [INFO ] Deduced a trap composed of 31 places in 497 ms
[2020-06-03 06:42:00] [INFO ] Deduced a trap composed of 136 places in 414 ms
[2020-06-03 06:42:00] [INFO ] Deduced a trap composed of 66 places in 439 ms
[2020-06-03 06:42:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 41 trap constraints in 22591 ms
[2020-06-03 06:42:00] [INFO ] [Real]Absence check using 17 positive place invariants in 24 ms returned sat
[2020-06-03 06:42:00] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2020-06-03 06:42:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:42:02] [INFO ] [Real]Absence check using state equation in 1543 ms returned sat
[2020-06-03 06:42:02] [INFO ] [Real]Added 230 Read/Feed constraints in 37 ms returned sat
[2020-06-03 06:42:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:42:02] [INFO ] [Nat]Absence check using 17 positive place invariants in 31 ms returned sat
[2020-06-03 06:42:02] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2020-06-03 06:42:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:42:04] [INFO ] [Nat]Absence check using state equation in 1545 ms returned sat
[2020-06-03 06:42:04] [INFO ] [Nat]Added 230 Read/Feed constraints in 62 ms returned sat
[2020-06-03 06:42:04] [INFO ] Deduced a trap composed of 11 places in 426 ms
[2020-06-03 06:42:04] [INFO ] Deduced a trap composed of 11 places in 409 ms
[2020-06-03 06:42:05] [INFO ] Deduced a trap composed of 11 places in 469 ms
[2020-06-03 06:42:06] [INFO ] Deduced a trap composed of 55 places in 504 ms
[2020-06-03 06:42:06] [INFO ] Deduced a trap composed of 55 places in 475 ms
[2020-06-03 06:42:07] [INFO ] Deduced a trap composed of 36 places in 469 ms
[2020-06-03 06:42:07] [INFO ] Deduced a trap composed of 43 places in 491 ms
[2020-06-03 06:42:08] [INFO ] Deduced a trap composed of 29 places in 484 ms
[2020-06-03 06:42:08] [INFO ] Deduced a trap composed of 55 places in 483 ms
[2020-06-03 06:42:09] [INFO ] Deduced a trap composed of 15 places in 487 ms
[2020-06-03 06:42:09] [INFO ] Deduced a trap composed of 13 places in 459 ms
[2020-06-03 06:42:10] [INFO ] Deduced a trap composed of 48 places in 477 ms
[2020-06-03 06:42:10] [INFO ] Deduced a trap composed of 40 places in 451 ms
[2020-06-03 06:42:11] [INFO ] Deduced a trap composed of 31 places in 480 ms
[2020-06-03 06:42:11] [INFO ] Deduced a trap composed of 17 places in 567 ms
[2020-06-03 06:42:12] [INFO ] Deduced a trap composed of 113 places in 500 ms
[2020-06-03 06:42:13] [INFO ] Deduced a trap composed of 65 places in 499 ms
[2020-06-03 06:42:13] [INFO ] Deduced a trap composed of 49 places in 496 ms
[2020-06-03 06:42:14] [INFO ] Deduced a trap composed of 69 places in 509 ms
[2020-06-03 06:42:14] [INFO ] Deduced a trap composed of 55 places in 487 ms
[2020-06-03 06:42:15] [INFO ] Deduced a trap composed of 55 places in 494 ms
[2020-06-03 06:42:15] [INFO ] Deduced a trap composed of 55 places in 471 ms
[2020-06-03 06:42:16] [INFO ] Deduced a trap composed of 41 places in 471 ms
[2020-06-03 06:42:16] [INFO ] Deduced a trap composed of 41 places in 460 ms
[2020-06-03 06:42:17] [INFO ] Deduced a trap composed of 55 places in 455 ms
[2020-06-03 06:42:17] [INFO ] Deduced a trap composed of 55 places in 459 ms
[2020-06-03 06:42:18] [INFO ] Deduced a trap composed of 87 places in 479 ms
[2020-06-03 06:42:18] [INFO ] Deduced a trap composed of 52 places in 526 ms
[2020-06-03 06:42:19] [INFO ] Deduced a trap composed of 75 places in 474 ms
[2020-06-03 06:42:19] [INFO ] Deduced a trap composed of 55 places in 434 ms
[2020-06-03 06:42:20] [INFO ] Deduced a trap composed of 27 places in 429 ms
[2020-06-03 06:42:20] [INFO ] Deduced a trap composed of 27 places in 440 ms
[2020-06-03 06:42:21] [INFO ] Deduced a trap composed of 39 places in 504 ms
[2020-06-03 06:42:21] [INFO ] Deduced a trap composed of 50 places in 488 ms
[2020-06-03 06:42:22] [INFO ] Deduced a trap composed of 77 places in 387 ms
[2020-06-03 06:42:22] [INFO ] Deduced a trap composed of 117 places in 359 ms
[2020-06-03 06:42:23] [INFO ] Deduced a trap composed of 55 places in 260 ms
[2020-06-03 06:42:23] [INFO ] Deduced a trap composed of 61 places in 422 ms
[2020-06-03 06:42:23] [INFO ] Deduced a trap composed of 57 places in 380 ms
[2020-06-03 06:42:24] [INFO ] Deduced a trap composed of 78 places in 477 ms
[2020-06-03 06:42:24] [INFO ] Deduced a trap composed of 69 places in 227 ms
[2020-06-03 06:42:25] [INFO ] Deduced a trap composed of 69 places in 258 ms
[2020-06-03 06:42:25] [INFO ] Deduced a trap composed of 69 places in 224 ms
[2020-06-03 06:42:25] [INFO ] Deduced a trap composed of 69 places in 240 ms
[2020-06-03 06:42:25] [INFO ] Deduced a trap composed of 113 places in 212 ms
[2020-06-03 06:42:26] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 21978 ms
[2020-06-03 06:42:26] [INFO ] Computed and/alt/rep : 1205/4691/1085 causal constraints in 75 ms.
[2020-06-03 06:42:46] [INFO ] Added : 895 causal constraints over 179 iterations in 20211 ms.(timeout) Result :sat
[2020-06-03 06:42:46] [INFO ] Deduced a trap composed of 41 places in 352 ms
[2020-06-03 06:42:47] [INFO ] Deduced a trap composed of 63 places in 351 ms
[2020-06-03 06:42:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 06:42:48] [INFO ] Deduced a trap composed of 2 places in 644 ms
[2020-06-03 06:42:48] [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 s779) 0)") while checking expression at index 3
[2020-06-03 06:42:48] [INFO ] [Real]Absence check using 17 positive place invariants in 26 ms returned sat
[2020-06-03 06:42:48] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 8 ms returned sat
[2020-06-03 06:42:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:42:49] [INFO ] [Real]Absence check using state equation in 1572 ms returned sat
[2020-06-03 06:42:49] [INFO ] [Real]Added 230 Read/Feed constraints in 32 ms returned sat
[2020-06-03 06:42:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:42:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 28 ms returned sat
[2020-06-03 06:42:49] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2020-06-03 06:42:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:42:51] [INFO ] [Nat]Absence check using state equation in 1600 ms returned sat
[2020-06-03 06:42:51] [INFO ] [Nat]Added 230 Read/Feed constraints in 67 ms returned sat
[2020-06-03 06:42:52] [INFO ] Deduced a trap composed of 39 places in 560 ms
[2020-06-03 06:42:52] [INFO ] Deduced a trap composed of 39 places in 572 ms
[2020-06-03 06:42:53] [INFO ] Deduced a trap composed of 50 places in 553 ms
[2020-06-03 06:42:53] [INFO ] Deduced a trap composed of 39 places in 520 ms
[2020-06-03 06:42:54] [INFO ] Deduced a trap composed of 65 places in 469 ms
[2020-06-03 06:42:55] [INFO ] Deduced a trap composed of 65 places in 511 ms
[2020-06-03 06:42:55] [INFO ] Deduced a trap composed of 65 places in 518 ms
[2020-06-03 06:42:56] [INFO ] Deduced a trap composed of 58 places in 520 ms
[2020-06-03 06:42:56] [INFO ] Deduced a trap composed of 39 places in 499 ms
[2020-06-03 06:42:57] [INFO ] Deduced a trap composed of 41 places in 583 ms
[2020-06-03 06:42:57] [INFO ] Deduced a trap composed of 11 places in 489 ms
[2020-06-03 06:42:58] [INFO ] Deduced a trap composed of 11 places in 555 ms
[2020-06-03 06:42:59] [INFO ] Deduced a trap composed of 11 places in 492 ms
[2020-06-03 06:42:59] [INFO ] Deduced a trap composed of 17 places in 459 ms
[2020-06-03 06:43:00] [INFO ] Deduced a trap composed of 11 places in 504 ms
[2020-06-03 06:43:00] [INFO ] Deduced a trap composed of 11 places in 524 ms
[2020-06-03 06:43:01] [INFO ] Deduced a trap composed of 36 places in 508 ms
[2020-06-03 06:43:01] [INFO ] Deduced a trap composed of 118 places in 399 ms
[2020-06-03 06:43:02] [INFO ] Deduced a trap composed of 139 places in 442 ms
[2020-06-03 06:43:02] [INFO ] Deduced a trap composed of 70 places in 454 ms
[2020-06-03 06:43:03] [INFO ] Deduced a trap composed of 77 places in 445 ms
[2020-06-03 06:43:03] [INFO ] Deduced a trap composed of 86 places in 462 ms
[2020-06-03 06:43:04] [INFO ] Deduced a trap composed of 55 places in 433 ms
[2020-06-03 06:43:04] [INFO ] Deduced a trap composed of 62 places in 452 ms
[2020-06-03 06:43:05] [INFO ] Deduced a trap composed of 100 places in 402 ms
[2020-06-03 06:43:05] [INFO ] Deduced a trap composed of 86 places in 382 ms
[2020-06-03 06:43:05] [INFO ] Deduced a trap composed of 86 places in 372 ms
[2020-06-03 06:43:06] [INFO ] Deduced a trap composed of 105 places in 384 ms
[2020-06-03 06:43:06] [INFO ] Deduced a trap composed of 86 places in 359 ms
[2020-06-03 06:43:07] [INFO ] Deduced a trap composed of 63 places in 439 ms
[2020-06-03 06:43:07] [INFO ] Deduced a trap composed of 75 places in 412 ms
[2020-06-03 06:43:08] [INFO ] Deduced a trap composed of 72 places in 503 ms
[2020-06-03 06:43:08] [INFO ] Deduced a trap composed of 59 places in 464 ms
[2020-06-03 06:43:09] [INFO ] Deduced a trap composed of 36 places in 483 ms
[2020-06-03 06:43:09] [INFO ] Deduced a trap composed of 43 places in 436 ms
[2020-06-03 06:43:10] [INFO ] Deduced a trap composed of 36 places in 359 ms
[2020-06-03 06:43:10] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 18893 ms
[2020-06-03 06:43:10] [INFO ] Computed and/alt/rep : 1205/4691/1085 causal constraints in 57 ms.
[2020-06-03 06:43:30] [INFO ] Added : 985 causal constraints over 197 iterations in 20280 ms.(timeout) Result :sat
[2020-06-03 06:43:31] [INFO ] Deduced a trap composed of 88 places in 509 ms
[2020-06-03 06:43:31] [INFO ] Deduced a trap composed of 13 places in 498 ms
[2020-06-03 06:43:32] [INFO ] Deduced a trap composed of 55 places in 381 ms
[2020-06-03 06:43:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2626 ms
Attempting to minimize the solution found.
Minimization took 130 ms.
[2020-06-03 06:43:33] [INFO ] [Real]Absence check using 17 positive place invariants in 27 ms returned sat
[2020-06-03 06:43:33] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2020-06-03 06:43:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:43:35] [INFO ] [Real]Absence check using state equation in 1573 ms returned sat
[2020-06-03 06:43:35] [INFO ] [Real]Added 230 Read/Feed constraints in 48 ms returned sat
[2020-06-03 06:43:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:43:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 36 ms returned sat
[2020-06-03 06:43:35] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-06-03 06:43:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:43:37] [INFO ] [Nat]Absence check using state equation in 1585 ms returned sat
[2020-06-03 06:43:37] [INFO ] [Nat]Added 230 Read/Feed constraints in 59 ms returned sat
[2020-06-03 06:43:37] [INFO ] Deduced a trap composed of 119 places in 556 ms
[2020-06-03 06:43:38] [INFO ] Deduced a trap composed of 32 places in 531 ms
[2020-06-03 06:43:38] [INFO ] Deduced a trap composed of 32 places in 517 ms
[2020-06-03 06:43:39] [INFO ] Deduced a trap composed of 53 places in 581 ms
[2020-06-03 06:43:40] [INFO ] Deduced a trap composed of 11 places in 550 ms
[2020-06-03 06:43:40] [INFO ] Deduced a trap composed of 53 places in 528 ms
[2020-06-03 06:43:41] [INFO ] Deduced a trap composed of 53 places in 556 ms
[2020-06-03 06:43:41] [INFO ] Deduced a trap composed of 53 places in 587 ms
[2020-06-03 06:43:42] [INFO ] Deduced a trap composed of 53 places in 569 ms
[2020-06-03 06:43:43] [INFO ] Deduced a trap composed of 32 places in 565 ms
[2020-06-03 06:43:43] [INFO ] Deduced a trap composed of 32 places in 572 ms
[2020-06-03 06:43:44] [INFO ] Deduced a trap composed of 32 places in 560 ms
[2020-06-03 06:43:45] [INFO ] Deduced a trap composed of 32 places in 563 ms
[2020-06-03 06:43:45] [INFO ] Deduced a trap composed of 55 places in 563 ms
[2020-06-03 06:43:46] [INFO ] Deduced a trap composed of 55 places in 535 ms
[2020-06-03 06:43:47] [INFO ] Deduced a trap composed of 55 places in 569 ms
[2020-06-03 06:43:47] [INFO ] Deduced a trap composed of 55 places in 590 ms
[2020-06-03 06:43:48] [INFO ] Deduced a trap composed of 55 places in 574 ms
[2020-06-03 06:43:49] [INFO ] Deduced a trap composed of 47 places in 534 ms
[2020-06-03 06:43:49] [INFO ] Deduced a trap composed of 47 places in 507 ms
[2020-06-03 06:43:50] [INFO ] Deduced a trap composed of 47 places in 509 ms
[2020-06-03 06:43:50] [INFO ] Deduced a trap composed of 47 places in 503 ms
[2020-06-03 06:43:51] [INFO ] Deduced a trap composed of 47 places in 517 ms
[2020-06-03 06:43:51] [INFO ] Deduced a trap composed of 39 places in 442 ms
[2020-06-03 06:43:52] [INFO ] Deduced a trap composed of 55 places in 468 ms
[2020-06-03 06:43:52] [INFO ] Deduced a trap composed of 41 places in 492 ms
[2020-06-03 06:43:53] [INFO ] Deduced a trap composed of 27 places in 433 ms
[2020-06-03 06:43:54] [INFO ] Deduced a trap composed of 55 places in 474 ms
[2020-06-03 06:43:54] [INFO ] Deduced a trap composed of 41 places in 447 ms
[2020-06-03 06:43:54] [INFO ] Deduced a trap composed of 65 places in 433 ms
[2020-06-03 06:43:55] [INFO ] Deduced a trap composed of 31 places in 481 ms
[2020-06-03 06:43:56] [INFO ] Deduced a trap composed of 40 places in 444 ms
[2020-06-03 06:43:56] [INFO ] Deduced a trap composed of 29 places in 489 ms
[2020-06-03 06:43:57] [INFO ] Deduced a trap composed of 65 places in 507 ms
[2020-06-03 06:43:57] [INFO ] Deduced a trap composed of 41 places in 489 ms
[2020-06-03 06:43:58] [INFO ] Deduced a trap composed of 101 places in 421 ms
[2020-06-03 06:43:58] [INFO ] Deduced a trap composed of 27 places in 430 ms
[2020-06-03 06:43:59] [INFO ] Deduced a trap composed of 27 places in 468 ms
[2020-06-03 06:43:59] [INFO ] Deduced a trap composed of 27 places in 432 ms
[2020-06-03 06:43:59] [INFO ] Deduced a trap composed of 115 places in 298 ms
[2020-06-03 06:44:00] [INFO ] Deduced a trap composed of 115 places in 263 ms
[2020-06-03 06:44:00] [INFO ] Deduced a trap composed of 115 places in 266 ms
[2020-06-03 06:44:00] [INFO ] Deduced a trap composed of 115 places in 284 ms
[2020-06-03 06:44:01] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 23836 ms
[2020-06-03 06:44:01] [INFO ] Computed and/alt/rep : 1205/4691/1085 causal constraints in 81 ms.
[2020-06-03 06:44:18] [INFO ] Added : 1013 causal constraints over 203 iterations in 17945 ms. Result :sat
[2020-06-03 06:44:19] [INFO ] Deduced a trap composed of 37 places in 566 ms
[2020-06-03 06:44:20] [INFO ] Deduced a trap composed of 17 places in 528 ms
[2020-06-03 06:44:20] [INFO ] Deduced a trap composed of 43 places in 521 ms
[2020-06-03 06:44:20] [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 s175 s177 s180 s186 s205 s212 s214 s215 s235 s238 s244 s250 s381 s391 s396 s401 s413 s424 s436 s519 s522 s525 s530 s531 s577 s585 s586 s609 s615 s758 s760 s761 s764 s765 s767 s775 s786 s789 s795 s802) 0)") while checking expression at index 5
FORMULA Peterson-PT-5-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 266500 steps, including 1000 resets, run finished after 3294 ms. (steps per millisecond=80 ) properties seen :[0, 0, 0, 1, 1] could not realise parikh vector
FORMULA Peterson-PT-5-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 288300 steps, including 1000 resets, run finished after 3427 ms. (steps per millisecond=84 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 481 out of 803 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 803/803 places, 1211/1211 transitions.
Applied a total of 0 rules in 35 ms. Remains 803 /803 variables (removed 0) and now considering 1211/1211 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 803/803 places, 1211/1211 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 11626 ms. (steps per millisecond=86 ) properties seen :[0, 0, 0]
Interrupted Best-First random walk after 434504 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=86 ) properties seen :[0, 0, 0]
Interrupted Best-First random walk after 134729 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=26 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1863 ms. (steps per millisecond=536 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 5134724 steps, run timeout after 30001 ms. (steps per millisecond=171 ) properties seen :[0, 0, 0]
Probabilistic random walk after 5134724 steps, saw 733533 distinct states, run finished after 30001 ms. (steps per millisecond=171 ) properties seen :[0, 0, 0]
[2020-06-03 06:45:21] [INFO ] Flow matrix only has 1091 transitions (discarded 120 similar events)
// Phase 1: matrix 1091 rows 803 cols
[2020-06-03 06:45:21] [INFO ] Computed 23 place invariants in 16 ms
[2020-06-03 06:45:21] [INFO ] [Real]Absence check using 17 positive place invariants in 36 ms returned sat
[2020-06-03 06:45:21] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-06-03 06:45:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:45:23] [INFO ] [Real]Absence check using state equation in 1733 ms returned sat
[2020-06-03 06:45:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:45:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 46 ms returned sat
[2020-06-03 06:45:23] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-06-03 06:45:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:45:25] [INFO ] [Nat]Absence check using state equation in 1830 ms returned sat
[2020-06-03 06:45:25] [INFO ] State equation strengthened by 230 read => feed constraints.
[2020-06-03 06:45:25] [INFO ] [Nat]Added 230 Read/Feed constraints in 98 ms returned sat
[2020-06-03 06:45:25] [INFO ] Deduced a trap composed of 38 places in 222 ms
[2020-06-03 06:45:25] [INFO ] Deduced a trap composed of 55 places in 435 ms
[2020-06-03 06:45:26] [INFO ] Deduced a trap composed of 45 places in 467 ms
[2020-06-03 06:45:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1363 ms
[2020-06-03 06:45:26] [INFO ] Computed and/alt/rep : 1205/4691/1085 causal constraints in 71 ms.
[2020-06-03 06:45:46] [INFO ] Added : 900 causal constraints over 180 iterations in 20251 ms.(timeout) Result :sat
[2020-06-03 06:45:47] [INFO ] Deduced a trap composed of 42 places in 457 ms
[2020-06-03 06:45:47] [INFO ] Deduced a trap composed of 50 places in 432 ms
[2020-06-03 06:45:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1227 ms
Attempting to minimize the solution found.
Minimization took 86 ms.
[2020-06-03 06:45:48] [INFO ] [Real]Absence check using 17 positive place invariants in 55 ms returned sat
[2020-06-03 06:45:48] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 14 ms returned sat
[2020-06-03 06:45:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:45:51] [INFO ] [Real]Absence check using state equation in 2837 ms returned sat
[2020-06-03 06:45:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:45:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 86 ms returned sat
[2020-06-03 06:45:51] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 10 ms returned sat
[2020-06-03 06:45:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:45:53] [INFO ] [Nat]Absence check using state equation in 2427 ms returned sat
[2020-06-03 06:45:53] [INFO ] [Nat]Added 230 Read/Feed constraints in 105 ms returned sat
[2020-06-03 06:45:54] [INFO ] Deduced a trap composed of 31 places in 552 ms
[2020-06-03 06:45:55] [INFO ] Deduced a trap composed of 11 places in 579 ms
[2020-06-03 06:45:55] [INFO ] Deduced a trap composed of 29 places in 562 ms
[2020-06-03 06:45:56] [INFO ] Deduced a trap composed of 69 places in 483 ms
[2020-06-03 06:45:56] [INFO ] Deduced a trap composed of 75 places in 452 ms
[2020-06-03 06:45:57] [INFO ] Deduced a trap composed of 55 places in 458 ms
[2020-06-03 06:45:57] [INFO ] Deduced a trap composed of 31 places in 448 ms
[2020-06-03 06:45:58] [INFO ] Deduced a trap composed of 55 places in 490 ms
[2020-06-03 06:45:58] [INFO ] Deduced a trap composed of 55 places in 491 ms
[2020-06-03 06:45:59] [INFO ] Deduced a trap composed of 31 places in 492 ms
[2020-06-03 06:46:00] [INFO ] Deduced a trap composed of 11 places in 495 ms
[2020-06-03 06:46:00] [INFO ] Deduced a trap composed of 75 places in 439 ms
[2020-06-03 06:46:01] [INFO ] Deduced a trap composed of 65 places in 453 ms
[2020-06-03 06:46:01] [INFO ] Deduced a trap composed of 91 places in 430 ms
[2020-06-03 06:46:02] [INFO ] Deduced a trap composed of 91 places in 448 ms
[2020-06-03 06:46:02] [INFO ] Deduced a trap composed of 65 places in 442 ms
[2020-06-03 06:46:03] [INFO ] Deduced a trap composed of 81 places in 428 ms
[2020-06-03 06:46:03] [INFO ] Deduced a trap composed of 11 places in 487 ms
[2020-06-03 06:46:04] [INFO ] Deduced a trap composed of 13 places in 518 ms
[2020-06-03 06:46:04] [INFO ] Deduced a trap composed of 11 places in 463 ms
[2020-06-03 06:46:05] [INFO ] Deduced a trap composed of 11 places in 486 ms
[2020-06-03 06:46:06] [INFO ] Deduced a trap composed of 211 places in 447 ms
[2020-06-03 06:46:06] [INFO ] Deduced a trap composed of 81 places in 394 ms
[2020-06-03 06:46:07] [INFO ] Deduced a trap composed of 81 places in 430 ms
[2020-06-03 06:46:07] [INFO ] Deduced a trap composed of 55 places in 392 ms
[2020-06-03 06:46:08] [INFO ] Deduced a trap composed of 50 places in 394 ms
[2020-06-03 06:46:08] [INFO ] Deduced a trap composed of 44 places in 396 ms
[2020-06-03 06:46:09] [INFO ] Deduced a trap composed of 67 places in 422 ms
[2020-06-03 06:46:09] [INFO ] Deduced a trap composed of 61 places in 418 ms
[2020-06-03 06:46:10] [INFO ] Deduced a trap composed of 81 places in 404 ms
[2020-06-03 06:46:10] [INFO ] Deduced a trap composed of 61 places in 518 ms
[2020-06-03 06:46:11] [INFO ] Deduced a trap composed of 44 places in 445 ms
[2020-06-03 06:46:12] [INFO ] Deduced a trap composed of 19 places in 549 ms
[2020-06-03 06:46:12] [INFO ] Deduced a trap composed of 40 places in 456 ms
[2020-06-03 06:46:13] [INFO ] Deduced a trap composed of 15 places in 578 ms
[2020-06-03 06:46:13] [INFO ] Deduced a trap composed of 15 places in 570 ms
[2020-06-03 06:46:14] [INFO ] Deduced a trap composed of 29 places in 531 ms
[2020-06-03 06:46:15] [INFO ] Deduced a trap composed of 52 places in 545 ms
[2020-06-03 06:46:15] [INFO ] Deduced a trap composed of 15 places in 493 ms
[2020-06-03 06:46:16] [INFO ] Deduced a trap composed of 40 places in 477 ms
[2020-06-03 06:46:16] [INFO ] Deduced a trap composed of 36 places in 420 ms
[2020-06-03 06:46:17] [INFO ] Deduced a trap composed of 55 places in 453 ms
[2020-06-03 06:46:17] [INFO ] Deduced a trap composed of 40 places in 421 ms
[2020-06-03 06:46:18] [INFO ] Deduced a trap composed of 23 places in 522 ms
[2020-06-03 06:46:18] [INFO ] Deduced a trap composed of 73 places in 462 ms
[2020-06-03 06:46:19] [INFO ] Deduced a trap composed of 57 places in 355 ms
[2020-06-03 06:46:19] [INFO ] Deduced a trap composed of 25 places in 519 ms
[2020-06-03 06:46:20] [INFO ] Deduced a trap composed of 130 places in 518 ms
[2020-06-03 06:46:20] [INFO ] Deduced a trap composed of 58 places in 506 ms
[2020-06-03 06:46:21] [INFO ] Deduced a trap composed of 17 places in 500 ms
[2020-06-03 06:46:22] [INFO ] Deduced a trap composed of 36 places in 446 ms
[2020-06-03 06:46:22] [INFO ] Deduced a trap composed of 123 places in 380 ms
[2020-06-03 06:46:22] [INFO ] Deduced a trap composed of 123 places in 389 ms
[2020-06-03 06:46:23] [INFO ] Deduced a trap composed of 121 places in 379 ms
[2020-06-03 06:46:23] [INFO ] Deduced a trap composed of 121 places in 333 ms
[2020-06-03 06:46:23] [INFO ] Trap strengthening (SAT) tested/added 56/55 trap constraints in 30013 ms
[2020-06-03 06:46:23] [INFO ] Computed and/alt/rep : 1205/4691/1085 causal constraints in 60 ms.
[2020-06-03 06:46:36] [INFO ] Added : 590 causal constraints over 118 iterations in 12282 ms. Result :unknown
[2020-06-03 06:46:36] [INFO ] [Real]Absence check using 17 positive place invariants in 27 ms returned sat
[2020-06-03 06:46:36] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2020-06-03 06:46:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:46:37] [INFO ] [Real]Absence check using state equation in 1597 ms returned sat
[2020-06-03 06:46:37] [INFO ] [Real]Added 230 Read/Feed constraints in 49 ms returned sat
[2020-06-03 06:46:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:46:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 37 ms returned sat
[2020-06-03 06:46:38] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2020-06-03 06:46:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:46:39] [INFO ] [Nat]Absence check using state equation in 1491 ms returned sat
[2020-06-03 06:46:39] [INFO ] [Nat]Added 230 Read/Feed constraints in 59 ms returned sat
[2020-06-03 06:46:40] [INFO ] Deduced a trap composed of 11 places in 498 ms
[2020-06-03 06:46:40] [INFO ] Deduced a trap composed of 11 places in 490 ms
[2020-06-03 06:46:41] [INFO ] Deduced a trap composed of 11 places in 481 ms
[2020-06-03 06:46:41] [INFO ] Deduced a trap composed of 55 places in 473 ms
[2020-06-03 06:46:42] [INFO ] Deduced a trap composed of 55 places in 468 ms
[2020-06-03 06:46:42] [INFO ] Deduced a trap composed of 36 places in 468 ms
[2020-06-03 06:46:43] [INFO ] Deduced a trap composed of 43 places in 466 ms
[2020-06-03 06:46:43] [INFO ] Deduced a trap composed of 29 places in 471 ms
[2020-06-03 06:46:44] [INFO ] Deduced a trap composed of 55 places in 514 ms
[2020-06-03 06:46:44] [INFO ] Deduced a trap composed of 15 places in 463 ms
[2020-06-03 06:46:45] [INFO ] Deduced a trap composed of 13 places in 453 ms
[2020-06-03 06:46:46] [INFO ] Deduced a trap composed of 48 places in 489 ms
[2020-06-03 06:46:46] [INFO ] Deduced a trap composed of 40 places in 442 ms
[2020-06-03 06:46:46] [INFO ] Deduced a trap composed of 31 places in 447 ms
[2020-06-03 06:46:47] [INFO ] Deduced a trap composed of 17 places in 514 ms
[2020-06-03 06:46:48] [INFO ] Deduced a trap composed of 113 places in 494 ms
[2020-06-03 06:46:48] [INFO ] Deduced a trap composed of 65 places in 472 ms
[2020-06-03 06:46:49] [INFO ] Deduced a trap composed of 49 places in 455 ms
[2020-06-03 06:46:49] [INFO ] Deduced a trap composed of 69 places in 452 ms
[2020-06-03 06:46:50] [INFO ] Deduced a trap composed of 55 places in 406 ms
[2020-06-03 06:46:50] [INFO ] Deduced a trap composed of 55 places in 435 ms
[2020-06-03 06:46:51] [INFO ] Deduced a trap composed of 55 places in 411 ms
[2020-06-03 06:46:51] [INFO ] Deduced a trap composed of 41 places in 484 ms
[2020-06-03 06:46:52] [INFO ] Deduced a trap composed of 41 places in 466 ms
[2020-06-03 06:46:52] [INFO ] Deduced a trap composed of 55 places in 485 ms
[2020-06-03 06:46:53] [INFO ] Deduced a trap composed of 55 places in 445 ms
[2020-06-03 06:46:53] [INFO ] Deduced a trap composed of 87 places in 435 ms
[2020-06-03 06:46:54] [INFO ] Deduced a trap composed of 52 places in 511 ms
[2020-06-03 06:46:54] [INFO ] Deduced a trap composed of 75 places in 452 ms
[2020-06-03 06:46:55] [INFO ] Deduced a trap composed of 55 places in 480 ms
[2020-06-03 06:46:55] [INFO ] Deduced a trap composed of 27 places in 470 ms
[2020-06-03 06:46:56] [INFO ] Deduced a trap composed of 27 places in 482 ms
[2020-06-03 06:46:56] [INFO ] Deduced a trap composed of 39 places in 451 ms
[2020-06-03 06:46:57] [INFO ] Deduced a trap composed of 50 places in 496 ms
[2020-06-03 06:46:57] [INFO ] Deduced a trap composed of 77 places in 421 ms
[2020-06-03 06:46:58] [INFO ] Deduced a trap composed of 117 places in 363 ms
[2020-06-03 06:46:58] [INFO ] Deduced a trap composed of 55 places in 199 ms
[2020-06-03 06:46:58] [INFO ] Deduced a trap composed of 61 places in 412 ms
[2020-06-03 06:46:59] [INFO ] Deduced a trap composed of 57 places in 302 ms
[2020-06-03 06:46:59] [INFO ] Deduced a trap composed of 78 places in 448 ms
[2020-06-03 06:47:00] [INFO ] Deduced a trap composed of 69 places in 236 ms
[2020-06-03 06:47:00] [INFO ] Deduced a trap composed of 69 places in 215 ms
[2020-06-03 06:47:00] [INFO ] Deduced a trap composed of 69 places in 216 ms
[2020-06-03 06:47:00] [INFO ] Deduced a trap composed of 69 places in 244 ms
[2020-06-03 06:47:01] [INFO ] Deduced a trap composed of 113 places in 246 ms
[2020-06-03 06:47:01] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 21516 ms
[2020-06-03 06:47:01] [INFO ] Computed and/alt/rep : 1205/4691/1085 causal constraints in 77 ms.
[2020-06-03 06:47:22] [INFO ] Added : 965 causal constraints over 193 iterations in 21318 ms.(timeout) Result :sat
[2020-06-03 06:47:22] [INFO ] Deduced a trap composed of 61 places in 299 ms
[2020-06-03 06:47:23] [INFO ] Deduced a trap composed of 63 places in 296 ms
[2020-06-03 06:47:23] [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 (> (+ s1 s7 s12 s29 s39 s63 s65 s88 s95 s120 s136 s143 s168 s175 s177 s205 s215 s235 s238 s241 s247 s254 s264 s286 s292 s320 s341 s356 s373 s381 s391 s396 s413 s463 s468 s480 s483 s504 s505 s519 s525 s530 s563 s570 s586 s609 s615 s632 s637 s655 s664 s692 s694 s714 s723 s761 s765 s767 s775 s786 s789 s795 s802) 0)") while checking expression at index 2
Incomplete Parikh walk after 489200 steps, including 1000 resets, run finished after 1147 ms. (steps per millisecond=426 ) properties seen :[1, 1, 0] could not realise parikh vector
FORMULA Peterson-PT-5-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 346500 steps, including 1000 resets, run finished after 634 ms. (steps per millisecond=546 ) properties seen :[0] could not realise parikh vector
Support contains 1 out of 803 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 803/803 places, 1211/1211 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 803 transition count 878
Reduce places removed 333 places and 0 transitions.
Iterating post reduction 1 with 333 rules applied. Total rules applied 666 place count 470 transition count 878
Performed 174 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 174 Pre rules applied. Total rules applied 666 place count 470 transition count 704
Deduced a syphon composed of 174 places in 1 ms
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 2 with 348 rules applied. Total rules applied 1014 place count 296 transition count 704
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 1074 place count 266 transition count 674
Applied a total of 1074 rules in 67 ms. Remains 266 /803 variables (removed 537) and now considering 674/1211 (removed 537) transitions.
Finished structural reductions, in 1 iterations. Remains : 266/803 places, 674/1211 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1376 ms. (steps per millisecond=726 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 446 ms. (steps per millisecond=2242 ) properties seen :[0]
Interrupted probabilistic random walk after 15720600 steps, run timeout after 30001 ms. (steps per millisecond=524 ) properties seen :[0]
Probabilistic random walk after 15720600 steps, saw 2245801 distinct states, run finished after 30001 ms. (steps per millisecond=524 ) properties seen :[0]
[2020-06-03 06:47:56] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 266 cols
[2020-06-03 06:47:56] [INFO ] Computed 23 place invariants in 4 ms
[2020-06-03 06:47:57] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2020-06-03 06:47:57] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2020-06-03 06:47:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:47:57] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2020-06-03 06:47:57] [INFO ] State equation strengthened by 230 read => feed constraints.
[2020-06-03 06:47:57] [INFO ] [Real]Added 230 Read/Feed constraints in 29 ms returned sat
[2020-06-03 06:47:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:47:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2020-06-03 06:47:57] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2020-06-03 06:47:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:47:57] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2020-06-03 06:47:57] [INFO ] [Nat]Added 230 Read/Feed constraints in 32 ms returned sat
[2020-06-03 06:47:57] [INFO ] Deduced a trap composed of 11 places in 120 ms
[2020-06-03 06:47:58] [INFO ] Deduced a trap composed of 34 places in 133 ms
[2020-06-03 06:47:58] [INFO ] Deduced a trap composed of 23 places in 159 ms
[2020-06-03 06:47:58] [INFO ] Deduced a trap composed of 12 places in 160 ms
[2020-06-03 06:47:58] [INFO ] Deduced a trap composed of 12 places in 135 ms
[2020-06-03 06:47:58] [INFO ] Deduced a trap composed of 12 places in 172 ms
[2020-06-03 06:47:58] [INFO ] Deduced a trap composed of 12 places in 143 ms
[2020-06-03 06:47:59] [INFO ] Deduced a trap composed of 30 places in 163 ms
[2020-06-03 06:47:59] [INFO ] Deduced a trap composed of 16 places in 141 ms
[2020-06-03 06:47:59] [INFO ] Deduced a trap composed of 9 places in 171 ms
[2020-06-03 06:47:59] [INFO ] Deduced a trap composed of 38 places in 121 ms
[2020-06-03 06:47:59] [INFO ] Deduced a trap composed of 18 places in 84 ms
[2020-06-03 06:47:59] [INFO ] Deduced a trap composed of 25 places in 85 ms
[2020-06-03 06:47:59] [INFO ] Deduced a trap composed of 16 places in 92 ms
[2020-06-03 06:47:59] [INFO ] Deduced a trap composed of 18 places in 82 ms
[2020-06-03 06:48:00] [INFO ] Deduced a trap composed of 25 places in 84 ms
[2020-06-03 06:48:00] [INFO ] Deduced a trap composed of 30 places in 78 ms
[2020-06-03 06:48:00] [INFO ] Deduced a trap composed of 25 places in 79 ms
[2020-06-03 06:48:00] [INFO ] Deduced a trap composed of 23 places in 78 ms
[2020-06-03 06:48:00] [INFO ] Deduced a trap composed of 31 places in 82 ms
[2020-06-03 06:48:00] [INFO ] Deduced a trap composed of 16 places in 84 ms
[2020-06-03 06:48:00] [INFO ] Deduced a trap composed of 29 places in 80 ms
[2020-06-03 06:48:00] [INFO ] Deduced a trap composed of 16 places in 86 ms
[2020-06-03 06:48:00] [INFO ] Deduced a trap composed of 23 places in 92 ms
[2020-06-03 06:48:00] [INFO ] Deduced a trap composed of 23 places in 84 ms
[2020-06-03 06:48:01] [INFO ] Deduced a trap composed of 40 places in 106 ms
[2020-06-03 06:48:01] [INFO ] Deduced a trap composed of 32 places in 93 ms
[2020-06-03 06:48:01] [INFO ] Deduced a trap composed of 33 places in 95 ms
[2020-06-03 06:48:01] [INFO ] Deduced a trap composed of 40 places in 74 ms
[2020-06-03 06:48:01] [INFO ] Deduced a trap composed of 40 places in 106 ms
[2020-06-03 06:48:01] [INFO ] Deduced a trap composed of 33 places in 82 ms
[2020-06-03 06:48:01] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 3930 ms
[2020-06-03 06:48:01] [INFO ] Computed and/alt/rep : 668/4274/548 causal constraints in 25 ms.
[2020-06-03 06:48:06] [INFO ] Added : 431 causal constraints over 87 iterations in 4448 ms. Result :sat
[2020-06-03 06:48:06] [INFO ] Deduced a trap composed of 48 places in 129 ms
[2020-06-03 06:48:06] [INFO ] Deduced a trap composed of 9 places in 129 ms
[2020-06-03 06:48:06] [INFO ] Deduced a trap composed of 16 places in 117 ms
[2020-06-03 06:48:06] [INFO ] Deduced a trap composed of 23 places in 87 ms
[2020-06-03 06:48:06] [INFO ] Deduced a trap composed of 34 places in 77 ms
[2020-06-03 06:48:07] [INFO ] Deduced a trap composed of 18 places in 140 ms
[2020-06-03 06:48:07] [INFO ] Deduced a trap composed of 19 places in 127 ms
[2020-06-03 06:48:07] [INFO ] Deduced a trap composed of 12 places in 157 ms
[2020-06-03 06:48:07] [INFO ] Deduced a trap composed of 12 places in 109 ms
[2020-06-03 06:48:07] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1650 ms
Attempting to minimize the solution found.
Minimization took 50 ms.
Incomplete Parikh walk after 81500 steps, including 1000 resets, run finished after 135 ms. (steps per millisecond=603 ) properties seen :[0] could not realise parikh vector
Support contains 1 out of 266 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 266/266 places, 674/674 transitions.
Applied a total of 0 rules in 13 ms. Remains 266 /266 variables (removed 0) and now considering 674/674 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 266/266 places, 674/674 transitions.
Starting structural reductions, iteration 0 : 266/266 places, 674/674 transitions.
Applied a total of 0 rules in 10 ms. Remains 266 /266 variables (removed 0) and now considering 674/674 (removed 0) transitions.
[2020-06-03 06:48:08] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 266 cols
[2020-06-03 06:48:08] [INFO ] Computed 23 place invariants in 2 ms
[2020-06-03 06:48:08] [INFO ] Implicit Places using invariants in 346 ms returned [230, 242, 243, 244, 245, 246]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 348 ms to find 6 implicit places.
[2020-06-03 06:48:08] [INFO ] Redundant transitions in 44 ms returned []
[2020-06-03 06:48:08] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2020-06-03 06:48:08] [INFO ] Computed 17 place invariants in 4 ms
[2020-06-03 06:48:09] [INFO ] Dead Transitions using invariants and state equation in 615 ms returned []
Starting structural reductions, iteration 1 : 260/266 places, 674/674 transitions.
Applied a total of 0 rules in 11 ms. Remains 260 /260 variables (removed 0) and now considering 674/674 (removed 0) transitions.
[2020-06-03 06:48:09] [INFO ] Redundant transitions in 6 ms returned []
[2020-06-03 06:48:09] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2020-06-03 06:48:09] [INFO ] Computed 17 place invariants in 2 ms
[2020-06-03 06:48:09] [INFO ] Dead Transitions using invariants and state equation in 731 ms returned []
Finished structural reductions, in 2 iterations. Remains : 260/266 places, 674/674 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1382 ms. (steps per millisecond=723 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 445 ms. (steps per millisecond=2247 ) properties seen :[0]
Interrupted probabilistic random walk after 16670101 steps, run timeout after 30001 ms. (steps per millisecond=555 ) properties seen :[0]
Probabilistic random walk after 16670101 steps, saw 2381444 distinct states, run finished after 30001 ms. (steps per millisecond=555 ) properties seen :[0]
[2020-06-03 06:48:41] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2020-06-03 06:48:41] [INFO ] Computed 17 place invariants in 2 ms
[2020-06-03 06:48:41] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2020-06-03 06:48:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:48:41] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2020-06-03 06:48:41] [INFO ] State equation strengthened by 230 read => feed constraints.
[2020-06-03 06:48:42] [INFO ] [Real]Added 230 Read/Feed constraints in 37 ms returned sat
[2020-06-03 06:48:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:48:42] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2020-06-03 06:48:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:48:42] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2020-06-03 06:48:42] [INFO ] [Nat]Added 230 Read/Feed constraints in 25 ms returned sat
[2020-06-03 06:48:42] [INFO ] Deduced a trap composed of 20 places in 95 ms
[2020-06-03 06:48:42] [INFO ] Deduced a trap composed of 12 places in 92 ms
[2020-06-03 06:48:42] [INFO ] Deduced a trap composed of 20 places in 102 ms
[2020-06-03 06:48:42] [INFO ] Deduced a trap composed of 17 places in 96 ms
[2020-06-03 06:48:42] [INFO ] Deduced a trap composed of 9 places in 100 ms
[2020-06-03 06:48:43] [INFO ] Deduced a trap composed of 9 places in 129 ms
[2020-06-03 06:48:43] [INFO ] Deduced a trap composed of 9 places in 140 ms
[2020-06-03 06:48:43] [INFO ] Deduced a trap composed of 10 places in 145 ms
[2020-06-03 06:48:43] [INFO ] Deduced a trap composed of 9 places in 135 ms
[2020-06-03 06:48:43] [INFO ] Deduced a trap composed of 38 places in 120 ms
[2020-06-03 06:48:43] [INFO ] Deduced a trap composed of 32 places in 102 ms
[2020-06-03 06:48:43] [INFO ] Deduced a trap composed of 24 places in 106 ms
[2020-06-03 06:48:44] [INFO ] Deduced a trap composed of 24 places in 119 ms
[2020-06-03 06:48:44] [INFO ] Deduced a trap composed of 39 places in 113 ms
[2020-06-03 06:48:44] [INFO ] Deduced a trap composed of 37 places in 95 ms
[2020-06-03 06:48:44] [INFO ] Deduced a trap composed of 31 places in 102 ms
[2020-06-03 06:48:44] [INFO ] Deduced a trap composed of 31 places in 123 ms
[2020-06-03 06:48:44] [INFO ] Deduced a trap composed of 28 places in 98 ms
[2020-06-03 06:48:44] [INFO ] Deduced a trap composed of 16 places in 101 ms
[2020-06-03 06:48:45] [INFO ] Deduced a trap composed of 17 places in 87 ms
[2020-06-03 06:48:45] [INFO ] Deduced a trap composed of 36 places in 85 ms
[2020-06-03 06:48:45] [INFO ] Deduced a trap composed of 18 places in 99 ms
[2020-06-03 06:48:45] [INFO ] Deduced a trap composed of 31 places in 120 ms
[2020-06-03 06:48:45] [INFO ] Deduced a trap composed of 48 places in 71 ms
[2020-06-03 06:48:45] [INFO ] Deduced a trap composed of 34 places in 81 ms
[2020-06-03 06:48:45] [INFO ] Deduced a trap composed of 23 places in 84 ms
[2020-06-03 06:48:45] [INFO ] Deduced a trap composed of 25 places in 79 ms
[2020-06-03 06:48:45] [INFO ] Deduced a trap composed of 32 places in 76 ms
[2020-06-03 06:48:46] [INFO ] Deduced a trap composed of 24 places in 92 ms
[2020-06-03 06:48:46] [INFO ] Deduced a trap composed of 38 places in 65 ms
[2020-06-03 06:48:46] [INFO ] Deduced a trap composed of 38 places in 78 ms
[2020-06-03 06:48:46] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 3875 ms
[2020-06-03 06:48:46] [INFO ] Computed and/alt/rep : 668/4274/548 causal constraints in 37 ms.
[2020-06-03 06:48:50] [INFO ] Added : 428 causal constraints over 86 iterations in 4261 ms. Result :sat
[2020-06-03 06:48:50] [INFO ] Deduced a trap composed of 33 places in 147 ms
[2020-06-03 06:48:50] [INFO ] Deduced a trap composed of 47 places in 143 ms
[2020-06-03 06:48:51] [INFO ] Deduced a trap composed of 17 places in 161 ms
[2020-06-03 06:48:51] [INFO ] Deduced a trap composed of 25 places in 151 ms
[2020-06-03 06:48:51] [INFO ] Deduced a trap composed of 33 places in 144 ms
[2020-06-03 06:48:51] [INFO ] Deduced a trap composed of 35 places in 136 ms
[2020-06-03 06:48:51] [INFO ] Deduced a trap composed of 23 places in 148 ms
[2020-06-03 06:48:52] [INFO ] Deduced a trap composed of 23 places in 159 ms
[2020-06-03 06:48:52] [INFO ] Deduced a trap composed of 16 places in 152 ms
[2020-06-03 06:48:52] [INFO ] Deduced a trap composed of 44 places in 120 ms
[2020-06-03 06:48:52] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2208 ms
Attempting to minimize the solution found.
Minimization took 51 ms.
Incomplete Parikh walk after 81800 steps, including 1000 resets, run finished after 165 ms. (steps per millisecond=495 ) properties seen :[0] could not realise parikh vector
Support contains 1 out of 260 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 260/260 places, 674/674 transitions.
Applied a total of 0 rules in 11 ms. Remains 260 /260 variables (removed 0) and now considering 674/674 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 260/260 places, 674/674 transitions.
Starting structural reductions, iteration 0 : 260/260 places, 674/674 transitions.
Applied a total of 0 rules in 9 ms. Remains 260 /260 variables (removed 0) and now considering 674/674 (removed 0) transitions.
[2020-06-03 06:48:52] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2020-06-03 06:48:52] [INFO ] Computed 17 place invariants in 1 ms
[2020-06-03 06:48:53] [INFO ] Implicit Places using invariants in 319 ms returned []
[2020-06-03 06:48:53] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2020-06-03 06:48:53] [INFO ] Computed 17 place invariants in 2 ms
[2020-06-03 06:48:53] [INFO ] State equation strengthened by 230 read => feed constraints.
[2020-06-03 06:48:55] [INFO ] Implicit Places using invariants and state equation in 1993 ms returned []
Implicit Place search using SMT with State Equation took 2312 ms to find 0 implicit places.
[2020-06-03 06:48:55] [INFO ] Redundant transitions in 12 ms returned []
[2020-06-03 06:48:55] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2020-06-03 06:48:55] [INFO ] Computed 17 place invariants in 2 ms
[2020-06-03 06:48:55] [INFO ] Dead Transitions using invariants and state equation in 680 ms returned []
Finished structural reductions, in 1 iterations. Remains : 260/260 places, 674/674 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 157 ms. (steps per millisecond=636 ) properties seen :[0]
[2020-06-03 06:48:56] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2020-06-03 06:48:56] [INFO ] Computed 17 place invariants in 2 ms
[2020-06-03 06:48:56] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2020-06-03 06:48:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:48:56] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2020-06-03 06:48:56] [INFO ] State equation strengthened by 230 read => feed constraints.
[2020-06-03 06:48:56] [INFO ] [Real]Added 230 Read/Feed constraints in 23 ms returned sat
[2020-06-03 06:48:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:48:56] [INFO ] [Nat]Absence check using 17 positive place invariants in 20 ms returned sat
[2020-06-03 06:48:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:48:56] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2020-06-03 06:48:56] [INFO ] [Nat]Added 230 Read/Feed constraints in 27 ms returned sat
[2020-06-03 06:48:57] [INFO ] Deduced a trap composed of 20 places in 94 ms
[2020-06-03 06:48:57] [INFO ] Deduced a trap composed of 12 places in 107 ms
[2020-06-03 06:48:57] [INFO ] Deduced a trap composed of 20 places in 96 ms
[2020-06-03 06:48:57] [INFO ] Deduced a trap composed of 17 places in 97 ms
[2020-06-03 06:48:57] [INFO ] Deduced a trap composed of 9 places in 131 ms
[2020-06-03 06:48:57] [INFO ] Deduced a trap composed of 9 places in 133 ms
[2020-06-03 06:48:57] [INFO ] Deduced a trap composed of 9 places in 113 ms
[2020-06-03 06:48:57] [INFO ] Deduced a trap composed of 10 places in 92 ms
[2020-06-03 06:48:57] [INFO ] Deduced a trap composed of 9 places in 86 ms
[2020-06-03 06:48:58] [INFO ] Deduced a trap composed of 38 places in 111 ms
[2020-06-03 06:48:58] [INFO ] Deduced a trap composed of 32 places in 93 ms
[2020-06-03 06:48:58] [INFO ] Deduced a trap composed of 24 places in 99 ms
[2020-06-03 06:48:58] [INFO ] Deduced a trap composed of 24 places in 103 ms
[2020-06-03 06:48:58] [INFO ] Deduced a trap composed of 39 places in 102 ms
[2020-06-03 06:48:58] [INFO ] Deduced a trap composed of 37 places in 127 ms
[2020-06-03 06:48:58] [INFO ] Deduced a trap composed of 31 places in 118 ms
[2020-06-03 06:48:59] [INFO ] Deduced a trap composed of 31 places in 123 ms
[2020-06-03 06:48:59] [INFO ] Deduced a trap composed of 28 places in 95 ms
[2020-06-03 06:48:59] [INFO ] Deduced a trap composed of 16 places in 115 ms
[2020-06-03 06:48:59] [INFO ] Deduced a trap composed of 17 places in 117 ms
[2020-06-03 06:48:59] [INFO ] Deduced a trap composed of 36 places in 85 ms
[2020-06-03 06:48:59] [INFO ] Deduced a trap composed of 18 places in 95 ms
[2020-06-03 06:48:59] [INFO ] Deduced a trap composed of 31 places in 90 ms
[2020-06-03 06:48:59] [INFO ] Deduced a trap composed of 48 places in 83 ms
[2020-06-03 06:48:59] [INFO ] Deduced a trap composed of 34 places in 91 ms
[2020-06-03 06:49:00] [INFO ] Deduced a trap composed of 23 places in 62 ms
[2020-06-03 06:49:00] [INFO ] Deduced a trap composed of 25 places in 74 ms
[2020-06-03 06:49:00] [INFO ] Deduced a trap composed of 32 places in 81 ms
[2020-06-03 06:49:00] [INFO ] Deduced a trap composed of 24 places in 66 ms
[2020-06-03 06:49:00] [INFO ] Deduced a trap composed of 38 places in 64 ms
[2020-06-03 06:49:00] [INFO ] Deduced a trap composed of 38 places in 59 ms
[2020-06-03 06:49:00] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 3627 ms
[2020-06-03 06:49:00] [INFO ] Computed and/alt/rep : 668/4274/548 causal constraints in 28 ms.
[2020-06-03 06:49:04] [INFO ] Added : 428 causal constraints over 86 iterations in 4261 ms. Result :sat
[2020-06-03 06:49:04] [INFO ] Deduced a trap composed of 33 places in 150 ms
[2020-06-03 06:49:05] [INFO ] Deduced a trap composed of 47 places in 146 ms
[2020-06-03 06:49:05] [INFO ] Deduced a trap composed of 17 places in 113 ms
[2020-06-03 06:49:05] [INFO ] Deduced a trap composed of 25 places in 132 ms
[2020-06-03 06:49:05] [INFO ] Deduced a trap composed of 33 places in 148 ms
[2020-06-03 06:49:05] [INFO ] Deduced a trap composed of 35 places in 138 ms
[2020-06-03 06:49:06] [INFO ] Deduced a trap composed of 23 places in 115 ms
[2020-06-03 06:49:06] [INFO ] Deduced a trap composed of 23 places in 132 ms
[2020-06-03 06:49:06] [INFO ] Deduced a trap composed of 16 places in 113 ms
[2020-06-03 06:49:06] [INFO ] Deduced a trap composed of 44 places in 100 ms
[2020-06-03 06:49:06] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1959 ms
Graph (trivial) has 510 edges and 260 vertex of which 179 / 260 are part of one of the 30 SCC in 7 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Iterating post reduction 0 with 447 rules applied. Total rules applied 448 place count 111 transition count 227
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 29 Pre rules applied. Total rules applied 448 place count 111 transition count 198
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 1 with 58 rules applied. Total rules applied 506 place count 82 transition count 198
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 508 place count 81 transition count 197
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 528 place count 68 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 37 edges and 68 vertex of which 36 / 68 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 530 place count 38 transition count 195
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Discarding 24 places :
Also discarding 100 output transitions
Drop transitions removed 100 transitions
Graph (complete) has 164 edges and 33 vertex of which 9 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.7 ms
Graph (trivial) has 46 edges and 9 vertex of which 5 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 43 rules applied. Total rules applied 573 place count 5 transition count 59
Drop transitions removed 40 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 3 with 52 rules applied. Total rules applied 625 place count 5 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 625 place count 5 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 628 place count 3 transition count 6
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 630 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 632 place count 2 transition count 3
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 633 place count 2 transition count 2
Applied a total of 633 rules in 34 ms. Remains 2 /260 variables (removed 258) and now considering 2/674 (removed 672) transitions.
// Phase 1: matrix 2 rows 2 cols
[2020-06-03 06:49:06] [INFO ] Computed 1 place invariants in 0 ms
[2020-06-03 06:49:06] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2020-06-03 06:49:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:49:06] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2020-06-03 06:49:06] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints in 0 ms.
[2020-06-03 06:49:06] [INFO ] Added : 0 causal constraints over 0 iterations in 1 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2020-06-03 06:49:06] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2020-06-03 06:49:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
[2020-06-03 06:49:07] [INFO ] Flatten gal took : 114 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ Peterson-PT-5 @ 3570 seconds
vrfy: finished
info: timeLeft: 3567
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",
"localtimelimit": 0,
"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": "Wed Jun 3 06:49:07 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 19508,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((1 <= p223)))",
"processed_size": 19,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 2680,
"conflict_clusters": 13,
"places": 260,
"places_significant": 243,
"singleton_clusters": 0,
"transitions": 674
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
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: 934/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 260
lola: finding significant places
lola: 260 places, 674 transitions, 243 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: E (F ((1 <= p223)))
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 <= p223)))
lola: processed formula length: 19
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: subprocess will run for 0 seconds at most (--localtimelimit)
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: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p223)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: memory consumption: 19508 KB
lola: time consumption: 3 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="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
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 r174-csrt-158987853600735"
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 ;