About the Execution of GreatSPN+red for ASLink-PT-03a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14552.168 | 843996.00 | 2645229.00 | 1070.50 | TFFTFTFF?FT?FF?? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r003-smll-171620116900046.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ASLink-PT-03a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620116900046
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 11 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 357K May 18 16:42 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-03a-ReachabilityCardinality-2024-00
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-01
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-02
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-03
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-04
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-05
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-06
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-07
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2023-08
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-09
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-10
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2023-11
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-12
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-13
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2023-14
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716242276897
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-03a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-20 21:57:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-20 21:57:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 21:58:00] [INFO ] Load time of PNML (sax parser for PT used): 369 ms
[2024-05-20 21:58:00] [INFO ] Transformed 821 places.
[2024-05-20 21:58:00] [INFO ] Transformed 1281 transitions.
[2024-05-20 21:58:00] [INFO ] Found NUPN structural information;
[2024-05-20 21:58:00] [INFO ] Parsed PT model containing 821 places and 1281 transitions and 4839 arcs in 675 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 13 transitions
Reduce redundant transitions removed 13 transitions.
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (342 resets) in 3680 ms. (10 steps per ms) remains 9/15 properties
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (66 resets) in 715 ms. (55 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (73 resets) in 183 ms. (217 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (77 resets) in 659 ms. (60 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (60 resets) in 569 ms. (70 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (73 resets) in 225 ms. (177 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (64 resets) in 175 ms. (227 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (70 resets) in 251 ms. (158 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (84 resets) in 206 ms. (193 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (75 resets) in 196 ms. (203 steps per ms) remains 9/9 properties
// Phase 1: matrix 1268 rows 821 cols
[2024-05-20 21:58:03] [INFO ] Computed 156 invariants in 115 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 92/197 variables, 19/124 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 92/216 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 56/253 variables, 17/233 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 56/289 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem ASLink-PT-03a-ReachabilityCardinality-2024-13 is UNSAT
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 557/810 variables, 117/406 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/810 variables, 557/963 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/810 variables, 0/963 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 11/821 variables, 3/966 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/821 variables, 11/977 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/821 variables, 0/977 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 1268/2089 variables, 821/1798 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2089 variables, 0/1798 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/2089 variables, 0/1798 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2089/2089 variables, and 1798 constraints, problems are : Problem set: 1 solved, 8 unsolved in 4946 ms.
Refiners :[Domain max(s): 821/821 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 120/120 constraints, State Equation: 821/821 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/85 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 93/178 variables, 19/104 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 93/197 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/197 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 56/234 variables, 17/214 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 56/270 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/270 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 571/805 variables, 115/385 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/805 variables, 571/956 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-20 21:58:10] [INFO ] Deduced a trap composed of 141 places in 1014 ms of which 111 ms to minimize.
[2024-05-20 21:58:10] [INFO ] Deduced a trap composed of 59 places in 482 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/805 variables, 2/958 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-20 21:58:11] [INFO ] Deduced a trap composed of 129 places in 619 ms of which 10 ms to minimize.
[2024-05-20 21:58:12] [INFO ] Deduced a trap composed of 28 places in 221 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/805 variables, 2/960 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/805 variables, 0/960 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 16/821 variables, 5/965 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/821 variables, 16/981 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 821/2089 variables, and 981 constraints, problems are : Problem set: 1 solved, 8 unsolved in 5017 ms.
Refiners :[Domain max(s): 821/821 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 120/120 constraints, State Equation: 0/821 constraints, PredecessorRefiner: 0/9 constraints, Known Traps: 4/4 constraints]
After SMT, in 10287ms problems are : Problem set: 1 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 85 out of 821 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 821/821 places, 1268/1268 transitions.
Ensure Unique test removed 12 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 803 transition count 1217
Reduce places removed 51 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 55 rules applied. Total rules applied 124 place count 752 transition count 1213
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 128 place count 748 transition count 1213
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 128 place count 748 transition count 1155
Deduced a syphon composed of 58 places in 3 ms
Ensure Unique test removed 20 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 264 place count 670 transition count 1155
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 266 place count 669 transition count 1154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 267 place count 668 transition count 1154
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 273 place count 662 transition count 1125
Ensure Unique test removed 1 places
Iterating global reduction 5 with 7 rules applied. Total rules applied 280 place count 661 transition count 1125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 286 place count 660 transition count 1120
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 289 place count 657 transition count 1120
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 290 place count 656 transition count 1112
Iterating global reduction 7 with 1 rules applied. Total rules applied 291 place count 656 transition count 1112
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 292 place count 655 transition count 1104
Iterating global reduction 7 with 1 rules applied. Total rules applied 293 place count 655 transition count 1104
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 294 place count 654 transition count 1096
Iterating global reduction 7 with 1 rules applied. Total rules applied 295 place count 654 transition count 1096
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 296 place count 653 transition count 1088
Iterating global reduction 7 with 1 rules applied. Total rules applied 297 place count 653 transition count 1088
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 298 place count 652 transition count 1080
Iterating global reduction 7 with 1 rules applied. Total rules applied 299 place count 652 transition count 1080
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 300 place count 651 transition count 1072
Iterating global reduction 7 with 1 rules applied. Total rules applied 301 place count 651 transition count 1072
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 302 place count 650 transition count 1064
Iterating global reduction 7 with 1 rules applied. Total rules applied 303 place count 650 transition count 1064
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 304 place count 649 transition count 1056
Iterating global reduction 7 with 1 rules applied. Total rules applied 305 place count 649 transition count 1056
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 306 place count 648 transition count 1048
Iterating global reduction 7 with 1 rules applied. Total rules applied 307 place count 648 transition count 1048
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 4 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 343 place count 630 transition count 1030
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 348 place count 630 transition count 1025
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 353 place count 625 transition count 1025
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 356 place count 625 transition count 1025
Applied a total of 356 rules in 684 ms. Remains 625 /821 variables (removed 196) and now considering 1025/1268 (removed 243) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 700 ms. Remains : 625/821 places, 1025/1268 transitions.
RANDOM walk for 40000 steps (455 resets) in 800 ms. (49 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (120 resets) in 178 ms. (223 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (122 resets) in 176 ms. (226 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (128 resets) in 220 ms. (181 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (97 resets) in 196 ms. (203 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (129 resets) in 116 ms. (341 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (122 resets) in 160 ms. (248 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (131 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (95 resets) in 147 ms. (270 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 116698 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :3 out of 8
Probabilistic random walk after 116698 steps, saw 47141 distinct states, run finished after 3023 ms. (steps per millisecond=38 ) properties seen :3
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 1025 rows 625 cols
[2024-05-20 21:58:17] [INFO ] Computed 115 invariants in 38 ms
[2024-05-20 21:58:17] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 100/161 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 39/200 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 414/614 variables, 85/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/614 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 11/625 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/625 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1025/1650 variables, 625/740 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1650 variables, 14/754 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1650 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/1650 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1650/1650 variables, and 754 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1754 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 88/88 constraints, State Equation: 625/625 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 100/161 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 39/200 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 414/614 variables, 85/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/614 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 11/625 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/625 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1025/1650 variables, 625/740 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1650 variables, 14/754 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1650 variables, 5/759 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1650 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/1650 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1650/1650 variables, and 759 constraints, problems are : Problem set: 0 solved, 5 unsolved in 16754 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 88/88 constraints, State Equation: 625/625 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 18627ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-05 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 32027 ms.
Support contains 44 out of 625 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 625/625 places, 1025/1025 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 625 transition count 1022
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 622 transition count 1020
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 620 transition count 1020
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 10 place count 620 transition count 1013
Deduced a syphon composed of 7 places in 3 ms
Ensure Unique test removed 6 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 30 place count 607 transition count 1013
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 606 transition count 1005
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 606 transition count 1005
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 33 place count 605 transition count 997
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 605 transition count 997
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 35 place count 604 transition count 989
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 604 transition count 989
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 37 place count 603 transition count 981
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 603 transition count 981
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 602 transition count 973
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 602 transition count 973
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 601 transition count 965
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 601 transition count 965
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 44 place count 600 transition count 964
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 600 transition count 963
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 46 place count 599 transition count 963
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 47 place count 599 transition count 963
Applied a total of 47 rules in 323 ms. Remains 599 /625 variables (removed 26) and now considering 963/1025 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 323 ms. Remains : 599/625 places, 963/1025 transitions.
RANDOM walk for 40000 steps (486 resets) in 252 ms. (158 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (93 resets) in 157 ms. (253 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (136 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (135 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (102 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 158703 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 4
Probabilistic random walk after 158703 steps, saw 64631 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
// Phase 1: matrix 963 rows 599 cols
[2024-05-20 21:59:11] [INFO ] Computed 109 invariants in 11 ms
[2024-05-20 21:59:11] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 108/152 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 39/191 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 399/590 variables, 78/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/590 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 9/599 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/599 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 963/1562 variables, 599/708 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1562 variables, 15/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1562 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1562 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1562/1562 variables, and 723 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1156 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 599/599 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 108/152 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 39/191 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 399/590 variables, 78/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/590 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 9/599 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/599 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 963/1562 variables, 599/708 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1562 variables, 15/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1562 variables, 4/727 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1562 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1562 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1562/1562 variables, and 727 constraints, problems are : Problem set: 0 solved, 4 unsolved in 11454 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 599/599 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 12648ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 12926 ms.
Support contains 44 out of 599 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 599/599 places, 963/963 transitions.
Applied a total of 0 rules in 34 ms. Remains 599 /599 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 599/599 places, 963/963 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 599/599 places, 963/963 transitions.
Applied a total of 0 rules in 19 ms. Remains 599 /599 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-05-20 21:59:37] [INFO ] Invariant cache hit.
[2024-05-20 21:59:38] [INFO ] Implicit Places using invariants in 684 ms returned [1, 19, 20, 22, 32, 50, 68, 150, 163, 166, 168, 186, 204, 287, 300, 301, 302, 303, 304, 322, 340, 420, 425, 436, 441, 442, 443, 462, 464, 467, 485, 486, 487, 500, 506, 518, 530, 536, 542, 548, 554, 561]
Discarding 42 places :
Implicit Place search using SMT only with invariants took 696 ms to find 42 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 557/599 places, 963/963 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 557 transition count 918
Reduce places removed 45 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 58 rules applied. Total rules applied 103 place count 512 transition count 905
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 116 place count 499 transition count 905
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 116 place count 499 transition count 888
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 150 place count 482 transition count 888
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 11 rules applied. Total rules applied 161 place count 475 transition count 884
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 166 place count 471 transition count 883
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 167 place count 470 transition count 883
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 174 place count 463 transition count 876
Iterating global reduction 6 with 7 rules applied. Total rules applied 181 place count 463 transition count 876
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 183 place count 461 transition count 874
Iterating global reduction 6 with 2 rules applied. Total rules applied 185 place count 461 transition count 874
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 186 place count 461 transition count 873
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 7 with 66 rules applied. Total rules applied 252 place count 428 transition count 840
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 253 place count 427 transition count 839
Iterating global reduction 7 with 1 rules applied. Total rules applied 254 place count 427 transition count 839
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 255 place count 427 transition count 838
Free-agglomeration rule applied 5 times.
Iterating global reduction 8 with 5 rules applied. Total rules applied 260 place count 427 transition count 833
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 265 place count 422 transition count 833
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 9 with 19 rules applied. Total rules applied 284 place count 422 transition count 814
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 303 place count 403 transition count 814
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 304 place count 403 transition count 813
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 311 place count 403 transition count 813
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 312 place count 403 transition count 813
Applied a total of 312 rules in 199 ms. Remains 403 /557 variables (removed 154) and now considering 813/963 (removed 150) transitions.
// Phase 1: matrix 813 rows 403 cols
[2024-05-20 21:59:38] [INFO ] Computed 60 invariants in 16 ms
[2024-05-20 21:59:38] [INFO ] Implicit Places using invariants in 571 ms returned [109, 118, 125, 126, 181, 200, 207, 210, 216, 221, 223, 300, 303, 305, 308, 376, 381, 394, 396, 400, 402]
[2024-05-20 21:59:38] [INFO ] Actually due to overlaps returned [216, 221, 223, 200, 207, 300, 305, 109, 118, 181, 210, 308, 376, 381, 394, 400]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 574 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 387/599 places, 813/963 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 381 transition count 807
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 381 transition count 807
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 380 transition count 806
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 380 transition count 806
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 377 transition count 803
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 23 place count 377 transition count 800
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 26 place count 374 transition count 800
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 374 transition count 799
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 373 transition count 799
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 373 transition count 799
Applied a total of 31 rules in 117 ms. Remains 373 /387 variables (removed 14) and now considering 799/813 (removed 14) transitions.
// Phase 1: matrix 799 rows 373 cols
[2024-05-20 21:59:39] [INFO ] Computed 44 invariants in 12 ms
[2024-05-20 21:59:39] [INFO ] Implicit Places using invariants in 492 ms returned [122, 123, 367]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 494 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 370/599 places, 799/963 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 369 transition count 798
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 369 transition count 798
Applied a total of 2 rules in 17 ms. Remains 369 /370 variables (removed 1) and now considering 798/799 (removed 1) transitions.
// Phase 1: matrix 798 rows 369 cols
[2024-05-20 21:59:39] [INFO ] Computed 41 invariants in 12 ms
[2024-05-20 21:59:40] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-05-20 21:59:40] [INFO ] Invariant cache hit.
[2024-05-20 21:59:40] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-20 21:59:41] [INFO ] Implicit Places using invariants and state equation in 1014 ms returned []
Implicit Place search using SMT with State Equation took 1460 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 369/599 places, 798/963 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 3578 ms. Remains : 369/599 places, 798/963 transitions.
RANDOM walk for 40000 steps (650 resets) in 235 ms. (169 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (142 resets) in 108 ms. (366 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (196 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (189 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (140 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 191058 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 4
Probabilistic random walk after 191058 steps, saw 94952 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2024-05-20 21:59:44] [INFO ] Invariant cache hit.
[2024-05-20 21:59:44] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 139/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/187 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 182/369 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 798/1167 variables, 369/410 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1167 variables, 4/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1167 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1167 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1167/1167 variables, and 414 constraints, problems are : Problem set: 0 solved, 4 unsolved in 667 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 369/369 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 139/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 21:59:45] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 2 ms to minimize.
[2024-05-20 21:59:45] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-20 21:59:45] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 4/187 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 182/369 variables, 24/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 21:59:45] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 798/1167 variables, 369/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1167 variables, 4/418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1167 variables, 4/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1167 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1167 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1167/1167 variables, and 422 constraints, problems are : Problem set: 0 solved, 4 unsolved in 10093 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 369/369 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 10784ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 20135 ms.
Support contains 44 out of 369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 369/369 places, 798/798 transitions.
Applied a total of 0 rules in 15 ms. Remains 369 /369 variables (removed 0) and now considering 798/798 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 369/369 places, 798/798 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 369/369 places, 798/798 transitions.
Applied a total of 0 rules in 10 ms. Remains 369 /369 variables (removed 0) and now considering 798/798 (removed 0) transitions.
[2024-05-20 22:00:15] [INFO ] Invariant cache hit.
[2024-05-20 22:00:15] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-20 22:00:15] [INFO ] Invariant cache hit.
[2024-05-20 22:00:16] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-20 22:00:17] [INFO ] Implicit Places using invariants and state equation in 1266 ms returned []
Implicit Place search using SMT with State Equation took 1666 ms to find 0 implicit places.
[2024-05-20 22:00:17] [INFO ] Redundant transitions in 49 ms returned []
Running 797 sub problems to find dead transitions.
[2024-05-20 22:00:17] [INFO ] Invariant cache hit.
[2024-05-20 22:00:17] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 797 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/368 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 797 unsolved
At refinement iteration 2 (OVERLAPS) 1/369 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 797 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/369 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 797 unsolved
[2024-05-20 22:00:42] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 369/1167 variables, and 42 constraints, problems are : Problem set: 0 solved, 797 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/369 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 797/797 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 797 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 797 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/368 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 797 unsolved
At refinement iteration 2 (OVERLAPS) 1/369 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 797 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/369 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 797 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 797 unsolved
[2024-05-20 22:01:00] [INFO ] Deduced a trap composed of 35 places in 270 ms of which 3 ms to minimize.
[2024-05-20 22:01:01] [INFO ] Deduced a trap composed of 42 places in 252 ms of which 4 ms to minimize.
[2024-05-20 22:01:01] [INFO ] Deduced a trap composed of 39 places in 268 ms of which 4 ms to minimize.
[2024-05-20 22:01:02] [INFO ] Deduced a trap composed of 71 places in 282 ms of which 4 ms to minimize.
[2024-05-20 22:01:02] [INFO ] Deduced a trap composed of 57 places in 263 ms of which 3 ms to minimize.
[2024-05-20 22:01:02] [INFO ] Deduced a trap composed of 55 places in 267 ms of which 3 ms to minimize.
[2024-05-20 22:01:03] [INFO ] Deduced a trap composed of 61 places in 269 ms of which 3 ms to minimize.
[2024-05-20 22:01:04] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 3 ms to minimize.
[2024-05-20 22:01:06] [INFO ] Deduced a trap composed of 25 places in 257 ms of which 4 ms to minimize.
[2024-05-20 22:01:06] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2024-05-20 22:01:07] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 797 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/1167 variables, and 53 constraints, problems are : Problem set: 0 solved, 797 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/369 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 0/797 constraints, Known Traps: 12/12 constraints]
After SMT, in 60637ms problems are : Problem set: 0 solved, 797 unsolved
Search for dead transitions found 0 dead transitions in 60651ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62393 ms. Remains : 369/369 places, 798/798 transitions.
Attempting over-approximation, by ignoring read arcs.
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 0 with 2 rules applied. Total rules applied 2 place count 368 transition count 797
Applied a total of 2 rules in 20 ms. Remains 368 /369 variables (removed 1) and now considering 797/798 (removed 1) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 797 rows 368 cols
[2024-05-20 22:01:17] [INFO ] Computed 41 invariants in 7 ms
[2024-05-20 22:01:17] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 22:01:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-20 22:01:18] [INFO ] [Nat]Absence check using 14 positive and 27 generalized place invariants in 20 ms returned sat
[2024-05-20 22:01:19] [INFO ] After 1316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-20 22:01:19] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-05-20 22:01:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
TRAPS : Iteration 1
[2024-05-20 22:01:21] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 3 ms to minimize.
[2024-05-20 22:01:21] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 2 ms to minimize.
[2024-05-20 22:01:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 371 ms
[2024-05-20 22:01:22] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
[2024-05-20 22:01:23] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-05-20 22:01:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 264 ms
TRAPS : Iteration 2
[2024-05-20 22:01:25] [INFO ] After 7302ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-20 22:01:26] [INFO ] After 9057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 9229 ms.
[2024-05-20 22:01:26] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2024-05-20 22:01:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 369 places, 798 transitions and 3171 arcs took 10 ms.
[2024-05-20 22:01:27] [INFO ] Flatten gal took : 153 ms
Total runtime 207783 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ASLink-PT-03a
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 369
TRANSITIONS: 798
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.031s, Sys 0.011s]
SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.006s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 699
MODEL NAME: /home/mcc/execution/414/model
369 places, 798 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ASLink-PT-03a-ReachabilityCardinality-2023-08 CANNOT_COMPUTE
FORMULA ASLink-PT-03a-ReachabilityCardinality-2023-11 CANNOT_COMPUTE
FORMULA ASLink-PT-03a-ReachabilityCardinality-2023-14 CANNOT_COMPUTE
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716243120893
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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-03a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is ASLink-PT-03a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r003-smll-171620116900046"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-03a.tgz
mv ASLink-PT-03a execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;