fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r246-smll-162106594200060
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for ShieldRVs-PT-030A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4283.447 3600000.00 230268.00 889.70 TTTFTTT?TFFTFFTT 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.r246-smll-162106594200060.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is ShieldRVs-PT-030A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-smll-162106594200060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 118K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 12:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 12:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 18:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 18:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 191K May 5 16:52 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 ShieldRVs-PT-030A-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621295996464

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 00:00:00] [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-18 00:00:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 00:00:00] [INFO ] Load time of PNML (sax parser for PT used): 218 ms
[2021-05-18 00:00:00] [INFO ] Transformed 423 places.
[2021-05-18 00:00:00] [INFO ] Transformed 573 transitions.
[2021-05-18 00:00:00] [INFO ] Found NUPN structural information;
[2021-05-18 00:00:00] [INFO ] Parsed PT model containing 423 places and 573 transitions in 337 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 61 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 24 resets, run finished after 145 ms. (steps per millisecond=68 ) properties seen :[0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1]
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties seen :[0, 1, 0, 0, 0, 0]
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 55 ms. (steps per millisecond=181 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties seen :[0, 0, 0, 0, 1]
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 573 rows 423 cols
[2021-05-18 00:00:01] [INFO ] Computed 121 place invariants in 28 ms
[2021-05-18 00:00:01] [INFO ] [Real]Absence check using 121 positive place invariants in 125 ms returned sat
[2021-05-18 00:00:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 00:00:02] [INFO ] [Real]Absence check using state equation in 1052 ms returned sat
[2021-05-18 00:00:03] [INFO ] Deduced a trap composed of 11 places in 263 ms
[2021-05-18 00:00:03] [INFO ] Deduced a trap composed of 19 places in 192 ms
[2021-05-18 00:00:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 605 ms
[2021-05-18 00:00:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 00:00:03] [INFO ] [Nat]Absence check using 121 positive place invariants in 101 ms returned sat
[2021-05-18 00:00:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 00:00:04] [INFO ] [Nat]Absence check using state equation in 743 ms returned sat
[2021-05-18 00:00:04] [INFO ] Computed and/alt/rep : 572/4359/572 causal constraints in 113 ms.
[2021-05-18 00:00:08] [INFO ] Added : 260 causal constraints over 52 iterations in 3983 ms. Result :(error "Solver has unexpectedly terminated")
[2021-05-18 00:00:08] [INFO ] [Real]Absence check using 121 positive place invariants in 114 ms returned sat
[2021-05-18 00:00:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 00:00:09] [INFO ] [Real]Absence check using state equation in 1057 ms returned sat
[2021-05-18 00:00:10] [INFO ] Deduced a trap composed of 12 places in 86 ms
[2021-05-18 00:00:10] [INFO ] Deduced a trap composed of 11 places in 47 ms
[2021-05-18 00:00:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 249 ms
[2021-05-18 00:00:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 00:00:10] [INFO ] [Nat]Absence check using 121 positive place invariants in 78 ms returned sat
[2021-05-18 00:00:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 00:00:11] [INFO ] [Nat]Absence check using state equation in 826 ms returned sat
[2021-05-18 00:00:11] [INFO ] Deduced a trap composed of 15 places in 81 ms
[2021-05-18 00:00:11] [INFO ] Deduced a trap composed of 11 places in 59 ms
[2021-05-18 00:00:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 273 ms
[2021-05-18 00:00:11] [INFO ] Computed and/alt/rep : 572/4359/572 causal constraints in 90 ms.
[2021-05-18 00:00:15] [INFO ] Added : 270 causal constraints over 54 iterations in 3757 ms. Result :(error "Solver has unexpectedly terminated")
[2021-05-18 00:00:15] [INFO ] [Real]Absence check using 121 positive place invariants in 118 ms returned sat
[2021-05-18 00:00:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 00:00:16] [INFO ] [Real]Absence check using state equation in 846 ms returned sat
[2021-05-18 00:00:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 00:00:16] [INFO ] [Nat]Absence check using 121 positive place invariants in 117 ms returned sat
[2021-05-18 00:00:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 00:00:17] [INFO ] [Nat]Absence check using state equation in 991 ms returned sat
[2021-05-18 00:00:17] [INFO ] Computed and/alt/rep : 572/4359/572 causal constraints in 82 ms.
[2021-05-18 00:00:21] [INFO ] Added : 260 causal constraints over 52 iterations in 3787 ms. Result :unknown
[2021-05-18 00:00:21] [INFO ] [Real]Absence check using 121 positive place invariants in 51 ms returned unsat
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 81600 steps, including 863 resets, run finished after 711 ms. (steps per millisecond=114 ) properties seen :[1, 0, 0] could not realise parikh vector
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 44 out of 423 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 423/423 places, 573/573 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 422 transition count 572
Partial Free-agglomeration rule applied 55 times.
Drop transitions removed 55 transitions
Iterating global reduction 0 with 55 rules applied. Total rules applied 57 place count 422 transition count 572
Applied a total of 57 rules in 217 ms. Remains 422 /423 variables (removed 1) and now considering 572/573 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/423 places, 572/573 transitions.
Incomplete random walk after 1000000 steps, including 2753 resets, run finished after 4762 ms. (steps per millisecond=209 ) properties seen :[1, 0]
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 335 resets, run finished after 3681 ms. (steps per millisecond=271 ) properties seen :[0]
// Phase 1: matrix 572 rows 422 cols
[2021-05-18 00:00:31] [INFO ] Computed 121 place invariants in 20 ms
[2021-05-18 00:00:31] [INFO ] [Real]Absence check using 121 positive place invariants in 77 ms returned sat
[2021-05-18 00:00:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 00:00:32] [INFO ] [Real]Absence check using state equation in 824 ms returned sat
[2021-05-18 00:00:32] [INFO ] Deduced a trap composed of 7 places in 58 ms
[2021-05-18 00:00:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2021-05-18 00:00:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 00:00:32] [INFO ] [Nat]Absence check using 121 positive place invariants in 77 ms returned sat
[2021-05-18 00:00:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 00:00:33] [INFO ] [Nat]Absence check using state equation in 757 ms returned sat
[2021-05-18 00:00:33] [INFO ] Deduced a trap composed of 16 places in 118 ms
[2021-05-18 00:00:33] [INFO ] Deduced a trap composed of 11 places in 90 ms
[2021-05-18 00:00:33] [INFO ] Deduced a trap composed of 11 places in 51 ms
[2021-05-18 00:00:33] [INFO ] Deduced a trap composed of 7 places in 45 ms
[2021-05-18 00:00:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 422 ms
[2021-05-18 00:00:33] [INFO ] Computed and/alt/rep : 571/5033/571 causal constraints in 54 ms.
[2021-05-18 00:00:55] [INFO ] Added : 495 causal constraints over 99 iterations in 21492 ms.(timeout) Result :sat
[2021-05-18 00:00:55] [INFO ] Deduced a trap composed of 7 places in 87 ms
[2021-05-18 00:00:55] [INFO ] Deduced a trap composed of 16 places in 71 ms
[2021-05-18 00:00:55] [INFO ] Deduced a trap composed of 15 places in 53 ms
[2021-05-18 00:00:55] [INFO ] Deduced a trap composed of 16 places in 64 ms
[2021-05-18 00:00:56] [INFO ] Deduced a trap composed of 15 places in 69 ms
[2021-05-18 00:00:56] [INFO ] Deduced a trap composed of 7 places in 62 ms
[2021-05-18 00:00:56] [INFO ] Deduced a trap composed of 7 places in 21 ms
[2021-05-18 00:00:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1757 ms
Attempting to minimize the solution found.
Minimization took 112 ms.
Incomplete Parikh walk after 80600 steps, including 463 resets, run finished after 409 ms. (steps per millisecond=197 ) properties seen :[0] could not realise parikh vector
Support contains 21 out of 422 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 422/422 places, 572/572 transitions.
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 422 transition count 572
Applied a total of 3 rules in 80 ms. Remains 422 /422 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/422 places, 572/572 transitions.
Incomplete random walk after 1000000 steps, including 2784 resets, run finished after 4669 ms. (steps per millisecond=214 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 338 resets, run finished after 3259 ms. (steps per millisecond=306 ) properties seen :[0]
Interrupted probabilistic random walk after 3359397 steps, run timeout after 30001 ms. (steps per millisecond=111 ) properties seen :[0]
Probabilistic random walk after 3359397 steps, saw 599553 distinct states, run finished after 30002 ms. (steps per millisecond=111 ) properties seen :[0]
// Phase 1: matrix 572 rows 422 cols
[2021-05-18 00:01:35] [INFO ] Computed 121 place invariants in 7 ms
[2021-05-18 00:01:35] [INFO ] [Real]Absence check using 121 positive place invariants in 123 ms returned sat
[2021-05-18 00:01:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 00:01:36] [INFO ] [Real]Absence check using state equation in 1038 ms returned sat
[2021-05-18 00:01:36] [INFO ] Deduced a trap composed of 7 places in 17 ms
[2021-05-18 00:01:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2021-05-18 00:01:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 00:01:37] [INFO ] [Nat]Absence check using 121 positive place invariants in 82 ms returned sat
[2021-05-18 00:01:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 00:01:37] [INFO ] [Nat]Absence check using state equation in 706 ms returned sat
[2021-05-18 00:01:37] [INFO ] Deduced a trap composed of 11 places in 93 ms
[2021-05-18 00:01:38] [INFO ] Deduced a trap composed of 16 places in 67 ms
[2021-05-18 00:01:38] [INFO ] Deduced a trap composed of 11 places in 53 ms
[2021-05-18 00:01:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 321 ms
[2021-05-18 00:01:38] [INFO ] Computed and/alt/rep : 571/5069/571 causal constraints in 38 ms.
[2021-05-18 00:01:58] [INFO ] Added : 485 causal constraints over 97 iterations in 20619 ms.(timeout) Result :sat
[2021-05-18 00:01:58] [INFO ] Deduced a trap composed of 7 places in 99 ms
[2021-05-18 00:01:59] [INFO ] Deduced a trap composed of 7 places in 160 ms
[2021-05-18 00:01:59] [INFO ] Deduced a trap composed of 11 places in 71 ms
[2021-05-18 00:02:00] [INFO ] Deduced a trap composed of 7 places in 55 ms
[2021-05-18 00:02:00] [INFO ] Deduced a trap composed of 11 places in 54 ms
[2021-05-18 00:02:00] [INFO ] Deduced a trap composed of 11 places in 59 ms
[2021-05-18 00:02:00] [INFO ] Deduced a trap composed of 15 places in 37 ms
[2021-05-18 00:02:01] [INFO ] Deduced a trap composed of 15 places in 45 ms
[2021-05-18 00:02:01] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3002 ms
Attempting to minimize the solution found.
Minimization took 189 ms.
Incomplete Parikh walk after 72300 steps, including 943 resets, run finished after 596 ms. (steps per millisecond=121 ) properties seen :[0] could not realise parikh vector
Support contains 21 out of 422 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 422/422 places, 572/572 transitions.
Applied a total of 0 rules in 40 ms. Remains 422 /422 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/422 places, 572/572 transitions.
Starting structural reductions, iteration 0 : 422/422 places, 572/572 transitions.
Applied a total of 0 rules in 36 ms. Remains 422 /422 variables (removed 0) and now considering 572/572 (removed 0) transitions.
// Phase 1: matrix 572 rows 422 cols
[2021-05-18 00:02:02] [INFO ] Computed 121 place invariants in 6 ms
[2021-05-18 00:02:03] [INFO ] Implicit Places using invariants in 1224 ms returned []
// Phase 1: matrix 572 rows 422 cols
[2021-05-18 00:02:03] [INFO ] Computed 121 place invariants in 7 ms
[2021-05-18 00:02:07] [INFO ] Implicit Places using invariants and state equation in 3558 ms returned []
Implicit Place search using SMT with State Equation took 4797 ms to find 0 implicit places.
[2021-05-18 00:02:08] [INFO ] Redundant transitions in 472 ms returned []
// Phase 1: matrix 572 rows 422 cols
[2021-05-18 00:02:08] [INFO ] Computed 121 place invariants in 5 ms
[2021-05-18 00:02:09] [INFO ] Dead Transitions using invariants and state equation in 1739 ms returned []
Finished structural reductions, in 1 iterations. Remains : 422/422 places, 572/572 transitions.
Incomplete random walk after 100000 steps, including 277 resets, run finished after 455 ms. (steps per millisecond=219 ) properties seen :[0]
// Phase 1: matrix 572 rows 422 cols
[2021-05-18 00:02:10] [INFO ] Computed 121 place invariants in 5 ms
[2021-05-18 00:02:10] [INFO ] [Real]Absence check using 121 positive place invariants in 113 ms returned sat
[2021-05-18 00:02:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 00:02:11] [INFO ] [Real]Absence check using state equation in 1044 ms returned sat
[2021-05-18 00:02:11] [INFO ] Deduced a trap composed of 7 places in 24 ms
[2021-05-18 00:02:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2021-05-18 00:02:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 00:02:11] [INFO ] [Nat]Absence check using 121 positive place invariants in 119 ms returned sat
[2021-05-18 00:02:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 00:02:12] [INFO ] [Nat]Absence check using state equation in 914 ms returned sat
[2021-05-18 00:02:12] [INFO ] Deduced a trap composed of 11 places in 70 ms
[2021-05-18 00:02:12] [INFO ] Deduced a trap composed of 16 places in 50 ms
[2021-05-18 00:02:13] [INFO ] Deduced a trap composed of 11 places in 46 ms
[2021-05-18 00:02:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 270 ms
[2021-05-18 00:02:13] [INFO ] Computed and/alt/rep : 571/5069/571 causal constraints in 54 ms.
[2021-05-18 00:02:31] [INFO ] Added : 470 causal constraints over 94 iterations in 18586 ms. Result :unknown
Applied a total of 0 rules in 48 ms. Remains 422 /422 variables (removed 0) and now considering 572/572 (removed 0) transitions.
// Phase 1: matrix 572 rows 422 cols
[2021-05-18 00:02:31] [INFO ] Computed 121 place invariants in 5 ms
[2021-05-18 00:02:32] [INFO ] [Real]Absence check using 121 positive place invariants in 116 ms returned sat
[2021-05-18 00:02:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 00:02:32] [INFO ] [Real]Absence check using state equation in 884 ms returned sat
[2021-05-18 00:02:32] [INFO ] Deduced a trap composed of 7 places in 15 ms
[2021-05-18 00:02:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2021-05-18 00:02:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 00:02:33] [INFO ] [Nat]Absence check using 121 positive place invariants in 78 ms returned sat
[2021-05-18 00:02:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 00:02:33] [INFO ] [Nat]Absence check using state equation in 731 ms returned sat
[2021-05-18 00:02:34] [INFO ] Deduced a trap composed of 11 places in 91 ms
[2021-05-18 00:02:34] [INFO ] Deduced a trap composed of 16 places in 66 ms
[2021-05-18 00:02:34] [INFO ] Deduced a trap composed of 11 places in 75 ms
[2021-05-18 00:02:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 371 ms
[2021-05-18 00:02:34] [INFO ] Computed and/alt/rep : 571/5069/571 causal constraints in 93 ms.
[2021-05-18 00:02:55] [INFO ] Added : 480 causal constraints over 96 iterations in 21381 ms.(timeout) Result :sat
[2021-05-18 00:02:55] [INFO ] Deduced a trap composed of 7 places in 117 ms
[2021-05-18 00:02:56] [INFO ] Deduced a trap composed of 11 places in 85 ms
[2021-05-18 00:02:56] [INFO ] Deduced a trap composed of 7 places in 111 ms
[2021-05-18 00:02:57] [INFO ] Deduced a trap composed of 11 places in 126 ms
[2021-05-18 00:02:57] [INFO ] Deduced a trap composed of 11 places in 83 ms
[2021-05-18 00:02:57] [INFO ] Deduced a trap composed of 15 places in 67 ms
[2021-05-18 00:02:58] [INFO ] Deduced a trap composed of 11 places in 66 ms
[2021-05-18 00:02:58] [INFO ] Deduced a trap composed of 15 places in 37 ms
[2021-05-18 00:02:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3115 ms
Attempting to minimize the solution found.
Minimization took 169 ms.
[2021-05-18 00:02:59] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2021-05-18 00:02:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 21 ms.
[2021-05-18 00:02:59] [INFO ] Flatten gal took : 256 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldRVs-PT-030A @ 3570 seconds
vrfy: finished
info: timeLeft: 3562
rslt: Output for ReachabilityFireability @ ShieldRVs-PT-030A

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue May 18 00:03:01 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 28760,
"runtime": 8.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 21,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 21,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p117) AND (1 <= p124) AND (1 <= p128) AND (1 <= p135) AND (1 <= p330) AND (1 <= p335) AND (1 <= p410) AND (1 <= p412) AND (1 <= p417) AND (((1 <= p54) AND (1 <= p58) AND (1 <= p65)) OR ((1 <= p73) AND (1 <= p88) AND (1 <= p99))) AND (((1 <= p38) AND (1 <= p42) AND (1 <= p51)) OR ((1 <= p76) AND (1 <= p77) AND (1 <= p81))))))",
"processed_size": 341,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 2874,
"conflict_clusters": 32,
"places": 422,
"places_significant": 301,
"singleton_clusters": 0,
"transitions": 572
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 60,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 994/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 422
lola: finding significant places
lola: 422 places, 572 transitions, 301 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: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p330 <= 1)
lola: LP says that atomic proposition is always true: (p335 <= 1)
lola: LP says that atomic proposition is always true: (p410 <= 1)
lola: LP says that atomic proposition is always true: (p412 <= 1)
lola: LP says that atomic proposition is always true: (p417 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: E (F (((1 <= p117) AND (1 <= p124) AND (1 <= p128) AND (1 <= p135) AND (1 <= p330) AND (1 <= p335) AND (1 <= p410) AND (1 <= p412) AND (1 <= p417) AND (((1 <= p54) AND (1 <= p58) AND (1 <= p65)) OR ((1 <= p73) AND (1 <= p88) AND (1 <= p99))) AND (((1 <= p38) AND (1 <= p42) AND (1 <= p51)) OR ((1 <= p76) AND (1 <= p77) AND (1 <= p81))))))
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 <= p117) AND (1 <= p124) AND (1 <= p128) AND (1 <= p135) AND (1 <= p330) AND (1 <= p335) AND (1 <= p410) AND (1 <= p412) AND (1 <= p417) AND (((1 <= p54) AND (1 <= p58) AND (1 <= p65)) OR ((1 <= p73) AND (1 <= p88) AND (1 <= p99))) AND (((1 <= p38) AND (1 <= p42) AND (1 <= p51)) OR ((1 <= p76) AND (1 <= p77) AND (1 <= p81))))))
lola: processed formula length: 341
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: local time limit reached - aborting
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 <= p117) AND (1 <= p124) AND (1 <= p128) AND (1 <= p135) AND (1 <= p330) AND (1 <= p335) AND (1 <= p410) AND (1 <= p412) AND (1 <= p417) AND (((1 <= p54) AND (1 <= p58) AND (1 <= p65)) OR ((1 <= p73) AND (1 <= p88) AND (1 <= p99))) AND (((1 <= p38) AND (1 <= p42) AND (1 <= p51)) OR ((1 <= p76) AND (1 <= p77) AND (1 <= p81))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 60 literals and 4 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.
lola: memory consumption: 28760 KB
lola: time consumption: 8 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="ShieldRVs-PT-030A"
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 ShieldRVs-PT-030A, 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 r246-smll-162106594200060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-030A.tgz
mv ShieldRVs-PT-030A 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 ;