About the Execution of 2020-gold for ShieldRVt-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4280.399 | 3600000.00 | 344814.00 | 956.10 | TTFFTTFTFTTTTFFT | 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-162106594400168.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 ShieldRVt-PT-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-smll-162106594400168
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1008K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 139K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K 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.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 27 13:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 13:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 19:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 19:16 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 614K 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 ShieldRVt-PT-050B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1621332419271
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 10:07: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-18 10:07:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 10:07:01] [INFO ] Load time of PNML (sax parser for PT used): 280 ms
[2021-05-18 10:07:02] [INFO ] Transformed 2503 places.
[2021-05-18 10:07:02] [INFO ] Transformed 2503 transitions.
[2021-05-18 10:07:02] [INFO ] Found NUPN structural information;
[2021-05-18 10:07:02] [INFO ] Parsed PT model containing 2503 places and 2503 transitions in 414 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 153 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 144 ms. (steps per millisecond=69 ) properties seen :[0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 45 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 64 ms. (steps per millisecond=156 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2503 rows 2503 cols
[2021-05-18 10:07:02] [INFO ] Computed 201 place invariants in 77 ms
[2021-05-18 10:07:04] [INFO ] [Real]Absence check using 201 positive place invariants in 441 ms returned sat
[2021-05-18 10:07:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:07:07] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 10:07:07] [INFO ] [Real]Absence check using state equation in 3848 ms returned (error "Failed to check-sat")
[2021-05-18 10:07:08] [INFO ] [Real]Absence check using 201 positive place invariants in 407 ms returned sat
[2021-05-18 10:07:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:07:12] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 10:07:12] [INFO ] [Real]Absence check using state equation in 4095 ms returned (error "Failed to check-sat")
[2021-05-18 10:07:13] [INFO ] [Real]Absence check using 201 positive place invariants in 430 ms returned sat
[2021-05-18 10:07:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:07:17] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 10:07:17] [INFO ] [Real]Absence check using state equation in 4115 ms returned (error "Failed to check-sat")
[2021-05-18 10:07:18] [INFO ] [Real]Absence check using 201 positive place invariants in 404 ms returned sat
[2021-05-18 10:07:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:07:23] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 10:07:23] [INFO ] [Real]Absence check using state equation in 4168 ms returned (error "Failed to check-sat")
[2021-05-18 10:07:23] [INFO ] [Real]Absence check using 201 positive place invariants in 439 ms returned sat
[2021-05-18 10:07:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:07:28] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 10:07:28] [INFO ] [Real]Absence check using state equation in 4126 ms returned (error "Failed to check-sat")
[2021-05-18 10:07:28] [INFO ] [Real]Absence check using 201 positive place invariants in 408 ms returned sat
[2021-05-18 10:07:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:07:33] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 10:07:33] [INFO ] [Real]Absence check using state equation in 4169 ms returned (error "Failed to check-sat")
[2021-05-18 10:07:33] [INFO ] [Real]Absence check using 201 positive place invariants in 409 ms returned sat
[2021-05-18 10:07:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:07:38] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 10:07:38] [INFO ] [Real]Absence check using state equation in 4166 ms returned (error "Failed to check-sat")
[2021-05-18 10:07:38] [INFO ] [Real]Absence check using 201 positive place invariants in 438 ms returned sat
[2021-05-18 10:07:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:07:43] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 10:07:43] [INFO ] [Real]Absence check using state equation in 4142 ms returned (error "Failed to check-sat")
[2021-05-18 10:07:43] [INFO ] [Real]Absence check using 201 positive place invariants in 427 ms returned sat
[2021-05-18 10:07:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:07:48] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 10:07:48] [INFO ] [Real]Absence check using state equation in 4162 ms returned (error "Failed to check-sat")
[2021-05-18 10:07:48] [INFO ] [Real]Absence check using 201 positive place invariants in 413 ms returned sat
[2021-05-18 10:07:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:07:53] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 10:07:53] [INFO ] [Real]Absence check using state equation in 4171 ms returned (error "Failed to check-sat")
[2021-05-18 10:07:53] [INFO ] [Real]Absence check using 201 positive place invariants in 405 ms returned sat
[2021-05-18 10:07:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:07:58] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 10:07:58] [INFO ] [Real]Absence check using state equation in 4175 ms returned (error "Failed to check-sat")
[2021-05-18 10:07:58] [INFO ] [Real]Absence check using 201 positive place invariants in 436 ms returned sat
[2021-05-18 10:07:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:08:03] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 10:08:03] [INFO ] [Real]Absence check using state equation in 4148 ms returned (error "Failed to check-sat")
Support contains 48 out of 2503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Performed 768 Post agglomeration using F-continuation condition.Transition count delta: 768
Iterating post reduction 0 with 768 rules applied. Total rules applied 768 place count 2503 transition count 1735
Reduce places removed 768 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 770 rules applied. Total rules applied 1538 place count 1735 transition count 1733
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1539 place count 1734 transition count 1733
Performed 206 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 206 Pre rules applied. Total rules applied 1539 place count 1734 transition count 1527
Deduced a syphon composed of 206 places in 7 ms
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 3 with 412 rules applied. Total rules applied 1951 place count 1528 transition count 1527
Symmetric choice reduction at 3 with 338 rule applications. Total rules 2289 place count 1528 transition count 1527
Deduced a syphon composed of 338 places in 9 ms
Reduce places removed 338 places and 338 transitions.
Iterating global reduction 3 with 676 rules applied. Total rules applied 2965 place count 1190 transition count 1189
Performed 138 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 138 Pre rules applied. Total rules applied 2965 place count 1190 transition count 1051
Deduced a syphon composed of 138 places in 6 ms
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 3 with 276 rules applied. Total rules applied 3241 place count 1052 transition count 1051
Performed 437 Post agglomeration using F-continuation condition.Transition count delta: 437
Deduced a syphon composed of 437 places in 1 ms
Reduce places removed 437 places and 0 transitions.
Iterating global reduction 3 with 874 rules applied. Total rules applied 4115 place count 615 transition count 614
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4317 place count 514 transition count 698
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 4385 place count 480 transition count 729
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4386 place count 480 transition count 728
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4390 place count 480 transition count 724
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 4394 place count 476 transition count 724
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 4395 place count 476 transition count 724
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 4399 place count 476 transition count 720
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4400 place count 475 transition count 719
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4401 place count 474 transition count 719
Applied a total of 4401 rules in 976 ms. Remains 474 /2503 variables (removed 2029) and now considering 719/2503 (removed 1784) transitions.
Finished structural reductions, in 1 iterations. Remains : 474/2503 places, 719/2503 transitions.
Incomplete random walk after 1000000 steps, including 263 resets, run finished after 6228 ms. (steps per millisecond=160 ) properties seen :[1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1]
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 4020 ms. (steps per millisecond=248 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 20 resets, run finished after 3984 ms. (steps per millisecond=251 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 21 resets, run finished after 4356 ms. (steps per millisecond=229 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 31 resets, run finished after 3975 ms. (steps per millisecond=251 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 15 resets, run finished after 4333 ms. (steps per millisecond=230 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 37 resets, run finished after 4017 ms. (steps per millisecond=248 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 16 resets, run finished after 3916 ms. (steps per millisecond=255 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 719 rows 474 cols
[2021-05-18 10:08:38] [INFO ] Computed 200 place invariants in 4 ms
[2021-05-18 10:08:39] [INFO ] [Real]Absence check using 200 positive place invariants in 108 ms returned sat
[2021-05-18 10:08:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:08:39] [INFO ] [Real]Absence check using state equation in 826 ms returned sat
[2021-05-18 10:08:40] [INFO ] State equation strengthened by 146 read => feed constraints.
[2021-05-18 10:08:40] [INFO ] [Real]Added 146 Read/Feed constraints in 31 ms returned sat
[2021-05-18 10:08:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:08:40] [INFO ] [Nat]Absence check using 200 positive place invariants in 112 ms returned sat
[2021-05-18 10:08:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 10:08:41] [INFO ] [Nat]Absence check using state equation in 825 ms returned sat
[2021-05-18 10:08:41] [INFO ] [Nat]Added 146 Read/Feed constraints in 40 ms returned sat
[2021-05-18 10:08:41] [INFO ] Computed and/alt/rep : 705/3540/705 causal constraints in 86 ms.
[2021-05-18 10:08:53] [INFO ] Added : 660 causal constraints over 133 iterations in 12385 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 71 ms.
[2021-05-18 10:08:53] [INFO ] [Real]Absence check using 200 positive place invariants in 113 ms returned sat
[2021-05-18 10:08:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:08:54] [INFO ] [Real]Absence check using state equation in 849 ms returned sat
[2021-05-18 10:08:54] [INFO ] [Real]Added 146 Read/Feed constraints in 26 ms returned sat
[2021-05-18 10:08:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:08:55] [INFO ] [Nat]Absence check using 200 positive place invariants in 105 ms returned sat
[2021-05-18 10:08:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 10:08:55] [INFO ] [Nat]Absence check using state equation in 823 ms returned sat
[2021-05-18 10:08:55] [INFO ] [Nat]Added 146 Read/Feed constraints in 29 ms returned sat
[2021-05-18 10:08:56] [INFO ] Computed and/alt/rep : 705/3540/705 causal constraints in 58 ms.
[2021-05-18 10:09:12] [INFO ] Added : 659 causal constraints over 132 iterations in 16059 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 80 ms.
[2021-05-18 10:09:12] [INFO ] [Real]Absence check using 200 positive place invariants in 135 ms returned sat
[2021-05-18 10:09:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:09:13] [INFO ] [Real]Absence check using state equation in 885 ms returned sat
[2021-05-18 10:09:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:09:13] [INFO ] [Nat]Absence check using 200 positive place invariants in 111 ms returned sat
[2021-05-18 10:09:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 10:09:14] [INFO ] [Nat]Absence check using state equation in 861 ms returned sat
[2021-05-18 10:09:14] [INFO ] [Nat]Added 146 Read/Feed constraints in 33 ms returned sat
[2021-05-18 10:09:14] [INFO ] Computed and/alt/rep : 705/3540/705 causal constraints in 49 ms.
[2021-05-18 10:09:30] [INFO ] Added : 630 causal constraints over 126 iterations in 16213 ms. Result :unknown
[2021-05-18 10:09:30] [INFO ] [Real]Absence check using 200 positive place invariants in 109 ms returned sat
[2021-05-18 10:09:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:09:31] [INFO ] [Real]Absence check using state equation in 830 ms returned sat
[2021-05-18 10:09:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:09:31] [INFO ] [Nat]Absence check using 200 positive place invariants in 107 ms returned sat
[2021-05-18 10:09:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 10:09:32] [INFO ] [Nat]Absence check using state equation in 814 ms returned sat
[2021-05-18 10:09:32] [INFO ] [Nat]Added 146 Read/Feed constraints in 34 ms returned sat
[2021-05-18 10:09:32] [INFO ] Computed and/alt/rep : 705/3540/705 causal constraints in 40 ms.
[2021-05-18 10:09:45] [INFO ] Added : 662 causal constraints over 133 iterations in 13077 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 70 ms.
[2021-05-18 10:09:46] [INFO ] [Real]Absence check using 200 positive place invariants in 112 ms returned sat
[2021-05-18 10:09:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:09:46] [INFO ] [Real]Absence check using state equation in 851 ms returned sat
[2021-05-18 10:09:47] [INFO ] [Real]Added 146 Read/Feed constraints in 25 ms returned sat
[2021-05-18 10:09:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:09:47] [INFO ] [Nat]Absence check using 200 positive place invariants in 112 ms returned sat
[2021-05-18 10:09:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 10:09:48] [INFO ] [Nat]Absence check using state equation in 872 ms returned sat
[2021-05-18 10:09:48] [INFO ] [Nat]Added 146 Read/Feed constraints in 36 ms returned sat
[2021-05-18 10:09:48] [INFO ] Computed and/alt/rep : 705/3540/705 causal constraints in 55 ms.
[2021-05-18 10:10:04] [INFO ] Added : 656 causal constraints over 132 iterations in 16170 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 70 ms.
[2021-05-18 10:10:04] [INFO ] [Real]Absence check using 200 positive place invariants in 104 ms returned sat
[2021-05-18 10:10:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:10:05] [INFO ] [Real]Absence check using state equation in 820 ms returned sat
[2021-05-18 10:10:05] [INFO ] [Real]Added 146 Read/Feed constraints in 27 ms returned sat
[2021-05-18 10:10:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:10:05] [INFO ] [Nat]Absence check using 200 positive place invariants in 103 ms returned sat
[2021-05-18 10:10:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 10:10:06] [INFO ] [Nat]Absence check using state equation in 824 ms returned sat
[2021-05-18 10:10:06] [INFO ] [Nat]Added 146 Read/Feed constraints in 29 ms returned sat
[2021-05-18 10:10:06] [INFO ] Computed and/alt/rep : 705/3540/705 causal constraints in 65 ms.
[2021-05-18 10:10:17] [INFO ] Added : 651 causal constraints over 131 iterations in 10991 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 67 ms.
[2021-05-18 10:10:17] [INFO ] [Real]Absence check using 200 positive place invariants in 106 ms returned sat
[2021-05-18 10:10:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:10:18] [INFO ] [Real]Absence check using state equation in 817 ms returned sat
[2021-05-18 10:10:18] [INFO ] [Real]Added 146 Read/Feed constraints in 31 ms returned sat
[2021-05-18 10:10:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:10:19] [INFO ] [Nat]Absence check using 200 positive place invariants in 103 ms returned sat
[2021-05-18 10:10:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 10:10:19] [INFO ] [Nat]Absence check using state equation in 816 ms returned sat
[2021-05-18 10:10:19] [INFO ] [Nat]Added 146 Read/Feed constraints in 30 ms returned sat
[2021-05-18 10:10:19] [INFO ] Computed and/alt/rep : 705/3540/705 causal constraints in 45 ms.
[2021-05-18 10:10:31] [INFO ] Added : 663 causal constraints over 134 iterations in 11830 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 73 ms.
Incomplete Parikh walk after 92800 steps, including 745 resets, run finished after 663 ms. (steps per millisecond=139 ) properties seen :[0, 0, 0, 1, 1, 0, 1] could not realise parikh vector
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 101300 steps, including 376 resets, run finished after 624 ms. (steps per millisecond=162 ) properties seen :[1, 0, 0, 1] could not realise parikh vector
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 88400 steps, including 548 resets, run finished after 569 ms. (steps per millisecond=155 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 70400 steps, including 243 resets, run finished after 396 ms. (steps per millisecond=177 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 101800 steps, including 561 resets, run finished after 643 ms. (steps per millisecond=158 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 100100 steps, including 743 resets, run finished after 619 ms. (steps per millisecond=161 ) properties seen :[1, 0] could not realise parikh vector
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 99100 steps, including 278 resets, run finished after 611 ms. (steps per millisecond=162 ) properties seen :[0] could not realise parikh vector
Support contains 10 out of 474 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 474/474 places, 719/719 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 474 transition count 708
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 463 transition count 708
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 22 place count 463 transition count 693
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 52 place count 448 transition count 693
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 448 transition count 693
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 447 transition count 692
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 55 place count 447 transition count 691
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 57 place count 446 transition count 691
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 77 place count 436 transition count 681
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 103 place count 423 transition count 701
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 423 transition count 700
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 105 place count 422 transition count 700
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 421 transition count 699
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 420 transition count 698
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 419 transition count 697
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 418 transition count 696
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 417 transition count 695
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 416 transition count 694
Applied a total of 111 rules in 212 ms. Remains 416 /474 variables (removed 58) and now considering 694/719 (removed 25) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/474 places, 694/719 transitions.
Incomplete random walk after 1000000 steps, including 259 resets, run finished after 5737 ms. (steps per millisecond=174 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 16 resets, run finished after 4295 ms. (steps per millisecond=232 ) properties seen :[0]
Interrupted probabilistic random walk after 2943734 steps, run timeout after 30001 ms. (steps per millisecond=98 ) properties seen :[0]
Probabilistic random walk after 2943734 steps, saw 452009 distinct states, run finished after 30001 ms. (steps per millisecond=98 ) properties seen :[0]
// Phase 1: matrix 694 rows 416 cols
[2021-05-18 10:11:16] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-18 10:11:16] [INFO ] [Real]Absence check using 200 positive place invariants in 106 ms returned sat
[2021-05-18 10:11:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:11:17] [INFO ] [Real]Absence check using state equation in 721 ms returned sat
[2021-05-18 10:11:17] [INFO ] State equation strengthened by 142 read => feed constraints.
[2021-05-18 10:11:17] [INFO ] [Real]Added 142 Read/Feed constraints in 25 ms returned sat
[2021-05-18 10:11:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:11:17] [INFO ] [Nat]Absence check using 200 positive place invariants in 104 ms returned sat
[2021-05-18 10:11:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 10:11:18] [INFO ] [Nat]Absence check using state equation in 750 ms returned sat
[2021-05-18 10:11:18] [INFO ] [Nat]Added 142 Read/Feed constraints in 33 ms returned sat
[2021-05-18 10:11:18] [INFO ] Computed and/alt/rep : 688/3645/688 causal constraints in 56 ms.
[2021-05-18 10:11:32] [INFO ] Added : 550 causal constraints over 110 iterations in 14605 ms. Result :unknown
Incomplete Parikh walk after 77600 steps, including 990 resets, run finished after 527 ms. (steps per millisecond=147 ) properties seen :[0] could not realise parikh vector
Support contains 10 out of 416 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 416/416 places, 694/694 transitions.
Applied a total of 0 rules in 17 ms. Remains 416 /416 variables (removed 0) and now considering 694/694 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 694/694 transitions.
Starting structural reductions, iteration 0 : 416/416 places, 694/694 transitions.
Applied a total of 0 rules in 17 ms. Remains 416 /416 variables (removed 0) and now considering 694/694 (removed 0) transitions.
// Phase 1: matrix 694 rows 416 cols
[2021-05-18 10:11:33] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-18 10:11:34] [INFO ] Implicit Places using invariants in 885 ms returned []
// Phase 1: matrix 694 rows 416 cols
[2021-05-18 10:11:34] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-18 10:11:35] [INFO ] State equation strengthened by 142 read => feed constraints.
[2021-05-18 10:11:38] [INFO ] Implicit Places using invariants and state equation in 4395 ms returned []
Implicit Place search using SMT with State Equation took 5282 ms to find 0 implicit places.
[2021-05-18 10:11:38] [INFO ] Redundant transitions in 70 ms returned []
// Phase 1: matrix 694 rows 416 cols
[2021-05-18 10:11:38] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-18 10:11:40] [INFO ] Dead Transitions using invariants and state equation in 1278 ms returned []
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 694/694 transitions.
Incomplete random walk after 100000 steps, including 28 resets, run finished after 568 ms. (steps per millisecond=176 ) properties seen :[0]
// Phase 1: matrix 694 rows 416 cols
[2021-05-18 10:11:40] [INFO ] Computed 200 place invariants in 6 ms
[2021-05-18 10:11:40] [INFO ] [Real]Absence check using 200 positive place invariants in 103 ms returned sat
[2021-05-18 10:11:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:11:41] [INFO ] [Real]Absence check using state equation in 732 ms returned sat
[2021-05-18 10:11:41] [INFO ] State equation strengthened by 142 read => feed constraints.
[2021-05-18 10:11:41] [INFO ] [Real]Added 142 Read/Feed constraints in 25 ms returned sat
[2021-05-18 10:11:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:11:41] [INFO ] [Nat]Absence check using 200 positive place invariants in 105 ms returned sat
[2021-05-18 10:11:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 10:11:42] [INFO ] [Nat]Absence check using state equation in 724 ms returned sat
[2021-05-18 10:11:42] [INFO ] [Nat]Added 142 Read/Feed constraints in 25 ms returned sat
[2021-05-18 10:11:42] [INFO ] Computed and/alt/rep : 688/3645/688 causal constraints in 45 ms.
[2021-05-18 10:11:57] [INFO ] Added : 550 causal constraints over 110 iterations in 14532 ms. Result :unknown
Graph (trivial) has 189 edges and 416 vertex of which 4 / 416 are part of one of the 2 SCC in 12 ms
Free SCC test removed 2 places
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1461 edges and 414 vertex of which 412 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (trivial) has 186 edges and 410 vertex of which 4 / 410 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 13 place count 408 transition count 685
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 185 edges and 406 vertex of which 6 / 406 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 403 transition count 676
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 183 edges and 400 vertex of which 8 / 400 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 40 place count 396 transition count 665
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 179 edges and 392 vertex of which 8 / 392 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 59 place count 388 transition count 651
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 175 edges and 384 vertex of which 8 / 384 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 78 place count 380 transition count 637
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 171 edges and 376 vertex of which 8 / 376 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 97 place count 372 transition count 623
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 368 vertex of which 8 / 368 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 116 place count 364 transition count 609
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 163 edges and 360 vertex of which 8 / 360 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 135 place count 356 transition count 595
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 159 edges and 352 vertex of which 8 / 352 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 154 place count 348 transition count 581
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 155 edges and 344 vertex of which 8 / 344 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 173 place count 340 transition count 567
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 151 edges and 336 vertex of which 8 / 336 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 192 place count 332 transition count 553
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 147 edges and 328 vertex of which 8 / 328 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 211 place count 324 transition count 539
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 143 edges and 320 vertex of which 8 / 320 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 230 place count 316 transition count 525
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 139 edges and 312 vertex of which 8 / 312 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 249 place count 308 transition count 511
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 135 edges and 304 vertex of which 6 / 304 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 268 place count 301 transition count 497
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 132 edges and 298 vertex of which 6 / 298 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 15 with 14 rules applied. Total rules applied 282 place count 295 transition count 487
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 129 edges and 292 vertex of which 4 / 292 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 16 with 16 rules applied. Total rules applied 298 place count 290 transition count 475
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 129 edges and 288 vertex of which 6 / 288 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 17 with 9 rules applied. Total rules applied 307 place count 285 transition count 469
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 127 edges and 282 vertex of which 8 / 282 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 17 rules applied. Total rules applied 324 place count 278 transition count 456
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 121 edges and 275 vertex of which 4 / 275 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 19 with 17 rules applied. Total rules applied 341 place count 273 transition count 443
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (trivial) has 119 edges and 271 vertex of which 4 / 271 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 20 with 10 rules applied. Total rules applied 351 place count 269 transition count 436
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 21 with 10 rules applied. Total rules applied 361 place count 267 transition count 428
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 22 with 2 Pre rules applied. Total rules applied 361 place count 267 transition count 426
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 22 with 5 rules applied. Total rules applied 366 place count 264 transition count 426
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 22 with 1 Pre rules applied. Total rules applied 366 place count 264 transition count 425
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 368 place count 263 transition count 425
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 369 place count 263 transition count 424
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 23 with 6 rules applied. Total rules applied 375 place count 259 transition count 422
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 23 with 5 rules applied. Total rules applied 380 place count 259 transition count 417
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 24 with 15 rules applied. Total rules applied 395 place count 259 transition count 417
Partial Post-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 24 with 13 rules applied. Total rules applied 408 place count 259 transition count 417
Drop transitions removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 24 with 29 rules applied. Total rules applied 437 place count 259 transition count 388
Applied a total of 437 rules in 165 ms. Remains 259 /416 variables (removed 157) and now considering 388/694 (removed 306) transitions.
// Phase 1: matrix 388 rows 259 cols
[2021-05-18 10:11:57] [INFO ] Computed 123 place invariants in 1 ms
[2021-05-18 10:11:57] [INFO ] [Real]Absence check using 123 positive place invariants in 51 ms returned sat
[2021-05-18 10:11:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:11:57] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2021-05-18 10:11:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-18 10:11:57] [INFO ] [Real]Added 4 Read/Feed constraints in 5 ms returned sat
[2021-05-18 10:11:57] [INFO ] Computed and/alt/rep : 383/1963/383 causal constraints in 22 ms.
[2021-05-18 10:11:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:11:57] [INFO ] [Nat]Absence check using 123 positive place invariants in 57 ms returned sat
[2021-05-18 10:11:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 10:11:58] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2021-05-18 10:11:58] [INFO ] [Nat]Added 4 Read/Feed constraints in 6 ms returned sat
[2021-05-18 10:11:58] [INFO ] Computed and/alt/rep : 383/1963/383 causal constraints in 30 ms.
[2021-05-18 10:12:06] [INFO ] Added : 320 causal constraints over 64 iterations in 8511 ms. Result :unknown
[2021-05-18 10:12:06] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2021-05-18 10:12:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 22 ms.
[2021-05-18 10:12:07] [INFO ] Flatten gal took : 163 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldRVt-PT-050B @ 3570 seconds
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3564
rslt: Output for ReachabilityFireability @ ShieldRVt-PT-050B
{
"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 10:12:08 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 24940,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 3,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "A (G (((p32 <= 0) OR (p63 <= 0) OR (p121 <= 0) OR ((1 <= p214) AND (1 <= p274) AND (1 <= p199) AND (((1 <= p295)) OR ((1 <= p261))) AND (((1 <= p42)) OR ((1 <= p72)))))))",
"processed_size": 175,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 3918,
"conflict_clusters": 116,
"places": 416,
"places_significant": 216,
"singleton_clusters": 0,
"transitions": 694
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "state space",
"value": true
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 22,
"problems": 5
},
"type": "invariance",
"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: 1110/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 416
lola: finding significant places
lola: 416 places, 694 transitions, 216 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: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p274 <= 1)
lola: LP says that atomic proposition is always true: (p199 <= 1)
lola: LP says that atomic proposition is always true: (p295 <= 1)
lola: LP says that atomic proposition is always true: (p261 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: A (G (((p32 <= 0) OR (p63 <= 0) OR (p121 <= 0) OR ((1 <= p214) AND (1 <= p274) AND (1 <= p199) AND (((1 <= p295)) OR ((1 <= p261))) AND (((1 <= p42)) OR ((1 <= p72)))))))
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 (((p32 <= 0) OR (p63 <= 0) OR (p121 <= 0) OR ((1 <= p214) AND (1 <= p274) AND (1 <= p199) AND (((1 <= p295)) OR ((1 <= p261))) AND (((1 <= p42)) OR ((1 <= p72)))))))
lola: processed formula length: 175
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: subprocess will run for 0 seconds at most (--localtimelimit)
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: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p32) AND (1 <= p63) AND (1 <= p121) AND ((p214 <= 0) OR (p274 <= 0) OR (p199 <= 0) OR (((p295 <= 0)) AND ((p261 <= 0))) OR (((p42 <= 0)) AND ((p72 <= 0)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 22 literals and 5 conjunctive subformulas
lola: RESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 10 markings, 10 edges
lola: memory consumption: 24940 KB
lola: time consumption: 6 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="ShieldRVt-PT-050B"
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 ShieldRVt-PT-050B, 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-162106594400168"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-050B.tgz
mv ShieldRVt-PT-050B 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 '
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 ;