Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 151K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 10:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 10:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 22 18:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Mar 22 18:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 3.2M May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1620778584706

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-12 00:16:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-12 00:16:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 00:16:26] [INFO ] Load time of PNML (sax parser for PT used): 309 ms
[2021-05-12 00:16:26] [INFO ] Transformed 157 places.
[2021-05-12 00:16:26] [INFO ] Transformed 4430 transitions.
[2021-05-12 00:16:26] [INFO ] Found NUPN structural information;
[2021-05-12 00:16:26] [INFO ] Parsed PT model containing 157 places and 4430 transitions in 409 ms.
Deduced a syphon composed of 4 places in 33 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 87 ms.
Working with output stream class java.io.PrintStream
FORMULA EnergyBus-PT-none-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 204 ms. (steps per millisecond=49 ) 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 19 ms. (steps per millisecond=526 ) 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 25 ms. (steps per millisecond=400 ) 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 10000 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 22 ms. (steps per millisecond=454 ) 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 14 ms. (steps per millisecond=714 ) 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 42 ms. (steps per millisecond=238 ) 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 21 ms. (steps per millisecond=476 ) 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 22 ms. (steps per millisecond=454 ) 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 24 ms. (steps per millisecond=416 ) 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 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 5326655 steps, run timeout after 30001 ms. (steps per millisecond=177 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 5326655 steps, saw 388038 distinct states, run finished after 30001 ms. (steps per millisecond=177 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2021-05-12 00:16:57] [INFO ] Flow matrix only has 647 transitions (discarded 1266 similar events)
// Phase 1: matrix 647 rows 153 cols
[2021-05-12 00:16:57] [INFO ] Computed 23 place invariants in 16 ms
[2021-05-12 00:16:57] [INFO ] [Real]Absence check using 21 positive place invariants in 19 ms returned sat
[2021-05-12 00:16:57] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-12 00:16:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 00:16:57] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2021-05-12 00:16:57] [INFO ] State equation strengthened by 468 read => feed constraints.
[2021-05-12 00:16:57] [INFO ] [Real]Added 468 Read/Feed constraints in 75 ms returned sat
[2021-05-12 00:16:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 00:16:57] [INFO ] [Nat]Absence check using 21 positive place invariants in 15 ms returned sat
[2021-05-12 00:16:57] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-12 00:16:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 00:16:58] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2021-05-12 00:16:58] [INFO ] [Nat]Added 468 Read/Feed constraints in 73 ms returned sat
[2021-05-12 00:16:58] [INFO ] Deduced a trap composed of 5 places in 111 ms
[2021-05-12 00:16:58] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2021-05-12 00:16:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 288 ms
[2021-05-12 00:16:58] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 148 ms.
[2021-05-12 00:17:02] [INFO ] Added : 190 causal constraints over 38 iterations in 4378 ms. Result :(error "Solver has unexpectedly terminated")
[2021-05-12 00:17:02] [INFO ] [Real]Absence check using 21 positive place invariants in 16 ms returned sat
[2021-05-12 00:17:02] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-12 00:17:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 00:17:03] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2021-05-12 00:17:03] [INFO ] [Real]Added 468 Read/Feed constraints in 69 ms returned sat
[2021-05-12 00:17:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 00:17:03] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2021-05-12 00:17:03] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-12 00:17:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 00:17:03] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2021-05-12 00:17:03] [INFO ] [Nat]Added 468 Read/Feed constraints in 79 ms returned sat
[2021-05-12 00:17:03] [INFO ] Deduced a trap composed of 4 places in 161 ms
[2021-05-12 00:17:03] [INFO ] Deduced a trap composed of 5 places in 153 ms
[2021-05-12 00:17:04] [INFO ] Deduced a trap composed of 32 places in 164 ms
[2021-05-12 00:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 544 ms
[2021-05-12 00:17:04] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2021-05-12 00:17:04] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-12 00:17:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 00:17:04] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2021-05-12 00:17:04] [INFO ] [Real]Added 468 Read/Feed constraints in 64 ms returned sat
[2021-05-12 00:17:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 00:17:04] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2021-05-12 00:17:04] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-12 00:17:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 00:17:04] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2021-05-12 00:17:04] [INFO ] [Nat]Added 468 Read/Feed constraints in 74 ms returned sat
[2021-05-12 00:17:04] [INFO ] Deduced a trap composed of 32 places in 188 ms
[2021-05-12 00:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 200 ms
[2021-05-12 00:17:05] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2021-05-12 00:17:05] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-12 00:17:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 00:17:05] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2021-05-12 00:17:05] [INFO ] [Real]Added 468 Read/Feed constraints in 61 ms returned sat
[2021-05-12 00:17:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 00:17:05] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2021-05-12 00:17:05] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-12 00:17:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 00:17:05] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2021-05-12 00:17:05] [INFO ] [Nat]Added 468 Read/Feed constraints in 72 ms returned sat
[2021-05-12 00:17:05] [INFO ] Deduced a trap composed of 4 places in 112 ms
[2021-05-12 00:17:05] [INFO ] Deduced a trap composed of 5 places in 13 ms
[2021-05-12 00:17:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 196 ms
[2021-05-12 00:17:05] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 108 ms.
[2021-05-12 00:17:10] [INFO ] Added : 210 causal constraints over 42 iterations in 4483 ms. Result :unknown
[2021-05-12 00:17:10] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned unsat
[2021-05-12 00:17:10] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2021-05-12 00:17:10] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-12 00:17:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 00:17:10] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2021-05-12 00:17:10] [INFO ] [Real]Added 468 Read/Feed constraints in 68 ms returned sat
[2021-05-12 00:17:10] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2021-05-12 00:17:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2021-05-12 00:17:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 00:17:10] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2021-05-12 00:17:10] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-12 00:17:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 00:17:11] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2021-05-12 00:17:11] [INFO ] [Nat]Added 468 Read/Feed constraints in 89 ms returned sat
[2021-05-12 00:17:11] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2021-05-12 00:17:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2021-05-12 00:17:11] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 90 ms.
[2021-05-12 00:17:15] [INFO ] Added : 205 causal constraints over 41 iterations in 4543 ms. Result :(error "Failed to check-sat")
[2021-05-12 00:17:15] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2021-05-12 00:17:15] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-12 00:17:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 00:17:16] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2021-05-12 00:17:16] [INFO ] [Real]Added 468 Read/Feed constraints in 62 ms returned sat
[2021-05-12 00:17:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 00:17:16] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2021-05-12 00:17:16] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-12 00:17:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 00:17:16] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2021-05-12 00:17:16] [INFO ] [Nat]Added 468 Read/Feed constraints in 75 ms returned sat
[2021-05-12 00:17:16] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2021-05-12 00:17:16] [INFO ] Deduced a trap composed of 5 places in 21 ms
[2021-05-12 00:17:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
[2021-05-12 00:17:16] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 165 ms.
[2021-05-12 00:17:21] [INFO ] Added : 210 causal constraints over 42 iterations in 4482 ms. Result :unknown
[2021-05-12 00:17:21] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2021-05-12 00:17:21] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-12 00:17:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 00:17:21] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2021-05-12 00:17:21] [INFO ] [Real]Added 468 Read/Feed constraints in 64 ms returned sat
[2021-05-12 00:17:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 00:17:21] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2021-05-12 00:17:21] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-12 00:17:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 00:17:21] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2021-05-12 00:17:21] [INFO ] [Nat]Added 468 Read/Feed constraints in 87 ms returned sat
[2021-05-12 00:17:21] [INFO ] Deduced a trap composed of 5 places in 15 ms
[2021-05-12 00:17:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2021-05-12 00:17:22] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 88 ms.
[2021-05-12 00:17:26] [INFO ] Added : 210 causal constraints over 42 iterations in 4599 ms. Result :unknown
[2021-05-12 00:17:26] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned unsat
[2021-05-12 00:17:26] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2021-05-12 00:17:26] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-12 00:17:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 00:17:26] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2021-05-12 00:17:26] [INFO ] [Real]Added 468 Read/Feed constraints in 59 ms returned sat
[2021-05-12 00:17:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 00:17:26] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2021-05-12 00:17:26] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-12 00:17:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 00:17:27] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2021-05-12 00:17:27] [INFO ] [Nat]Added 468 Read/Feed constraints in 72 ms returned sat
[2021-05-12 00:17:27] [INFO ] Deduced a trap composed of 5 places in 86 ms
[2021-05-12 00:17:27] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2021-05-12 00:17:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 239 ms
[2021-05-12 00:17:27] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 116 ms.
[2021-05-12 00:17:31] [INFO ] Added : 205 causal constraints over 41 iterations in 4453 ms. Result :unknown
[2021-05-12 00:17:31] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2021-05-12 00:17:31] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-12 00:17:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 00:17:32] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2021-05-12 00:17:32] [INFO ] [Real]Added 468 Read/Feed constraints in 61 ms returned sat
[2021-05-12 00:17:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 00:17:32] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2021-05-12 00:17:32] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-12 00:17:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 00:17:32] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2021-05-12 00:17:32] [INFO ] [Nat]Added 468 Read/Feed constraints in 69 ms returned sat
[2021-05-12 00:17:32] [INFO ] Deduced a trap composed of 5 places in 14 ms
[2021-05-12 00:17:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2021-05-12 00:17:32] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 86 ms.
[2021-05-12 00:17:37] [INFO ] Added : 220 causal constraints over 44 iterations in 4638 ms. Result :unknown
[2021-05-12 00:17:37] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned unsat
FORMULA EnergyBus-PT-none-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EnergyBus-PT-none-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EnergyBus-PT-none-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EnergyBus-PT-none-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EnergyBus-PT-none-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 923700 steps, including 1000 resets, run finished after 10362 ms. (steps per millisecond=89 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1086900 steps, including 1000 resets, run finished after 10880 ms. (steps per millisecond=99 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 930000 steps, including 1000 resets, run finished after 10440 ms. (steps per millisecond=89 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 781500 steps, including 1000 resets, run finished after 8873 ms. (steps per millisecond=88 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1045500 steps, including 1000 resets, run finished after 11756 ms. (steps per millisecond=88 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 21 out of 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 1913/1913 transitions.
Graph (trivial) has 98 edges and 153 vertex of which 13 / 153 are part of one of the 4 SCC in 13 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.26 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 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 43 place count 137 transition count 1865
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 57 place count 130 transition count 1865
Symmetric choice reduction at 2 with 18 rule applications. Total rules 75 place count 130 transition count 1865
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 332 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 111 place count 112 transition count 1533
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 125 place count 105 transition count 1526
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 127 place count 105 transition count 1524
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 105 transition count 1524
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 104 transition count 1522
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 140 place count 99 transition count 1531
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 148 place count 99 transition count 1523
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 155 place count 99 transition count 1516
Reduce places removed 7 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 9 rules applied. Total rules applied 164 place count 92 transition count 1514
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 167 place count 92 transition count 1753
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 170 place count 89 transition count 1753
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 172 place count 89 transition count 1753
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 173 place count 89 transition count 1753
Drop transitions removed 79 transitions
Redundant transition composition rules discarded 79 transitions
Iterating global reduction 6 with 79 rules applied. Total rules applied 252 place count 89 transition count 1674
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 256 place count 87 transition count 1672
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 257 place count 87 transition count 1671
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 258 place count 86 transition count 1671
Applied a total of 258 rules in 1051 ms. Remains 86 /153 variables (removed 67) and now considering 1671/1913 (removed 242) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/153 places, 1671/1913 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 14414 ms. (steps per millisecond=69 ) properties seen :[1, 0, 1, 0, 1, 0, 0]
FORMULA EnergyBus-PT-none-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1798 ms. (steps per millisecond=556 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 763 ms. (steps per millisecond=1310 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 768 ms. (steps per millisecond=1302 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 837 ms. (steps per millisecond=1194 ) properties seen :[0, 0, 0, 0]
[2021-05-12 00:18:49] [INFO ] Flow matrix only has 517 transitions (discarded 1154 similar events)
// Phase 1: matrix 517 rows 86 cols
[2021-05-12 00:18:49] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-12 00:18:49] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2021-05-12 00:18:49] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2021-05-12 00:18:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 00:18:49] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2021-05-12 00:18:49] [INFO ] State equation strengthened by 453 read => feed constraints.
[2021-05-12 00:18:49] [INFO ] [Real]Added 453 Read/Feed constraints in 63 ms returned sat
[2021-05-12 00:18:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 00:18:49] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2021-05-12 00:18:49] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-12 00:18:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 00:18:49] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2021-05-12 00:18:49] [INFO ] [Nat]Added 453 Read/Feed constraints in 68 ms returned sat
[2021-05-12 00:18:49] [INFO ] Deduced a trap composed of 5 places in 193 ms
[2021-05-12 00:18:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2021-05-12 00:18:50] [INFO ] Computed and/alt/rep : 1669/65506/515 causal constraints in 81 ms.
[2021-05-12 00:19:02] [INFO ] Added : 225 causal constraints over 45 iterations in 12478 ms. Result :sat
[2021-05-12 00:19:02] [INFO ] Deduced a trap composed of 5 places in 11 ms
[2021-05-12 00:19:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
Attempting to minimize the solution found.
Minimization took 182 ms.
[2021-05-12 00:19:02] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2021-05-12 00:19:02] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-12 00:19:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 00:19:03] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2021-05-12 00:19:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 00:19:03] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-12 00:19:03] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-12 00:19:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 00:19:03] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2021-05-12 00:19:03] [INFO ] [Nat]Added 453 Read/Feed constraints in 92 ms returned sat
[2021-05-12 00:19:03] [INFO ] Deduced a trap composed of 5 places in 10 ms
[2021-05-12 00:19:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2021-05-12 00:19:03] [INFO ] Computed and/alt/rep : 1669/65506/515 causal constraints in 90 ms.
[2021-05-12 00:19:16] [INFO ] Added : 235 causal constraints over 47 iterations in 12873 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 165 ms.
[2021-05-12 00:19:16] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2021-05-12 00:19:16] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-12 00:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 00:19:16] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2021-05-12 00:19:16] [INFO ] [Real]Added 453 Read/Feed constraints in 72 ms returned sat
[2021-05-12 00:19:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 00:19:16] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-12 00:19:16] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-12 00:19:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 00:19:16] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2021-05-12 00:19:16] [INFO ] [Nat]Added 453 Read/Feed constraints in 89 ms returned sat
[2021-05-12 00:19:16] [INFO ] Deduced a trap composed of 5 places in 11 ms
[2021-05-12 00:19:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2021-05-12 00:19:17] [INFO ] Computed and/alt/rep : 1669/65506/515 causal constraints in 80 ms.
[2021-05-12 00:19:30] [INFO ] Added : 230 causal constraints over 46 iterations in 13570 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 160 ms.
[2021-05-12 00:19:30] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2021-05-12 00:19:30] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-12 00:19:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 00:19:30] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2021-05-12 00:19:30] [INFO ] [Real]Added 453 Read/Feed constraints in 59 ms returned sat
[2021-05-12 00:19:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 00:19:30] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2021-05-12 00:19:30] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-12 00:19:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 00:19:31] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2021-05-12 00:19:31] [INFO ] [Nat]Added 453 Read/Feed constraints in 67 ms returned sat
[2021-05-12 00:19:31] [INFO ] Deduced a trap composed of 5 places in 61 ms
[2021-05-12 00:19:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2021-05-12 00:19:31] [INFO ] Computed and/alt/rep : 1669/65506/515 causal constraints in 91 ms.
[2021-05-12 00:19:46] [INFO ] Added : 250 causal constraints over 50 iterations in 15211 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 178 ms.
Incomplete Parikh walk after 330200 steps, including 1000 resets, run finished after 2973 ms. (steps per millisecond=111 ) properties seen :[0, 0, 0, 1] could not realise parikh vector
FORMULA EnergyBus-PT-none-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 529600 steps, including 1000 resets, run finished after 3584 ms. (steps per millisecond=147 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 541400 steps, including 1000 resets, run finished after 3620 ms. (steps per millisecond=149 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 256100 steps, including 1000 resets, run finished after 2401 ms. (steps per millisecond=106 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 12 out of 86 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 86/86 places, 1671/1671 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 86 transition count 1670
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 85 transition count 1670
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 85 transition count 1670
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 288 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 83 transition count 1382
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 11 place count 83 transition count 1379
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 14 place count 80 transition count 1379
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 80 transition count 2018
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 79 transition count 2018
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 79 transition count 2017
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 2 with 2 rules applied. Total rules applied 19 place count 78 transition count 2016
Applied a total of 19 rules in 1042 ms. Remains 78 /86 variables (removed 8) and now considering 2016/1671 (removed -345) transitions.
Finished structural reductions, in 1 iterations. Remains : 78/86 places, 2016/1671 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 17507 ms. (steps per millisecond=57 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1949 ms. (steps per millisecond=513 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 746 ms. (steps per millisecond=1340 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 749 ms. (steps per millisecond=1335 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 4747119 steps, run timeout after 30001 ms. (steps per millisecond=158 ) properties seen :[0, 0, 1]
Probabilistic random walk after 4747119 steps, saw 510874 distinct states, run finished after 30001 ms. (steps per millisecond=158 ) properties seen :[0, 0, 1]
FORMULA EnergyBus-PT-none-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2021-05-12 00:20:51] [INFO ] Flow matrix only has 351 transitions (discarded 1665 similar events)
// Phase 1: matrix 351 rows 78 cols
[2021-05-12 00:20:51] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-12 00:20:51] [INFO ] [Real]Absence check using 20 positive place invariants in 21 ms returned sat
[2021-05-12 00:20:51] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-12 00:20:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 00:20:51] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2021-05-12 00:20:51] [INFO ] State equation strengthened by 295 read => feed constraints.
[2021-05-12 00:20:51] [INFO ] [Real]Added 295 Read/Feed constraints in 56 ms returned sat
[2021-05-12 00:20:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 00:20:51] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2021-05-12 00:20:51] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-12 00:20:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 00:20:51] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2021-05-12 00:20:51] [INFO ] [Nat]Added 295 Read/Feed constraints in 75 ms returned sat
[2021-05-12 00:20:51] [INFO ] Deduced a trap composed of 5 places in 11 ms
[2021-05-12 00:20:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2021-05-12 00:20:51] [INFO ] Computed and/alt/rep : 2014/73860/349 causal constraints in 101 ms.
[2021-05-12 00:21:03] [INFO ] Added : 215 causal constraints over 43 iterations in 11926 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 109 ms.
[2021-05-12 00:21:03] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2021-05-12 00:21:03] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-12 00:21:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 00:21:03] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2021-05-12 00:21:04] [INFO ] [Real]Added 295 Read/Feed constraints in 62 ms returned sat
[2021-05-12 00:21:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 00:21:04] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2021-05-12 00:21:04] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-12 00:21:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 00:21:04] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2021-05-12 00:21:04] [INFO ] [Nat]Added 295 Read/Feed constraints in 78 ms returned sat
[2021-05-12 00:21:04] [INFO ] Computed and/alt/rep : 2014/73860/349 causal constraints in 145 ms.
[2021-05-12 00:21:15] [INFO ] Added : 250 causal constraints over 50 iterations in 11739 ms. Result :sat
[2021-05-12 00:21:15] [INFO ] Deduced a trap composed of 5 places in 11 ms
[2021-05-12 00:21:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
Attempting to minimize the solution found.
Minimization took 150 ms.
Incomplete Parikh walk after 202500 steps, including 1000 resets, run finished after 2215 ms. (steps per millisecond=91 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 128400 steps, including 1000 resets, run finished after 1610 ms. (steps per millisecond=79 ) properties seen :[0, 0] could not realise parikh vector
Support contains 11 out of 78 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 78/78 places, 2016/2016 transitions.
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 78 transition count 2016
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 192 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 77 transition count 1824
Applied a total of 3 rules in 322 ms. Remains 77 /78 variables (removed 1) and now considering 1824/2016 (removed 192) transitions.
Finished structural reductions, in 1 iterations. Remains : 77/78 places, 1824/2016 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 15890 ms. (steps per millisecond=62 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 768 ms. (steps per millisecond=1302 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 751 ms. (steps per millisecond=1331 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 5156021 steps, run timeout after 30001 ms. (steps per millisecond=171 ) properties seen :[0, 1]
Probabilistic random walk after 5156021 steps, saw 552882 distinct states, run finished after 30001 ms. (steps per millisecond=171 ) properties seen :[0, 1]
FORMULA EnergyBus-PT-none-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2021-05-12 00:22:07] [INFO ] Flow matrix only has 327 transitions (discarded 1497 similar events)
// Phase 1: matrix 327 rows 77 cols
[2021-05-12 00:22:07] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-12 00:22:07] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2021-05-12 00:22:07] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-12 00:22:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 00:22:07] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2021-05-12 00:22:07] [INFO ] State equation strengthened by 271 read => feed constraints.
[2021-05-12 00:22:08] [INFO ] [Real]Added 271 Read/Feed constraints in 54 ms returned sat
[2021-05-12 00:22:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 00:22:08] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2021-05-12 00:22:08] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-12 00:22:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 00:22:08] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2021-05-12 00:22:08] [INFO ] [Nat]Added 271 Read/Feed constraints in 55 ms returned sat
[2021-05-12 00:22:08] [INFO ] Deduced a trap composed of 5 places in 135 ms
[2021-05-12 00:22:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2021-05-12 00:22:08] [INFO ] Computed and/alt/rep : 1822/68784/325 causal constraints in 79 ms.
[2021-05-12 00:22:20] [INFO ] Added : 235 causal constraints over 47 iterations in 12598 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 123 ms.
Incomplete Parikh walk after 252100 steps, including 1000 resets, run finished after 2345 ms. (steps per millisecond=107 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 77 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 77/77 places, 1824/1824 transitions.
Graph (trivial) has 12 edges and 77 vertex of which 2 / 77 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Ensure Unique test removed 433 transitions
Reduce isomorphic transitions removed 435 transitions.
Iterating post reduction 0 with 435 rules applied. Total rules applied 436 place count 76 transition count 1389
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 437 place count 76 transition count 1388
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 438 place count 75 transition count 1388
Applied a total of 438 rules in 209 ms. Remains 75 /77 variables (removed 2) and now considering 1388/1824 (removed 436) transitions.
Finished structural reductions, in 1 iterations. Remains : 75/77 places, 1388/1824 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 12567 ms. (steps per millisecond=79 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 690 ms. (steps per millisecond=1449 ) properties seen :[0]
Interrupted probabilistic random walk after 6360713 steps, run timeout after 30001 ms. (steps per millisecond=212 ) properties seen :[0]
Probabilistic random walk after 6360713 steps, saw 715624 distinct states, run finished after 30001 ms. (steps per millisecond=212 ) properties seen :[0]
[2021-05-12 00:23:06] [INFO ] Flow matrix only has 324 transitions (discarded 1064 similar events)
// Phase 1: matrix 324 rows 75 cols
[2021-05-12 00:23:06] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-12 00:23:06] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2021-05-12 00:23:06] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-12 00:23:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 00:23:07] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2021-05-12 00:23:07] [INFO ] State equation strengthened by 271 read => feed constraints.
[2021-05-12 00:23:07] [INFO ] [Real]Added 271 Read/Feed constraints in 45 ms returned sat
[2021-05-12 00:23:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 00:23:07] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2021-05-12 00:23:07] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-12 00:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 00:23:07] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2021-05-12 00:23:07] [INFO ] [Nat]Added 271 Read/Feed constraints in 50 ms returned sat
[2021-05-12 00:23:07] [INFO ] Deduced a trap composed of 5 places in 51 ms
[2021-05-12 00:23:07] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2021-05-12 00:23:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 127 ms
[2021-05-12 00:23:07] [INFO ] Computed and/alt/rep : 1386/54283/322 causal constraints in 64 ms.
[2021-05-12 00:23:25] [INFO ] Added : 265 causal constraints over 53 iterations in 18118 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 165 ms.
Incomplete Parikh walk after 201400 steps, including 1000 resets, run finished after 1998 ms. (steps per millisecond=100 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 1388/1388 transitions.
Applied a total of 0 rules in 163 ms. Remains 75 /75 variables (removed 0) and now considering 1388/1388 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 1388/1388 transitions.
Starting structural reductions, iteration 0 : 75/75 places, 1388/1388 transitions.
Applied a total of 0 rules in 181 ms. Remains 75 /75 variables (removed 0) and now considering 1388/1388 (removed 0) transitions.
[2021-05-12 00:23:28] [INFO ] Flow matrix only has 324 transitions (discarded 1064 similar events)
// Phase 1: matrix 324 rows 75 cols
[2021-05-12 00:23:28] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-12 00:23:28] [INFO ] Implicit Places using invariants in 178 ms returned [5, 27, 33, 34, 60]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 181 ms to find 5 implicit places.
[2021-05-12 00:23:29] [INFO ] Redundant transitions in 953 ms returned []
[2021-05-12 00:23:29] [INFO ] Flow matrix only has 324 transitions (discarded 1064 similar events)
// Phase 1: matrix 324 rows 70 cols
[2021-05-12 00:23:29] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-12 00:23:29] [INFO ] Dead Transitions using invariants and state equation in 738 ms returned []
Starting structural reductions, iteration 1 : 70/75 places, 1388/1388 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 69 transition count 1387
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 69 transition count 1384
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 8 place count 66 transition count 1384
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 66 transition count 1383
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 65 transition count 1383
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 19 place count 65 transition count 1383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 65 transition count 1382
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 65 transition count 1378
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 65 transition count 1377
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 432 transitions
Reduce isomorphic transitions removed 432 transitions.
Iterating post reduction 3 with 433 rules applied. Total rules applied 458 place count 64 transition count 945
Applied a total of 458 rules in 305 ms. Remains 64 /70 variables (removed 6) and now considering 945/1388 (removed 443) transitions.
[2021-05-12 00:23:30] [INFO ] Flow matrix only has 235 transitions (discarded 710 similar events)
// Phase 1: matrix 235 rows 64 cols
[2021-05-12 00:23:30] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-12 00:23:30] [INFO ] Implicit Places using invariants in 73 ms returned []
[2021-05-12 00:23:30] [INFO ] Flow matrix only has 235 transitions (discarded 710 similar events)
// Phase 1: matrix 235 rows 64 cols
[2021-05-12 00:23:30] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-12 00:23:30] [INFO ] State equation strengthened by 179 read => feed constraints.
[2021-05-12 00:23:30] [INFO ] Implicit Places using invariants and state equation in 285 ms returned [13, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 359 ms to find 2 implicit places.
Starting structural reductions, iteration 2 : 62/75 places, 945/1388 transitions.
Applied a total of 0 rules in 88 ms. Remains 62 /62 variables (removed 0) and now considering 945/945 (removed 0) transitions.
[2021-05-12 00:23:30] [INFO ] Redundant transitions in 22 ms returned []
[2021-05-12 00:23:30] [INFO ] Flow matrix only has 235 transitions (discarded 710 similar events)
// Phase 1: matrix 235 rows 62 cols
[2021-05-12 00:23:30] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-12 00:23:31] [INFO ] Dead Transitions using invariants and state equation in 474 ms returned []
Finished structural reductions, in 3 iterations. Remains : 62/75 places, 945/1388 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 9266 ms. (steps per millisecond=107 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 742 ms. (steps per millisecond=1347 ) properties seen :[0]
Interrupted probabilistic random walk after 9100313 steps, run timeout after 30001 ms. (steps per millisecond=303 ) properties seen :[0]
Probabilistic random walk after 9100313 steps, saw 1049420 distinct states, run finished after 30001 ms. (steps per millisecond=303 ) properties seen :[0]
[2021-05-12 00:24:11] [INFO ] Flow matrix only has 235 transitions (discarded 710 similar events)
// Phase 1: matrix 235 rows 62 cols
[2021-05-12 00:24:11] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-12 00:24:11] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2021-05-12 00:24:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 00:24:11] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2021-05-12 00:24:11] [INFO ] State equation strengthened by 179 read => feed constraints.
[2021-05-12 00:24:11] [INFO ] [Real]Added 179 Read/Feed constraints in 30 ms returned sat
[2021-05-12 00:24:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 00:24:11] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2021-05-12 00:24:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 00:24:11] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2021-05-12 00:24:11] [INFO ] [Nat]Added 179 Read/Feed constraints in 33 ms returned sat
[2021-05-12 00:24:11] [INFO ] Computed and/alt/rep : 943/28953/233 causal constraints in 40 ms.
[2021-05-12 00:24:26] [INFO ] Added : 221 causal constraints over 45 iterations in 15389 ms. Result :unknown
Incomplete Parikh walk after 109400 steps, including 1000 resets, run finished after 1577 ms. (steps per millisecond=69 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 62 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 62/62 places, 945/945 transitions.
Applied a total of 0 rules in 79 ms. Remains 62 /62 variables (removed 0) and now considering 945/945 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 945/945 transitions.
Starting structural reductions, iteration 0 : 62/62 places, 945/945 transitions.
Applied a total of 0 rules in 78 ms. Remains 62 /62 variables (removed 0) and now considering 945/945 (removed 0) transitions.
[2021-05-12 00:24:28] [INFO ] Flow matrix only has 235 transitions (discarded 710 similar events)
// Phase 1: matrix 235 rows 62 cols
[2021-05-12 00:24:28] [INFO ] Computed 15 place invariants in 3 ms
[2021-05-12 00:24:28] [INFO ] Implicit Places using invariants in 72 ms returned []
[2021-05-12 00:24:28] [INFO ] Flow matrix only has 235 transitions (discarded 710 similar events)
// Phase 1: matrix 235 rows 62 cols
[2021-05-12 00:24:28] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-12 00:24:28] [INFO ] State equation strengthened by 179 read => feed constraints.
[2021-05-12 00:24:28] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2021-05-12 00:24:28] [INFO ] Redundant transitions in 22 ms returned []
[2021-05-12 00:24:28] [INFO ] Flow matrix only has 235 transitions (discarded 710 similar events)
// Phase 1: matrix 235 rows 62 cols
[2021-05-12 00:24:28] [INFO ] Computed 15 place invariants in 6 ms
[2021-05-12 00:24:29] [INFO ] Dead Transitions using invariants and state equation in 487 ms returned []
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 945/945 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 918 ms. (steps per millisecond=108 ) properties seen :[0]
[2021-05-12 00:24:30] [INFO ] Flow matrix only has 235 transitions (discarded 710 similar events)
// Phase 1: matrix 235 rows 62 cols
[2021-05-12 00:24:30] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-12 00:24:30] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2021-05-12 00:24:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 00:24:30] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-12 00:24:30] [INFO ] State equation strengthened by 179 read => feed constraints.
[2021-05-12 00:24:30] [INFO ] [Real]Added 179 Read/Feed constraints in 33 ms returned sat
[2021-05-12 00:24:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 00:24:30] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2021-05-12 00:24:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 00:24:30] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2021-05-12 00:24:30] [INFO ] [Nat]Added 179 Read/Feed constraints in 34 ms returned sat
[2021-05-12 00:24:30] [INFO ] Computed and/alt/rep : 943/28953/233 causal constraints in 44 ms.
[2021-05-12 00:24:45] [INFO ] Added : 221 causal constraints over 45 iterations in 15368 ms. Result :unknown
Graph (trivial) has 24 edges and 62 vertex of which 4 / 62 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 6 transitions
Ensure Unique test removed 709 transitions
Reduce isomorphic transitions removed 715 transitions.
Iterating post reduction 0 with 715 rules applied. Total rules applied 716 place count 60 transition count 230
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 716 place count 60 transition count 228
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 720 place count 58 transition count 228
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 726 place count 55 transition count 225
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 727 place count 55 transition count 224
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 729 place count 54 transition count 223
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 735 place count 54 transition count 223
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 2 with 23 rules applied. Total rules applied 758 place count 54 transition count 200
Symmetric choice reduction at 2 with 1 rule applications. Total rules 759 place count 54 transition count 200
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 761 place count 53 transition count 199
Applied a total of 761 rules in 19 ms. Remains 53 /62 variables (removed 9) and now considering 199/945 (removed 746) transitions.
// Phase 1: matrix 199 rows 53 cols
[2021-05-12 00:24:45] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-12 00:24:45] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2021-05-12 00:24:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 00:24:46] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2021-05-12 00:24:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2021-05-12 00:24:46] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2021-05-12 00:24:46] [INFO ] Computed and/alt/rep : 197/4515/197 causal constraints in 12 ms.
[2021-05-12 00:24:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 00:24:46] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2021-05-12 00:24:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 00:24:46] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2021-05-12 00:24:46] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2021-05-12 00:24:46] [INFO ] Computed and/alt/rep : 197/4515/197 causal constraints in 25 ms.
[2021-05-12 00:24:51] [INFO ] Added : 189 causal constraints over 38 iterations in 5604 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 63 ms.
[2021-05-12 00:24:51] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2021-05-12 00:24:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 19 ms.
[2021-05-12 00:24:52] [INFO ] Flatten gal took : 170 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ EnergyBus-PT-none @ 3570 seconds
vrfy: finished
info: timeLeft: 3567
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",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed May 12 00:24:52 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 35972,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 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 <= p29) AND (1 <= p37) AND (1 <= p43) AND (1 <= p55))))",
"processed_size": 123,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 13283,
"conflict_clusters": 11,
"places": 62,
"places_significant": 47,
"singleton_clusters": 0,
"transitions": 945
},
"task":
{
"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"
}
}
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: 1007/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 62
lola: finding significant places
lola: 62 places, 945 transitions, 47 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: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: E (F (((1 <= p6) AND (1 <= p8) AND (1 <= p22) AND (1 <= p25) AND (1 <= p29) AND (1 <= p37) AND (1 <= p43) AND (1 <= p55))))
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 <= p29) AND (1 <= p37) AND (1 <= p43) AND (1 <= p55))))
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: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p6) AND (1 <= p8) AND (1 <= p22) AND (1 <= p25) AND (1 <= p29) AND (1 <= p37) AND (1 <= p43) AND (1 <= p55))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: memory consumption: 35972 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EnergyBus-PT-none"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is 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 r094-tall-162048902700340"
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 ;