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.r075-tall-162039097100059.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 DES-PT-40a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097100059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 03:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 03:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 83K 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 DES-PT-40a-ReachabilityCardinality-00
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-01
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-02
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-03
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-04
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-05
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-06
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-07
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-08
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-09
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-10
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-11
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-12
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-13
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-14
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620509824021

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 21:37:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-08 21:37:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 21:37:05] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2021-05-08 21:37:05] [INFO ] Transformed 274 places.
[2021-05-08 21:37:05] [INFO ] Transformed 231 transitions.
[2021-05-08 21:37:05] [INFO ] Found NUPN structural information;
[2021-05-08 21:37:05] [INFO ] Parsed PT model containing 274 places and 231 transitions in 134 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-40a-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 219 resets, run finished after 79 ms. (steps per millisecond=126 ) properties seen :[0, 1, 1, 0, 0, 0, 0, 0, 0]
FORMULA DES-PT-40a-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 217 rows 274 cols
[2021-05-08 21:37:06] [INFO ] Computed 59 place invariants in 21 ms
[2021-05-08 21:37:06] [INFO ] [Real]Absence check using 34 positive place invariants in 29 ms returned sat
[2021-05-08 21:37:06] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 21:37:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:06] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2021-05-08 21:37:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:37:06] [INFO ] [Nat]Absence check using 34 positive place invariants in 31 ms returned sat
[2021-05-08 21:37:06] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 24 ms returned sat
[2021-05-08 21:37:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:07] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2021-05-08 21:37:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 21:37:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 21:37:07] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 24 ms.
[2021-05-08 21:37:08] [INFO ] Added : 203 causal constraints over 41 iterations in 1052 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2021-05-08 21:37:08] [INFO ] [Real]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 21:37:08] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 24 ms returned sat
[2021-05-08 21:37:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:08] [INFO ] [Real]Absence check using state equation in 627 ms returned sat
[2021-05-08 21:37:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:37:08] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 21:37:08] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 62 ms returned sat
[2021-05-08 21:37:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:09] [INFO ] [Nat]Absence check using state equation in 412 ms returned sat
[2021-05-08 21:37:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-08 21:37:09] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 14 ms.
[2021-05-08 21:37:10] [INFO ] Added : 152 causal constraints over 31 iterations in 832 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2021-05-08 21:37:10] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2021-05-08 21:37:10] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 21 ms returned sat
[2021-05-08 21:37:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:10] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2021-05-08 21:37:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:37:10] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 21:37:10] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 91 ms returned sat
[2021-05-08 21:37:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:11] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2021-05-08 21:37:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 21:37:11] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 12 ms.
[2021-05-08 21:37:11] [INFO ] Added : 196 causal constraints over 40 iterations in 742 ms. Result :sat
[2021-05-08 21:37:11] [INFO ] Deduced a trap composed of 18 places in 102 ms
[2021-05-08 21:37:12] [INFO ] Deduced a trap composed of 18 places in 72 ms
[2021-05-08 21:37:12] [INFO ] Deduced a trap composed of 23 places in 70 ms
[2021-05-08 21:37:12] [INFO ] Deduced a trap composed of 18 places in 40 ms
[2021-05-08 21:37:12] [INFO ] Deduced a trap composed of 22 places in 39 ms
[2021-05-08 21:37:12] [INFO ] Deduced a trap composed of 17 places in 45 ms
[2021-05-08 21:37:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 539 ms
Attempting to minimize the solution found.
Minimization took 20 ms.
[2021-05-08 21:37:12] [INFO ] [Real]Absence check using 34 positive place invariants in 21 ms returned sat
[2021-05-08 21:37:12] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 18 ms returned sat
[2021-05-08 21:37:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:12] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2021-05-08 21:37:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:37:12] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 21:37:12] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 105 ms returned sat
[2021-05-08 21:37:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:13] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2021-05-08 21:37:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-08 21:37:13] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 14 ms.
[2021-05-08 21:37:14] [INFO ] Added : 204 causal constraints over 41 iterations in 905 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-08 21:37:14] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2021-05-08 21:37:14] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2021-05-08 21:37:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:14] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2021-05-08 21:37:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:37:14] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 21:37:14] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 28 ms returned sat
[2021-05-08 21:37:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:14] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2021-05-08 21:37:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 21:37:15] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 25 ms.
[2021-05-08 21:37:15] [INFO ] Added : 96 causal constraints over 20 iterations in 702 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-08 21:37:15] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2021-05-08 21:37:15] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2021-05-08 21:37:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:16] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2021-05-08 21:37:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:37:16] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 21:37:16] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 94 ms returned sat
[2021-05-08 21:37:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:16] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2021-05-08 21:37:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2021-05-08 21:37:16] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 23 ms.
[2021-05-08 21:37:17] [INFO ] Added : 117 causal constraints over 24 iterations in 718 ms. Result :sat
[2021-05-08 21:37:17] [INFO ] Deduced a trap composed of 11 places in 42 ms
[2021-05-08 21:37:17] [INFO ] Deduced a trap composed of 13 places in 42 ms
[2021-05-08 21:37:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
Attempting to minimize the solution found.
Minimization took 8 ms.
[2021-05-08 21:37:17] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 21:37:17] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 18 ms returned sat
[2021-05-08 21:37:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:17] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2021-05-08 21:37:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:37:17] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 21:37:18] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 35 ms returned sat
[2021-05-08 21:37:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:18] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2021-05-08 21:37:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 21:37:18] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 12 ms.
[2021-05-08 21:37:18] [INFO ] Added : 128 causal constraints over 26 iterations in 661 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
Incomplete Parikh walk after 140000 steps, including 3459 resets, run finished after 506 ms. (steps per millisecond=276 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 75200 steps, including 1511 resets, run finished after 247 ms. (steps per millisecond=304 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 46800 steps, including 722 resets, run finished after 163 ms. (steps per millisecond=287 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 153000 steps, including 3617 resets, run finished after 483 ms. (steps per millisecond=316 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 181300 steps, including 4538 resets, run finished after 567 ms. (steps per millisecond=319 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 151700 steps, including 3549 resets, run finished after 490 ms. (steps per millisecond=309 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 205300 steps, including 4713 resets, run finished after 621 ms. (steps per millisecond=330 ) properties seen :[0, 0, 0, 0, 1, 1, 1] could not realise parikh vector
FORMULA DES-PT-40a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 12 out of 274 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 274/274 places, 217/217 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 274 transition count 215
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 274 transition count 215
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 273 transition count 214
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 10 place count 273 transition count 214
Applied a total of 10 rules in 72 ms. Remains 273 /274 variables (removed 1) and now considering 214/217 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 273/274 places, 214/217 transitions.
Incomplete random walk after 1000000 steps, including 13460 resets, run finished after 3126 ms. (steps per millisecond=319 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2282 resets, run finished after 1205 ms. (steps per millisecond=829 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2609 resets, run finished after 1411 ms. (steps per millisecond=708 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2301 resets, run finished after 1253 ms. (steps per millisecond=798 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2271 resets, run finished after 1173 ms. (steps per millisecond=852 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 15516201 steps, run timeout after 30001 ms. (steps per millisecond=517 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 15516201 steps, saw 1900751 distinct states, run finished after 30001 ms. (steps per millisecond=517 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 214 rows 273 cols
[2021-05-08 21:38:00] [INFO ] Computed 61 place invariants in 5 ms
[2021-05-08 21:38:00] [INFO ] [Real]Absence check using 37 positive place invariants in 16 ms returned sat
[2021-05-08 21:38:00] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 22 ms returned sat
[2021-05-08 21:38:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:38:00] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2021-05-08 21:38:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:38:00] [INFO ] [Nat]Absence check using 37 positive place invariants in 17 ms returned sat
[2021-05-08 21:38:00] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 34 ms returned sat
[2021-05-08 21:38:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:38:01] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2021-05-08 21:38:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-08 21:38:01] [INFO ] [Nat]Added 4 Read/Feed constraints in 7 ms returned sat
[2021-05-08 21:38:01] [INFO ] Computed and/alt/rep : 213/1013/213 causal constraints in 13 ms.
[2021-05-08 21:38:02] [INFO ] Added : 204 causal constraints over 41 iterations in 1128 ms. Result :sat
[2021-05-08 21:38:02] [INFO ] Deduced a trap composed of 13 places in 39 ms
[2021-05-08 21:38:02] [INFO ] Deduced a trap composed of 11 places in 19 ms
[2021-05-08 21:38:02] [INFO ] Deduced a trap composed of 9 places in 20 ms
[2021-05-08 21:38:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 155 ms
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-08 21:38:02] [INFO ] [Real]Absence check using 37 positive place invariants in 16 ms returned sat
[2021-05-08 21:38:02] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 17 ms returned sat
[2021-05-08 21:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:38:03] [INFO ] [Real]Absence check using state equation in 597 ms returned sat
[2021-05-08 21:38:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:38:03] [INFO ] [Nat]Absence check using 37 positive place invariants in 17 ms returned sat
[2021-05-08 21:38:03] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 53 ms returned sat
[2021-05-08 21:38:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:38:03] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2021-05-08 21:38:03] [INFO ] [Nat]Added 4 Read/Feed constraints in 11 ms returned sat
[2021-05-08 21:38:03] [INFO ] Deduced a trap composed of 52 places in 40 ms
[2021-05-08 21:38:03] [INFO ] Deduced a trap composed of 9 places in 40 ms
[2021-05-08 21:38:03] [INFO ] Deduced a trap composed of 41 places in 25 ms
[2021-05-08 21:38:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 143 ms
[2021-05-08 21:38:03] [INFO ] Computed and/alt/rep : 213/1013/213 causal constraints in 12 ms.
[2021-05-08 21:38:04] [INFO ] Added : 151 causal constraints over 31 iterations in 788 ms. Result :sat
[2021-05-08 21:38:04] [INFO ] Deduced a trap composed of 12 places in 54 ms
[2021-05-08 21:38:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-08 21:38:04] [INFO ] [Real]Absence check using 37 positive place invariants in 19 ms returned sat
[2021-05-08 21:38:04] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 22 ms returned sat
[2021-05-08 21:38:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:38:05] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2021-05-08 21:38:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:38:05] [INFO ] [Nat]Absence check using 37 positive place invariants in 17 ms returned sat
[2021-05-08 21:38:05] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 38 ms returned sat
[2021-05-08 21:38:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:38:05] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2021-05-08 21:38:05] [INFO ] [Nat]Added 4 Read/Feed constraints in 73 ms returned sat
[2021-05-08 21:38:05] [INFO ] Computed and/alt/rep : 213/1013/213 causal constraints in 12 ms.
[2021-05-08 21:38:06] [INFO ] Added : 169 causal constraints over 34 iterations in 904 ms. Result :sat
[2021-05-08 21:38:06] [INFO ] Deduced a trap composed of 16 places in 48 ms
[2021-05-08 21:38:06] [INFO ] Deduced a trap composed of 8 places in 43 ms
[2021-05-08 21:38:06] [INFO ] Deduced a trap composed of 18 places in 36 ms
[2021-05-08 21:38:06] [INFO ] Deduced a trap composed of 17 places in 28 ms
[2021-05-08 21:38:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 249 ms
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-08 21:38:06] [INFO ] [Real]Absence check using 37 positive place invariants in 16 ms returned sat
[2021-05-08 21:38:06] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 15 ms returned sat
[2021-05-08 21:38:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:38:07] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2021-05-08 21:38:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:38:07] [INFO ] [Nat]Absence check using 37 positive place invariants in 16 ms returned sat
[2021-05-08 21:38:07] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 160 ms returned sat
[2021-05-08 21:38:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:38:07] [INFO ] [Nat]Absence check using state equation in 326 ms returned sat
[2021-05-08 21:38:07] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2021-05-08 21:38:07] [INFO ] Deduced a trap composed of 6 places in 28 ms
[2021-05-08 21:38:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2021-05-08 21:38:07] [INFO ] Computed and/alt/rep : 213/1013/213 causal constraints in 11 ms.
[2021-05-08 21:38:08] [INFO ] Added : 196 causal constraints over 40 iterations in 842 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
Incomplete Parikh walk after 128200 steps, including 1880 resets, run finished after 406 ms. (steps per millisecond=315 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 171400 steps, including 2508 resets, run finished after 536 ms. (steps per millisecond=319 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 156200 steps, including 2134 resets, run finished after 488 ms. (steps per millisecond=320 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 192100 steps, including 2822 resets, run finished after 606 ms. (steps per millisecond=316 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 12 out of 273 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 273/273 places, 214/214 transitions.
Applied a total of 0 rules in 12 ms. Remains 273 /273 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 273/273 places, 214/214 transitions.
Starting structural reductions, iteration 0 : 273/273 places, 214/214 transitions.
Applied a total of 0 rules in 12 ms. Remains 273 /273 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 273 cols
[2021-05-08 21:38:10] [INFO ] Computed 61 place invariants in 5 ms
[2021-05-08 21:38:11] [INFO ] Implicit Places using invariants in 564 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 566 ms to find 1 implicit places.
[2021-05-08 21:38:11] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 214 rows 272 cols
[2021-05-08 21:38:11] [INFO ] Computed 60 place invariants in 6 ms
[2021-05-08 21:38:11] [INFO ] Dead Transitions using invariants and state equation in 478 ms returned []
Starting structural reductions, iteration 1 : 272/273 places, 214/214 transitions.
Applied a total of 0 rules in 9 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2021-05-08 21:38:11] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 214 rows 272 cols
[2021-05-08 21:38:11] [INFO ] Computed 60 place invariants in 5 ms
[2021-05-08 21:38:12] [INFO ] Dead Transitions using invariants and state equation in 447 ms returned []
Finished structural reductions, in 2 iterations. Remains : 272/273 places, 214/214 transitions.
Incomplete random walk after 1000000 steps, including 13429 resets, run finished after 3060 ms. (steps per millisecond=326 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2267 resets, run finished after 1143 ms. (steps per millisecond=874 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2605 resets, run finished after 1294 ms. (steps per millisecond=772 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2320 resets, run finished after 1234 ms. (steps per millisecond=810 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2235 resets, run finished after 1172 ms. (steps per millisecond=853 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 15674344 steps, run timeout after 30001 ms. (steps per millisecond=522 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 15674344 steps, saw 1920487 distinct states, run finished after 30001 ms. (steps per millisecond=522 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 214 rows 272 cols
[2021-05-08 21:38:50] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 21:38:50] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 21:38:50] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2021-05-08 21:38:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:38:50] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2021-05-08 21:38:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:38:50] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 21:38:50] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 33 ms returned sat
[2021-05-08 21:38:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:38:50] [INFO ] [Nat]Absence check using state equation in 324 ms returned sat
[2021-05-08 21:38:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-08 21:38:50] [INFO ] [Nat]Added 3 Read/Feed constraints in 21 ms returned sat
[2021-05-08 21:38:50] [INFO ] Deduced a trap composed of 19 places in 60 ms
[2021-05-08 21:38:50] [INFO ] Deduced a trap composed of 18 places in 57 ms
[2021-05-08 21:38:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 145 ms
[2021-05-08 21:38:50] [INFO ] Computed and/alt/rep : 213/1010/213 causal constraints in 11 ms.
[2021-05-08 21:38:51] [INFO ] Added : 204 causal constraints over 41 iterations in 832 ms. Result :sat
[2021-05-08 21:38:51] [INFO ] Deduced a trap composed of 7 places in 60 ms
[2021-05-08 21:38:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-08 21:38:51] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 21:38:51] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2021-05-08 21:38:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:38:52] [INFO ] [Real]Absence check using state equation in 633 ms returned sat
[2021-05-08 21:38:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:38:52] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 21:38:52] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 24 ms returned sat
[2021-05-08 21:38:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:38:53] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2021-05-08 21:38:53] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2021-05-08 21:38:53] [INFO ] Deduced a trap composed of 7 places in 19 ms
[2021-05-08 21:38:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2021-05-08 21:38:53] [INFO ] Computed and/alt/rep : 213/1010/213 causal constraints in 12 ms.
[2021-05-08 21:38:53] [INFO ] Added : 135 causal constraints over 27 iterations in 780 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-08 21:38:54] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 21:38:54] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2021-05-08 21:38:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:38:54] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2021-05-08 21:38:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:38:54] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 21:38:54] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 52 ms returned sat
[2021-05-08 21:38:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:38:54] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2021-05-08 21:38:54] [INFO ] [Nat]Added 3 Read/Feed constraints in 7 ms returned sat
[2021-05-08 21:38:54] [INFO ] Deduced a trap composed of 41 places in 42 ms
[2021-05-08 21:38:54] [INFO ] Deduced a trap composed of 8 places in 35 ms
[2021-05-08 21:38:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 103 ms
[2021-05-08 21:38:55] [INFO ] Computed and/alt/rep : 213/1010/213 causal constraints in 11 ms.
[2021-05-08 21:38:55] [INFO ] Added : 192 causal constraints over 39 iterations in 870 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-08 21:38:55] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2021-05-08 21:38:55] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2021-05-08 21:38:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:38:56] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2021-05-08 21:38:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:38:56] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2021-05-08 21:38:56] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2021-05-08 21:38:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:38:56] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2021-05-08 21:38:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2021-05-08 21:38:56] [INFO ] Computed and/alt/rep : 213/1010/213 causal constraints in 12 ms.
[2021-05-08 21:38:57] [INFO ] Added : 142 causal constraints over 29 iterations in 679 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
Incomplete Parikh walk after 132700 steps, including 1946 resets, run finished after 417 ms. (steps per millisecond=318 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 165600 steps, including 2435 resets, run finished after 519 ms. (steps per millisecond=319 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 97900 steps, including 1467 resets, run finished after 306 ms. (steps per millisecond=319 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 191500 steps, including 2844 resets, run finished after 594 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 12 out of 272 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 9 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 272/272 places, 214/214 transitions.
Starting structural reductions, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 9 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 272 cols
[2021-05-08 21:38:59] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 21:38:59] [INFO ] Implicit Places using invariants in 535 ms returned []
// Phase 1: matrix 214 rows 272 cols
[2021-05-08 21:38:59] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 21:39:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-08 21:39:01] [INFO ] Implicit Places using invariants and state equation in 2234 ms returned []
Implicit Place search using SMT with State Equation took 2771 ms to find 0 implicit places.
[2021-05-08 21:39:01] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 214 rows 272 cols
[2021-05-08 21:39:01] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 21:39:02] [INFO ] Dead Transitions using invariants and state equation in 441 ms returned []
Finished structural reductions, in 1 iterations. Remains : 272/272 places, 214/214 transitions.
Incomplete random walk after 100000 steps, including 1358 resets, run finished after 321 ms. (steps per millisecond=311 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 214 rows 272 cols
[2021-05-08 21:39:02] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 21:39:02] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 21:39:02] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2021-05-08 21:39:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:39:03] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2021-05-08 21:39:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:39:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 21:39:03] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 33 ms returned sat
[2021-05-08 21:39:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:39:03] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2021-05-08 21:39:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-08 21:39:03] [INFO ] [Nat]Added 3 Read/Feed constraints in 21 ms returned sat
[2021-05-08 21:39:03] [INFO ] Deduced a trap composed of 19 places in 59 ms
[2021-05-08 21:39:03] [INFO ] Deduced a trap composed of 18 places in 58 ms
[2021-05-08 21:39:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 143 ms
[2021-05-08 21:39:03] [INFO ] Computed and/alt/rep : 213/1010/213 causal constraints in 11 ms.
[2021-05-08 21:39:04] [INFO ] Added : 204 causal constraints over 41 iterations in 826 ms. Result :sat
[2021-05-08 21:39:04] [INFO ] Deduced a trap composed of 7 places in 60 ms
[2021-05-08 21:39:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2021-05-08 21:39:04] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 21:39:04] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2021-05-08 21:39:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:39:05] [INFO ] [Real]Absence check using state equation in 629 ms returned sat
[2021-05-08 21:39:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:39:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 21:39:05] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 25 ms returned sat
[2021-05-08 21:39:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:39:05] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2021-05-08 21:39:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2021-05-08 21:39:05] [INFO ] Deduced a trap composed of 7 places in 18 ms
[2021-05-08 21:39:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2021-05-08 21:39:05] [INFO ] Computed and/alt/rep : 213/1010/213 causal constraints in 11 ms.
[2021-05-08 21:39:06] [INFO ] Added : 135 causal constraints over 27 iterations in 783 ms. Result :sat
[2021-05-08 21:39:06] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 21:39:06] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2021-05-08 21:39:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:39:07] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2021-05-08 21:39:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:39:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 21:39:07] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 52 ms returned sat
[2021-05-08 21:39:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:39:07] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2021-05-08 21:39:07] [INFO ] [Nat]Added 3 Read/Feed constraints in 7 ms returned sat
[2021-05-08 21:39:07] [INFO ] Deduced a trap composed of 41 places in 42 ms
[2021-05-08 21:39:07] [INFO ] Deduced a trap composed of 8 places in 28 ms
[2021-05-08 21:39:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2021-05-08 21:39:07] [INFO ] Computed and/alt/rep : 213/1010/213 causal constraints in 11 ms.
[2021-05-08 21:39:08] [INFO ] Added : 192 causal constraints over 39 iterations in 868 ms. Result :sat
[2021-05-08 21:39:08] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 21:39:08] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2021-05-08 21:39:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:39:08] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2021-05-08 21:39:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:39:08] [INFO ] [Nat]Absence check using 36 positive place invariants in 21 ms returned sat
[2021-05-08 21:39:08] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2021-05-08 21:39:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:39:09] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2021-05-08 21:39:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2021-05-08 21:39:09] [INFO ] Computed and/alt/rep : 213/1010/213 causal constraints in 11 ms.
[2021-05-08 21:39:09] [INFO ] Added : 142 causal constraints over 29 iterations in 676 ms. Result :sat
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 272 transition count 214
Applied a total of 1 rules in 17 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 272 cols
[2021-05-08 21:39:10] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 21:39:10] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 21:39:10] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2021-05-08 21:39:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:39:10] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2021-05-08 21:39:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:39:10] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 21:39:10] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 34 ms returned sat
[2021-05-08 21:39:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:39:10] [INFO ] [Nat]Absence check using state equation in 326 ms returned sat
[2021-05-08 21:39:10] [INFO ] Computed and/alt/rep : 213/1007/213 causal constraints in 12 ms.
[2021-05-08 21:39:11] [INFO ] Added : 197 causal constraints over 40 iterations in 976 ms. Result :sat
[2021-05-08 21:39:11] [INFO ] Deduced a trap composed of 9 places in 18 ms
[2021-05-08 21:39:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-08 21:39:11] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 21:39:11] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2021-05-08 21:39:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:39:12] [INFO ] [Real]Absence check using state equation in 580 ms returned sat
[2021-05-08 21:39:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:39:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 21:39:12] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 25 ms returned sat
[2021-05-08 21:39:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:39:12] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2021-05-08 21:39:12] [INFO ] Deduced a trap composed of 7 places in 21 ms
[2021-05-08 21:39:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2021-05-08 21:39:12] [INFO ] Computed and/alt/rep : 213/1007/213 causal constraints in 10 ms.
[2021-05-08 21:39:13] [INFO ] Added : 149 causal constraints over 30 iterations in 772 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-08 21:39:13] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 21:39:13] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2021-05-08 21:39:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:39:14] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2021-05-08 21:39:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:39:14] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2021-05-08 21:39:14] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 52 ms returned sat
[2021-05-08 21:39:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:39:14] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2021-05-08 21:39:14] [INFO ] Computed and/alt/rep : 213/1007/213 causal constraints in 11 ms.
[2021-05-08 21:39:15] [INFO ] Added : 193 causal constraints over 39 iterations in 909 ms. Result :sat
[2021-05-08 21:39:15] [INFO ] Deduced a trap composed of 11 places in 64 ms
[2021-05-08 21:39:15] [INFO ] Deduced a trap composed of 12 places in 64 ms
[2021-05-08 21:39:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 176 ms
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-08 21:39:15] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 21:39:15] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2021-05-08 21:39:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:39:15] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2021-05-08 21:39:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:39:15] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2021-05-08 21:39:15] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2021-05-08 21:39:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:39:16] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2021-05-08 21:39:16] [INFO ] Computed and/alt/rep : 213/1007/213 causal constraints in 11 ms.
[2021-05-08 21:39:17] [INFO ] Added : 208 causal constraints over 42 iterations in 813 ms. Result :sat
[2021-05-08 21:39:17] [INFO ] Deduced a trap composed of 9 places in 20 ms
[2021-05-08 21:39:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-08 21:39:17] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2021-05-08 21:39:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
[2021-05-08 21:39:17] [INFO ] Flatten gal took : 83 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DES-PT-40a @ 3570 seconds

FORMULA DES-PT-40a-ReachabilityCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40a-ReachabilityCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40a-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40a-ReachabilityCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for ReachabilityCardinality @ DES-PT-40a

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 3,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G ((((p143 <= 0)) OR ((1 <= p6)) OR ((((p60 <= 0)) OR ((1 <= p121))) AND (((p80 <= 0)) OR ((1 <= p39)))))))",
"processed_size": 114,
"rewrites": 2
},
"result":
{
"edges": 339035,
"markings": 279293,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 22012,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 1064,
"conflict_clusters": 41,
"places": 272,
"places_significant": 212,
"singleton_clusters": 0,
"transitions": 214
},
"result":
{
"preliminary_value": "yes no yes no ",
"value": "yes no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 486/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 272
lola: finding significant places
lola: 272 places, 214 transitions, 212 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 ReachabilityCardinality.xml
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p253 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: E (F (((1 <= p89)))) : A (G ((((p143 <= 0)) OR ((1 <= p6)) OR ((((p60 <= 0)) OR ((1 <= p121))) AND (((p80 <= 0)) OR ((1 <= p39))))))) : E (F ((((1 <= p130)) AND ((p253 <= 0)) AND (((p116 <= 0)) OR ((1 <= p105)))))) : A (G ((((p85 <= 0)) OR ((1 <= p89)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p89))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p89))))
lola: processed formula length: 20
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p89))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 966 markings, 965 edges
lola: ========================================
lola: subprocess 1 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p85 <= 0)) OR ((1 <= p89)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p85 <= 0)) OR ((1 <= p89)))))
lola: processed formula length: 39
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p85)) AND ((p89 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1110 markings, 1109 edges
lola: ========================================
lola: subprocess 2 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p130)) AND ((p253 <= 0)) AND (((p116 <= 0)) OR ((1 <= p105))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p130)) AND ((p253 <= 0)) AND (((p116 <= 0)) OR ((1 <= p105))))))
lola: processed formula length: 79
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p130)) AND ((p253 <= 0)) AND (((p116 <= 0)) OR ((1 <= p105))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1499 markings, 1548 edges
lola: ========================================
lola: subprocess 3 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p143 <= 0)) OR ((1 <= p6)) OR ((((p60 <= 0)) OR ((1 <= p121))) AND (((p80 <= 0)) OR ((1 <= p39)))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p143 <= 0)) OR ((1 <= p6)) OR ((((p60 <= 0)) OR ((1 <= p121))) AND (((p80 <= 0)) OR ((1 <= p39)))))))
lola: processed formula length: 114
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p143)) AND ((p6 <= 0)) AND ((((1 <= p60)) AND ((p121 <= 0))) OR (((1 <= p80)) AND ((p39 <= 0)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-3-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 279293 markings, 339035 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no
lola:
preliminary result: yes no yes no
lola: memory consumption: 22012 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.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="DES-PT-40a"
export BK_EXAMINATION="ReachabilityCardinality"
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 DES-PT-40a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r075-tall-162039097100059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40a.tgz
mv DES-PT-40a execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;