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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.7M
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 02:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 12 02:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 02:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 02:42 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 9.2M 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-S256P18-LTLCardinality-00
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLCardinality-01
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLCardinality-02
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLCardinality-03
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLCardinality-04
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLCardinality-05
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLCardinality-06
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLCardinality-07
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLCardinality-08
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLCardinality-09
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLCardinality-10
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLCardinality-11
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLCardinality-12
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLCardinality-13
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLCardinality-14
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716879215239

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-S256P18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 06:53:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 06:53:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:53:37] [INFO ] Load time of PNML (sax parser for PT used): 591 ms
[2024-05-28 06:53:37] [INFO ] Transformed 198 places.
[2024-05-28 06:53:37] [INFO ] Transformed 9732 transitions.
[2024-05-28 06:53:37] [INFO ] Parsed PT model containing 198 places and 9732 transitions and 78799 arcs in 741 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 2 places in 19 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 4246 transitions
Reduce redundant transitions removed 4246 transitions.
FORMULA SemanticWebServices-PT-S256P18-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S256P18-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 5484/5484 transitions.
Ensure Unique test removed 45 places
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 150 transition count 5484
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 145 transition count 5464
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 145 transition count 5464
Ensure Unique test removed 372 transitions
Reduce isomorphic transitions removed 372 transitions.
Iterating post reduction 1 with 372 rules applied. Total rules applied 428 place count 145 transition count 5092
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 431 place count 142 transition count 5089
Iterating global reduction 2 with 3 rules applied. Total rules applied 434 place count 142 transition count 5089
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 435 place count 141 transition count 5088
Iterating global reduction 2 with 1 rules applied. Total rules applied 436 place count 141 transition count 5088
Drop transitions (Redundant composition of simpler transitions.) removed 2304 transitions
Redundant transition composition rules discarded 2304 transitions
Iterating global reduction 2 with 2304 rules applied. Total rules applied 2740 place count 141 transition count 2784
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 2776 place count 140 transition count 2749
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 2778 place count 138 transition count 2733
Iterating global reduction 3 with 2 rules applied. Total rules applied 2780 place count 138 transition count 2733
Ensure Unique test removed 442 transitions
Reduce isomorphic transitions removed 442 transitions.
Iterating post reduction 3 with 442 rules applied. Total rules applied 3222 place count 138 transition count 2291
Applied a total of 3222 rules in 295 ms. Remains 138 /196 variables (removed 58) and now considering 2291/5484 (removed 3193) transitions.
Running 1719 sub problems to find dead transitions.
[2024-05-28 06:53:37] [INFO ] Flow matrix only has 844 transitions (discarded 1447 similar events)
Normalized transition count is 824 out of 844 initially.
// Phase 1: matrix 824 rows 138 cols
[2024-05-28 06:53:37] [INFO ] Computed 6 invariants in 20 ms
[2024-05-28 06:53:37] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1719 unsolved
At refinement iteration 2 (OVERLAPS) 3/137 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1719 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1719 unsolved
SMT process timed out in 29338ms, After SMT, problems are : Problem set: 0 solved, 1719 unsolved
Search for dead transitions found 0 dead transitions in 29388ms
[2024-05-28 06:54:07] [INFO ] Flow matrix only has 844 transitions (discarded 1447 similar events)
[2024-05-28 06:54:07] [INFO ] Invariant cache hit.
[2024-05-28 06:54:07] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-28 06:54:07] [INFO ] Flow matrix only has 844 transitions (discarded 1447 similar events)
[2024-05-28 06:54:07] [INFO ] Invariant cache hit.
[2024-05-28 06:54:07] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-28 06:54:07] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
Running 1719 sub problems to find dead transitions.
[2024-05-28 06:54:07] [INFO ] Flow matrix only has 844 transitions (discarded 1447 similar events)
[2024-05-28 06:54:07] [INFO ] Invariant cache hit.
[2024-05-28 06:54:08] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1719 unsolved
At refinement iteration 2 (OVERLAPS) 3/137 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1719 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1719 unsolved
At refinement iteration 4 (OVERLAPS) 842/979 variables, 137/143 constraints. Problems are: Problem set: 0 solved, 1719 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/979 variables, 267/410 constraints. Problems are: Problem set: 0 solved, 1719 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 979/982 variables, and 410 constraints, problems are : Problem set: 0 solved, 1719 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 137/138 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1719/1719 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1719 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1719 unsolved
At refinement iteration 2 (OVERLAPS) 3/137 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1719 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1719 unsolved
At refinement iteration 4 (OVERLAPS) 842/979 variables, 137/143 constraints. Problems are: Problem set: 0 solved, 1719 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/979 variables, 267/410 constraints. Problems are: Problem set: 0 solved, 1719 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/979 variables, 109/519 constraints. Problems are: Problem set: 0 solved, 1719 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 979/982 variables, and 519 constraints, problems are : Problem set: 0 solved, 1719 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 137/138 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 109/1719 constraints, Known Traps: 0/0 constraints]
After SMT, in 69355ms problems are : Problem set: 0 solved, 1719 unsolved
Search for dead transitions found 0 dead transitions in 69374ms
Starting structural reductions in LTL mode, iteration 1 : 138/196 places, 2291/5484 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99841 ms. Remains : 138/196 places, 2291/5484 transitions.
Support contains 43 out of 138 places after structural reductions.
[2024-05-28 06:55:17] [INFO ] Flatten gal took : 157 ms
[2024-05-28 06:55:17] [INFO ] Flatten gal took : 108 ms
[2024-05-28 06:55:17] [INFO ] Input system was already deterministic with 2291 transitions.
RANDOM walk for 40033 steps (8 resets) in 2074 ms. (19 steps per ms) remains 17/31 properties
BEST_FIRST walk for 4004 steps (4 resets) in 7 ms. (500 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (4 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (4 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (4 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (4 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (4 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (4 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (4 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (4 resets) in 6 ms. (572 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (4 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (4 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (4 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (4 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (4 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (4 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (4 resets) in 6 ms. (572 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (4 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
[2024-05-28 06:55:18] [INFO ] Flow matrix only has 844 transitions (discarded 1447 similar events)
[2024-05-28 06:55:18] [INFO ] Invariant cache hit.
[2024-05-28 06:55:18] [INFO ] State equation strengthened by 267 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 8/34 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/36 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 110/146 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 704/850 variables, 37/83 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/850 variables, 118/201 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/850 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 10/860 variables, 4/205 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/860 variables, 64/269 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/860 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 36/896 variables, 42/311 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/896 variables, 6/317 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/896 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (OVERLAPS) 37/933 variables, 37/354 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/933 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/933 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (OVERLAPS) 15/948 variables, 19/374 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/948 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (OVERLAPS) 15/963 variables, 15/389 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/963 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 25 (OVERLAPS) 6/969 variables, 8/397 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/969 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 27 (OVERLAPS) 6/975 variables, 6/403 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/975 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 29 (OVERLAPS) 3/978 variables, 4/407 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/978 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/978 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 32 (OVERLAPS) 3/981 variables, 3/411 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/981 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 34 (OVERLAPS) 0/981 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 981/982 variables, and 411 constraints, problems are : Problem set: 0 solved, 17 unsolved in 2651 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 138/138 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 8/34 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/36 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 110/146 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 704/850 variables, 37/85 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/850 variables, 118/203 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/850 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 10/860 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/860 variables, 64/271 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/860 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 36/896 variables, 42/313 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/896 variables, 6/319 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/896 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (OVERLAPS) 37/933 variables, 37/356 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/933 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/933 variables, 15/372 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/933 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (OVERLAPS) 15/948 variables, 19/391 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/948 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 25 (OVERLAPS) 15/963 variables, 15/406 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/963 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 27 (OVERLAPS) 6/969 variables, 8/414 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/969 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 29 (OVERLAPS) 6/975 variables, 6/420 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/975 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 31 (OVERLAPS) 3/978 variables, 4/424 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/978 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/978 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 34 (OVERLAPS) 3/981 variables, 3/428 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/981 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 36 (OVERLAPS) 0/981 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 981/982 variables, and 428 constraints, problems are : Problem set: 0 solved, 17 unsolved in 3870 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 138/138 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 6626ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 6 different solutions.
Finished Parikh walk after 6902 steps, including 89 resets, run visited all 1 properties in 106 ms. (steps per millisecond=65 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 17 properties in 139 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&&X(p1)))||G(p2))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2291/2291 transitions.
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 132 transition count 2262
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 126 transition count 2256
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 126 transition count 2256
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 49 place count 126 transition count 2254
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 123 transition count 2251
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 123 transition count 2251
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 121 transition count 2249
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 121 transition count 2249
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 120 transition count 2248
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 120 transition count 2248
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 119 transition count 2247
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 119 transition count 2247
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 118 transition count 2246
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 118 transition count 2246
Applied a total of 65 rules in 55 ms. Remains 118 /138 variables (removed 20) and now considering 2246/2291 (removed 45) transitions.
Running 1705 sub problems to find dead transitions.
[2024-05-28 06:55:25] [INFO ] Flow matrix only has 799 transitions (discarded 1447 similar events)
Normalized transition count is 779 out of 799 initially.
// Phase 1: matrix 779 rows 118 cols
[2024-05-28 06:55:25] [INFO ] Computed 1 invariants in 9 ms
[2024-05-28 06:55:25] [INFO ] State equation strengthened by 253 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1705 unsolved
At refinement iteration 1 (OVERLAPS) 2/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1705 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1705 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 798/916 variables, 118/119 constraints. Problems are: Problem set: 0 solved, 1705 unsolved
SMT process timed out in 29506ms, After SMT, problems are : Problem set: 0 solved, 1705 unsolved
Search for dead transitions found 0 dead transitions in 29525ms
[2024-05-28 06:55:55] [INFO ] Flow matrix only has 799 transitions (discarded 1447 similar events)
[2024-05-28 06:55:55] [INFO ] Invariant cache hit.
[2024-05-28 06:55:55] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-28 06:55:55] [INFO ] Flow matrix only has 799 transitions (discarded 1447 similar events)
[2024-05-28 06:55:55] [INFO ] Invariant cache hit.
[2024-05-28 06:55:55] [INFO ] State equation strengthened by 253 read => feed constraints.
[2024-05-28 06:55:56] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
Running 1705 sub problems to find dead transitions.
[2024-05-28 06:55:56] [INFO ] Flow matrix only has 799 transitions (discarded 1447 similar events)
[2024-05-28 06:55:56] [INFO ] Invariant cache hit.
[2024-05-28 06:55:56] [INFO ] State equation strengthened by 253 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1705 unsolved
At refinement iteration 1 (OVERLAPS) 2/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1705 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1705 unsolved
At refinement iteration 3 (OVERLAPS) 798/916 variables, 118/119 constraints. Problems are: Problem set: 0 solved, 1705 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/916 variables, 253/372 constraints. Problems are: Problem set: 0 solved, 1705 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 916/917 variables, and 372 constraints, problems are : Problem set: 0 solved, 1705 unsolved in 30051 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 118/118 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 1705/1705 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1705 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1705 unsolved
At refinement iteration 1 (OVERLAPS) 2/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1705 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1705 unsolved
At refinement iteration 3 (OVERLAPS) 798/916 variables, 118/119 constraints. Problems are: Problem set: 0 solved, 1705 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/916 variables, 253/372 constraints. Problems are: Problem set: 0 solved, 1705 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 916/917 variables, and 2077 constraints, problems are : Problem set: 0 solved, 1705 unsolved in 30454 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 118/118 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 1705/1705 constraints, Known Traps: 0/0 constraints]
After SMT, in 70315ms problems are : Problem set: 0 solved, 1705 unsolved
Search for dead transitions found 0 dead transitions in 70331ms
Starting structural reductions in LTL mode, iteration 1 : 118/138 places, 2246/2291 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100655 ms. Remains : 118/138 places, 2246/2291 transitions.
Stuttering acceptance computed with spot in 385 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : SemanticWebServices-PT-S256P18-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 2226 steps with 0 reset in 158 ms.
FORMULA SemanticWebServices-PT-S256P18-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S256P18-LTLCardinality-00 finished in 101276 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' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2291/2291 transitions.
Graph (complete) has 921 edges and 138 vertex of which 131 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.14 ms
Discarding 7 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 127 transition count 2259
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 37 place count 120 transition count 2252
Iterating global reduction 1 with 7 rules applied. Total rules applied 44 place count 120 transition count 2252
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 46 place count 120 transition count 2250
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 51 place count 115 transition count 2245
Iterating global reduction 2 with 5 rules applied. Total rules applied 56 place count 115 transition count 2245
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 62 place count 109 transition count 2239
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 109 transition count 2239
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 73 place count 104 transition count 2234
Iterating global reduction 2 with 5 rules applied. Total rules applied 78 place count 104 transition count 2234
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 81 place count 101 transition count 2231
Iterating global reduction 2 with 3 rules applied. Total rules applied 84 place count 101 transition count 2231
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 87 place count 98 transition count 2228
Iterating global reduction 2 with 3 rules applied. Total rules applied 90 place count 98 transition count 2228
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 96 transition count 2226
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 96 transition count 2226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 95 transition count 2225
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 95 transition count 2225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 97 place count 95 transition count 2224
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 95 transition count 2223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 99 place count 94 transition count 2223
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 100 place count 93 transition count 2222
Iterating global reduction 4 with 1 rules applied. Total rules applied 101 place count 93 transition count 2222
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 102 place count 92 transition count 2221
Iterating global reduction 4 with 1 rules applied. Total rules applied 103 place count 92 transition count 2221
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 105 place count 90 transition count 2219
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 90 transition count 2219
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 109 place count 88 transition count 2217
Iterating global reduction 4 with 2 rules applied. Total rules applied 111 place count 88 transition count 2217
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 113 place count 86 transition count 2215
Iterating global reduction 4 with 2 rules applied. Total rules applied 115 place count 86 transition count 2215
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 117 place count 84 transition count 2213
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 84 transition count 2213
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 120 place count 83 transition count 2212
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 83 transition count 2212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 122 place count 83 transition count 2211
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 123 place count 83 transition count 2210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 124 place count 82 transition count 2210
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 125 place count 81 transition count 2209
Iterating global reduction 6 with 1 rules applied. Total rules applied 126 place count 81 transition count 2209
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 128 place count 79 transition count 2207
Iterating global reduction 6 with 2 rules applied. Total rules applied 130 place count 79 transition count 2207
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 133 place count 76 transition count 2204
Iterating global reduction 6 with 3 rules applied. Total rules applied 136 place count 76 transition count 2204
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 139 place count 73 transition count 2201
Iterating global reduction 6 with 3 rules applied. Total rules applied 142 place count 73 transition count 2201
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 145 place count 70 transition count 2198
Iterating global reduction 6 with 3 rules applied. Total rules applied 148 place count 70 transition count 2198
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 151 place count 67 transition count 2195
Iterating global reduction 6 with 3 rules applied. Total rules applied 154 place count 67 transition count 2195
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 157 place count 67 transition count 2192
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 158 place count 67 transition count 2191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 159 place count 66 transition count 2191
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 160 place count 66 transition count 2190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 161 place count 65 transition count 2190
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 163 place count 65 transition count 2188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 164 place count 64 transition count 2188
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 165 place count 64 transition count 2187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 166 place count 63 transition count 2187
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 167 place count 62 transition count 2186
Iterating global reduction 11 with 1 rules applied. Total rules applied 168 place count 62 transition count 2186
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 170 place count 60 transition count 2184
Iterating global reduction 11 with 2 rules applied. Total rules applied 172 place count 60 transition count 2184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 174 place count 60 transition count 2182
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 175 place count 60 transition count 2181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 176 place count 59 transition count 2181
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 177 place count 58 transition count 2180
Iterating global reduction 13 with 1 rules applied. Total rules applied 178 place count 58 transition count 2180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 179 place count 58 transition count 2179
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 180 place count 58 transition count 2178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 181 place count 57 transition count 2178
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 182 place count 57 transition count 2177
Applied a total of 182 rules in 2021 ms. Remains 57 /138 variables (removed 81) and now considering 2177/2291 (removed 114) transitions.
Running 1634 sub problems to find dead transitions.
[2024-05-28 06:57:09] [INFO ] Flow matrix only has 739 transitions (discarded 1438 similar events)
Normalized transition count is 719 out of 739 initially.
// Phase 1: matrix 719 rows 57 cols
[2024-05-28 06:57:09] [INFO ] Computed 1 invariants in 12 ms
[2024-05-28 06:57:09] [INFO ] State equation strengthened by 194 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 1 (OVERLAPS) 736/789 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/789 variables, 193/246 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/789 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
SMT process timed out in 29508ms, After SMT, problems are : Problem set: 0 solved, 1634 unsolved
Search for dead transitions found 0 dead transitions in 29529ms
[2024-05-28 06:57:38] [INFO ] Flow matrix only has 739 transitions (discarded 1438 similar events)
[2024-05-28 06:57:38] [INFO ] Invariant cache hit.
[2024-05-28 06:57:38] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-28 06:57:38] [INFO ] Flow matrix only has 739 transitions (discarded 1438 similar events)
[2024-05-28 06:57:38] [INFO ] Invariant cache hit.
[2024-05-28 06:57:38] [INFO ] State equation strengthened by 194 read => feed constraints.
[2024-05-28 06:57:39] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
[2024-05-28 06:57:42] [INFO ] Redundant transitions in 3353 ms returned [6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 111, 112, 113, 114, 115, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 159, 160, 161, 162, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 176, 177, 178, 179, 180, 181, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 201, 202, 203, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 269, 270, 273, 274, 275, 276, 277, 278, 279, 280, 281, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 301, 303, 304, 305, 306, 307, 308, 309, 310, 311, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 349, 350, 351, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 401, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 425, 426, 427, 428, 429, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 476, 478, 479, 480, 481, 482, 483, 484, 485, 486, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 544, 545, 546, 590, 602, 603, 606, 616, 617, 618, 628, 631, 640, 641, 644, 653, 655, 656, 666, 673, 674, 675, 676, 678, 679, 680, 686, 707, 713, 714, 715, 716, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 1016, 1018, 1019, 1020, 1021, 1022, 1023, 1024, 1025, 1026, 1027, 1028, 1029, 1030, 1031, 1032, 1033, 1034, 1035, 1036, 1037, 1038, 1039, 1040, 1041, 1042, 1043, 1044, 1045, 1046, 1047, 1048, 1050, 1057, 1058, 1059, 1060, 1061, 1062, 1078, 1079, 1080, 1081, 1082, 1083, 1084, 1085, 1086, 1087, 1088, 1089, 1090, 1111, 1112, 1113, 1114, 1115, 1116, 1117, 1118, 1119, 1120, 1121, 1122, 1123, 1139, 1140, 1141, 1142, 1143, 1144, 1151, 1154, 1162, 1163, 1164, 1165, 1166, 1178, 1189, 1190, 1191, 1192, 1193, 1194, 1195, 1196, 1197, 1198, 1209, 1211, 1213, 1216, 1220, 1235, 1240, 1241, 1242, 1243, 1244, 1245, 1246, 1247, 1248, 1249, 1255, 1256, 1258, 1259, 1261, 1263, 1265, 1267, 1269, 1272, 1285, 1287, 1289, 1292, 1296, 1300, 1301, 1302, 1303, 1304, 1306, 1307, 1308, 1310, 1311, 1312, 1314, 1315, 1317, 1319, 1326, 1327, 1329, 1330, 1332, 1334, 1336, 1338, 1340, 1343, 1346, 1347, 1348, 1349, 1350, 1352, 1354, 1355, 1356, 1358, 1359, 1360, 1362, 1363, 1365, 1367, 1369, 1370, 1371, 1372, 1373, 1375, 1376, 1382, 1383, 1384, 1391, 1392, 1393, 1394, 1395, 1396, 1397, 1398, 1399, 1400, 1401, 1402, 1403, 1404, 1405, 1411, 1412, 1413, 1420, 1421, 1422, 1425, 1426, 1427, 1428, 1429, 1430, 1431, 1432, 1433, 1434, 1435, 1436, 1437, 1438, 1439, 1440, 1441, 1442, 1443, 1444, 1445, 1446, 1447, 1448, 1449, 1458, 1459, 1460, 1461, 1462, 1463, 1464, 1465, 1466, 1467, 1468, 1469, 1470, 1471, 1472, 1473, 1474, 1475, 1488, 1489, 1490, 1491, 1492, 1493, 1494, 1495, 1496, 1497, 1498, 1499, 1500, 1501, 1502, 1503, 1504, 1505, 1506, 1507, 1508, 1515, 1516, 1517, 1518, 1519, 1520, 1521, 1522, 1523, 1524, 1525, 1526, 1527, 1528, 1529, 1530, 1531, 1532, 1533, 1534, 1535, 1536, 1542, 1543, 1544, 1545, 1546, 1547, 1548, 1549, 1550, 1551, 1552, 1553, 1554, 1555, 1556, 1557, 1558, 1559, 1560, 1561, 1562, 1563, 1564, 1565, 1566, 1567, 1568, 1569, 1570, 1571, 1572, 1573, 1574, 1575, 1576, 1577, 1578, 1579, 1580, 1581, 1591, 1592, 1593, 1594, 1595, 1596, 1597, 1598, 1599, 1600, 1601, 1602, 1603, 1604, 1605, 1606, 1607, 1608, 1609, 1610, 1611, 1612, 1613, 1614, 1615, 1616, 1617, 1618, 1619, 1620, 1621, 1622, 1623, 1624, 1625, 1626, 1627, 1628, 1629, 1630, 1631, 1632, 1633, 1634, 1635, 1636, 1637, 1638, 1639, 1640, 1641, 1642, 1643, 1644, 1645, 1659, 1660, 1661, 1662, 1663, 1664, 1665, 1666, 1667, 1668, 1669, 1670, 1671, 1672, 1673, 1674, 1675, 1676, 1677, 1678, 1679, 1680, 1681, 1682, 1683, 1684, 1685, 1686, 1688, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702, 1703, 1704, 1705, 1706, 1707, 1708, 1709, 1710, 1711, 1712, 1713, 1714, 1715, 1716, 1717, 1718, 1719, 1720, 1721, 1722, 1723, 1724, 1725, 1726, 1727, 1728, 1729, 1730, 1731, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748, 1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771, 1772, 1773, 1774, 1775, 1776, 1777, 1778, 1779, 1780, 1781, 1782, 1783, 1784, 1785, 1786, 1787, 1788, 1789, 1790, 1791, 1792, 1793, 1794, 1795, 1796, 1797, 1798, 1799, 1800, 1801, 1802, 1816, 1817, 1818, 1819, 1820, 1821, 1822, 1823, 1824, 1825, 1826, 1827, 1828, 1829, 1830, 1831, 1832, 1833, 1834, 1835, 1836, 1837, 1838, 1839, 1840, 1841, 1842, 1843, 1844, 1845, 1846, 1847, 1848, 1849, 1850, 1851, 1852, 1853, 1854, 1855, 1856, 1857, 1858, 1859, 1860, 1861, 1862, 1863, 1864, 1865, 1866, 1867, 1868, 1869, 1870, 1871, 1872, 1873, 1874, 1875, 1876, 1877, 1878, 1879, 1880, 1881, 1882, 1883, 1884, 1885, 1886, 1887, 1888, 1889, 1890, 1891, 1892, 1893, 1894, 1895, 1896, 1897, 1898, 1899, 1900, 1901, 1902, 1903, 1904, 1905, 1906, 1907, 1908, 1909, 1910, 1911, 1912, 1913, 1914, 1915, 1916, 1917, 1918, 1919, 1920, 1921, 1922, 1923, 1924, 1925, 1926, 1927, 1928, 1929, 1930, 1931, 1932, 1933, 1934, 1935, 1936, 1937, 1938, 1939, 1940, 1941, 1942, 1943, 1944, 1945, 1952, 1953, 1954, 1955, 1956, 1957, 1958, 1959, 1960, 1961, 1962, 1963, 1964, 1965, 1966, 1967, 1968, 1969, 1970, 1971, 1972, 1973, 1974, 1975, 1976, 1977, 1978, 1979, 1980, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022, 2023, 2024, 2025, 2026, 2027, 2028, 2029, 2030, 2031, 2032, 2033, 2034, 2035, 2036, 2037, 2038, 2039, 2040, 2041, 2042, 2043, 2044, 2045, 2046, 2047, 2048, 2049, 2050, 2051, 2052, 2053, 2054, 2055, 2056, 2057, 2058, 2060, 2061, 2062, 2063, 2064, 2065, 2066, 2067, 2068, 2069, 2070, 2071, 2072, 2073, 2074, 2075, 2076, 2077, 2078, 2079, 2080, 2081, 2082, 2083, 2084, 2085, 2086, 2087, 2088, 2089, 2090, 2091, 2092, 2093, 2094, 2095, 2096, 2097, 2098, 2099, 2100, 2101, 2102, 2103, 2104, 2105, 2106, 2107, 2108, 2109, 2110, 2111, 2112, 2113, 2114, 2115, 2116, 2117, 2118, 2119, 2120, 2121, 2122, 2123, 2124, 2125, 2126, 2127, 2128, 2129, 2130, 2131, 2132, 2133, 2134, 2135, 2136, 2137, 2138, 2139, 2140, 2141, 2142, 2143, 2144, 2145, 2146, 2147, 2148, 2149, 2150, 2151, 2152, 2153, 2154, 2155, 2156, 2157, 2158, 2159, 2160, 2161, 2162, 2163, 2164, 2165, 2166, 2167, 2168, 2169, 2170, 2171, 2172, 2173, 2174, 2175, 2176]
Found 1406 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1406 transitions
Redundant transitions reduction (with SMT) removed 1406 transitions.
Running 726 sub problems to find dead transitions.
[2024-05-28 06:57:42] [INFO ] Flow matrix only has 180 transitions (discarded 591 similar events)
// Phase 1: matrix 180 rows 57 cols
[2024-05-28 06:57:42] [INFO ] Computed 1 invariants in 2 ms
[2024-05-28 06:57:42] [INFO ] State equation strengthened by 133 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (OVERLAPS) 174/224 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 132/182 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 4 (OVERLAPS) 5/229 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 6 (OVERLAPS) 1/230 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 8 (OVERLAPS) 2/232 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 11 (OVERLAPS) 0/232 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 726 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/237 variables, and 189 constraints, problems are : Problem set: 0 solved, 726 unsolved in 22236 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/57 constraints, ReadFeed: 133/133 constraints, PredecessorRefiner: 726/726 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 726 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (OVERLAPS) 174/224 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 132/182 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 140/322 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 5 (OVERLAPS) 5/229 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 584/909 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 8 (OVERLAPS) 1/230 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 10 (OVERLAPS) 2/232 variables, 2/912 constraints. Problems are: Problem set: 0 solved, 726 unsolved
SMT process timed out in 53109ms, After SMT, problems are : Problem set: 0 solved, 726 unsolved
Search for dead transitions found 0 dead transitions in 53115ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/138 places, 771/2291 transitions.
Graph (complete) has 557 edges and 57 vertex of which 54 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 54 transition count 768
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 7 place count 51 transition count 692
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 51 transition count 692
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 13 place count 51 transition count 689
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 50 transition count 637
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 50 transition count 637
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 50 transition count 636
Applied a total of 16 rules in 27 ms. Remains 50 /57 variables (removed 7) and now considering 636/771 (removed 135) transitions.
[2024-05-28 06:58:35] [INFO ] Flow matrix only has 171 transitions (discarded 465 similar events)
// Phase 1: matrix 171 rows 50 cols
[2024-05-28 06:58:35] [INFO ] Computed 1 invariants in 2 ms
[2024-05-28 06:58:35] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-28 06:58:35] [INFO ] Flow matrix only has 171 transitions (discarded 465 similar events)
[2024-05-28 06:58:35] [INFO ] Invariant cache hit.
[2024-05-28 06:58:35] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-28 06:58:36] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/138 places, 636/2291 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 88984 ms. Remains : 50/138 places, 636/2291 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S256P18-LTLCardinality-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S256P18-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S256P18-LTLCardinality-01 finished in 89106 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(F(p0)))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2291/2291 transitions.
Ensure Unique test removed 4 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 133 transition count 2291
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 11 place count 127 transition count 2285
Iterating global reduction 1 with 6 rules applied. Total rules applied 17 place count 127 transition count 2285
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 127 transition count 2283
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 22 place count 124 transition count 2280
Iterating global reduction 2 with 3 rules applied. Total rules applied 25 place count 124 transition count 2280
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 28 place count 121 transition count 2277
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 121 transition count 2277
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 119 transition count 2275
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 119 transition count 2275
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 117 transition count 2273
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 117 transition count 2273
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 116 transition count 2272
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 116 transition count 2272
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 115 transition count 2271
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 115 transition count 2271
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 114 transition count 2270
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 114 transition count 2270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 114 transition count 2269
Applied a total of 46 rules in 53 ms. Remains 114 /138 variables (removed 24) and now considering 2269/2291 (removed 22) transitions.
Running 1699 sub problems to find dead transitions.
[2024-05-28 06:58:36] [INFO ] Flow matrix only has 823 transitions (discarded 1446 similar events)
Normalized transition count is 803 out of 823 initially.
// Phase 1: matrix 803 rows 114 cols
[2024-05-28 06:58:36] [INFO ] Computed 1 invariants in 6 ms
[2024-05-28 06:58:36] [INFO ] State equation strengthened by 248 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 1 (OVERLAPS) 2/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 3 (OVERLAPS) 821/934 variables, 113/114 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
SMT process timed out in 29883ms, After SMT, problems are : Problem set: 0 solved, 1699 unsolved
Search for dead transitions found 0 dead transitions in 29900ms
[2024-05-28 06:59:06] [INFO ] Flow matrix only has 823 transitions (discarded 1446 similar events)
[2024-05-28 06:59:06] [INFO ] Invariant cache hit.
[2024-05-28 06:59:06] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-28 06:59:06] [INFO ] Flow matrix only has 823 transitions (discarded 1446 similar events)
[2024-05-28 06:59:06] [INFO ] Invariant cache hit.
[2024-05-28 06:59:06] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-28 06:59:06] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
Running 1699 sub problems to find dead transitions.
[2024-05-28 06:59:06] [INFO ] Flow matrix only has 823 transitions (discarded 1446 similar events)
[2024-05-28 06:59:06] [INFO ] Invariant cache hit.
[2024-05-28 06:59:06] [INFO ] State equation strengthened by 248 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 1 (OVERLAPS) 2/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 3 (OVERLAPS) 821/934 variables, 113/114 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/934 variables, 248/362 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 934/937 variables, and 362 constraints, problems are : Problem set: 0 solved, 1699 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/114 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 1699/1699 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1699 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 1 (OVERLAPS) 2/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 3 (OVERLAPS) 821/934 variables, 113/114 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/934 variables, 248/362 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/934 variables, 89/451 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 934/937 variables, and 451 constraints, problems are : Problem set: 0 solved, 1699 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/114 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 89/1699 constraints, Known Traps: 0/0 constraints]
After SMT, in 69616ms problems are : Problem set: 0 solved, 1699 unsolved
Search for dead transitions found 0 dead transitions in 69631ms
Starting structural reductions in LTL mode, iteration 1 : 114/138 places, 2269/2291 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100153 ms. Remains : 114/138 places, 2269/2291 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S256P18-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 854 ms.
Product exploration explored 100000 steps with 50000 reset in 745 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S256P18-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S256P18-LTLCardinality-02 finished in 101994 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' '!((F(p0)||X(G(p1))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2291/2291 transitions.
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 132 transition count 2262
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 126 transition count 2256
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 126 transition count 2256
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 49 place count 126 transition count 2254
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 123 transition count 2251
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 123 transition count 2251
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 120 transition count 2248
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 120 transition count 2248
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 118 transition count 2246
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 118 transition count 2246
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 117 transition count 2245
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 117 transition count 2245
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 116 transition count 2244
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 116 transition count 2244
Applied a total of 69 rules in 41 ms. Remains 116 /138 variables (removed 22) and now considering 2244/2291 (removed 47) transitions.
Running 1703 sub problems to find dead transitions.
[2024-05-28 07:00:18] [INFO ] Flow matrix only has 797 transitions (discarded 1447 similar events)
Normalized transition count is 777 out of 797 initially.
// Phase 1: matrix 777 rows 116 cols
[2024-05-28 07:00:18] [INFO ] Computed 1 invariants in 5 ms
[2024-05-28 07:00:18] [INFO ] State equation strengthened by 251 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1703 unsolved
At refinement iteration 1 (OVERLAPS) 2/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1703 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1703 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 796/912 variables, 116/117 constraints. Problems are: Problem set: 0 solved, 1703 unsolved
SMT process timed out in 29718ms, After SMT, problems are : Problem set: 0 solved, 1703 unsolved
Search for dead transitions found 0 dead transitions in 29736ms
[2024-05-28 07:00:47] [INFO ] Flow matrix only has 797 transitions (discarded 1447 similar events)
[2024-05-28 07:00:47] [INFO ] Invariant cache hit.
[2024-05-28 07:00:48] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-28 07:00:48] [INFO ] Flow matrix only has 797 transitions (discarded 1447 similar events)
[2024-05-28 07:00:48] [INFO ] Invariant cache hit.
[2024-05-28 07:00:48] [INFO ] State equation strengthened by 251 read => feed constraints.
[2024-05-28 07:00:48] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
Running 1703 sub problems to find dead transitions.
[2024-05-28 07:00:48] [INFO ] Flow matrix only has 797 transitions (discarded 1447 similar events)
[2024-05-28 07:00:48] [INFO ] Invariant cache hit.
[2024-05-28 07:00:48] [INFO ] State equation strengthened by 251 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1703 unsolved
At refinement iteration 1 (OVERLAPS) 2/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1703 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1703 unsolved
At refinement iteration 3 (OVERLAPS) 796/912 variables, 116/117 constraints. Problems are: Problem set: 0 solved, 1703 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/912 variables, 251/368 constraints. Problems are: Problem set: 0 solved, 1703 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 912/913 variables, and 368 constraints, problems are : Problem set: 0 solved, 1703 unsolved in 30061 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 1703/1703 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1703 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1703 unsolved
At refinement iteration 1 (OVERLAPS) 2/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1703 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1703 unsolved
At refinement iteration 3 (OVERLAPS) 796/912 variables, 116/117 constraints. Problems are: Problem set: 0 solved, 1703 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/912 variables, 251/368 constraints. Problems are: Problem set: 0 solved, 1703 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 912/913 variables, and 2071 constraints, problems are : Problem set: 0 solved, 1703 unsolved in 30721 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 1703/1703 constraints, Known Traps: 0/0 constraints]
After SMT, in 70317ms problems are : Problem set: 0 solved, 1703 unsolved
Search for dead transitions found 0 dead transitions in 70334ms
Starting structural reductions in LTL mode, iteration 1 : 116/138 places, 2244/2291 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100723 ms. Remains : 116/138 places, 2244/2291 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S256P18-LTLCardinality-03
Stuttering criterion allowed to conclude after 6346 steps with 2 reset in 138 ms.
FORMULA SemanticWebServices-PT-S256P18-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S256P18-LTLCardinality-03 finished in 101039 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((X((p1 U p2))||p0))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2291/2291 transitions.
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 132 transition count 2262
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 127 transition count 2257
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 127 transition count 2257
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 47 place count 127 transition count 2255
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 124 transition count 2252
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 124 transition count 2252
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 121 transition count 2249
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 121 transition count 2249
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 119 transition count 2247
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 119 transition count 2247
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 117 transition count 2245
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 117 transition count 2245
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 69 place count 115 transition count 2243
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 115 transition count 2243
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 114 transition count 2242
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 114 transition count 2242
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 113 transition count 2241
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 113 transition count 2241
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 113 transition count 2240
Applied a total of 76 rules in 70 ms. Remains 113 /138 variables (removed 25) and now considering 2240/2291 (removed 51) transitions.
Running 1699 sub problems to find dead transitions.
[2024-05-28 07:01:59] [INFO ] Flow matrix only has 794 transitions (discarded 1446 similar events)
Normalized transition count is 774 out of 794 initially.
// Phase 1: matrix 774 rows 113 cols
[2024-05-28 07:01:59] [INFO ] Computed 1 invariants in 18 ms
[2024-05-28 07:01:59] [INFO ] State equation strengthened by 248 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 1 (OVERLAPS) 2/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 793/906 variables, 113/114 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
SMT process timed out in 29942ms, After SMT, problems are : Problem set: 0 solved, 1699 unsolved
Search for dead transitions found 0 dead transitions in 29961ms
[2024-05-28 07:02:29] [INFO ] Flow matrix only has 794 transitions (discarded 1446 similar events)
[2024-05-28 07:02:29] [INFO ] Invariant cache hit.
[2024-05-28 07:02:29] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-28 07:02:29] [INFO ] Flow matrix only has 794 transitions (discarded 1446 similar events)
[2024-05-28 07:02:29] [INFO ] Invariant cache hit.
[2024-05-28 07:02:29] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-28 07:02:29] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
Running 1699 sub problems to find dead transitions.
[2024-05-28 07:02:29] [INFO ] Flow matrix only has 794 transitions (discarded 1446 similar events)
[2024-05-28 07:02:29] [INFO ] Invariant cache hit.
[2024-05-28 07:02:29] [INFO ] State equation strengthened by 248 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 1 (OVERLAPS) 2/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 3 (OVERLAPS) 793/906 variables, 113/114 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/906 variables, 248/362 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 906/907 variables, and 362 constraints, problems are : Problem set: 0 solved, 1699 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 1699/1699 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1699 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 1 (OVERLAPS) 2/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 3 (OVERLAPS) 793/906 variables, 113/114 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/906 variables, 248/362 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 906/907 variables, and 2061 constraints, problems are : Problem set: 0 solved, 1699 unsolved in 30348 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 1699/1699 constraints, Known Traps: 0/0 constraints]
After SMT, in 69881ms problems are : Problem set: 0 solved, 1699 unsolved
Search for dead transitions found 0 dead transitions in 69898ms
Starting structural reductions in LTL mode, iteration 1 : 113/138 places, 2240/2291 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100514 ms. Remains : 113/138 places, 2240/2291 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true]
Running random walk in product with property : SemanticWebServices-PT-S256P18-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 1964 ms.
Product exploration explored 100000 steps with 0 reset in 2091 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 228 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true]
RANDOM walk for 40090 steps (8 resets) in 1128 ms. (35 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 3/3 properties
[2024-05-28 07:03:45] [INFO ] Flow matrix only has 794 transitions (discarded 1446 similar events)
[2024-05-28 07:03:45] [INFO ] Invariant cache hit.
[2024-05-28 07:03:45] [INFO ] State equation strengthened by 248 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/17 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 12/29 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 5/34 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/34 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 6/40 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 4/44 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/44 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 15/59 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/59 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 15/74 variables, 15/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/74 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 17/91 variables, 15/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/91 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 17/108 variables, 17/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/108 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 14/122 variables, 15/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/122 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/122 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 14/136 variables, 14/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/136 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 6/142 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/142 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/142 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 6/148 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/148 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 0/148 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/907 variables, and 141 constraints, problems are : Problem set: 0 solved, 3 unsolved in 172 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 74/113 constraints, ReadFeed: 66/248 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/17 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 12/29 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 5/34 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/34 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/40 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 4/44 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/44 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 15/59 variables, 15/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/59 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 15/74 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/74 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 17/91 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/91 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 17/108 variables, 17/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/108 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 14/122 variables, 15/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/122 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/122 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 14/136 variables, 14/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/136 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 6/142 variables, 10/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/142 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/142 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 6/148 variables, 6/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/148 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 0/148 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/907 variables, and 144 constraints, problems are : Problem set: 0 solved, 3 unsolved in 196 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 74/113 constraints, ReadFeed: 66/248 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 433ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 23 steps, including 1 resets, run visited all 3 properties in 1 ms. (steps per millisecond=23 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 272 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true]
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 2240/2240 transitions.
Applied a total of 0 rules in 5 ms. Remains 113 /113 variables (removed 0) and now considering 2240/2240 (removed 0) transitions.
Running 1699 sub problems to find dead transitions.
[2024-05-28 07:03:46] [INFO ] Flow matrix only has 794 transitions (discarded 1446 similar events)
[2024-05-28 07:03:46] [INFO ] Invariant cache hit.
[2024-05-28 07:03:46] [INFO ] State equation strengthened by 248 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 1 (OVERLAPS) 2/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 793/906 variables, 113/114 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
SMT process timed out in 31003ms, After SMT, problems are : Problem set: 0 solved, 1699 unsolved
Search for dead transitions found 0 dead transitions in 31032ms
[2024-05-28 07:04:17] [INFO ] Flow matrix only has 794 transitions (discarded 1446 similar events)
[2024-05-28 07:04:17] [INFO ] Invariant cache hit.
[2024-05-28 07:04:17] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-28 07:04:17] [INFO ] Flow matrix only has 794 transitions (discarded 1446 similar events)
[2024-05-28 07:04:17] [INFO ] Invariant cache hit.
[2024-05-28 07:04:17] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-28 07:04:17] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
Running 1699 sub problems to find dead transitions.
[2024-05-28 07:04:17] [INFO ] Flow matrix only has 794 transitions (discarded 1446 similar events)
[2024-05-28 07:04:17] [INFO ] Invariant cache hit.
[2024-05-28 07:04:17] [INFO ] State equation strengthened by 248 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 1 (OVERLAPS) 2/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 3 (OVERLAPS) 793/906 variables, 113/114 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/906 variables, 248/362 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 906/907 variables, and 362 constraints, problems are : Problem set: 0 solved, 1699 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 1699/1699 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1699 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 1 (OVERLAPS) 2/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 3 (OVERLAPS) 793/906 variables, 113/114 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/906 variables, 248/362 constraints. Problems are: Problem set: 0 solved, 1699 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 906/907 variables, and 2061 constraints, problems are : Problem set: 0 solved, 1699 unsolved in 30487 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 1699/1699 constraints, Known Traps: 0/0 constraints]
After SMT, in 69950ms problems are : Problem set: 0 solved, 1699 unsolved
Search for dead transitions found 0 dead transitions in 69965ms
Finished structural reductions in LTL mode , in 1 iterations and 101613 ms. Remains : 113/113 places, 2240/2240 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 111 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true]
RANDOM walk for 40017 steps (8 resets) in 614 ms. (65 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
[2024-05-28 07:05:28] [INFO ] Flow matrix only has 794 transitions (discarded 1446 similar events)
[2024-05-28 07:05:28] [INFO ] Invariant cache hit.
[2024-05-28 07:05:28] [INFO ] State equation strengthened by 248 read => feed constraints.
All remaining problems are real, not stopping.
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) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/14 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/25 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/30 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/36 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/36 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/40 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/40 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 15/55 variables, 15/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/55 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 15/70 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/70 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 17/87 variables, 15/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/87 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 17/104 variables, 17/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/104 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 15/119 variables, 15/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/119 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/119 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 15/134 variables, 15/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/134 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 7/141 variables, 12/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/141 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/141 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 7/148 variables, 7/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/148 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/148 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/907 variables, and 141 constraints, problems are : Problem set: 0 solved, 1 unsolved in 90 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 74/113 constraints, ReadFeed: 66/248 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) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/14 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/25 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/30 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/30 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/36 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/36 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/40 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/40 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 15/55 variables, 15/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/55 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 15/70 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/70 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 17/87 variables, 15/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/87 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 17/104 variables, 17/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/104 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 15/119 variables, 15/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/119 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/119 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 15/134 variables, 15/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/134 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 7/141 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/141 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/141 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 7/148 variables, 7/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/148 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/148 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/907 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 102 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 74/113 constraints, ReadFeed: 66/248 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 240ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 22 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 257 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true]
Product exploration explored 100000 steps with 0 reset in 1803 ms.
Product exploration explored 100000 steps with 1 reset in 1820 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true]
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 2240/2240 transitions.
Graph (complete) has 847 edges and 113 vertex of which 107 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 106 transition count 2236
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 106 transition count 2236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 105 transition count 2235
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 105 transition count 2235
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 7 place count 103 transition count 2233
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 103 transition count 2233
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 11 place count 101 transition count 2231
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 101 transition count 2231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 100 transition count 2230
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 100 transition count 2230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 16 place count 99 transition count 2229
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 99 transition count 2229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 98 transition count 2228
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 98 transition count 2228
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 98 transition count 2225
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 814 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 96 transition count 2224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 95 transition count 2223
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 95 transition count 2223
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 94 transition count 2222
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 94 transition count 2222
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 92 transition count 2220
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 92 transition count 2220
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 90 transition count 2218
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 90 transition count 2218
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 88 transition count 2216
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 88 transition count 2216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 87 transition count 2215
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 87 transition count 2215
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 87 transition count 2214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 86 transition count 2214
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 85 transition count 2213
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 85 transition count 2213
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 83 transition count 2211
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 83 transition count 2211
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 80 transition count 2208
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 80 transition count 2208
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 77 transition count 2205
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 77 transition count 2205
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 65 place count 74 transition count 2202
Iterating global reduction 2 with 3 rules applied. Total rules applied 68 place count 74 transition count 2202
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 72 transition count 2200
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 72 transition count 2200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 74 place count 72 transition count 2198
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 72 transition count 2197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 71 transition count 2197
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 77 place count 71 transition count 2196
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 78 place count 70 transition count 2196
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 79 place count 70 transition count 2195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 80 place count 69 transition count 2195
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 81 place count 69 transition count 2194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 82 place count 68 transition count 2194
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 83 place count 67 transition count 2193
Iterating global reduction 7 with 1 rules applied. Total rules applied 84 place count 67 transition count 2193
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 86 place count 65 transition count 2191
Iterating global reduction 7 with 2 rules applied. Total rules applied 88 place count 65 transition count 2191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 90 place count 65 transition count 2189
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 92 place count 65 transition count 2187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 93 place count 64 transition count 2187
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 96 place count 64 transition count 2184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 97 place count 63 transition count 2184
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 98 place count 63 transition count 2183
Applied a total of 98 rules in 1485 ms. Remains 63 /113 variables (removed 50) and now considering 2183/2240 (removed 57) transitions.
Running 1642 sub problems to find dead transitions.
[2024-05-28 07:05:34] [INFO ] Flow matrix only has 745 transitions (discarded 1438 similar events)
Normalized transition count is 725 out of 745 initially.
// Phase 1: matrix 725 rows 63 cols
[2024-05-28 07:05:34] [INFO ] Computed 0 invariants in 3 ms
[2024-05-28 07:05:34] [INFO ] State equation strengthened by 203 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SemanticWebServices-PT-S256P18

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: 198
TRANSITIONS: 9732
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.385s, Sys 0.043s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.036s, 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: 1030
MODEL NAME: /home/mcc/execution/model
198 places, 9732 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.
Split: SplitSubtract
Start RS construction.
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.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716881247570

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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

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-S256P18"
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-S256P18, 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-171679078800603"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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