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.r333-tall-171679078800595.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 SemanticWebServices-PT-S256P15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679078800595
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 32M
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 02:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 02:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 02:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 12 02:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 32M May 18 16:43 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 SemanticWebServices-PT-S256P15-LTLCardinality-00
FORMULA_NAME SemanticWebServices-PT-S256P15-LTLCardinality-01
FORMULA_NAME SemanticWebServices-PT-S256P15-LTLCardinality-02
FORMULA_NAME SemanticWebServices-PT-S256P15-LTLCardinality-03
FORMULA_NAME SemanticWebServices-PT-S256P15-LTLCardinality-04
FORMULA_NAME SemanticWebServices-PT-S256P15-LTLCardinality-05
FORMULA_NAME SemanticWebServices-PT-S256P15-LTLCardinality-06
FORMULA_NAME SemanticWebServices-PT-S256P15-LTLCardinality-07
FORMULA_NAME SemanticWebServices-PT-S256P15-LTLCardinality-08
FORMULA_NAME SemanticWebServices-PT-S256P15-LTLCardinality-09
FORMULA_NAME SemanticWebServices-PT-S256P15-LTLCardinality-10
FORMULA_NAME SemanticWebServices-PT-S256P15-LTLCardinality-11
FORMULA_NAME SemanticWebServices-PT-S256P15-LTLCardinality-12
FORMULA_NAME SemanticWebServices-PT-S256P15-LTLCardinality-13
FORMULA_NAME SemanticWebServices-PT-S256P15-LTLCardinality-14
FORMULA_NAME SemanticWebServices-PT-S256P15-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716875671219

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S256P15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 05:54:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 05:54:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 05:54:33] [INFO ] Load time of PNML (sax parser for PT used): 1134 ms
[2024-05-28 05:54:33] [INFO ] Transformed 329 places.
[2024-05-28 05:54:33] [INFO ] Transformed 29492 transitions.
[2024-05-28 05:54:33] [INFO ] Parsed PT model containing 329 places and 29492 transitions and 267319 arcs in 1364 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 84 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 5 places in 43 ms
Reduce places removed 5 places and 2050 transitions.
Ensure Unique test removed 6828 transitions
Reduce redundant transitions removed 6828 transitions.
FORMULA SemanticWebServices-PT-S256P15-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 20614/20614 transitions.
Ensure Unique test removed 31 places
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 730 transitions
Reduce isomorphic transitions removed 730 transitions.
Iterating post reduction 0 with 777 rules applied. Total rules applied 777 place count 277 transition count 19884
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 804 place count 250 transition count 13793
Iterating global reduction 1 with 27 rules applied. Total rules applied 831 place count 250 transition count 13793
Ensure Unique test removed 969 transitions
Reduce isomorphic transitions removed 969 transitions.
Iterating post reduction 1 with 969 rules applied. Total rules applied 1800 place count 250 transition count 12824
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1804 place count 246 transition count 12820
Iterating global reduction 2 with 4 rules applied. Total rules applied 1808 place count 246 transition count 12820
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1811 place count 243 transition count 12817
Iterating global reduction 2 with 3 rules applied. Total rules applied 1814 place count 243 transition count 12817
Drop transitions (Redundant composition of simpler transitions.) removed 2609 transitions
Redundant transition composition rules discarded 2609 transitions
Iterating global reduction 2 with 2609 rules applied. Total rules applied 4423 place count 243 transition count 10208
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 284 transitions
Reduce isomorphic transitions removed 284 transitions.
Iterating post reduction 2 with 290 rules applied. Total rules applied 4713 place count 237 transition count 9924
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 4725 place count 225 transition count 8207
Iterating global reduction 3 with 12 rules applied. Total rules applied 4737 place count 225 transition count 8207
Ensure Unique test removed 1230 transitions
Reduce isomorphic transitions removed 1230 transitions.
Iterating post reduction 3 with 1230 rules applied. Total rules applied 5967 place count 225 transition count 6977
Drop transitions (Redundant composition of simpler transitions.) removed 482 transitions
Redundant transition composition rules discarded 482 transitions
Iterating global reduction 4 with 482 rules applied. Total rules applied 6449 place count 225 transition count 6495
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Iterating post reduction 4 with 123 rules applied. Total rules applied 6572 place count 223 transition count 6374
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 5 with 52 rules applied. Total rules applied 6624 place count 223 transition count 6322
Applied a total of 6624 rules in 594 ms. Remains 223 /324 variables (removed 101) and now considering 6322/20614 (removed 14292) transitions.
Running 5744 sub problems to find dead transitions.
[2024-05-28 05:54:35] [INFO ] Flow matrix only has 1229 transitions (discarded 5093 similar events)
Normalized transition count is 1228 out of 1229 initially.
// Phase 1: matrix 1228 rows 223 cols
[2024-05-28 05:54:35] [INFO ] Computed 4 invariants in 25 ms
[2024-05-28 05:54:35] [INFO ] State equation strengthened by 646 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5744 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 219/1452 variables, and 3 constraints, problems are : Problem set: 0 solved, 5744 unsolved in 20178 ms.
Refiners :[Generalized P Invariants (flows): 3/4 constraints, State Equation: 0/223 constraints, ReadFeed: 0/646 constraints, PredecessorRefiner: 5744/5744 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5744 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5744 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 219/1452 variables, and 3 constraints, problems are : Problem set: 0 solved, 5744 unsolved in 20090 ms.
Refiners :[Generalized P Invariants (flows): 3/4 constraints, State Equation: 0/223 constraints, ReadFeed: 0/646 constraints, PredecessorRefiner: 0/5744 constraints, Known Traps: 0/0 constraints]
After SMT, in 59695ms problems are : Problem set: 0 solved, 5744 unsolved
Search for dead transitions found 0 dead transitions in 59799ms
[2024-05-28 05:55:34] [INFO ] Flow matrix only has 1229 transitions (discarded 5093 similar events)
[2024-05-28 05:55:34] [INFO ] Invariant cache hit.
[2024-05-28 05:55:35] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-28 05:55:35] [INFO ] Flow matrix only has 1229 transitions (discarded 5093 similar events)
[2024-05-28 05:55:35] [INFO ] Invariant cache hit.
[2024-05-28 05:55:35] [INFO ] State equation strengthened by 646 read => feed constraints.
[2024-05-28 05:55:36] [INFO ] Implicit Places using invariants and state equation in 1542 ms returned []
Implicit Place search using SMT with State Equation took 1982 ms to find 0 implicit places.
Running 5744 sub problems to find dead transitions.
[2024-05-28 05:55:36] [INFO ] Flow matrix only has 1229 transitions (discarded 5093 similar events)
[2024-05-28 05:55:36] [INFO ] Invariant cache hit.
[2024-05-28 05:55:36] [INFO ] State equation strengthened by 646 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5744 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 219/1452 variables, and 3 constraints, problems are : Problem set: 0 solved, 5744 unsolved in 30110 ms.
Refiners :[Generalized P Invariants (flows): 3/4 constraints, State Equation: 0/223 constraints, ReadFeed: 0/646 constraints, PredecessorRefiner: 5744/5744 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5744 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5744 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5744 unsolved
SMT process timed out in 78894ms, After SMT, problems are : Problem set: 0 solved, 5744 unsolved
Search for dead transitions found 0 dead transitions in 78969ms
Starting structural reductions in LTL mode, iteration 1 : 223/324 places, 6322/20614 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141444 ms. Remains : 223/324 places, 6322/20614 transitions.
Support contains 40 out of 223 places after structural reductions.
[2024-05-28 05:56:56] [INFO ] Flatten gal took : 314 ms
[2024-05-28 05:56:56] [INFO ] Flatten gal took : 192 ms
[2024-05-28 05:56:56] [INFO ] Input system was already deterministic with 6322 transitions.
RANDOM walk for 40000 steps (8 resets) in 3333 ms. (11 steps per ms) remains 7/28 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 7/7 properties
[2024-05-28 05:56:58] [INFO ] Flow matrix only has 1229 transitions (discarded 5093 similar events)
[2024-05-28 05:56:58] [INFO ] Invariant cache hit.
[2024-05-28 05:56:58] [INFO ] State equation strengthened by 646 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 3/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 43/57 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 522/579 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 5/584 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/584 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 636/1220 variables, 84/150 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1220 variables, 189/339 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1220 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 128/1348 variables, 39/378 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1348 variables, 330/708 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1348 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 4/1352 variables, 2/710 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1352 variables, 30/740 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1352 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 32/1384 variables, 56/796 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1384 variables, 2/798 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1384 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 31/1415 variables, 31/829 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1415 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (OVERLAPS) 13/1428 variables, 18/847 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1428 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (OVERLAPS) 13/1441 variables, 13/860 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1441 variables, 0/860 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (OVERLAPS) 5/1446 variables, 6/866 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1446 variables, 2/868 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1446 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 5/1451 variables, 5/873 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1451 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (OVERLAPS) 0/1451 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1451/1452 variables, and 873 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2236 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 223/223 constraints, ReadFeed: 646/646 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 3/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 43/57 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 522/579 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 13/66 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 5/584 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 636/1220 variables, 84/151 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1220 variables, 189/340 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1220 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 128/1348 variables, 39/379 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1348 variables, 330/709 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1348 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 4/1352 variables, 2/711 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1352 variables, 30/741 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1352 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 32/1384 variables, 56/797 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1384 variables, 2/799 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1384 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 31/1415 variables, 31/830 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1415 variables, 6/836 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1415 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (OVERLAPS) 13/1428 variables, 18/854 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1428 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (OVERLAPS) 13/1441 variables, 13/867 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1441 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (OVERLAPS) 5/1446 variables, 6/873 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1446 variables, 2/875 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1446 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (OVERLAPS) 5/1451 variables, 5/880 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1451 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (OVERLAPS) 0/1451 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1451/1452 variables, and 880 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3824 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 223/223 constraints, ReadFeed: 646/646 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 6290ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 2 different solutions.
Finished Parikh walk after 179 steps, including 1 resets, run visited all 7 properties in 13 ms. (steps per millisecond=13 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 36 ms.
FORMULA SemanticWebServices-PT-S256P15-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 3 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 6322/6322 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 169 transitions
Reduce isomorphic transitions removed 169 transitions.
Iterating post reduction 0 with 174 rules applied. Total rules applied 174 place count 218 transition count 6153
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 181 place count 211 transition count 5720
Iterating global reduction 1 with 7 rules applied. Total rules applied 188 place count 211 transition count 5720
Ensure Unique test removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Iterating post reduction 1 with 136 rules applied. Total rules applied 324 place count 211 transition count 5584
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 328 place count 207 transition count 5580
Iterating global reduction 2 with 4 rules applied. Total rules applied 332 place count 207 transition count 5580
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 335 place count 204 transition count 5577
Iterating global reduction 2 with 3 rules applied. Total rules applied 338 place count 204 transition count 5577
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 339 place count 204 transition count 5576
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 340 place count 203 transition count 5575
Iterating global reduction 3 with 1 rules applied. Total rules applied 341 place count 203 transition count 5575
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 342 place count 202 transition count 5574
Iterating global reduction 3 with 1 rules applied. Total rules applied 343 place count 202 transition count 5574
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 344 place count 201 transition count 5573
Iterating global reduction 3 with 1 rules applied. Total rules applied 345 place count 201 transition count 5573
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 346 place count 201 transition count 5572
Drop transitions (Redundant composition of simpler transitions.) removed 208 transitions
Redundant transition composition rules discarded 208 transitions
Iterating global reduction 4 with 208 rules applied. Total rules applied 554 place count 201 transition count 5364
Applied a total of 554 rules in 118 ms. Remains 201 /223 variables (removed 22) and now considering 5364/6322 (removed 958) transitions.
Running 4815 sub problems to find dead transitions.
[2024-05-28 05:57:04] [INFO ] Flow matrix only has 1149 transitions (discarded 4215 similar events)
Normalized transition count is 1148 out of 1149 initially.
// Phase 1: matrix 1148 rows 201 cols
[2024-05-28 05:57:04] [INFO ] Computed 1 invariants in 13 ms
[2024-05-28 05:57:05] [INFO ] State equation strengthened by 595 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 199/1350 variables, and 0 constraints, problems are : Problem set: 0 solved, 4815 unsolved in 20074 ms.
Refiners :[Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/201 constraints, ReadFeed: 0/595 constraints, PredecessorRefiner: 4815/4815 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4815 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 199/1350 variables, and 0 constraints, problems are : Problem set: 0 solved, 4815 unsolved in 20058 ms.
Refiners :[Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/201 constraints, ReadFeed: 0/595 constraints, PredecessorRefiner: 0/4815 constraints, Known Traps: 0/0 constraints]
After SMT, in 57027ms problems are : Problem set: 0 solved, 4815 unsolved
Search for dead transitions found 0 dead transitions in 57082ms
[2024-05-28 05:58:02] [INFO ] Flow matrix only has 1149 transitions (discarded 4215 similar events)
[2024-05-28 05:58:02] [INFO ] Invariant cache hit.
[2024-05-28 05:58:02] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-05-28 05:58:02] [INFO ] Flow matrix only has 1149 transitions (discarded 4215 similar events)
[2024-05-28 05:58:02] [INFO ] Invariant cache hit.
[2024-05-28 05:58:02] [INFO ] State equation strengthened by 595 read => feed constraints.
[2024-05-28 05:58:03] [INFO ] Implicit Places using invariants and state equation in 1480 ms returned []
Implicit Place search using SMT with State Equation took 1884 ms to find 0 implicit places.
Running 4815 sub problems to find dead transitions.
[2024-05-28 05:58:03] [INFO ] Flow matrix only has 1149 transitions (discarded 4215 similar events)
[2024-05-28 05:58:03] [INFO ] Invariant cache hit.
[2024-05-28 05:58:04] [INFO ] State equation strengthened by 595 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4815 unsolved
SMT process timed out in 46384ms, After SMT, problems are : Problem set: 0 solved, 4815 unsolved
Search for dead transitions found 0 dead transitions in 46427ms
Starting structural reductions in LTL mode, iteration 1 : 201/223 places, 5364/6322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105537 ms. Remains : 201/223 places, 5364/6322 transitions.
Stuttering acceptance computed with spot in 280 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S256P15-LTLCardinality-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA SemanticWebServices-PT-S256P15-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S256P15-LTLCardinality-00 finished in 105900 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 6322/6322 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 169 transitions
Reduce isomorphic transitions removed 169 transitions.
Iterating post reduction 0 with 174 rules applied. Total rules applied 174 place count 218 transition count 6153
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 183 place count 209 transition count 5648
Iterating global reduction 1 with 9 rules applied. Total rules applied 192 place count 209 transition count 5648
Ensure Unique test removed 212 transitions
Reduce isomorphic transitions removed 212 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 404 place count 209 transition count 5436
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 408 place count 205 transition count 5369
Iterating global reduction 2 with 4 rules applied. Total rules applied 412 place count 205 transition count 5369
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 418 place count 205 transition count 5363
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 420 place count 203 transition count 5361
Iterating global reduction 3 with 2 rules applied. Total rules applied 422 place count 203 transition count 5361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 423 place count 203 transition count 5360
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 424 place count 202 transition count 5359
Iterating global reduction 4 with 1 rules applied. Total rules applied 425 place count 202 transition count 5359
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 426 place count 201 transition count 5358
Iterating global reduction 4 with 1 rules applied. Total rules applied 427 place count 201 transition count 5358
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 428 place count 200 transition count 5357
Iterating global reduction 4 with 1 rules applied. Total rules applied 429 place count 200 transition count 5357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 430 place count 200 transition count 5356
Drop transitions (Redundant composition of simpler transitions.) removed 208 transitions
Redundant transition composition rules discarded 208 transitions
Iterating global reduction 5 with 208 rules applied. Total rules applied 638 place count 200 transition count 5148
Applied a total of 638 rules in 113 ms. Remains 200 /223 variables (removed 23) and now considering 5148/6322 (removed 1174) transitions.
Running 4617 sub problems to find dead transitions.
[2024-05-28 05:58:50] [INFO ] Flow matrix only has 1113 transitions (discarded 4035 similar events)
Normalized transition count is 1112 out of 1113 initially.
// Phase 1: matrix 1112 rows 200 cols
[2024-05-28 05:58:50] [INFO ] Computed 1 invariants in 11 ms
[2024-05-28 05:58:50] [INFO ] State equation strengthened by 577 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 198/1313 variables, and 0 constraints, problems are : Problem set: 0 solved, 4617 unsolved in 20059 ms.
Refiners :[Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/200 constraints, ReadFeed: 0/577 constraints, PredecessorRefiner: 4617/4617 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4617 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 198/1313 variables, and 0 constraints, problems are : Problem set: 0 solved, 4617 unsolved in 20051 ms.
Refiners :[Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/200 constraints, ReadFeed: 0/577 constraints, PredecessorRefiner: 0/4617 constraints, Known Traps: 0/0 constraints]
After SMT, in 55713ms problems are : Problem set: 0 solved, 4617 unsolved
Search for dead transitions found 0 dead transitions in 55751ms
[2024-05-28 05:59:46] [INFO ] Flow matrix only has 1113 transitions (discarded 4035 similar events)
[2024-05-28 05:59:46] [INFO ] Invariant cache hit.
[2024-05-28 05:59:46] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-28 05:59:46] [INFO ] Flow matrix only has 1113 transitions (discarded 4035 similar events)
[2024-05-28 05:59:46] [INFO ] Invariant cache hit.
[2024-05-28 05:59:47] [INFO ] State equation strengthened by 577 read => feed constraints.
[2024-05-28 05:59:48] [INFO ] Implicit Places using invariants and state equation in 1342 ms returned []
Implicit Place search using SMT with State Equation took 1672 ms to find 0 implicit places.
Running 4617 sub problems to find dead transitions.
[2024-05-28 05:59:48] [INFO ] Flow matrix only has 1113 transitions (discarded 4035 similar events)
[2024-05-28 05:59:48] [INFO ] Invariant cache hit.
[2024-05-28 05:59:48] [INFO ] State equation strengthened by 577 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 2.0)
(s43 2.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 2.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 2.0)
(s111 1.0)
(s112 1.0)
(s113 2.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4617 unsolved
SMT process timed out in 45174ms, After SMT, problems are : Problem set: 0 solved, 4617 unsolved
Search for dead transitions found 0 dead transitions in 45216ms
Starting structural reductions in LTL mode, iteration 1 : 200/223 places, 5148/6322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102774 ms. Remains : 200/223 places, 5148/6322 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S256P15-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 5512 ms.
Product exploration explored 100000 steps with 0 reset in 5638 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0)]
RANDOM walk for 40004 steps (8 resets) in 1551 ms. (25 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1913738 steps, run timeout after 3001 ms. (steps per millisecond=637 ) properties seen :0 out of 1
Probabilistic random walk after 1913738 steps, saw 1885437 distinct states, run finished after 3007 ms. (steps per millisecond=636 ) properties seen :0
[2024-05-28 06:00:48] [INFO ] Flow matrix only has 1113 transitions (discarded 4035 similar events)
[2024-05-28 06:00:48] [INFO ] Invariant cache hit.
[2024-05-28 06:00:48] [INFO ] State equation strengthened by 577 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 144/156 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 578/734 variables, 42/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/734 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/734 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 306/1040 variables, 51/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1040 variables, 120/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1040 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 153/1193 variables, 39/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1193 variables, 251/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1193 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/1199 variables, 3/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1199 variables, 38/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1199 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 13/1212 variables, 113/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1212 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 12/1224 variables, 12/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1224 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 5/1229 variables, 4/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1229 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 7/1236 variables, 6/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1236 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 5/1241 variables, 1/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1241 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 5/1246 variables, 5/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1246 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 6/1252 variables, 3/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1252 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 2/1254 variables, 1/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1254 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 13/1267 variables, 14/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1267 variables, 3/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1267 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 13/1280 variables, 13/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1280 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 8/1288 variables, 7/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1288 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 8/1296 variables, 8/759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1296 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 7/1303 variables, 7/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1303 variables, 2/768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1303 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 7/1310 variables, 7/775 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1310 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 1/1311 variables, 2/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1311 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 1/1312 variables, 1/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1312 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 0/1312 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1312/1313 variables, and 778 constraints, problems are : Problem set: 0 solved, 1 unsolved in 947 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 200/200 constraints, ReadFeed: 577/577 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 144/156 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 578/734 variables, 42/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/734 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/734 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 306/1040 variables, 51/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1040 variables, 120/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1040 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 153/1193 variables, 39/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1193 variables, 251/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1193 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/1199 variables, 3/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1199 variables, 38/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1199 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 13/1212 variables, 113/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1212 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 12/1224 variables, 12/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1224 variables, 1/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1224 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/1229 variables, 4/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1229 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 7/1236 variables, 6/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1236 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 5/1241 variables, 1/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1241 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 5/1246 variables, 5/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1246 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 6/1252 variables, 3/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1252 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 2/1254 variables, 1/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1254 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 13/1267 variables, 14/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1267 variables, 3/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1267 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 13/1280 variables, 13/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1280 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 8/1288 variables, 7/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1288 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 8/1296 variables, 8/760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1296 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 7/1303 variables, 7/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1303 variables, 2/769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1303 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 7/1310 variables, 7/776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1310 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 1/1311 variables, 2/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1311 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 1/1312 variables, 1/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1312 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 0/1312 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1312/1313 variables, and 779 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1204 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 200/200 constraints, ReadFeed: 577/577 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2258ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 105 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S256P15-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S256P15-LTLCardinality-01 finished in 120213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 6322/6322 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 169 transitions
Reduce isomorphic transitions removed 169 transitions.
Iterating post reduction 0 with 174 rules applied. Total rules applied 174 place count 218 transition count 6153
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 183 place count 209 transition count 5648
Iterating global reduction 1 with 9 rules applied. Total rules applied 192 place count 209 transition count 5648
Ensure Unique test removed 212 transitions
Reduce isomorphic transitions removed 212 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 404 place count 209 transition count 5436
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 409 place count 204 transition count 5368
Iterating global reduction 2 with 5 rules applied. Total rules applied 414 place count 204 transition count 5368
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 420 place count 204 transition count 5362
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 423 place count 201 transition count 5359
Iterating global reduction 3 with 3 rules applied. Total rules applied 426 place count 201 transition count 5359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 427 place count 201 transition count 5358
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 428 place count 200 transition count 5357
Iterating global reduction 4 with 1 rules applied. Total rules applied 429 place count 200 transition count 5357
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 430 place count 199 transition count 5356
Iterating global reduction 4 with 1 rules applied. Total rules applied 431 place count 199 transition count 5356
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 432 place count 198 transition count 5355
Iterating global reduction 4 with 1 rules applied. Total rules applied 433 place count 198 transition count 5355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 434 place count 198 transition count 5354
Drop transitions (Redundant composition of simpler transitions.) removed 208 transitions
Redundant transition composition rules discarded 208 transitions
Iterating global reduction 5 with 208 rules applied. Total rules applied 642 place count 198 transition count 5146
Applied a total of 642 rules in 110 ms. Remains 198 /223 variables (removed 25) and now considering 5146/6322 (removed 1176) transitions.
Running 4615 sub problems to find dead transitions.
[2024-05-28 06:00:51] [INFO ] Flow matrix only has 1111 transitions (discarded 4035 similar events)
Normalized transition count is 1110 out of 1111 initially.
// Phase 1: matrix 1110 rows 198 cols
[2024-05-28 06:00:51] [INFO ] Computed 1 invariants in 6 ms
[2024-05-28 06:00:51] [INFO ] State equation strengthened by 575 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SemanticWebServices-PT-S256P15

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 329
TRANSITIONS: 29492
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 1.317s, Sys 0.115s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.127s, Sys 0.004s]


----------------------------------------------------------------------
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: 704
MODEL NAME: /home/mcc/execution/model
329 places, 29492 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.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
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="SemanticWebServices-PT-S256P15"
export BK_EXAMINATION="LTLCardinality"
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 SemanticWebServices-PT-S256P15, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r333-tall-171679078800595"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SemanticWebServices-PT-S256P15.tgz
mv SemanticWebServices-PT-S256P15 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;