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

About the Execution of 2020-gold for ASLink-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4285.155 3600000.00 564252.00 1134.90 TTTTTFTTFTFFFFTF 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.r011-tall-162038005800036.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 ASLink-PT-04b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-tall-162038005800036
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 97K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 01:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 01:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 09:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 09:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 669K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620399147129

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-07 14:52:28] [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-07 14:52:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-07 14:52:28] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2021-05-07 14:52:28] [INFO ] Transformed 2034 places.
[2021-05-07 14:52:28] [INFO ] Transformed 2567 transitions.
[2021-05-07 14:52:28] [INFO ] Found NUPN structural information;
[2021-05-07 14:52:28] [INFO ] Parsed PT model containing 2034 places and 2567 transitions in 223 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 90 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 25 resets, run finished after 92 ms. (steps per millisecond=108 ) properties seen :[0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0]
FORMULA ASLink-PT-04b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 52 ms. (steps per millisecond=192 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 50 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2567 rows 2034 cols
[2021-05-07 14:52:29] [INFO ] Computed 199 place invariants in 137 ms
[2021-05-07 14:52:30] [INFO ] [Real]Absence check using 48 positive place invariants in 110 ms returned sat
[2021-05-07 14:52:30] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 244 ms returned sat
[2021-05-07 14:52:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:52:34] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 14:52:34] [INFO ] [Real]Absence check using state equation in 4274 ms returned unknown
[2021-05-07 14:52:35] [INFO ] [Real]Absence check using 48 positive place invariants in 97 ms returned sat
[2021-05-07 14:52:35] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 238 ms returned sat
[2021-05-07 14:52:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:52:39] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 14:52:39] [INFO ] [Real]Absence check using state equation in 4348 ms returned unknown
[2021-05-07 14:52:39] [INFO ] [Real]Absence check using 48 positive place invariants in 102 ms returned sat
[2021-05-07 14:52:40] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 222 ms returned unsat
[2021-05-07 14:52:40] [INFO ] [Real]Absence check using 48 positive place invariants in 92 ms returned sat
[2021-05-07 14:52:40] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 235 ms returned sat
[2021-05-07 14:52:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:52:45] [INFO ] [Real]Absence check using state equation in 4442 ms returned (error "Failed to check-sat")
[2021-05-07 14:52:45] [INFO ] [Real]Absence check using 48 positive place invariants in 93 ms returned sat
[2021-05-07 14:52:45] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 15 ms returned unsat
[2021-05-07 14:52:45] [INFO ] [Real]Absence check using 48 positive place invariants in 104 ms returned sat
[2021-05-07 14:52:46] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 186 ms returned sat
[2021-05-07 14:52:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:52:50] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 14:52:50] [INFO ] [Real]Absence check using state equation in 4475 ms returned (error "Failed to check-sat")
[2021-05-07 14:52:50] [INFO ] [Real]Absence check using 48 positive place invariants in 95 ms returned sat
[2021-05-07 14:52:51] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 237 ms returned sat
[2021-05-07 14:52:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:52:55] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 14:52:55] [INFO ] [Real]Absence check using state equation in 4431 ms returned unknown
[2021-05-07 14:52:55] [INFO ] [Real]Absence check using 48 positive place invariants in 96 ms returned sat
[2021-05-07 14:52:56] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 194 ms returned sat
[2021-05-07 14:52:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:53:00] [INFO ] [Real]Absence check using state equation in 4479 ms returned (error "Failed to check-sat")
[2021-05-07 14:53:01] [INFO ] [Real]Absence check using 48 positive place invariants in 94 ms returned sat
[2021-05-07 14:53:01] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 188 ms returned sat
[2021-05-07 14:53:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:53:05] [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 (= s1072 (- t2356 t588))") while checking expression at index 8
[2021-05-07 14:53:06] [INFO ] [Real]Absence check using 48 positive place invariants in 123 ms returned sat
[2021-05-07 14:53:06] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 245 ms returned sat
[2021-05-07 14:53:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:53:10] [INFO ] [Real]Absence check using state equation in 4387 ms returned (error "Failed to check-sat")
[2021-05-07 14:53:10] [INFO ] [Real]Absence check using 48 positive place invariants in 97 ms returned sat
[2021-05-07 14:53:11] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 231 ms returned sat
[2021-05-07 14:53:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:53: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: Broken pipe (= s1015 (- t497 t498))") while checking expression at index 10
FORMULA ASLink-PT-04b-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-04b-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 54 out of 2034 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2034/2034 places, 2567/2567 transitions.
Performed 440 Post agglomeration using F-continuation condition.Transition count delta: 440
Iterating post reduction 0 with 440 rules applied. Total rules applied 440 place count 2034 transition count 2127
Reduce places removed 440 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 462 rules applied. Total rules applied 902 place count 1594 transition count 2105
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 908 place count 1588 transition count 2105
Performed 459 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 459 Pre rules applied. Total rules applied 908 place count 1588 transition count 1646
Deduced a syphon composed of 459 places in 4 ms
Ensure Unique test removed 41 places
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 959 rules applied. Total rules applied 1867 place count 1088 transition count 1646
Discarding 4 places :
Implicit places reduction removed 4 places
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 3 with 31 rules applied. Total rules applied 1898 place count 1084 transition count 1619
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 1925 place count 1057 transition count 1619
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 15 Pre rules applied. Total rules applied 1925 place count 1057 transition count 1604
Deduced a syphon composed of 15 places in 8 ms
Ensure Unique test removed 15 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 45 rules applied. Total rules applied 1970 place count 1027 transition count 1604
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 15 Pre rules applied. Total rules applied 1970 place count 1027 transition count 1589
Deduced a syphon composed of 15 places in 7 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 2000 place count 1012 transition count 1589
Symmetric choice reduction at 5 with 62 rule applications. Total rules 2062 place count 1012 transition count 1589
Deduced a syphon composed of 62 places in 8 ms
Reduce places removed 62 places and 62 transitions.
Iterating global reduction 5 with 124 rules applied. Total rules applied 2186 place count 950 transition count 1527
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2187 place count 950 transition count 1526
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 21 Pre rules applied. Total rules applied 2187 place count 950 transition count 1505
Deduced a syphon composed of 21 places in 9 ms
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 43 rules applied. Total rules applied 2230 place count 928 transition count 1505
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2230 place count 928 transition count 1504
Deduced a syphon composed of 1 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 2233 place count 926 transition count 1504
Symmetric choice reduction at 6 with 3 rule applications. Total rules 2236 place count 926 transition count 1504
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 18 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 2242 place count 923 transition count 1486
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 2242 place count 923 transition count 1483
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 2248 place count 920 transition count 1483
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 6 with 231 rules applied. Total rules applied 2479 place count 804 transition count 1368
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2480 place count 804 transition count 1368
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2482 place count 803 transition count 1367
Ensure Unique test removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 2483 place count 802 transition count 1367
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2484 place count 802 transition count 1367
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2486 place count 801 transition count 1366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2488 place count 801 transition count 1364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2489 place count 800 transition count 1364
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2491 place count 799 transition count 1373
Free-agglomeration rule applied 5 times.
Iterating global reduction 9 with 5 rules applied. Total rules applied 2496 place count 799 transition count 1368
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 2501 place count 794 transition count 1368
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 2504 place count 794 transition count 1365
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 2507 place count 791 transition count 1365
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2508 place count 790 transition count 1364
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 11 with 9 rules applied. Total rules applied 2517 place count 784 transition count 1361
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 2520 place count 781 transition count 1361
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 9 Pre rules applied. Total rules applied 2520 place count 781 transition count 1352
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 13 with 18 rules applied. Total rules applied 2538 place count 772 transition count 1352
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 13 with 3 rules applied. Total rules applied 2541 place count 769 transition count 1352
Symmetric choice reduction at 14 with 1 rule applications. Total rules 2542 place count 769 transition count 1352
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2544 place count 768 transition count 1351
Symmetric choice reduction at 14 with 1 rule applications. Total rules 2545 place count 768 transition count 1351
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2547 place count 767 transition count 1350
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 14 with 10 rules applied. Total rules applied 2557 place count 762 transition count 1345
Symmetric choice reduction at 14 with 2 rule applications. Total rules 2559 place count 762 transition count 1345
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 2563 place count 760 transition count 1343
Free-agglomeration rule applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2565 place count 760 transition count 1341
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 2567 place count 758 transition count 1341
Applied a total of 2567 rules in 998 ms. Remains 758 /2034 variables (removed 1276) and now considering 1341/2567 (removed 1226) transitions.
Finished structural reductions, in 1 iterations. Remains : 758/2034 places, 1341/2567 transitions.
Incomplete random walk after 1000000 steps, including 8901 resets, run finished after 3918 ms. (steps per millisecond=255 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2385 resets, run finished after 1753 ms. (steps per millisecond=570 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2371 resets, run finished after 1909 ms. (steps per millisecond=523 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2373 resets, run finished after 1820 ms. (steps per millisecond=549 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2360 resets, run finished after 1644 ms. (steps per millisecond=608 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2327 resets, run finished after 1684 ms. (steps per millisecond=593 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2384 resets, run finished after 1630 ms. (steps per millisecond=613 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2387 resets, run finished after 1647 ms. (steps per millisecond=607 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2376 resets, run finished after 1897 ms. (steps per millisecond=527 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2374 resets, run finished after 1861 ms. (steps per millisecond=537 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 3920791 steps, run timeout after 30001 ms. (steps per millisecond=130 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 3920791 steps, saw 808217 distinct states, run finished after 30001 ms. (steps per millisecond=130 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1341 rows 758 cols
[2021-05-07 14:54:06] [INFO ] Computed 126 place invariants in 72 ms
[2021-05-07 14:54:06] [INFO ] [Real]Absence check using 33 positive place invariants in 72 ms returned sat
[2021-05-07 14:54:06] [INFO ] [Real]Absence check using 33 positive and 93 generalized place invariants in 135 ms returned sat
[2021-05-07 14:54:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:54:08] [INFO ] [Real]Absence check using state equation in 1949 ms returned sat
[2021-05-07 14:54:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:54:08] [INFO ] [Nat]Absence check using 33 positive place invariants in 38 ms returned sat
[2021-05-07 14:54:08] [INFO ] [Nat]Absence check using 33 positive and 93 generalized place invariants in 57 ms returned sat
[2021-05-07 14:54:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:54:10] [INFO ] [Nat]Absence check using state equation in 1530 ms returned unsat
[2021-05-07 14:54:10] [INFO ] [Real]Absence check using 33 positive place invariants in 34 ms returned sat
[2021-05-07 14:54:10] [INFO ] [Real]Absence check using 33 positive and 93 generalized place invariants in 57 ms returned sat
[2021-05-07 14:54:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:54:12] [INFO ] [Real]Absence check using state equation in 2236 ms returned sat
[2021-05-07 14:54:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:54:13] [INFO ] [Nat]Absence check using 33 positive place invariants in 35 ms returned sat
[2021-05-07 14:54:13] [INFO ] [Nat]Absence check using 33 positive and 93 generalized place invariants in 56 ms returned sat
[2021-05-07 14:54:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:54:14] [INFO ] [Nat]Absence check using state equation in 1578 ms returned unsat
[2021-05-07 14:54:14] [INFO ] [Real]Absence check using 33 positive place invariants in 41 ms returned sat
[2021-05-07 14:54:14] [INFO ] [Real]Absence check using 33 positive and 93 generalized place invariants in 59 ms returned sat
[2021-05-07 14:54:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:54:16] [INFO ] [Real]Absence check using state equation in 2023 ms returned sat
[2021-05-07 14:54:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:54:17] [INFO ] [Nat]Absence check using 33 positive place invariants in 33 ms returned sat
[2021-05-07 14:54:17] [INFO ] [Nat]Absence check using 33 positive and 93 generalized place invariants in 60 ms returned sat
[2021-05-07 14:54:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:54:23] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 14:54:26] [INFO ] [Nat]Absence check using state equation in 9490 ms returned unknown
[2021-05-07 14:54:26] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2021-05-07 14:54:26] [INFO ] [Real]Absence check using 33 positive and 93 generalized place invariants in 52 ms returned sat
[2021-05-07 14:54:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:54:28] [INFO ] [Real]Absence check using state equation in 1802 ms returned sat
[2021-05-07 14:54:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:54:28] [INFO ] [Nat]Absence check using 33 positive place invariants in 33 ms returned sat
[2021-05-07 14:54:28] [INFO ] [Nat]Absence check using 33 positive and 93 generalized place invariants in 56 ms returned sat
[2021-05-07 14:54:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:54:30] [INFO ] [Nat]Absence check using state equation in 1867 ms returned sat
[2021-05-07 14:54:31] [INFO ] Deduced a trap composed of 25 places in 441 ms
[2021-05-07 14:54:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 555 ms
[2021-05-07 14:54:31] [INFO ] Computed and/alt/rep : 1325/14705/1325 causal constraints in 95 ms.
[2021-05-07 14:54:53] [INFO ] Added : 535 causal constraints over 107 iterations in 21672 ms.(timeout) Result :sat
[2021-05-07 14:54:53] [INFO ] Deduced a trap composed of 25 places in 252 ms
[2021-05-07 14:54:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 460 ms
Attempting to minimize the solution found.
Minimization took 153 ms.
[2021-05-07 14:54:53] [INFO ] [Real]Absence check using 33 positive place invariants in 65 ms returned sat
[2021-05-07 14:54:54] [INFO ] [Real]Absence check using 33 positive and 93 generalized place invariants in 102 ms returned sat
[2021-05-07 14:54:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:54:56] [INFO ] [Real]Absence check using state equation in 2026 ms returned sat
[2021-05-07 14:54:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:54:56] [INFO ] [Nat]Absence check using 33 positive place invariants in 32 ms returned sat
[2021-05-07 14:54:56] [INFO ] [Nat]Absence check using 33 positive and 93 generalized place invariants in 56 ms returned sat
[2021-05-07 14:54:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:54:58] [INFO ] [Nat]Absence check using state equation in 2231 ms returned sat
[2021-05-07 14:54:58] [INFO ] Computed and/alt/rep : 1325/14705/1325 causal constraints in 102 ms.
[2021-05-07 14:55:18] [INFO ] Added : 455 causal constraints over 91 iterations in 20284 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 148 ms.
[2021-05-07 14:55:19] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2021-05-07 14:55:19] [INFO ] [Real]Absence check using 33 positive and 93 generalized place invariants in 51 ms returned sat
[2021-05-07 14:55:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:55:21] [INFO ] [Real]Absence check using state equation in 1921 ms returned sat
[2021-05-07 14:55:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:55:21] [INFO ] [Nat]Absence check using 33 positive place invariants in 55 ms returned sat
[2021-05-07 14:55:21] [INFO ] [Nat]Absence check using 33 positive and 93 generalized place invariants in 74 ms returned sat
[2021-05-07 14:55:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:55:23] [INFO ] [Nat]Absence check using state equation in 1774 ms returned unsat
[2021-05-07 14:55:23] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2021-05-07 14:55:23] [INFO ] [Real]Absence check using 33 positive and 93 generalized place invariants in 51 ms returned sat
[2021-05-07 14:55:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:55:25] [INFO ] [Real]Absence check using state equation in 1781 ms returned sat
[2021-05-07 14:55:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:55:25] [INFO ] [Nat]Absence check using 33 positive place invariants in 33 ms returned sat
[2021-05-07 14:55:25] [INFO ] [Nat]Absence check using 33 positive and 93 generalized place invariants in 50 ms returned sat
[2021-05-07 14:55:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:55:26] [INFO ] [Nat]Absence check using state equation in 940 ms returned unsat
[2021-05-07 14:55:26] [INFO ] [Real]Absence check using 33 positive place invariants in 35 ms returned sat
[2021-05-07 14:55:26] [INFO ] [Real]Absence check using 33 positive and 93 generalized place invariants in 59 ms returned sat
[2021-05-07 14:55:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:55:28] [INFO ] [Real]Absence check using state equation in 2007 ms returned sat
[2021-05-07 14:55:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:55:28] [INFO ] [Nat]Absence check using 33 positive place invariants in 35 ms returned sat
[2021-05-07 14:55:28] [INFO ] [Nat]Absence check using 33 positive and 93 generalized place invariants in 61 ms returned sat
[2021-05-07 14:55:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:55:30] [INFO ] [Nat]Absence check using state equation in 2020 ms returned sat
[2021-05-07 14:55:31] [INFO ] Deduced a trap composed of 39 places in 269 ms
[2021-05-07 14:55:31] [INFO ] Deduced a trap composed of 25 places in 110 ms
[2021-05-07 14:55:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 453 ms
[2021-05-07 14:55:31] [INFO ] [Real]Absence check using 33 positive place invariants in 35 ms returned sat
[2021-05-07 14:55:31] [INFO ] [Real]Absence check using 33 positive and 93 generalized place invariants in 56 ms returned sat
[2021-05-07 14:55:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:55:33] [INFO ] [Real]Absence check using state equation in 1855 ms returned sat
[2021-05-07 14:55:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:55:33] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2021-05-07 14:55:33] [INFO ] [Nat]Absence check using 33 positive and 93 generalized place invariants in 55 ms returned sat
[2021-05-07 14:55:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:55:33] [INFO ] [Nat]Absence check using state equation in 303 ms returned unsat
FORMULA ASLink-PT-04b-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-04b-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-04b-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-04b-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-04b-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-04b-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 513000 steps, including 1000 resets, run finished after 1918 ms. (steps per millisecond=267 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 563900 steps, including 1000 resets, run finished after 1977 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 15 out of 758 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 758/758 places, 1341/1341 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 758 transition count 1337
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 754 transition count 1337
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 8 place count 754 transition count 1315
Deduced a syphon composed of 22 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 55 place count 729 transition count 1315
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 728 transition count 1314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 727 transition count 1314
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 58 place count 727 transition count 1311
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 64 place count 724 transition count 1311
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 65 place count 723 transition count 1311
Symmetric choice reduction at 5 with 2 rule applications. Total rules 67 place count 723 transition count 1311
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 15 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 71 place count 721 transition count 1296
Symmetric choice reduction at 5 with 1 rule applications. Total rules 72 place count 721 transition count 1296
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 74 place count 720 transition count 1288
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 84 place count 715 transition count 1283
Symmetric choice reduction at 5 with 1 rule applications. Total rules 85 place count 715 transition count 1283
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 87 place count 714 transition count 1282
Symmetric choice reduction at 5 with 1 rule applications. Total rules 88 place count 714 transition count 1282
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 90 place count 713 transition count 1281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 91 place count 713 transition count 1280
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 93 place count 712 transition count 1279
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 95 place count 712 transition count 1277
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 97 place count 710 transition count 1277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 98 place count 710 transition count 1340
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 99 place count 709 transition count 1340
Applied a total of 99 rules in 150 ms. Remains 709 /758 variables (removed 49) and now considering 1340/1341 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 709/758 places, 1340/1341 transitions.
Incomplete random walk after 1000000 steps, including 12553 resets, run finished after 3809 ms. (steps per millisecond=262 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2893 resets, run finished after 1590 ms. (steps per millisecond=628 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2862 resets, run finished after 1409 ms. (steps per millisecond=709 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2847 resets, run finished after 1482 ms. (steps per millisecond=674 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 5191709 steps, run timeout after 30001 ms. (steps per millisecond=173 ) properties seen :[0, 0, 0]
Probabilistic random walk after 5191709 steps, saw 1059867 distinct states, run finished after 30001 ms. (steps per millisecond=173 ) properties seen :[0, 0, 0]
// Phase 1: matrix 1340 rows 709 cols
[2021-05-07 14:56:16] [INFO ] Computed 121 place invariants in 17 ms
[2021-05-07 14:56:16] [INFO ] [Real]Absence check using 31 positive place invariants in 30 ms returned sat
[2021-05-07 14:56:16] [INFO ] [Real]Absence check using 31 positive and 90 generalized place invariants in 55 ms returned sat
[2021-05-07 14:56:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:56:18] [INFO ] [Real]Absence check using state equation in 1825 ms returned sat
[2021-05-07 14:56:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:56:18] [INFO ] [Nat]Absence check using 31 positive place invariants in 37 ms returned sat
[2021-05-07 14:56:18] [INFO ] [Nat]Absence check using 31 positive and 90 generalized place invariants in 55 ms returned sat
[2021-05-07 14:56:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:56:24] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 14:56:27] [INFO ] [Nat]Absence check using state equation in 9442 ms returned unknown
[2021-05-07 14:56:28] [INFO ] [Real]Absence check using 31 positive place invariants in 31 ms returned sat
[2021-05-07 14:56:28] [INFO ] [Real]Absence check using 31 positive and 90 generalized place invariants in 57 ms returned sat
[2021-05-07 14:56:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:56:29] [INFO ] [Real]Absence check using state equation in 1633 ms returned sat
[2021-05-07 14:56:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:56:29] [INFO ] [Nat]Absence check using 31 positive place invariants in 29 ms returned sat
[2021-05-07 14:56:30] [INFO ] [Nat]Absence check using 31 positive and 90 generalized place invariants in 47 ms returned sat
[2021-05-07 14:56:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:56:31] [INFO ] [Nat]Absence check using state equation in 1767 ms returned sat
[2021-05-07 14:56:31] [INFO ] Computed and/alt/rep : 1314/15500/1314 causal constraints in 92 ms.
[2021-05-07 14:56:56] [INFO ] Added : 470 causal constraints over 94 iterations in 24750 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 125 ms.
[2021-05-07 14:56:56] [INFO ] [Real]Absence check using 31 positive place invariants in 36 ms returned sat
[2021-05-07 14:56:57] [INFO ] [Real]Absence check using 31 positive and 90 generalized place invariants in 54 ms returned sat
[2021-05-07 14:56:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:56:58] [INFO ] [Real]Absence check using state equation in 1746 ms returned sat
[2021-05-07 14:56:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:56:58] [INFO ] [Nat]Absence check using 31 positive place invariants in 29 ms returned sat
[2021-05-07 14:56:58] [INFO ] [Nat]Absence check using 31 positive and 90 generalized place invariants in 55 ms returned sat
[2021-05-07 14:56:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:57:00] [INFO ] [Nat]Absence check using state equation in 1712 ms returned sat
[2021-05-07 14:57:00] [INFO ] Computed and/alt/rep : 1314/15500/1314 causal constraints in 69 ms.
[2021-05-07 14:57:20] [INFO ] Added : 585 causal constraints over 117 iterations in 20204 ms.(timeout) Result :sat
[2021-05-07 14:57:21] [INFO ] Deduced a trap composed of 22 places in 343 ms
[2021-05-07 14:57:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 546 ms
Attempting to minimize the solution found.
Minimization took 108 ms.
Incomplete Parikh walk after 1122200 steps, including 18111 resets, run finished after 4737 ms. (steps per millisecond=236 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 892900 steps, including 14606 resets, run finished after 3715 ms. (steps per millisecond=240 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 15 out of 709 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 709/709 places, 1340/1340 transitions.
Applied a total of 0 rules in 18 ms. Remains 709 /709 variables (removed 0) and now considering 1340/1340 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 709/709 places, 1340/1340 transitions.
Starting structural reductions, iteration 0 : 709/709 places, 1340/1340 transitions.
Applied a total of 0 rules in 17 ms. Remains 709 /709 variables (removed 0) and now considering 1340/1340 (removed 0) transitions.
// Phase 1: matrix 1340 rows 709 cols
[2021-05-07 14:57:30] [INFO ] Computed 121 place invariants in 17 ms
[2021-05-07 14:57:31] [INFO ] Implicit Places using invariants in 1843 ms returned [1, 18, 19, 31, 49, 67, 136, 140, 150, 151, 153, 170, 188, 211, 266, 268, 279, 282, 283, 285, 303, 321, 390, 394, 395, 406, 407, 409, 427, 446, 519, 523, 524, 527, 538, 539, 540, 574, 576, 580, 598, 599, 600, 601, 613, 619, 625, 631, 637, 643, 649, 655, 661, 667, 673]
Discarding 55 places :
Implicit Place search using SMT only with invariants took 1853 ms to find 55 implicit places.
[2021-05-07 14:57:32] [INFO ] Redundant transitions in 139 ms returned []
// Phase 1: matrix 1340 rows 654 cols
[2021-05-07 14:57:32] [INFO ] Computed 66 place invariants in 19 ms
[2021-05-07 14:57:34] [INFO ] Dead Transitions using invariants and state equation in 2602 ms returned []
Starting structural reductions, iteration 1 : 654/709 places, 1340/1340 transitions.
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 654 transition count 1249
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 94 rules applied. Total rules applied 185 place count 563 transition count 1246
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 185 place count 563 transition count 1222
Deduced a syphon composed of 24 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 49 rules applied. Total rules applied 234 place count 538 transition count 1222
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 235 place count 537 transition count 1222
Symmetric choice reduction at 3 with 13 rule applications. Total rules 248 place count 537 transition count 1222
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 45 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 274 place count 524 transition count 1177
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 274 place count 524 transition count 1176
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 276 place count 523 transition count 1176
Symmetric choice reduction at 3 with 3 rule applications. Total rules 279 place count 523 transition count 1176
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 285 place count 520 transition count 1173
Symmetric choice reduction at 3 with 3 rule applications. Total rules 288 place count 520 transition count 1173
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 6 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 294 place count 517 transition count 1167
Symmetric choice reduction at 3 with 1 rule applications. Total rules 295 place count 517 transition count 1167
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 297 place count 516 transition count 1166
Symmetric choice reduction at 3 with 1 rule applications. Total rules 298 place count 516 transition count 1166
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 300 place count 515 transition count 1164
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 374 place count 478 transition count 1127
Symmetric choice reduction at 3 with 3 rule applications. Total rules 377 place count 478 transition count 1127
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 383 place count 475 transition count 1124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 386 place count 475 transition count 1121
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 396 place count 470 transition count 1131
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 397 place count 470 transition count 1130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 398 place count 469 transition count 1130
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 409 place count 469 transition count 1119
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 425 place count 453 transition count 1119
Symmetric choice reduction at 6 with 3 rule applications. Total rules 428 place count 453 transition count 1119
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 434 place count 450 transition count 1116
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 449 place count 450 transition count 1101
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 458 place count 450 transition count 1101
Applied a total of 458 rules in 123 ms. Remains 450 /654 variables (removed 204) and now considering 1101/1340 (removed 239) transitions.
[2021-05-07 14:57:34] [INFO ] Flow matrix only has 1097 transitions (discarded 4 similar events)
// Phase 1: matrix 1097 rows 450 cols
[2021-05-07 14:57:34] [INFO ] Computed 59 place invariants in 11 ms
[2021-05-07 14:57:35] [INFO ] Implicit Places using invariants in 740 ms returned [73, 90, 96, 99, 101, 177, 183, 186, 188, 194, 195, 250, 267, 273, 276, 278, 283, 284, 339, 359, 365, 370]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 742 ms to find 22 implicit places.
Starting structural reductions, iteration 2 : 428/709 places, 1101/1340 transitions.
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 428 transition count 1101
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 33 place count 417 transition count 1090
Symmetric choice reduction at 0 with 4 rule applications. Total rules 37 place count 417 transition count 1090
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 45 place count 413 transition count 1086
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 59 place count 406 transition count 1079
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 71 place count 406 transition count 1067
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 83 place count 394 transition count 1067
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 86 place count 394 transition count 1064
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 89 place count 391 transition count 1064
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 391 transition count 1064
Applied a total of 92 rules in 162 ms. Remains 391 /428 variables (removed 37) and now considering 1064/1101 (removed 37) transitions.
[2021-05-07 14:57:35] [INFO ] Flow matrix only has 1060 transitions (discarded 4 similar events)
// Phase 1: matrix 1060 rows 391 cols
[2021-05-07 14:57:35] [INFO ] Computed 37 place invariants in 16 ms
[2021-05-07 14:57:36] [INFO ] Implicit Places using invariants in 630 ms returned []
[2021-05-07 14:57:36] [INFO ] Flow matrix only has 1060 transitions (discarded 4 similar events)
// Phase 1: matrix 1060 rows 391 cols
[2021-05-07 14:57:36] [INFO ] Computed 37 place invariants in 13 ms
[2021-05-07 14:57:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-07 14:57:39] [INFO ] Implicit Places using invariants and state equation in 3442 ms returned []
Implicit Place search using SMT with State Equation took 4074 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 391/709 places, 1064/1340 transitions.
Incomplete random walk after 1000000 steps, including 18175 resets, run finished after 3063 ms. (steps per millisecond=326 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 4977 resets, run finished after 1348 ms. (steps per millisecond=741 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4935 resets, run finished after 1182 ms. (steps per millisecond=846 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4908 resets, run finished after 1214 ms. (steps per millisecond=823 ) properties seen :[0, 0, 1]
FORMULA ASLink-PT-04b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2021-05-07 14:57:46] [INFO ] Flow matrix only has 1060 transitions (discarded 4 similar events)
// Phase 1: matrix 1060 rows 391 cols
[2021-05-07 14:57:46] [INFO ] Computed 37 place invariants in 14 ms
[2021-05-07 14:57:46] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2021-05-07 14:57:46] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 14 ms returned sat
[2021-05-07 14:57:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:57:47] [INFO ] [Real]Absence check using state equation in 732 ms returned sat
[2021-05-07 14:57:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:57:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2021-05-07 14:57:47] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 15 ms returned sat
[2021-05-07 14:57:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:57:48] [INFO ] [Nat]Absence check using state equation in 625 ms returned unsat
[2021-05-07 14:57:48] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2021-05-07 14:57:48] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 11 ms returned sat
[2021-05-07 14:57:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:57:48] [INFO ] [Real]Absence check using state equation in 662 ms returned sat
[2021-05-07 14:57:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:57:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2021-05-07 14:57:49] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 11 ms returned sat
[2021-05-07 14:57:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:57:49] [INFO ] [Nat]Absence check using state equation in 664 ms returned sat
[2021-05-07 14:57:49] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-07 14:57:49] [INFO ] [Nat]Added 3 Read/Feed constraints in 38 ms returned sat
[2021-05-07 14:57:49] [INFO ] Computed and/alt/rep : 1039/15470/1035 causal constraints in 66 ms.
[2021-05-07 14:58:10] [INFO ] Added : 550 causal constraints over 110 iterations in 20545 ms.(timeout) Result :sat
[2021-05-07 14:58:10] [INFO ] Deduced a trap composed of 29 places in 140 ms
[2021-05-07 14:58:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 610 ms
Attempting to minimize the solution found.
Minimization took 154 ms.
FORMULA ASLink-PT-04b-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 242600 steps, including 1000 resets, run finished after 648 ms. (steps per millisecond=374 ) properties seen :[0] could not realise parikh vector
Support contains 2 out of 391 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 391/391 places, 1064/1064 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 391 transition count 1062
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 389 transition count 1062
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 4 place count 389 transition count 1052
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 24 place count 379 transition count 1052
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 379 transition count 1052
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 9 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 place count 377 transition count 1043
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 377 transition count 1043
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 9 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 375 transition count 1034
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 375 transition count 1034
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 374 transition count 1026
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 374 transition count 1026
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 373 transition count 1018
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 373 transition count 1018
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 372 transition count 1010
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 372 transition count 1010
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 371 transition count 1002
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 371 transition count 1002
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 370 transition count 994
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 370 transition count 994
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 369 transition count 986
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 369 transition count 986
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 368 transition count 978
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 368 transition count 978
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 367 transition count 970
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 367 transition count 970
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 366 transition count 962
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 366 transition count 962
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 365 transition count 954
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 365 transition count 954
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 364 transition count 946
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 364 transition count 946
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 363 transition count 938
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 363 transition count 938
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 362 transition count 930
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 362 transition count 928
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 360 transition count 928
Applied a total of 79 rules in 139 ms. Remains 360 /391 variables (removed 31) and now considering 928/1064 (removed 136) transitions.
Finished structural reductions, in 1 iterations. Remains : 360/391 places, 928/1064 transitions.
Incomplete random walk after 1000000 steps, including 19398 resets, run finished after 2721 ms. (steps per millisecond=367 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 5350 resets, run finished after 1013 ms. (steps per millisecond=987 ) properties seen :[0]
Interrupted probabilistic random walk after 5838414 steps, run timeout after 30001 ms. (steps per millisecond=194 ) properties seen :[0]
Probabilistic random walk after 5838414 steps, saw 1789746 distinct states, run finished after 30001 ms. (steps per millisecond=194 ) properties seen :[0]
[2021-05-07 14:58:45] [INFO ] Flow matrix only has 924 transitions (discarded 4 similar events)
// Phase 1: matrix 924 rows 360 cols
[2021-05-07 14:58:45] [INFO ] Computed 37 place invariants in 11 ms
[2021-05-07 14:58:45] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2021-05-07 14:58:45] [INFO ] [Real]Absence check using 10 positive and 27 generalized place invariants in 10 ms returned sat
[2021-05-07 14:58:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:58:46] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2021-05-07 14:58:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:58:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2021-05-07 14:58:46] [INFO ] [Nat]Absence check using 10 positive and 27 generalized place invariants in 10 ms returned sat
[2021-05-07 14:58:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:58:47] [INFO ] [Nat]Absence check using state equation in 643 ms returned sat
[2021-05-07 14:58:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-07 14:58:47] [INFO ] [Nat]Added 3 Read/Feed constraints in 31 ms returned sat
[2021-05-07 14:58:47] [INFO ] Computed and/alt/rep : 903/12304/899 causal constraints in 57 ms.
[2021-05-07 14:59:09] [INFO ] Added : 575 causal constraints over 115 iterations in 22436 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 144 ms.
Incomplete Parikh walk after 252200 steps, including 1000 resets, run finished after 688 ms. (steps per millisecond=366 ) properties seen :[0] could not realise parikh vector
Support contains 2 out of 360 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 360/360 places, 928/928 transitions.
Applied a total of 0 rules in 23 ms. Remains 360 /360 variables (removed 0) and now considering 928/928 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 360/360 places, 928/928 transitions.
Starting structural reductions, iteration 0 : 360/360 places, 928/928 transitions.
Applied a total of 0 rules in 11 ms. Remains 360 /360 variables (removed 0) and now considering 928/928 (removed 0) transitions.
[2021-05-07 14:59:10] [INFO ] Flow matrix only has 924 transitions (discarded 4 similar events)
// Phase 1: matrix 924 rows 360 cols
[2021-05-07 14:59:10] [INFO ] Computed 37 place invariants in 7 ms
[2021-05-07 14:59:11] [INFO ] Implicit Places using invariants in 612 ms returned [88, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 614 ms to find 2 implicit places.
[2021-05-07 14:59:11] [INFO ] Redundant transitions in 25 ms returned []
[2021-05-07 14:59:11] [INFO ] Flow matrix only has 924 transitions (discarded 4 similar events)
// Phase 1: matrix 924 rows 358 cols
[2021-05-07 14:59:11] [INFO ] Computed 35 place invariants in 8 ms
[2021-05-07 14:59:12] [INFO ] Dead Transitions using invariants and state equation in 1126 ms returned []
Starting structural reductions, iteration 1 : 358/360 places, 928/928 transitions.
Applied a total of 0 rules in 9 ms. Remains 358 /358 variables (removed 0) and now considering 928/928 (removed 0) transitions.
[2021-05-07 14:59:12] [INFO ] Redundant transitions in 8 ms returned []
[2021-05-07 14:59:12] [INFO ] Flow matrix only has 924 transitions (discarded 4 similar events)
// Phase 1: matrix 924 rows 358 cols
[2021-05-07 14:59:12] [INFO ] Computed 35 place invariants in 7 ms
[2021-05-07 14:59:13] [INFO ] Dead Transitions using invariants and state equation in 1109 ms returned []
Finished structural reductions, in 2 iterations. Remains : 358/360 places, 928/928 transitions.
Incomplete random walk after 1000000 steps, including 19411 resets, run finished after 2741 ms. (steps per millisecond=364 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 5353 resets, run finished after 1038 ms. (steps per millisecond=963 ) properties seen :[0]
Interrupted probabilistic random walk after 5677968 steps, run timeout after 30001 ms. (steps per millisecond=189 ) properties seen :[0]
Probabilistic random walk after 5677968 steps, saw 1761064 distinct states, run finished after 30001 ms. (steps per millisecond=189 ) properties seen :[0]
[2021-05-07 14:59:47] [INFO ] Flow matrix only has 924 transitions (discarded 4 similar events)
// Phase 1: matrix 924 rows 358 cols
[2021-05-07 14:59:47] [INFO ] Computed 35 place invariants in 7 ms
[2021-05-07 14:59:47] [INFO ] [Real]Absence check using 12 positive place invariants in 13 ms returned sat
[2021-05-07 14:59:47] [INFO ] [Real]Absence check using 12 positive and 23 generalized place invariants in 8 ms returned sat
[2021-05-07 14:59:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:59:47] [INFO ] [Real]Absence check using state equation in 594 ms returned sat
[2021-05-07 14:59:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:59:47] [INFO ] [Nat]Absence check using 12 positive place invariants in 16 ms returned sat
[2021-05-07 14:59:47] [INFO ] [Nat]Absence check using 12 positive and 23 generalized place invariants in 9 ms returned sat
[2021-05-07 14:59:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:59:48] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2021-05-07 14:59:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-07 14:59:48] [INFO ] [Nat]Added 3 Read/Feed constraints in 28 ms returned sat
[2021-05-07 14:59:48] [INFO ] Computed and/alt/rep : 903/12204/899 causal constraints in 51 ms.
[2021-05-07 15:00:08] [INFO ] Added : 565 causal constraints over 113 iterations in 20174 ms.(timeout) Result :sat
[2021-05-07 15:00:08] [INFO ] Deduced a trap composed of 24 places in 176 ms
[2021-05-07 15:00:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 362 ms
Attempting to minimize the solution found.
Minimization took 127 ms.
Incomplete Parikh walk after 478200 steps, including 1000 resets, run finished after 1294 ms. (steps per millisecond=369 ) properties seen :[0] could not realise parikh vector
Support contains 2 out of 358 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 358/358 places, 928/928 transitions.
Applied a total of 0 rules in 12 ms. Remains 358 /358 variables (removed 0) and now considering 928/928 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 358/358 places, 928/928 transitions.
Starting structural reductions, iteration 0 : 358/358 places, 928/928 transitions.
Applied a total of 0 rules in 13 ms. Remains 358 /358 variables (removed 0) and now considering 928/928 (removed 0) transitions.
[2021-05-07 15:00:10] [INFO ] Flow matrix only has 924 transitions (discarded 4 similar events)
// Phase 1: matrix 924 rows 358 cols
[2021-05-07 15:00:10] [INFO ] Computed 35 place invariants in 10 ms
[2021-05-07 15:00:11] [INFO ] Implicit Places using invariants in 552 ms returned []
[2021-05-07 15:00:11] [INFO ] Flow matrix only has 924 transitions (discarded 4 similar events)
// Phase 1: matrix 924 rows 358 cols
[2021-05-07 15:00:11] [INFO ] Computed 35 place invariants in 7 ms
[2021-05-07 15:00:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-07 15:00:14] [INFO ] Implicit Places using invariants and state equation in 2919 ms returned []
Implicit Place search using SMT with State Equation took 3473 ms to find 0 implicit places.
[2021-05-07 15:00:14] [INFO ] Redundant transitions in 8 ms returned []
[2021-05-07 15:00:14] [INFO ] Flow matrix only has 924 transitions (discarded 4 similar events)
// Phase 1: matrix 924 rows 358 cols
[2021-05-07 15:00:14] [INFO ] Computed 35 place invariants in 8 ms
[2021-05-07 15:00:15] [INFO ] Dead Transitions using invariants and state equation in 1105 ms returned []
Finished structural reductions, in 1 iterations. Remains : 358/358 places, 928/928 transitions.
Incomplete random walk after 100000 steps, including 1913 resets, run finished after 286 ms. (steps per millisecond=349 ) properties seen :[0]
[2021-05-07 15:00:15] [INFO ] Flow matrix only has 924 transitions (discarded 4 similar events)
// Phase 1: matrix 924 rows 358 cols
[2021-05-07 15:00:15] [INFO ] Computed 35 place invariants in 7 ms
[2021-05-07 15:00:15] [INFO ] [Real]Absence check using 12 positive place invariants in 14 ms returned sat
[2021-05-07 15:00:15] [INFO ] [Real]Absence check using 12 positive and 23 generalized place invariants in 9 ms returned sat
[2021-05-07 15:00:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 15:00:16] [INFO ] [Real]Absence check using state equation in 549 ms returned sat
[2021-05-07 15:00:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 15:00:16] [INFO ] [Nat]Absence check using 12 positive place invariants in 17 ms returned sat
[2021-05-07 15:00:16] [INFO ] [Nat]Absence check using 12 positive and 23 generalized place invariants in 9 ms returned sat
[2021-05-07 15:00:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 15:00:16] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2021-05-07 15:00:16] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-07 15:00:16] [INFO ] [Nat]Added 3 Read/Feed constraints in 28 ms returned sat
[2021-05-07 15:00:16] [INFO ] Computed and/alt/rep : 903/12204/899 causal constraints in 49 ms.
[2021-05-07 15:00:36] [INFO ] Added : 570 causal constraints over 114 iterations in 19315 ms. Result :(error "Failed to check-sat")
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 358 transition count 924
Applied a total of 4 rules in 10 ms. Remains 358 /358 variables (removed 0) and now considering 924/928 (removed 4) transitions.
// Phase 1: matrix 924 rows 358 cols
[2021-05-07 15:00:36] [INFO ] Computed 35 place invariants in 8 ms
[2021-05-07 15:00:36] [INFO ] [Real]Absence check using 12 positive place invariants in 13 ms returned sat
[2021-05-07 15:00:36] [INFO ] [Real]Absence check using 12 positive and 23 generalized place invariants in 9 ms returned sat
[2021-05-07 15:00:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 15:00:36] [INFO ] [Real]Absence check using state equation in 551 ms returned sat
[2021-05-07 15:00:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 15:00:36] [INFO ] [Nat]Absence check using 12 positive place invariants in 16 ms returned sat
[2021-05-07 15:00:36] [INFO ] [Nat]Absence check using 12 positive and 23 generalized place invariants in 9 ms returned sat
[2021-05-07 15:00:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 15:00:37] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2021-05-07 15:00:37] [INFO ] Computed and/alt/rep : 899/12135/899 causal constraints in 60 ms.
[2021-05-07 15:00:59] [INFO ] Added : 580 causal constraints over 116 iterations in 21835 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 129 ms.
[2021-05-07 15:00:59] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2021-05-07 15:00:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 29 ms.
[2021-05-07 15:01:00] [INFO ] Flatten gal took : 219 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ASLink-PT-04b @ 3570 seconds

FORMULA ASLink-PT-04b-ReachabilityFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3558
rslt: Output for ReachabilityFireability @ ASLink-PT-04b

{
"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": "Fri May 7 15:01:01 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 25188,
"runtime": 12.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((p137 <= 1) AND (1 <= p137) AND (1 <= p159))))",
"processed_size": 53,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 3823,
"conflict_clusters": 32,
"places": 358,
"places_significant": 323,
"singleton_clusters": 0,
"transitions": 928
},
"result":
{
"edges": 52,
"markings": 53,
"produced_by": "state space",
"value": true
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1286/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 358
lola: finding significant places
lola: 358 places, 928 transitions, 323 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: (p159 <= 1)
lola: E (F (((p137 <= 1) AND (1 <= p137) AND (1 <= p159))))
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p137 <= 1) AND (1 <= p137) AND (1 <= p159))))
lola: processed formula length: 53
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: local time limit reached - aborting
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p137 <= 1) AND (1 <= p137) AND (1 <= p159))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: RESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 53 markings, 52 edges
lola: memory consumption: 25188 KB
lola: time consumption: 12 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="ASLink-PT-04b"
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 ASLink-PT-04b, 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 r011-tall-162038005800036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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