fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r075-tall-162039097100040
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for DES-PT-10b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4276.688 3600000.00 70151.00 401.70 TFFFTFFFTTTTTFTF normal

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

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

=== Now, execution of the tool begins

BK_START 1620506115478

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 20:35:17] [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 20:35:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 20:35:17] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2021-05-08 20:35:17] [INFO ] Transformed 320 places.
[2021-05-08 20:35:17] [INFO ] Transformed 271 transitions.
[2021-05-08 20:35:17] [INFO ] Found NUPN structural information;
[2021-05-08 20:35:17] [INFO ] Parsed PT model containing 320 places and 271 transitions in 107 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 82 resets, run finished after 65 ms. (steps per millisecond=153 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1]
FORMULA DES-PT-10b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0]
// Phase 1: matrix 271 rows 320 cols
[2021-05-08 20:35:17] [INFO ] Computed 65 place invariants in 22 ms
[2021-05-08 20:35:17] [INFO ] [Real]Absence check using 39 positive place invariants in 33 ms returned sat
[2021-05-08 20:35:17] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 19 ms returned sat
[2021-05-08 20:35:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:17] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2021-05-08 20:35:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:35:18] [INFO ] [Nat]Absence check using 39 positive place invariants in 35 ms returned sat
[2021-05-08 20:35:18] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 33 ms returned sat
[2021-05-08 20:35:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:18] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2021-05-08 20:35:18] [INFO ] Deduced a trap composed of 8 places in 119 ms
[2021-05-08 20:35:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2021-05-08 20:35:18] [INFO ] Computed and/alt/rep : 270/550/270 causal constraints in 16 ms.
[2021-05-08 20:35:19] [INFO ] Added : 245 causal constraints over 49 iterations in 1182 ms. Result :sat
[2021-05-08 20:35:19] [INFO ] Deduced a trap composed of 33 places in 87 ms
[2021-05-08 20:35:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
Attempting to minimize the solution found.
Minimization took 30 ms.
[2021-05-08 20:35:20] [INFO ] [Real]Absence check using 39 positive place invariants in 34 ms returned sat
[2021-05-08 20:35:20] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 18 ms returned sat
[2021-05-08 20:35:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:20] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2021-05-08 20:35:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:35:20] [INFO ] [Nat]Absence check using 39 positive place invariants in 25 ms returned sat
[2021-05-08 20:35:20] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 20 ms returned sat
[2021-05-08 20:35:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:21] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2021-05-08 20:35:21] [INFO ] Deduced a trap composed of 14 places in 100 ms
[2021-05-08 20:35:21] [INFO ] Deduced a trap composed of 13 places in 142 ms
[2021-05-08 20:35:21] [INFO ] Deduced a trap composed of 36 places in 105 ms
[2021-05-08 20:35:21] [INFO ] Deduced a trap composed of 40 places in 114 ms
[2021-05-08 20:35:21] [INFO ] Deduced a trap composed of 34 places in 93 ms
[2021-05-08 20:35:21] [INFO ] Deduced a trap composed of 19 places in 92 ms
[2021-05-08 20:35:21] [INFO ] Deduced a trap composed of 39 places in 93 ms
[2021-05-08 20:35:21] [INFO ] Deduced a trap composed of 12 places in 84 ms
[2021-05-08 20:35:22] [INFO ] Deduced a trap composed of 17 places in 80 ms
[2021-05-08 20:35:22] [INFO ] Deduced a trap composed of 24 places in 83 ms
[2021-05-08 20:35:22] [INFO ] Deduced a trap composed of 13 places in 88 ms
[2021-05-08 20:35:22] [INFO ] Deduced a trap composed of 36 places in 59 ms
[2021-05-08 20:35:22] [INFO ] Deduced a trap composed of 31 places in 55 ms
[2021-05-08 20:35:22] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1387 ms
[2021-05-08 20:35:22] [INFO ] Computed and/alt/rep : 270/550/270 causal constraints in 33 ms.
[2021-05-08 20:35:23] [INFO ] Added : 261 causal constraints over 53 iterations in 1145 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-08 20:35:23] [INFO ] [Real]Absence check using 39 positive place invariants in 21 ms returned sat
[2021-05-08 20:35:23] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 19 ms returned sat
[2021-05-08 20:35:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:23] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2021-05-08 20:35:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:35:24] [INFO ] [Nat]Absence check using 39 positive place invariants in 25 ms returned sat
[2021-05-08 20:35:24] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 23 ms returned sat
[2021-05-08 20:35:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:24] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2021-05-08 20:35:24] [INFO ] Deduced a trap composed of 12 places in 87 ms
[2021-05-08 20:35:24] [INFO ] Deduced a trap composed of 17 places in 84 ms
[2021-05-08 20:35:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
[2021-05-08 20:35:24] [INFO ] Computed and/alt/rep : 270/550/270 causal constraints in 16 ms.
[2021-05-08 20:35:25] [INFO ] Added : 235 causal constraints over 47 iterations in 962 ms. Result :unsat
FORMULA DES-PT-10b-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 172200 steps, including 1867 resets, run finished after 529 ms. (steps per millisecond=325 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 86400 steps, including 1025 resets, run finished after 241 ms. (steps per millisecond=358 ) properties seen :[0, 0] could not realise parikh vector
Support contains 10 out of 320 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 320/320 places, 271/271 transitions.
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (complete) has 621 edges and 320 vertex of which 309 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 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 309 transition count 245
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 41 place count 290 transition count 245
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 41 place count 290 transition count 236
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 59 place count 281 transition count 236
Symmetric choice reduction at 2 with 18 rule applications. Total rules 77 place count 281 transition count 236
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 18 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 113 place count 263 transition count 218
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 113 place count 263 transition count 217
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 115 place count 262 transition count 217
Symmetric choice reduction at 2 with 13 rule applications. Total rules 128 place count 262 transition count 217
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 13 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 154 place count 249 transition count 204
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 13 rules applied. Total rules applied 167 place count 249 transition count 191
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 170 place count 247 transition count 190
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 314 place count 175 transition count 118
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 320 place count 172 transition count 121
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 322 place count 172 transition count 119
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 324 place count 170 transition count 119
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 327 place count 170 transition count 119
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 328 place count 169 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 329 place count 168 transition count 118
Applied a total of 329 rules in 114 ms. Remains 168 /320 variables (removed 152) and now considering 118/271 (removed 153) transitions.
Finished structural reductions, in 1 iterations. Remains : 168/320 places, 118/271 transitions.
Incomplete random walk after 1000000 steps, including 31028 resets, run finished after 2967 ms. (steps per millisecond=337 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5479 resets, run finished after 1243 ms. (steps per millisecond=804 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4868 resets, run finished after 1256 ms. (steps per millisecond=796 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 17774871 steps, run timeout after 30001 ms. (steps per millisecond=592 ) properties seen :[0, 0]
Probabilistic random walk after 17774871 steps, saw 1855276 distinct states, run finished after 30001 ms. (steps per millisecond=592 ) properties seen :[0, 0]
// Phase 1: matrix 118 rows 168 cols
[2021-05-08 20:36:01] [INFO ] Computed 60 place invariants in 10 ms
[2021-05-08 20:36:01] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2021-05-08 20:36:01] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2021-05-08 20:36:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:02] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2021-05-08 20:36:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:02] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2021-05-08 20:36:02] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2021-05-08 20:36:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:02] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2021-05-08 20:36:02] [INFO ] Computed and/alt/rep : 115/477/115 causal constraints in 7 ms.
[2021-05-08 20:36:02] [INFO ] Added : 100 causal constraints over 20 iterations in 296 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-08 20:36:02] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2021-05-08 20:36:02] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2021-05-08 20:36:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:02] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2021-05-08 20:36:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:02] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2021-05-08 20:36:02] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2021-05-08 20:36:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:03] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2021-05-08 20:36:03] [INFO ] Computed and/alt/rep : 115/477/115 causal constraints in 7 ms.
[2021-05-08 20:36:03] [INFO ] Added : 113 causal constraints over 23 iterations in 326 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
Incomplete Parikh walk after 46000 steps, including 1998 resets, run finished after 143 ms. (steps per millisecond=321 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 29900 steps, including 1328 resets, run finished after 95 ms. (steps per millisecond=314 ) properties seen :[0, 0] could not realise parikh vector
Support contains 10 out of 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 118/118 transitions.
Applied a total of 0 rules in 6 ms. Remains 168 /168 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 168/168 places, 118/118 transitions.
Starting structural reductions, iteration 0 : 168/168 places, 118/118 transitions.
Applied a total of 0 rules in 6 ms. Remains 168 /168 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 168 cols
[2021-05-08 20:36:03] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 20:36:03] [INFO ] Implicit Places using invariants in 206 ms returned []
// Phase 1: matrix 118 rows 168 cols
[2021-05-08 20:36:03] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 20:36:04] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
[2021-05-08 20:36:04] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 118 rows 168 cols
[2021-05-08 20:36:04] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 20:36:04] [INFO ] Dead Transitions using invariants and state equation in 162 ms returned []
Finished structural reductions, in 1 iterations. Remains : 168/168 places, 118/118 transitions.
Incomplete random walk after 100000 steps, including 3172 resets, run finished after 281 ms. (steps per millisecond=355 ) properties seen :[0, 0]
// Phase 1: matrix 118 rows 168 cols
[2021-05-08 20:36:04] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 20:36:04] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2021-05-08 20:36:04] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2021-05-08 20:36:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:04] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2021-05-08 20:36:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:04] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 20:36:04] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2021-05-08 20:36:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:05] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2021-05-08 20:36:05] [INFO ] Computed and/alt/rep : 115/477/115 causal constraints in 7 ms.
[2021-05-08 20:36:05] [INFO ] Added : 100 causal constraints over 20 iterations in 281 ms. Result :sat
[2021-05-08 20:36:05] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2021-05-08 20:36:05] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2021-05-08 20:36:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:05] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2021-05-08 20:36:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2021-05-08 20:36:05] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2021-05-08 20:36:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:05] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2021-05-08 20:36:05] [INFO ] Computed and/alt/rep : 115/477/115 causal constraints in 7 ms.
[2021-05-08 20:36:06] [INFO ] Added : 113 causal constraints over 23 iterations in 328 ms. Result :sat
Applied a total of 0 rules in 6 ms. Remains 168 /168 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 168 cols
[2021-05-08 20:36:06] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 20:36:06] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2021-05-08 20:36:06] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2021-05-08 20:36:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:06] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2021-05-08 20:36:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:06] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 20:36:06] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2021-05-08 20:36:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:06] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2021-05-08 20:36:06] [INFO ] Computed and/alt/rep : 115/477/115 causal constraints in 8 ms.
[2021-05-08 20:36:06] [INFO ] Added : 100 causal constraints over 20 iterations in 290 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-08 20:36:06] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2021-05-08 20:36:06] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2021-05-08 20:36:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:07] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2021-05-08 20:36:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 20:36:07] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2021-05-08 20:36:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:07] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2021-05-08 20:36:07] [INFO ] Computed and/alt/rep : 115/477/115 causal constraints in 8 ms.
[2021-05-08 20:36:07] [INFO ] Added : 113 causal constraints over 23 iterations in 332 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-08 20:36:07] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2021-05-08 20:36:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
[2021-05-08 20:36:07] [INFO ] Flatten gal took : 45 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ DES-PT-10b @ 3570 seconds

FORMULA DES-PT-10b-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-10b-ReachabilityFireability-10 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-10b

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G ((((p16 <= 0) OR (p163 <= 0)) AND ((p54 <= 0) OR (p52 <= 0)))))",
"processed_size": 70,
"rewrites": 2
},
"result":
{
"edges": 387402,
"markings": 208750,
"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": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p22) AND (1 <= p76) AND (((1 <= p147)) OR (((p49 <= 0)) AND ((p67 <= 0) OR (p71 <= 0)))))))",
"processed_size": 106,
"rewrites": 1
},
"result":
{
"edges": 26295,
"markings": 22006,
"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": 11,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 20380,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F(**))"
},
"net":
{
"arcs": 589,
"conflict_clusters": 55,
"places": 168,
"places_significant": 108,
"singleton_clusters": 0,
"transitions": 118
},
"result":
{
"preliminary_value": "no yes ",
"value": "no 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: 286/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 168
lola: finding significant places
lola: 168 places, 118 transitions, 108 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: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p163 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p147 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: A (G ((((p16 <= 0) OR (p163 <= 0)) AND ((p54 <= 0) OR (p52 <= 0))))) : E (F (((1 <= p22) AND (1 <= p76) AND (((1 <= p147)) OR (((p49 <= 0)) AND ((p67 <= 0) OR (p71 <= 0)))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p16 <= 0) OR (p163 <= 0)) AND ((p54 <= 0) OR (p52 <= 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 ((((p16 <= 0) OR (p163 <= 0)) AND ((p54 <= 0) OR (p52 <= 0)))))
lola: processed formula length: 70
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p16) AND (1 <= p163)) OR ((1 <= p54) AND (1 <= p52)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 208750 markings, 387402 edges
lola: ========================================
lola: subprocess 1 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p22) AND (1 <= p76) AND (((1 <= p147)) OR (((p49 <= 0)) AND ((p67 <= 0) OR (p71 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p22) AND (1 <= p76) AND (((1 <= p147)) OR (((p49 <= 0)) AND ((p67 <= 0) OR (p71 <= 0)))))))
lola: processed formula length: 106
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 <= p22) AND (1 <= p76) AND (((1 <= p147)) OR (((p49 <= 0)) AND ((p67 <= 0) OR (p71 <= 0)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 11 literals and 3 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: 22006 markings, 26295 edges
lola: RESULT
lola:
SUMMARY: no yes
lola:
preliminary result: no yes
lola: ========================================
lola: memory consumption: 20380 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-10b"
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-10b, 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-162039097100040"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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