About the Execution of 2020-gold for ShieldIIPs-PT-100A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10091.731 | 3600000.00 | 726168.00 | 1768.20 | TFTFTTFTTFTFTFTF | 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.r227-tall-162098230900164.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is ShieldIIPs-PT-100A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-tall-162098230900164
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 91K 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.6K Mar 28 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 11:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 11:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 17:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 868K 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 ShieldIIPs-PT-100A-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1621139305990
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 04:28:27] [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-16 04:28:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 04:28:27] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2021-05-16 04:28:27] [INFO ] Transformed 2503 places.
[2021-05-16 04:28:27] [INFO ] Transformed 2403 transitions.
[2021-05-16 04:28:27] [INFO ] Found NUPN structural information;
[2021-05-16 04:28:27] [INFO ] Parsed PT model containing 2503 places and 2403 transitions in 283 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 112 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 1 resets, run finished after 204 ms. (steps per millisecond=49 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1]
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 116 ms. (steps per millisecond=86 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 126 ms. (steps per millisecond=79 ) properties seen :[0, 1, 0, 0, 0]
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 121 ms. (steps per millisecond=82 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 117 ms. (steps per millisecond=85 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 116 ms. (steps per millisecond=86 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 2403 rows 2503 cols
[2021-05-16 04:28:28] [INFO ] Computed 901 place invariants in 54 ms
[2021-05-16 04:28:30] [INFO ] [Real]Absence check using 901 positive place invariants in 959 ms returned sat
[2021-05-16 04:28:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:28:33] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 04:28:33] [INFO ] [Real]Absence check using state equation in 3667 ms returned (error "Failed to check-sat")
[2021-05-16 04:28:35] [INFO ] [Real]Absence check using 901 positive place invariants in 955 ms returned sat
[2021-05-16 04:28:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:28:38] [INFO ] [Real]Absence check using state equation in 3698 ms returned (error "Solver has unexpectedly terminated")
[2021-05-16 04:28:40] [INFO ] [Real]Absence check using 901 positive place invariants in 934 ms returned sat
[2021-05-16 04:28:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:28:43] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 04:28:43] [INFO ] [Real]Absence check using state equation in 3767 ms returned (error "Failed to check-sat")
[2021-05-16 04:28:45] [INFO ] [Real]Absence check using 901 positive place invariants in 975 ms returned sat
[2021-05-16 04:28:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:28:48] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 04:28:48] [INFO ] [Real]Absence check using state equation in 3717 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, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 44 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 673 times.
Drop transitions removed 673 transitions
Iterating global reduction 0 with 673 rules applied. Total rules applied 677 place count 2501 transition count 2401
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 678 place count 2501 transition count 2401
Applied a total of 678 rules in 820 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 1000000 steps, including 116 resets, run finished after 18743 ms. (steps per millisecond=53 ) properties seen :[1, 0, 1, 0]
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 398030 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=79 ) properties seen :[1, 0]
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 397541 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=79 ) properties seen :[0]
// Phase 1: matrix 2401 rows 2501 cols
[2021-05-16 04:29:18] [INFO ] Computed 901 place invariants in 155 ms
[2021-05-16 04:29:19] [INFO ] [Real]Absence check using 884 positive place invariants in 925 ms returned sat
[2021-05-16 04:29:19] [INFO ] [Real]Absence check using 884 positive and 17 generalized place invariants in 25 ms returned sat
[2021-05-16 04:29:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:29:32] [INFO ] [Real]Absence check using state equation in 12120 ms returned sat
[2021-05-16 04:29:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 04:29:33] [INFO ] [Nat]Absence check using 884 positive place invariants in 913 ms returned sat
[2021-05-16 04:29:33] [INFO ] [Nat]Absence check using 884 positive and 17 generalized place invariants in 26 ms returned sat
[2021-05-16 04:29:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 04:29:45] [INFO ] [Nat]Absence check using state equation in 12155 ms returned sat
[2021-05-16 04:29:45] [INFO ] State equation strengthened by 5 read => feed constraints.
[2021-05-16 04:29:45] [INFO ] [Nat]Added 5 Read/Feed constraints in 24 ms returned sat
[2021-05-16 04:29:46] [INFO ] Deduced a trap composed of 5 places in 223 ms
[2021-05-16 04:29:46] [INFO ] Deduced a trap composed of 5 places in 169 ms
[2021-05-16 04:29:46] [INFO ] Deduced a trap composed of 13 places in 173 ms
[2021-05-16 04:29:46] [INFO ] Deduced a trap composed of 5 places in 144 ms
[2021-05-16 04:29:46] [INFO ] Deduced a trap composed of 15 places in 138 ms
[2021-05-16 04:29:47] [INFO ] Deduced a trap composed of 9 places in 97 ms
[2021-05-16 04:29:47] [INFO ] Deduced a trap composed of 9 places in 79 ms
[2021-05-16 04:29:47] [INFO ] Deduced a trap composed of 9 places in 62 ms
[2021-05-16 04:29:47] [INFO ] Deduced a trap composed of 18 places in 45 ms
[2021-05-16 04:29:47] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2011 ms
[2021-05-16 04:29:47] [INFO ] Computed and/alt/rep : 2400/15436/2400 causal constraints in 173 ms.
[2021-05-16 04:30:07] [INFO ] Added : 610 causal constraints over 122 iterations in 20259 ms.(timeout) Result :sat
[2021-05-16 04:30:08] [INFO ] Deduced a trap composed of 5 places in 215 ms
[2021-05-16 04:30:08] [INFO ] Deduced a trap composed of 5 places in 194 ms
[2021-05-16 04:30:09] [INFO ] Deduced a trap composed of 5 places in 185 ms
[2021-05-16 04:30:09] [INFO ] Deduced a trap composed of 5 places in 178 ms
[2021-05-16 04:30:09] [INFO ] Deduced a trap composed of 5 places in 178 ms
[2021-05-16 04:30:10] [INFO ] Deduced a trap composed of 5 places in 178 ms
[2021-05-16 04:30:10] [INFO ] Deduced a trap composed of 12 places in 175 ms
[2021-05-16 04:30:10] [INFO ] Deduced a trap composed of 5 places in 175 ms
[2021-05-16 04:30:11] [INFO ] Deduced a trap composed of 5 places in 172 ms
[2021-05-16 04:30:11] [INFO ] Deduced a trap composed of 5 places in 169 ms
[2021-05-16 04:30:11] [INFO ] Deduced a trap composed of 26 places in 166 ms
[2021-05-16 04:30:12] [INFO ] Deduced a trap composed of 9 places in 155 ms
[2021-05-16 04:30:12] [INFO ] Deduced a trap composed of 9 places in 149 ms
[2021-05-16 04:30:12] [INFO ] Deduced a trap composed of 9 places in 138 ms
[2021-05-16 04:30:13] [INFO ] Deduced a trap composed of 9 places in 135 ms
[2021-05-16 04:30:13] [INFO ] Deduced a trap composed of 9 places in 123 ms
[2021-05-16 04:30:13] [INFO ] Deduced a trap composed of 9 places in 93 ms
[2021-05-16 04:30:13] [INFO ] Deduced a trap composed of 15 places in 91 ms
[2021-05-16 04:30:14] [INFO ] Deduced a trap composed of 9 places in 77 ms
[2021-05-16 04:30:14] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 6435 ms
Attempting to minimize the solution found.
Minimization took 101 ms.
Incomplete Parikh walk after 437900 steps, including 1001 resets, run finished after 8266 ms. (steps per millisecond=52 ) properties seen :[0] could not realise parikh vector
Support contains 15 out of 2501 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 2501 transition count 2401
Applied a total of 18 rules in 158 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2401/2401 transitions.
Incomplete random walk after 1000000 steps, including 89 resets, run finished after 18778 ms. (steps per millisecond=53 ) properties seen :[0]
Interrupted Best-First random walk after 395299 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=79 ) properties seen :[0]
Interrupted probabilistic random walk after 1241259 steps, run timeout after 30001 ms. (steps per millisecond=41 ) properties seen :[0]
Probabilistic random walk after 1241259 steps, saw 26256 distinct states, run finished after 30001 ms. (steps per millisecond=41 ) properties seen :[0]
// Phase 1: matrix 2401 rows 2501 cols
[2021-05-16 04:31:16] [INFO ] Computed 901 place invariants in 62 ms
[2021-05-16 04:31:18] [INFO ] [Real]Absence check using 895 positive place invariants in 973 ms returned sat
[2021-05-16 04:31:18] [INFO ] [Real]Absence check using 895 positive and 6 generalized place invariants in 11 ms returned sat
[2021-05-16 04:31:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:31:30] [INFO ] [Real]Absence check using state equation in 12148 ms returned sat
[2021-05-16 04:31:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 04:31:31] [INFO ] [Nat]Absence check using 895 positive place invariants in 941 ms returned sat
[2021-05-16 04:31:31] [INFO ] [Nat]Absence check using 895 positive and 6 generalized place invariants in 15 ms returned sat
[2021-05-16 04:31:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 04:31:44] [INFO ] [Nat]Absence check using state equation in 12406 ms returned sat
[2021-05-16 04:31:44] [INFO ] State equation strengthened by 5 read => feed constraints.
[2021-05-16 04:31:44] [INFO ] [Nat]Added 5 Read/Feed constraints in 27 ms returned sat
[2021-05-16 04:31:44] [INFO ] Deduced a trap composed of 6 places in 183 ms
[2021-05-16 04:31:44] [INFO ] Deduced a trap composed of 12 places in 188 ms
[2021-05-16 04:31:44] [INFO ] Deduced a trap composed of 18 places in 175 ms
[2021-05-16 04:31:45] [INFO ] Deduced a trap composed of 9 places in 158 ms
[2021-05-16 04:31:45] [INFO ] Deduced a trap composed of 9 places in 153 ms
[2021-05-16 04:31:45] [INFO ] Deduced a trap composed of 9 places in 143 ms
[2021-05-16 04:31:45] [INFO ] Deduced a trap composed of 18 places in 137 ms
[2021-05-16 04:31:45] [INFO ] Deduced a trap composed of 15 places in 123 ms
[2021-05-16 04:31:46] [INFO ] Deduced a trap composed of 18 places in 97 ms
[2021-05-16 04:31:46] [INFO ] Deduced a trap composed of 12 places in 83 ms
[2021-05-16 04:31:46] [INFO ] Deduced a trap composed of 12 places in 92 ms
[2021-05-16 04:31:46] [INFO ] Deduced a trap composed of 18 places in 77 ms
[2021-05-16 04:31:46] [INFO ] Deduced a trap composed of 18 places in 79 ms
[2021-05-16 04:31:46] [INFO ] Deduced a trap composed of 24 places in 81 ms
[2021-05-16 04:31:47] [INFO ] Deduced a trap composed of 15 places in 65 ms
[2021-05-16 04:31:47] [INFO ] Deduced a trap composed of 18 places in 70 ms
[2021-05-16 04:31:47] [INFO ] Deduced a trap composed of 9 places in 74 ms
[2021-05-16 04:31:47] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3405 ms
[2021-05-16 04:31:47] [INFO ] Computed and/alt/rep : 2400/15608/2400 causal constraints in 131 ms.
[2021-05-16 04:32:07] [INFO ] Added : 645 causal constraints over 129 iterations in 20204 ms.(timeout) Result :sat
[2021-05-16 04:32:08] [INFO ] Deduced a trap composed of 5 places in 358 ms
[2021-05-16 04:32:08] [INFO ] Deduced a trap composed of 5 places in 363 ms
[2021-05-16 04:32:09] [INFO ] Deduced a trap composed of 5 places in 322 ms
[2021-05-16 04:32:09] [INFO ] Deduced a trap composed of 5 places in 319 ms
[2021-05-16 04:32:10] [INFO ] Deduced a trap composed of 5 places in 314 ms
[2021-05-16 04:32:10] [INFO ] Deduced a trap composed of 9 places in 319 ms
[2021-05-16 04:32:11] [INFO ] Deduced a trap composed of 5 places in 318 ms
[2021-05-16 04:32:11] [INFO ] Deduced a trap composed of 5 places in 302 ms
[2021-05-16 04:32:12] [INFO ] Deduced a trap composed of 9 places in 302 ms
[2021-05-16 04:32:12] [INFO ] Deduced a trap composed of 6 places in 299 ms
[2021-05-16 04:32:12] [INFO ] Deduced a trap composed of 6 places in 285 ms
[2021-05-16 04:32:13] [INFO ] Deduced a trap composed of 9 places in 302 ms
[2021-05-16 04:32:13] [INFO ] Deduced a trap composed of 9 places in 241 ms
[2021-05-16 04:32:14] [INFO ] Deduced a trap composed of 9 places in 220 ms
[2021-05-16 04:32:14] [INFO ] Deduced a trap composed of 5 places in 199 ms
[2021-05-16 04:32:14] [INFO ] Deduced a trap composed of 12 places in 192 ms
[2021-05-16 04:32:15] [INFO ] Deduced a trap composed of 6 places in 195 ms
[2021-05-16 04:32:15] [INFO ] Deduced a trap composed of 9 places in 193 ms
[2021-05-16 04:32:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1679 s1681 s1689 s1690 s1692 s1693 s1699 s1700) 0)") while checking expression at index 0
Support contains 15 out of 2501 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 77 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 77 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2021-05-16 04:32:15] [INFO ] Computed 901 place invariants in 43 ms
[2021-05-16 04:32:24] [INFO ] Implicit Places using invariants in 9073 ms returned []
// Phase 1: matrix 2401 rows 2501 cols
[2021-05-16 04:32:24] [INFO ] Computed 901 place invariants in 41 ms
[2021-05-16 04:32:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2021-05-16 04:33:08] [INFO ] Performed 1241/2501 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2021-05-16 04:33:38] [INFO ] Implicit Places using invariants and state equation in 73599 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 82676 ms to find 1 implicit places.
[2021-05-16 04:33:39] [INFO ] Redundant transitions in 740 ms returned []
// Phase 1: matrix 2401 rows 2500 cols
[2021-05-16 04:33:39] [INFO ] Computed 900 place invariants in 41 ms
[2021-05-16 04:33:52] [INFO ] Dead Transitions using invariants and state equation in 13083 ms returned []
Starting structural reductions, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 75 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2021-05-16 04:33:52] [INFO ] Redundant transitions in 293 ms returned []
// Phase 1: matrix 2401 rows 2500 cols
[2021-05-16 04:33:52] [INFO ] Computed 900 place invariants in 41 ms
[2021-05-16 04:34:00] [INFO ] Dead Transitions using invariants and state equation in 7968 ms returned []
Finished structural reductions, in 2 iterations. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 1000000 steps, including 91 resets, run finished after 18814 ms. (steps per millisecond=53 ) properties seen :[0]
Interrupted Best-First random walk after 394968 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=78 ) properties seen :[0]
Interrupted probabilistic random walk after 1308835 steps, run timeout after 30001 ms. (steps per millisecond=43 ) properties seen :[0]
Probabilistic random walk after 1308835 steps, saw 27536 distinct states, run finished after 30001 ms. (steps per millisecond=43 ) properties seen :[0]
// Phase 1: matrix 2401 rows 2500 cols
[2021-05-16 04:34:54] [INFO ] Computed 900 place invariants in 42 ms
[2021-05-16 04:34:55] [INFO ] [Real]Absence check using 894 positive place invariants in 939 ms returned sat
[2021-05-16 04:34:55] [INFO ] [Real]Absence check using 894 positive and 6 generalized place invariants in 10 ms returned sat
[2021-05-16 04:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:35:07] [INFO ] [Real]Absence check using state equation in 12066 ms returned sat
[2021-05-16 04:35:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 04:35:09] [INFO ] [Nat]Absence check using 894 positive place invariants in 923 ms returned sat
[2021-05-16 04:35:09] [INFO ] [Nat]Absence check using 894 positive and 6 generalized place invariants in 10 ms returned sat
[2021-05-16 04:35:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 04:35:21] [INFO ] [Nat]Absence check using state equation in 12698 ms returned sat
[2021-05-16 04:35:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 04:35:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 25 ms returned sat
[2021-05-16 04:35:22] [INFO ] Deduced a trap composed of 12 places in 142 ms
[2021-05-16 04:35:22] [INFO ] Deduced a trap composed of 18 places in 143 ms
[2021-05-16 04:35:22] [INFO ] Deduced a trap composed of 18 places in 135 ms
[2021-05-16 04:35:22] [INFO ] Deduced a trap composed of 5 places in 126 ms
[2021-05-16 04:35:22] [INFO ] Deduced a trap composed of 12 places in 122 ms
[2021-05-16 04:35:23] [INFO ] Deduced a trap composed of 15 places in 125 ms
[2021-05-16 04:35:23] [INFO ] Deduced a trap composed of 15 places in 118 ms
[2021-05-16 04:35:23] [INFO ] Deduced a trap composed of 9 places in 224 ms
[2021-05-16 04:35:23] [INFO ] Deduced a trap composed of 9 places in 91 ms
[2021-05-16 04:35:23] [INFO ] Deduced a trap composed of 9 places in 89 ms
[2021-05-16 04:35:24] [INFO ] Deduced a trap composed of 18 places in 93 ms
[2021-05-16 04:35:24] [INFO ] Deduced a trap composed of 18 places in 93 ms
[2021-05-16 04:35:24] [INFO ] Deduced a trap composed of 24 places in 102 ms
[2021-05-16 04:35:24] [INFO ] Deduced a trap composed of 18 places in 91 ms
[2021-05-16 04:35:24] [INFO ] Deduced a trap composed of 6 places in 78 ms
[2021-05-16 04:35:24] [INFO ] Deduced a trap composed of 9 places in 82 ms
[2021-05-16 04:35:25] [INFO ] Deduced a trap composed of 12 places in 78 ms
[2021-05-16 04:35:25] [INFO ] Deduced a trap composed of 24 places in 74 ms
[2021-05-16 04:35:25] [INFO ] Deduced a trap composed of 12 places in 89 ms
[2021-05-16 04:35:25] [INFO ] Deduced a trap composed of 18 places in 93 ms
[2021-05-16 04:35:25] [INFO ] Deduced a trap composed of 15 places in 65 ms
[2021-05-16 04:35:25] [INFO ] Deduced a trap composed of 9 places in 59 ms
[2021-05-16 04:35:26] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4135 ms
[2021-05-16 04:35:26] [INFO ] Computed and/alt/rep : 2400/15604/2400 causal constraints in 134 ms.
[2021-05-16 04:35:46] [INFO ] Added : 625 causal constraints over 125 iterations in 20217 ms.(timeout) Result :sat
[2021-05-16 04:35:46] [INFO ] Deduced a trap composed of 5 places in 197 ms
[2021-05-16 04:35:46] [INFO ] Deduced a trap composed of 5 places in 174 ms
[2021-05-16 04:35:47] [INFO ] Deduced a trap composed of 9 places in 163 ms
[2021-05-16 04:35:47] [INFO ] Deduced a trap composed of 5 places in 164 ms
[2021-05-16 04:35:47] [INFO ] Deduced a trap composed of 5 places in 162 ms
[2021-05-16 04:35:48] [INFO ] Deduced a trap composed of 9 places in 136 ms
[2021-05-16 04:35:48] [INFO ] Deduced a trap composed of 5 places in 114 ms
[2021-05-16 04:35:48] [INFO ] Deduced a trap composed of 5 places in 117 ms
[2021-05-16 04:35:49] [INFO ] Deduced a trap composed of 9 places in 115 ms
[2021-05-16 04:35:49] [INFO ] Deduced a trap composed of 9 places in 98 ms
[2021-05-16 04:35:49] [INFO ] Deduced a trap composed of 12 places in 91 ms
[2021-05-16 04:35:50] [INFO ] Deduced a trap composed of 9 places in 92 ms
[2021-05-16 04:35:50] [INFO ] Deduced a trap composed of 9 places in 97 ms
[2021-05-16 04:35:50] [INFO ] Deduced a trap composed of 15 places in 87 ms
[2021-05-16 04:35:51] [INFO ] Deduced a trap composed of 32 places in 80 ms
[2021-05-16 04:35:51] [INFO ] Deduced a trap composed of 12 places in 70 ms
[2021-05-16 04:35:51] [INFO ] Deduced a trap composed of 18 places in 69 ms
[2021-05-16 04:35:52] [INFO ] Deduced a trap composed of 21 places in 66 ms
[2021-05-16 04:35:52] [INFO ] Deduced a trap composed of 6 places in 59 ms
[2021-05-16 04:35:52] [INFO ] Deduced a trap composed of 9 places in 59 ms
[2021-05-16 04:35:52] [INFO ] Deduced a trap composed of 15 places in 62 ms
[2021-05-16 04:35:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s304 s308 s309 s313 s318 s324 s326 s338 s345 s347 s355 s358 s370 s371) 0)") while checking expression at index 0
Support contains 15 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 72 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 74 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2021-05-16 04:35:53] [INFO ] Computed 900 place invariants in 56 ms
[2021-05-16 04:36:06] [INFO ] Implicit Places using invariants in 13705 ms returned []
// Phase 1: matrix 2401 rows 2500 cols
[2021-05-16 04:36:06] [INFO ] Computed 900 place invariants in 40 ms
[2021-05-16 04:36:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 04:36:49] [INFO ] Performed 1429/2500 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2021-05-16 04:37:12] [INFO ] Implicit Places using invariants and state equation in 66056 ms returned []
Implicit Place search using SMT with State Equation took 79762 ms to find 0 implicit places.
[2021-05-16 04:37:12] [INFO ] Redundant transitions in 77 ms returned []
// Phase 1: matrix 2401 rows 2500 cols
[2021-05-16 04:37:12] [INFO ] Computed 900 place invariants in 40 ms
[2021-05-16 04:37:26] [INFO ] Dead Transitions using invariants and state equation in 13061 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2401/2401 transitions.
Incomplete random walk after 100000 steps, including 9 resets, run finished after 1897 ms. (steps per millisecond=52 ) properties seen :[0]
// Phase 1: matrix 2401 rows 2500 cols
[2021-05-16 04:37:27] [INFO ] Computed 900 place invariants in 39 ms
[2021-05-16 04:37:29] [INFO ] [Real]Absence check using 894 positive place invariants in 930 ms returned sat
[2021-05-16 04:37:29] [INFO ] [Real]Absence check using 894 positive and 6 generalized place invariants in 10 ms returned sat
[2021-05-16 04:37:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:37:40] [INFO ] [Real]Absence check using state equation in 11526 ms returned sat
[2021-05-16 04:37:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 04:37:41] [INFO ] [Nat]Absence check using 894 positive place invariants in 917 ms returned sat
[2021-05-16 04:37:42] [INFO ] [Nat]Absence check using 894 positive and 6 generalized place invariants in 10 ms returned sat
[2021-05-16 04:37:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 04:37:53] [INFO ] [Nat]Absence check using state equation in 11781 ms returned sat
[2021-05-16 04:37:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 04:37:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 24 ms returned sat
[2021-05-16 04:37:54] [INFO ] Deduced a trap composed of 12 places in 137 ms
[2021-05-16 04:37:54] [INFO ] Deduced a trap composed of 18 places in 136 ms
[2021-05-16 04:37:54] [INFO ] Deduced a trap composed of 18 places in 134 ms
[2021-05-16 04:37:54] [INFO ] Deduced a trap composed of 5 places in 126 ms
[2021-05-16 04:37:54] [INFO ] Deduced a trap composed of 12 places in 124 ms
[2021-05-16 04:37:55] [INFO ] Deduced a trap composed of 15 places in 123 ms
[2021-05-16 04:37:55] [INFO ] Deduced a trap composed of 15 places in 120 ms
[2021-05-16 04:37:55] [INFO ] Deduced a trap composed of 9 places in 105 ms
[2021-05-16 04:37:55] [INFO ] Deduced a trap composed of 9 places in 90 ms
[2021-05-16 04:37:55] [INFO ] Deduced a trap composed of 9 places in 89 ms
[2021-05-16 04:37:55] [INFO ] Deduced a trap composed of 18 places in 87 ms
[2021-05-16 04:37:56] [INFO ] Deduced a trap composed of 18 places in 91 ms
[2021-05-16 04:37:56] [INFO ] Deduced a trap composed of 24 places in 93 ms
[2021-05-16 04:37:56] [INFO ] Deduced a trap composed of 18 places in 74 ms
[2021-05-16 04:37:56] [INFO ] Deduced a trap composed of 6 places in 75 ms
[2021-05-16 04:37:56] [INFO ] Deduced a trap composed of 9 places in 75 ms
[2021-05-16 04:37:56] [INFO ] Deduced a trap composed of 12 places in 73 ms
[2021-05-16 04:37:57] [INFO ] Deduced a trap composed of 24 places in 73 ms
[2021-05-16 04:37:57] [INFO ] Deduced a trap composed of 12 places in 77 ms
[2021-05-16 04:37:57] [INFO ] Deduced a trap composed of 18 places in 77 ms
[2021-05-16 04:37:57] [INFO ] Deduced a trap composed of 15 places in 64 ms
[2021-05-16 04:37:57] [INFO ] Deduced a trap composed of 9 places in 55 ms
[2021-05-16 04:37:57] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3899 ms
[2021-05-16 04:37:57] [INFO ] Computed and/alt/rep : 2400/15604/2400 causal constraints in 122 ms.
[2021-05-16 04:38:00] [INFO ] Added : 125 causal constraints over 25 iterations in 3072 ms. Result :(error "Failed to check-sat")
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2500 transition count 2401
Applied a total of 1 rules in 131 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2021-05-16 04:38:00] [INFO ] Computed 900 place invariants in 40 ms
[2021-05-16 04:38:02] [INFO ] [Real]Absence check using 894 positive place invariants in 922 ms returned sat
[2021-05-16 04:38:02] [INFO ] [Real]Absence check using 894 positive and 6 generalized place invariants in 10 ms returned sat
[2021-05-16 04:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:38:13] [INFO ] [Real]Absence check using state equation in 11557 ms returned sat
[2021-05-16 04:38:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 04:38:15] [INFO ] [Nat]Absence check using 894 positive place invariants in 917 ms returned sat
[2021-05-16 04:38:15] [INFO ] [Nat]Absence check using 894 positive and 6 generalized place invariants in 10 ms returned sat
[2021-05-16 04:38:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 04:38:26] [INFO ] [Nat]Absence check using state equation in 11745 ms returned sat
[2021-05-16 04:38:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 04:38:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 21 ms returned sat
[2021-05-16 04:38:27] [INFO ] Deduced a trap composed of 5 places in 219 ms
[2021-05-16 04:38:27] [INFO ] Deduced a trap composed of 5 places in 214 ms
[2021-05-16 04:38:27] [INFO ] Deduced a trap composed of 15 places in 359 ms
[2021-05-16 04:38:28] [INFO ] Deduced a trap composed of 5 places in 243 ms
[2021-05-16 04:38:28] [INFO ] Deduced a trap composed of 9 places in 233 ms
[2021-05-16 04:38:28] [INFO ] Deduced a trap composed of 9 places in 223 ms
[2021-05-16 04:38:29] [INFO ] Deduced a trap composed of 5 places in 220 ms
[2021-05-16 04:38:29] [INFO ] Deduced a trap composed of 18 places in 220 ms
[2021-05-16 04:38:29] [INFO ] Deduced a trap composed of 9 places in 215 ms
[2021-05-16 04:38:29] [INFO ] Deduced a trap composed of 18 places in 200 ms
[2021-05-16 04:38:30] [INFO ] Deduced a trap composed of 12 places in 203 ms
[2021-05-16 04:38:30] [INFO ] Deduced a trap composed of 12 places in 199 ms
[2021-05-16 04:38:30] [INFO ] Deduced a trap composed of 12 places in 194 ms
[2021-05-16 04:38:31] [INFO ] Deduced a trap composed of 18 places in 194 ms
[2021-05-16 04:38:31] [INFO ] Deduced a trap composed of 18 places in 193 ms
[2021-05-16 04:38:31] [INFO ] Deduced a trap composed of 21 places in 171 ms
[2021-05-16 04:38:31] [INFO ] Deduced a trap composed of 23 places in 158 ms
[2021-05-16 04:38:32] [INFO ] Deduced a trap composed of 18 places in 158 ms
[2021-05-16 04:38:32] [INFO ] Deduced a trap composed of 24 places in 138 ms
[2021-05-16 04:38:32] [INFO ] Deduced a trap composed of 18 places in 118 ms
[2021-05-16 04:38:32] [INFO ] Deduced a trap composed of 18 places in 105 ms
[2021-05-16 04:38:32] [INFO ] Deduced a trap composed of 12 places in 92 ms
[2021-05-16 04:38:32] [INFO ] Deduced a trap composed of 15 places in 91 ms
[2021-05-16 04:38:33] [INFO ] Deduced a trap composed of 15 places in 72 ms
[2021-05-16 04:38:33] [INFO ] Deduced a trap composed of 18 places in 77 ms
[2021-05-16 04:38:33] [INFO ] Deduced a trap composed of 18 places in 68 ms
[2021-05-16 04:38:33] [INFO ] Deduced a trap composed of 24 places in 72 ms
[2021-05-16 04:38:33] [INFO ] Deduced a trap composed of 9 places in 79 ms
[2021-05-16 04:38:33] [INFO ] Deduced a trap composed of 12 places in 74 ms
[2021-05-16 04:38:34] [INFO ] Deduced a trap composed of 9 places in 60 ms
[2021-05-16 04:38:34] [INFO ] Deduced a trap composed of 18 places in 44 ms
[2021-05-16 04:38:34] [INFO ] Deduced a trap composed of 18 places in 63 ms
[2021-05-16 04:38:34] [INFO ] Deduced a trap composed of 36 places in 57 ms
[2021-05-16 04:38:34] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 7682 ms
[2021-05-16 04:38:34] [INFO ] Computed and/alt/rep : 2400/15604/2400 causal constraints in 124 ms.
[2021-05-16 04:38:54] [INFO ] Added : 575 causal constraints over 115 iterations in 20197 ms.(timeout) Result :sat
[2021-05-16 04:38:55] [INFO ] Deduced a trap composed of 5 places in 307 ms
[2021-05-16 04:38:55] [INFO ] Deduced a trap composed of 9 places in 294 ms
[2021-05-16 04:38:55] [INFO ] Deduced a trap composed of 6 places in 279 ms
[2021-05-16 04:38:56] [INFO ] Deduced a trap composed of 5 places in 258 ms
[2021-05-16 04:38:56] [INFO ] Deduced a trap composed of 9 places in 266 ms
[2021-05-16 04:38:57] [INFO ] Deduced a trap composed of 5 places in 268 ms
[2021-05-16 04:38:57] [INFO ] Deduced a trap composed of 9 places in 255 ms
[2021-05-16 04:38:58] [INFO ] Deduced a trap composed of 5 places in 253 ms
[2021-05-16 04:38:58] [INFO ] Deduced a trap composed of 9 places in 248 ms
[2021-05-16 04:38:58] [INFO ] Deduced a trap composed of 9 places in 249 ms
[2021-05-16 04:38:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s579 s581 s589 s590 s592 s593 s599 s600) 0)") while checking expression at index 0
[2021-05-16 04:38:58] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2021-05-16 04:38:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 22 ms.
[2021-05-16 04:38:59] [INFO ] Flatten gal took : 508 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldIIPs-PT-100A @ 3570 seconds
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3528
rslt: Output for ReachabilityFireability @ ShieldIIPs-PT-100A
{
"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": "Sun May 16 04:39:00 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 48644,
"runtime": 42.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": 4,
"adisj": 1,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "A (G (((p2036 <= 0) OR (p2040 <= 0) OR (p2051 <= 0) OR (p1888 <= 0) OR (p1898 <= 0) OR (p1902 <= 0) OR ((1 <= p2297)) OR (p962 <= 0) OR (p995 <= 0) OR ((1 <= p97)) OR ((1 <= p2406) AND (1 <= p2417)) OR ((1 <= p2238) AND (1 <= p2248) AND (1 <= p2250)))))",
"processed_size": 264,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 12277,
"conflict_clusters": 303,
"places": 2500,
"places_significant": 1600,
"singleton_clusters": 0,
"transitions": 2401
},
"result":
{
"edges": 146,
"markings": 147,
"produced_by": "state space",
"value": false
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 72,
"problems": 6
},
"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: 4901/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2500
lola: finding significant places
lola: 2500 places, 2401 transitions, 1600 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: (p2036 <= 1)
lola: LP says that atomic proposition is always true: (p2040 <= 1)
lola: LP says that atomic proposition is always true: (p2051 <= 1)
lola: LP says that atomic proposition is always true: (p1888 <= 1)
lola: LP says that atomic proposition is always true: (p1898 <= 1)
lola: LP says that atomic proposition is always true: (p1902 <= 1)
lola: LP says that atomic proposition is always true: (p2297 <= 1)
lola: LP says that atomic proposition is always true: (p962 <= 1)
lola: LP says that atomic proposition is always true: (p995 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p2406 <= 1)
lola: LP says that atomic proposition is always true: (p2417 <= 1)
lola: LP says that atomic proposition is always true: (p2238 <= 1)
lola: LP says that atomic proposition is always true: (p2248 <= 1)
lola: LP says that atomic proposition is always true: (p2250 <= 1)
lola: A (G (((p2036 <= 0) OR (p2040 <= 0) OR (p2051 <= 0) OR (p1888 <= 0) OR (p1898 <= 0) OR (p1902 <= 0) OR ((1 <= p2297)) OR (p962 <= 0) OR (p995 <= 0) OR ((1 <= p97)) OR ((1 <= p2406) AND (1 <= p2417)) OR ((1 <= p2238) AND (1 <= p2248) AND (1 <= p2250)))))
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 (((p2036 <= 0) OR (p2040 <= 0) OR (p2051 <= 0) OR (p1888 <= 0) OR (p1898 <= 0) OR (p1902 <= 0) OR ((1 <= p2297)) OR (p962 <= 0) OR (p995 <= 0) OR ((1 <= p97)) OR ((1 <= p2406) AND (1 <= p2417)) OR ((1 <= p2238) AND (1 <= p2248) AND (1 <= p2250)))))
lola: processed formula length: 264
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 <= p2036) AND (1 <= p2040) AND (1 <= p2051) AND (1 <= p1888) AND (1 <= p1898) AND (1 <= p1902) AND ((p2297 <= 0)) AND (1 <= p962) AND (1 <= p995) AND ((p97 <= 0)) AND ((p2406 <= 0) OR (p2417 <= 0)) AND ((p2238 <= 0) OR (p2248 <= 0) OR (p2250 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 72 literals and 6 conjunctive subformulas
lola: RESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 147 markings, 146 edges
lola: memory consumption: 48644 KB
lola: time consumption: 42 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="ShieldIIPs-PT-100A"
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 ShieldIIPs-PT-100A, 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 r227-tall-162098230900164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-100A.tgz
mv ShieldIIPs-PT-100A 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 ;