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-162098231200328.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 ShieldPPPs-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-tall-162098231200328
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 120K 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.5K Mar 28 16:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 12:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 12:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 18:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 18:27 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 708K 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 ShieldPPPs-PT-040B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621170558116

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 13:09:19] [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 13:09:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 13:09:19] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2021-05-16 13:09:20] [INFO ] Transformed 2723 places.
[2021-05-16 13:09:20] [INFO ] Transformed 2523 transitions.
[2021-05-16 13:09:20] [INFO ] Found NUPN structural information;
[2021-05-16 13:09:20] [INFO ] Parsed PT model containing 2723 places and 2523 transitions in 299 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 74 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 1 resets, run finished after 147 ms. (steps per millisecond=68 ) properties seen :[1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1]
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[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]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 1, 0]
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 51 ms. (steps per millisecond=196 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 2523 rows 2723 cols
[2021-05-16 13:09:20] [INFO ] Computed 441 place invariants in 63 ms
[2021-05-16 13:09:21] [INFO ] [Real]Absence check using 441 positive place invariants in 653 ms returned sat
[2021-05-16 13:09:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 13:09:25] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 13:09:25] [INFO ] [Real]Absence check using state equation in 3867 ms returned (error "Failed to check-sat")
[2021-05-16 13:09:26] [INFO ] [Real]Absence check using 441 positive place invariants in 580 ms returned sat
[2021-05-16 13:09:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 13:09:30] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 13:09:30] [INFO ] [Real]Absence check using state equation in 4017 ms returned (error "Failed to check-sat")
[2021-05-16 13:09:31] [INFO ] [Real]Absence check using 441 positive place invariants in 577 ms returned sat
[2021-05-16 13:09:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 13:09:35] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 13:09:35] [INFO ] [Real]Absence check using state equation in 4100 ms returned (error "Failed to check-sat")
[2021-05-16 13:09:36] [INFO ] [Real]Absence check using 441 positive place invariants in 619 ms returned sat
[2021-05-16 13:09:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 13:09:40] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 13:09:40] [INFO ] [Real]Absence check using state equation in 3998 ms returned (error "Failed to check-sat")
Support contains 33 out of 2723 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2723/2723 places, 2523/2523 transitions.
Performed 278 Post agglomeration using F-continuation condition.Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 2723 transition count 2245
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 2445 transition count 2245
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 198 Pre rules applied. Total rules applied 556 place count 2445 transition count 2047
Deduced a syphon composed of 198 places in 6 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 2 with 396 rules applied. Total rules applied 952 place count 2247 transition count 2047
Symmetric choice reduction at 2 with 271 rule applications. Total rules 1223 place count 2247 transition count 2047
Deduced a syphon composed of 271 places in 16 ms
Reduce places removed 271 places and 271 transitions.
Iterating global reduction 2 with 542 rules applied. Total rules applied 1765 place count 1976 transition count 1776
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 1765 place count 1976 transition count 1664
Deduced a syphon composed of 112 places in 5 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 1989 place count 1864 transition count 1664
Performed 593 Post agglomeration using F-continuation condition.Transition count delta: 593
Deduced a syphon composed of 593 places in 1 ms
Reduce places removed 593 places and 0 transitions.
Iterating global reduction 2 with 1186 rules applied. Total rules applied 3175 place count 1271 transition count 1071
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 350 times.
Drop transitions removed 350 transitions
Iterating global reduction 2 with 350 rules applied. Total rules applied 3525 place count 1271 transition count 1071
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 3527 place count 1271 transition count 1071
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3528 place count 1270 transition count 1070
Applied a total of 3528 rules in 1106 ms. Remains 1270 /2723 variables (removed 1453) and now considering 1070/2523 (removed 1453) transitions.
Finished structural reductions, in 1 iterations. Remains : 1270/2723 places, 1070/2523 transitions.
Incomplete random walk after 1000000 steps, including 121 resets, run finished after 10992 ms. (steps per millisecond=90 ) properties seen :[1, 1, 0, 0]
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 871984 steps, including 7 resets, run timeout after 5001 ms. (steps per millisecond=174 ) properties seen :[1, 0]
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 883515 steps, including 10 resets, run timeout after 5001 ms. (steps per millisecond=176 ) properties seen :[0]
// Phase 1: matrix 1070 rows 1270 cols
[2021-05-16 13:10:02] [INFO ] Computed 441 place invariants in 93 ms
[2021-05-16 13:10:03] [INFO ] [Real]Absence check using 422 positive place invariants in 274 ms returned sat
[2021-05-16 13:10:03] [INFO ] [Real]Absence check using 422 positive and 19 generalized place invariants in 14 ms returned sat
[2021-05-16 13:10:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 13:10:06] [INFO ] [Real]Absence check using state equation in 2901 ms returned sat
[2021-05-16 13:10:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 13:10:06] [INFO ] [Nat]Absence check using 422 positive place invariants in 258 ms returned sat
[2021-05-16 13:10:06] [INFO ] [Nat]Absence check using 422 positive and 19 generalized place invariants in 13 ms returned sat
[2021-05-16 13:10:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 13:10:09] [INFO ] [Nat]Absence check using state equation in 2883 ms returned sat
[2021-05-16 13:10:10] [INFO ] Deduced a trap composed of 5 places in 339 ms
[2021-05-16 13:10:10] [INFO ] Deduced a trap composed of 6 places in 266 ms
[2021-05-16 13:10:10] [INFO ] Deduced a trap composed of 4 places in 259 ms
[2021-05-16 13:10:10] [INFO ] Deduced a trap composed of 6 places in 290 ms
[2021-05-16 13:10:11] [INFO ] Deduced a trap composed of 6 places in 256 ms
[2021-05-16 13:10:11] [INFO ] Deduced a trap composed of 4 places in 247 ms
[2021-05-16 13:10:11] [INFO ] Deduced a trap composed of 9 places in 252 ms
[2021-05-16 13:10:12] [INFO ] Deduced a trap composed of 5 places in 245 ms
[2021-05-16 13:10:12] [INFO ] Deduced a trap composed of 5 places in 241 ms
[2021-05-16 13:10:12] [INFO ] Deduced a trap composed of 5 places in 238 ms
[2021-05-16 13:10:12] [INFO ] Deduced a trap composed of 3 places in 239 ms
[2021-05-16 13:10:13] [INFO ] Deduced a trap composed of 4 places in 244 ms
[2021-05-16 13:10:13] [INFO ] Deduced a trap composed of 6 places in 240 ms
[2021-05-16 13:10:13] [INFO ] Deduced a trap composed of 4 places in 250 ms
[2021-05-16 13:10:14] [INFO ] Deduced a trap composed of 8 places in 250 ms
[2021-05-16 13:10:14] [INFO ] Deduced a trap composed of 11 places in 217 ms
[2021-05-16 13:10:14] [INFO ] Deduced a trap composed of 9 places in 214 ms
[2021-05-16 13:10:14] [INFO ] Deduced a trap composed of 7 places in 228 ms
[2021-05-16 13:10:15] [INFO ] Deduced a trap composed of 6 places in 209 ms
[2021-05-16 13:10:15] [INFO ] Deduced a trap composed of 4 places in 211 ms
[2021-05-16 13:10:15] [INFO ] Deduced a trap composed of 9 places in 206 ms
[2021-05-16 13:10:15] [INFO ] Deduced a trap composed of 6 places in 156 ms
[2021-05-16 13:10:16] [INFO ] Deduced a trap composed of 6 places in 168 ms
[2021-05-16 13:10:16] [INFO ] Deduced a trap composed of 6 places in 167 ms
[2021-05-16 13:10:16] [INFO ] Deduced a trap composed of 4 places in 174 ms
[2021-05-16 13:10:16] [INFO ] Deduced a trap composed of 6 places in 173 ms
[2021-05-16 13:10:16] [INFO ] Deduced a trap composed of 4 places in 173 ms
[2021-05-16 13:10:17] [INFO ] Deduced a trap composed of 6 places in 168 ms
[2021-05-16 13:10:17] [INFO ] Deduced a trap composed of 4 places in 171 ms
[2021-05-16 13:10:17] [INFO ] Deduced a trap composed of 6 places in 152 ms
[2021-05-16 13:10:17] [INFO ] Deduced a trap composed of 8 places in 136 ms
[2021-05-16 13:10:17] [INFO ] Deduced a trap composed of 4 places in 135 ms
[2021-05-16 13:10:18] [INFO ] Deduced a trap composed of 6 places in 133 ms
[2021-05-16 13:10:18] [INFO ] Deduced a trap composed of 9 places in 130 ms
[2021-05-16 13:10:18] [INFO ] Deduced a trap composed of 7 places in 136 ms
[2021-05-16 13:10:18] [INFO ] Deduced a trap composed of 8 places in 131 ms
[2021-05-16 13:10:18] [INFO ] Deduced a trap composed of 5 places in 131 ms
[2021-05-16 13:10:18] [INFO ] Deduced a trap composed of 6 places in 125 ms
[2021-05-16 13:10:19] [INFO ] Deduced a trap composed of 6 places in 133 ms
[2021-05-16 13:10:19] [INFO ] Deduced a trap composed of 11 places in 88 ms
[2021-05-16 13:10:19] [INFO ] Deduced a trap composed of 6 places in 81 ms
[2021-05-16 13:10:19] [INFO ] Deduced a trap composed of 19 places in 73 ms
[2021-05-16 13:10:19] [INFO ] Deduced a trap composed of 6 places in 71 ms
[2021-05-16 13:10:19] [INFO ] Deduced a trap composed of 6 places in 63 ms
[2021-05-16 13:10:19] [INFO ] Deduced a trap composed of 6 places in 64 ms
[2021-05-16 13:10:19] [INFO ] Deduced a trap composed of 6 places in 63 ms
[2021-05-16 13:10:19] [INFO ] Deduced a trap composed of 9 places in 55 ms
[2021-05-16 13:10:19] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 10315 ms
[2021-05-16 13:10:20] [INFO ] Computed and/alt/rep : 1060/3169/1060 causal constraints in 59 ms.
[2021-05-16 13:10:40] [INFO ] Added : 972 causal constraints over 195 iterations in 20550 ms.(timeout) Result :sat
[2021-05-16 13:10:40] [INFO ] Deduced a trap composed of 17 places in 72 ms
[2021-05-16 13:10:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
Attempting to minimize the solution found.
Minimization took 67 ms.
Incomplete Parikh walk after 67200 steps, including 940 resets, run finished after 658 ms. (steps per millisecond=102 ) properties seen :[0] could not realise parikh vector
Support contains 9 out of 1270 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1270/1270 places, 1070/1070 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1270 transition count 1068
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1268 transition count 1068
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 1268 transition count 1064
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 1264 transition count 1064
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 38 place count 1251 transition count 1051
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 41 place count 1251 transition count 1051
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 1250 transition count 1050
Applied a total of 42 rules in 146 ms. Remains 1250 /1270 variables (removed 20) and now considering 1050/1070 (removed 20) transitions.
Finished structural reductions, in 1 iterations. Remains : 1250/1270 places, 1050/1070 transitions.
Incomplete random walk after 1000000 steps, including 123 resets, run finished after 10773 ms. (steps per millisecond=92 ) properties seen :[0]
Interrupted Best-First random walk after 892994 steps, including 11 resets, run timeout after 5001 ms. (steps per millisecond=178 ) properties seen :[0]
Interrupted probabilistic random walk after 1967428 steps, run timeout after 30001 ms. (steps per millisecond=65 ) properties seen :[0]
Probabilistic random walk after 1967428 steps, saw 151466 distinct states, run finished after 30001 ms. (steps per millisecond=65 ) properties seen :[0]
// Phase 1: matrix 1050 rows 1250 cols
[2021-05-16 13:11:27] [INFO ] Computed 441 place invariants in 12 ms
[2021-05-16 13:11:27] [INFO ] [Real]Absence check using 420 positive place invariants in 251 ms returned sat
[2021-05-16 13:11:27] [INFO ] [Real]Absence check using 420 positive and 21 generalized place invariants in 15 ms returned sat
[2021-05-16 13:11:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 13:11:30] [INFO ] [Real]Absence check using state equation in 2753 ms returned sat
[2021-05-16 13:11:30] [INFO ] Deduced a trap composed of 6 places in 290 ms
[2021-05-16 13:11:31] [INFO ] Deduced a trap composed of 6 places in 280 ms
[2021-05-16 13:11:31] [INFO ] Deduced a trap composed of 6 places in 279 ms
[2021-05-16 13:11:31] [INFO ] Deduced a trap composed of 5 places in 292 ms
[2021-05-16 13:11:32] [INFO ] Deduced a trap composed of 5 places in 285 ms
[2021-05-16 13:11:32] [INFO ] Deduced a trap composed of 5 places in 283 ms
[2021-05-16 13:11:32] [INFO ] Deduced a trap composed of 10 places in 262 ms
[2021-05-16 13:11:33] [INFO ] Deduced a trap composed of 4 places in 257 ms
[2021-05-16 13:11:33] [INFO ] Deduced a trap composed of 14 places in 249 ms
[2021-05-16 13:11:33] [INFO ] Deduced a trap composed of 9 places in 251 ms
[2021-05-16 13:11:34] [INFO ] Deduced a trap composed of 6 places in 223 ms
[2021-05-16 13:11:34] [INFO ] Deduced a trap composed of 6 places in 325 ms
[2021-05-16 13:11:34] [INFO ] Deduced a trap composed of 6 places in 213 ms
[2021-05-16 13:11:34] [INFO ] Deduced a trap composed of 6 places in 213 ms
[2021-05-16 13:11:35] [INFO ] Deduced a trap composed of 5 places in 204 ms
[2021-05-16 13:11:35] [INFO ] Deduced a trap composed of 9 places in 200 ms
[2021-05-16 13:11:35] [INFO ] Deduced a trap composed of 5 places in 200 ms
[2021-05-16 13:11:35] [INFO ] Deduced a trap composed of 8 places in 192 ms
[2021-05-16 13:11:36] [INFO ] Deduced a trap composed of 7 places in 187 ms
[2021-05-16 13:11:36] [INFO ] Deduced a trap composed of 6 places in 194 ms
[2021-05-16 13:11:36] [INFO ] Deduced a trap composed of 14 places in 197 ms
[2021-05-16 13:11:36] [INFO ] Deduced a trap composed of 11 places in 187 ms
[2021-05-16 13:11:37] [INFO ] Deduced a trap composed of 12 places in 191 ms
[2021-05-16 13:11:37] [INFO ] Deduced a trap composed of 18 places in 182 ms
[2021-05-16 13:11:37] [INFO ] Deduced a trap composed of 6 places in 183 ms
[2021-05-16 13:11:37] [INFO ] Deduced a trap composed of 6 places in 167 ms
[2021-05-16 13:11:37] [INFO ] Deduced a trap composed of 6 places in 176 ms
[2021-05-16 13:11:38] [INFO ] Deduced a trap composed of 12 places in 146 ms
[2021-05-16 13:11:38] [INFO ] Deduced a trap composed of 16 places in 152 ms
[2021-05-16 13:11:38] [INFO ] Deduced a trap composed of 16 places in 150 ms
[2021-05-16 13:11:38] [INFO ] Deduced a trap composed of 20 places in 145 ms
[2021-05-16 13:11:38] [INFO ] Deduced a trap composed of 7 places in 131 ms
[2021-05-16 13:11:39] [INFO ] Deduced a trap composed of 9 places in 130 ms
[2021-05-16 13:11:39] [INFO ] Deduced a trap composed of 8 places in 119 ms
[2021-05-16 13:11:39] [INFO ] Deduced a trap composed of 6 places in 97 ms
[2021-05-16 13:11:39] [INFO ] Deduced a trap composed of 7 places in 105 ms
[2021-05-16 13:11:39] [INFO ] Deduced a trap composed of 9 places in 96 ms
[2021-05-16 13:11:39] [INFO ] Deduced a trap composed of 7 places in 108 ms
[2021-05-16 13:11:39] [INFO ] Deduced a trap composed of 7 places in 117 ms
[2021-05-16 13:11:39] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 9253 ms
[2021-05-16 13:11:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 13:11:40] [INFO ] [Nat]Absence check using 420 positive place invariants in 253 ms returned sat
[2021-05-16 13:11:40] [INFO ] [Nat]Absence check using 420 positive and 21 generalized place invariants in 15 ms returned sat
[2021-05-16 13:11:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 13:11:43] [INFO ] [Nat]Absence check using state equation in 2898 ms returned sat
[2021-05-16 13:11:43] [INFO ] Deduced a trap composed of 6 places in 210 ms
[2021-05-16 13:11:43] [INFO ] Deduced a trap composed of 5 places in 232 ms
[2021-05-16 13:11:44] [INFO ] Deduced a trap composed of 6 places in 214 ms
[2021-05-16 13:11:44] [INFO ] Deduced a trap composed of 6 places in 218 ms
[2021-05-16 13:11:44] [INFO ] Deduced a trap composed of 6 places in 191 ms
[2021-05-16 13:11:44] [INFO ] Deduced a trap composed of 6 places in 192 ms
[2021-05-16 13:11:45] [INFO ] Deduced a trap composed of 5 places in 198 ms
[2021-05-16 13:11:45] [INFO ] Deduced a trap composed of 6 places in 201 ms
[2021-05-16 13:11:45] [INFO ] Deduced a trap composed of 6 places in 198 ms
[2021-05-16 13:11:45] [INFO ] Deduced a trap composed of 6 places in 202 ms
[2021-05-16 13:11:45] [INFO ] Deduced a trap composed of 5 places in 184 ms
[2021-05-16 13:11:46] [INFO ] Deduced a trap composed of 3 places in 185 ms
[2021-05-16 13:11:46] [INFO ] Deduced a trap composed of 6 places in 188 ms
[2021-05-16 13:11:46] [INFO ] Deduced a trap composed of 4 places in 217 ms
[2021-05-16 13:11:46] [INFO ] Deduced a trap composed of 5 places in 183 ms
[2021-05-16 13:11:47] [INFO ] Deduced a trap composed of 6 places in 178 ms
[2021-05-16 13:11:47] [INFO ] Deduced a trap composed of 6 places in 186 ms
[2021-05-16 13:11:47] [INFO ] Deduced a trap composed of 6 places in 190 ms
[2021-05-16 13:11:47] [INFO ] Deduced a trap composed of 11 places in 184 ms
[2021-05-16 13:11:47] [INFO ] Deduced a trap composed of 6 places in 184 ms
[2021-05-16 13:11:48] [INFO ] Deduced a trap composed of 19 places in 184 ms
[2021-05-16 13:11:48] [INFO ] Deduced a trap composed of 7 places in 174 ms
[2021-05-16 13:11:48] [INFO ] Deduced a trap composed of 11 places in 182 ms
[2021-05-16 13:11:48] [INFO ] Deduced a trap composed of 6 places in 180 ms
[2021-05-16 13:11:49] [INFO ] Deduced a trap composed of 6 places in 183 ms
[2021-05-16 13:11:49] [INFO ] Deduced a trap composed of 6 places in 174 ms
[2021-05-16 13:11:49] [INFO ] Deduced a trap composed of 4 places in 149 ms
[2021-05-16 13:11:49] [INFO ] Deduced a trap composed of 6 places in 145 ms
[2021-05-16 13:11:49] [INFO ] Deduced a trap composed of 5 places in 151 ms
[2021-05-16 13:11:49] [INFO ] Deduced a trap composed of 6 places in 146 ms
[2021-05-16 13:11:50] [INFO ] Deduced a trap composed of 6 places in 153 ms
[2021-05-16 13:11:50] [INFO ] Deduced a trap composed of 6 places in 144 ms
[2021-05-16 13:11:50] [INFO ] Deduced a trap composed of 6 places in 138 ms
[2021-05-16 13:11:50] [INFO ] Deduced a trap composed of 8 places in 144 ms
[2021-05-16 13:11:50] [INFO ] Deduced a trap composed of 7 places in 130 ms
[2021-05-16 13:11:51] [INFO ] Deduced a trap composed of 10 places in 133 ms
[2021-05-16 13:11:51] [INFO ] Deduced a trap composed of 9 places in 162 ms
[2021-05-16 13:11:51] [INFO ] Deduced a trap composed of 6 places in 152 ms
[2021-05-16 13:11:51] [INFO ] Deduced a trap composed of 11 places in 162 ms
[2021-05-16 13:11:51] [INFO ] Deduced a trap composed of 6 places in 160 ms
[2021-05-16 13:11:52] [INFO ] Deduced a trap composed of 17 places in 154 ms
[2021-05-16 13:11:52] [INFO ] Deduced a trap composed of 12 places in 147 ms
[2021-05-16 13:11:52] [INFO ] Deduced a trap composed of 6 places in 146 ms
[2021-05-16 13:11:52] [INFO ] Deduced a trap composed of 4 places in 161 ms
[2021-05-16 13:11:52] [INFO ] Deduced a trap composed of 4 places in 161 ms
[2021-05-16 13:11:52] [INFO ] Deduced a trap composed of 12 places in 165 ms
[2021-05-16 13:11:53] [INFO ] Deduced a trap composed of 7 places in 233 ms
[2021-05-16 13:11:53] [INFO ] Deduced a trap composed of 4 places in 160 ms
[2021-05-16 13:11:53] [INFO ] Deduced a trap composed of 9 places in 164 ms
[2021-05-16 13:11:53] [INFO ] Deduced a trap composed of 6 places in 158 ms
[2021-05-16 13:11:54] [INFO ] Deduced a trap composed of 9 places in 166 ms
[2021-05-16 13:11:54] [INFO ] Deduced a trap composed of 11 places in 143 ms
[2021-05-16 13:11:54] [INFO ] Deduced a trap composed of 6 places in 153 ms
[2021-05-16 13:11:54] [INFO ] Deduced a trap composed of 6 places in 153 ms
[2021-05-16 13:11:54] [INFO ] Deduced a trap composed of 6 places in 154 ms
[2021-05-16 13:11:55] [INFO ] Deduced a trap composed of 8 places in 152 ms
[2021-05-16 13:11:55] [INFO ] Deduced a trap composed of 11 places in 159 ms
[2021-05-16 13:11:55] [INFO ] Deduced a trap composed of 6 places in 160 ms
[2021-05-16 13:11:55] [INFO ] Trap strengthening (SAT) tested/added 59/58 trap constraints in 12158 ms
[2021-05-16 13:11:55] [INFO ] Computed and/alt/rep : 1045/3158/1045 causal constraints in 53 ms.
[2021-05-16 13:12:16] [INFO ] Added : 975 causal constraints over 195 iterations in 21144 ms.(timeout) Result :sat
[2021-05-16 13:12:16] [INFO ] Deduced a trap composed of 17 places in 57 ms
[2021-05-16 13:12:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 439 ms
Attempting to minimize the solution found.
Minimization took 62 ms.
Incomplete Parikh walk after 76300 steps, including 719 resets, run finished after 657 ms. (steps per millisecond=116 ) properties seen :[0] could not realise parikh vector
Support contains 9 out of 1250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1250/1250 places, 1050/1050 transitions.
Applied a total of 0 rules in 33 ms. Remains 1250 /1250 variables (removed 0) and now considering 1050/1050 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1250/1250 places, 1050/1050 transitions.
Starting structural reductions, iteration 0 : 1250/1250 places, 1050/1050 transitions.
Applied a total of 0 rules in 32 ms. Remains 1250 /1250 variables (removed 0) and now considering 1050/1050 (removed 0) transitions.
// Phase 1: matrix 1050 rows 1250 cols
[2021-05-16 13:12:17] [INFO ] Computed 441 place invariants in 12 ms
[2021-05-16 13:12:21] [INFO ] Implicit Places using invariants in 3675 ms returned []
// Phase 1: matrix 1050 rows 1250 cols
[2021-05-16 13:12:21] [INFO ] Computed 441 place invariants in 13 ms
[2021-05-16 13:12:37] [INFO ] Implicit Places using invariants and state equation in 15956 ms returned []
Implicit Place search using SMT with State Equation took 19633 ms to find 0 implicit places.
[2021-05-16 13:12:37] [INFO ] Redundant transitions in 65 ms returned []
// Phase 1: matrix 1050 rows 1250 cols
[2021-05-16 13:12:37] [INFO ] Computed 441 place invariants in 12 ms
[2021-05-16 13:12:40] [INFO ] Dead Transitions using invariants and state equation in 2909 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1250/1250 places, 1050/1050 transitions.
Incomplete random walk after 100000 steps, including 14 resets, run finished after 1066 ms. (steps per millisecond=93 ) properties seen :[0]
// Phase 1: matrix 1050 rows 1250 cols
[2021-05-16 13:12:41] [INFO ] Computed 441 place invariants in 12 ms
[2021-05-16 13:12:41] [INFO ] [Real]Absence check using 420 positive place invariants in 252 ms returned sat
[2021-05-16 13:12:41] [INFO ] [Real]Absence check using 420 positive and 21 generalized place invariants in 15 ms returned sat
[2021-05-16 13:12:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 13:12:44] [INFO ] [Real]Absence check using state equation in 2744 ms returned sat
[2021-05-16 13:12:45] [INFO ] Deduced a trap composed of 6 places in 255 ms
[2021-05-16 13:12:45] [INFO ] Deduced a trap composed of 6 places in 257 ms
[2021-05-16 13:12:45] [INFO ] Deduced a trap composed of 6 places in 264 ms
[2021-05-16 13:12:45] [INFO ] Deduced a trap composed of 5 places in 263 ms
[2021-05-16 13:12:46] [INFO ] Deduced a trap composed of 5 places in 267 ms
[2021-05-16 13:12:46] [INFO ] Deduced a trap composed of 5 places in 249 ms
[2021-05-16 13:12:46] [INFO ] Deduced a trap composed of 10 places in 246 ms
[2021-05-16 13:12:47] [INFO ] Deduced a trap composed of 4 places in 230 ms
[2021-05-16 13:12:47] [INFO ] Deduced a trap composed of 14 places in 240 ms
[2021-05-16 13:12:47] [INFO ] Deduced a trap composed of 9 places in 243 ms
[2021-05-16 13:12:47] [INFO ] Deduced a trap composed of 6 places in 237 ms
[2021-05-16 13:12:48] [INFO ] Deduced a trap composed of 6 places in 230 ms
[2021-05-16 13:12:48] [INFO ] Deduced a trap composed of 6 places in 230 ms
[2021-05-16 13:12:48] [INFO ] Deduced a trap composed of 6 places in 228 ms
[2021-05-16 13:12:48] [INFO ] Deduced a trap composed of 5 places in 190 ms
[2021-05-16 13:12:49] [INFO ] Deduced a trap composed of 9 places in 190 ms
[2021-05-16 13:12:49] [INFO ] Deduced a trap composed of 5 places in 206 ms
[2021-05-16 13:12:49] [INFO ] Deduced a trap composed of 8 places in 203 ms
[2021-05-16 13:12:49] [INFO ] Deduced a trap composed of 7 places in 201 ms
[2021-05-16 13:12:50] [INFO ] Deduced a trap composed of 6 places in 201 ms
[2021-05-16 13:12:50] [INFO ] Deduced a trap composed of 14 places in 202 ms
[2021-05-16 13:12:50] [INFO ] Deduced a trap composed of 11 places in 197 ms
[2021-05-16 13:12:50] [INFO ] Deduced a trap composed of 12 places in 200 ms
[2021-05-16 13:12:51] [INFO ] Deduced a trap composed of 18 places in 193 ms
[2021-05-16 13:12:51] [INFO ] Deduced a trap composed of 6 places in 189 ms
[2021-05-16 13:12:51] [INFO ] Deduced a trap composed of 6 places in 250 ms
[2021-05-16 13:12:51] [INFO ] Deduced a trap composed of 6 places in 180 ms
[2021-05-16 13:12:52] [INFO ] Deduced a trap composed of 12 places in 156 ms
[2021-05-16 13:12:52] [INFO ] Deduced a trap composed of 16 places in 157 ms
[2021-05-16 13:12:52] [INFO ] Deduced a trap composed of 16 places in 156 ms
[2021-05-16 13:12:52] [INFO ] Deduced a trap composed of 20 places in 154 ms
[2021-05-16 13:12:52] [INFO ] Deduced a trap composed of 7 places in 151 ms
[2021-05-16 13:12:53] [INFO ] Deduced a trap composed of 9 places in 139 ms
[2021-05-16 13:12:53] [INFO ] Deduced a trap composed of 8 places in 129 ms
[2021-05-16 13:12:53] [INFO ] Deduced a trap composed of 6 places in 107 ms
[2021-05-16 13:12:53] [INFO ] Deduced a trap composed of 7 places in 106 ms
[2021-05-16 13:12:53] [INFO ] Deduced a trap composed of 9 places in 106 ms
[2021-05-16 13:12:53] [INFO ] Deduced a trap composed of 7 places in 102 ms
[2021-05-16 13:12:53] [INFO ] Deduced a trap composed of 7 places in 100 ms
[2021-05-16 13:12:53] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 9214 ms
[2021-05-16 13:12:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 13:12:54] [INFO ] [Nat]Absence check using 420 positive place invariants in 260 ms returned sat
[2021-05-16 13:12:54] [INFO ] [Nat]Absence check using 420 positive and 21 generalized place invariants in 16 ms returned sat
[2021-05-16 13:12:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 13:12:57] [INFO ] [Nat]Absence check using state equation in 2971 ms returned sat
[2021-05-16 13:12:57] [INFO ] Deduced a trap composed of 6 places in 223 ms
[2021-05-16 13:12:57] [INFO ] Deduced a trap composed of 5 places in 221 ms
[2021-05-16 13:12:58] [INFO ] Deduced a trap composed of 6 places in 222 ms
[2021-05-16 13:12:58] [INFO ] Deduced a trap composed of 6 places in 224 ms
[2021-05-16 13:12:58] [INFO ] Deduced a trap composed of 6 places in 202 ms
[2021-05-16 13:12:58] [INFO ] Deduced a trap composed of 6 places in 199 ms
[2021-05-16 13:12:59] [INFO ] Deduced a trap composed of 5 places in 204 ms
[2021-05-16 13:12:59] [INFO ] Deduced a trap composed of 6 places in 195 ms
[2021-05-16 13:12:59] [INFO ] Deduced a trap composed of 6 places in 197 ms
[2021-05-16 13:12:59] [INFO ] Deduced a trap composed of 6 places in 193 ms
[2021-05-16 13:13:00] [INFO ] Deduced a trap composed of 5 places in 192 ms
[2021-05-16 13:13:00] [INFO ] Deduced a trap composed of 3 places in 192 ms
[2021-05-16 13:13:00] [INFO ] Deduced a trap composed of 6 places in 194 ms
[2021-05-16 13:13:00] [INFO ] Deduced a trap composed of 4 places in 196 ms
[2021-05-16 13:13:01] [INFO ] Deduced a trap composed of 5 places in 190 ms
[2021-05-16 13:13:01] [INFO ] Deduced a trap composed of 6 places in 190 ms
[2021-05-16 13:13:01] [INFO ] Deduced a trap composed of 6 places in 195 ms
[2021-05-16 13:13:01] [INFO ] Deduced a trap composed of 6 places in 188 ms
[2021-05-16 13:13:01] [INFO ] Deduced a trap composed of 11 places in 179 ms
[2021-05-16 13:13:02] [INFO ] Deduced a trap composed of 6 places in 183 ms
[2021-05-16 13:13:02] [INFO ] Deduced a trap composed of 19 places in 184 ms
[2021-05-16 13:13:02] [INFO ] Deduced a trap composed of 7 places in 181 ms
[2021-05-16 13:13:02] [INFO ] Deduced a trap composed of 11 places in 177 ms
[2021-05-16 13:13:03] [INFO ] Deduced a trap composed of 6 places in 186 ms
[2021-05-16 13:13:03] [INFO ] Deduced a trap composed of 6 places in 181 ms
[2021-05-16 13:13:03] [INFO ] Deduced a trap composed of 6 places in 176 ms
[2021-05-16 13:13:03] [INFO ] Deduced a trap composed of 4 places in 153 ms
[2021-05-16 13:13:03] [INFO ] Deduced a trap composed of 6 places in 150 ms
[2021-05-16 13:13:04] [INFO ] Deduced a trap composed of 5 places in 150 ms
[2021-05-16 13:13:04] [INFO ] Deduced a trap composed of 6 places in 148 ms
[2021-05-16 13:13:04] [INFO ] Deduced a trap composed of 6 places in 146 ms
[2021-05-16 13:13:04] [INFO ] Deduced a trap composed of 6 places in 144 ms
[2021-05-16 13:13:04] [INFO ] Deduced a trap composed of 6 places in 141 ms
[2021-05-16 13:13:04] [INFO ] Deduced a trap composed of 8 places in 143 ms
[2021-05-16 13:13:05] [INFO ] Deduced a trap composed of 7 places in 135 ms
[2021-05-16 13:13:05] [INFO ] Deduced a trap composed of 10 places in 134 ms
[2021-05-16 13:13:05] [INFO ] Deduced a trap composed of 9 places in 161 ms
[2021-05-16 13:13:05] [INFO ] Deduced a trap composed of 6 places in 159 ms
[2021-05-16 13:13:05] [INFO ] Deduced a trap composed of 11 places in 160 ms
[2021-05-16 13:13:06] [INFO ] Deduced a trap composed of 6 places in 157 ms
[2021-05-16 13:13:06] [INFO ] Deduced a trap composed of 17 places in 162 ms
[2021-05-16 13:13:06] [INFO ] Deduced a trap composed of 12 places in 150 ms
[2021-05-16 13:13:06] [INFO ] Deduced a trap composed of 6 places in 150 ms
[2021-05-16 13:13:06] [INFO ] Deduced a trap composed of 4 places in 166 ms
[2021-05-16 13:13:07] [INFO ] Deduced a trap composed of 4 places in 167 ms
[2021-05-16 13:13:07] [INFO ] Deduced a trap composed of 12 places in 166 ms
[2021-05-16 13:13:07] [INFO ] Deduced a trap composed of 7 places in 166 ms
[2021-05-16 13:13:07] [INFO ] Deduced a trap composed of 4 places in 168 ms
[2021-05-16 13:13:07] [INFO ] Deduced a trap composed of 9 places in 166 ms
[2021-05-16 13:13:08] [INFO ] Deduced a trap composed of 6 places in 168 ms
[2021-05-16 13:13:08] [INFO ] Deduced a trap composed of 9 places in 170 ms
[2021-05-16 13:13:08] [INFO ] Deduced a trap composed of 11 places in 155 ms
[2021-05-16 13:13:08] [INFO ] Deduced a trap composed of 6 places in 156 ms
[2021-05-16 13:13:08] [INFO ] Deduced a trap composed of 6 places in 157 ms
[2021-05-16 13:13:09] [INFO ] Deduced a trap composed of 6 places in 154 ms
[2021-05-16 13:13:09] [INFO ] Deduced a trap composed of 8 places in 167 ms
[2021-05-16 13:13:09] [INFO ] Deduced a trap composed of 11 places in 165 ms
[2021-05-16 13:13:09] [INFO ] Deduced a trap composed of 6 places in 169 ms
[2021-05-16 13:13:09] [INFO ] Trap strengthening (SAT) tested/added 59/58 trap constraints in 12266 ms
[2021-05-16 13:13:09] [INFO ] Computed and/alt/rep : 1045/3158/1045 causal constraints in 60 ms.
[2021-05-16 13:13:14] [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: Broken pipe (=> (> t399 0) (and (or (and (> t1021 0) (< o1021 o399)) (and (> t1022 0) (< o1022 o399))) (and (> t1011 0) (< o1011 o399))))") while checking expression at index 0
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1250 transition count 1050
Applied a total of 2 rules in 57 ms. Remains 1250 /1250 variables (removed 0) and now considering 1050/1050 (removed 0) transitions.
// Phase 1: matrix 1050 rows 1250 cols
[2021-05-16 13:13:14] [INFO ] Computed 441 place invariants in 12 ms
[2021-05-16 13:13:14] [INFO ] [Real]Absence check using 420 positive place invariants in 257 ms returned sat
[2021-05-16 13:13:14] [INFO ] [Real]Absence check using 420 positive and 21 generalized place invariants in 15 ms returned sat
[2021-05-16 13:13:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 13:13:17] [INFO ] [Real]Absence check using state equation in 2836 ms returned sat
[2021-05-16 13:13:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 13:13:17] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-16 13:13:17] [INFO ] Deduced a trap composed of 4 places in 281 ms
[2021-05-16 13:13:17] [INFO ] Deduced a trap composed of 4 places in 198 ms
[2021-05-16 13:13:18] [INFO ] Deduced a trap composed of 4 places in 197 ms
[2021-05-16 13:13:18] [INFO ] Deduced a trap composed of 5 places in 193 ms
[2021-05-16 13:13:18] [INFO ] Deduced a trap composed of 8 places in 192 ms
[2021-05-16 13:13:18] [INFO ] Deduced a trap composed of 6 places in 150 ms
[2021-05-16 13:13:19] [INFO ] Deduced a trap composed of 6 places in 151 ms
[2021-05-16 13:13:19] [INFO ] Deduced a trap composed of 6 places in 153 ms
[2021-05-16 13:13:19] [INFO ] Deduced a trap composed of 6 places in 145 ms
[2021-05-16 13:13:19] [INFO ] Deduced a trap composed of 9 places in 146 ms
[2021-05-16 13:13:19] [INFO ] Deduced a trap composed of 8 places in 143 ms
[2021-05-16 13:13:19] [INFO ] Deduced a trap composed of 5 places in 141 ms
[2021-05-16 13:13:20] [INFO ] Deduced a trap composed of 5 places in 141 ms
[2021-05-16 13:13:20] [INFO ] Deduced a trap composed of 4 places in 136 ms
[2021-05-16 13:13:20] [INFO ] Deduced a trap composed of 6 places in 132 ms
[2021-05-16 13:13:20] [INFO ] Deduced a trap composed of 7 places in 127 ms
[2021-05-16 13:13:20] [INFO ] Deduced a trap composed of 9 places in 126 ms
[2021-05-16 13:13:21] [INFO ] Deduced a trap composed of 6 places in 136 ms
[2021-05-16 13:13:21] [INFO ] Deduced a trap composed of 9 places in 135 ms
[2021-05-16 13:13:21] [INFO ] Deduced a trap composed of 6 places in 134 ms
[2021-05-16 13:13:21] [INFO ] Deduced a trap composed of 6 places in 126 ms
[2021-05-16 13:13:21] [INFO ] Deduced a trap composed of 9 places in 131 ms
[2021-05-16 13:13:21] [INFO ] Deduced a trap composed of 8 places in 130 ms
[2021-05-16 13:13:22] [INFO ] Deduced a trap composed of 9 places in 131 ms
[2021-05-16 13:13:22] [INFO ] Deduced a trap composed of 19 places in 105 ms
[2021-05-16 13:13:22] [INFO ] Deduced a trap composed of 12 places in 97 ms
[2021-05-16 13:13:22] [INFO ] Deduced a trap composed of 9 places in 98 ms
[2021-05-16 13:13:22] [INFO ] Deduced a trap composed of 14 places in 98 ms
[2021-05-16 13:13:22] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2021-05-16 13:13:22] [INFO ] Deduced a trap composed of 13 places in 88 ms
[2021-05-16 13:13:23] [INFO ] Deduced a trap composed of 6 places in 89 ms
[2021-05-16 13:13:23] [INFO ] Deduced a trap composed of 6 places in 88 ms
[2021-05-16 13:13:23] [INFO ] Deduced a trap composed of 16 places in 89 ms
[2021-05-16 13:13:23] [INFO ] Deduced a trap composed of 16 places in 87 ms
[2021-05-16 13:13:23] [INFO ] Deduced a trap composed of 20 places in 83 ms
[2021-05-16 13:13:23] [INFO ] Deduced a trap composed of 14 places in 83 ms
[2021-05-16 13:13:23] [INFO ] Deduced a trap composed of 8 places in 79 ms
[2021-05-16 13:13:23] [INFO ] Deduced a trap composed of 20 places in 79 ms
[2021-05-16 13:13:24] [INFO ] Deduced a trap composed of 13 places in 74 ms
[2021-05-16 13:13:24] [INFO ] Deduced a trap composed of 19 places in 81 ms
[2021-05-16 13:13:24] [INFO ] Deduced a trap composed of 24 places in 80 ms
[2021-05-16 13:13:24] [INFO ] Deduced a trap composed of 10 places in 77 ms
[2021-05-16 13:13:24] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 7009 ms
[2021-05-16 13:13:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 13:13:24] [INFO ] [Nat]Absence check using 420 positive place invariants in 250 ms returned sat
[2021-05-16 13:13:24] [INFO ] [Nat]Absence check using 420 positive and 21 generalized place invariants in 15 ms returned sat
[2021-05-16 13:13:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 13:13:27] [INFO ] [Nat]Absence check using state equation in 2996 ms returned sat
[2021-05-16 13:13:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2021-05-16 13:13:28] [INFO ] Deduced a trap composed of 5 places in 207 ms
[2021-05-16 13:13:28] [INFO ] Deduced a trap composed of 4 places in 208 ms
[2021-05-16 13:13:28] [INFO ] Deduced a trap composed of 4 places in 208 ms
[2021-05-16 13:13:28] [INFO ] Deduced a trap composed of 5 places in 202 ms
[2021-05-16 13:13:29] [INFO ] Deduced a trap composed of 3 places in 191 ms
[2021-05-16 13:13:29] [INFO ] Deduced a trap composed of 6 places in 191 ms
[2021-05-16 13:13:29] [INFO ] Deduced a trap composed of 7 places in 165 ms
[2021-05-16 13:13:29] [INFO ] Deduced a trap composed of 6 places in 164 ms
[2021-05-16 13:13:29] [INFO ] Deduced a trap composed of 4 places in 190 ms
[2021-05-16 13:13:30] [INFO ] Deduced a trap composed of 4 places in 195 ms
[2021-05-16 13:13:30] [INFO ] Deduced a trap composed of 6 places in 160 ms
[2021-05-16 13:13:30] [INFO ] Deduced a trap composed of 4 places in 160 ms
[2021-05-16 13:13:30] [INFO ] Deduced a trap composed of 5 places in 163 ms
[2021-05-16 13:13:30] [INFO ] Deduced a trap composed of 8 places in 163 ms
[2021-05-16 13:13:31] [INFO ] Deduced a trap composed of 4 places in 183 ms
[2021-05-16 13:13:31] [INFO ] Deduced a trap composed of 6 places in 179 ms
[2021-05-16 13:13:31] [INFO ] Deduced a trap composed of 6 places in 181 ms
[2021-05-16 13:13:31] [INFO ] Deduced a trap composed of 6 places in 179 ms
[2021-05-16 13:13:32] [INFO ] Deduced a trap composed of 4 places in 169 ms
[2021-05-16 13:13:32] [INFO ] Deduced a trap composed of 6 places in 162 ms
[2021-05-16 13:13:32] [INFO ] Deduced a trap composed of 6 places in 164 ms
[2021-05-16 13:13:32] [INFO ] Deduced a trap composed of 7 places in 133 ms
[2021-05-16 13:13:32] [INFO ] Deduced a trap composed of 6 places in 153 ms
[2021-05-16 13:13:32] [INFO ] Deduced a trap composed of 4 places in 153 ms
[2021-05-16 13:13:33] [INFO ] Deduced a trap composed of 6 places in 141 ms
[2021-05-16 13:13:33] [INFO ] Deduced a trap composed of 4 places in 137 ms
[2021-05-16 13:13:33] [INFO ] Deduced a trap composed of 6 places in 134 ms
[2021-05-16 13:13:33] [INFO ] Deduced a trap composed of 5 places in 148 ms
[2021-05-16 13:13:33] [INFO ] Deduced a trap composed of 9 places in 129 ms
[2021-05-16 13:13:34] [INFO ] Deduced a trap composed of 10 places in 115 ms
[2021-05-16 13:13:34] [INFO ] Deduced a trap composed of 4 places in 135 ms
[2021-05-16 13:13:34] [INFO ] Deduced a trap composed of 6 places in 139 ms
[2021-05-16 13:13:34] [INFO ] Deduced a trap composed of 6 places in 131 ms
[2021-05-16 13:13:34] [INFO ] Deduced a trap composed of 4 places in 132 ms
[2021-05-16 13:13:34] [INFO ] Deduced a trap composed of 4 places in 127 ms
[2021-05-16 13:13:35] [INFO ] Deduced a trap composed of 6 places in 128 ms
[2021-05-16 13:13:35] [INFO ] Deduced a trap composed of 9 places in 120 ms
[2021-05-16 13:13:35] [INFO ] Deduced a trap composed of 8 places in 104 ms
[2021-05-16 13:13:35] [INFO ] Deduced a trap composed of 7 places in 104 ms
[2021-05-16 13:13:35] [INFO ] Deduced a trap composed of 6 places in 103 ms
[2021-05-16 13:13:35] [INFO ] Deduced a trap composed of 6 places in 97 ms
[2021-05-16 13:13:35] [INFO ] Deduced a trap composed of 4 places in 102 ms
[2021-05-16 13:13:36] [INFO ] Deduced a trap composed of 6 places in 97 ms
[2021-05-16 13:13:36] [INFO ] Deduced a trap composed of 6 places in 99 ms
[2021-05-16 13:13:36] [INFO ] Deduced a trap composed of 10 places in 100 ms
[2021-05-16 13:13:36] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 8525 ms
[2021-05-16 13:13:36] [INFO ] Computed and/alt/rep : 1045/3164/1045 causal constraints in 50 ms.
[2021-05-16 13:13:57] [INFO ] Added : 895 causal constraints over 179 iterations in 21157 ms.(timeout) Result :sat
[2021-05-16 13:13:57] [INFO ] Deduced a trap composed of 17 places in 28 ms
[2021-05-16 13:13:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
Attempting to minimize the solution found.
Minimization took 54 ms.
[2021-05-16 13:13:57] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2021-05-16 13:13:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 20 ms.
[2021-05-16 13:13:58] [INFO ] Flatten gal took : 158 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldPPPs-PT-040B @ 3570 seconds
vrfy: finished
info: timeLeft: 3561
rslt: Output for ReachabilityFireability @ ShieldPPPs-PT-040B

{
"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 13:13:59 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 29064,
"runtime": 9.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": 3,
"adisj": 2,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "A (G (((p710 <= 0) OR (p853 <= 0) OR (p875 <= 0) OR (p784 <= 0) OR (p306 <= 0) OR ((1 <= p595) AND (1 <= p699) AND (((1 <= p706)) OR ((1 <= p1034)))))))",
"processed_size": 158,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 4679,
"conflict_clusters": 215,
"places": 1250,
"places_significant": 809,
"singleton_clusters": 0,
"transitions": 1050
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 19,
"problems": 3
},
"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: 2300/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1250
lola: finding significant places
lola: 1250 places, 1050 transitions, 809 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: (p710 <= 1)
lola: LP says that atomic proposition is always true: (p853 <= 1)
lola: LP says that atomic proposition is always true: (p875 <= 1)
lola: LP says that atomic proposition is always true: (p784 <= 1)
lola: LP says that atomic proposition is always true: (p306 <= 1)
lola: LP says that atomic proposition is always true: (p595 <= 1)
lola: LP says that atomic proposition is always true: (p699 <= 1)
lola: LP says that atomic proposition is always true: (p706 <= 1)
lola: LP says that atomic proposition is always true: (p1034 <= 1)
lola: A (G (((p710 <= 0) OR (p853 <= 0) OR (p875 <= 0) OR (p784 <= 0) OR (p306 <= 0) OR ((1 <= p595) AND (1 <= p699) AND (((1 <= p706)) OR ((1 <= p1034)))))))
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 (((p710 <= 0) OR (p853 <= 0) OR (p875 <= 0) OR (p784 <= 0) OR (p306 <= 0) OR ((1 <= p595) AND (1 <= p699) AND (((1 <= p706)) OR ((1 <= p1034)))))))
lola: processed formula length: 158
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 <= p710) AND (1 <= p853) AND (1 <= p875) AND (1 <= p784) AND (1 <= p306) AND ((p595 <= 0) OR (p699 <= 0) OR (((p706 <= 0)) AND ((p1034 <= 0)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 19 literals and 3 conjunctive subformulas
lola: memory consumption: 29064 KB
lola: time consumption: 9 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="ShieldPPPs-PT-040B"
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 ShieldPPPs-PT-040B, 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-162098231200328"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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