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-162039097100056.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-30b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097100056
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 127K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 97K 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.2K Mar 28 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 17K Mar 28 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 03:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 103K 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-30b-ReachabilityFireability-00
FORMULA_NAME DES-PT-30b-ReachabilityFireability-01
FORMULA_NAME DES-PT-30b-ReachabilityFireability-02
FORMULA_NAME DES-PT-30b-ReachabilityFireability-03
FORMULA_NAME DES-PT-30b-ReachabilityFireability-04
FORMULA_NAME DES-PT-30b-ReachabilityFireability-05
FORMULA_NAME DES-PT-30b-ReachabilityFireability-06
FORMULA_NAME DES-PT-30b-ReachabilityFireability-07
FORMULA_NAME DES-PT-30b-ReachabilityFireability-08
FORMULA_NAME DES-PT-30b-ReachabilityFireability-09
FORMULA_NAME DES-PT-30b-ReachabilityFireability-10
FORMULA_NAME DES-PT-30b-ReachabilityFireability-11
FORMULA_NAME DES-PT-30b-ReachabilityFireability-12
FORMULA_NAME DES-PT-30b-ReachabilityFireability-13
FORMULA_NAME DES-PT-30b-ReachabilityFireability-14
FORMULA_NAME DES-PT-30b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620509760119

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 21:36:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-08 21:36:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 21:36:01] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2021-05-08 21:36:01] [INFO ] Transformed 399 places.
[2021-05-08 21:36:01] [INFO ] Transformed 350 transitions.
[2021-05-08 21:36:01] [INFO ] Found NUPN structural information;
[2021-05-08 21:36:01] [INFO ] Parsed PT model containing 399 places and 350 transitions in 119 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-30b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 80 resets, run finished after 79 ms. (steps per millisecond=126 ) properties seen :[0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0]
FORMULA DES-PT-30b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 350 rows 399 cols
[2021-05-08 21:36:02] [INFO ] Computed 65 place invariants in 29 ms
[2021-05-08 21:36:02] [INFO ] [Real]Absence check using 39 positive place invariants in 36 ms returned sat
[2021-05-08 21:36:02] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 34 ms returned sat
[2021-05-08 21:36:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:36:03] [INFO ] [Real]Absence check using state equation in 942 ms returned sat
[2021-05-08 21:36:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:36:03] [INFO ] [Nat]Absence check using 39 positive place invariants in 45 ms returned sat
[2021-05-08 21:36:03] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 44 ms returned sat
[2021-05-08 21:36:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:36:04] [INFO ] [Nat]Absence check using state equation in 936 ms returned sat
[2021-05-08 21:36:04] [INFO ] Deduced a trap composed of 8 places in 144 ms
[2021-05-08 21:36:04] [INFO ] Deduced a trap composed of 61 places in 109 ms
[2021-05-08 21:36:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 332 ms
[2021-05-08 21:36:04] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 21 ms.
[2021-05-08 21:36:06] [INFO ] Added : 263 causal constraints over 54 iterations in 1837 ms. Result :sat
[2021-05-08 21:36:06] [INFO ] Deduced a trap composed of 56 places in 103 ms
[2021-05-08 21:36:06] [INFO ] Deduced a trap composed of 52 places in 100 ms
[2021-05-08 21:36:07] [INFO ] Deduced a trap composed of 57 places in 89 ms
[2021-05-08 21:36:07] [INFO ] Deduced a trap composed of 59 places in 93 ms
[2021-05-08 21:36:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 555 ms
Attempting to minimize the solution found.
Minimization took 21 ms.
[2021-05-08 21:36:07] [INFO ] [Real]Absence check using 39 positive place invariants in 29 ms returned sat
[2021-05-08 21:36:07] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 30 ms returned sat
[2021-05-08 21:36:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:36:08] [INFO ] [Real]Absence check using state equation in 819 ms returned sat
[2021-05-08 21:36:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:36:08] [INFO ] [Nat]Absence check using 39 positive place invariants in 36 ms returned sat
[2021-05-08 21:36:08] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 51 ms returned sat
[2021-05-08 21:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:36:08] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2021-05-08 21:36:09] [INFO ] Deduced a trap composed of 8 places in 136 ms
[2021-05-08 21:36:09] [INFO ] Deduced a trap composed of 32 places in 60 ms
[2021-05-08 21:36:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 234 ms
[2021-05-08 21:36:09] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 33 ms.
[2021-05-08 21:36:11] [INFO ] Added : 315 causal constraints over 63 iterations in 2011 ms. Result :sat
[2021-05-08 21:36:11] [INFO ] Deduced a trap composed of 35 places in 96 ms
[2021-05-08 21:36:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
Attempting to minimize the solution found.
Minimization took 15 ms.
[2021-05-08 21:36:11] [INFO ] [Real]Absence check using 39 positive place invariants in 23 ms returned sat
[2021-05-08 21:36:11] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 42 ms returned sat
[2021-05-08 21:36:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:36:11] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2021-05-08 21:36:12] [INFO ] Deduced a trap composed of 13 places in 164 ms
[2021-05-08 21:36:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2021-05-08 21:36:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:36:12] [INFO ] [Nat]Absence check using 39 positive place invariants in 36 ms returned sat
[2021-05-08 21:36:12] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 46 ms returned sat
[2021-05-08 21:36:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:36:12] [INFO ] [Nat]Absence check using state equation in 614 ms returned sat
[2021-05-08 21:36:13] [INFO ] Deduced a trap composed of 12 places in 133 ms
[2021-05-08 21:36:13] [INFO ] Deduced a trap composed of 15 places in 129 ms
[2021-05-08 21:36:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 305 ms
[2021-05-08 21:36:13] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 16 ms.
[2021-05-08 21:36:15] [INFO ] Added : 337 causal constraints over 68 iterations in 1968 ms. Result :sat
[2021-05-08 21:36:15] [INFO ] Deduced a trap composed of 32 places in 103 ms
[2021-05-08 21:36:15] [INFO ] Deduced a trap composed of 52 places in 77 ms
[2021-05-08 21:36:15] [INFO ] Deduced a trap composed of 54 places in 78 ms
[2021-05-08 21:36:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 373 ms
Attempting to minimize the solution found.
Minimization took 17 ms.
[2021-05-08 21:36:15] [INFO ] [Real]Absence check using 39 positive place invariants in 24 ms returned sat
[2021-05-08 21:36:15] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 30 ms returned sat
[2021-05-08 21:36:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:36:16] [INFO ] [Real]Absence check using state equation in 1190 ms returned sat
[2021-05-08 21:36:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:36:17] [INFO ] [Nat]Absence check using 39 positive place invariants in 38 ms returned sat
[2021-05-08 21:36:17] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 40 ms returned sat
[2021-05-08 21:36:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:36:18] [INFO ] [Nat]Absence check using state equation in 1003 ms returned sat
[2021-05-08 21:36:18] [INFO ] Deduced a trap composed of 8 places in 64 ms
[2021-05-08 21:36:18] [INFO ] Deduced a trap composed of 21 places in 14 ms
[2021-05-08 21:36:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2021-05-08 21:36:18] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 18 ms.
[2021-05-08 21:36:20] [INFO ] Added : 342 causal constraints over 70 iterations in 2150 ms. Result :sat
[2021-05-08 21:36:20] [INFO ] Deduced a trap composed of 31 places in 51 ms
[2021-05-08 21:36:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
Attempting to minimize the solution found.
Minimization took 24 ms.
Incomplete Parikh walk after 423100 steps, including 4427 resets, run finished after 1230 ms. (steps per millisecond=343 ) properties seen :[0, 1, 0, 1] could not realise parikh vector
FORMULA DES-PT-30b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-30b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 362900 steps, including 3780 resets, run finished after 981 ms. (steps per millisecond=369 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 441900 steps, including 4711 resets, run finished after 1206 ms. (steps per millisecond=366 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 218500 steps, including 2315 resets, run finished after 582 ms. (steps per millisecond=375 ) properties seen :[0, 0] could not realise parikh vector
Support contains 11 out of 399 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 399/399 places, 350/350 transitions.
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (complete) has 858 edges and 399 vertex of which 388 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.6 ms
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 388 transition count 326
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 371 transition count 326
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 37 place count 371 transition count 315
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 360 transition count 315
Symmetric choice reduction at 2 with 17 rule applications. Total rules 76 place count 360 transition count 315
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 17 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 110 place count 343 transition count 298
Symmetric choice reduction at 2 with 13 rule applications. Total rules 123 place count 343 transition count 298
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 13 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 149 place count 330 transition count 285
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 161 place count 330 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 162 place count 329 transition count 273
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 162 place count 329 transition count 270
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 168 place count 326 transition count 270
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 308 place count 256 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 309 place count 256 transition count 199
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 313 place count 254 transition count 209
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 314 place count 254 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 315 place count 253 transition count 208
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 316 place count 252 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 317 place count 251 transition count 207
Applied a total of 317 rules in 152 ms. Remains 251 /399 variables (removed 148) and now considering 207/350 (removed 143) transitions.
Finished structural reductions, in 1 iterations. Remains : 251/399 places, 207/350 transitions.
Incomplete random walk after 1000000 steps, including 31632 resets, run finished after 3044 ms. (steps per millisecond=328 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5878 resets, run finished after 1292 ms. (steps per millisecond=773 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5234 resets, run finished after 1005 ms. (steps per millisecond=995 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 15857371 steps, run timeout after 30001 ms. (steps per millisecond=528 ) properties seen :[0, 0]
Probabilistic random walk after 15857371 steps, saw 1962930 distinct states, run finished after 30001 ms. (steps per millisecond=528 ) properties seen :[0, 0]
// Phase 1: matrix 207 rows 251 cols
[2021-05-08 21:37:00] [INFO ] Computed 60 place invariants in 10 ms
[2021-05-08 21:37:00] [INFO ] [Real]Absence check using 36 positive place invariants in 35 ms returned sat
[2021-05-08 21:37:00] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2021-05-08 21:37:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:00] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2021-05-08 21:37:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:37:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-08 21:37:00] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 36 ms returned sat
[2021-05-08 21:37:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:00] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2021-05-08 21:37:00] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-08 21:37:00] [INFO ] [Nat]Added 12 Read/Feed constraints in 5 ms returned sat
[2021-05-08 21:37:00] [INFO ] Deduced a trap composed of 9 places in 33 ms
[2021-05-08 21:37:00] [INFO ] Deduced a trap composed of 6 places in 44 ms
[2021-05-08 21:37:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2021-05-08 21:37:01] [INFO ] Computed and/alt/rep : 204/1499/204 causal constraints in 18 ms.
[2021-05-08 21:37:01] [INFO ] Added : 147 causal constraints over 30 iterations in 898 ms. Result :sat
[2021-05-08 21:37:01] [INFO ] Deduced a trap composed of 29 places in 41 ms
[2021-05-08 21:37:02] [INFO ] Deduced a trap composed of 28 places in 49 ms
[2021-05-08 21:37:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 210 ms
Attempting to minimize the solution found.
Minimization took 17 ms.
[2021-05-08 21:37:02] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 21:37:02] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2021-05-08 21:37:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:02] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2021-05-08 21:37:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:37:02] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 21:37:02] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 32 ms returned sat
[2021-05-08 21:37:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:02] [INFO ] [Nat]Absence check using state equation in 339 ms returned sat
[2021-05-08 21:37:02] [INFO ] [Nat]Added 12 Read/Feed constraints in 3 ms returned sat
[2021-05-08 21:37:02] [INFO ] Computed and/alt/rep : 204/1499/204 causal constraints in 11 ms.
[2021-05-08 21:37:03] [INFO ] Added : 199 causal constraints over 40 iterations in 819 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
Incomplete Parikh walk after 170200 steps, including 6605 resets, run finished after 542 ms. (steps per millisecond=314 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 126600 steps, including 4949 resets, run finished after 401 ms. (steps per millisecond=315 ) properties seen :[0, 0] could not realise parikh vector
Support contains 11 out of 251 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 251/251 places, 207/207 transitions.
Applied a total of 0 rules in 14 ms. Remains 251 /251 variables (removed 0) and now considering 207/207 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 251/251 places, 207/207 transitions.
Starting structural reductions, iteration 0 : 251/251 places, 207/207 transitions.
Applied a total of 0 rules in 11 ms. Remains 251 /251 variables (removed 0) and now considering 207/207 (removed 0) transitions.
// Phase 1: matrix 207 rows 251 cols
[2021-05-08 21:37:04] [INFO ] Computed 60 place invariants in 5 ms
[2021-05-08 21:37:05] [INFO ] Implicit Places using invariants in 465 ms returned []
// Phase 1: matrix 207 rows 251 cols
[2021-05-08 21:37:05] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 21:37:05] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-08 21:37:06] [INFO ] Implicit Places using invariants and state equation in 1292 ms returned []
Implicit Place search using SMT with State Equation took 1758 ms to find 0 implicit places.
[2021-05-08 21:37:06] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 207 rows 251 cols
[2021-05-08 21:37:06] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 21:37:06] [INFO ] Dead Transitions using invariants and state equation in 338 ms returned []
Finished structural reductions, in 1 iterations. Remains : 251/251 places, 207/207 transitions.
Incomplete random walk after 100000 steps, including 3122 resets, run finished after 320 ms. (steps per millisecond=312 ) properties seen :[0, 0]
// Phase 1: matrix 207 rows 251 cols
[2021-05-08 21:37:07] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 21:37:07] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 21:37:07] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2021-05-08 21:37:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:07] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2021-05-08 21:37:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:37:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 21:37:07] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 35 ms returned sat
[2021-05-08 21:37:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:07] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2021-05-08 21:37:07] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-08 21:37:07] [INFO ] [Nat]Added 12 Read/Feed constraints in 5 ms returned sat
[2021-05-08 21:37:07] [INFO ] Deduced a trap composed of 9 places in 33 ms
[2021-05-08 21:37:07] [INFO ] Deduced a trap composed of 6 places in 29 ms
[2021-05-08 21:37:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 86 ms
[2021-05-08 21:37:07] [INFO ] Computed and/alt/rep : 204/1499/204 causal constraints in 11 ms.
[2021-05-08 21:37:08] [INFO ] Added : 147 causal constraints over 30 iterations in 894 ms. Result :sat
[2021-05-08 21:37:08] [INFO ] Deduced a trap composed of 29 places in 36 ms
[2021-05-08 21:37:09] [INFO ] Deduced a trap composed of 28 places in 59 ms
[2021-05-08 21:37:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 206 ms
[2021-05-08 21:37:09] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 21:37:09] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2021-05-08 21:37:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:09] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2021-05-08 21:37:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:37:09] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 21:37:09] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 32 ms returned sat
[2021-05-08 21:37:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:09] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2021-05-08 21:37:09] [INFO ] [Nat]Added 12 Read/Feed constraints in 4 ms returned sat
[2021-05-08 21:37:09] [INFO ] Computed and/alt/rep : 204/1499/204 causal constraints in 11 ms.
[2021-05-08 21:37:10] [INFO ] Added : 199 causal constraints over 40 iterations in 824 ms. Result :sat
Applied a total of 0 rules in 9 ms. Remains 251 /251 variables (removed 0) and now considering 207/207 (removed 0) transitions.
// Phase 1: matrix 207 rows 251 cols
[2021-05-08 21:37:10] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 21:37:10] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 21:37:10] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2021-05-08 21:37:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:11] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2021-05-08 21:37:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:37:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 21:37:11] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 37 ms returned sat
[2021-05-08 21:37:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:11] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2021-05-08 21:37:11] [INFO ] Deduced a trap composed of 10 places in 22 ms
[2021-05-08 21:37:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2021-05-08 21:37:11] [INFO ] Computed and/alt/rep : 204/1454/204 causal constraints in 11 ms.
[2021-05-08 21:37:12] [INFO ] Added : 152 causal constraints over 32 iterations in 1467 ms. Result :sat
[2021-05-08 21:37:13] [INFO ] Deduced a trap composed of 20 places in 36 ms
[2021-05-08 21:37:13] [INFO ] Deduced a trap composed of 31 places in 37 ms
[2021-05-08 21:37:13] [INFO ] Deduced a trap composed of 22 places in 68 ms
[2021-05-08 21:37:13] [INFO ] Deduced a trap composed of 10 places in 50 ms
[2021-05-08 21:37:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 344 ms
Attempting to minimize the solution found.
Minimization took 16 ms.
[2021-05-08 21:37:13] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 21:37:13] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2021-05-08 21:37:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:13] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2021-05-08 21:37:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:37:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 21:37:13] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 33 ms returned sat
[2021-05-08 21:37:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:14] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2021-05-08 21:37:14] [INFO ] Computed and/alt/rep : 204/1454/204 causal constraints in 11 ms.
[2021-05-08 21:37:14] [INFO ] Added : 197 causal constraints over 40 iterations in 839 ms. Result :sat
[2021-05-08 21:37:14] [INFO ] Deduced a trap composed of 14 places in 27 ms
[2021-05-08 21:37:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
Attempting to minimize the solution found.
Minimization took 16 ms.
[2021-05-08 21:37:14] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 1 ms.
[2021-05-08 21:37:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
[2021-05-08 21:37:15] [INFO ] Flatten gal took : 58 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ DES-PT-30b @ 3570 seconds

FORMULA DES-PT-30b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-30b-ReachabilityFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for ReachabilityFireability @ DES-PT-30b

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

{
"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": 0,
"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 (1 <= p155))))",
"processed_size": 36,
"rewrites": 1
},
"result":
{
"edges": 16702,
"markings": 15753,
"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": 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": 2,
"adisj": 2,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p110) AND (1 <= p126) AND ((p32 <= 0) OR (p244 <= 0) OR ((1 <= p245) AND (1 <= p123))) AND ((p128 <= 0) OR (p200 <= 0) OR (p202 <= 0)))))",
"processed_size": 154,
"rewrites": 1
},
"result":
{
"edges": 677152,
"markings": 508017,
"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": 39,
"problems": 9
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 21428,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 1030,
"conflict_clusters": 61,
"places": 251,
"places_significant": 191,
"singleton_clusters": 0,
"transitions": 207
},
"result":
{
"preliminary_value": "yes yes ",
"value": "yes yes "
},
"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: 458/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 251
lola: finding significant places
lola: 251 places, 207 transitions, 191 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p244 <= 1)
lola: LP says that atomic proposition is always true: (p245 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p200 <= 1)
lola: LP says that atomic proposition is always true: (p202 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p155 <= 1)
lola: E (F (((1 <= p110) AND (1 <= p126) AND ((p32 <= 0) OR (p244 <= 0) OR ((1 <= p245) AND (1 <= p123))) AND ((p128 <= 0) OR (p200 <= 0) OR (p202 <= 0))))) : E (F (((1 <= p64) AND (1 <= p155))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p64) AND (1 <= p155))))
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 (1 <= p155))))
lola: processed formula length: 36
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p64) AND (1 <= p155))
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 ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15753 markings, 16702 edges
lola: ========================================
lola: subprocess 1 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p110) AND (1 <= p126) AND ((p32 <= 0) OR (p244 <= 0) OR ((1 <= p245) AND (1 <= p123))) AND ((p128 <= 0) OR (p200 <= 0) OR (p202 <= 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 <= p110) AND (1 <= p126) AND ((p32 <= 0) OR (p244 <= 0) OR ((1 <= p245) AND (1 <= p123))) AND ((p128 <= 0) OR (p200 <= 0) OR (p202 <= 0)))))
lola: processed formula length: 154
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p110) AND (1 <= p126) AND ((p32 <= 0) OR (p244 <= 0) OR ((1 <= p245) AND (1 <= p123))) AND ((p128 <= 0) OR (p200 <= 0) OR (p202 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 39 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 508017 markings, 677152 edges
lola: RESULT
lola:
SUMMARY: yes yes
lola:
preliminary result: yes yes
lola: ========================================
lola: memory consumption: 21428 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is DES-PT-30b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r075-tall-162039097100056"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-30b.tgz
mv DES-PT-30b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;