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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K 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.0K Mar 28 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 03:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 22 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 22 12:53 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 57K 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-20a-ReachabilityCardinality-00
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-01
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-02
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-03
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-04
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-05
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-06
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-07
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-08
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-09
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-10
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-11
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-12
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-13
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-14
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620506173069

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 20:36:14] [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 20:36:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 20:36:15] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2021-05-08 20:36:15] [INFO ] Transformed 195 places.
[2021-05-08 20:36:15] [INFO ] Transformed 152 transitions.
[2021-05-08 20:36:15] [INFO ] Found NUPN structural information;
[2021-05-08 20:36:15] [INFO ] Parsed PT model containing 195 places and 152 transitions in 97 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-20a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 227 resets, run finished after 71 ms. (steps per millisecond=140 ) properties seen :[1, 0, 0, 0, 1, 1, 0, 0]
FORMULA DES-PT-20a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 138 rows 195 cols
[2021-05-08 20:36:15] [INFO ] Computed 59 place invariants in 14 ms
[2021-05-08 20:36:15] [INFO ] [Real]Absence check using 34 positive place invariants in 32 ms returned sat
[2021-05-08 20:36:15] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 20 ms returned sat
[2021-05-08 20:36:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:15] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2021-05-08 20:36:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:15] [INFO ] [Nat]Absence check using 34 positive place invariants in 32 ms returned sat
[2021-05-08 20:36:15] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2021-05-08 20:36:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:16] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2021-05-08 20:36:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 20:36:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:36:16] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 14 ms.
[2021-05-08 20:36:16] [INFO ] Added : 105 causal constraints over 21 iterations in 350 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-08 20:36:16] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2021-05-08 20:36:16] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2021-05-08 20:36:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:16] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2021-05-08 20:36:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:16] [INFO ] [Nat]Absence check using 34 positive place invariants in 25 ms returned sat
[2021-05-08 20:36:16] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 37 ms returned sat
[2021-05-08 20:36:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:17] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2021-05-08 20:36:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 20:36:17] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 9 ms.
[2021-05-08 20:36:17] [INFO ] Added : 91 causal constraints over 19 iterations in 244 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-08 20:36:17] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2021-05-08 20:36:17] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2021-05-08 20:36:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:17] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2021-05-08 20:36:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:17] [INFO ] [Nat]Absence check using 34 positive place invariants in 14 ms returned sat
[2021-05-08 20:36:17] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 166 ms returned sat
[2021-05-08 20:36:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:17] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2021-05-08 20:36:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 20:36:17] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 12 ms.
[2021-05-08 20:36:18] [INFO ] Added : 132 causal constraints over 28 iterations in 341 ms. Result :sat
[2021-05-08 20:36:18] [INFO ] Deduced a trap composed of 12 places in 62 ms
[2021-05-08 20:36:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-08 20:36:18] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2021-05-08 20:36:18] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 20:36:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:18] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2021-05-08 20:36:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:18] [INFO ] [Nat]Absence check using 34 positive place invariants in 14 ms returned sat
[2021-05-08 20:36:18] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 52 ms returned sat
[2021-05-08 20:36:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:18] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2021-05-08 20:36:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-08 20:36:18] [INFO ] Deduced a trap composed of 10 places in 23 ms
[2021-05-08 20:36:18] [INFO ] Deduced a trap composed of 9 places in 23 ms
[2021-05-08 20:36:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 65 ms
[2021-05-08 20:36:18] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 10 ms.
[2021-05-08 20:36:19] [INFO ] Added : 121 causal constraints over 25 iterations in 391 ms. Result :sat
[2021-05-08 20:36:19] [INFO ] Deduced a trap composed of 15 places in 36 ms
[2021-05-08 20:36:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-08 20:36:19] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2021-05-08 20:36:19] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 20:36:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:19] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2021-05-08 20:36:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:19] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2021-05-08 20:36:19] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2021-05-08 20:36:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:19] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2021-05-08 20:36:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:36:19] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 10 ms.
[2021-05-08 20:36:20] [INFO ] Added : 133 causal constraints over 27 iterations in 312 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
Incomplete Parikh walk after 95200 steps, including 1945 resets, run finished after 329 ms. (steps per millisecond=289 ) properties seen :[0, 1, 0, 1, 0] could not realise parikh vector
FORMULA DES-PT-20a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-20a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 106900 steps, including 2429 resets, run finished after 312 ms. (steps per millisecond=342 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 111400 steps, including 2877 resets, run finished after 315 ms. (steps per millisecond=353 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 47400 steps, including 856 resets, run finished after 153 ms. (steps per millisecond=309 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 62000 steps, including 1250 resets, run finished after 188 ms. (steps per millisecond=329 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 9 out of 195 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 195/195 places, 138/138 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 195 transition count 136
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 195 transition count 136
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 194 transition count 135
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 194 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 193 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 192 transition count 134
Applied a total of 12 rules in 63 ms. Remains 192 /195 variables (removed 3) and now considering 134/138 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 192/195 places, 134/138 transitions.
Incomplete random walk after 1000000 steps, including 13642 resets, run finished after 2857 ms. (steps per millisecond=350 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2658 resets, run finished after 1261 ms. (steps per millisecond=793 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2386 resets, run finished after 1102 ms. (steps per millisecond=907 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2289 resets, run finished after 1109 ms. (steps per millisecond=901 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 17175372 steps, run timeout after 30001 ms. (steps per millisecond=572 ) properties seen :[0, 0, 0]
Probabilistic random walk after 17175372 steps, saw 2101313 distinct states, run finished after 30001 ms. (steps per millisecond=572 ) properties seen :[0, 0, 0]
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 20:36:57] [INFO ] Computed 60 place invariants in 6 ms
[2021-05-08 20:36:58] [INFO ] [Real]Absence check using 36 positive place invariants in 41 ms returned sat
[2021-05-08 20:36:58] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2021-05-08 20:36:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:58] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2021-05-08 20:36:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2021-05-08 20:36:58] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 31 ms returned sat
[2021-05-08 20:36:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:58] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2021-05-08 20:36:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 20:36:58] [INFO ] [Nat]Added 2 Read/Feed constraints in 9 ms returned sat
[2021-05-08 20:36:58] [INFO ] Computed and/alt/rep : 131/356/131 causal constraints in 8 ms.
[2021-05-08 20:36:58] [INFO ] Added : 106 causal constraints over 22 iterations in 260 ms. Result :sat
[2021-05-08 20:36:58] [INFO ] Deduced a trap composed of 11 places in 45 ms
[2021-05-08 20:36:58] [INFO ] Deduced a trap composed of 20 places in 11 ms
[2021-05-08 20:36:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 88 ms
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-08 20:36:58] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 20:36:58] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2021-05-08 20:36:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:59] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2021-05-08 20:36:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:59] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2021-05-08 20:36:59] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 62 ms returned sat
[2021-05-08 20:36:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:59] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2021-05-08 20:36:59] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:36:59] [INFO ] Deduced a trap composed of 6 places in 25 ms
[2021-05-08 20:36:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2021-05-08 20:36:59] [INFO ] Computed and/alt/rep : 131/356/131 causal constraints in 9 ms.
[2021-05-08 20:36:59] [INFO ] Added : 125 causal constraints over 25 iterations in 434 ms. Result :sat
[2021-05-08 20:36:59] [INFO ] Deduced a trap composed of 16 places in 43 ms
[2021-05-08 20:36:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-08 20:36:59] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2021-05-08 20:36:59] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-08 20:36:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:37:00] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2021-05-08 20:37:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:37:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2021-05-08 20:37:00] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2021-05-08 20:37:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:37:00] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2021-05-08 20:37:00] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:37:00] [INFO ] Computed and/alt/rep : 131/356/131 causal constraints in 9 ms.
[2021-05-08 20:37:00] [INFO ] Added : 128 causal constraints over 26 iterations in 272 ms. Result :sat
[2021-05-08 20:37:00] [INFO ] Deduced a trap composed of 20 places in 11 ms
[2021-05-08 20:37:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
Attempting to minimize the solution found.
Minimization took 5 ms.
Incomplete Parikh walk after 91100 steps, including 1362 resets, run finished after 275 ms. (steps per millisecond=331 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 95600 steps, including 1415 resets, run finished after 281 ms. (steps per millisecond=340 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 79700 steps, including 1193 resets, run finished after 230 ms. (steps per millisecond=346 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 9 out of 192 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 8 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 7 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 20:37:01] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 20:37:01] [INFO ] Implicit Places using invariants in 464 ms returned []
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 20:37:01] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 20:37:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 20:37:02] [INFO ] Implicit Places using invariants and state equation in 731 ms returned []
Implicit Place search using SMT with State Equation took 1198 ms to find 0 implicit places.
[2021-05-08 20:37:02] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 20:37:02] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 20:37:02] [INFO ] Dead Transitions using invariants and state equation in 206 ms returned []
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 134/134 transitions.
Incomplete random walk after 100000 steps, including 1367 resets, run finished after 291 ms. (steps per millisecond=343 ) properties seen :[0, 0, 0]
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 20:37:03] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 20:37:03] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2021-05-08 20:37:03] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 21 ms returned sat
[2021-05-08 20:37:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:37:03] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2021-05-08 20:37:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:37:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2021-05-08 20:37:03] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 33 ms returned sat
[2021-05-08 20:37:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:37:03] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2021-05-08 20:37:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 20:37:03] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:37:03] [INFO ] Computed and/alt/rep : 131/356/131 causal constraints in 9 ms.
[2021-05-08 20:37:03] [INFO ] Added : 106 causal constraints over 22 iterations in 260 ms. Result :sat
[2021-05-08 20:37:03] [INFO ] Deduced a trap composed of 11 places in 41 ms
[2021-05-08 20:37:03] [INFO ] Deduced a trap composed of 20 places in 18 ms
[2021-05-08 20:37:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 88 ms
[2021-05-08 20:37:04] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2021-05-08 20:37:04] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2021-05-08 20:37:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:37:04] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2021-05-08 20:37:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:37:04] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2021-05-08 20:37:04] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 61 ms returned sat
[2021-05-08 20:37:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:37:04] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2021-05-08 20:37:04] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2021-05-08 20:37:04] [INFO ] Deduced a trap composed of 6 places in 24 ms
[2021-05-08 20:37:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2021-05-08 20:37:04] [INFO ] Computed and/alt/rep : 131/356/131 causal constraints in 8 ms.
[2021-05-08 20:37:04] [INFO ] Added : 125 causal constraints over 25 iterations in 298 ms. Result :sat
[2021-05-08 20:37:04] [INFO ] Deduced a trap composed of 16 places in 47 ms
[2021-05-08 20:37:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2021-05-08 20:37:04] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2021-05-08 20:37:04] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2021-05-08 20:37:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:37:05] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2021-05-08 20:37:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:37:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2021-05-08 20:37:05] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2021-05-08 20:37:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:37:05] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2021-05-08 20:37:05] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:37:05] [INFO ] Computed and/alt/rep : 131/356/131 causal constraints in 12 ms.
[2021-05-08 20:37:05] [INFO ] Added : 128 causal constraints over 26 iterations in 264 ms. Result :sat
[2021-05-08 20:37:05] [INFO ] Deduced a trap composed of 20 places in 12 ms
[2021-05-08 20:37:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
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 192 transition count 134
Applied a total of 1 rules in 10 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 192 cols
[2021-05-08 20:37:05] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 20:37:05] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2021-05-08 20:37:05] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2021-05-08 20:37:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:37:05] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2021-05-08 20:37:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:37:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2021-05-08 20:37:05] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 32 ms returned sat
[2021-05-08 20:37:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:37:06] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2021-05-08 20:37:06] [INFO ] Computed and/alt/rep : 131/352/131 causal constraints in 8 ms.
[2021-05-08 20:37:06] [INFO ] Added : 105 causal constraints over 21 iterations in 259 ms. Result :sat
[2021-05-08 20:37:06] [INFO ] Deduced a trap composed of 10 places in 30 ms
[2021-05-08 20:37:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
Attempting to minimize the solution found.
Minimization took 4 ms.
[2021-05-08 20:37:06] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2021-05-08 20:37:06] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2021-05-08 20:37:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:37:06] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2021-05-08 20:37:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:37:06] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2021-05-08 20:37:06] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 61 ms returned sat
[2021-05-08 20:37:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:37:06] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2021-05-08 20:37:06] [INFO ] Computed and/alt/rep : 131/352/131 causal constraints in 9 ms.
[2021-05-08 20:37:07] [INFO ] Added : 126 causal constraints over 26 iterations in 285 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-08 20:37:07] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2021-05-08 20:37:07] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2021-05-08 20:37:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:37:07] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2021-05-08 20:37:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:37:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2021-05-08 20:37:07] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2021-05-08 20:37:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:37:07] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2021-05-08 20:37:07] [INFO ] Computed and/alt/rep : 131/352/131 causal constraints in 9 ms.
[2021-05-08 20:37:07] [INFO ] Added : 129 causal constraints over 26 iterations in 258 ms. Result :sat
[2021-05-08 20:37:07] [INFO ] Deduced a trap composed of 5 places in 14 ms
[2021-05-08 20:37:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-08 20:37:07] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2021-05-08 20:37:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
[2021-05-08 20:37:08] [INFO ] Flatten gal took : 80 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DES-PT-20a @ 3570 seconds

FORMULA DES-PT-20a-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA DES-PT-20a-ReachabilityCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3568
rslt: Output for ReachabilityCardinality @ DES-PT-20a

{
"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 20:37:09 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "A (G (((p2 <= 0))))",
"processed_size": 19,
"rewrites": 2
},
"result":
{
"edges": 861,
"markings": 862,
"produced_by": "state space",
"value": false
},
"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": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1784
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p64)) AND ((p125 <= 0)))))",
"processed_size": 40,
"rewrites": 1
},
"result":
{
"edges": 721,
"markings": 700,
"produced_by": "state space",
"value": true
},
"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": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3568
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 4,
"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": "E (F ((((1 <= p11)) AND ((p154 <= 0)) AND (((p17 <= 0)) OR ((1 <= p7))) AND (((p164 <= 0)) OR ((1 <= p86))))))",
"processed_size": 112,
"rewrites": 1
},
"result":
{
"edges": 429,
"markings": 430,
"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": 16,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 19984,
"runtime": 2.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 647,
"conflict_clusters": 40,
"places": 192,
"places_significant": 132,
"singleton_clusters": 0,
"transitions": 134
},
"result":
{
"preliminary_value": "yes yes no ",
"value": "yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 326/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 192
lola: finding significant places
lola: 192 places, 134 transitions, 132 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: (p154 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: E (F ((((1 <= p11)) AND ((p154 <= 0)) AND (((p17 <= 0)) OR ((1 <= p7))) AND (((p164 <= 0)) OR ((1 <= p86)))))) : E (F ((((1 <= p64)) AND ((p125 <= 0))))) : A (G (((p2 <= 0))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p2 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p2 <= 0))))
lola: processed formula length: 19
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 <= p2))
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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 862 markings, 861 edges
lola: ========================================
lola: subprocess 1 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p64)) AND ((p125 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p64)) AND ((p125 <= 0)))))
lola: processed formula length: 40
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 <= p64)) AND ((p125 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 700 markings, 721 edges
lola: ========================================
lola: subprocess 2 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p11)) AND ((p154 <= 0)) AND (((p17 <= 0)) OR ((1 <= p7))) AND (((p164 <= 0)) OR ((1 <= p86))))))
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 <= p11)) AND ((p154 <= 0)) AND (((p17 <= 0)) OR ((1 <= p7))) AND (((p164 <= 0)) OR ((1 <= p86))))))
lola: processed formula length: 112
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 <= p11)) AND ((p154 <= 0)) AND (((p17 <= 0)) OR ((1 <= p7))) AND (((p164 <= 0)) OR ((1 <= p86))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 430 markings, 429 edges
lola: state equation: write sara problem file to ReachabilityCardinality-2-0.sara
lola: RESULT
lola:
SUMMARY: yes yes no
lola:
preliminary result: yes yes no
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file ReachabilityCardinality-2-0.sara.
lola: memory consumption: 19984 KB
lola: time consumption: 2 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
sara: place or transition ordering is non-deterministic
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 16130652 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16130660 kB

--------------------
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-20a"
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-20a, 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-162039097100043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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