Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 3.0K Apr 13 13:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 13 13:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 13 13:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 13 13:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 15:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 15:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 13 13:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 13 13:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 13 13:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 13 13:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 13 13:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 13 13:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 3.2M Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-00
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-01
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-02
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-03
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-04
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-05
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-06
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-07
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-08
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-09
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-10
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-11
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-12
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-13
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-14
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591258137621

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 08:09:01] [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-04 08:09:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 08:09:02] [INFO ] Load time of PNML (sax parser for PT used): 572 ms
[2020-06-04 08:09:02] [INFO ] Transformed 157 places.
[2020-06-04 08:09:02] [INFO ] Transformed 4430 transitions.
[2020-06-04 08:09:02] [INFO ] Found NUPN structural information;
[2020-06-04 08:09:02] [INFO ] Parsed PT model containing 157 places and 4430 transitions in 777 ms.
Deduced a syphon composed of 4 places in 67 ms
Reduce places removed 4 places and 825 transitions.
Ensure Unique test removed 1692 transitions
Reduce redundant transitions removed 1692 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 220 ms.
Working with output stream class java.io.PrintStream
FORMULA EnergyBus-PT-none-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 272 ms. (steps per millisecond=36 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 53 ms. (steps per millisecond=188 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA EnergyBus-PT-none-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 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, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 82 ms. (steps per millisecond=121 ) properties seen :[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA EnergyBus-PT-none-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 55 ms. (steps per millisecond=181 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 63 ms. (steps per millisecond=158 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-06-04 08:09:04] [INFO ] Flow matrix only has 647 transitions (discarded 1266 similar events)
// Phase 1: matrix 647 rows 153 cols
[2020-06-04 08:09:04] [INFO ] Computed 23 place invariants in 21 ms
[2020-06-04 08:09:04] [INFO ] [Real]Absence check using 21 positive place invariants in 165 ms returned sat
[2020-06-04 08:09:04] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 26 ms returned sat
[2020-06-04 08:09:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:09:05] [INFO ] [Real]Absence check using state equation in 619 ms returned sat
[2020-06-04 08:09:05] [INFO ] State equation strengthened by 468 read => feed constraints.
[2020-06-04 08:09:05] [INFO ] [Real]Added 468 Read/Feed constraints in 101 ms returned sat
[2020-06-04 08:09:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:09:05] [INFO ] [Nat]Absence check using 21 positive place invariants in 104 ms returned sat
[2020-06-04 08:09:05] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 7 ms returned sat
[2020-06-04 08:09:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:09:06] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2020-06-04 08:09:06] [INFO ] [Nat]Added 468 Read/Feed constraints in 111 ms returned sat
[2020-06-04 08:09:06] [INFO ] Deduced a trap composed of 9 places in 401 ms
[2020-06-04 08:09:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 604 ms
[2020-06-04 08:09:07] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 466 ms.
[2020-06-04 08:09:10] [INFO ] Added : 120 causal constraints over 24 iterations in 3626 ms. Result :unknown
[2020-06-04 08:09:10] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2020-06-04 08:09:10] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-06-04 08:09:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:09:11] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2020-06-04 08:09:11] [INFO ] [Real]Added 468 Read/Feed constraints in 119 ms returned sat
[2020-06-04 08:09:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:09:11] [INFO ] [Nat]Absence check using 21 positive place invariants in 21 ms returned sat
[2020-06-04 08:09:11] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-06-04 08:09:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:09:11] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2020-06-04 08:09:11] [INFO ] [Nat]Added 468 Read/Feed constraints in 88 ms returned sat
[2020-06-04 08:09:11] [INFO ] Deduced a trap composed of 5 places in 71 ms
[2020-06-04 08:09:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2020-06-04 08:09:11] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 122 ms.
[2020-06-04 08:09:16] [INFO ] Added : 180 causal constraints over 36 iterations in 4440 ms. Result :unknown
[2020-06-04 08:09:16] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2020-06-04 08:09:16] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:09:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:09:16] [INFO ] [Real]Absence check using state equation in 513 ms returned sat
[2020-06-04 08:09:16] [INFO ] [Real]Added 468 Read/Feed constraints in 89 ms returned sat
[2020-06-04 08:09:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:09:17] [INFO ] [Nat]Absence check using 21 positive place invariants in 158 ms returned sat
[2020-06-04 08:09:17] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 14 ms returned sat
[2020-06-04 08:09:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:09:17] [INFO ] [Nat]Absence check using state equation in 484 ms returned sat
[2020-06-04 08:09:17] [INFO ] [Nat]Added 468 Read/Feed constraints in 70 ms returned sat
[2020-06-04 08:09:17] [INFO ] Deduced a trap composed of 5 places in 29 ms
[2020-06-04 08:09:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2020-06-04 08:09:18] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 233 ms.
[2020-06-04 08:09:22] [INFO ] Added : 180 causal constraints over 36 iterations in 4175 ms. Result :unknown
[2020-06-04 08:09:22] [INFO ] [Real]Absence check using 21 positive place invariants in 18 ms returned sat
[2020-06-04 08:09:22] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-06-04 08:09:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:09:22] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2020-06-04 08:09:22] [INFO ] [Real]Added 468 Read/Feed constraints in 76 ms returned sat
[2020-06-04 08:09:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:09:22] [INFO ] [Nat]Absence check using 21 positive place invariants in 149 ms returned sat
[2020-06-04 08:09:22] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 26 ms returned sat
[2020-06-04 08:09:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:09:23] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2020-06-04 08:09:23] [INFO ] [Nat]Added 468 Read/Feed constraints in 112 ms returned sat
[2020-06-04 08:09:23] [INFO ] Deduced a trap composed of 5 places in 281 ms
[2020-06-04 08:09:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 345 ms
[2020-06-04 08:09:23] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 118 ms.
[2020-06-04 08:09:27] [INFO ] Added : 180 causal constraints over 36 iterations in 3897 ms. Result :unknown
[2020-06-04 08:09:27] [INFO ] [Real]Absence check using 21 positive place invariants in 53 ms returned unsat
[2020-06-04 08:09:27] [INFO ] [Real]Absence check using 21 positive place invariants in 157 ms returned sat
[2020-06-04 08:09:27] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 27 ms returned sat
[2020-06-04 08:09:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:09:29] [INFO ] [Real]Absence check using state equation in 1280 ms returned sat
[2020-06-04 08:09:29] [INFO ] [Real]Added 468 Read/Feed constraints in 92 ms returned sat
[2020-06-04 08:09:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:09:29] [INFO ] [Nat]Absence check using 21 positive place invariants in 19 ms returned sat
[2020-06-04 08:09:29] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:09:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:09:29] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2020-06-04 08:09:29] [INFO ] [Nat]Added 468 Read/Feed constraints in 86 ms returned sat
[2020-06-04 08:09:29] [INFO ] Deduced a trap composed of 4 places in 173 ms
[2020-06-04 08:09:29] [INFO ] Deduced a trap composed of 5 places in 27 ms
[2020-06-04 08:09:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 338 ms
[2020-06-04 08:09:30] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 134 ms.
[2020-06-04 08:09:34] [INFO ] Added : 190 causal constraints over 38 iterations in 4248 ms. Result :unknown
[2020-06-04 08:09:34] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2020-06-04 08:09:34] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:09:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:09:34] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2020-06-04 08:09:34] [INFO ] [Real]Added 468 Read/Feed constraints in 58 ms returned sat
[2020-06-04 08:09:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:09:34] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2020-06-04 08:09:34] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:09:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:09:34] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2020-06-04 08:09:34] [INFO ] [Nat]Added 468 Read/Feed constraints in 82 ms returned sat
[2020-06-04 08:09:35] [INFO ] Deduced a trap composed of 5 places in 195 ms
[2020-06-04 08:09:35] [INFO ] Deduced a trap composed of 4 places in 196 ms
[2020-06-04 08:09:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 556 ms
[2020-06-04 08:09:35] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 164 ms.
[2020-06-04 08:09:39] [INFO ] Added : 175 causal constraints over 35 iterations in 4083 ms. Result :unknown
[2020-06-04 08:09:39] [INFO ] [Real]Absence check using 21 positive place invariants in 18 ms returned sat
[2020-06-04 08:09:39] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-06-04 08:09:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:09:39] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2020-06-04 08:09:40] [INFO ] [Real]Added 468 Read/Feed constraints in 80 ms returned sat
[2020-06-04 08:09:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:09:40] [INFO ] [Nat]Absence check using 21 positive place invariants in 19 ms returned sat
[2020-06-04 08:09:40] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:09:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:09:40] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2020-06-04 08:09:40] [INFO ] [Nat]Added 468 Read/Feed constraints in 115 ms returned sat
[2020-06-04 08:09:40] [INFO ] Deduced a trap composed of 32 places in 298 ms
[2020-06-04 08:09:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 329 ms
[2020-06-04 08:09:40] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2020-06-04 08:09:40] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:09:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:09:41] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2020-06-04 08:09:41] [INFO ] [Real]Added 468 Read/Feed constraints in 92 ms returned sat
[2020-06-04 08:09:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:09:41] [INFO ] [Nat]Absence check using 21 positive place invariants in 21 ms returned sat
[2020-06-04 08:09:41] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:09:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:09:41] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2020-06-04 08:09:41] [INFO ] [Nat]Added 468 Read/Feed constraints in 105 ms returned sat
[2020-06-04 08:09:41] [INFO ] Deduced a trap composed of 5 places in 38 ms
[2020-06-04 08:09:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2020-06-04 08:09:42] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 139 ms.
[2020-06-04 08:09:46] [INFO ] Added : 180 causal constraints over 36 iterations in 4417 ms. Result :unknown
[2020-06-04 08:09:46] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned unsat
[2020-06-04 08:09:46] [INFO ] [Real]Absence check using 21 positive place invariants in 16 ms returned sat
[2020-06-04 08:09:46] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:09:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:09:46] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2020-06-04 08:09:46] [INFO ] [Real]Added 468 Read/Feed constraints in 87 ms returned sat
[2020-06-04 08:09:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:09:46] [INFO ] [Nat]Absence check using 21 positive place invariants in 17 ms returned sat
[2020-06-04 08:09:46] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-06-04 08:09:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:09:47] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2020-06-04 08:09:47] [INFO ] [Nat]Added 468 Read/Feed constraints in 94 ms returned sat
[2020-06-04 08:09:47] [INFO ] Deduced a trap composed of 5 places in 106 ms
[2020-06-04 08:09:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2020-06-04 08:09:47] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 151 ms.
[2020-06-04 08:09:51] [INFO ] Added : 175 causal constraints over 35 iterations in 4399 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-04 08:09:52] [INFO ] [Real]Absence check using 21 positive place invariants in 158 ms returned sat
[2020-06-04 08:09:52] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 28 ms returned sat
[2020-06-04 08:09:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:09:52] [INFO ] [Real]Absence check using state equation in 744 ms returned sat
[2020-06-04 08:09:53] [INFO ] [Real]Added 468 Read/Feed constraints in 99 ms returned sat
[2020-06-04 08:09:53] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 109 ms.
[2020-06-04 08:09:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:09:53] [INFO ] [Nat]Absence check using 21 positive place invariants in 174 ms returned sat
[2020-06-04 08:09:53] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 26 ms returned sat
[2020-06-04 08:09:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:09:54] [INFO ] [Nat]Absence check using state equation in 893 ms returned sat
[2020-06-04 08:09:54] [INFO ] [Nat]Added 468 Read/Feed constraints in 109 ms returned sat
[2020-06-04 08:09:54] [INFO ] Deduced a trap composed of 5 places in 19 ms
[2020-06-04 08:09:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2020-06-04 08:09:54] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 152 ms.
[2020-06-04 08:09:58] [INFO ] Added : 150 causal constraints over 30 iterations in 3686 ms. Result :unknown
FORMULA EnergyBus-PT-none-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EnergyBus-PT-none-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EnergyBus-PT-none-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 955300 steps, including 1000 resets, run finished after 9641 ms. (steps per millisecond=99 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 863700 steps, including 1000 resets, run finished after 8943 ms. (steps per millisecond=96 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1011900 steps, including 1000 resets, run finished after 10064 ms. (steps per millisecond=100 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1150000 steps, including 1000 resets, run finished after 12358 ms. (steps per millisecond=93 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1108500 steps, including 1000 resets, run finished after 11221 ms. (steps per millisecond=98 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 909100 steps, including 1000 resets, run finished after 9060 ms. (steps per millisecond=100 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 632100 steps, including 1000 resets, run finished after 6895 ms. (steps per millisecond=91 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 804300 steps, including 1000 resets, run finished after 8636 ms. (steps per millisecond=93 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 33 out of 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 1913/1913 transitions.
Graph (trivial) has 82 edges and 153 vertex of which 13 / 153 are part of one of the 4 SCC in 40 ms
Free SCC test removed 9 places
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Graph (complete) has 793 edges and 144 vertex of which 140 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.42 ms
Drop transitions removed 27 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 33 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 140 transition count 1874
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 43 place count 137 transition count 1872
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 43 place count 137 transition count 1866
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 55 place count 131 transition count 1866
Symmetric choice reduction at 2 with 15 rule applications. Total rules 70 place count 131 transition count 1866
Deduced a syphon composed of 15 places in 5 ms
Reduce places removed 15 places and 28 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 100 place count 116 transition count 1838
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
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 112 place count 110 transition count 1832
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 114 place count 110 transition count 1830
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 110 transition count 1830
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 109 transition count 1828
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 127 place count 104 transition count 1837
Drop transitions removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 135 place count 104 transition count 1829
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 141 place count 104 transition count 1823
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 149 place count 98 transition count 1821
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 151 place count 98 transition count 1821
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 153 place count 98 transition count 1821
Drop transitions removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 5 with 80 rules applied. Total rules applied 233 place count 98 transition count 1741
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 237 place count 96 transition count 1739
Applied a total of 237 rules in 1325 ms. Remains 96 /153 variables (removed 57) and now considering 1739/1913 (removed 174) transitions.
Finished structural reductions, in 1 iterations. Remains : 96/153 places, 1739/1913 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 13004 ms. (steps per millisecond=76 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0, 0]
FORMULA EnergyBus-PT-none-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2355 ms. (steps per millisecond=424 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 683 ms. (steps per millisecond=1464 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1746 ms. (steps per millisecond=572 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 572 ms. (steps per millisecond=1748 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0]
FORMULA EnergyBus-PT-none-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 632 ms. (steps per millisecond=1582 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1212 ms. (steps per millisecond=825 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 651 ms. (steps per millisecond=1536 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1310 ms. (steps per millisecond=763 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
[2020-06-04 08:11:38] [INFO ] Flow matrix only has 533 transitions (discarded 1206 similar events)
// Phase 1: matrix 533 rows 96 cols
[2020-06-04 08:11:38] [INFO ] Computed 22 place invariants in 16 ms
[2020-06-04 08:11:38] [INFO ] [Real]Absence check using 20 positive place invariants in 15 ms returned sat
[2020-06-04 08:11:38] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2020-06-04 08:11:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:11:39] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2020-06-04 08:11:39] [INFO ] State equation strengthened by 460 read => feed constraints.
[2020-06-04 08:11:39] [INFO ] [Real]Added 460 Read/Feed constraints in 100 ms returned sat
[2020-06-04 08:11:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:11:39] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2020-06-04 08:11:39] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 3 ms returned sat
[2020-06-04 08:11:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:11:39] [INFO ] [Nat]Absence check using state equation in 506 ms returned sat
[2020-06-04 08:11:39] [INFO ] [Nat]Added 460 Read/Feed constraints in 137 ms returned sat
[2020-06-04 08:11:40] [INFO ] Deduced a trap composed of 4 places in 169 ms
[2020-06-04 08:11:40] [INFO ] Deduced a trap composed of 5 places in 30 ms
[2020-06-04 08:11:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 326 ms
[2020-06-04 08:11:40] [INFO ] Computed and/alt/rep : 1737/43449/531 causal constraints in 164 ms.
[2020-06-04 08:12:00] [INFO ] Added : 335 causal constraints over 67 iterations in 20324 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 223 ms.
[2020-06-04 08:12:00] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2020-06-04 08:12:00] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:12:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:12:01] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2020-06-04 08:12:01] [INFO ] [Real]Added 460 Read/Feed constraints in 67 ms returned sat
[2020-06-04 08:12:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:12:01] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2020-06-04 08:12:01] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:12:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:12:01] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2020-06-04 08:12:01] [INFO ] [Nat]Added 460 Read/Feed constraints in 93 ms returned sat
[2020-06-04 08:12:01] [INFO ] Deduced a trap composed of 4 places in 144 ms
[2020-06-04 08:12:01] [INFO ] Deduced a trap composed of 5 places in 63 ms
[2020-06-04 08:12:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 315 ms
[2020-06-04 08:12:01] [INFO ] Computed and/alt/rep : 1737/43449/531 causal constraints in 105 ms.
[2020-06-04 08:12:13] [INFO ] Added : 255 causal constraints over 51 iterations in 12054 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 140 ms.
[2020-06-04 08:12:14] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2020-06-04 08:12:14] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:12:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:12:14] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2020-06-04 08:12:14] [INFO ] [Real]Added 460 Read/Feed constraints in 63 ms returned sat
[2020-06-04 08:12:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:12:14] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2020-06-04 08:12:14] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:12:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:12:14] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2020-06-04 08:12:14] [INFO ] [Nat]Added 460 Read/Feed constraints in 77 ms returned sat
[2020-06-04 08:12:14] [INFO ] Deduced a trap composed of 4 places in 158 ms
[2020-06-04 08:12:14] [INFO ] Deduced a trap composed of 5 places in 38 ms
[2020-06-04 08:12:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 259 ms
[2020-06-04 08:12:15] [INFO ] Computed and/alt/rep : 1737/43449/531 causal constraints in 100 ms.
[2020-06-04 08:12:29] [INFO ] Added : 290 causal constraints over 58 iterations in 14755 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 202 ms.
[2020-06-04 08:12:29] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2020-06-04 08:12:29] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:12:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:12:30] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2020-06-04 08:12:30] [INFO ] [Real]Added 460 Read/Feed constraints in 83 ms returned sat
[2020-06-04 08:12:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:12:30] [INFO ] [Nat]Absence check using 20 positive place invariants in 16 ms returned sat
[2020-06-04 08:12:30] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:12:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:12:30] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2020-06-04 08:12:30] [INFO ] [Nat]Added 460 Read/Feed constraints in 112 ms returned sat
[2020-06-04 08:12:30] [INFO ] Deduced a trap composed of 4 places in 135 ms
[2020-06-04 08:12:30] [INFO ] Deduced a trap composed of 5 places in 23 ms
[2020-06-04 08:12:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 247 ms
[2020-06-04 08:12:30] [INFO ] Computed and/alt/rep : 1737/43449/531 causal constraints in 111 ms.
[2020-06-04 08:12:51] [INFO ] Added : 340 causal constraints over 68 iterations in 20942 ms.(timeout) Result :sat
[2020-06-04 08:12:51] [INFO ] Deduced a trap composed of 5 places in 26 ms
[2020-06-04 08:12:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 297 ms
Attempting to minimize the solution found.
Minimization took 232 ms.
[2020-06-04 08:12:52] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2020-06-04 08:12:52] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 26 ms returned sat
[2020-06-04 08:12:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:12:52] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2020-06-04 08:12:52] [INFO ] [Real]Added 460 Read/Feed constraints in 74 ms returned sat
[2020-06-04 08:12:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:12:52] [INFO ] [Nat]Absence check using 20 positive place invariants in 17 ms returned sat
[2020-06-04 08:12:52] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:12:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:12:52] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2020-06-04 08:12:53] [INFO ] [Nat]Added 460 Read/Feed constraints in 94 ms returned sat
[2020-06-04 08:12:53] [INFO ] Deduced a trap composed of 4 places in 139 ms
[2020-06-04 08:12:53] [INFO ] Deduced a trap composed of 5 places in 69 ms
[2020-06-04 08:12:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 317 ms
[2020-06-04 08:12:53] [INFO ] Computed and/alt/rep : 1737/43449/531 causal constraints in 118 ms.
[2020-06-04 08:13:05] [INFO ] Added : 270 causal constraints over 54 iterations in 11620 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 151 ms.
[2020-06-04 08:13:05] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2020-06-04 08:13:05] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:13:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:13:05] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2020-06-04 08:13:05] [INFO ] [Real]Added 460 Read/Feed constraints in 103 ms returned sat
[2020-06-04 08:13:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:13:05] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2020-06-04 08:13:05] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2020-06-04 08:13:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:13:05] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2020-06-04 08:13:05] [INFO ] [Nat]Added 460 Read/Feed constraints in 122 ms returned sat
[2020-06-04 08:13:06] [INFO ] Deduced a trap composed of 4 places in 125 ms
[2020-06-04 08:13:06] [INFO ] Deduced a trap composed of 5 places in 20 ms
[2020-06-04 08:13:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 243 ms
[2020-06-04 08:13:06] [INFO ] Computed and/alt/rep : 1737/43449/531 causal constraints in 218 ms.
[2020-06-04 08:13:26] [INFO ] Added : 355 causal constraints over 71 iterations in 20547 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 195 ms.
[2020-06-04 08:13:27] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2020-06-04 08:13:27] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2020-06-04 08:13:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:13:27] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2020-06-04 08:13:27] [INFO ] [Real]Added 460 Read/Feed constraints in 69 ms returned sat
[2020-06-04 08:13:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:13:27] [INFO ] [Nat]Absence check using 20 positive place invariants in 16 ms returned sat
[2020-06-04 08:13:27] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:13:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:13:27] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2020-06-04 08:13:27] [INFO ] [Nat]Added 460 Read/Feed constraints in 149 ms returned sat
[2020-06-04 08:13:27] [INFO ] Deduced a trap composed of 4 places in 125 ms
[2020-06-04 08:13:27] [INFO ] Deduced a trap composed of 5 places in 29 ms
[2020-06-04 08:13:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 271 ms
[2020-06-04 08:13:28] [INFO ] Computed and/alt/rep : 1737/43449/531 causal constraints in 137 ms.
[2020-06-04 08:13:39] [INFO ] Added : 260 causal constraints over 52 iterations in 11971 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 169 ms.
Incomplete Parikh walk after 508600 steps, including 1000 resets, run finished after 2413 ms. (steps per millisecond=210 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 503400 steps, including 1000 resets, run finished after 2163 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 656400 steps, including 1000 resets, run finished after 3034 ms. (steps per millisecond=216 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 295000 steps, including 1000 resets, run finished after 1620 ms. (steps per millisecond=182 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 639900 steps, including 1000 resets, run finished after 3353 ms. (steps per millisecond=190 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 514300 steps, including 1000 resets, run finished after 2264 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 505400 steps, including 1000 resets, run finished after 3138 ms. (steps per millisecond=161 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 30 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 1739/1739 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 95 transition count 1738
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 95 transition count 1737
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 94 transition count 1737
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 94 transition count 1736
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 94 transition count 1735
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 93 transition count 1735
Applied a total of 7 rules in 990 ms. Remains 93 /96 variables (removed 3) and now considering 1735/1739 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 93/96 places, 1735/1739 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 12191 ms. (steps per millisecond=82 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1685 ms. (steps per millisecond=593 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 840 ms. (steps per millisecond=1190 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1326 ms. (steps per millisecond=754 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 578 ms. (steps per millisecond=1730 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1986 ms. (steps per millisecond=503 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 639 ms. (steps per millisecond=1564 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1142 ms. (steps per millisecond=875 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 5643690 steps, run timeout after 30001 ms. (steps per millisecond=188 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 5643690 steps, saw 627433 distinct states, run finished after 30001 ms. (steps per millisecond=188 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
[2020-06-04 08:14:49] [INFO ] Flow matrix only has 529 transitions (discarded 1206 similar events)
// Phase 1: matrix 529 rows 93 cols
[2020-06-04 08:14:49] [INFO ] Computed 22 place invariants in 8 ms
[2020-06-04 08:14:49] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2020-06-04 08:14:49] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:14:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:14:49] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2020-06-04 08:14:49] [INFO ] State equation strengthened by 461 read => feed constraints.
[2020-06-04 08:14:49] [INFO ] [Real]Added 461 Read/Feed constraints in 83 ms returned sat
[2020-06-04 08:14:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:14:49] [INFO ] [Nat]Absence check using 20 positive place invariants in 16 ms returned sat
[2020-06-04 08:14:49] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:14:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:14:50] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2020-06-04 08:14:50] [INFO ] [Nat]Added 461 Read/Feed constraints in 84 ms returned sat
[2020-06-04 08:14:50] [INFO ] Deduced a trap composed of 5 places in 24 ms
[2020-06-04 08:14:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2020-06-04 08:14:50] [INFO ] Computed and/alt/rep : 1733/50744/527 causal constraints in 125 ms.
[2020-06-04 08:15:10] [INFO ] Added : 365 causal constraints over 73 iterations in 20422 ms.(timeout) Result :sat
[2020-06-04 08:15:10] [INFO ] Deduced a trap composed of 4 places in 138 ms
[2020-06-04 08:15:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 429 ms
Attempting to minimize the solution found.
Minimization took 155 ms.
[2020-06-04 08:15:11] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2020-06-04 08:15:11] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:15:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:15:11] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2020-06-04 08:15:11] [INFO ] [Real]Added 461 Read/Feed constraints in 71 ms returned sat
[2020-06-04 08:15:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:15:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2020-06-04 08:15:11] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:15:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:15:11] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2020-06-04 08:15:12] [INFO ] [Nat]Added 461 Read/Feed constraints in 86 ms returned sat
[2020-06-04 08:15:12] [INFO ] Deduced a trap composed of 5 places in 22 ms
[2020-06-04 08:15:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2020-06-04 08:15:12] [INFO ] Computed and/alt/rep : 1733/50744/527 causal constraints in 120 ms.
[2020-06-04 08:15:32] [INFO ] Added : 340 causal constraints over 68 iterations in 20322 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 198 ms.
[2020-06-04 08:15:32] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2020-06-04 08:15:32] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:15:32] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2020-06-04 08:15:32] [INFO ] [Real]Added 461 Read/Feed constraints in 55 ms returned sat
[2020-06-04 08:15:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:15:32] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2020-06-04 08:15:32] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 3 ms returned sat
[2020-06-04 08:15:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:15:33] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2020-06-04 08:15:33] [INFO ] [Nat]Added 461 Read/Feed constraints in 92 ms returned sat
[2020-06-04 08:15:33] [INFO ] Deduced a trap composed of 5 places in 24 ms
[2020-06-04 08:15:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2020-06-04 08:15:33] [INFO ] Computed and/alt/rep : 1733/50744/527 causal constraints in 143 ms.
[2020-06-04 08:15:53] [INFO ] Added : 350 causal constraints over 70 iterations in 20484 ms.(timeout) Result :sat
[2020-06-04 08:15:53] [INFO ] Deduced a trap composed of 5 places in 66 ms
[2020-06-04 08:15:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 375 ms
Attempting to minimize the solution found.
Minimization took 235 ms.
[2020-06-04 08:15:54] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2020-06-04 08:15:54] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2020-06-04 08:15:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:15:54] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2020-06-04 08:15:54] [INFO ] [Real]Added 461 Read/Feed constraints in 81 ms returned sat
[2020-06-04 08:15:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:15:54] [INFO ] [Nat]Absence check using 20 positive place invariants in 16 ms returned sat
[2020-06-04 08:15:54] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2020-06-04 08:15:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:15:55] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2020-06-04 08:15:55] [INFO ] [Nat]Added 461 Read/Feed constraints in 150 ms returned sat
[2020-06-04 08:15:55] [INFO ] Computed and/alt/rep : 1733/50744/527 causal constraints in 226 ms.
[2020-06-04 08:16:10] [INFO ] Added : 315 causal constraints over 63 iterations in 15170 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 153 ms.
[2020-06-04 08:16:10] [INFO ] [Real]Absence check using 20 positive place invariants in 15 ms returned sat
[2020-06-04 08:16:10] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:16:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:16:10] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2020-06-04 08:16:10] [INFO ] [Real]Added 461 Read/Feed constraints in 70 ms returned sat
[2020-06-04 08:16:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:16:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2020-06-04 08:16:11] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:16:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:16:11] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2020-06-04 08:16:11] [INFO ] [Nat]Added 461 Read/Feed constraints in 89 ms returned sat
[2020-06-04 08:16:11] [INFO ] Deduced a trap composed of 5 places in 23 ms
[2020-06-04 08:16:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2020-06-04 08:16:11] [INFO ] Computed and/alt/rep : 1733/50744/527 causal constraints in 123 ms.
[2020-06-04 08:16:31] [INFO ] Added : 360 causal constraints over 72 iterations in 20287 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 200 ms.
[2020-06-04 08:16:31] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2020-06-04 08:16:31] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:16:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:16:32] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2020-06-04 08:16:32] [INFO ] [Real]Added 461 Read/Feed constraints in 76 ms returned sat
[2020-06-04 08:16:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:16:32] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2020-06-04 08:16:32] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:16:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:16:32] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2020-06-04 08:16:32] [INFO ] [Nat]Added 461 Read/Feed constraints in 123 ms returned sat
[2020-06-04 08:16:32] [INFO ] Deduced a trap composed of 5 places in 20 ms
[2020-06-04 08:16:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2020-06-04 08:16:32] [INFO ] Computed and/alt/rep : 1733/50744/527 causal constraints in 123 ms.
[2020-06-04 08:16:45] [INFO ] Added : 280 causal constraints over 56 iterations in 13034 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 246 ms.
[2020-06-04 08:16:46] [INFO ] [Real]Absence check using 20 positive place invariants in 16 ms returned sat
[2020-06-04 08:16:46] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 08:16:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:16:46] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2020-06-04 08:16:46] [INFO ] [Real]Added 461 Read/Feed constraints in 83 ms returned sat
[2020-06-04 08:16:46] [INFO ] Computed and/alt/rep : 1733/50744/527 causal constraints in 121 ms.
[2020-06-04 08:16:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:16:46] [INFO ] [Nat]Absence check using 20 positive place invariants in 17 ms returned sat
[2020-06-04 08:16:46] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 7 ms returned sat
[2020-06-04 08:16:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:16:46] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2020-06-04 08:16:46] [INFO ] [Nat]Added 461 Read/Feed constraints in 90 ms returned sat
[2020-06-04 08:16:47] [INFO ] Deduced a trap composed of 5 places in 25 ms
[2020-06-04 08:16:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2020-06-04 08:16:47] [INFO ] Computed and/alt/rep : 1733/50744/527 causal constraints in 136 ms.
[2020-06-04 08:17:01] [INFO ] Added : 305 causal constraints over 61 iterations in 14295 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 185 ms.
Incomplete Parikh walk after 598900 steps, including 1000 resets, run finished after 3886 ms. (steps per millisecond=154 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 468400 steps, including 1000 resets, run finished after 2428 ms. (steps per millisecond=192 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 363300 steps, including 1000 resets, run finished after 2261 ms. (steps per millisecond=160 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 334900 steps, including 1000 resets, run finished after 2651 ms. (steps per millisecond=126 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 265600 steps, including 1000 resets, run finished after 1884 ms. (steps per millisecond=140 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 465200 steps, including 1000 resets, run finished after 2155 ms. (steps per millisecond=215 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 388400 steps, including 1000 resets, run finished after 2430 ms. (steps per millisecond=159 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 30 out of 93 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 93/93 places, 1735/1735 transitions.
Applied a total of 0 rules in 260 ms. Remains 93 /93 variables (removed 0) and now considering 1735/1735 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 93/93 places, 1735/1735 transitions.
Starting structural reductions, iteration 0 : 93/93 places, 1735/1735 transitions.
Applied a total of 0 rules in 393 ms. Remains 93 /93 variables (removed 0) and now considering 1735/1735 (removed 0) transitions.
[2020-06-04 08:17:19] [INFO ] Flow matrix only has 529 transitions (discarded 1206 similar events)
// Phase 1: matrix 529 rows 93 cols
[2020-06-04 08:17:19] [INFO ] Computed 22 place invariants in 15 ms
[2020-06-04 08:17:20] [INFO ] Implicit Places using invariants in 113 ms returned [5, 27, 34, 74]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 129 ms to find 4 implicit places.
[2020-06-04 08:17:21] [INFO ] Redundant transitions in 1798 ms returned []
[2020-06-04 08:17:21] [INFO ] Flow matrix only has 529 transitions (discarded 1206 similar events)
// Phase 1: matrix 529 rows 89 cols
[2020-06-04 08:17:21] [INFO ] Computed 18 place invariants in 2 ms
[2020-06-04 08:17:22] [INFO ] Dead Transitions using invariants and state equation in 896 ms returned []
Starting structural reductions, iteration 1 : 89/93 places, 1735/1735 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 88 transition count 1734
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 88 transition count 1731
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 8 place count 85 transition count 1731
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 85 transition count 1731
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 85 transition count 1729
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 85 transition count 1728
Applied a total of 15 rules in 745 ms. Remains 85 /89 variables (removed 4) and now considering 1728/1735 (removed 7) transitions.
[2020-06-04 08:17:23] [INFO ] Flow matrix only has 522 transitions (discarded 1206 similar events)
// Phase 1: matrix 522 rows 85 cols
[2020-06-04 08:17:23] [INFO ] Computed 18 place invariants in 4 ms
[2020-06-04 08:17:23] [INFO ] Implicit Places using invariants in 64 ms returned []
[2020-06-04 08:17:23] [INFO ] Flow matrix only has 522 transitions (discarded 1206 similar events)
// Phase 1: matrix 522 rows 85 cols
[2020-06-04 08:17:23] [INFO ] Computed 18 place invariants in 3 ms
[2020-06-04 08:17:23] [INFO ] State equation strengthened by 451 read => feed constraints.
[2020-06-04 08:17:24] [INFO ] Implicit Places using invariants and state equation in 923 ms returned [13, 63]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1011 ms to find 2 implicit places.
Starting structural reductions, iteration 2 : 83/93 places, 1728/1735 transitions.
Applied a total of 0 rules in 340 ms. Remains 83 /83 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2020-06-04 08:17:26] [INFO ] Redundant transitions in 1672 ms returned []
[2020-06-04 08:17:26] [INFO ] Flow matrix only has 522 transitions (discarded 1206 similar events)
// Phase 1: matrix 522 rows 83 cols
[2020-06-04 08:17:26] [INFO ] Computed 16 place invariants in 2 ms
[2020-06-04 08:17:27] [INFO ] Dead Transitions using invariants and state equation in 918 ms returned []
Finished structural reductions, in 3 iterations. Remains : 83/93 places, 1728/1735 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 12818 ms. (steps per millisecond=78 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1919 ms. (steps per millisecond=521 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1578 ms. (steps per millisecond=633 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1232 ms. (steps per millisecond=811 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 534 ms. (steps per millisecond=1872 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1875 ms. (steps per millisecond=533 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 612 ms. (steps per millisecond=1633 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1093 ms. (steps per millisecond=914 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 6538038 steps, run timeout after 30001 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 6538038 steps, saw 730562 distinct states, run finished after 30014 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
[2020-06-04 08:18:19] [INFO ] Flow matrix only has 522 transitions (discarded 1206 similar events)
// Phase 1: matrix 522 rows 83 cols
[2020-06-04 08:18:19] [INFO ] Computed 16 place invariants in 2 ms
[2020-06-04 08:18:19] [INFO ] [Real]Absence check using 15 positive place invariants in 106 ms returned sat
[2020-06-04 08:18:19] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 14 ms returned sat
[2020-06-04 08:18:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:18:19] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2020-06-04 08:18:19] [INFO ] State equation strengthened by 451 read => feed constraints.
[2020-06-04 08:18:19] [INFO ] [Real]Added 451 Read/Feed constraints in 69 ms returned sat
[2020-06-04 08:18:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:18:19] [INFO ] [Nat]Absence check using 15 positive place invariants in 13 ms returned sat
[2020-06-04 08:18:19] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 08:18:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:18:19] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2020-06-04 08:18:19] [INFO ] [Nat]Added 451 Read/Feed constraints in 74 ms returned sat
[2020-06-04 08:18:20] [INFO ] Computed and/alt/rep : 1726/50704/520 causal constraints in 83 ms.
[2020-06-04 08:18:40] [INFO ] Added : 370 causal constraints over 74 iterations in 20215 ms.(timeout) Result :sat
[2020-06-04 08:18:40] [INFO ] Deduced a trap composed of 5 places in 72 ms
[2020-06-04 08:18:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 350 ms
Attempting to minimize the solution found.
Minimization took 180 ms.
[2020-06-04 08:18:40] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2020-06-04 08:18:40] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 0 ms returned sat
[2020-06-04 08:18:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:18:40] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2020-06-04 08:18:41] [INFO ] [Real]Added 451 Read/Feed constraints in 71 ms returned sat
[2020-06-04 08:18:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:18:41] [INFO ] [Nat]Absence check using 15 positive place invariants in 13 ms returned sat
[2020-06-04 08:18:41] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-04 08:18:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:18:41] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2020-06-04 08:18:41] [INFO ] [Nat]Added 451 Read/Feed constraints in 82 ms returned sat
[2020-06-04 08:18:41] [INFO ] Computed and/alt/rep : 1726/50704/520 causal constraints in 120 ms.
[2020-06-04 08:18:57] [INFO ] Added : 340 causal constraints over 68 iterations in 16096 ms. Result :sat
[2020-06-04 08:18:57] [INFO ] Deduced a trap composed of 4 places in 233 ms
[2020-06-04 08:18:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 505 ms
Attempting to minimize the solution found.
Minimization took 138 ms.
[2020-06-04 08:18:58] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned sat
[2020-06-04 08:18:58] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 08:18:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:18:58] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2020-06-04 08:18:58] [INFO ] [Real]Added 451 Read/Feed constraints in 68 ms returned sat
[2020-06-04 08:18:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:18:58] [INFO ] [Nat]Absence check using 15 positive place invariants in 13 ms returned sat
[2020-06-04 08:18:58] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 08:18:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:18:58] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2020-06-04 08:18:58] [INFO ] [Nat]Added 451 Read/Feed constraints in 92 ms returned sat
[2020-06-04 08:18:58] [INFO ] Computed and/alt/rep : 1726/50704/520 causal constraints in 126 ms.
[2020-06-04 08:19:19] [INFO ] Added : 370 causal constraints over 74 iterations in 20333 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 167 ms.
[2020-06-04 08:19:19] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2020-06-04 08:19:19] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 08:19:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:19:19] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2020-06-04 08:19:19] [INFO ] [Real]Added 451 Read/Feed constraints in 89 ms returned sat
[2020-06-04 08:19:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:19:19] [INFO ] [Nat]Absence check using 15 positive place invariants in 13 ms returned sat
[2020-06-04 08:19:19] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 08:19:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:19:19] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2020-06-04 08:19:19] [INFO ] [Nat]Added 451 Read/Feed constraints in 90 ms returned sat
[2020-06-04 08:19:20] [INFO ] Deduced a trap composed of 5 places in 27 ms
[2020-06-04 08:19:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2020-06-04 08:19:20] [INFO ] Computed and/alt/rep : 1726/50704/520 causal constraints in 122 ms.
[2020-06-04 08:19:36] [INFO ] Added : 345 causal constraints over 69 iterations in 16264 ms. Result :sat
[2020-06-04 08:19:36] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2020-06-04 08:19:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
Attempting to minimize the solution found.
Minimization took 130 ms.
[2020-06-04 08:19:36] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2020-06-04 08:19:36] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 0 ms returned sat
[2020-06-04 08:19:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:19:36] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2020-06-04 08:19:36] [INFO ] [Real]Added 451 Read/Feed constraints in 66 ms returned sat
[2020-06-04 08:19:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:19:37] [INFO ] [Nat]Absence check using 15 positive place invariants in 19 ms returned sat
[2020-06-04 08:19:37] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 08:19:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:19:37] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2020-06-04 08:19:37] [INFO ] [Nat]Added 451 Read/Feed constraints in 91 ms returned sat
[2020-06-04 08:19:37] [INFO ] Computed and/alt/rep : 1726/50704/520 causal constraints in 112 ms.
[2020-06-04 08:19:52] [INFO ] Added : 335 causal constraints over 67 iterations in 14783 ms. Result :sat
[2020-06-04 08:19:52] [INFO ] Deduced a trap composed of 5 places in 36 ms
[2020-06-04 08:19:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
Attempting to minimize the solution found.
Minimization took 189 ms.
[2020-06-04 08:19:52] [INFO ] [Real]Absence check using 15 positive place invariants in 24 ms returned sat
[2020-06-04 08:19:52] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 0 ms returned sat
[2020-06-04 08:19:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:19:52] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2020-06-04 08:19:52] [INFO ] [Real]Added 451 Read/Feed constraints in 98 ms returned sat
[2020-06-04 08:19:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:19:53] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2020-06-04 08:19:53] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 08:19:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:19:53] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2020-06-04 08:19:53] [INFO ] [Nat]Added 451 Read/Feed constraints in 95 ms returned sat
[2020-06-04 08:19:53] [INFO ] Computed and/alt/rep : 1726/50704/520 causal constraints in 138 ms.
[2020-06-04 08:20:09] [INFO ] Added : 305 causal constraints over 61 iterations in 15854 ms. Result :sat
[2020-06-04 08:20:09] [INFO ] Deduced a trap composed of 5 places in 33 ms
[2020-06-04 08:20:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
Attempting to minimize the solution found.
Minimization took 160 ms.
[2020-06-04 08:20:09] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2020-06-04 08:20:09] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 08:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:20:09] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2020-06-04 08:20:09] [INFO ] [Real]Added 451 Read/Feed constraints in 93 ms returned sat
[2020-06-04 08:20:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:20:09] [INFO ] [Nat]Absence check using 15 positive place invariants in 14 ms returned sat
[2020-06-04 08:20:09] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 08:20:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:20:10] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2020-06-04 08:20:10] [INFO ] [Nat]Added 451 Read/Feed constraints in 98 ms returned sat
[2020-06-04 08:20:10] [INFO ] Computed and/alt/rep : 1726/50704/520 causal constraints in 106 ms.
[2020-06-04 08:20:30] [INFO ] Added : 375 causal constraints over 75 iterations in 20305 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 167 ms.
Incomplete Parikh walk after 393400 steps, including 1000 resets, run finished after 2374 ms. (steps per millisecond=165 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 488300 steps, including 1000 resets, run finished after 2178 ms. (steps per millisecond=224 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 392100 steps, including 1000 resets, run finished after 1913 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 420100 steps, including 1000 resets, run finished after 2160 ms. (steps per millisecond=194 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 194900 steps, including 1000 resets, run finished after 1336 ms. (steps per millisecond=145 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 560800 steps, including 1000 resets, run finished after 2592 ms. (steps per millisecond=216 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 325800 steps, including 1000 resets, run finished after 1622 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 30 out of 83 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 83/83 places, 1728/1728 transitions.
Applied a total of 0 rules in 230 ms. Remains 83 /83 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 1728/1728 transitions.
Starting structural reductions, iteration 0 : 83/83 places, 1728/1728 transitions.
Applied a total of 0 rules in 374 ms. Remains 83 /83 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2020-06-04 08:20:45] [INFO ] Flow matrix only has 522 transitions (discarded 1206 similar events)
// Phase 1: matrix 522 rows 83 cols
[2020-06-04 08:20:45] [INFO ] Computed 16 place invariants in 3 ms
[2020-06-04 08:20:45] [INFO ] Implicit Places using invariants in 86 ms returned []
[2020-06-04 08:20:45] [INFO ] Flow matrix only has 522 transitions (discarded 1206 similar events)
// Phase 1: matrix 522 rows 83 cols
[2020-06-04 08:20:45] [INFO ] Computed 16 place invariants in 3 ms
[2020-06-04 08:20:45] [INFO ] State equation strengthened by 451 read => feed constraints.
[2020-06-04 08:20:46] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
[2020-06-04 08:20:48] [INFO ] Redundant transitions in 1637 ms returned []
[2020-06-04 08:20:48] [INFO ] Flow matrix only has 522 transitions (discarded 1206 similar events)
// Phase 1: matrix 522 rows 83 cols
[2020-06-04 08:20:48] [INFO ] Computed 16 place invariants in 7 ms
[2020-06-04 08:20:49] [INFO ] Dead Transitions using invariants and state equation in 1114 ms returned []
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 1728/1728 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1168 ms. (steps per millisecond=85 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
[2020-06-04 08:20:50] [INFO ] Flow matrix only has 522 transitions (discarded 1206 similar events)
// Phase 1: matrix 522 rows 83 cols
[2020-06-04 08:20:50] [INFO ] Computed 16 place invariants in 5 ms
[2020-06-04 08:20:50] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2020-06-04 08:20:50] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 0 ms returned sat
[2020-06-04 08:20:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:20:50] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2020-06-04 08:20:50] [INFO ] State equation strengthened by 451 read => feed constraints.
[2020-06-04 08:20:50] [INFO ] [Real]Added 451 Read/Feed constraints in 81 ms returned sat
[2020-06-04 08:20:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:20:50] [INFO ] [Nat]Absence check using 15 positive place invariants in 13 ms returned sat
[2020-06-04 08:20:50] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 08:20:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:20:50] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2020-06-04 08:20:50] [INFO ] [Nat]Added 451 Read/Feed constraints in 79 ms returned sat
[2020-06-04 08:20:51] [INFO ] Computed and/alt/rep : 1726/50704/520 causal constraints in 140 ms.
[2020-06-04 08:21:10] [INFO ] Added : 365 causal constraints over 73 iterations in 19706 ms. Result :unknown
[2020-06-04 08:21:10] [INFO ] [Real]Absence check using 15 positive place invariants in 15 ms returned sat
[2020-06-04 08:21:10] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 9 ms returned sat
[2020-06-04 08:21:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:21:10] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2020-06-04 08:21:10] [INFO ] [Real]Added 451 Read/Feed constraints in 77 ms returned sat
[2020-06-04 08:21:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:21:10] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2020-06-04 08:21:10] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 08:21:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:21:11] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2020-06-04 08:21:11] [INFO ] [Nat]Added 451 Read/Feed constraints in 83 ms returned sat
[2020-06-04 08:21:11] [INFO ] Computed and/alt/rep : 1726/50704/520 causal constraints in 94 ms.
[2020-06-04 08:21:28] [INFO ] Added : 340 causal constraints over 68 iterations in 17684 ms. Result :sat
[2020-06-04 08:21:29] [INFO ] Deduced a trap composed of 4 places in 87 ms
[2020-06-04 08:21:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 339 ms
[2020-06-04 08:21:29] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2020-06-04 08:21:29] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 08:21:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:21:29] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2020-06-04 08:21:29] [INFO ] [Real]Added 451 Read/Feed constraints in 74 ms returned sat
[2020-06-04 08:21:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:21:29] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2020-06-04 08:21:29] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 08:21:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:21:29] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2020-06-04 08:21:29] [INFO ] [Nat]Added 451 Read/Feed constraints in 82 ms returned sat
[2020-06-04 08:21:30] [INFO ] Computed and/alt/rep : 1726/50704/520 causal constraints in 126 ms.
[2020-06-04 08:21:49] [INFO ] Added : 380 causal constraints over 76 iterations in 19709 ms. Result :unknown
[2020-06-04 08:21:49] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2020-06-04 08:21:49] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 08:21:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:21:49] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2020-06-04 08:21:49] [INFO ] [Real]Added 451 Read/Feed constraints in 74 ms returned sat
[2020-06-04 08:21:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:21:49] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2020-06-04 08:21:49] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 0 ms returned sat
[2020-06-04 08:21:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:21:50] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2020-06-04 08:21:50] [INFO ] [Nat]Added 451 Read/Feed constraints in 89 ms returned sat
[2020-06-04 08:21:50] [INFO ] Deduced a trap composed of 5 places in 29 ms
[2020-06-04 08:21:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2020-06-04 08:21:50] [INFO ] Computed and/alt/rep : 1726/50704/520 causal constraints in 106 ms.
[2020-06-04 08:22:07] [INFO ] Added : 345 causal constraints over 69 iterations in 17122 ms. Result :sat
[2020-06-04 08:22:07] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-06-04 08:22:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2020-06-04 08:22:07] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2020-06-04 08:22:07] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 20 ms returned sat
[2020-06-04 08:22:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:22:07] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2020-06-04 08:22:07] [INFO ] [Real]Added 451 Read/Feed constraints in 85 ms returned sat
[2020-06-04 08:22:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:22:08] [INFO ] [Nat]Absence check using 15 positive place invariants in 13 ms returned sat
[2020-06-04 08:22:08] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 08:22:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:22:08] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2020-06-04 08:22:08] [INFO ] [Nat]Added 451 Read/Feed constraints in 97 ms returned sat
[2020-06-04 08:22:08] [INFO ] Computed and/alt/rep : 1726/50704/520 causal constraints in 113 ms.
[2020-06-04 08:22:23] [INFO ] Added : 335 causal constraints over 67 iterations in 15597 ms. Result :sat
[2020-06-04 08:22:23] [INFO ] Deduced a trap composed of 5 places in 25 ms
[2020-06-04 08:22:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2020-06-04 08:22:24] [INFO ] [Real]Absence check using 15 positive place invariants in 18 ms returned sat
[2020-06-04 08:22:24] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 08:22:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:22:24] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2020-06-04 08:22:24] [INFO ] [Real]Added 451 Read/Feed constraints in 86 ms returned sat
[2020-06-04 08:22:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:22:24] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2020-06-04 08:22:24] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 08:22:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:22:24] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2020-06-04 08:22:24] [INFO ] [Nat]Added 451 Read/Feed constraints in 103 ms returned sat
[2020-06-04 08:22:24] [INFO ] Computed and/alt/rep : 1726/50704/520 causal constraints in 101 ms.
[2020-06-04 08:22:44] [INFO ] Added : 360 causal constraints over 72 iterations in 19737 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-04 08:22:44] [INFO ] [Real]Absence check using 15 positive place invariants in 16 ms returned sat
[2020-06-04 08:22:44] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 08:22:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:22:44] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2020-06-04 08:22:44] [INFO ] [Real]Added 451 Read/Feed constraints in 82 ms returned sat
[2020-06-04 08:22:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:22:44] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2020-06-04 08:22:44] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-04 08:22:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:22:45] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2020-06-04 08:22:45] [INFO ] [Nat]Added 451 Read/Feed constraints in 87 ms returned sat
[2020-06-04 08:22:45] [INFO ] Computed and/alt/rep : 1726/50704/520 causal constraints in 206 ms.
[2020-06-04 08:23:04] [INFO ] Added : 380 causal constraints over 76 iterations in 19695 ms. Result :unknown
Graph (trivial) has 14 edges and 83 vertex of which 2 / 83 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions removed 3 transitions
Ensure Unique test removed 1206 transitions
Reduce isomorphic transitions removed 1209 transitions.
Iterating post reduction 0 with 1209 rules applied. Total rules applied 1210 place count 82 transition count 519
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 1210 place count 82 transition count 517
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1214 place count 80 transition count 517
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1216 place count 80 transition count 515
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 1220 place count 78 transition count 513
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 1225 place count 78 transition count 513
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 1227 place count 78 transition count 511
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1228 place count 78 transition count 511
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1230 place count 77 transition count 510
Applied a total of 1230 rules in 50 ms. Remains 77 /83 variables (removed 6) and now considering 510/1728 (removed 1218) transitions.
// Phase 1: matrix 510 rows 77 cols
[2020-06-04 08:23:04] [INFO ] Computed 16 place invariants in 1 ms
[2020-06-04 08:23:04] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2020-06-04 08:23:04] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 0 ms returned sat
[2020-06-04 08:23:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:23:05] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2020-06-04 08:23:05] [INFO ] State equation strengthened by 10 read => feed constraints.
[2020-06-04 08:23:05] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2020-06-04 08:23:05] [INFO ] Computed and/alt/rep : 508/11584/508 causal constraints in 29 ms.
[2020-06-04 08:23:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:23:05] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2020-06-04 08:23:05] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 08:23:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:23:05] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2020-06-04 08:23:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2020-06-04 08:23:05] [INFO ] Computed and/alt/rep : 508/11584/508 causal constraints in 29 ms.
[2020-06-04 08:23:28] [INFO ] Added : 445 causal constraints over 89 iterations in 23018 ms.(timeout) Result :unknown
[2020-06-04 08:23:28] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2020-06-04 08:23:28] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 08:23:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:23:28] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2020-06-04 08:23:28] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2020-06-04 08:23:28] [INFO ] Computed and/alt/rep : 508/11584/508 causal constraints in 31 ms.
[2020-06-04 08:23:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:23:28] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2020-06-04 08:23:28] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 0 ms returned sat
[2020-06-04 08:23:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:23:28] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2020-06-04 08:23:28] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2020-06-04 08:23:28] [INFO ] Computed and/alt/rep : 508/11584/508 causal constraints in 35 ms.
[2020-06-04 08:23:46] [INFO ] Added : 420 causal constraints over 84 iterations in 17436 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 130 ms.
[2020-06-04 08:23:46] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2020-06-04 08:23:46] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 08:23:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:23:46] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2020-06-04 08:23:46] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2020-06-04 08:23:46] [INFO ] Computed and/alt/rep : 508/11584/508 causal constraints in 30 ms.
[2020-06-04 08:23:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:23:46] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2020-06-04 08:23:46] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 0 ms returned sat
[2020-06-04 08:23:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:23:47] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2020-06-04 08:23:47] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2020-06-04 08:23:47] [INFO ] Computed and/alt/rep : 508/11584/508 causal constraints in 29 ms.
[2020-06-04 08:24:07] [INFO ] Added : 360 causal constraints over 72 iterations in 20653 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 189 ms.
[2020-06-04 08:24:07] [INFO ] [Real]Absence check using 15 positive place invariants in 17 ms returned sat
[2020-06-04 08:24:07] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 08:24:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:24:08] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2020-06-04 08:24:08] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2020-06-04 08:24:08] [INFO ] Computed and/alt/rep : 508/11584/508 causal constraints in 37 ms.
[2020-06-04 08:24:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:24:08] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2020-06-04 08:24:08] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 08:24:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:24:08] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2020-06-04 08:24:08] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2020-06-04 08:24:08] [INFO ] Computed and/alt/rep : 508/11584/508 causal constraints in 37 ms.
[2020-06-04 08:24:23] [INFO ] Added : 390 causal constraints over 78 iterations in 15453 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 156 ms.
[2020-06-04 08:24:24] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2020-06-04 08:24:24] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-04 08:24:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:24:24] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2020-06-04 08:24:24] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2020-06-04 08:24:24] [INFO ] Computed and/alt/rep : 508/11584/508 causal constraints in 42 ms.
[2020-06-04 08:24:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:24:24] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2020-06-04 08:24:24] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 0 ms returned sat
[2020-06-04 08:24:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:24:24] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2020-06-04 08:24:24] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2020-06-04 08:24:24] [INFO ] Computed and/alt/rep : 508/11584/508 causal constraints in 34 ms.
[2020-06-04 08:24:47] [INFO ] Added : 395 causal constraints over 79 iterations in 23485 ms.(timeout) Result :unknown
[2020-06-04 08:24:48] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2020-06-04 08:24:48] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 08:24:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:24:48] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2020-06-04 08:24:48] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2020-06-04 08:24:48] [INFO ] Computed and/alt/rep : 508/11584/508 causal constraints in 37 ms.
[2020-06-04 08:24:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:24:48] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2020-06-04 08:24:48] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 08:24:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:24:48] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2020-06-04 08:24:48] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2020-06-04 08:24:48] [INFO ] Computed and/alt/rep : 508/11584/508 causal constraints in 29 ms.
[2020-06-04 08:25:09] [INFO ] Added : 400 causal constraints over 80 iterations in 20909 ms. Result :unknown
[2020-06-04 08:25:09] [INFO ] [Real]Absence check using 15 positive place invariants in 15 ms returned sat
[2020-06-04 08:25:09] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 08:25:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:25:09] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2020-06-04 08:25:09] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2020-06-04 08:25:09] [INFO ] Computed and/alt/rep : 508/11584/508 causal constraints in 36 ms.
[2020-06-04 08:25:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:25:09] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2020-06-04 08:25:09] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 14 ms returned sat
[2020-06-04 08:25:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:25:09] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2020-06-04 08:25:09] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2020-06-04 08:25:09] [INFO ] Computed and/alt/rep : 508/11584/508 causal constraints in 32 ms.
[2020-06-04 08:25:30] [INFO ] Added : 380 causal constraints over 76 iterations in 20245 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 216 ms.
[2020-06-04 08:25:30] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2020-06-04 08:25:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 47 ms.
[2020-06-04 08:25:31] [INFO ] Flatten gal took : 296 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ EnergyBus-PT-none @ 3570 seconds

FORMULA EnergyBus-PT-none-ReachabilityFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EnergyBus-PT-none-ReachabilityFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EnergyBus-PT-none-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EnergyBus-PT-none-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EnergyBus-PT-none-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EnergyBus-PT-none-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EnergyBus-PT-none-ReachabilityFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2527
rslt: Output for ReachabilityFireability @ EnergyBus-PT-none

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A (G (((p6 <= 0) OR (p8 <= 0) OR (p27 <= 0) OR (p30 <= 0) OR (p48 <= 0) OR (p52 <= 0) OR (p59 <= 0) OR (2 <= p68) OR (p68 <= 0))))",
"processed_size": 138,
"rewrites": 2
},
"result":
{
"edges": 312114,
"markings": 125608,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 9,
"problems": 9
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 762
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p6) AND (1 <= p8) AND (1 <= p22) AND (1 <= p25) AND (1 <= p40) AND (1 <= p50) AND (1 <= p59) AND (p68 <= 1) AND (1 <= p68))))",
"processed_size": 138,
"rewrites": 1
},
"result":
{
"edges": 8696,
"markings": 4798,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 9,
"problems": 9
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1017
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p6) AND (1 <= p8) AND (1 <= p27) AND (1 <= p30) AND (1 <= p36) AND (1 <= p50) AND (1 <= p58) AND (1 <= p72))))",
"processed_size": 123,
"rewrites": 1
},
"result":
{
"edges": 402,
"markings": 315,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 8
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1525
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 5,
"aneg": 0,
"comp": 25,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 25,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p6) AND (1 <= p8) AND (1 <= p27) AND (1 <= p30) AND (1 <= p36) AND (1 <= p52) AND (1 <= p59) AND (1 <= p74) AND ((((p45 <= 0) OR (p55 <= 0) OR (p78 <= 0)) AND ((p37 <= 0) OR (p55 <= 0) OR (p58 <= 0) OR (p75 <= 0))) OR (((p22 <= 0) OR (p25 <= 0) OR (p55 <= 0) OR (p58 <= 0) OR (p72 <= 0)) AND ((p22 <= 0) OR (p25 <= 0) OR (p38 <= 0) OR (p54 <= 0) OR (p71 <= 0)))))))",
"processed_size": 392,
"rewrites": 1
},
"result":
{
"edges": 171726,
"markings": 73289,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 370,
"problems": 37
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3048
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 46,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 46,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "A (G (((p6 <= 0) OR (p8 <= 0) OR (p27 <= 0) OR (p30 <= 0) OR (p36 <= 0) OR (p50 <= 0) OR (p59 <= 0) OR (p74 <= 0) OR ((1 <= p6) AND (1 <= p8) AND (1 <= p22) AND (1 <= p25) AND (1 <= p48) AND (1 <= p50) AND (1 <= p58) AND (p68 <= 1) AND (1 <= p68)) OR ((1 <= p6) AND (1 <= p8) AND (1 <= p22) AND (1 <= p25) AND (1 <= p32) AND (1 <= p54) AND (1 <= p58) AND (1 <= p74)) OR ((1 <= p6) AND (1 <= p8) AND (1 <= p27) AND (1 <= p30) AND (1 <= p34) AND (1 <= p55) AND (1 <= p59) AND (1 <= p79)) OR ((1 <= p6) AND (1 <= p8) AND (1 <= p27) AND (1 <= p30) AND (1 <= p39) AND (1 <= p50) AND (1 <= p58) AND (1 <= p72) AND (1 <= p33) AND (1 <= p52) AND (1 <= p59) AND (p68 <= 1) AND (1 <= p68)))))",
"processed_size": 693,
"rewrites": 2
},
"result":
{
"edges": 165201,
"markings": 72785,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 7560,
"problems": 630
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A (G (((p6 <= 0) OR (p8 <= 0) OR (p27 <= 0) OR (p30 <= 0) OR (p39 <= 0) OR (p54 <= 0) OR (p59 <= 0) OR (p71 <= 0))))",
"processed_size": 123,
"rewrites": 2
},
"result":
{
"edges": 49620687,
"markings": 15752344,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 8
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 4528,
"runtime": 1043.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 26457,
"conflict_clusters": 18,
"places": 83,
"places_significant": 67,
"singleton_clusters": 0,
"transitions": 1728
},
"result":
{
"preliminary_value": "no no yes yes yes yes no ",
"value": "no no yes yes yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1811/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 83
lola: finding significant places
lola: 83 places, 1728 transitions, 67 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: A (G (((p6 <= 0) OR (p8 <= 0) OR (p27 <= 0) OR (p30 <= 0) OR (p39 <= 0) OR (p54 <= 0) OR (p59 <= 0) OR (p71 <= 0)))) : A (G (((p6 <= 0) OR (p8 <= 0) OR (p27 <= 0) OR (p30 <= 0) OR (p48 <= 0) OR (p52 <= 0) OR (p59 <= 0) OR (2 <= p68) OR (p68 <= 0)))) : E (F (((1 <= p6) AND (1 <= p8) AND (1 <= p22) AND (1 <= p25) AND (1 <= p42) AND (1 <= p52) AND (1 <= p58) AND (1 <= p79)))) : E (F (((1 <= p6) AND (1 <= p8) AND (1 <= p22) AND (1 <= p25) AND (1 <= p40) AND (1 <= p50) AND (1 <= p59) AND (p68 <= 1) AND (1 <= p68)))) : E (F (((1 <= p6) AND (1 <= p8) AND (1 <= p27) AND (1 <= p30) AND (1 <= p36) AND (1 <= p52) AND (1 <= p59) AND (1 <= p74) AND ((((p45 <= 0) OR (p55 <= 0) OR (p78 <= 0)) AND ((p37 <= 0) OR (p55 <= 0) OR (p58 <= 0) OR (p75 <= 0))) OR (((p22 <= 0) OR (p25 <= 0) OR (p55 <= 0) OR (p58 <= 0) OR (p72 <= 0)) AND ((p22 <= 0) OR (p25 <= 0) OR (p38 <= 0) OR (p54 <= 0) OR (p71 <= 0))))))) : E (F (((1 <= p6) AND (1 <= p8) AND (1 <= p27) AND (1 <= p30) AND (1 <= p36) AND (1 <= p50) AND (1 <= p58) AND (1 <= p72)))) : A (G (((p6 <= 0) OR (p8 <= 0) OR (p27 <= 0) OR (p30 <= 0) OR (p36 <= 0) OR (p50 <= 0) OR (p59 <= 0) OR (p74 <= 0) OR ((1 <= p6) AND (1 <= p8) AND (1 <= p22) AND (1 <= p25) AND (1 <= p48) AND (1 <= p50) AND (1 <= p58) AND (p68 <= 1) AND (1 <= p68)) OR ((1 <= p6) AND (1 <= p8) AND (1 <= p22) AND (1 <= p25) AND (1 <= p32) AND (1 <= p54) AND (1 <= p58) AND (1 <= p74)) OR ((1 <= p6) AND (1 <= p8) AND (1 <= p27) AND (1 <= p30) AND (1 <= p34) AND (1 <= p55) AND (1 <= p59) AND (1 <= p79)) OR ((1 <= p6) AND (1 <= p8) AND (1 <= p27) AND (1 <= p30) AND (1 <= p39) AND (1 <= p50) AND (1 <= p58) AND (1 <= p72) AND (1 <= p33) AND (1 <= p52) AND (1 <= p59) AND (p68 <= 1) AND (1 <= p68)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p6 <= 0) OR (p8 <= 0) OR (p27 <= 0) OR (p30 <= 0) OR (p39 <= 0) OR (p54 <= 0) OR (p59 <= 0) OR (p71 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p6 <= 0) OR (p8 <= 0) OR (p27 <= 0) OR (p30 <= 0) OR (p39 <= 0) OR (p54 <= 0) OR (p59 <= 0) OR (p71 <= 0))))
lola: processed formula length: 123
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p6) AND (1 <= p8) AND (1 <= p27) AND (1 <= p30) AND (1 <= p39) AND (1 <= p54) AND (1 <= p59) AND (1 <= p71))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 149589 markings, 364067 edges, 29918 markings/sec, 0 secs
lola: sara is running 5 secs || 305757 markings, 847831 edges, 31234 markings/sec, 5 secs
lola: sara is running 10 secs || 459792 markings, 1301219 edges, 30807 markings/sec, 10 secs
lola: sara is running 15 secs || 610882 markings, 1758510 edges, 30218 markings/sec, 15 secs
lola: sara is running 20 secs || 761710 markings, 2289986 edges, 30166 markings/sec, 20 secs
lola: sara is running 25 secs || 915941 markings, 2863880 edges, 30846 markings/sec, 25 secs
lola: sara is running 30 secs || 1058398 markings, 3386532 edges, 28491 markings/sec, 30 secs
lola: sara is running 35 secs || 1204365 markings, 3930956 edges, 29193 markings/sec, 35 secs
lola: sara is running 40 secs || 1365106 markings, 4534717 edges, 32148 markings/sec, 40 secs
lola: sara is running 45 secs || 1508884 markings, 5099804 edges, 28756 markings/sec, 45 secs
lola: sara is running 50 secs || 1645749 markings, 5641303 edges, 27373 markings/sec, 50 secs
lola: sara is running 55 secs || 1775285 markings, 6162763 edges, 25907 markings/sec, 55 secs
sara: warning, failure of lp_solve (at job 12293)
lola: sara is running 60 secs || 1919827 markings, 6740040 edges, 28908 markings/sec, 60 secs
lola: sara is running 65 secs || 2064696 markings, 7294998 edges, 28974 markings/sec, 65 secs
lola: sara is running 70 secs || 2212023 markings, 7873896 edges, 29465 markings/sec, 70 secs
lola: sara is running 75 secs || 2357536 markings, 8436859 edges, 29103 markings/sec, 75 secs
lola: sara is running 80 secs || 2499733 markings, 8991377 edges, 28439 markings/sec, 80 secs
lola: sara is running 85 secs || 2658425 markings, 9731520 edges, 31738 markings/sec, 85 secs
lola: sara is running 90 secs || 2823431 markings, 10282858 edges, 33001 markings/sec, 90 secs
lola: sara is running 95 secs || 2992055 markings, 10717256 edges, 33725 markings/sec, 95 secs
lola: sara is running 100 secs || 3142147 markings, 11187939 edges, 30018 markings/sec, 100 secs
lola: sara is running 105 secs || 3291896 markings, 11660839 edges, 29950 markings/sec, 105 secs
lola: sara is running 110 secs || 3443220 markings, 12129285 edges, 30265 markings/sec, 110 secs
lola: sara is running 115 secs || 3589277 markings, 12615289 edges, 29211 markings/sec, 115 secs
lola: sara is running 120 secs || 3725431 markings, 13045980 edges, 27231 markings/sec, 120 secs
lola: sara is running 125 secs || 3861877 markings, 13478653 edges, 27289 markings/sec, 125 secs
lola: sara is running 130 secs || 4020642 markings, 13954069 edges, 31753 markings/sec, 130 secs
lola: sara is running 135 secs || 4188271 markings, 14380729 edges, 33526 markings/sec, 135 secs
lola: sara is running 140 secs || 4346858 markings, 14861407 edges, 31717 markings/sec, 140 secs
lola: sara is running 145 secs || 4503268 markings, 15359614 edges, 31282 markings/sec, 145 secs
lola: sara is running 150 secs || 4660600 markings, 15853434 edges, 31466 markings/sec, 150 secs
lola: sara is running 155 secs || 4819168 markings, 16371180 edges, 31714 markings/sec, 155 secs
lola: sara is running 160 secs || 4968222 markings, 16869141 edges, 29811 markings/sec, 160 secs
lola: sara is running 165 secs || 5123528 markings, 17376962 edges, 31061 markings/sec, 165 secs
lola: sara is running 170 secs || 5280454 markings, 17877349 edges, 31385 markings/sec, 170 secs
lola: sara is running 175 secs || 5435130 markings, 18356186 edges, 30935 markings/sec, 175 secs
lola: sara is running 180 secs || 5599429 markings, 18805904 edges, 32860 markings/sec, 180 secs
lola: sara is running 185 secs || 5766110 markings, 19249960 edges, 33336 markings/sec, 185 secs
lola: sara is running 190 secs || 5917096 markings, 19730839 edges, 30197 markings/sec, 190 secs
lola: sara is running 195 secs || 6069299 markings, 20209115 edges, 30441 markings/sec, 195 secs
lola: sara is running 200 secs || 6225429 markings, 20697919 edges, 31226 markings/sec, 200 secs
lola: sara is running 205 secs || 6369112 markings, 21166061 edges, 28737 markings/sec, 205 secs
lola: sara is running 210 secs || 6519792 markings, 21651900 edges, 30136 markings/sec, 210 secs
lola: sara is running 215 secs || 6669446 markings, 22128885 edges, 29931 markings/sec, 215 secs
lola: sara is running 220 secs || 6830999 markings, 22608565 edges, 32311 markings/sec, 220 secs
lola: sara is running 225 secs || 6992384 markings, 23052436 edges, 32277 markings/sec, 225 secs
lola: sara is running 230 secs || 7162118 markings, 23546196 edges, 33947 markings/sec, 230 secs
lola: sara is running 235 secs || 7317501 markings, 24038669 edges, 31077 markings/sec, 235 secs
lola: sara is running 240 secs || 7472318 markings, 24535381 edges, 30963 markings/sec, 240 secs
lola: sara is running 245 secs || 7636294 markings, 25058159 edges, 32795 markings/sec, 245 secs
lola: sara is running 250 secs || 7783694 markings, 25539986 edges, 29480 markings/sec, 250 secs
lola: sara is running 255 secs || 7936806 markings, 26056088 edges, 30622 markings/sec, 255 secs
lola: sara is running 260 secs || 8094142 markings, 26558357 edges, 31467 markings/sec, 260 secs
lola: sara is running 265 secs || 8239518 markings, 27031184 edges, 29075 markings/sec, 265 secs
lola: sara is running 270 secs || 8395512 markings, 27483391 edges, 31199 markings/sec, 270 secs
lola: sara is running 275 secs || 8561262 markings, 27900597 edges, 33150 markings/sec, 275 secs
lola: sara is running 280 secs || 8725273 markings, 28330795 edges, 32802 markings/sec, 280 secs
lola: sara is running 285 secs || 8886712 markings, 28776515 edges, 32288 markings/sec, 285 secs
lola: sara is running 290 secs || 9043841 markings, 29213487 edges, 31426 markings/sec, 290 secs
lola: sara is running 295 secs || 9200406 markings, 29653765 edges, 31313 markings/sec, 295 secs
lola: sara is running 300 secs || 9357133 markings, 30099325 edges, 31345 markings/sec, 300 secs
lola: sara is running 305 secs || 9519439 markings, 30540176 edges, 32461 markings/sec, 305 secs
lola: sara is running 310 secs || 9656101 markings, 30923911 edges, 27332 markings/sec, 310 secs
lola: sara is running 315 secs || 9808596 markings, 31373218 edges, 30499 markings/sec, 315 secs
lola: sara is running 320 secs || 9959180 markings, 31834102 edges, 30117 markings/sec, 320 secs
lola: sara is running 325 secs || 10114712 markings, 32282042 edges, 31106 markings/sec, 325 secs
lola: sara is running 330 secs || 10269675 markings, 32771417 edges, 30993 markings/sec, 330 secs
lola: sara is running 335 secs || 10431196 markings, 33176294 edges, 32304 markings/sec, 335 secs
lola: sara is running 340 secs || 10595058 markings, 33615914 edges, 32772 markings/sec, 340 secs
lola: sara is running 345 secs || 10750399 markings, 34097031 edges, 31068 markings/sec, 345 secs
lola: sara is running 350 secs || 10908661 markings, 34591610 edges, 31652 markings/sec, 350 secs
lola: sara is running 355 secs || 11076456 markings, 35115687 edges, 33559 markings/sec, 355 secs
lola: sara is running 360 secs || 11232828 markings, 35592586 edges, 31274 markings/sec, 360 secs
lola: sara is running 365 secs || 11383485 markings, 36081492 edges, 30131 markings/sec, 365 secs
lola: sara is running 370 secs || 11541490 markings, 36590573 edges, 31601 markings/sec, 370 secs
lola: sara is running 375 secs || 11695238 markings, 37089236 edges, 30750 markings/sec, 375 secs
lola: sara is running 380 secs || 11849146 markings, 37565421 edges, 30782 markings/sec, 380 secs
lola: sara is running 385 secs || 12011997 markings, 38024799 edges, 32570 markings/sec, 385 secs
lola: sara is running 390 secs || 12174124 markings, 38448054 edges, 32425 markings/sec, 390 secs
lola: sara is running 395 secs || 12339694 markings, 38887384 edges, 33114 markings/sec, 395 secs
lola: sara is running 400 secs || 12499306 markings, 39316351 edges, 31922 markings/sec, 400 secs
lola: sara is running 405 secs || 12653223 markings, 39755242 edges, 30783 markings/sec, 405 secs
lola: sara is running 410 secs || 12810898 markings, 40198975 edges, 31535 markings/sec, 410 secs
lola: sara is running 415 secs || 12968007 markings, 40646779 edges, 31422 markings/sec, 415 secs
lola: sara is running 420 secs || 13125745 markings, 41084327 edges, 31548 markings/sec, 420 secs
lola: sara is running 425 secs || 13276014 markings, 41529471 edges, 30054 markings/sec, 425 secs
lola: sara is running 430 secs || 13430760 markings, 41995726 edges, 30949 markings/sec, 430 secs
lola: sara is running 435 secs || 13587367 markings, 42450700 edges, 31321 markings/sec, 435 secs
lola: sara is running 440 secs || 13744388 markings, 42904189 edges, 31404 markings/sec, 440 secs
lola: sara is running 445 secs || 13903689 markings, 43388770 edges, 31860 markings/sec, 445 secs
lola: sara is running 450 secs || 14067310 markings, 43842481 edges, 32724 markings/sec, 450 secs
lola: sara is running 455 secs || 14207174 markings, 44223352 edges, 27973 markings/sec, 455 secs
lola: sara is running 460 secs || 14337505 markings, 44610566 edges, 26066 markings/sec, 460 secs
lola: sara is running 465 secs || 14478356 markings, 45075290 edges, 28170 markings/sec, 465 secs
lola: sara is running 470 secs || 14611256 markings, 45488048 edges, 26580 markings/sec, 470 secs
lola: sara is running 475 secs || 14748679 markings, 45921644 edges, 27485 markings/sec, 475 secs
lola: sara is running 480 secs || 14889976 markings, 46425666 edges, 28259 markings/sec, 480 secs
lola: sara is running 485 secs || 15042015 markings, 46913905 edges, 30408 markings/sec, 485 secs
lola: sara is running 490 secs || 15195782 markings, 47411741 edges, 30753 markings/sec, 490 secs
lola: sara is running 495 secs || 15336813 markings, 47863496 edges, 28206 markings/sec, 495 secs
lola: sara is running 500 secs || 15481826 markings, 48341257 edges, 29003 markings/sec, 500 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 561376 KB
lola: time consumption: 514 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p6 <= 0) OR (p8 <= 0) OR (p27 <= 0) OR (p30 <= 0) OR (p48 <= 0) OR (p52 <= 0) OR (p59 <= 0) OR (2 <= p68) OR (p68 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p6 <= 0) OR (p8 <= 0) OR (p27 <= 0) OR (p30 <= 0) OR (p48 <= 0) OR (p52 <= 0) OR (p59 <= 0) OR (2 <= p68) OR (p68 <= 0))))
lola: processed formula length: 138
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p6) AND (1 <= p8) AND (1 <= p27) AND (1 <= p30) AND (1 <= p48) AND (1 <= p52) AND (1 <= p59) AND (p68 <= 1) AND (1 <= p68))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 9 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 125608 markings, 312114 edges
lola: ========================================
lola: subprocess 2 will run for 610 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p6) AND (1 <= p8) AND (1 <= p22) AND (1 <= p25) AND (1 <= p42) AND (1 <= p52) AND (1 <= p58) AND (1 <= p79))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p6) AND (1 <= p8) AND (1 <= p22) AND (1 <= p25) AND (1 <= p42) AND (1 <= p52) AND (1 <= p58) AND (1 <= p79))))
lola: processed formula length: 123
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p6) AND (1 <= p8) AND (1 <= p22) AND (1 <= p25) AND (1 <= p42) AND (1 <= p52) AND (1 <= p58) AND (1 <= p79))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 643 markings, 852 edges
lola: ========================================
lola: subprocess 3 will run for 762 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p6) AND (1 <= p8) AND (1 <= p22) AND (1 <= p25) AND (1 <= p40) AND (1 <= p50) AND (1 <= p59) AND (p68 <= 1) AND (1 <= p68))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p6) AND (1 <= p8) AND (1 <= p22) AND (1 <= p25) AND (1 <= p40) AND (1 <= p50) AND (1 <= p59) AND (p68 <= 1) AND (1 <= p68))))
lola: processed formula length: 138
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p6) AND (1 <= p8) AND (1 <= p22) AND (1 <= p25) AND (1 <= p40) AND (1 <= p50) AND (1 <= p59) AND (p68 <= 1) AND (1 <= p68))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 9 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-3-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4798 markings, 8696 edges
lola: ========================================
lola: subprocess 4 will run for 1017 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p6) AND (1 <= p8) AND (1 <= p27) AND (1 <= p30) AND (1 <= p36) AND (1 <= p50) AND (1 <= p58) AND (1 <= p72))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p6) AND (1 <= p8) AND (1 <= p27) AND (1 <= p30) AND (1 <= p36) AND (1 <= p50) AND (1 <= p58) AND (1 <= p72))))
lola: processed formula length: 123
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p6) AND (1 <= p8) AND (1 <= p27) AND (1 <= p30) AND (1 <= p36) AND (1 <= p50) AND (1 <= p58) AND (1 <= p72))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 315 markings, 402 edges
lola: ========================================
lola: subprocess 5 will run for 1525 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p6) AND (1 <= p8) AND (1 <= p27) AND (1 <= p30) AND (1 <= p36) AND (1 <= p52) AND (1 <= p59) AND (1 <= p74) AND ((((p45 <= 0) OR (p55 <= 0) OR (p78 <= 0)) AND ((p37 <= 0) OR (p55 <= 0) OR (p58 <= 0) OR (p75 <= 0))) OR (((p22 <= 0) OR (p25 <= 0) OR (p55 <= 0) OR (p58 <= 0) OR (p72 <= 0)) AND ((p22 <= 0) OR (p25 <= 0) OR (p38 <= 0) OR (p54 <= 0) OR (p71 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p6) AND (1 <= p8) AND (1 <= p27) AND (1 <= p30) AND (1 <= p36) AND (1 <= p52) AND (1 <= p59) AND (1 <= p74) AND ((((p45 <= 0) OR (p55 <= 0) OR (p78 <= 0)) AND ((p37 <= 0) OR (p55 <= 0) OR (p58 <= 0) OR (p75 <= 0))) OR (((p22 <= 0) OR (p25 <= 0) OR (p55 <= 0) OR (p58 <= 0) OR (p72 <= 0)) AND ((p22 <= 0) OR (p25 <= 0) OR (p38 <= 0) OR (p54 <= 0) OR (p71 <= 0)))))))
lola: processed formula length: 392
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p6) AND (1 <= p8) AND (1 <= p27) AND (1 <= p30) AND (1 <= p36) AND (1 <= p52) AND (1 <= p59) AND (1 <= p74) AND ((((p45 <= 0) OR (p55 <= 0) OR (p78 <= 0)) AND ((p37 <= 0) OR (p55 <= 0) OR (p58 <= 0) OR (p75 <= 0))) OR (((p22 <= 0) OR (p25 <= 0) OR (p55 <= 0) OR (p58 <= 0) OR (p72 <= 0)) AND ((p22 <= 0) OR (p25 <= 0) OR (p38 <= 0) OR (p54 <= 0) OR (p71 <= 0)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 370 literals and 37 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-5-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 73289 markings, 171726 edges
lola: ========================================
lola: subprocess 6 will run for 3048 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p6 <= 0) OR (p8 <= 0) OR (p27 <= 0) OR (p30 <= 0) OR (p36 <= 0) OR (p50 <= 0) OR (p59 <= 0) OR (p74 <= 0) OR ((1 <= p6) AND (1 <= p8) AND (1 <= p22) AND (1 <= p25) AND (1 <= p48) AND (1 <= p50) AND (1 <= p58) AND (p68 <= 1) AND (1 <= p68)) OR ((1 <= p6) AND (1 <= p8) AND (1 <= p22) AND (1 <= p25) AND (1 <= p32) AND (1 <= p54) AND (1 <= p58) AND (1 <= p74)) OR ((1 <= p6) AND (1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p6 <= 0) OR (p8 <= 0) OR (p27 <= 0) OR (p30 <= 0) OR (p36 <= 0) OR (p50 <= 0) OR (p59 <= 0) OR (p74 <= 0) OR ((1 <= p6) AND (1 <= p8) AND (1 <= p22) AND (1 <= p25) AND (1 <= p48) AND (1 <= p50) AND (1 <= p58) AND (p68 <= 1) AND (1 <= p68)) OR ((1 <= p6) AND (1 <= p8) AND (1 <= p22) AND (1 <= p25) AND (1 <= p32) AND (1 <= p54) AND (1 <= p58) AND (1 <= p74)) OR ((1 <= p6) AND (1 <=... (shortened)
lola: processed formula length: 693
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p6) AND (1 <= p8) AND (1 <= p27) AND (1 <= p30) AND (1 <= p36) AND (1 <= p50) AND (1 <= p59) AND (1 <= p74) AND ((p6 <= 0) OR (p8 <= 0) OR (p22 <= 0) OR (p25 <= 0) OR (p48 <= 0) OR (p50 <= 0) OR (p58 <= 0) OR (2 <= p68) OR (p68 <= 0)) AND ((p6 <= 0) OR (p8 <= 0) OR (p22 <= 0) OR (p25 <= 0) OR (p32 <= 0) OR (p54 <= 0) OR (p58 <= 0) OR (p74 <= 0)) AND ((p6 <= 0) OR (p8 <= 0) OR (p27 <= 0) OR (p30 <= 0) OR (p34 <= 0) OR (p55 <= 0) OR (p59 <= 0) OR (p79 <= 0)) AND ((p6 <= 0) OR (p8 <= 0) OR (p27 <= 0) OR (p30 <= 0) OR (p39 <= 0) OR (p50 <= 0) OR (p58 <= 0) OR (p72 <= 0) OR (p33 <= 0) OR (p52 <= 0) OR (p59 <= 0) OR (2 <= p68) OR (p68 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 7560 literals and 630 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 72785 markings, 165201 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (((p6 <= 0) OR (p8 <= 0) OR (p27 <= 0) OR (p30 <= 0) OR (p39 <= 0) OR (p54 <= 0) OR (p59 <= 0) OR (p71 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p6 <= 0) OR (p8 <= 0) OR (p27 <= 0) OR (p30 <= 0) OR (p39 <= 0) OR (p54 <= 0) OR (p59 <= 0) OR (p71 <= 0))))
lola: processed formula length: 123
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p6) AND (1 <= p8) AND (1 <= p27) AND (1 <= p30) AND (1 <= p39) AND (1 <= p54) AND (1 <= p59) AND (1 <= p71))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-7-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 145997 markings, 353659 edges, 29199 markings/sec, 0 secs
lola: sara is running 5 secs || 306461 markings, 850519 edges, 32093 markings/sec, 5 secs
lola: sara is running 10 secs || 468218 markings, 1331324 edges, 32351 markings/sec, 10 secs
lola: sara is running 15 secs || 630517 markings, 1820500 edges, 32460 markings/sec, 15 secs
lola: sara is running 20 secs || 783182 markings, 2387028 edges, 30533 markings/sec, 20 secs
lola: sara is running 25 secs || 939748 markings, 2947968 edges, 31313 markings/sec, 25 secs
lola: sara is running 30 secs || 1094899 markings, 3511587 edges, 31030 markings/sec, 30 secs
lola: sara is running 35 secs || 1245204 markings, 4072168 edges, 30061 markings/sec, 35 secs
lola: sara is running 40 secs || 1401435 markings, 4679383 edges, 31246 markings/sec, 40 secs
lola: sara is running 45 secs || 1543834 markings, 5242611 edges, 28480 markings/sec, 45 secs
lola: sara is running 50 secs || 1684902 markings, 5788581 edges, 28214 markings/sec, 50 secs
sara: warning, failure of lp_solve (at job 12293)
lola: sara is running 55 secs || 1821893 markings, 6376050 edges, 27398 markings/sec, 55 secs
lola: sara is running 60 secs || 1974656 markings, 6944858 edges, 30553 markings/sec, 60 secs
lola: sara is running 65 secs || 2118397 markings, 7501036 edges, 28748 markings/sec, 65 secs
lola: sara is running 70 secs || 2260847 markings, 8071218 edges, 28490 markings/sec, 70 secs
lola: sara is running 75 secs || 2410000 markings, 8637871 edges, 29831 markings/sec, 75 secs
lola: sara is running 80 secs || 2553326 markings, 9208784 edges, 28665 markings/sec, 80 secs
lola: sara is running 85 secs || 2712829 markings, 10003782 edges, 31901 markings/sec, 85 secs
lola: sara is running 90 secs || 2878469 markings, 10417129 edges, 33128 markings/sec, 90 secs
lola: sara is running 95 secs || 3040570 markings, 10868129 edges, 32420 markings/sec, 95 secs
lola: sara is running 100 secs || 3181021 markings, 11309317 edges, 28090 markings/sec, 100 secs
lola: sara is running 105 secs || 3325666 markings, 11759584 edges, 28929 markings/sec, 105 secs
lola: sara is running 110 secs || 3473916 markings, 12223317 edges, 29650 markings/sec, 110 secs
lola: sara is running 115 secs || 3612214 markings, 12689285 edges, 27660 markings/sec, 115 secs
lola: sara is running 120 secs || 3756417 markings, 13146972 edges, 28841 markings/sec, 120 secs
lola: sara is running 125 secs || 3902219 markings, 13602981 edges, 29160 markings/sec, 125 secs
lola: sara is running 130 secs || 4062132 markings, 14059333 edges, 31983 markings/sec, 130 secs
lola: sara is running 135 secs || 4227319 markings, 14499818 edges, 33037 markings/sec, 135 secs
lola: sara is running 140 secs || 4378861 markings, 14973252 edges, 30308 markings/sec, 140 secs
lola: sara is running 145 secs || 4534565 markings, 15462515 edges, 31141 markings/sec, 145 secs
lola: sara is running 150 secs || 4699069 markings, 15980927 edges, 32901 markings/sec, 150 secs
lola: sara is running 155 secs || 4848499 markings, 16463370 edges, 29886 markings/sec, 155 secs
lola: sara is running 160 secs || 4996128 markings, 16961872 edges, 29526 markings/sec, 160 secs
lola: sara is running 165 secs || 5151670 markings, 17465693 edges, 31108 markings/sec, 165 secs
lola: sara is running 170 secs || 5304300 markings, 17954636 edges, 30526 markings/sec, 170 secs
lola: sara is running 175 secs || 5446810 markings, 18403579 edges, 28502 markings/sec, 175 secs
lola: sara is running 180 secs || 5598629 markings, 18803363 edges, 30364 markings/sec, 180 secs
lola: sara is running 185 secs || 5764496 markings, 19245546 edges, 33173 markings/sec, 185 secs
lola: sara is running 190 secs || 5915143 markings, 19725424 edges, 30129 markings/sec, 190 secs
lola: sara is running 195 secs || 6055471 markings, 20157618 edges, 28066 markings/sec, 195 secs
lola: sara is running 200 secs || 6198944 markings, 20610465 edges, 28695 markings/sec, 200 secs
lola: sara is running 205 secs || 6343763 markings, 21068774 edges, 28964 markings/sec, 205 secs
lola: sara is running 210 secs || 6484485 markings, 21537526 edges, 28144 markings/sec, 210 secs
lola: sara is running 215 secs || 6622375 markings, 21973425 edges, 27578 markings/sec, 215 secs
lola: sara is running 220 secs || 6769051 markings, 22437546 edges, 29335 markings/sec, 220 secs
lola: sara is running 225 secs || 6926241 markings, 22869782 edges, 31438 markings/sec, 225 secs
lola: sara is running 230 secs || 7081138 markings, 23292859 edges, 30979 markings/sec, 230 secs
lola: sara is running 235 secs || 7230098 markings, 23762070 edges, 29792 markings/sec, 235 secs
lola: sara is running 240 secs || 7377174 markings, 24234256 edges, 29415 markings/sec, 240 secs
lola: sara is running 245 secs || 7542686 markings, 24756204 edges, 33102 markings/sec, 245 secs
lola: sara is running 250 secs || 7698194 markings, 25257577 edges, 31102 markings/sec, 250 secs
lola: sara is running 255 secs || 7847423 markings, 25764587 edges, 29846 markings/sec, 255 secs
lola: sara is running 260 secs || 8004429 markings, 26273641 edges, 31401 markings/sec, 260 secs
lola: sara is running 265 secs || 8160949 markings, 26782429 edges, 31304 markings/sec, 265 secs
lola: sara is running 270 secs || 8313643 markings, 27272149 edges, 30539 markings/sec, 270 secs
lola: sara is running 275 secs || 8482804 markings, 27708640 edges, 33832 markings/sec, 275 secs
lola: sara is running 280 secs || 8652041 markings, 28125630 edges, 33847 markings/sec, 280 secs
lola: sara is running 285 secs || 8812410 markings, 28564205 edges, 32074 markings/sec, 285 secs
lola: sara is running 290 secs || 8972588 markings, 29005731 edges, 32036 markings/sec, 290 secs
lola: sara is running 295 secs || 9128642 markings, 29442322 edges, 31211 markings/sec, 295 secs
lola: sara is running 300 secs || 9285321 markings, 29893803 edges, 31336 markings/sec, 300 secs
lola: sara is running 305 secs || 9443378 markings, 30331028 edges, 31611 markings/sec, 305 secs
lola: sara is running 310 secs || 9602762 markings, 30777772 edges, 31877 markings/sec, 310 secs
lola: sara is running 315 secs || 9763822 markings, 31221351 edges, 32212 markings/sec, 315 secs
lola: sara is running 320 secs || 9910626 markings, 31693459 edges, 29361 markings/sec, 320 secs
lola: sara is running 325 secs || 10066858 markings, 32145814 edges, 31246 markings/sec, 325 secs
lola: sara is running 330 secs || 10219825 markings, 32603673 edges, 30593 markings/sec, 330 secs
lola: sara is running 335 secs || 10384106 markings, 33057434 edges, 32856 markings/sec, 335 secs
lola: sara is running 340 secs || 10542324 markings, 33468571 edges, 31644 markings/sec, 340 secs
lola: sara is running 345 secs || 10697674 markings, 33937450 edges, 31070 markings/sec, 345 secs
lola: sara is running 350 secs || 10849215 markings, 34410318 edges, 30308 markings/sec, 350 secs
lola: sara is running 355 secs || 11010498 markings, 34910431 edges, 32257 markings/sec, 355 secs
lola: sara is running 360 secs || 11181006 markings, 35426429 edges, 34102 markings/sec, 360 secs
lola: sara is running 365 secs || 11334035 markings, 35893570 edges, 30606 markings/sec, 365 secs
lola: sara is running 370 secs || 11483489 markings, 36404360 edges, 29891 markings/sec, 370 secs
lola: sara is running 375 secs || 11638595 markings, 36905759 edges, 31021 markings/sec, 375 secs
lola: sara is running 380 secs || 11784241 markings, 37365951 edges, 29129 markings/sec, 380 secs
lola: sara is running 385 secs || 11932827 markings, 37815579 edges, 29717 markings/sec, 385 secs
lola: sara is running 390 secs || 12096307 markings, 38245963 edges, 32696 markings/sec, 390 secs
lola: sara is running 395 secs || 12262972 markings, 38673919 edges, 33333 markings/sec, 395 secs
lola: sara is running 400 secs || 12424600 markings, 39103773 edges, 32326 markings/sec, 400 secs
lola: sara is running 405 secs || 12579264 markings, 39551395 edges, 30933 markings/sec, 405 secs
lola: sara is running 410 secs || 12726882 markings, 39957725 edges, 29524 markings/sec, 410 secs
lola: sara is running 415 secs || 12882162 markings, 40404537 edges, 31056 markings/sec, 415 secs
lola: sara is running 420 secs || 13032009 markings, 40833480 edges, 29969 markings/sec, 420 secs
lola: sara is running 425 secs || 13192605 markings, 41263052 edges, 32119 markings/sec, 425 secs
lola: sara is running 430 secs || 13337562 markings, 41724185 edges, 28991 markings/sec, 430 secs
lola: sara is running 435 secs || 13493141 markings, 42175732 edges, 31116 markings/sec, 435 secs
lola: sara is running 440 secs || 13648823 markings, 42629086 edges, 31136 markings/sec, 440 secs
lola: sara is running 445 secs || 13799804 markings, 43089424 edges, 30196 markings/sec, 445 secs
lola: sara is running 450 secs || 13937450 markings, 43484471 edges, 27529 markings/sec, 450 secs
lola: sara is running 455 secs || 14086117 markings, 43898161 edges, 29733 markings/sec, 455 secs
lola: sara is running 460 secs || 14244519 markings, 44333153 edges, 31680 markings/sec, 460 secs
lola: sara is running 465 secs || 14406668 markings, 44843503 edges, 32430 markings/sec, 465 secs
lola: sara is running 470 secs || 14552025 markings, 45303188 edges, 29071 markings/sec, 470 secs
lola: sara is running 475 secs || 14705788 markings, 45770561 edges, 30753 markings/sec, 475 secs
lola: sara is running 480 secs || 14837165 markings, 46238892 edges, 26275 markings/sec, 480 secs
lola: sara is running 485 secs || 14980760 markings, 46718628 edges, 28719 markings/sec, 485 secs
lola: sara is running 490 secs || 15133764 markings, 47214455 edges, 30601 markings/sec, 490 secs
lola: sara is running 495 secs || 15284992 markings, 47695602 edges, 30246 markings/sec, 495 secs
lola: sara is running 500 secs || 15436135 markings, 48192911 edges, 30229 markings/sec, 500 secs
lola: sara is running 505 secs || 15543648 markings, 48637390 edges, 21503 markings/sec, 505 secs
lola: sara is running 510 secs || 15664696 markings, 49194410 edges, 24210 markings/sec, 510 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 15752344 markings, 49620687 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes yes yes yes no
lola:
preliminary result: no no yes yes yes yes no
lola: memory consumption: 4528 KB
lola: time consumption: 1043 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="EnergyBus-PT-none"
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 EnergyBus-PT-none, 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 r178-tajo-158987883201007"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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